2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 INRIA Paris
7 * Copyright 2016 Sven Verdoolaege
9 * Use of this software is governed by the MIT license
11 * Written by Sven Verdoolaege, K.U.Leuven, Departement
12 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
14 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
17 * B.P. 105 - 78153 Le Chesnay, France
18 * and Centre de Recherche Inria de Paris, 2 rue Simone Iff - Voie DQ12,
19 * CS 42112, 75589 Paris Cedex 12, France
23 #include <isl_ctx_private.h>
24 #include <isl_map_private.h>
27 #include <isl/constraint.h>
28 #include "isl_space_private.h"
29 #include "isl_equalities.h"
30 #include <isl_lp_private.h>
34 #include <isl_reordering.h>
35 #include "isl_sample.h"
39 #include <isl_mat_private.h>
40 #include <isl_vec_private.h>
41 #include <isl_dim_map.h>
42 #include <isl_local_space_private.h>
43 #include <isl_aff_private.h>
44 #include <isl_options_private.h>
45 #include <isl_morph.h>
46 #include <isl_val_private.h>
48 #include <bset_to_bmap.c>
49 #include <bset_from_bmap.c>
50 #include <set_to_map.c>
51 #include <set_from_map.c>
53 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
56 case isl_dim_param
: return dim
->nparam
;
57 case isl_dim_in
: return dim
->n_in
;
58 case isl_dim_out
: return dim
->n_out
;
59 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
64 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
67 case isl_dim_param
: return 1;
68 case isl_dim_in
: return 1 + dim
->nparam
;
69 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
74 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
75 enum isl_dim_type type
)
80 case isl_dim_cst
: return 1;
83 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
84 case isl_dim_div
: return bmap
->n_div
;
85 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
90 /* Return the space of "map".
92 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
94 return map
? map
->dim
: NULL
;
97 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
99 return map
? n(map
->dim
, type
) : 0;
102 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
104 return set
? n(set
->dim
, type
) : 0;
107 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
108 enum isl_dim_type type
)
117 case isl_dim_cst
: return 0;
118 case isl_dim_param
: return 1;
119 case isl_dim_in
: return 1 + space
->nparam
;
120 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
121 case isl_dim_div
: return 1 + space
->nparam
+ space
->n_in
+
127 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
128 enum isl_dim_type type
)
130 return isl_basic_map_offset(bset
, type
);
133 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
135 return pos(map
->dim
, type
);
138 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
139 enum isl_dim_type type
)
141 return isl_basic_map_dim(bset
, type
);
144 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
146 return isl_basic_set_dim(bset
, isl_dim_set
);
149 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
151 return isl_basic_set_dim(bset
, isl_dim_param
);
154 unsigned isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
158 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
161 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
163 return isl_set_dim(set
, isl_dim_set
);
166 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
168 return isl_set_dim(set
, isl_dim_param
);
171 unsigned isl_basic_map_n_in(__isl_keep
const isl_basic_map
*bmap
)
173 return bmap
? bmap
->dim
->n_in
: 0;
176 unsigned isl_basic_map_n_out(__isl_keep
const isl_basic_map
*bmap
)
178 return bmap
? bmap
->dim
->n_out
: 0;
181 unsigned isl_basic_map_n_param(__isl_keep
const isl_basic_map
*bmap
)
183 return bmap
? bmap
->dim
->nparam
: 0;
186 unsigned isl_basic_map_n_div(__isl_keep
const isl_basic_map
*bmap
)
188 return bmap
? bmap
->n_div
: 0;
191 unsigned isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
193 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
196 unsigned isl_map_n_in(__isl_keep
const isl_map
*map
)
198 return map
? map
->dim
->n_in
: 0;
201 unsigned isl_map_n_out(__isl_keep
const isl_map
*map
)
203 return map
? map
->dim
->n_out
: 0;
206 unsigned isl_map_n_param(__isl_keep
const isl_map
*map
)
208 return map
? map
->dim
->nparam
: 0;
211 /* Return the number of equality constraints in the description of "bmap".
212 * Return -1 on error.
214 int isl_basic_map_n_equality(__isl_keep isl_basic_map
*bmap
)
221 /* Return the number of equality constraints in the description of "bset".
222 * Return -1 on error.
224 int isl_basic_set_n_equality(__isl_keep isl_basic_set
*bset
)
226 return isl_basic_map_n_equality(bset_to_bmap(bset
));
229 /* Return the number of inequality constraints in the description of "bmap".
230 * Return -1 on error.
232 int isl_basic_map_n_inequality(__isl_keep isl_basic_map
*bmap
)
239 /* Return the number of inequality constraints in the description of "bset".
240 * Return -1 on error.
242 int isl_basic_set_n_inequality(__isl_keep isl_basic_set
*bset
)
244 return isl_basic_map_n_inequality(bset_to_bmap(bset
));
247 /* Do "bmap1" and "bmap2" have the same parameters?
249 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
250 __isl_keep isl_basic_map
*bmap2
)
252 isl_space
*space1
, *space2
;
254 space1
= isl_basic_map_peek_space(bmap1
);
255 space2
= isl_basic_map_peek_space(bmap2
);
256 return isl_space_has_equal_params(space1
, space2
);
259 /* Do "map1" and "map2" have the same parameters?
261 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
262 __isl_keep isl_map
*map2
)
264 isl_space
*space1
, *space2
;
266 space1
= isl_map_peek_space(map1
);
267 space2
= isl_map_peek_space(map2
);
268 return isl_space_has_equal_params(space1
, space2
);
271 /* Do "map" and "set" have the same parameters?
273 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
274 __isl_keep isl_set
*set
)
276 return isl_map_has_equal_params(map
, set_to_map(set
));
279 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
280 __isl_keep isl_set
*set
)
284 return isl_bool_error
;
285 m
= isl_map_has_equal_params(map
, set_to_map(set
));
288 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
289 set
->dim
, isl_dim_set
);
292 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
293 __isl_keep isl_basic_set
*bset
)
297 return isl_bool_error
;
298 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
301 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
302 bset
->dim
, isl_dim_set
);
305 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
306 __isl_keep isl_set
*set
)
310 return isl_bool_error
;
311 m
= isl_map_has_equal_params(map
, set_to_map(set
));
314 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
315 set
->dim
, isl_dim_set
);
318 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
319 __isl_keep isl_basic_set
*bset
)
323 return isl_bool_error
;
324 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
327 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
328 bset
->dim
, isl_dim_set
);
331 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
333 return bmap
? bmap
->ctx
: NULL
;
336 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
338 return bset
? bset
->ctx
: NULL
;
341 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
343 return map
? map
->ctx
: NULL
;
346 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
348 return set
? set
->ctx
: NULL
;
351 /* Return the space of "bmap".
353 __isl_keep isl_space
*isl_basic_map_peek_space(
354 __isl_keep
const isl_basic_map
*bmap
)
356 return bmap
? bmap
->dim
: NULL
;
359 /* Return the space of "bset".
361 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
363 return isl_basic_map_peek_space(bset_to_bmap(bset
));
366 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
368 return isl_space_copy(isl_basic_map_peek_space(bmap
));
371 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
373 return isl_basic_map_get_space(bset_to_bmap(bset
));
376 /* Extract the divs in "bmap" as a matrix.
378 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
389 ctx
= isl_basic_map_get_ctx(bmap
);
390 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
391 cols
= 1 + 1 + total
+ bmap
->n_div
;
392 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
396 for (i
= 0; i
< bmap
->n_div
; ++i
)
397 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
402 /* Extract the divs in "bset" as a matrix.
404 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
406 return isl_basic_map_get_divs(bset
);
409 __isl_give isl_local_space
*isl_basic_map_get_local_space(
410 __isl_keep isl_basic_map
*bmap
)
417 div
= isl_basic_map_get_divs(bmap
);
418 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
421 __isl_give isl_local_space
*isl_basic_set_get_local_space(
422 __isl_keep isl_basic_set
*bset
)
424 return isl_basic_map_get_local_space(bset
);
427 /* For each known div d = floor(f/m), add the constraints
430 * -(f-(m-1)) + m d >= 0
432 * Do not finalize the result.
434 static __isl_give isl_basic_map
*add_known_div_constraints(
435 __isl_take isl_basic_map
*bmap
)
442 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
445 bmap
= isl_basic_map_cow(bmap
);
446 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
449 for (i
= 0; i
< n_div
; ++i
) {
450 if (isl_int_is_zero(bmap
->div
[i
][0]))
452 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
453 return isl_basic_map_free(bmap
);
459 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
460 __isl_take isl_local_space
*ls
)
469 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
470 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
471 n_div
, 0, 2 * n_div
);
473 for (i
= 0; i
< n_div
; ++i
)
474 if (isl_basic_map_alloc_div(bmap
) < 0)
477 for (i
= 0; i
< n_div
; ++i
)
478 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
479 bmap
= add_known_div_constraints(bmap
);
481 isl_local_space_free(ls
);
484 isl_local_space_free(ls
);
485 isl_basic_map_free(bmap
);
489 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
490 __isl_take isl_local_space
*ls
)
492 return isl_basic_map_from_local_space(ls
);
495 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
497 return isl_space_copy(isl_map_peek_space(map
));
500 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
504 return isl_space_copy(set
->dim
);
507 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
508 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
510 bmap
= isl_basic_map_cow(bmap
);
513 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
516 bmap
= isl_basic_map_finalize(bmap
);
519 isl_basic_map_free(bmap
);
523 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
524 __isl_take isl_basic_set
*bset
, const char *s
)
526 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
529 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
530 enum isl_dim_type type
)
532 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
535 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
536 enum isl_dim_type type
, const char *s
)
540 map
= isl_map_cow(map
);
544 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
548 for (i
= 0; i
< map
->n
; ++i
) {
549 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
560 /* Replace the identifier of the tuple of type "type" by "id".
562 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
563 __isl_take isl_basic_map
*bmap
,
564 enum isl_dim_type type
, __isl_take isl_id
*id
)
566 bmap
= isl_basic_map_cow(bmap
);
569 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
571 return isl_basic_map_free(bmap
);
572 bmap
= isl_basic_map_finalize(bmap
);
579 /* Replace the identifier of the tuple by "id".
581 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
582 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
584 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
587 /* Does the input or output tuple have a name?
589 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
591 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
594 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
595 enum isl_dim_type type
)
597 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
600 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
603 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
607 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
608 enum isl_dim_type type
, __isl_take isl_id
*id
)
610 map
= isl_map_cow(map
);
614 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
616 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
622 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
623 __isl_take isl_id
*id
)
625 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
628 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
629 enum isl_dim_type type
)
631 map
= isl_map_cow(map
);
635 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
637 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
640 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
642 return isl_map_reset_tuple_id(set
, isl_dim_set
);
645 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
647 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
650 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
651 enum isl_dim_type type
)
653 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
656 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
658 return isl_map_has_tuple_id(set
, isl_dim_set
);
661 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
663 return isl_map_get_tuple_id(set
, isl_dim_set
);
666 /* Does the set tuple have a name?
668 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
671 return isl_bool_error
;
672 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
676 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
678 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
681 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
683 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
686 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
687 enum isl_dim_type type
, unsigned pos
)
689 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
692 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
693 enum isl_dim_type type
, unsigned pos
)
695 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
698 /* Does the given dimension have a name?
700 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
701 enum isl_dim_type type
, unsigned pos
)
704 return isl_bool_error
;
705 return isl_space_has_dim_name(map
->dim
, type
, pos
);
708 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
709 enum isl_dim_type type
, unsigned pos
)
711 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
714 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
715 enum isl_dim_type type
, unsigned pos
)
717 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
720 /* Does the given dimension have a name?
722 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
723 enum isl_dim_type type
, unsigned pos
)
726 return isl_bool_error
;
727 return isl_space_has_dim_name(set
->dim
, type
, pos
);
730 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
731 __isl_take isl_basic_map
*bmap
,
732 enum isl_dim_type type
, unsigned pos
, const char *s
)
734 bmap
= isl_basic_map_cow(bmap
);
737 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
740 return isl_basic_map_finalize(bmap
);
742 isl_basic_map_free(bmap
);
746 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
747 enum isl_dim_type type
, unsigned pos
, const char *s
)
751 map
= isl_map_cow(map
);
755 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
759 for (i
= 0; i
< map
->n
; ++i
) {
760 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
771 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
772 __isl_take isl_basic_set
*bset
,
773 enum isl_dim_type type
, unsigned pos
, const char *s
)
775 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
779 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
780 enum isl_dim_type type
, unsigned pos
, const char *s
)
782 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
786 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
787 enum isl_dim_type type
, unsigned pos
)
790 return isl_bool_error
;
791 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
794 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
795 enum isl_dim_type type
, unsigned pos
)
797 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
800 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
801 enum isl_dim_type type
, unsigned pos
)
803 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
806 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
807 enum isl_dim_type type
, unsigned pos
)
809 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
812 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
813 enum isl_dim_type type
, unsigned pos
)
815 return isl_map_has_dim_id(set
, type
, pos
);
818 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
819 enum isl_dim_type type
, unsigned pos
)
821 return isl_map_get_dim_id(set
, type
, pos
);
824 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
825 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
827 map
= isl_map_cow(map
);
831 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
833 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
839 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
840 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
842 return isl_map_set_dim_id(set
, type
, pos
, id
);
845 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
846 __isl_keep isl_id
*id
)
850 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
853 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
854 __isl_keep isl_id
*id
)
856 return isl_map_find_dim_by_id(set
, type
, id
);
859 /* Return the position of the dimension of the given type and name
861 * Return -1 if no such dimension can be found.
863 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
864 enum isl_dim_type type
, const char *name
)
868 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
871 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
876 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
879 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
882 return isl_map_find_dim_by_name(set
, type
, name
);
885 /* Check whether equality i of bset is a pure stride constraint
886 * on a single dimension, i.e., of the form
890 * with k a constant and e an existentially quantified variable.
892 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
901 return isl_bool_error
;
903 if (!isl_int_is_zero(bset
->eq
[i
][0]))
904 return isl_bool_false
;
906 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
907 d
= isl_basic_set_dim(bset
, isl_dim_set
);
908 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
910 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
911 return isl_bool_false
;
912 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
914 return isl_bool_false
;
915 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
917 return isl_bool_false
;
919 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
921 return isl_bool_false
;
922 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
923 n_div
- pos2
- 1) != -1)
924 return isl_bool_false
;
925 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
926 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
927 return isl_bool_false
;
929 return isl_bool_true
;
932 /* Reset the user pointer on all identifiers of parameters and tuples
933 * of the space of "map".
935 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
939 space
= isl_map_get_space(map
);
940 space
= isl_space_reset_user(space
);
941 map
= isl_map_reset_space(map
, space
);
946 /* Reset the user pointer on all identifiers of parameters and tuples
947 * of the space of "set".
949 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
951 return isl_map_reset_user(set
);
954 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
957 return isl_bool_error
;
958 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
961 /* Has "map" been marked as a rational map?
962 * In particular, have all basic maps in "map" been marked this way?
963 * An empty map is not considered to be rational.
964 * Maps where only some of the basic maps are marked rational
967 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
973 return isl_bool_error
;
975 return isl_bool_false
;
976 rational
= isl_basic_map_is_rational(map
->p
[0]);
979 for (i
= 1; i
< map
->n
; ++i
) {
982 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
985 if (rational
!= rational_i
)
986 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
987 "mixed rational and integer basic maps "
988 "not supported", return isl_bool_error
);
994 /* Has "set" been marked as a rational set?
995 * In particular, have all basic set in "set" been marked this way?
996 * An empty set is not considered to be rational.
997 * Sets where only some of the basic sets are marked rational
1000 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
1002 return isl_map_is_rational(set
);
1005 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
1007 return isl_basic_map_is_rational(bset
);
1010 /* Does "bmap" contain any rational points?
1012 * If "bmap" has an equality for each dimension, equating the dimension
1013 * to an integer constant, then it has no rational points, even if it
1014 * is marked as rational.
1016 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
1018 isl_bool has_rational
= isl_bool_true
;
1022 return isl_bool_error
;
1023 if (isl_basic_map_plain_is_empty(bmap
))
1024 return isl_bool_false
;
1025 if (!isl_basic_map_is_rational(bmap
))
1026 return isl_bool_false
;
1027 bmap
= isl_basic_map_copy(bmap
);
1028 bmap
= isl_basic_map_implicit_equalities(bmap
);
1030 return isl_bool_error
;
1031 total
= isl_basic_map_total_dim(bmap
);
1032 if (bmap
->n_eq
== total
) {
1034 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1035 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1038 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1039 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1041 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1046 if (i
== bmap
->n_eq
)
1047 has_rational
= isl_bool_false
;
1049 isl_basic_map_free(bmap
);
1051 return has_rational
;
1054 /* Does "map" contain any rational points?
1056 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1059 isl_bool has_rational
;
1062 return isl_bool_error
;
1063 for (i
= 0; i
< map
->n
; ++i
) {
1064 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1065 if (has_rational
< 0 || has_rational
)
1066 return has_rational
;
1068 return isl_bool_false
;
1071 /* Does "set" contain any rational points?
1073 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1075 return isl_map_has_rational(set
);
1078 /* Is this basic set a parameter domain?
1080 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1083 return isl_bool_error
;
1084 return isl_space_is_params(bset
->dim
);
1087 /* Is this set a parameter domain?
1089 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1092 return isl_bool_error
;
1093 return isl_space_is_params(set
->dim
);
1096 /* Is this map actually a parameter domain?
1097 * Users should never call this function. Outside of isl,
1098 * a map can never be a parameter domain.
1100 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1103 return isl_bool_error
;
1104 return isl_space_is_params(map
->dim
);
1107 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
1108 struct isl_basic_map
*bmap
, unsigned extra
,
1109 unsigned n_eq
, unsigned n_ineq
)
1112 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
1117 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1118 if (isl_blk_is_error(bmap
->block
))
1121 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1122 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1126 bmap
->block2
= isl_blk_empty();
1129 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1130 if (isl_blk_is_error(bmap
->block2
))
1133 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1138 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1139 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1141 for (i
= 0; i
< extra
; ++i
)
1142 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1146 bmap
->c_size
= n_eq
+ n_ineq
;
1147 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1148 bmap
->extra
= extra
;
1152 bmap
->sample
= NULL
;
1156 isl_basic_map_free(bmap
);
1160 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1161 unsigned nparam
, unsigned dim
, unsigned extra
,
1162 unsigned n_eq
, unsigned n_ineq
)
1164 struct isl_basic_map
*bmap
;
1167 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1171 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1172 return bset_from_bmap(bmap
);
1175 __isl_give isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1176 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1178 struct isl_basic_map
*bmap
;
1181 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1182 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1183 return bset_from_bmap(bmap
);
1185 isl_space_free(dim
);
1189 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1190 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1192 struct isl_basic_map
*bmap
;
1196 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1201 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1203 isl_space_free(dim
);
1207 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1208 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1209 unsigned n_eq
, unsigned n_ineq
)
1211 struct isl_basic_map
*bmap
;
1214 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1218 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1222 static void dup_constraints(
1223 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1226 unsigned total
= isl_basic_map_total_dim(src
);
1228 for (i
= 0; i
< src
->n_eq
; ++i
) {
1229 int j
= isl_basic_map_alloc_equality(dst
);
1230 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1233 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1234 int j
= isl_basic_map_alloc_inequality(dst
);
1235 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1238 for (i
= 0; i
< src
->n_div
; ++i
) {
1239 int j
= isl_basic_map_alloc_div(dst
);
1240 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1242 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1245 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1247 struct isl_basic_map
*dup
;
1251 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1252 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1255 dup_constraints(dup
, bmap
);
1256 dup
->flags
= bmap
->flags
;
1257 dup
->sample
= isl_vec_copy(bmap
->sample
);
1261 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1263 struct isl_basic_map
*dup
;
1265 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1266 return bset_from_bmap(dup
);
1269 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1274 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1278 return isl_basic_set_dup(bset
);
1281 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1290 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1295 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1299 bmap
= isl_basic_map_dup(bmap
);
1301 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1305 __isl_give isl_map
*isl_map_copy(__isl_keep isl_map
*map
)
1314 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1319 if (--bmap
->ref
> 0)
1322 isl_ctx_deref(bmap
->ctx
);
1324 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1326 isl_blk_free(bmap
->ctx
, bmap
->block
);
1327 isl_vec_free(bmap
->sample
);
1328 isl_space_free(bmap
->dim
);
1334 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1336 return isl_basic_map_free(bset_to_bmap(bset
));
1339 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1341 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1344 /* Check that "map" has only named parameters, reporting an error
1347 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1349 return isl_space_check_named_params(isl_map_peek_space(map
));
1352 /* Check that "bmap1" and "bmap2" have the same parameters,
1353 * reporting an error if they do not.
1355 static isl_stat
isl_basic_map_check_equal_params(
1356 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1360 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1362 return isl_stat_error
;
1364 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1365 "parameters don't match", return isl_stat_error
);
1369 __isl_give isl_map
*isl_map_align_params_map_map_and(
1370 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1371 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1372 __isl_take isl_map
*map2
))
1376 if (isl_map_has_equal_params(map1
, map2
))
1377 return fn(map1
, map2
);
1378 if (isl_map_check_named_params(map1
) < 0)
1380 if (isl_map_check_named_params(map2
) < 0)
1382 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1383 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1384 return fn(map1
, map2
);
1391 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1392 __isl_keep isl_map
*map2
,
1393 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1398 return isl_bool_error
;
1399 if (isl_map_has_equal_params(map1
, map2
))
1400 return fn(map1
, map2
);
1401 if (isl_map_check_named_params(map1
) < 0)
1402 return isl_bool_error
;
1403 if (isl_map_check_named_params(map2
) < 0)
1404 return isl_bool_error
;
1405 map1
= isl_map_copy(map1
);
1406 map2
= isl_map_copy(map2
);
1407 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1408 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1415 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1417 struct isl_ctx
*ctx
;
1421 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1422 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1424 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1425 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1426 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1427 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1428 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1429 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1431 int j
= isl_basic_map_alloc_inequality(bmap
);
1435 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1436 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1443 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1444 bmap
->extra
- bmap
->n_div
);
1445 return bmap
->n_eq
++;
1448 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1450 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1453 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1457 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1462 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1464 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1467 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1472 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1474 if (pos
!= bmap
->n_eq
- 1) {
1476 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1477 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1483 /* Turn inequality "pos" of "bmap" into an equality.
1485 * In particular, we move the inequality in front of the equalities
1486 * and move the last inequality in the position of the moved inequality.
1487 * Note that isl_tab_make_equalities_explicit depends on this particular
1488 * change in the ordering of the constraints.
1490 void isl_basic_map_inequality_to_equality(
1491 struct isl_basic_map
*bmap
, unsigned pos
)
1495 t
= bmap
->ineq
[pos
];
1496 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1497 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1502 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1503 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1504 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1505 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1508 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1510 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1513 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1515 struct isl_ctx
*ctx
;
1519 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1520 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1521 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1522 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1523 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1524 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1525 1 + isl_basic_map_total_dim(bmap
),
1526 bmap
->extra
- bmap
->n_div
);
1527 return bmap
->n_ineq
++;
1530 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1532 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1535 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1539 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1544 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1546 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1549 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1554 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1556 if (pos
!= bmap
->n_ineq
- 1) {
1557 t
= bmap
->ineq
[pos
];
1558 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1559 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1560 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1566 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1568 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1571 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1576 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1579 k
= isl_basic_map_alloc_equality(bmap
);
1582 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1585 isl_basic_map_free(bmap
);
1589 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1592 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1595 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1600 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1603 k
= isl_basic_map_alloc_inequality(bmap
);
1606 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1609 isl_basic_map_free(bmap
);
1613 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1616 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1619 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1623 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1624 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1625 1 + 1 + isl_basic_map_total_dim(bmap
),
1626 bmap
->extra
- bmap
->n_div
);
1627 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1628 return bmap
->n_div
++;
1631 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1633 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1636 /* Check that there are "n" dimensions of type "type" starting at "first"
1639 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1640 enum isl_dim_type type
, unsigned first
, unsigned n
)
1645 return isl_stat_error
;
1646 dim
= isl_basic_map_dim(bmap
, type
);
1647 if (first
+ n
> dim
|| first
+ n
< first
)
1648 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1649 "position or range out of bounds",
1650 return isl_stat_error
);
1654 /* Insert an extra integer division, prescribed by "div", to "bmap"
1655 * at (integer division) position "pos".
1657 * The integer division is first added at the end and then moved
1658 * into the right position.
1660 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1661 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1665 bmap
= isl_basic_map_cow(bmap
);
1667 return isl_basic_map_free(bmap
);
1669 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1670 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1671 "unexpected size", return isl_basic_map_free(bmap
));
1672 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1673 return isl_basic_map_free(bmap
);
1675 bmap
= isl_basic_map_extend_space(bmap
,
1676 isl_basic_map_get_space(bmap
), 1, 0, 2);
1677 k
= isl_basic_map_alloc_div(bmap
);
1679 return isl_basic_map_free(bmap
);
1680 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1681 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1683 for (i
= k
; i
> pos
; --i
)
1684 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1689 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1692 return isl_stat_error
;
1693 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1698 /* Copy constraint from src to dst, putting the vars of src at offset
1699 * dim_off in dst and the divs of src at offset div_off in dst.
1700 * If both sets are actually map, then dim_off applies to the input
1703 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1704 struct isl_basic_map
*src_map
, isl_int
*src
,
1705 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1707 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1708 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1709 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1710 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1711 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1712 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1713 isl_int_set(dst
[0], src
[0]);
1714 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1715 if (dst_nparam
> src_nparam
)
1716 isl_seq_clr(dst
+1+src_nparam
,
1717 dst_nparam
- src_nparam
);
1718 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1719 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1721 isl_min(dst_in
-in_off
, src_in
));
1722 if (dst_in
-in_off
> src_in
)
1723 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1724 dst_in
- in_off
- src_in
);
1725 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1726 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1727 src
+1+src_nparam
+src_in
,
1728 isl_min(dst_out
-out_off
, src_out
));
1729 if (dst_out
-out_off
> src_out
)
1730 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1731 dst_out
- out_off
- src_out
);
1732 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1733 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1734 src
+1+src_nparam
+src_in
+src_out
,
1735 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1736 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1737 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1738 div_off
+src_map
->n_div
,
1739 dst_map
->n_div
- div_off
- src_map
->n_div
);
1742 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1743 struct isl_basic_map
*src_map
, isl_int
*src
,
1744 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1746 isl_int_set(dst
[0], src
[0]);
1747 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1750 static __isl_give isl_basic_map
*add_constraints(
1751 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1752 unsigned i_pos
, unsigned o_pos
)
1757 if (!bmap1
|| !bmap2
)
1760 div_off
= bmap1
->n_div
;
1762 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1763 int i1
= isl_basic_map_alloc_equality(bmap1
);
1766 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1767 i_pos
, o_pos
, div_off
);
1770 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1771 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1774 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1775 i_pos
, o_pos
, div_off
);
1778 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1779 int i1
= isl_basic_map_alloc_div(bmap1
);
1782 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1783 i_pos
, o_pos
, div_off
);
1786 isl_basic_map_free(bmap2
);
1791 isl_basic_map_free(bmap1
);
1792 isl_basic_map_free(bmap2
);
1796 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1797 struct isl_basic_set
*bset2
, unsigned pos
)
1799 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1800 bset_to_bmap(bset2
), 0, pos
));
1803 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1804 __isl_take isl_basic_map
*base
, __isl_take isl_space
*dim
,
1805 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1807 struct isl_basic_map
*ext
;
1817 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1818 base
->extra
>= base
->n_div
+ extra
;
1820 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1821 room_for_ineq(base
, n_ineq
)) {
1822 isl_space_free(dim
);
1826 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1827 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1828 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1829 extra
+= base
->extra
;
1831 n_ineq
+= base
->n_ineq
;
1833 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1839 ext
->sample
= isl_vec_copy(base
->sample
);
1840 flags
= base
->flags
;
1841 ext
= add_constraints(ext
, base
, 0, 0);
1844 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1850 isl_space_free(dim
);
1851 isl_basic_map_free(base
);
1855 __isl_give isl_basic_set
*isl_basic_set_extend_space(
1856 __isl_take isl_basic_set
*base
,
1857 __isl_take isl_space
*dim
, unsigned extra
,
1858 unsigned n_eq
, unsigned n_ineq
)
1860 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1861 dim
, extra
, n_eq
, n_ineq
));
1864 struct isl_basic_map
*isl_basic_map_extend_constraints(
1865 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1869 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1873 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1874 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1875 unsigned n_eq
, unsigned n_ineq
)
1877 struct isl_basic_map
*bmap
;
1882 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1886 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1889 isl_basic_map_free(base
);
1893 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1894 unsigned nparam
, unsigned dim
, unsigned extra
,
1895 unsigned n_eq
, unsigned n_ineq
)
1897 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1898 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1901 struct isl_basic_set
*isl_basic_set_extend_constraints(
1902 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1904 isl_basic_map
*bmap
= bset_to_bmap(base
);
1905 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1906 return bset_from_bmap(bmap
);
1909 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1911 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1914 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1919 if (bmap
->ref
> 1) {
1921 bmap
= isl_basic_map_dup(bmap
);
1924 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1925 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1930 /* Clear all cached information in "map", either because it is about
1931 * to be modified or because it is being freed.
1932 * Always return the same pointer that is passed in.
1933 * This is needed for the use in isl_map_free.
1935 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1937 isl_basic_map_free(map
->cached_simple_hull
[0]);
1938 isl_basic_map_free(map
->cached_simple_hull
[1]);
1939 map
->cached_simple_hull
[0] = NULL
;
1940 map
->cached_simple_hull
[1] = NULL
;
1944 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1946 return isl_map_cow(set
);
1949 /* Return an isl_map that is equal to "map" and that has only
1950 * a single reference.
1952 * If the original input already has only one reference, then
1953 * simply return it, but clear all cached information, since
1954 * it may be rendered invalid by the operations that will be
1955 * performed on the result.
1957 * Otherwise, create a duplicate (without any cached information).
1959 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
1965 return clear_caches(map
);
1967 return isl_map_dup(map
);
1970 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1971 unsigned a_len
, unsigned b_len
)
1973 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1974 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1975 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1978 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1979 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1987 isl_assert(bmap
->ctx
,
1988 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1990 if (n1
== 0 || n2
== 0)
1993 bmap
= isl_basic_map_cow(bmap
);
1997 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1998 if (isl_blk_is_error(blk
))
2001 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2003 bmap
->eq
[i
] + pos
, n1
, n2
);
2005 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2007 bmap
->ineq
[i
] + pos
, n1
, n2
);
2009 for (i
= 0; i
< bmap
->n_div
; ++i
)
2011 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2013 isl_blk_free(bmap
->ctx
, blk
);
2015 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
2016 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2017 return isl_basic_map_finalize(bmap
);
2019 isl_basic_map_free(bmap
);
2023 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2024 __isl_take isl_basic_map
*bmap
)
2030 total
= isl_basic_map_total_dim(bmap
);
2031 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2032 return isl_basic_map_free(bmap
);
2033 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2035 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2037 i
= isl_basic_map_alloc_equality(bmap
);
2041 isl_int_set_si(bmap
->eq
[i
][0], 1);
2042 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2043 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2044 isl_vec_free(bmap
->sample
);
2045 bmap
->sample
= NULL
;
2046 return isl_basic_map_finalize(bmap
);
2048 isl_basic_map_free(bmap
);
2052 __isl_give isl_basic_set
*isl_basic_set_set_to_empty(
2053 __isl_take isl_basic_set
*bset
)
2055 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2058 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2059 __isl_take isl_basic_map
*bmap
)
2064 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2067 bmap
= isl_basic_map_cow(bmap
);
2071 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2073 return isl_basic_map_finalize(bmap
);
2076 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2077 __isl_take isl_basic_set
*bset
)
2079 return isl_basic_map_set_rational(bset
);
2082 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2083 __isl_take isl_basic_set
*bset
)
2088 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2091 bset
= isl_basic_set_cow(bset
);
2095 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2097 return isl_basic_set_finalize(bset
);
2100 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2104 map
= isl_map_cow(map
);
2107 for (i
= 0; i
< map
->n
; ++i
) {
2108 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2118 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2120 return isl_map_set_rational(set
);
2123 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2126 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2128 isl_int
*t
= bmap
->div
[a
];
2129 bmap
->div
[a
] = bmap
->div
[b
];
2133 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2134 * div definitions accordingly.
2136 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
2139 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2141 swap_div(bmap
, a
, b
);
2143 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2144 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2146 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2147 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2149 for (i
= 0; i
< bmap
->n_div
; ++i
)
2150 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2151 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2154 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
2155 * div definitions accordingly.
2157 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
2159 isl_basic_map_swap_div(bset
, a
, b
);
2162 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2164 isl_seq_cpy(c
, c
+ n
, rem
);
2165 isl_seq_clr(c
+ rem
, n
);
2168 /* Drop n dimensions starting at first.
2170 * In principle, this frees up some extra variables as the number
2171 * of columns remains constant, but we would have to extend
2172 * the div array too as the number of rows in this array is assumed
2173 * to be equal to extra.
2175 __isl_give isl_basic_set
*isl_basic_set_drop_dims(
2176 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2178 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2181 /* Move "n" divs starting at "first" to the end of the list of divs.
2183 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2184 unsigned first
, unsigned n
)
2189 if (first
+ n
== bmap
->n_div
)
2192 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2195 for (i
= 0; i
< n
; ++i
)
2196 div
[i
] = bmap
->div
[first
+ i
];
2197 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2198 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2199 for (i
= 0; i
< n
; ++i
)
2200 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2204 isl_basic_map_free(bmap
);
2208 /* Check that there are "n" dimensions of type "type" starting at "first"
2211 static isl_stat
isl_map_check_range(__isl_keep isl_map
*map
,
2212 enum isl_dim_type type
, unsigned first
, unsigned n
)
2215 return isl_stat_error
;
2216 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2217 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2218 "position or range out of bounds",
2219 return isl_stat_error
);
2223 /* Drop "n" dimensions of type "type" starting at "first".
2225 * In principle, this frees up some extra variables as the number
2226 * of columns remains constant, but we would have to extend
2227 * the div array too as the number of rows in this array is assumed
2228 * to be equal to extra.
2230 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2231 enum isl_dim_type type
, unsigned first
, unsigned n
)
2241 dim
= isl_basic_map_dim(bmap
, type
);
2242 isl_assert(bmap
->ctx
, first
+ n
<= dim
, goto error
);
2244 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2247 bmap
= isl_basic_map_cow(bmap
);
2251 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2252 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2253 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2254 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2256 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2257 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2259 for (i
= 0; i
< bmap
->n_div
; ++i
)
2260 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2262 if (type
== isl_dim_div
) {
2263 bmap
= move_divs_last(bmap
, first
, n
);
2266 if (isl_basic_map_free_div(bmap
, n
) < 0)
2267 return isl_basic_map_free(bmap
);
2269 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2273 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2274 bmap
= isl_basic_map_simplify(bmap
);
2275 return isl_basic_map_finalize(bmap
);
2277 isl_basic_map_free(bmap
);
2281 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2282 enum isl_dim_type type
, unsigned first
, unsigned n
)
2284 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2288 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2289 enum isl_dim_type type
, unsigned first
, unsigned n
)
2293 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2294 return isl_map_free(map
);
2296 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2298 map
= isl_map_cow(map
);
2301 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2305 for (i
= 0; i
< map
->n
; ++i
) {
2306 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2310 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2318 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2319 enum isl_dim_type type
, unsigned first
, unsigned n
)
2321 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2325 * We don't cow, as the div is assumed to be redundant.
2327 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2328 __isl_take isl_basic_map
*bmap
, unsigned div
)
2336 pos
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + div
;
2338 isl_assert(bmap
->ctx
, div
< bmap
->n_div
, goto error
);
2340 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2341 constraint_drop_vars(bmap
->eq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2343 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2344 if (!isl_int_is_zero(bmap
->ineq
[i
][pos
])) {
2345 isl_basic_map_drop_inequality(bmap
, i
);
2349 constraint_drop_vars(bmap
->ineq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2352 for (i
= 0; i
< bmap
->n_div
; ++i
)
2353 constraint_drop_vars(bmap
->div
[i
]+1+pos
, 1, bmap
->extra
-div
-1);
2355 if (div
!= bmap
->n_div
- 1) {
2357 isl_int
*t
= bmap
->div
[div
];
2359 for (j
= div
; j
< bmap
->n_div
- 1; ++j
)
2360 bmap
->div
[j
] = bmap
->div
[j
+1];
2362 bmap
->div
[bmap
->n_div
- 1] = t
;
2364 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2365 if (isl_basic_map_free_div(bmap
, 1) < 0)
2366 return isl_basic_map_free(bmap
);
2370 isl_basic_map_free(bmap
);
2374 /* Eliminate the specified n dimensions starting at first from the
2375 * constraints, without removing the dimensions from the space.
2376 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2378 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2379 enum isl_dim_type type
, unsigned first
, unsigned n
)
2386 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2387 return isl_map_free(map
);
2389 map
= isl_map_cow(map
);
2393 for (i
= 0; i
< map
->n
; ++i
) {
2394 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2404 /* Eliminate the specified n dimensions starting at first from the
2405 * constraints, without removing the dimensions from the space.
2406 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2408 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2409 enum isl_dim_type type
, unsigned first
, unsigned n
)
2411 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2414 /* Eliminate the specified n dimensions starting at first from the
2415 * constraints, without removing the dimensions from the space.
2416 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2418 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2419 unsigned first
, unsigned n
)
2421 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2424 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2425 __isl_take isl_basic_map
*bmap
)
2429 bmap
= isl_basic_map_eliminate_vars(bmap
,
2430 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2434 return isl_basic_map_finalize(bmap
);
2437 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2438 __isl_take isl_basic_set
*bset
)
2440 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2443 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2452 map
= isl_map_cow(map
);
2456 for (i
= 0; i
< map
->n
; ++i
) {
2457 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2467 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2469 return isl_map_remove_divs(set
);
2472 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2473 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2474 unsigned first
, unsigned n
)
2476 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2477 return isl_basic_map_free(bmap
);
2478 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2480 bmap
= isl_basic_map_eliminate_vars(bmap
,
2481 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2484 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2486 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2490 /* Return true if the definition of the given div (recursively) involves
2491 * any of the given variables.
2493 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2494 unsigned first
, unsigned n
)
2497 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2499 if (isl_int_is_zero(bmap
->div
[div
][0]))
2500 return isl_bool_false
;
2501 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2502 return isl_bool_true
;
2504 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2507 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2509 involves
= div_involves_vars(bmap
, i
, first
, n
);
2510 if (involves
< 0 || involves
)
2514 return isl_bool_false
;
2517 /* Try and add a lower and/or upper bound on "div" to "bmap"
2518 * based on inequality "i".
2519 * "total" is the total number of variables (excluding the divs).
2520 * "v" is a temporary object that can be used during the calculations.
2521 * If "lb" is set, then a lower bound should be constructed.
2522 * If "ub" is set, then an upper bound should be constructed.
2524 * The calling function has already checked that the inequality does not
2525 * reference "div", but we still need to check that the inequality is
2526 * of the right form. We'll consider the case where we want to construct
2527 * a lower bound. The construction of upper bounds is similar.
2529 * Let "div" be of the form
2531 * q = floor((a + f(x))/d)
2533 * We essentially check if constraint "i" is of the form
2537 * so that we can use it to derive a lower bound on "div".
2538 * However, we allow a slightly more general form
2542 * with the condition that the coefficients of g(x) - f(x) are all
2544 * Rewriting this constraint as
2548 * adding a + f(x) to both sides and dividing by d, we obtain
2550 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2552 * Taking the floor on both sides, we obtain
2554 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2558 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2560 * In the case of an upper bound, we construct the constraint
2562 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2565 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2566 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2567 unsigned total
, isl_int v
, int lb
, int ub
)
2571 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2573 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2574 bmap
->div
[div
][1 + 1 + j
]);
2575 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2578 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2579 bmap
->div
[div
][1 + 1 + j
]);
2580 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2586 bmap
= isl_basic_map_cow(bmap
);
2587 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2589 int k
= isl_basic_map_alloc_inequality(bmap
);
2592 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2593 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2594 bmap
->div
[div
][1 + j
]);
2595 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2596 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2598 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2601 int k
= isl_basic_map_alloc_inequality(bmap
);
2604 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2605 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2606 bmap
->div
[div
][1 + j
]);
2607 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2608 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2610 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2613 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2616 isl_basic_map_free(bmap
);
2620 /* This function is called right before "div" is eliminated from "bmap"
2621 * using Fourier-Motzkin.
2622 * Look through the constraints of "bmap" for constraints on the argument
2623 * of the integer division and use them to construct constraints on the
2624 * integer division itself. These constraints can then be combined
2625 * during the Fourier-Motzkin elimination.
2626 * Note that it is only useful to introduce lower bounds on "div"
2627 * if "bmap" already contains upper bounds on "div" as the newly
2628 * introduce lower bounds can then be combined with the pre-existing
2629 * upper bounds. Similarly for upper bounds.
2630 * We therefore first check if "bmap" contains any lower and/or upper bounds
2633 * It is interesting to note that the introduction of these constraints
2634 * can indeed lead to more accurate results, even when compared to
2635 * deriving constraints on the argument of "div" from constraints on "div".
2636 * Consider, for example, the set
2638 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2640 * The second constraint can be rewritten as
2642 * 2 * [(-i-2j+3)/4] + k >= 0
2644 * from which we can derive
2646 * -i - 2j + 3 >= -2k
2652 * Combined with the first constraint, we obtain
2654 * -3 <= 3 + 2k or k >= -3
2656 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2657 * the first constraint, we obtain
2659 * [(i + 2j)/4] >= [-3/4] = -1
2661 * Combining this constraint with the second constraint, we obtain
2665 static __isl_give isl_basic_map
*insert_bounds_on_div(
2666 __isl_take isl_basic_map
*bmap
, int div
)
2669 int check_lb
, check_ub
;
2676 if (isl_int_is_zero(bmap
->div
[div
][0]))
2679 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2683 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2684 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2691 if (!check_lb
&& !check_ub
)
2696 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2697 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2700 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2701 check_lb
, check_ub
);
2709 /* Remove all divs (recursively) involving any of the given dimensions
2710 * in their definitions.
2712 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2713 __isl_take isl_basic_map
*bmap
,
2714 enum isl_dim_type type
, unsigned first
, unsigned n
)
2718 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2719 return isl_basic_map_free(bmap
);
2720 first
+= isl_basic_map_offset(bmap
, type
);
2722 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2725 involves
= div_involves_vars(bmap
, i
, first
, n
);
2727 return isl_basic_map_free(bmap
);
2730 bmap
= insert_bounds_on_div(bmap
, i
);
2731 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2740 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2741 __isl_take isl_basic_set
*bset
,
2742 enum isl_dim_type type
, unsigned first
, unsigned n
)
2744 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2747 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2748 enum isl_dim_type type
, unsigned first
, unsigned n
)
2757 map
= isl_map_cow(map
);
2761 for (i
= 0; i
< map
->n
; ++i
) {
2762 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2773 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2774 enum isl_dim_type type
, unsigned first
, unsigned n
)
2776 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2780 /* Does the description of "bmap" depend on the specified dimensions?
2781 * We also check whether the dimensions appear in any of the div definitions.
2782 * In principle there is no need for this check. If the dimensions appear
2783 * in a div definition, they also appear in the defining constraints of that
2786 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2787 enum isl_dim_type type
, unsigned first
, unsigned n
)
2791 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2792 return isl_bool_error
;
2794 first
+= isl_basic_map_offset(bmap
, type
);
2795 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2796 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2797 return isl_bool_true
;
2798 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2799 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2800 return isl_bool_true
;
2801 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2802 if (isl_int_is_zero(bmap
->div
[i
][0]))
2804 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2805 return isl_bool_true
;
2808 return isl_bool_false
;
2811 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2812 enum isl_dim_type type
, unsigned first
, unsigned n
)
2816 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2817 return isl_bool_error
;
2819 for (i
= 0; i
< map
->n
; ++i
) {
2820 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2822 if (involves
< 0 || involves
)
2826 return isl_bool_false
;
2829 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2830 enum isl_dim_type type
, unsigned first
, unsigned n
)
2832 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2835 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2836 enum isl_dim_type type
, unsigned first
, unsigned n
)
2838 return isl_map_involves_dims(set
, type
, first
, n
);
2841 /* Drop all constraints in bmap that involve any of the dimensions
2842 * first to first+n-1.
2844 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2845 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2852 bmap
= isl_basic_map_cow(bmap
);
2857 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2858 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2860 isl_basic_map_drop_equality(bmap
, i
);
2863 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2864 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2866 isl_basic_map_drop_inequality(bmap
, i
);
2869 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2873 /* Drop all constraints in bset that involve any of the dimensions
2874 * first to first+n-1.
2876 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2877 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2879 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2882 /* Drop all constraints in bmap that do not involve any of the dimensions
2883 * first to first + n - 1 of the given type.
2885 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2886 __isl_take isl_basic_map
*bmap
,
2887 enum isl_dim_type type
, unsigned first
, unsigned n
)
2892 isl_space
*space
= isl_basic_map_get_space(bmap
);
2893 isl_basic_map_free(bmap
);
2894 return isl_basic_map_universe(space
);
2896 bmap
= isl_basic_map_cow(bmap
);
2900 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2901 return isl_basic_map_free(bmap
);
2903 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2905 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2906 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2908 isl_basic_map_drop_equality(bmap
, i
);
2911 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2912 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2914 isl_basic_map_drop_inequality(bmap
, i
);
2917 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2921 /* Drop all constraints in bset that do not involve any of the dimensions
2922 * first to first + n - 1 of the given type.
2924 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2925 __isl_take isl_basic_set
*bset
,
2926 enum isl_dim_type type
, unsigned first
, unsigned n
)
2928 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2932 /* Drop all constraints in bmap that involve any of the dimensions
2933 * first to first + n - 1 of the given type.
2935 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2936 __isl_take isl_basic_map
*bmap
,
2937 enum isl_dim_type type
, unsigned first
, unsigned n
)
2944 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2945 return isl_basic_map_free(bmap
);
2947 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2948 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2949 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2952 /* Drop all constraints in bset that involve any of the dimensions
2953 * first to first + n - 1 of the given type.
2955 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2956 __isl_take isl_basic_set
*bset
,
2957 enum isl_dim_type type
, unsigned first
, unsigned n
)
2959 return isl_basic_map_drop_constraints_involving_dims(bset
,
2963 /* Drop constraints from "map" by applying "drop" to each basic map.
2965 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2966 enum isl_dim_type type
, unsigned first
, unsigned n
,
2967 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2968 enum isl_dim_type type
, unsigned first
, unsigned n
))
2972 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2973 return isl_map_free(map
);
2975 map
= isl_map_cow(map
);
2979 for (i
= 0; i
< map
->n
; ++i
) {
2980 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
2982 return isl_map_free(map
);
2986 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2991 /* Drop all constraints in map that involve any of the dimensions
2992 * first to first + n - 1 of the given type.
2994 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
2995 __isl_take isl_map
*map
,
2996 enum isl_dim_type type
, unsigned first
, unsigned n
)
3000 return drop_constraints(map
, type
, first
, n
,
3001 &isl_basic_map_drop_constraints_involving_dims
);
3004 /* Drop all constraints in "map" that do not involve any of the dimensions
3005 * first to first + n - 1 of the given type.
3007 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
3008 __isl_take isl_map
*map
,
3009 enum isl_dim_type type
, unsigned first
, unsigned n
)
3012 isl_space
*space
= isl_map_get_space(map
);
3014 return isl_map_universe(space
);
3016 return drop_constraints(map
, type
, first
, n
,
3017 &isl_basic_map_drop_constraints_not_involving_dims
);
3020 /* Drop all constraints in set that involve any of the dimensions
3021 * first to first + n - 1 of the given type.
3023 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
3024 __isl_take isl_set
*set
,
3025 enum isl_dim_type type
, unsigned first
, unsigned n
)
3027 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
3030 /* Drop all constraints in "set" that do not involve any of the dimensions
3031 * first to first + n - 1 of the given type.
3033 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
3034 __isl_take isl_set
*set
,
3035 enum isl_dim_type type
, unsigned first
, unsigned n
)
3037 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3040 /* Does local variable "div" of "bmap" have a complete explicit representation?
3041 * Having a complete explicit representation requires not only
3042 * an explicit representation, but also that all local variables
3043 * that appear in this explicit representation in turn have
3044 * a complete explicit representation.
3046 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3049 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3052 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3053 if (marked
< 0 || marked
)
3054 return isl_bool_not(marked
);
3056 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3059 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3061 known
= isl_basic_map_div_is_known(bmap
, i
);
3062 if (known
< 0 || !known
)
3066 return isl_bool_true
;
3069 /* Remove all divs that are unknown or defined in terms of unknown divs.
3071 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3072 __isl_take isl_basic_map
*bmap
)
3079 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3080 if (isl_basic_map_div_is_known(bmap
, i
))
3082 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3091 /* Remove all divs that are unknown or defined in terms of unknown divs.
3093 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3094 __isl_take isl_basic_set
*bset
)
3096 return isl_basic_map_remove_unknown_divs(bset
);
3099 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3108 map
= isl_map_cow(map
);
3112 for (i
= 0; i
< map
->n
; ++i
) {
3113 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3123 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3125 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3128 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3129 __isl_take isl_basic_set
*bset
,
3130 enum isl_dim_type type
, unsigned first
, unsigned n
)
3132 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3133 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3134 return bset_from_bmap(bmap
);
3137 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3138 enum isl_dim_type type
, unsigned first
, unsigned n
)
3145 map
= isl_map_cow(map
);
3146 if (isl_map_check_range(map
, type
, first
, n
) < 0)
3147 return isl_map_free(map
);
3149 for (i
= 0; i
< map
->n
; ++i
) {
3150 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3151 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3155 map
= isl_map_drop(map
, type
, first
, n
);
3162 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3163 enum isl_dim_type type
, unsigned first
, unsigned n
)
3165 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3169 /* Project out n inputs starting at first using Fourier-Motzkin */
3170 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3171 unsigned first
, unsigned n
)
3173 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3176 static void dump_term(struct isl_basic_map
*bmap
,
3177 isl_int c
, int pos
, FILE *out
)
3180 unsigned in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3181 unsigned dim
= in
+ isl_basic_map_dim(bmap
, isl_dim_out
);
3182 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3184 isl_int_print(out
, c
, 0);
3186 if (!isl_int_is_one(c
))
3187 isl_int_print(out
, c
, 0);
3188 if (pos
< 1 + nparam
) {
3189 name
= isl_space_get_dim_name(bmap
->dim
,
3190 isl_dim_param
, pos
- 1);
3192 fprintf(out
, "%s", name
);
3194 fprintf(out
, "p%d", pos
- 1);
3195 } else if (pos
< 1 + nparam
+ in
)
3196 fprintf(out
, "i%d", pos
- 1 - nparam
);
3197 else if (pos
< 1 + nparam
+ dim
)
3198 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
3200 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
3204 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
3205 int sign
, FILE *out
)
3209 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
3213 for (i
= 0, first
= 1; i
< len
; ++i
) {
3214 if (isl_int_sgn(c
[i
]) * sign
<= 0)
3217 fprintf(out
, " + ");
3219 isl_int_abs(v
, c
[i
]);
3220 dump_term(bmap
, v
, i
, out
);
3227 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
3228 const char *op
, FILE *out
, int indent
)
3232 fprintf(out
, "%*s", indent
, "");
3234 dump_constraint_sign(bmap
, c
, 1, out
);
3235 fprintf(out
, " %s ", op
);
3236 dump_constraint_sign(bmap
, c
, -1, out
);
3240 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
3241 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
3243 fprintf(out
, "%*s", indent
, "");
3244 fprintf(out
, "ERROR: unused div coefficient not zero\n");
3249 static void dump_constraints(struct isl_basic_map
*bmap
,
3250 isl_int
**c
, unsigned n
,
3251 const char *op
, FILE *out
, int indent
)
3255 for (i
= 0; i
< n
; ++i
)
3256 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
3259 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
3263 unsigned total
= isl_basic_map_total_dim(bmap
);
3265 for (j
= 0; j
< 1 + total
; ++j
) {
3266 if (isl_int_is_zero(exp
[j
]))
3268 if (!first
&& isl_int_is_pos(exp
[j
]))
3270 dump_term(bmap
, exp
[j
], j
, out
);
3275 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
3279 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
3280 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
3282 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3283 fprintf(out
, "%*s", indent
, "");
3284 fprintf(out
, "e%d = [(", i
);
3285 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
3287 isl_int_print(out
, bmap
->div
[i
][0], 0);
3288 fprintf(out
, "]\n");
3292 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3293 FILE *out
, int indent
)
3296 fprintf(out
, "null basic set\n");
3300 fprintf(out
, "%*s", indent
, "");
3301 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3302 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3303 bset
->extra
, bset
->flags
);
3304 dump(bset_to_bmap(bset
), out
, indent
);
3307 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3308 FILE *out
, int indent
)
3311 fprintf(out
, "null basic map\n");
3315 fprintf(out
, "%*s", indent
, "");
3316 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3317 "flags: %x, n_name: %d\n",
3319 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3320 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3321 dump(bmap
, out
, indent
);
3324 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
3329 total
= isl_basic_map_total_dim(bmap
);
3330 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
3331 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3332 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3333 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3337 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3342 if (isl_space_dim(space
, isl_dim_in
) != 0)
3343 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3344 "set cannot have input dimensions", goto error
);
3345 return isl_map_alloc_space(space
, n
, flags
);
3347 isl_space_free(space
);
3351 /* Make sure "map" has room for at least "n" more basic maps.
3353 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3356 struct isl_map
*grown
= NULL
;
3360 isl_assert(map
->ctx
, n
>= 0, goto error
);
3361 if (map
->n
+ n
<= map
->size
)
3363 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3366 for (i
= 0; i
< map
->n
; ++i
) {
3367 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3375 isl_map_free(grown
);
3380 /* Make sure "set" has room for at least "n" more basic sets.
3382 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3384 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3387 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3389 return isl_map_from_basic_map(bset
);
3392 __isl_give isl_map
*isl_map_from_basic_map(__isl_take isl_basic_map
*bmap
)
3394 struct isl_map
*map
;
3399 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3400 return isl_map_add_basic_map(map
, bmap
);
3403 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3404 __isl_take isl_basic_set
*bset
)
3406 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3407 bset_to_bmap(bset
)));
3410 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3412 return isl_map_free(set
);
3415 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3420 fprintf(out
, "null set\n");
3424 fprintf(out
, "%*s", indent
, "");
3425 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3426 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3428 for (i
= 0; i
< set
->n
; ++i
) {
3429 fprintf(out
, "%*s", indent
, "");
3430 fprintf(out
, "basic set %d:\n", i
);
3431 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3435 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3440 fprintf(out
, "null map\n");
3444 fprintf(out
, "%*s", indent
, "");
3445 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3446 "flags: %x, n_name: %d\n",
3447 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3448 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3449 for (i
= 0; i
< map
->n
; ++i
) {
3450 fprintf(out
, "%*s", indent
, "");
3451 fprintf(out
, "basic map %d:\n", i
);
3452 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3456 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3457 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3459 struct isl_basic_map
*bmap_domain
;
3461 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3464 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3465 isl_assert(bset
->ctx
,
3466 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3468 bmap
= isl_basic_map_cow(bmap
);
3471 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3472 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3473 bmap_domain
= isl_basic_map_from_domain(bset
);
3474 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3476 bmap
= isl_basic_map_simplify(bmap
);
3477 return isl_basic_map_finalize(bmap
);
3479 isl_basic_map_free(bmap
);
3480 isl_basic_set_free(bset
);
3484 /* Check that the space of "bset" is the same as that of the range of "bmap".
3486 static isl_stat
isl_basic_map_check_compatible_range(
3487 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3491 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3493 return isl_stat_error
;
3495 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3496 "incompatible spaces", return isl_stat_error
);
3501 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3502 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3504 struct isl_basic_map
*bmap_range
;
3506 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3509 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3510 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3513 if (isl_basic_set_plain_is_universe(bset
)) {
3514 isl_basic_set_free(bset
);
3518 bmap
= isl_basic_map_cow(bmap
);
3521 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3522 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3523 bmap_range
= bset_to_bmap(bset
);
3524 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3526 bmap
= isl_basic_map_simplify(bmap
);
3527 return isl_basic_map_finalize(bmap
);
3529 isl_basic_map_free(bmap
);
3530 isl_basic_set_free(bset
);
3534 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3535 __isl_keep isl_vec
*vec
)
3542 return isl_bool_error
;
3544 total
= 1 + isl_basic_map_total_dim(bmap
);
3545 if (total
!= vec
->size
)
3546 return isl_bool_false
;
3550 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3551 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3552 if (!isl_int_is_zero(s
)) {
3554 return isl_bool_false
;
3558 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3559 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3560 if (isl_int_is_neg(s
)) {
3562 return isl_bool_false
;
3568 return isl_bool_true
;
3571 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3572 __isl_keep isl_vec
*vec
)
3574 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3577 __isl_give isl_basic_map
*isl_basic_map_intersect(
3578 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3580 struct isl_vec
*sample
= NULL
;
3582 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3584 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3585 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3586 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3587 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3588 return isl_basic_map_intersect(bmap2
, bmap1
);
3590 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3591 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3592 isl_assert(bmap1
->ctx
,
3593 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3595 if (isl_basic_map_plain_is_empty(bmap1
)) {
3596 isl_basic_map_free(bmap2
);
3599 if (isl_basic_map_plain_is_empty(bmap2
)) {
3600 isl_basic_map_free(bmap1
);
3604 if (bmap1
->sample
&&
3605 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3606 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3607 sample
= isl_vec_copy(bmap1
->sample
);
3608 else if (bmap2
->sample
&&
3609 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3610 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3611 sample
= isl_vec_copy(bmap2
->sample
);
3613 bmap1
= isl_basic_map_cow(bmap1
);
3616 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3617 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3618 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3621 isl_vec_free(sample
);
3623 isl_vec_free(bmap1
->sample
);
3624 bmap1
->sample
= sample
;
3627 bmap1
= isl_basic_map_simplify(bmap1
);
3628 return isl_basic_map_finalize(bmap1
);
3631 isl_vec_free(sample
);
3632 isl_basic_map_free(bmap1
);
3633 isl_basic_map_free(bmap2
);
3637 struct isl_basic_set
*isl_basic_set_intersect(
3638 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3640 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3641 bset_to_bmap(bset2
)));
3644 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3645 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3647 return isl_basic_set_intersect(bset1
, bset2
);
3650 /* Special case of isl_map_intersect, where both map1 and map2
3651 * are convex, without any divs and such that either map1 or map2
3652 * contains a single constraint. This constraint is then simply
3653 * added to the other map.
3655 static __isl_give isl_map
*map_intersect_add_constraint(
3656 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3658 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3659 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3660 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3661 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3663 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3664 return isl_map_intersect(map2
, map1
);
3666 map1
= isl_map_cow(map1
);
3669 if (isl_map_plain_is_empty(map1
)) {
3673 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3674 if (map2
->p
[0]->n_eq
== 1)
3675 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3677 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3678 map2
->p
[0]->ineq
[0]);
3680 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3681 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3685 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3686 isl_basic_map_free(map1
->p
[0]);
3699 /* map2 may be either a parameter domain or a map living in the same
3702 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3703 __isl_take isl_map
*map2
)
3712 if ((isl_map_plain_is_empty(map1
) ||
3713 isl_map_plain_is_universe(map2
)) &&
3714 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3718 if ((isl_map_plain_is_empty(map2
) ||
3719 isl_map_plain_is_universe(map1
)) &&
3720 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3725 if (map1
->n
== 1 && map2
->n
== 1 &&
3726 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3727 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3728 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3729 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3730 return map_intersect_add_constraint(map1
, map2
);
3732 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3733 isl_space_dim(map2
->dim
, isl_dim_param
))
3734 isl_assert(map1
->ctx
,
3735 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3737 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3738 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3739 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3741 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3742 map1
->n
* map2
->n
, flags
);
3745 for (i
= 0; i
< map1
->n
; ++i
)
3746 for (j
= 0; j
< map2
->n
; ++j
) {
3747 struct isl_basic_map
*part
;
3748 part
= isl_basic_map_intersect(
3749 isl_basic_map_copy(map1
->p
[i
]),
3750 isl_basic_map_copy(map2
->p
[j
]));
3751 if (isl_basic_map_is_empty(part
) < 0)
3752 part
= isl_basic_map_free(part
);
3753 result
= isl_map_add_basic_map(result
, part
);
3766 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3767 __isl_take isl_map
*map2
)
3771 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3772 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3773 "spaces don't match", goto error
);
3774 return map_intersect_internal(map1
, map2
);
3781 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3782 __isl_take isl_map
*map2
)
3784 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3787 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3789 return set_from_map(isl_map_intersect(set_to_map(set1
),
3793 /* map_intersect_internal accepts intersections
3794 * with parameter domains, so we can just call that function.
3796 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3797 __isl_take isl_set
*params
)
3799 return map_intersect_internal(map
, params
);
3802 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3803 __isl_take isl_map
*map2
)
3805 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3808 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3809 __isl_take isl_set
*params
)
3811 return isl_map_intersect_params(set
, params
);
3814 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3817 unsigned pos
, n1
, n2
;
3821 bmap
= isl_basic_map_cow(bmap
);
3824 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3825 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3826 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3827 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3828 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3829 return isl_basic_map_reset_space(bmap
, space
);
3832 static __isl_give isl_basic_map
*basic_map_space_reset(
3833 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3839 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3842 space
= isl_basic_map_get_space(bmap
);
3843 space
= isl_space_reset(space
, type
);
3844 bmap
= isl_basic_map_reset_space(bmap
, space
);
3848 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3849 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3850 unsigned pos
, unsigned n
)
3854 struct isl_basic_map
*res
;
3855 struct isl_dim_map
*dim_map
;
3856 unsigned total
, off
;
3857 enum isl_dim_type t
;
3860 return basic_map_space_reset(bmap
, type
);
3865 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3867 total
= isl_basic_map_total_dim(bmap
) + n
;
3868 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3870 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3872 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3874 unsigned size
= isl_basic_map_dim(bmap
, t
);
3875 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3877 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3878 pos
, size
- pos
, off
+ pos
+ n
);
3880 off
+= isl_space_dim(res_dim
, t
);
3882 isl_dim_map_div(dim_map
, bmap
, off
);
3884 res
= isl_basic_map_alloc_space(res_dim
,
3885 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3886 rational
= isl_basic_map_is_rational(bmap
);
3888 res
= isl_basic_map_free(res
);
3890 res
= isl_basic_map_set_rational(res
);
3891 if (isl_basic_map_plain_is_empty(bmap
)) {
3892 isl_basic_map_free(bmap
);
3894 return isl_basic_map_set_to_empty(res
);
3896 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3897 return isl_basic_map_finalize(res
);
3900 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3901 __isl_take isl_basic_set
*bset
,
3902 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3904 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3907 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3908 enum isl_dim_type type
, unsigned n
)
3912 return isl_basic_map_insert_dims(bmap
, type
,
3913 isl_basic_map_dim(bmap
, type
), n
);
3916 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3917 enum isl_dim_type type
, unsigned n
)
3921 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3922 return isl_basic_map_add_dims(bset
, type
, n
);
3924 isl_basic_set_free(bset
);
3928 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3929 enum isl_dim_type type
)
3933 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3936 space
= isl_map_get_space(map
);
3937 space
= isl_space_reset(space
, type
);
3938 map
= isl_map_reset_space(map
, space
);
3942 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3943 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3948 return map_space_reset(map
, type
);
3950 map
= isl_map_cow(map
);
3954 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3958 for (i
= 0; i
< map
->n
; ++i
) {
3959 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3970 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3971 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3973 return isl_map_insert_dims(set
, type
, pos
, n
);
3976 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3977 enum isl_dim_type type
, unsigned n
)
3981 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3984 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3985 enum isl_dim_type type
, unsigned n
)
3989 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3990 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
3996 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3997 __isl_take isl_basic_map
*bmap
,
3998 enum isl_dim_type dst_type
, unsigned dst_pos
,
3999 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4001 struct isl_dim_map
*dim_map
;
4002 struct isl_basic_map
*res
;
4003 enum isl_dim_type t
;
4004 unsigned total
, off
;
4009 bmap
= isl_basic_map_reset(bmap
, src_type
);
4010 bmap
= isl_basic_map_reset(bmap
, dst_type
);
4014 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
4015 return isl_basic_map_free(bmap
);
4017 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4020 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
4022 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
4023 pos(bmap
->dim
, src_type
) + src_pos
+
4024 ((src_type
< dst_type
) ? n
: 0)) {
4025 bmap
= isl_basic_map_cow(bmap
);
4029 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4030 src_type
, src_pos
, n
);
4034 bmap
= isl_basic_map_finalize(bmap
);
4039 total
= isl_basic_map_total_dim(bmap
);
4040 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4043 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4044 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4045 if (t
== dst_type
) {
4046 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4049 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
4052 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4053 dst_pos
, size
- dst_pos
, off
);
4054 off
+= size
- dst_pos
;
4055 } else if (t
== src_type
) {
4056 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4059 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4060 src_pos
+ n
, size
- src_pos
- n
, off
);
4061 off
+= size
- src_pos
- n
;
4063 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4067 isl_dim_map_div(dim_map
, bmap
, off
);
4069 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4070 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4071 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4075 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4076 src_type
, src_pos
, n
);
4080 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4081 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4082 bmap
= isl_basic_map_finalize(bmap
);
4086 isl_basic_map_free(bmap
);
4090 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4091 enum isl_dim_type dst_type
, unsigned dst_pos
,
4092 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4094 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4095 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4096 src_type
, src_pos
, n
);
4097 return bset_from_bmap(bmap
);
4100 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4101 enum isl_dim_type dst_type
, unsigned dst_pos
,
4102 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4106 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4107 return set_from_map(isl_map_move_dims(set_to_map(set
),
4108 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4114 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4115 enum isl_dim_type dst_type
, unsigned dst_pos
,
4116 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4121 map
= isl_map_reset(map
, src_type
);
4122 map
= isl_map_reset(map
, dst_type
);
4126 if (isl_map_check_range(map
, src_type
, src_pos
, n
))
4127 return isl_map_free(map
);
4129 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4132 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4134 map
= isl_map_cow(map
);
4138 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4142 for (i
= 0; i
< map
->n
; ++i
) {
4143 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4145 src_type
, src_pos
, n
);
4156 /* Move the specified dimensions to the last columns right before
4157 * the divs. Don't change the dimension specification of bmap.
4158 * That's the responsibility of the caller.
4160 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4161 enum isl_dim_type type
, unsigned first
, unsigned n
)
4163 struct isl_dim_map
*dim_map
;
4164 struct isl_basic_map
*res
;
4165 enum isl_dim_type t
;
4166 unsigned total
, off
;
4170 if (pos(bmap
->dim
, type
) + first
+ n
==
4171 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
4174 total
= isl_basic_map_total_dim(bmap
);
4175 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4178 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4179 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4181 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4184 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4185 first
, n
, total
- bmap
->n_div
- n
);
4186 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4187 first
+ n
, size
- (first
+ n
), off
);
4188 off
+= size
- (first
+ n
);
4190 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4194 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4196 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4197 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4198 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4202 /* Insert "n" rows in the divs of "bmap".
4204 * The number of columns is not changed, which means that the last
4205 * dimensions of "bmap" are being reintepreted as the new divs.
4206 * The space of "bmap" is not adjusted, however, which means
4207 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4208 * from the space of "bmap" is the responsibility of the caller.
4210 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4218 bmap
= isl_basic_map_cow(bmap
);
4222 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
4223 old
= bmap
->block2
.data
;
4224 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4225 (bmap
->extra
+ n
) * (1 + row_size
));
4226 if (!bmap
->block2
.data
)
4227 return isl_basic_map_free(bmap
);
4228 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4230 return isl_basic_map_free(bmap
);
4231 for (i
= 0; i
< n
; ++i
) {
4232 new_div
[i
] = bmap
->block2
.data
+
4233 (bmap
->extra
+ i
) * (1 + row_size
);
4234 isl_seq_clr(new_div
[i
], 1 + row_size
);
4236 for (i
= 0; i
< bmap
->extra
; ++i
)
4237 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4239 bmap
->div
= new_div
;
4246 /* Drop constraints from "bmap" that only involve the variables
4247 * of "type" in the range [first, first + n] that are not related
4248 * to any of the variables outside that interval.
4249 * These constraints cannot influence the values for the variables
4250 * outside the interval, except in case they cause "bmap" to be empty.
4251 * Only drop the constraints if "bmap" is known to be non-empty.
4253 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4254 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4255 unsigned first
, unsigned n
)
4259 unsigned dim
, n_div
;
4262 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4264 return isl_basic_map_free(bmap
);
4268 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4269 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4270 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4272 return isl_basic_map_free(bmap
);
4273 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4274 for (i
= 0; i
< first
; ++i
)
4276 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4279 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4284 /* Turn the n dimensions of type type, starting at first
4285 * into existentially quantified variables.
4287 * If a subset of the projected out variables are unrelated
4288 * to any of the variables that remain, then the constraints
4289 * involving this subset are simply dropped first.
4291 __isl_give isl_basic_map
*isl_basic_map_project_out(
4292 __isl_take isl_basic_map
*bmap
,
4293 enum isl_dim_type type
, unsigned first
, unsigned n
)
4298 return basic_map_space_reset(bmap
, type
);
4299 if (type
== isl_dim_div
)
4300 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4301 "cannot project out existentially quantified variables",
4302 return isl_basic_map_free(bmap
));
4304 empty
= isl_basic_map_plain_is_empty(bmap
);
4306 return isl_basic_map_free(bmap
);
4308 bmap
= isl_basic_map_set_to_empty(bmap
);
4310 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4314 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4315 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4317 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4318 return isl_basic_map_free(bmap
);
4320 bmap
= move_last(bmap
, type
, first
, n
);
4321 bmap
= isl_basic_map_cow(bmap
);
4322 bmap
= insert_div_rows(bmap
, n
);
4326 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4329 bmap
= isl_basic_map_simplify(bmap
);
4330 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4331 return isl_basic_map_finalize(bmap
);
4333 isl_basic_map_free(bmap
);
4337 /* Turn the n dimensions of type type, starting at first
4338 * into existentially quantified variables.
4340 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4341 enum isl_dim_type type
, unsigned first
, unsigned n
)
4343 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4347 /* Turn the n dimensions of type type, starting at first
4348 * into existentially quantified variables.
4350 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4351 enum isl_dim_type type
, unsigned first
, unsigned n
)
4356 return map_space_reset(map
, type
);
4358 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4359 return isl_map_free(map
);
4361 map
= isl_map_cow(map
);
4365 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4369 for (i
= 0; i
< map
->n
; ++i
) {
4370 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4381 /* Turn the n dimensions of type type, starting at first
4382 * into existentially quantified variables.
4384 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4385 enum isl_dim_type type
, unsigned first
, unsigned n
)
4387 return set_from_map(isl_map_project_out(set_to_map(set
),
4391 /* Return a map that projects the elements in "set" onto their
4392 * "n" set dimensions starting at "first".
4393 * "type" should be equal to isl_dim_set.
4395 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4396 enum isl_dim_type type
, unsigned first
, unsigned n
)
4404 if (type
!= isl_dim_set
)
4405 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4406 "only set dimensions can be projected out", goto error
);
4407 dim
= isl_set_dim(set
, isl_dim_set
);
4408 if (first
+ n
> dim
|| first
+ n
< first
)
4409 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4410 "index out of bounds", goto error
);
4412 map
= isl_map_from_domain(set
);
4413 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4414 for (i
= 0; i
< n
; ++i
)
4415 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4423 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
4427 for (i
= 0; i
< n
; ++i
) {
4428 j
= isl_basic_map_alloc_div(bmap
);
4431 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4435 isl_basic_map_free(bmap
);
4439 struct isl_basic_map
*isl_basic_map_apply_range(
4440 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4442 isl_space
*dim_result
= NULL
;
4443 struct isl_basic_map
*bmap
;
4444 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4445 struct isl_dim_map
*dim_map1
, *dim_map2
;
4447 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4449 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4450 bmap2
->dim
, isl_dim_in
))
4451 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4452 "spaces don't match", goto error
);
4454 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4455 isl_space_copy(bmap2
->dim
));
4457 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4458 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4459 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4460 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4462 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4463 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4464 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4465 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4466 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4467 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4468 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4469 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4470 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4471 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4472 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4474 bmap
= isl_basic_map_alloc_space(dim_result
,
4475 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4476 bmap1
->n_eq
+ bmap2
->n_eq
,
4477 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4478 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4479 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4480 bmap
= add_divs(bmap
, n
);
4481 bmap
= isl_basic_map_simplify(bmap
);
4482 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4483 return isl_basic_map_finalize(bmap
);
4485 isl_basic_map_free(bmap1
);
4486 isl_basic_map_free(bmap2
);
4490 struct isl_basic_set
*isl_basic_set_apply(
4491 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4496 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4499 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4502 isl_basic_set_free(bset
);
4503 isl_basic_map_free(bmap
);
4507 struct isl_basic_map
*isl_basic_map_apply_domain(
4508 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4510 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4512 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4513 bmap2
->dim
, isl_dim_in
))
4514 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4515 "spaces don't match", goto error
);
4517 bmap1
= isl_basic_map_reverse(bmap1
);
4518 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4519 return isl_basic_map_reverse(bmap1
);
4521 isl_basic_map_free(bmap1
);
4522 isl_basic_map_free(bmap2
);
4526 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4527 * A \cap B -> f(A) + f(B)
4529 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4530 __isl_take isl_basic_map
*bmap2
)
4532 unsigned n_in
, n_out
, nparam
, total
, pos
;
4533 struct isl_basic_map
*bmap
= NULL
;
4534 struct isl_dim_map
*dim_map1
, *dim_map2
;
4537 if (!bmap1
|| !bmap2
)
4540 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4543 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4544 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4545 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4547 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4548 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4549 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4550 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4551 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4552 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4553 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4554 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4555 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4556 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4557 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4559 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4560 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4561 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4562 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4563 for (i
= 0; i
< n_out
; ++i
) {
4564 int j
= isl_basic_map_alloc_equality(bmap
);
4567 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4568 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4569 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4570 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4572 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4573 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4574 bmap
= add_divs(bmap
, 2 * n_out
);
4576 bmap
= isl_basic_map_simplify(bmap
);
4577 return isl_basic_map_finalize(bmap
);
4579 isl_basic_map_free(bmap
);
4580 isl_basic_map_free(bmap1
);
4581 isl_basic_map_free(bmap2
);
4585 /* Given two maps A -> f(A) and B -> g(B), construct a map
4586 * A \cap B -> f(A) + f(B)
4588 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4589 __isl_take isl_map
*map2
)
4591 struct isl_map
*result
;
4597 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4599 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4600 map1
->n
* map2
->n
, 0);
4603 for (i
= 0; i
< map1
->n
; ++i
)
4604 for (j
= 0; j
< map2
->n
; ++j
) {
4605 struct isl_basic_map
*part
;
4606 part
= isl_basic_map_sum(
4607 isl_basic_map_copy(map1
->p
[i
]),
4608 isl_basic_map_copy(map2
->p
[j
]));
4609 if (isl_basic_map_is_empty(part
))
4610 isl_basic_map_free(part
);
4612 result
= isl_map_add_basic_map(result
, part
);
4625 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4626 __isl_take isl_set
*set2
)
4628 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4631 /* Given a basic map A -> f(A), construct A -> -f(A).
4633 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4638 bmap
= isl_basic_map_cow(bmap
);
4642 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4643 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4644 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4645 for (j
= 0; j
< n
; ++j
)
4646 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4647 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4648 for (j
= 0; j
< n
; ++j
)
4649 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4650 for (i
= 0; i
< bmap
->n_div
; ++i
)
4651 for (j
= 0; j
< n
; ++j
)
4652 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4653 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4654 return isl_basic_map_finalize(bmap
);
4657 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4659 return isl_basic_map_neg(bset
);
4662 /* Given a map A -> f(A), construct A -> -f(A).
4664 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4668 map
= isl_map_cow(map
);
4672 for (i
= 0; i
< map
->n
; ++i
) {
4673 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4684 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4686 return set_from_map(isl_map_neg(set_to_map(set
)));
4689 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4690 * A -> floor(f(A)/d).
4692 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4695 unsigned n_in
, n_out
, nparam
, total
, pos
;
4696 struct isl_basic_map
*result
= NULL
;
4697 struct isl_dim_map
*dim_map
;
4703 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4704 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4705 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4707 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4708 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4709 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4710 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4711 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4712 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4714 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4715 bmap
->n_div
+ n_out
,
4716 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4717 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4718 result
= add_divs(result
, n_out
);
4719 for (i
= 0; i
< n_out
; ++i
) {
4721 j
= isl_basic_map_alloc_inequality(result
);
4724 isl_seq_clr(result
->ineq
[j
], 1+total
);
4725 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4726 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4727 j
= isl_basic_map_alloc_inequality(result
);
4730 isl_seq_clr(result
->ineq
[j
], 1+total
);
4731 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4732 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4733 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4736 result
= isl_basic_map_simplify(result
);
4737 return isl_basic_map_finalize(result
);
4739 isl_basic_map_free(result
);
4743 /* Given a map A -> f(A) and an integer d, construct a map
4744 * A -> floor(f(A)/d).
4746 __isl_give isl_map
*isl_map_floordiv(__isl_take isl_map
*map
, isl_int d
)
4750 map
= isl_map_cow(map
);
4754 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4755 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4756 for (i
= 0; i
< map
->n
; ++i
) {
4757 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4768 /* Given a map A -> f(A) and an integer d, construct a map
4769 * A -> floor(f(A)/d).
4771 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4772 __isl_take isl_val
*d
)
4776 if (!isl_val_is_int(d
))
4777 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4778 "expecting integer denominator", goto error
);
4779 map
= isl_map_floordiv(map
, d
->n
);
4788 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4795 i
= isl_basic_map_alloc_equality(bmap
);
4798 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4799 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4800 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4801 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4802 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4803 return isl_basic_map_finalize(bmap
);
4805 isl_basic_map_free(bmap
);
4809 /* Add a constraint to "bmap" expressing i_pos < o_pos
4811 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4818 i
= isl_basic_map_alloc_inequality(bmap
);
4821 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4822 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4823 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4824 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4825 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4826 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4827 return isl_basic_map_finalize(bmap
);
4829 isl_basic_map_free(bmap
);
4833 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4835 static __isl_give isl_basic_map
*var_less_or_equal(
4836 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4842 i
= isl_basic_map_alloc_inequality(bmap
);
4845 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4846 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4847 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4848 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4849 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4850 return isl_basic_map_finalize(bmap
);
4852 isl_basic_map_free(bmap
);
4856 /* Add a constraint to "bmap" expressing i_pos > o_pos
4858 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4865 i
= isl_basic_map_alloc_inequality(bmap
);
4868 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4869 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4870 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4871 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4872 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4873 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4874 return isl_basic_map_finalize(bmap
);
4876 isl_basic_map_free(bmap
);
4880 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4882 static __isl_give isl_basic_map
*var_more_or_equal(
4883 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4889 i
= isl_basic_map_alloc_inequality(bmap
);
4892 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4893 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4894 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4895 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4896 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4897 return isl_basic_map_finalize(bmap
);
4899 isl_basic_map_free(bmap
);
4903 __isl_give isl_basic_map
*isl_basic_map_equal(
4904 __isl_take isl_space
*dim
, unsigned n_equal
)
4907 struct isl_basic_map
*bmap
;
4908 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4911 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4912 bmap
= var_equal(bmap
, i
);
4913 return isl_basic_map_finalize(bmap
);
4916 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4918 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4922 struct isl_basic_map
*bmap
;
4923 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4926 for (i
= 0; i
< pos
&& bmap
; ++i
)
4927 bmap
= var_equal(bmap
, i
);
4929 bmap
= var_less(bmap
, pos
);
4930 return isl_basic_map_finalize(bmap
);
4933 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4935 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4936 __isl_take isl_space
*dim
, unsigned pos
)
4939 isl_basic_map
*bmap
;
4941 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4942 for (i
= 0; i
< pos
; ++i
)
4943 bmap
= var_equal(bmap
, i
);
4944 bmap
= var_less_or_equal(bmap
, pos
);
4945 return isl_basic_map_finalize(bmap
);
4948 /* Return a relation on "dim" expressing i_pos > o_pos
4950 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4954 struct isl_basic_map
*bmap
;
4955 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4958 for (i
= 0; i
< pos
&& bmap
; ++i
)
4959 bmap
= var_equal(bmap
, i
);
4961 bmap
= var_more(bmap
, pos
);
4962 return isl_basic_map_finalize(bmap
);
4965 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
4967 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4968 __isl_take isl_space
*dim
, unsigned pos
)
4971 isl_basic_map
*bmap
;
4973 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4974 for (i
= 0; i
< pos
; ++i
)
4975 bmap
= var_equal(bmap
, i
);
4976 bmap
= var_more_or_equal(bmap
, pos
);
4977 return isl_basic_map_finalize(bmap
);
4980 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4981 unsigned n
, int equal
)
4983 struct isl_map
*map
;
4986 if (n
== 0 && equal
)
4987 return isl_map_universe(dims
);
4989 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4991 for (i
= 0; i
+ 1 < n
; ++i
)
4992 map
= isl_map_add_basic_map(map
,
4993 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4996 map
= isl_map_add_basic_map(map
,
4997 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4999 map
= isl_map_add_basic_map(map
,
5000 isl_basic_map_less_at(dims
, n
- 1));
5002 isl_space_free(dims
);
5007 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
5011 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
5014 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
5016 return map_lex_lte_first(dim
, n
, 0);
5019 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
5021 return map_lex_lte_first(dim
, n
, 1);
5024 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
5026 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
5029 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
5031 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
5034 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
5035 unsigned n
, int equal
)
5037 struct isl_map
*map
;
5040 if (n
== 0 && equal
)
5041 return isl_map_universe(dims
);
5043 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5045 for (i
= 0; i
+ 1 < n
; ++i
)
5046 map
= isl_map_add_basic_map(map
,
5047 isl_basic_map_more_at(isl_space_copy(dims
), i
));
5050 map
= isl_map_add_basic_map(map
,
5051 isl_basic_map_more_or_equal_at(dims
, n
- 1));
5053 map
= isl_map_add_basic_map(map
,
5054 isl_basic_map_more_at(dims
, n
- 1));
5056 isl_space_free(dims
);
5061 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
5065 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
5068 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5070 return map_lex_gte_first(dim
, n
, 0);
5073 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5075 return map_lex_gte_first(dim
, n
, 1);
5078 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5080 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5083 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5085 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5088 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5089 __isl_take isl_set
*set2
)
5092 map
= isl_map_lex_le(isl_set_get_space(set1
));
5093 map
= isl_map_intersect_domain(map
, set1
);
5094 map
= isl_map_intersect_range(map
, set2
);
5098 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5099 __isl_take isl_set
*set2
)
5102 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5103 map
= isl_map_intersect_domain(map
, set1
);
5104 map
= isl_map_intersect_range(map
, set2
);
5108 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5109 __isl_take isl_set
*set2
)
5112 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5113 map
= isl_map_intersect_domain(map
, set1
);
5114 map
= isl_map_intersect_range(map
, set2
);
5118 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5119 __isl_take isl_set
*set2
)
5122 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5123 map
= isl_map_intersect_domain(map
, set1
);
5124 map
= isl_map_intersect_range(map
, set2
);
5128 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5129 __isl_take isl_map
*map2
)
5132 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5133 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5134 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5138 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5139 __isl_take isl_map
*map2
)
5142 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5143 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5144 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5148 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5149 __isl_take isl_map
*map2
)
5152 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5153 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5154 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5158 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5159 __isl_take isl_map
*map2
)
5162 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5163 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5164 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5168 /* For a div d = floor(f/m), add the constraint
5172 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
5173 unsigned pos
, isl_int
*div
)
5176 unsigned total
= isl_basic_map_total_dim(bmap
);
5178 i
= isl_basic_map_alloc_inequality(bmap
);
5180 return isl_stat_error
;
5181 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5182 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
5187 /* For a div d = floor(f/m), add the constraint
5189 * -(f-(m-1)) + m d >= 0
5191 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
5192 unsigned pos
, isl_int
*div
)
5195 unsigned total
= isl_basic_map_total_dim(bmap
);
5197 i
= isl_basic_map_alloc_inequality(bmap
);
5199 return isl_stat_error
;
5200 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5201 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
5202 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5203 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5208 /* For a div d = floor(f/m), add the constraints
5211 * -(f-(m-1)) + m d >= 0
5213 * Note that the second constraint is the negation of
5217 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
5218 unsigned pos
, isl_int
*div
)
5220 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
5222 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
5227 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
5228 unsigned pos
, isl_int
*div
)
5230 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
5234 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
5236 unsigned total
= isl_basic_map_total_dim(bmap
);
5237 unsigned div_pos
= total
- bmap
->n_div
+ div
;
5239 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
5243 /* For each known div d = floor(f/m), add the constraints
5246 * -(f-(m-1)) + m d >= 0
5248 * Remove duplicate constraints in case of some these div constraints
5249 * already appear in "bmap".
5251 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5252 __isl_take isl_basic_map
*bmap
)
5258 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5262 bmap
= add_known_div_constraints(bmap
);
5263 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5264 bmap
= isl_basic_map_finalize(bmap
);
5268 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5270 * In particular, if this div is of the form d = floor(f/m),
5271 * then add the constraint
5275 * if sign < 0 or the constraint
5277 * -(f-(m-1)) + m d >= 0
5281 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
5282 unsigned div
, int sign
)
5290 total
= isl_basic_map_total_dim(bmap
);
5291 div_pos
= total
- bmap
->n_div
+ div
;
5294 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5296 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5299 __isl_give isl_basic_set
*isl_basic_map_underlying_set(
5300 __isl_take isl_basic_map
*bmap
)
5304 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5306 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5307 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5308 return bset_from_bmap(bmap
);
5309 bmap
= isl_basic_map_cow(bmap
);
5312 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5315 bmap
->extra
-= bmap
->n_div
;
5317 bmap
= isl_basic_map_finalize(bmap
);
5318 return bset_from_bmap(bmap
);
5320 isl_basic_map_free(bmap
);
5324 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5325 __isl_take isl_basic_set
*bset
)
5327 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5330 /* Replace each element in "list" by the result of applying
5331 * isl_basic_map_underlying_set to the element.
5333 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5334 __isl_take isl_basic_map_list
*list
)
5341 n
= isl_basic_map_list_n_basic_map(list
);
5342 for (i
= 0; i
< n
; ++i
) {
5343 isl_basic_map
*bmap
;
5344 isl_basic_set
*bset
;
5346 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5347 bset
= isl_basic_set_underlying_set(bmap
);
5348 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5354 __isl_give isl_basic_map
*isl_basic_map_overlying_set(
5355 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_map
*like
)
5357 struct isl_basic_map
*bmap
;
5358 struct isl_ctx
*ctx
;
5365 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5366 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5367 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5369 if (like
->n_div
== 0) {
5370 isl_space
*space
= isl_basic_map_get_space(like
);
5371 isl_basic_map_free(like
);
5372 return isl_basic_map_reset_space(bset
, space
);
5374 bset
= isl_basic_set_cow(bset
);
5377 total
= bset
->dim
->n_out
+ bset
->extra
;
5378 bmap
= bset_to_bmap(bset
);
5379 isl_space_free(bmap
->dim
);
5380 bmap
->dim
= isl_space_copy(like
->dim
);
5383 bmap
->n_div
= like
->n_div
;
5384 bmap
->extra
+= like
->n_div
;
5388 ltotal
= total
- bmap
->extra
+ like
->extra
;
5391 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5392 bmap
->extra
* (1 + 1 + total
));
5393 if (isl_blk_is_error(bmap
->block2
))
5395 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5399 for (i
= 0; i
< bmap
->extra
; ++i
)
5400 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5401 for (i
= 0; i
< like
->n_div
; ++i
) {
5402 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5403 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5405 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5407 isl_basic_map_free(like
);
5408 bmap
= isl_basic_map_simplify(bmap
);
5409 bmap
= isl_basic_map_finalize(bmap
);
5412 isl_basic_map_free(like
);
5413 isl_basic_set_free(bset
);
5417 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5418 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5420 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5421 bset_to_bmap(like
)));
5424 __isl_give isl_set
*isl_map_underlying_set(__isl_take isl_map
*map
)
5428 map
= isl_map_cow(map
);
5431 map
->dim
= isl_space_cow(map
->dim
);
5435 for (i
= 1; i
< map
->n
; ++i
)
5436 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5438 for (i
= 0; i
< map
->n
; ++i
) {
5439 map
->p
[i
] = bset_to_bmap(
5440 isl_basic_map_underlying_set(map
->p
[i
]));
5445 map
->dim
= isl_space_underlying(map
->dim
, 0);
5447 isl_space_free(map
->dim
);
5448 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5452 return set_from_map(map
);
5458 /* Replace the space of "bmap" by "space".
5460 * If the space of "bmap" is identical to "space" (including the identifiers
5461 * of the input and output dimensions), then simply return the original input.
5463 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5464 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5467 isl_space
*bmap_space
;
5469 bmap_space
= isl_basic_map_peek_space(bmap
);
5470 equal
= isl_space_is_equal(bmap_space
, space
);
5471 if (equal
>= 0 && equal
)
5472 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5476 isl_space_free(space
);
5479 bmap
= isl_basic_map_cow(bmap
);
5480 if (!bmap
|| !space
)
5483 isl_space_free(bmap
->dim
);
5486 bmap
= isl_basic_map_finalize(bmap
);
5490 isl_basic_map_free(bmap
);
5491 isl_space_free(space
);
5495 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5496 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5498 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5502 /* Check that the total dimensions of "map" and "space" are the same.
5504 static isl_stat
check_map_space_equal_total_dim(__isl_keep isl_map
*map
,
5505 __isl_keep isl_space
*space
)
5507 unsigned dim1
, dim2
;
5510 return isl_stat_error
;
5511 dim1
= isl_map_dim(map
, isl_dim_all
);
5512 dim2
= isl_space_dim(space
, isl_dim_all
);
5515 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5516 "total dimensions do not match", return isl_stat_error
);
5519 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5520 __isl_take isl_space
*dim
)
5524 map
= isl_map_cow(map
);
5528 for (i
= 0; i
< map
->n
; ++i
) {
5529 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5530 isl_space_copy(dim
));
5534 isl_space_free(map
->dim
);
5540 isl_space_free(dim
);
5544 /* Replace the space of "map" by "space", without modifying
5545 * the dimension of "map".
5547 * If the space of "map" is identical to "space" (including the identifiers
5548 * of the input and output dimensions), then simply return the original input.
5550 __isl_give isl_map
*isl_map_reset_equal_dim_space(__isl_take isl_map
*map
,
5551 __isl_take isl_space
*space
)
5554 isl_space
*map_space
;
5556 map_space
= isl_map_peek_space(map
);
5557 equal
= isl_space_is_equal(map_space
, space
);
5558 if (equal
>= 0 && equal
)
5559 equal
= isl_space_has_equal_ids(map_space
, space
);
5563 isl_space_free(space
);
5566 if (check_map_space_equal_total_dim(map
, space
) < 0)
5568 return isl_map_reset_space(map
, space
);
5571 isl_space_free(space
);
5575 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5576 __isl_take isl_space
*dim
)
5578 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5581 /* Compute the parameter domain of the given basic set.
5583 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5589 is_params
= isl_basic_set_is_params(bset
);
5591 return isl_basic_set_free(bset
);
5595 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5596 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5597 space
= isl_basic_set_get_space(bset
);
5598 space
= isl_space_params(space
);
5599 bset
= isl_basic_set_reset_space(bset
, space
);
5603 /* Construct a zero-dimensional basic set with the given parameter domain.
5605 __isl_give isl_basic_set
*isl_basic_set_from_params(
5606 __isl_take isl_basic_set
*bset
)
5609 space
= isl_basic_set_get_space(bset
);
5610 space
= isl_space_set_from_params(space
);
5611 bset
= isl_basic_set_reset_space(bset
, space
);
5615 /* Compute the parameter domain of the given set.
5617 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5622 if (isl_set_is_params(set
))
5625 n
= isl_set_dim(set
, isl_dim_set
);
5626 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5627 space
= isl_set_get_space(set
);
5628 space
= isl_space_params(space
);
5629 set
= isl_set_reset_space(set
, space
);
5633 /* Construct a zero-dimensional set with the given parameter domain.
5635 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5638 space
= isl_set_get_space(set
);
5639 space
= isl_space_set_from_params(space
);
5640 set
= isl_set_reset_space(set
, space
);
5644 /* Compute the parameter domain of the given map.
5646 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5651 n
= isl_map_dim(map
, isl_dim_in
);
5652 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5653 n
= isl_map_dim(map
, isl_dim_out
);
5654 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5655 space
= isl_map_get_space(map
);
5656 space
= isl_space_params(space
);
5657 map
= isl_map_reset_space(map
, space
);
5661 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5668 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5670 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5671 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5673 return isl_basic_map_reset_space(bmap
, space
);
5676 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5679 return isl_bool_error
;
5680 return isl_space_may_be_set(bmap
->dim
);
5683 /* Is this basic map actually a set?
5684 * Users should never call this function. Outside of isl,
5685 * the type should indicate whether something is a set or a map.
5687 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5690 return isl_bool_error
;
5691 return isl_space_is_set(bmap
->dim
);
5694 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5698 is_set
= isl_basic_map_is_set(bmap
);
5703 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5705 isl_basic_map_free(bmap
);
5709 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5710 __isl_take isl_basic_map
*bmap
)
5714 isl_basic_map
*domain
;
5715 int nparam
, n_in
, n_out
;
5717 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5718 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5719 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5721 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5722 domain
= isl_basic_map_universe(dim
);
5724 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5725 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5726 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5728 for (i
= 0; i
< n_in
; ++i
)
5729 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5732 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5733 return isl_basic_map_finalize(bmap
);
5736 __isl_give isl_basic_map
*isl_basic_map_range_map(
5737 __isl_take isl_basic_map
*bmap
)
5741 isl_basic_map
*range
;
5742 int nparam
, n_in
, n_out
;
5744 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5745 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5746 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5748 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5749 range
= isl_basic_map_universe(dim
);
5751 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5752 bmap
= isl_basic_map_apply_range(bmap
, range
);
5753 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5755 for (i
= 0; i
< n_out
; ++i
)
5756 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5759 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5760 return isl_basic_map_finalize(bmap
);
5763 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5767 return isl_space_may_be_set(map
->dim
);
5770 /* Is this map actually a set?
5771 * Users should never call this function. Outside of isl,
5772 * the type should indicate whether something is a set or a map.
5774 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5777 return isl_bool_error
;
5778 return isl_space_is_set(map
->dim
);
5781 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
5785 struct isl_set
*set
;
5787 is_set
= isl_map_is_set(map
);
5791 return set_from_map(map
);
5793 map
= isl_map_cow(map
);
5797 set
= set_from_map(map
);
5798 set
->dim
= isl_space_range(set
->dim
);
5801 for (i
= 0; i
< map
->n
; ++i
) {
5802 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5806 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5807 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5814 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5818 map
= isl_map_cow(map
);
5822 map
->dim
= isl_space_domain_map(map
->dim
);
5825 for (i
= 0; i
< map
->n
; ++i
) {
5826 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5830 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5831 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5838 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5841 isl_space
*range_dim
;
5843 map
= isl_map_cow(map
);
5847 range_dim
= isl_space_range(isl_map_get_space(map
));
5848 range_dim
= isl_space_from_range(range_dim
);
5849 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5850 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5853 for (i
= 0; i
< map
->n
; ++i
) {
5854 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5858 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5859 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5866 /* Given a wrapped map of the form A[B -> C],
5867 * return the map A[B -> C] -> B.
5869 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5876 if (!isl_set_has_tuple_id(set
))
5877 return isl_map_domain_map(isl_set_unwrap(set
));
5879 id
= isl_set_get_tuple_id(set
);
5880 map
= isl_map_domain_map(isl_set_unwrap(set
));
5881 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5886 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5887 __isl_take isl_basic_set
*bset
)
5889 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5892 __isl_give isl_basic_map
*isl_basic_map_from_range(
5893 __isl_take isl_basic_set
*bset
)
5896 space
= isl_basic_set_get_space(bset
);
5897 space
= isl_space_from_range(space
);
5898 bset
= isl_basic_set_reset_space(bset
, space
);
5899 return bset_to_bmap(bset
);
5902 /* Create a relation with the given set as range.
5903 * The domain of the created relation is a zero-dimensional
5904 * flat anonymous space.
5906 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5909 space
= isl_set_get_space(set
);
5910 space
= isl_space_from_range(space
);
5911 set
= isl_set_reset_space(set
, space
);
5912 return set_to_map(set
);
5915 /* Create a relation with the given set as domain.
5916 * The range of the created relation is a zero-dimensional
5917 * flat anonymous space.
5919 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5921 return isl_map_reverse(isl_map_from_range(set
));
5924 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5925 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5927 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5930 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5931 __isl_take isl_set
*range
)
5933 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5936 /* Return a newly allocated isl_map with given space and flags and
5937 * room for "n" basic maps.
5938 * Make sure that all cached information is cleared.
5940 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5943 struct isl_map
*map
;
5948 isl_die(space
->ctx
, isl_error_internal
,
5949 "negative number of basic maps", goto error
);
5950 map
= isl_calloc(space
->ctx
, struct isl_map
,
5951 sizeof(struct isl_map
) +
5952 (n
- 1) * sizeof(struct isl_basic_map
*));
5956 map
->ctx
= space
->ctx
;
5957 isl_ctx_ref(map
->ctx
);
5965 isl_space_free(space
);
5969 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*space
)
5971 struct isl_basic_map
*bmap
;
5972 bmap
= isl_basic_map_alloc_space(space
, 0, 1, 0);
5973 bmap
= isl_basic_map_set_to_empty(bmap
);
5977 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*space
)
5979 struct isl_basic_set
*bset
;
5980 bset
= isl_basic_set_alloc_space(space
, 0, 1, 0);
5981 bset
= isl_basic_set_set_to_empty(bset
);
5985 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*space
)
5987 struct isl_basic_map
*bmap
;
5988 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 0);
5989 bmap
= isl_basic_map_finalize(bmap
);
5993 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*space
)
5995 struct isl_basic_set
*bset
;
5996 bset
= isl_basic_set_alloc_space(space
, 0, 0, 0);
5997 bset
= isl_basic_set_finalize(bset
);
6001 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
6004 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
6005 isl_basic_map
*bmap
;
6007 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
6008 for (i
= 0; i
< total
; ++i
) {
6009 int k
= isl_basic_map_alloc_inequality(bmap
);
6012 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
6013 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
6017 isl_basic_map_free(bmap
);
6021 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
6023 return isl_basic_map_nat_universe(dim
);
6026 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
6028 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
6031 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
6033 return isl_map_nat_universe(dim
);
6036 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*space
)
6038 return isl_map_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6041 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*space
)
6043 return isl_set_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6046 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*space
)
6048 struct isl_map
*map
;
6051 map
= isl_map_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6052 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(space
));
6056 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*space
)
6058 struct isl_set
*set
;
6061 set
= isl_set_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6062 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(space
));
6066 struct isl_map
*isl_map_dup(struct isl_map
*map
)
6069 struct isl_map
*dup
;
6073 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6074 for (i
= 0; i
< map
->n
; ++i
)
6075 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6079 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6080 __isl_take isl_basic_map
*bmap
)
6084 if (isl_basic_map_plain_is_empty(bmap
)) {
6085 isl_basic_map_free(bmap
);
6088 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6089 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6090 map
->p
[map
->n
] = bmap
;
6092 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6098 isl_basic_map_free(bmap
);
6102 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6113 isl_ctx_deref(map
->ctx
);
6114 for (i
= 0; i
< map
->n
; ++i
)
6115 isl_basic_map_free(map
->p
[i
]);
6116 isl_space_free(map
->dim
);
6122 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
6123 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
6127 bmap
= isl_basic_map_cow(bmap
);
6128 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6129 j
= isl_basic_map_alloc_equality(bmap
);
6132 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6133 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6134 isl_int_set_si(bmap
->eq
[j
][0], value
);
6135 bmap
= isl_basic_map_simplify(bmap
);
6136 return isl_basic_map_finalize(bmap
);
6138 isl_basic_map_free(bmap
);
6142 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6143 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6147 bmap
= isl_basic_map_cow(bmap
);
6148 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6149 j
= isl_basic_map_alloc_equality(bmap
);
6152 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6153 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6154 isl_int_set(bmap
->eq
[j
][0], value
);
6155 bmap
= isl_basic_map_simplify(bmap
);
6156 return isl_basic_map_finalize(bmap
);
6158 isl_basic_map_free(bmap
);
6162 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6163 enum isl_dim_type type
, unsigned pos
, int value
)
6165 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6166 return isl_basic_map_free(bmap
);
6167 return isl_basic_map_fix_pos_si(bmap
,
6168 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6171 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6172 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6174 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6175 return isl_basic_map_free(bmap
);
6176 return isl_basic_map_fix_pos(bmap
,
6177 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6180 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6181 * to be equal to "v".
6183 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6184 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6188 if (!isl_val_is_int(v
))
6189 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6190 "expecting integer value", goto error
);
6191 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6193 pos
+= isl_basic_map_offset(bmap
, type
);
6194 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6198 isl_basic_map_free(bmap
);
6203 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6204 * to be equal to "v".
6206 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6207 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6209 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6212 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6213 enum isl_dim_type type
, unsigned pos
, int value
)
6215 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6219 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6220 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6222 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6226 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6227 unsigned input
, int value
)
6229 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6232 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6233 unsigned dim
, int value
)
6235 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6236 isl_dim_set
, dim
, value
));
6239 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
6241 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6248 isl_basic_map_free(map
->p
[i
]);
6249 if (i
!= map
->n
- 1) {
6250 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6251 map
->p
[i
] = map
->p
[map
->n
- 1];
6258 /* Perform "fn" on each basic map of "map", where we may not be holding
6259 * the only reference to "map".
6260 * In particular, "fn" should be a semantics preserving operation
6261 * that we want to apply to all copies of "map". We therefore need
6262 * to be careful not to modify "map" in a way that breaks "map"
6263 * in case anything goes wrong.
6265 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6266 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6268 struct isl_basic_map
*bmap
;
6274 for (i
= map
->n
- 1; i
>= 0; --i
) {
6275 bmap
= isl_basic_map_copy(map
->p
[i
]);
6279 isl_basic_map_free(map
->p
[i
]);
6281 if (remove_if_empty(map
, i
) < 0)
6291 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6292 enum isl_dim_type type
, unsigned pos
, int value
)
6296 map
= isl_map_cow(map
);
6300 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6301 for (i
= map
->n
- 1; i
>= 0; --i
) {
6302 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6303 if (remove_if_empty(map
, i
) < 0)
6306 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6313 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6314 enum isl_dim_type type
, unsigned pos
, int value
)
6316 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6319 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6320 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6324 map
= isl_map_cow(map
);
6328 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6329 for (i
= 0; i
< map
->n
; ++i
) {
6330 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6334 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6341 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6342 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6344 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6347 /* Fix the value of the variable at position "pos" of type "type" of "map"
6348 * to be equal to "v".
6350 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6351 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6355 map
= isl_map_cow(map
);
6359 if (!isl_val_is_int(v
))
6360 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6361 "expecting integer value", goto error
);
6362 if (pos
>= isl_map_dim(map
, type
))
6363 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6364 "index out of bounds", goto error
);
6365 for (i
= map
->n
- 1; i
>= 0; --i
) {
6366 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6368 if (remove_if_empty(map
, i
) < 0)
6371 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6380 /* Fix the value of the variable at position "pos" of type "type" of "set"
6381 * to be equal to "v".
6383 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6384 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6386 return isl_map_fix_val(set
, type
, pos
, v
);
6389 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6390 unsigned input
, int value
)
6392 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6395 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6397 return set_from_map(isl_map_fix_si(set_to_map(set
),
6398 isl_dim_set
, dim
, value
));
6401 static __isl_give isl_basic_map
*basic_map_bound_si(
6402 __isl_take isl_basic_map
*bmap
,
6403 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6407 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6408 return isl_basic_map_free(bmap
);
6409 pos
+= isl_basic_map_offset(bmap
, type
);
6410 bmap
= isl_basic_map_cow(bmap
);
6411 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6412 j
= isl_basic_map_alloc_inequality(bmap
);
6415 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6417 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6418 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6420 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6421 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6423 bmap
= isl_basic_map_simplify(bmap
);
6424 return isl_basic_map_finalize(bmap
);
6426 isl_basic_map_free(bmap
);
6430 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6431 __isl_take isl_basic_map
*bmap
,
6432 enum isl_dim_type type
, unsigned pos
, int value
)
6434 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6437 /* Constrain the values of the given dimension to be no greater than "value".
6439 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6440 __isl_take isl_basic_map
*bmap
,
6441 enum isl_dim_type type
, unsigned pos
, int value
)
6443 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6446 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6447 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6451 map
= isl_map_cow(map
);
6455 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6456 for (i
= 0; i
< map
->n
; ++i
) {
6457 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6458 type
, pos
, value
, upper
);
6462 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6469 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6470 enum isl_dim_type type
, unsigned pos
, int value
)
6472 return map_bound_si(map
, type
, pos
, value
, 0);
6475 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6476 enum isl_dim_type type
, unsigned pos
, int value
)
6478 return map_bound_si(map
, type
, pos
, value
, 1);
6481 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6482 enum isl_dim_type type
, unsigned pos
, int value
)
6484 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6488 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6489 enum isl_dim_type type
, unsigned pos
, int value
)
6491 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6494 /* Bound the given variable of "bmap" from below (or above is "upper"
6495 * is set) to "value".
6497 static __isl_give isl_basic_map
*basic_map_bound(
6498 __isl_take isl_basic_map
*bmap
,
6499 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6503 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6504 return isl_basic_map_free(bmap
);
6505 pos
+= isl_basic_map_offset(bmap
, type
);
6506 bmap
= isl_basic_map_cow(bmap
);
6507 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6508 j
= isl_basic_map_alloc_inequality(bmap
);
6511 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6513 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6514 isl_int_set(bmap
->ineq
[j
][0], value
);
6516 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6517 isl_int_neg(bmap
->ineq
[j
][0], value
);
6519 bmap
= isl_basic_map_simplify(bmap
);
6520 return isl_basic_map_finalize(bmap
);
6522 isl_basic_map_free(bmap
);
6526 /* Bound the given variable of "map" from below (or above is "upper"
6527 * is set) to "value".
6529 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6530 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6534 map
= isl_map_cow(map
);
6538 if (pos
>= isl_map_dim(map
, type
))
6539 isl_die(map
->ctx
, isl_error_invalid
,
6540 "index out of bounds", goto error
);
6541 for (i
= map
->n
- 1; i
>= 0; --i
) {
6542 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6543 if (remove_if_empty(map
, i
) < 0)
6546 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6553 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6554 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6556 return map_bound(map
, type
, pos
, value
, 0);
6559 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6560 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6562 return map_bound(map
, type
, pos
, value
, 1);
6565 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6566 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6568 return isl_map_lower_bound(set
, type
, pos
, value
);
6571 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6572 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6574 return isl_map_upper_bound(set
, type
, pos
, value
);
6577 /* Force the values of the variable at position "pos" of type "type" of "set"
6578 * to be no smaller than "value".
6580 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6581 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6585 if (!isl_val_is_int(value
))
6586 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6587 "expecting integer value", goto error
);
6588 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6589 isl_val_free(value
);
6592 isl_val_free(value
);
6597 /* Force the values of the variable at position "pos" of type "type" of "set"
6598 * to be no greater than "value".
6600 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6601 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6605 if (!isl_val_is_int(value
))
6606 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6607 "expecting integer value", goto error
);
6608 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6609 isl_val_free(value
);
6612 isl_val_free(value
);
6617 /* Bound the given variable of "bset" from below (or above is "upper"
6618 * is set) to "value".
6620 static __isl_give isl_basic_set
*isl_basic_set_bound(
6621 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6622 isl_int value
, int upper
)
6624 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
6625 type
, pos
, value
, upper
));
6628 /* Bound the given variable of "bset" from below (or above is "upper"
6629 * is set) to "value".
6631 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
6632 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6633 __isl_take isl_val
*value
, int upper
)
6637 if (!isl_val_is_int(value
))
6638 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
6639 "expecting integer value", goto error
);
6640 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
6641 isl_val_free(value
);
6644 isl_val_free(value
);
6645 isl_basic_set_free(bset
);
6649 /* Bound the given variable of "bset" from below to "value".
6651 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
6652 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6653 __isl_take isl_val
*value
)
6655 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
6658 /* Bound the given variable of "bset" from above to "value".
6660 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
6661 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6662 __isl_take isl_val
*value
)
6664 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
6667 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6671 map
= isl_map_cow(map
);
6675 map
->dim
= isl_space_reverse(map
->dim
);
6678 for (i
= 0; i
< map
->n
; ++i
) {
6679 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6683 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6691 #define TYPE isl_pw_multi_aff
6693 #define SUFFIX _pw_multi_aff
6695 #define EMPTY isl_pw_multi_aff_empty
6697 #define ADD isl_pw_multi_aff_union_add
6698 #include "isl_map_lexopt_templ.c"
6700 /* Given a map "map", compute the lexicographically minimal
6701 * (or maximal) image element for each domain element in dom,
6702 * in the form of an isl_pw_multi_aff.
6703 * If "empty" is not NULL, then set *empty to those elements in dom that
6704 * do not have an image element.
6705 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6706 * should be computed over the domain of "map". "empty" is also NULL
6709 * We first compute the lexicographically minimal or maximal element
6710 * in the first basic map. This results in a partial solution "res"
6711 * and a subset "todo" of dom that still need to be handled.
6712 * We then consider each of the remaining maps in "map" and successively
6713 * update both "res" and "todo".
6714 * If "empty" is NULL, then the todo sets are not needed and therefore
6715 * also not computed.
6717 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6718 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6719 __isl_give isl_set
**empty
, unsigned flags
)
6723 isl_pw_multi_aff
*res
;
6726 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6727 if (!map
|| (!full
&& !dom
))
6730 if (isl_map_plain_is_empty(map
)) {
6735 return isl_pw_multi_aff_from_map(map
);
6738 res
= basic_map_partial_lexopt_pw_multi_aff(
6739 isl_basic_map_copy(map
->p
[0]),
6740 isl_set_copy(dom
), empty
, flags
);
6744 for (i
= 1; i
< map
->n
; ++i
) {
6745 isl_pw_multi_aff
*res_i
;
6747 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6748 isl_basic_map_copy(map
->p
[i
]),
6749 isl_set_copy(dom
), empty
, flags
);
6751 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6752 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6754 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6757 todo
= isl_set_intersect(todo
, *empty
);
6776 #define TYPE isl_map
6780 #define EMPTY isl_map_empty
6782 #define ADD isl_map_union_disjoint
6783 #include "isl_map_lexopt_templ.c"
6785 /* Given a map "map", compute the lexicographically minimal
6786 * (or maximal) image element for each domain element in "dom",
6787 * in the form of an isl_map.
6788 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6789 * do not have an image element.
6790 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6791 * should be computed over the domain of "map". "empty" is also NULL
6794 * If the input consists of more than one disjunct, then first
6795 * compute the desired result in the form of an isl_pw_multi_aff and
6796 * then convert that into an isl_map.
6798 * This function used to have an explicit implementation in terms
6799 * of isl_maps, but it would continually intersect the domains of
6800 * partial results with the complement of the domain of the next
6801 * partial solution, potentially leading to an explosion in the number
6802 * of disjuncts if there are several disjuncts in the input.
6803 * An even earlier implementation of this function would look for
6804 * better results in the domain of the partial result and for extra
6805 * results in the complement of this domain, which would lead to
6806 * even more splintering.
6808 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6809 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6810 __isl_give isl_set
**empty
, unsigned flags
)
6813 struct isl_map
*res
;
6814 isl_pw_multi_aff
*pma
;
6816 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6817 if (!map
|| (!full
&& !dom
))
6820 if (isl_map_plain_is_empty(map
)) {
6829 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6835 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6837 return isl_map_from_pw_multi_aff(pma
);
6846 __isl_give isl_map
*isl_map_partial_lexmax(
6847 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6848 __isl_give isl_set
**empty
)
6850 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6853 __isl_give isl_map
*isl_map_partial_lexmin(
6854 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6855 __isl_give isl_set
**empty
)
6857 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6860 __isl_give isl_set
*isl_set_partial_lexmin(
6861 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6862 __isl_give isl_set
**empty
)
6864 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6868 __isl_give isl_set
*isl_set_partial_lexmax(
6869 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6870 __isl_give isl_set
**empty
)
6872 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6876 /* Compute the lexicographic minimum (or maximum if "flags" includes
6877 * ISL_OPT_MAX) of "bset" over its parametric domain.
6879 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6882 return isl_basic_map_lexopt(bset
, flags
);
6885 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6887 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6890 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6892 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6895 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6897 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6900 /* Compute the lexicographic minimum of "bset" over its parametric domain
6901 * for the purpose of quantifier elimination.
6902 * That is, find an explicit representation for all the existentially
6903 * quantified variables in "bset" by computing their lexicographic
6906 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6907 __isl_take isl_basic_set
*bset
)
6909 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6912 /* Given a basic map with one output dimension, compute the minimum or
6913 * maximum of that dimension as an isl_pw_aff.
6915 * Compute the optimum as a lexicographic optimum over the single
6916 * output dimension and extract the single isl_pw_aff from the result.
6918 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6921 isl_pw_multi_aff
*pma
;
6924 bmap
= isl_basic_map_copy(bmap
);
6925 pma
= isl_basic_map_lexopt_pw_multi_aff(bmap
, max
? ISL_OPT_MAX
: 0);
6926 pwaff
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
6927 isl_pw_multi_aff_free(pma
);
6932 /* Compute the minimum or maximum of the given output dimension
6933 * as a function of the parameters and the input dimensions,
6934 * but independently of the other output dimensions.
6936 * We first project out the other output dimension and then compute
6937 * the "lexicographic" maximum in each basic map, combining the results
6938 * using isl_pw_aff_union_max.
6940 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6947 n_out
= isl_map_dim(map
, isl_dim_out
);
6948 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6949 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6954 isl_space
*dim
= isl_map_get_space(map
);
6956 return isl_pw_aff_empty(dim
);
6959 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6960 for (i
= 1; i
< map
->n
; ++i
) {
6961 isl_pw_aff
*pwaff_i
;
6963 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6964 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6972 /* Compute the minimum of the given output dimension as a function of the
6973 * parameters and input dimensions, but independently of
6974 * the other output dimensions.
6976 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6978 return map_dim_opt(map
, pos
, 0);
6981 /* Compute the maximum of the given output dimension as a function of the
6982 * parameters and input dimensions, but independently of
6983 * the other output dimensions.
6985 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6987 return map_dim_opt(map
, pos
, 1);
6990 /* Compute the minimum or maximum of the given set dimension
6991 * as a function of the parameters,
6992 * but independently of the other set dimensions.
6994 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6997 return map_dim_opt(set
, pos
, max
);
7000 /* Compute the maximum of the given set dimension as a function of the
7001 * parameters, but independently of the other set dimensions.
7003 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
7005 return set_dim_opt(set
, pos
, 1);
7008 /* Compute the minimum of the given set dimension as a function of the
7009 * parameters, but independently of the other set dimensions.
7011 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
7013 return set_dim_opt(set
, pos
, 0);
7016 /* Apply a preimage specified by "mat" on the parameters of "bset".
7017 * bset is assumed to have only parameters and divs.
7019 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
7020 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
7027 bset
->dim
= isl_space_cow(bset
->dim
);
7031 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7033 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
7035 bset
->dim
->nparam
= 0;
7036 bset
->dim
->n_out
= nparam
;
7037 bset
= isl_basic_set_preimage(bset
, mat
);
7039 bset
->dim
->nparam
= bset
->dim
->n_out
;
7040 bset
->dim
->n_out
= 0;
7045 isl_basic_set_free(bset
);
7049 /* Apply a preimage specified by "mat" on the parameters of "set".
7050 * set is assumed to have only parameters and divs.
7052 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
7053 __isl_take isl_mat
*mat
)
7061 nparam
= isl_set_dim(set
, isl_dim_param
);
7063 if (mat
->n_row
!= 1 + nparam
)
7064 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
7065 "unexpected number of rows", goto error
);
7067 space
= isl_set_get_space(set
);
7068 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7069 isl_dim_param
, 0, nparam
);
7070 set
= isl_set_reset_space(set
, space
);
7071 set
= isl_set_preimage(set
, mat
);
7072 nparam
= isl_set_dim(set
, isl_dim_out
);
7073 space
= isl_set_get_space(set
);
7074 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7075 isl_dim_out
, 0, nparam
);
7076 set
= isl_set_reset_space(set
, space
);
7084 /* Intersect the basic set "bset" with the affine space specified by the
7085 * equalities in "eq".
7087 static __isl_give isl_basic_set
*basic_set_append_equalities(
7088 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7096 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7101 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7102 for (i
= 0; i
< eq
->n_row
; ++i
) {
7103 k
= isl_basic_set_alloc_equality(bset
);
7106 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7107 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7111 bset
= isl_basic_set_gauss(bset
, NULL
);
7112 bset
= isl_basic_set_finalize(bset
);
7117 isl_basic_set_free(bset
);
7121 /* Intersect the set "set" with the affine space specified by the
7122 * equalities in "eq".
7124 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7132 for (i
= 0; i
< set
->n
; ++i
) {
7133 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7146 /* Given a basic set "bset" that only involves parameters and existentially
7147 * quantified variables, return the index of the first equality
7148 * that only involves parameters. If there is no such equality then
7149 * return bset->n_eq.
7151 * This function assumes that isl_basic_set_gauss has been called on "bset".
7153 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7156 unsigned nparam
, n_div
;
7161 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7162 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7164 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7165 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7172 /* Compute an explicit representation for the existentially quantified
7173 * variables in "bset" by computing the "minimal value" of the set
7174 * variables. Since there are no set variables, the computation of
7175 * the minimal value essentially computes an explicit representation
7176 * of the non-empty part(s) of "bset".
7178 * The input only involves parameters and existentially quantified variables.
7179 * All equalities among parameters have been removed.
7181 * Since the existentially quantified variables in the result are in general
7182 * going to be different from those in the input, we first replace
7183 * them by the minimal number of variables based on their equalities.
7184 * This should simplify the parametric integer programming.
7186 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7188 isl_morph
*morph1
, *morph2
;
7194 if (bset
->n_eq
== 0)
7195 return isl_basic_set_lexmin_compute_divs(bset
);
7197 morph1
= isl_basic_set_parameter_compression(bset
);
7198 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7199 bset
= isl_basic_set_lift(bset
);
7200 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7201 bset
= isl_morph_basic_set(morph2
, bset
);
7202 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7203 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7205 set
= isl_basic_set_lexmin_compute_divs(bset
);
7207 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7212 /* Project the given basic set onto its parameter domain, possibly introducing
7213 * new, explicit, existential variables in the constraints.
7214 * The input has parameters and (possibly implicit) existential variables.
7215 * The output has the same parameters, but only
7216 * explicit existentially quantified variables.
7218 * The actual projection is performed by pip, but pip doesn't seem
7219 * to like equalities very much, so we first remove the equalities
7220 * among the parameters by performing a variable compression on
7221 * the parameters. Afterward, an inverse transformation is performed
7222 * and the equalities among the parameters are inserted back in.
7224 * The variable compression on the parameters may uncover additional
7225 * equalities that were only implicit before. We therefore check
7226 * if there are any new parameter equalities in the result and
7227 * if so recurse. The removal of parameter equalities is required
7228 * for the parameter compression performed by base_compute_divs.
7230 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7234 struct isl_mat
*T
, *T2
;
7235 struct isl_set
*set
;
7238 bset
= isl_basic_set_cow(bset
);
7242 if (bset
->n_eq
== 0)
7243 return base_compute_divs(bset
);
7245 bset
= isl_basic_set_gauss(bset
, NULL
);
7248 if (isl_basic_set_plain_is_empty(bset
))
7249 return isl_set_from_basic_set(bset
);
7251 i
= first_parameter_equality(bset
);
7252 if (i
== bset
->n_eq
)
7253 return base_compute_divs(bset
);
7255 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7256 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7258 eq
= isl_mat_cow(eq
);
7259 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7260 if (T
&& T
->n_col
== 0) {
7264 bset
= isl_basic_set_set_to_empty(bset
);
7265 return isl_set_from_basic_set(bset
);
7267 bset
= basic_set_parameter_preimage(bset
, T
);
7269 i
= first_parameter_equality(bset
);
7272 else if (i
== bset
->n_eq
)
7273 set
= base_compute_divs(bset
);
7275 set
= parameter_compute_divs(bset
);
7276 set
= set_parameter_preimage(set
, T2
);
7277 set
= set_append_equalities(set
, eq
);
7281 /* Insert the divs from "ls" before those of "bmap".
7283 * The number of columns is not changed, which means that the last
7284 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7285 * The caller is responsible for removing the same number of dimensions
7286 * from the space of "bmap".
7288 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7289 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7295 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7299 old_n_div
= bmap
->n_div
;
7300 bmap
= insert_div_rows(bmap
, n_div
);
7304 for (i
= 0; i
< n_div
; ++i
) {
7305 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7306 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7312 /* Replace the space of "bmap" by the space and divs of "ls".
7314 * If "ls" has any divs, then we simplify the result since we may
7315 * have discovered some additional equalities that could simplify
7316 * the div expressions.
7318 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7319 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7323 bmap
= isl_basic_map_cow(bmap
);
7327 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7328 bmap
= insert_divs_from_local_space(bmap
, ls
);
7332 isl_space_free(bmap
->dim
);
7333 bmap
->dim
= isl_local_space_get_space(ls
);
7337 isl_local_space_free(ls
);
7339 bmap
= isl_basic_map_simplify(bmap
);
7340 bmap
= isl_basic_map_finalize(bmap
);
7343 isl_basic_map_free(bmap
);
7344 isl_local_space_free(ls
);
7348 /* Replace the space of "map" by the space and divs of "ls".
7350 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7351 __isl_take isl_local_space
*ls
)
7355 map
= isl_map_cow(map
);
7359 for (i
= 0; i
< map
->n
; ++i
) {
7360 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7361 isl_local_space_copy(ls
));
7365 isl_space_free(map
->dim
);
7366 map
->dim
= isl_local_space_get_space(ls
);
7370 isl_local_space_free(ls
);
7373 isl_local_space_free(ls
);
7378 /* Compute an explicit representation for the existentially
7379 * quantified variables for which do not know any explicit representation yet.
7381 * We first sort the existentially quantified variables so that the
7382 * existentially quantified variables for which we already have an explicit
7383 * representation are placed before those for which we do not.
7384 * The input dimensions, the output dimensions and the existentially
7385 * quantified variables for which we already have an explicit
7386 * representation are then turned into parameters.
7387 * compute_divs returns a map with the same parameters and
7388 * no input or output dimensions and the dimension specification
7389 * is reset to that of the input, including the existentially quantified
7390 * variables for which we already had an explicit representation.
7392 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
7394 struct isl_basic_set
*bset
;
7395 struct isl_set
*set
;
7396 struct isl_map
*map
;
7398 isl_local_space
*ls
;
7405 bmap
= isl_basic_map_sort_divs(bmap
);
7406 bmap
= isl_basic_map_cow(bmap
);
7410 n_known
= isl_basic_map_first_unknown_div(bmap
);
7412 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7414 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7415 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7416 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7417 dim
= isl_space_set_alloc(bmap
->ctx
,
7418 nparam
+ n_in
+ n_out
+ n_known
, 0);
7422 ls
= isl_basic_map_get_local_space(bmap
);
7423 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7424 n_known
, bmap
->n_div
- n_known
);
7426 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7427 swap_div(bmap
, i
- n_known
, i
);
7428 bmap
->n_div
-= n_known
;
7429 bmap
->extra
-= n_known
;
7431 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7432 bset
= bset_from_bmap(bmap
);
7434 set
= parameter_compute_divs(bset
);
7435 map
= set_to_map(set
);
7436 map
= replace_space_by_local_space(map
, ls
);
7440 isl_basic_map_free(bmap
);
7444 /* Remove the explicit representation of local variable "div",
7447 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7448 __isl_take isl_basic_map
*bmap
, int div
)
7452 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7454 return isl_basic_map_free(bmap
);
7458 bmap
= isl_basic_map_cow(bmap
);
7461 isl_int_set_si(bmap
->div
[div
][0], 0);
7465 /* Is local variable "div" of "bmap" marked as not having an explicit
7467 * Note that even if "div" is not marked in this way and therefore
7468 * has an explicit representation, this representation may still
7469 * depend (indirectly) on other local variables that do not
7470 * have an explicit representation.
7472 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7475 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7476 return isl_bool_error
;
7477 return isl_int_is_zero(bmap
->div
[div
][0]);
7480 /* Return the position of the first local variable that does not
7481 * have an explicit representation.
7482 * Return the total number of local variables if they all have
7483 * an explicit representation.
7484 * Return -1 on error.
7486 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7493 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7494 if (!isl_basic_map_div_is_known(bmap
, i
))
7500 /* Return the position of the first local variable that does not
7501 * have an explicit representation.
7502 * Return the total number of local variables if they all have
7503 * an explicit representation.
7504 * Return -1 on error.
7506 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7508 return isl_basic_map_first_unknown_div(bset
);
7511 /* Does "bmap" have an explicit representation for all local variables?
7513 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7517 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7518 first
= isl_basic_map_first_unknown_div(bmap
);
7520 return isl_bool_error
;
7524 /* Do all basic maps in "map" have an explicit representation
7525 * for all local variables?
7527 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7532 return isl_bool_error
;
7534 for (i
= 0; i
< map
->n
; ++i
) {
7535 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7540 return isl_bool_true
;
7543 /* If bmap contains any unknown divs, then compute explicit
7544 * expressions for them. However, this computation may be
7545 * quite expensive, so first try to remove divs that aren't
7548 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7551 struct isl_map
*map
;
7553 known
= isl_basic_map_divs_known(bmap
);
7557 return isl_map_from_basic_map(bmap
);
7559 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7561 known
= isl_basic_map_divs_known(bmap
);
7565 return isl_map_from_basic_map(bmap
);
7567 map
= compute_divs(bmap
);
7570 isl_basic_map_free(bmap
);
7574 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
7578 struct isl_map
*res
;
7585 known
= isl_map_divs_known(map
);
7593 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7594 for (i
= 1 ; i
< map
->n
; ++i
) {
7596 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7597 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7598 res
= isl_map_union_disjoint(res
, r2
);
7600 res
= isl_map_union(res
, r2
);
7607 __isl_give isl_set
*isl_basic_set_compute_divs(__isl_take isl_basic_set
*bset
)
7609 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7612 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7614 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7617 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
7620 struct isl_set
*set
;
7625 map
= isl_map_cow(map
);
7629 set
= set_from_map(map
);
7630 set
->dim
= isl_space_domain(set
->dim
);
7633 for (i
= 0; i
< map
->n
; ++i
) {
7634 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7638 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7639 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7646 /* Return the union of "map1" and "map2", where we assume for now that
7647 * "map1" and "map2" are disjoint. Note that the basic maps inside
7648 * "map1" or "map2" may not be disjoint from each other.
7649 * Also note that this function is also called from isl_map_union,
7650 * which takes care of handling the situation where "map1" and "map2"
7651 * may not be disjoint.
7653 * If one of the inputs is empty, we can simply return the other input.
7654 * Similarly, if one of the inputs is universal, then it is equal to the union.
7656 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7657 __isl_take isl_map
*map2
)
7661 struct isl_map
*map
= NULL
;
7667 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7668 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7669 "spaces don't match", goto error
);
7680 is_universe
= isl_map_plain_is_universe(map1
);
7681 if (is_universe
< 0)
7688 is_universe
= isl_map_plain_is_universe(map2
);
7689 if (is_universe
< 0)
7696 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7697 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7698 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7700 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7701 map1
->n
+ map2
->n
, flags
);
7704 for (i
= 0; i
< map1
->n
; ++i
) {
7705 map
= isl_map_add_basic_map(map
,
7706 isl_basic_map_copy(map1
->p
[i
]));
7710 for (i
= 0; i
< map2
->n
; ++i
) {
7711 map
= isl_map_add_basic_map(map
,
7712 isl_basic_map_copy(map2
->p
[i
]));
7726 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7727 * guaranteed to be disjoint by the caller.
7729 * Note that this functions is called from within isl_map_make_disjoint,
7730 * so we have to be careful not to touch the constraints of the inputs
7733 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7734 __isl_take isl_map
*map2
)
7736 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7739 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7740 * not be disjoint. The parameters are assumed to have been aligned.
7742 * We currently simply call map_union_disjoint, the internal operation
7743 * of which does not really depend on the inputs being disjoint.
7744 * If the result contains more than one basic map, then we clear
7745 * the disjoint flag since the result may contain basic maps from
7746 * both inputs and these are not guaranteed to be disjoint.
7748 * As a special case, if "map1" and "map2" are obviously equal,
7749 * then we simply return "map1".
7751 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7752 __isl_take isl_map
*map2
)
7759 equal
= isl_map_plain_is_equal(map1
, map2
);
7767 map1
= map_union_disjoint(map1
, map2
);
7771 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7779 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7782 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7783 __isl_take isl_map
*map2
)
7785 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7788 __isl_give isl_set
*isl_set_union_disjoint(
7789 __isl_take isl_set
*set1
, __isl_take isl_set
*set2
)
7791 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7795 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7797 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7800 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7803 * "map" and "set" are assumed to be compatible and non-NULL.
7805 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7806 __isl_take isl_set
*set
,
7807 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7808 __isl_take isl_basic_set
*bset
))
7811 struct isl_map
*result
;
7814 if (isl_set_plain_is_universe(set
)) {
7819 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7820 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7821 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7823 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7824 map
->n
* set
->n
, flags
);
7825 for (i
= 0; result
&& i
< map
->n
; ++i
)
7826 for (j
= 0; j
< set
->n
; ++j
) {
7827 result
= isl_map_add_basic_map(result
,
7828 fn(isl_basic_map_copy(map
->p
[i
]),
7829 isl_basic_set_copy(set
->p
[j
])));
7839 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7840 __isl_take isl_set
*set
)
7844 ok
= isl_map_compatible_range(map
, set
);
7848 isl_die(set
->ctx
, isl_error_invalid
,
7849 "incompatible spaces", goto error
);
7851 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7858 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7859 __isl_take isl_set
*set
)
7861 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7864 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7865 __isl_take isl_set
*set
)
7869 ok
= isl_map_compatible_domain(map
, set
);
7873 isl_die(set
->ctx
, isl_error_invalid
,
7874 "incompatible spaces", goto error
);
7876 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7883 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7884 __isl_take isl_set
*set
)
7886 return isl_map_align_params_map_map_and(map
, set
,
7887 &map_intersect_domain
);
7890 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7891 * in the space B -> C, return the intersection.
7892 * The parameters are assumed to have been aligned.
7894 * The map "factor" is first extended to a map living in the space
7895 * [A -> B] -> C and then a regular intersection is computed.
7897 static __isl_give isl_map
*map_intersect_domain_factor_range(
7898 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7901 isl_map
*ext_factor
;
7903 space
= isl_space_domain_factor_domain(isl_map_get_space(map
));
7904 ext_factor
= isl_map_universe(space
);
7905 ext_factor
= isl_map_domain_product(ext_factor
, factor
);
7906 return map_intersect(map
, ext_factor
);
7909 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7910 * in the space B -> C, return the intersection.
7912 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
7913 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7915 return isl_map_align_params_map_map_and(map
, factor
,
7916 &map_intersect_domain_factor_range
);
7919 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7920 * in the space A -> C, return the intersection.
7922 * The map "factor" is first extended to a map living in the space
7923 * A -> [B -> C] and then a regular intersection is computed.
7925 static __isl_give isl_map
*map_intersect_range_factor_range(
7926 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7929 isl_map
*ext_factor
;
7931 space
= isl_space_range_factor_domain(isl_map_get_space(map
));
7932 ext_factor
= isl_map_universe(space
);
7933 ext_factor
= isl_map_range_product(ext_factor
, factor
);
7934 return isl_map_intersect(map
, ext_factor
);
7937 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7938 * in the space A -> C, return the intersection.
7940 __isl_give isl_map
*isl_map_intersect_range_factor_range(
7941 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7943 return isl_map_align_params_map_map_and(map
, factor
,
7944 &map_intersect_range_factor_range
);
7947 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7948 __isl_take isl_map
*map2
)
7952 map1
= isl_map_reverse(map1
);
7953 map1
= isl_map_apply_range(map1
, map2
);
7954 return isl_map_reverse(map1
);
7961 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7962 __isl_take isl_map
*map2
)
7964 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7967 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7968 __isl_take isl_map
*map2
)
7970 isl_space
*dim_result
;
7971 struct isl_map
*result
;
7977 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7978 isl_space_copy(map2
->dim
));
7980 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7983 for (i
= 0; i
< map1
->n
; ++i
)
7984 for (j
= 0; j
< map2
->n
; ++j
) {
7985 result
= isl_map_add_basic_map(result
,
7986 isl_basic_map_apply_range(
7987 isl_basic_map_copy(map1
->p
[i
]),
7988 isl_basic_map_copy(map2
->p
[j
])));
7994 if (result
&& result
->n
<= 1)
7995 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
8003 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
8004 __isl_take isl_map
*map2
)
8006 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
8010 * returns range - domain
8012 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
8014 isl_space
*target_space
;
8015 struct isl_basic_set
*bset
;
8022 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8023 bmap
->dim
, isl_dim_out
),
8025 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
8026 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
8027 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8028 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
8029 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
8030 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
8031 for (i
= 0; i
< dim
; ++i
) {
8032 int j
= isl_basic_map_alloc_equality(bmap
);
8034 bmap
= isl_basic_map_free(bmap
);
8037 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8038 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8039 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
8040 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
8042 bset
= isl_basic_map_domain(bmap
);
8043 bset
= isl_basic_set_reset_space(bset
, target_space
);
8046 isl_basic_map_free(bmap
);
8051 * returns range - domain
8053 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8057 struct isl_set
*result
;
8062 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8063 map
->dim
, isl_dim_out
),
8065 dim
= isl_map_get_space(map
);
8066 dim
= isl_space_domain(dim
);
8067 result
= isl_set_alloc_space(dim
, map
->n
, 0);
8070 for (i
= 0; i
< map
->n
; ++i
)
8071 result
= isl_set_add_basic_set(result
,
8072 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8081 * returns [domain -> range] -> range - domain
8083 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8084 __isl_take isl_basic_map
*bmap
)
8088 isl_basic_map
*domain
;
8092 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8093 bmap
->dim
, isl_dim_out
))
8094 isl_die(bmap
->ctx
, isl_error_invalid
,
8095 "domain and range don't match", goto error
);
8097 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8098 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8100 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
8101 domain
= isl_basic_map_universe(dim
);
8103 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8104 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8105 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8107 total
= isl_basic_map_total_dim(bmap
);
8109 for (i
= 0; i
< n
; ++i
) {
8110 k
= isl_basic_map_alloc_equality(bmap
);
8113 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8114 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8115 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8116 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8119 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8120 return isl_basic_map_finalize(bmap
);
8122 isl_basic_map_free(bmap
);
8127 * returns [domain -> range] -> range - domain
8129 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8132 isl_space
*domain_dim
;
8137 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8138 map
->dim
, isl_dim_out
))
8139 isl_die(map
->ctx
, isl_error_invalid
,
8140 "domain and range don't match", goto error
);
8142 map
= isl_map_cow(map
);
8146 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
8147 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
8148 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
8151 for (i
= 0; i
< map
->n
; ++i
) {
8152 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8156 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8163 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
8165 struct isl_basic_map
*bmap
;
8173 nparam
= dims
->nparam
;
8175 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
8179 for (i
= 0; i
< dim
; ++i
) {
8180 int j
= isl_basic_map_alloc_equality(bmap
);
8183 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8184 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8185 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
8187 return isl_basic_map_finalize(bmap
);
8189 isl_basic_map_free(bmap
);
8193 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
8197 if (dim
->n_in
!= dim
->n_out
)
8198 isl_die(dim
->ctx
, isl_error_invalid
,
8199 "number of input and output dimensions needs to be "
8200 "the same", goto error
);
8201 return basic_map_identity(dim
);
8203 isl_space_free(dim
);
8207 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8209 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8212 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8214 isl_space
*dim
= isl_set_get_space(set
);
8216 id
= isl_map_identity(isl_space_map_from_set(dim
));
8217 return isl_map_intersect_range(id
, set
);
8220 /* Construct a basic set with all set dimensions having only non-negative
8223 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8224 __isl_take isl_space
*space
)
8229 struct isl_basic_set
*bset
;
8233 nparam
= space
->nparam
;
8235 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8238 for (i
= 0; i
< dim
; ++i
) {
8239 int k
= isl_basic_set_alloc_inequality(bset
);
8242 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8243 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8247 isl_basic_set_free(bset
);
8251 /* Construct the half-space x_pos >= 0.
8253 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
8257 isl_basic_set
*nonneg
;
8259 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8260 k
= isl_basic_set_alloc_inequality(nonneg
);
8263 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8264 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8266 return isl_basic_set_finalize(nonneg
);
8268 isl_basic_set_free(nonneg
);
8272 /* Construct the half-space x_pos <= -1.
8274 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
8279 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8280 k
= isl_basic_set_alloc_inequality(neg
);
8283 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8284 isl_int_set_si(neg
->ineq
[k
][0], -1);
8285 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8287 return isl_basic_set_finalize(neg
);
8289 isl_basic_set_free(neg
);
8293 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8294 enum isl_dim_type type
, unsigned first
, unsigned n
)
8298 isl_basic_set
*nonneg
;
8306 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8308 offset
= pos(set
->dim
, type
);
8309 for (i
= 0; i
< n
; ++i
) {
8310 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8311 offset
+ first
+ i
);
8312 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8314 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8323 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8325 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8331 return isl_stat_error
;
8332 if (isl_set_plain_is_empty(set
)) {
8337 return fn(set
, signs
, user
);
8340 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8342 half
= isl_set_intersect(half
, isl_set_copy(set
));
8343 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8347 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8349 half
= isl_set_intersect(half
, set
);
8350 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8353 return isl_stat_error
;
8356 /* Call "fn" on the intersections of "set" with each of the orthants
8357 * (except for obviously empty intersections). The orthant is identified
8358 * by the signs array, with each entry having value 1 or -1 according
8359 * to the sign of the corresponding variable.
8361 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8362 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8371 return isl_stat_error
;
8372 if (isl_set_plain_is_empty(set
))
8375 nparam
= isl_set_dim(set
, isl_dim_param
);
8376 nvar
= isl_set_dim(set
, isl_dim_set
);
8378 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8380 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8388 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8390 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8393 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8394 __isl_keep isl_basic_map
*bmap2
)
8397 struct isl_map
*map1
;
8398 struct isl_map
*map2
;
8400 if (!bmap1
|| !bmap2
)
8401 return isl_bool_error
;
8403 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8404 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8406 is_subset
= isl_map_is_subset(map1
, map2
);
8414 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8415 __isl_keep isl_basic_set
*bset2
)
8417 return isl_basic_map_is_subset(bset1
, bset2
);
8420 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8421 __isl_keep isl_basic_map
*bmap2
)
8425 if (!bmap1
|| !bmap2
)
8426 return isl_bool_error
;
8427 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8428 if (is_subset
!= isl_bool_true
)
8430 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8434 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8435 __isl_keep isl_basic_set
*bset2
)
8437 return isl_basic_map_is_equal(
8438 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8441 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8447 return isl_bool_error
;
8448 for (i
= 0; i
< map
->n
; ++i
) {
8449 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8451 return isl_bool_error
;
8453 return isl_bool_false
;
8455 return isl_bool_true
;
8458 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8460 return map
? map
->n
== 0 : isl_bool_error
;
8463 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8465 return set
? set
->n
== 0 : isl_bool_error
;
8468 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8470 return isl_map_is_empty(set_to_map(set
));
8473 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8474 __isl_keep isl_map
*map2
)
8477 return isl_bool_error
;
8479 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8482 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8483 __isl_keep isl_set
*set2
)
8486 return isl_bool_error
;
8488 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8491 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8496 return isl_bool_error
;
8497 is_subset
= isl_map_is_subset(map1
, map2
);
8498 if (is_subset
!= isl_bool_true
)
8500 is_subset
= isl_map_is_subset(map2
, map1
);
8504 /* Is "map1" equal to "map2"?
8506 * First check if they are obviously equal.
8507 * If not, then perform a more detailed analysis.
8509 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8513 equal
= isl_map_plain_is_equal(map1
, map2
);
8514 if (equal
< 0 || equal
)
8516 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8519 isl_bool
isl_basic_map_is_strict_subset(
8520 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8524 if (!bmap1
|| !bmap2
)
8525 return isl_bool_error
;
8526 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8527 if (is_subset
!= isl_bool_true
)
8529 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8530 if (is_subset
== isl_bool_error
)
8535 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8536 __isl_keep isl_map
*map2
)
8541 return isl_bool_error
;
8542 is_subset
= isl_map_is_subset(map1
, map2
);
8543 if (is_subset
!= isl_bool_true
)
8545 is_subset
= isl_map_is_subset(map2
, map1
);
8546 if (is_subset
== isl_bool_error
)
8551 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8552 __isl_keep isl_set
*set2
)
8554 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8557 /* Is "bmap" obviously equal to the universe with the same space?
8559 * That is, does it not have any constraints?
8561 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8564 return isl_bool_error
;
8565 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8568 /* Is "bset" obviously equal to the universe with the same space?
8570 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8572 return isl_basic_map_plain_is_universe(bset
);
8575 /* If "c" does not involve any existentially quantified variables,
8576 * then set *univ to false and abort
8578 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8580 isl_bool
*univ
= user
;
8583 n
= isl_constraint_dim(c
, isl_dim_div
);
8584 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8585 isl_constraint_free(c
);
8586 if (*univ
< 0 || !*univ
)
8587 return isl_stat_error
;
8591 /* Is "bmap" equal to the universe with the same space?
8593 * First check if it is obviously equal to the universe.
8594 * If not and if there are any constraints not involving
8595 * existentially quantified variables, then it is certainly
8596 * not equal to the universe.
8597 * Otherwise, check if the universe is a subset of "bmap".
8599 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8602 isl_basic_map
*test
;
8604 univ
= isl_basic_map_plain_is_universe(bmap
);
8605 if (univ
< 0 || univ
)
8607 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8608 return isl_bool_false
;
8609 univ
= isl_bool_true
;
8610 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8612 return isl_bool_error
;
8613 if (univ
< 0 || !univ
)
8615 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8616 univ
= isl_basic_map_is_subset(test
, bmap
);
8617 isl_basic_map_free(test
);
8621 /* Is "bset" equal to the universe with the same space?
8623 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8625 return isl_basic_map_is_universe(bset
);
8628 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8633 return isl_bool_error
;
8635 for (i
= 0; i
< map
->n
; ++i
) {
8636 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8641 return isl_bool_false
;
8644 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8646 return isl_map_plain_is_universe(set_to_map(set
));
8649 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8651 struct isl_basic_set
*bset
= NULL
;
8652 struct isl_vec
*sample
= NULL
;
8653 isl_bool empty
, non_empty
;
8656 return isl_bool_error
;
8658 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8659 return isl_bool_true
;
8661 if (isl_basic_map_plain_is_universe(bmap
))
8662 return isl_bool_false
;
8664 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8665 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8666 copy
= isl_basic_map_remove_redundancies(copy
);
8667 empty
= isl_basic_map_plain_is_empty(copy
);
8668 isl_basic_map_free(copy
);
8672 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8674 return isl_bool_error
;
8676 return isl_bool_false
;
8677 isl_vec_free(bmap
->sample
);
8678 bmap
->sample
= NULL
;
8679 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8681 return isl_bool_error
;
8682 sample
= isl_basic_set_sample_vec(bset
);
8684 return isl_bool_error
;
8685 empty
= sample
->size
== 0;
8686 isl_vec_free(bmap
->sample
);
8687 bmap
->sample
= sample
;
8689 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8694 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8697 return isl_bool_error
;
8698 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8701 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8704 return isl_bool_error
;
8705 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8708 /* Is "bmap" known to be non-empty?
8710 * That is, is the cached sample still valid?
8712 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8717 return isl_bool_error
;
8719 return isl_bool_false
;
8720 total
= 1 + isl_basic_map_total_dim(bmap
);
8721 if (bmap
->sample
->size
!= total
)
8722 return isl_bool_false
;
8723 return isl_basic_map_contains(bmap
, bmap
->sample
);
8726 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8728 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8731 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8732 __isl_take isl_basic_map
*bmap2
)
8734 struct isl_map
*map
;
8735 if (!bmap1
|| !bmap2
)
8738 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8740 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8743 map
= isl_map_add_basic_map(map
, bmap1
);
8744 map
= isl_map_add_basic_map(map
, bmap2
);
8747 isl_basic_map_free(bmap1
);
8748 isl_basic_map_free(bmap2
);
8752 struct isl_set
*isl_basic_set_union(
8753 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8755 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8756 bset_to_bmap(bset2
)));
8759 /* Order divs such that any div only depends on previous divs */
8760 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8761 __isl_take isl_basic_map
*bmap
)
8769 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8771 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8773 if (isl_int_is_zero(bmap
->div
[i
][0]))
8775 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8780 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8781 "integer division depends on itself",
8782 return isl_basic_map_free(bmap
));
8783 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8789 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8791 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8794 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8801 for (i
= 0; i
< map
->n
; ++i
) {
8802 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8813 /* Sort the local variables of "bset".
8815 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8816 __isl_take isl_basic_set
*bset
)
8818 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8821 /* Apply the expansion computed by isl_merge_divs.
8822 * The expansion itself is given by "exp" while the resulting
8823 * list of divs is given by "div".
8825 * Move the integer divisions of "bmap" into the right position
8826 * according to "exp" and then introduce the additional integer
8827 * divisions, adding div constraints.
8828 * The moving should be done first to avoid moving coefficients
8829 * in the definitions of the extra integer divisions.
8831 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8832 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8837 bmap
= isl_basic_map_cow(bmap
);
8841 if (div
->n_row
< bmap
->n_div
)
8842 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8843 "not an expansion", goto error
);
8845 n_div
= bmap
->n_div
;
8846 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8847 div
->n_row
- n_div
, 0,
8848 2 * (div
->n_row
- n_div
));
8850 for (i
= n_div
; i
< div
->n_row
; ++i
)
8851 if (isl_basic_map_alloc_div(bmap
) < 0)
8854 for (j
= n_div
- 1; j
>= 0; --j
) {
8857 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8860 for (i
= 0; i
< div
->n_row
; ++i
) {
8861 if (j
< n_div
&& exp
[j
] == i
) {
8864 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8865 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8867 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8875 isl_basic_map_free(bmap
);
8880 /* Apply the expansion computed by isl_merge_divs.
8881 * The expansion itself is given by "exp" while the resulting
8882 * list of divs is given by "div".
8884 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8885 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8887 return isl_basic_map_expand_divs(bset
, div
, exp
);
8890 /* Look for a div in dst that corresponds to the div "div" in src.
8891 * The divs before "div" in src and dst are assumed to be the same.
8893 * Returns -1 if no corresponding div was found and the position
8894 * of the corresponding div in dst otherwise.
8896 static int find_div(__isl_keep isl_basic_map
*dst
,
8897 __isl_keep isl_basic_map
*src
, unsigned div
)
8901 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8903 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8904 for (i
= div
; i
< dst
->n_div
; ++i
)
8905 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8906 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8907 dst
->n_div
- div
) == -1)
8912 /* Align the divs of "dst" to those of "src", adding divs from "src"
8913 * if needed. That is, make sure that the first src->n_div divs
8914 * of the result are equal to those of src.
8916 * The result is not finalized as by design it will have redundant
8917 * divs if any divs from "src" were copied.
8919 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8920 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8923 int known
, extended
;
8927 return isl_basic_map_free(dst
);
8929 if (src
->n_div
== 0)
8932 known
= isl_basic_map_divs_known(src
);
8934 return isl_basic_map_free(dst
);
8936 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8937 "some src divs are unknown",
8938 return isl_basic_map_free(dst
));
8940 src
= isl_basic_map_order_divs(src
);
8943 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8944 for (i
= 0; i
< src
->n_div
; ++i
) {
8945 int j
= find_div(dst
, src
, i
);
8948 int extra
= src
->n_div
- i
;
8949 dst
= isl_basic_map_cow(dst
);
8952 dst
= isl_basic_map_extend_space(dst
,
8953 isl_space_copy(dst
->dim
),
8954 extra
, 0, 2 * extra
);
8957 j
= isl_basic_map_alloc_div(dst
);
8959 return isl_basic_map_free(dst
);
8960 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8961 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8962 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8963 return isl_basic_map_free(dst
);
8966 isl_basic_map_swap_div(dst
, i
, j
);
8971 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
8979 map
= isl_map_compute_divs(map
);
8980 map
= isl_map_cow(map
);
8984 for (i
= 1; i
< map
->n
; ++i
)
8985 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8986 for (i
= 1; i
< map
->n
; ++i
) {
8987 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8989 return isl_map_free(map
);
8992 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8996 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
8998 return isl_map_align_divs_internal(map
);
9001 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
9003 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
9006 /* Align the divs of the basic maps in "map" to those
9007 * of the basic maps in "list", as well as to the other basic maps in "map".
9008 * The elements in "list" are assumed to have known divs.
9010 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
9011 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
9015 map
= isl_map_compute_divs(map
);
9016 map
= isl_map_cow(map
);
9018 return isl_map_free(map
);
9022 n
= isl_basic_map_list_n_basic_map(list
);
9023 for (i
= 0; i
< n
; ++i
) {
9024 isl_basic_map
*bmap
;
9026 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
9027 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
9028 isl_basic_map_free(bmap
);
9031 return isl_map_free(map
);
9033 return isl_map_align_divs_internal(map
);
9036 /* Align the divs of each element of "list" to those of "bmap".
9037 * Both "bmap" and the elements of "list" are assumed to have known divs.
9039 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
9040 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
9045 return isl_basic_map_list_free(list
);
9047 n
= isl_basic_map_list_n_basic_map(list
);
9048 for (i
= 0; i
< n
; ++i
) {
9049 isl_basic_map
*bmap_i
;
9051 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9052 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
9053 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
9059 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
9060 __isl_take isl_map
*map
)
9064 ok
= isl_map_compatible_domain(map
, set
);
9068 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9069 "incompatible spaces", goto error
);
9070 map
= isl_map_intersect_domain(map
, set
);
9071 set
= isl_map_range(map
);
9079 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9080 __isl_take isl_map
*map
)
9082 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
9085 /* There is no need to cow as removing empty parts doesn't change
9086 * the meaning of the set.
9088 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9095 for (i
= map
->n
- 1; i
>= 0; --i
)
9096 remove_if_empty(map
, i
);
9101 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
9103 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9106 /* Create a binary relation that maps the shared initial "pos" dimensions
9107 * of "bset1" and "bset2" to the remaining dimensions of "bset1" and "bset2".
9109 static __isl_give isl_basic_map
*join_initial(__isl_keep isl_basic_set
*bset1
,
9110 __isl_keep isl_basic_set
*bset2
, int pos
)
9112 isl_basic_map
*bmap1
;
9113 isl_basic_map
*bmap2
;
9115 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9116 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9117 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9118 isl_dim_out
, 0, pos
);
9119 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9120 isl_dim_out
, 0, pos
);
9121 return isl_basic_map_range_product(bmap1
, bmap2
);
9124 /* Given two basic sets bset1 and bset2, compute the maximal difference
9125 * between the values of dimension pos in bset1 and those in bset2
9126 * for any common value of the parameters and dimensions preceding pos.
9128 static enum isl_lp_result
basic_set_maximal_difference_at(
9129 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9130 int pos
, isl_int
*opt
)
9132 isl_basic_map
*bmap1
;
9133 struct isl_ctx
*ctx
;
9134 struct isl_vec
*obj
;
9138 enum isl_lp_result res
;
9140 if (!bset1
|| !bset2
)
9141 return isl_lp_error
;
9143 nparam
= isl_basic_set_n_param(bset1
);
9144 dim1
= isl_basic_set_n_dim(bset1
);
9146 bmap1
= join_initial(bset1
, bset2
, pos
);
9148 return isl_lp_error
;
9150 total
= isl_basic_map_total_dim(bmap1
);
9152 obj
= isl_vec_alloc(ctx
, 1 + total
);
9155 isl_seq_clr(obj
->block
.data
, 1 + total
);
9156 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9157 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9158 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9160 isl_basic_map_free(bmap1
);
9164 isl_basic_map_free(bmap1
);
9165 return isl_lp_error
;
9168 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9169 * for any common value of the parameters and dimensions preceding pos
9170 * in both basic sets, the values of dimension pos in bset1 are
9171 * smaller or larger than those in bset2.
9174 * 1 if bset1 follows bset2
9175 * -1 if bset1 precedes bset2
9176 * 0 if bset1 and bset2 are incomparable
9177 * -2 if some error occurred.
9179 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
9180 struct isl_basic_set
*bset2
, int pos
)
9183 enum isl_lp_result res
;
9188 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9190 if (res
== isl_lp_empty
)
9192 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9193 res
== isl_lp_unbounded
)
9195 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9204 /* Given two basic sets bset1 and bset2, check whether
9205 * for any common value of the parameters and dimensions preceding pos
9206 * there is a value of dimension pos in bset1 that is larger
9207 * than a value of the same dimension in bset2.
9210 * 1 if there exists such a pair
9211 * 0 if there is no such pair, but there is a pair of equal values
9213 * -2 if some error occurred.
9215 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9216 __isl_keep isl_basic_set
*bset2
, int pos
)
9219 isl_basic_map
*bmap
;
9222 dim1
= isl_basic_set_dim(bset1
, isl_dim_set
);
9223 bmap
= join_initial(bset1
, bset2
, pos
);
9224 bmap
= isl_basic_map_order_ge(bmap
, isl_dim_out
, 0,
9225 isl_dim_out
, dim1
- pos
);
9226 empty
= isl_basic_map_is_empty(bmap
);
9230 isl_basic_map_free(bmap
);
9233 bmap
= isl_basic_map_order_gt(bmap
, isl_dim_out
, 0,
9234 isl_dim_out
, dim1
- pos
);
9235 empty
= isl_basic_map_is_empty(bmap
);
9238 isl_basic_map_free(bmap
);
9243 isl_basic_map_free(bmap
);
9247 /* Given two sets set1 and set2, check whether
9248 * for any common value of the parameters and dimensions preceding pos
9249 * there is a value of dimension pos in set1 that is larger
9250 * than a value of the same dimension in set2.
9253 * 1 if there exists such a pair
9254 * 0 if there is no such pair, but there is a pair of equal values
9256 * -2 if some error occurred.
9258 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9259 __isl_keep isl_set
*set2
, int pos
)
9267 for (i
= 0; i
< set1
->n
; ++i
)
9268 for (j
= 0; j
< set2
->n
; ++j
) {
9270 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9271 if (f
== 1 || f
== -2)
9280 static isl_bool
isl_basic_map_plain_has_fixed_var(
9281 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9288 return isl_bool_error
;
9289 total
= isl_basic_map_total_dim(bmap
);
9290 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9291 for (; d
+1 > pos
; --d
)
9292 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9296 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9297 return isl_bool_false
;
9298 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9299 return isl_bool_false
;
9300 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9301 return isl_bool_false
;
9303 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9304 return isl_bool_true
;
9306 return isl_bool_false
;
9309 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9310 unsigned pos
, isl_int
*val
)
9318 return isl_bool_error
;
9320 return isl_bool_false
;
9322 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9325 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9326 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9327 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9328 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9329 fixed
= isl_bool_false
;
9332 isl_int_set(*val
, v
);
9338 static isl_bool
isl_basic_set_plain_has_fixed_var(
9339 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9341 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9345 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9346 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9348 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9349 return isl_bool_error
;
9350 return isl_basic_map_plain_has_fixed_var(bmap
,
9351 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9354 /* If "bmap" obviously lies on a hyperplane where the given dimension
9355 * has a fixed value, then return that value.
9356 * Otherwise return NaN.
9358 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9359 __isl_keep isl_basic_map
*bmap
,
9360 enum isl_dim_type type
, unsigned pos
)
9368 ctx
= isl_basic_map_get_ctx(bmap
);
9369 v
= isl_val_alloc(ctx
);
9372 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9374 return isl_val_free(v
);
9376 isl_int_set_si(v
->d
, 1);
9380 return isl_val_nan(ctx
);
9383 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9384 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9386 if (pos
>= isl_map_dim(map
, type
))
9387 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9388 "position out of bounds", return isl_bool_error
);
9389 return isl_map_plain_has_fixed_var(map
,
9390 map_offset(map
, type
) - 1 + pos
, val
);
9393 /* If "map" obviously lies on a hyperplane where the given dimension
9394 * has a fixed value, then return that value.
9395 * Otherwise return NaN.
9397 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9398 enum isl_dim_type type
, unsigned pos
)
9406 ctx
= isl_map_get_ctx(map
);
9407 v
= isl_val_alloc(ctx
);
9410 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9412 return isl_val_free(v
);
9414 isl_int_set_si(v
->d
, 1);
9418 return isl_val_nan(ctx
);
9421 /* If "set" obviously lies on a hyperplane where the given dimension
9422 * has a fixed value, then return that value.
9423 * Otherwise return NaN.
9425 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9426 enum isl_dim_type type
, unsigned pos
)
9428 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9431 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9432 * then return this fixed value in *val.
9434 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9435 unsigned dim
, isl_int
*val
)
9437 return isl_basic_set_plain_has_fixed_var(bset
,
9438 isl_basic_set_n_param(bset
) + dim
, val
);
9441 /* Return -1 if the constraint "c1" should be sorted before "c2"
9442 * and 1 if it should be sorted after "c2".
9443 * Return 0 if the two constraints are the same (up to the constant term).
9445 * In particular, if a constraint involves later variables than another
9446 * then it is sorted after this other constraint.
9447 * uset_gist depends on constraints without existentially quantified
9448 * variables sorting first.
9450 * For constraints that have the same latest variable, those
9451 * with the same coefficient for this latest variable (first in absolute value
9452 * and then in actual value) are grouped together.
9453 * This is useful for detecting pairs of constraints that can
9454 * be chained in their printed representation.
9456 * Finally, within a group, constraints are sorted according to
9457 * their coefficients (excluding the constant term).
9459 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9461 isl_int
**c1
= (isl_int
**) p1
;
9462 isl_int
**c2
= (isl_int
**) p2
;
9464 unsigned size
= *(unsigned *) arg
;
9467 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9468 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9473 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9476 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9480 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9483 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9484 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9485 * and 0 if the two constraints are the same (up to the constant term).
9487 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9488 isl_int
*c1
, isl_int
*c2
)
9494 total
= isl_basic_map_total_dim(bmap
);
9495 return sort_constraint_cmp(&c1
, &c2
, &total
);
9498 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9499 __isl_take isl_basic_map
*bmap
)
9505 if (bmap
->n_ineq
== 0)
9507 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9509 total
= isl_basic_map_total_dim(bmap
);
9510 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9511 &sort_constraint_cmp
, &total
) < 0)
9512 return isl_basic_map_free(bmap
);
9516 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9517 __isl_take isl_basic_set
*bset
)
9519 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9520 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9523 __isl_give isl_basic_map
*isl_basic_map_normalize(
9524 __isl_take isl_basic_map
*bmap
)
9528 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9530 bmap
= isl_basic_map_remove_redundancies(bmap
);
9531 bmap
= isl_basic_map_sort_constraints(bmap
);
9533 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9536 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9537 __isl_keep isl_basic_map
*bmap2
)
9541 isl_space
*space1
, *space2
;
9543 if (!bmap1
|| !bmap2
)
9548 space1
= isl_basic_map_peek_space(bmap1
);
9549 space2
= isl_basic_map_peek_space(bmap2
);
9550 cmp
= isl_space_cmp(space1
, space2
);
9553 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9554 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9555 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9556 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9557 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9559 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9561 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9563 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9564 return bmap1
->n_eq
- bmap2
->n_eq
;
9565 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9566 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9567 if (bmap1
->n_div
!= bmap2
->n_div
)
9568 return bmap1
->n_div
- bmap2
->n_div
;
9569 total
= isl_basic_map_total_dim(bmap1
);
9570 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9571 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9575 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9576 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9580 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9581 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9588 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9589 __isl_keep isl_basic_set
*bset2
)
9591 return isl_basic_map_plain_cmp(bset1
, bset2
);
9594 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9600 if (set1
->n
!= set2
->n
)
9601 return set1
->n
- set2
->n
;
9603 for (i
= 0; i
< set1
->n
; ++i
) {
9604 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9612 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9613 __isl_keep isl_basic_map
*bmap2
)
9615 if (!bmap1
|| !bmap2
)
9616 return isl_bool_error
;
9617 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9620 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9621 __isl_keep isl_basic_set
*bset2
)
9623 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9624 bset_to_bmap(bset2
));
9627 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9629 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9630 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9632 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9635 /* Sort the basic maps of "map" and remove duplicate basic maps.
9637 * While removing basic maps, we make sure that the basic maps remain
9638 * sorted because isl_map_normalize expects the basic maps of the result
9641 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9645 map
= isl_map_remove_empty_parts(map
);
9648 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9649 for (i
= map
->n
- 1; i
>= 1; --i
) {
9650 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9652 isl_basic_map_free(map
->p
[i
-1]);
9653 for (j
= i
; j
< map
->n
; ++j
)
9654 map
->p
[j
- 1] = map
->p
[j
];
9661 /* Remove obvious duplicates among the basic maps of "map".
9663 * Unlike isl_map_normalize, this function does not remove redundant
9664 * constraints and only removes duplicates that have exactly the same
9665 * constraints in the input. It does sort the constraints and
9666 * the basic maps to ease the detection of duplicates.
9668 * If "map" has already been normalized or if the basic maps are
9669 * disjoint, then there can be no duplicates.
9671 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9674 isl_basic_map
*bmap
;
9680 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9682 for (i
= 0; i
< map
->n
; ++i
) {
9683 bmap
= isl_basic_map_copy(map
->p
[i
]);
9684 bmap
= isl_basic_map_sort_constraints(bmap
);
9686 return isl_map_free(map
);
9687 isl_basic_map_free(map
->p
[i
]);
9691 map
= sort_and_remove_duplicates(map
);
9695 /* We normalize in place, but if anything goes wrong we need
9696 * to return NULL, so we need to make sure we don't change the
9697 * meaning of any possible other copies of map.
9699 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9702 struct isl_basic_map
*bmap
;
9706 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9708 for (i
= 0; i
< map
->n
; ++i
) {
9709 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9712 isl_basic_map_free(map
->p
[i
]);
9716 map
= sort_and_remove_duplicates(map
);
9718 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9725 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9727 return set_from_map(isl_map_normalize(set_to_map(set
)));
9730 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9731 __isl_keep isl_map
*map2
)
9737 return isl_bool_error
;
9740 return isl_bool_true
;
9741 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9742 return isl_bool_false
;
9744 map1
= isl_map_copy(map1
);
9745 map2
= isl_map_copy(map2
);
9746 map1
= isl_map_normalize(map1
);
9747 map2
= isl_map_normalize(map2
);
9750 equal
= map1
->n
== map2
->n
;
9751 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9752 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9762 return isl_bool_error
;
9765 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9766 __isl_keep isl_set
*set2
)
9768 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9771 /* Return the basic maps in "map" as a list.
9773 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9774 __isl_keep isl_map
*map
)
9778 isl_basic_map_list
*list
;
9782 ctx
= isl_map_get_ctx(map
);
9783 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9785 for (i
= 0; i
< map
->n
; ++i
) {
9786 isl_basic_map
*bmap
;
9788 bmap
= isl_basic_map_copy(map
->p
[i
]);
9789 list
= isl_basic_map_list_add(list
, bmap
);
9795 /* Return the intersection of the elements in the non-empty list "list".
9796 * All elements are assumed to live in the same space.
9798 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9799 __isl_take isl_basic_map_list
*list
)
9802 isl_basic_map
*bmap
;
9806 n
= isl_basic_map_list_n_basic_map(list
);
9808 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9809 "expecting non-empty list", goto error
);
9811 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9812 for (i
= 1; i
< n
; ++i
) {
9813 isl_basic_map
*bmap_i
;
9815 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9816 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9819 isl_basic_map_list_free(list
);
9822 isl_basic_map_list_free(list
);
9826 /* Return the intersection of the elements in the non-empty list "list".
9827 * All elements are assumed to live in the same space.
9829 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9830 __isl_take isl_basic_set_list
*list
)
9832 return isl_basic_map_list_intersect(list
);
9835 /* Return the union of the elements of "list".
9836 * The list is required to have at least one element.
9838 __isl_give isl_set
*isl_basic_set_list_union(
9839 __isl_take isl_basic_set_list
*list
)
9843 isl_basic_set
*bset
;
9848 n
= isl_basic_set_list_n_basic_set(list
);
9850 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9851 "expecting non-empty list", goto error
);
9853 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9854 space
= isl_basic_set_get_space(bset
);
9855 isl_basic_set_free(bset
);
9857 set
= isl_set_alloc_space(space
, n
, 0);
9858 for (i
= 0; i
< n
; ++i
) {
9859 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9860 set
= isl_set_add_basic_set(set
, bset
);
9863 isl_basic_set_list_free(list
);
9866 isl_basic_set_list_free(list
);
9870 /* Return the union of the elements in the non-empty list "list".
9871 * All elements are assumed to live in the same space.
9873 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9880 n
= isl_set_list_n_set(list
);
9882 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9883 "expecting non-empty list", goto error
);
9885 set
= isl_set_list_get_set(list
, 0);
9886 for (i
= 1; i
< n
; ++i
) {
9889 set_i
= isl_set_list_get_set(list
, i
);
9890 set
= isl_set_union(set
, set_i
);
9893 isl_set_list_free(list
);
9896 isl_set_list_free(list
);
9900 __isl_give isl_basic_map
*isl_basic_map_product(
9901 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9903 isl_space
*dim_result
= NULL
;
9904 struct isl_basic_map
*bmap
;
9905 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9906 struct isl_dim_map
*dim_map1
, *dim_map2
;
9908 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9910 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9911 isl_space_copy(bmap2
->dim
));
9913 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9914 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9915 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9916 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9917 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9919 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9920 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9921 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9922 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9923 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9924 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9925 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9926 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9927 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9928 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9929 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9931 bmap
= isl_basic_map_alloc_space(dim_result
,
9932 bmap1
->n_div
+ bmap2
->n_div
,
9933 bmap1
->n_eq
+ bmap2
->n_eq
,
9934 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9935 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9936 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9937 bmap
= isl_basic_map_simplify(bmap
);
9938 return isl_basic_map_finalize(bmap
);
9940 isl_basic_map_free(bmap1
);
9941 isl_basic_map_free(bmap2
);
9945 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9946 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9948 isl_basic_map
*prod
;
9950 prod
= isl_basic_map_product(bmap1
, bmap2
);
9951 prod
= isl_basic_map_flatten(prod
);
9955 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9956 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9958 return isl_basic_map_flat_range_product(bset1
, bset2
);
9961 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9962 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9964 isl_space
*space_result
= NULL
;
9965 isl_basic_map
*bmap
;
9966 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9967 struct isl_dim_map
*dim_map1
, *dim_map2
;
9969 if (!bmap1
|| !bmap2
)
9972 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9973 isl_space_copy(bmap2
->dim
));
9975 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9976 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9977 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9978 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9980 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9981 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9982 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9983 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9984 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9985 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9986 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9987 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9988 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9989 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9990 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9992 bmap
= isl_basic_map_alloc_space(space_result
,
9993 bmap1
->n_div
+ bmap2
->n_div
,
9994 bmap1
->n_eq
+ bmap2
->n_eq
,
9995 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9996 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9997 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9998 bmap
= isl_basic_map_simplify(bmap
);
9999 return isl_basic_map_finalize(bmap
);
10001 isl_basic_map_free(bmap1
);
10002 isl_basic_map_free(bmap2
);
10006 __isl_give isl_basic_map
*isl_basic_map_range_product(
10007 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10010 isl_space
*dim_result
= NULL
;
10011 isl_basic_map
*bmap
;
10012 unsigned in
, out1
, out2
, nparam
, total
, pos
;
10013 struct isl_dim_map
*dim_map1
, *dim_map2
;
10015 rational
= isl_basic_map_is_rational(bmap1
);
10016 if (rational
>= 0 && rational
)
10017 rational
= isl_basic_map_is_rational(bmap2
);
10018 if (!bmap1
|| !bmap2
|| rational
< 0)
10021 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
10024 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
10025 isl_space_copy(bmap2
->dim
));
10027 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10028 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10029 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
10030 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10032 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
10033 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10034 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10035 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10036 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10037 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10038 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
10039 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
10040 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10041 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10042 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10044 bmap
= isl_basic_map_alloc_space(dim_result
,
10045 bmap1
->n_div
+ bmap2
->n_div
,
10046 bmap1
->n_eq
+ bmap2
->n_eq
,
10047 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10048 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10049 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10051 bmap
= isl_basic_map_set_rational(bmap
);
10052 bmap
= isl_basic_map_simplify(bmap
);
10053 return isl_basic_map_finalize(bmap
);
10055 isl_basic_map_free(bmap1
);
10056 isl_basic_map_free(bmap2
);
10060 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
10061 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10063 isl_basic_map
*prod
;
10065 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10066 prod
= isl_basic_map_flatten_range(prod
);
10070 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10071 * and collect the results.
10072 * The result live in the space obtained by calling "space_product"
10073 * on the spaces of "map1" and "map2".
10074 * If "remove_duplicates" is set then the result may contain duplicates
10075 * (even if the inputs do not) and so we try and remove the obvious
10078 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10079 __isl_take isl_map
*map2
,
10080 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10081 __isl_take isl_space
*right
),
10082 __isl_give isl_basic_map
*(*basic_map_product
)(
10083 __isl_take isl_basic_map
*left
,
10084 __isl_take isl_basic_map
*right
),
10085 int remove_duplicates
)
10087 unsigned flags
= 0;
10088 struct isl_map
*result
;
10092 m
= isl_map_has_equal_params(map1
, map2
);
10096 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10097 "parameters don't match", goto error
);
10099 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10100 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10101 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10103 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10104 isl_space_copy(map2
->dim
)),
10105 map1
->n
* map2
->n
, flags
);
10108 for (i
= 0; i
< map1
->n
; ++i
)
10109 for (j
= 0; j
< map2
->n
; ++j
) {
10110 struct isl_basic_map
*part
;
10111 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
10112 isl_basic_map_copy(map2
->p
[j
]));
10113 if (isl_basic_map_is_empty(part
))
10114 isl_basic_map_free(part
);
10116 result
= isl_map_add_basic_map(result
, part
);
10120 if (remove_duplicates
)
10121 result
= isl_map_remove_obvious_duplicates(result
);
10122 isl_map_free(map1
);
10123 isl_map_free(map2
);
10126 isl_map_free(map1
);
10127 isl_map_free(map2
);
10131 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
10133 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
10134 __isl_take isl_map
*map2
)
10136 return map_product(map1
, map2
, &isl_space_product
,
10137 &isl_basic_map_product
, 0);
10140 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
10141 __isl_take isl_map
*map2
)
10143 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
10146 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
10148 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
10149 __isl_take isl_map
*map2
)
10153 prod
= isl_map_product(map1
, map2
);
10154 prod
= isl_map_flatten(prod
);
10158 /* Given two set A and B, construct its Cartesian product A x B.
10160 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10162 return isl_map_range_product(set1
, set2
);
10165 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10166 __isl_take isl_set
*set2
)
10168 return isl_map_flat_range_product(set1
, set2
);
10171 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10173 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10174 __isl_take isl_map
*map2
)
10176 return map_product(map1
, map2
, &isl_space_domain_product
,
10177 &isl_basic_map_domain_product
, 1);
10180 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10182 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10183 __isl_take isl_map
*map2
)
10185 return map_product(map1
, map2
, &isl_space_range_product
,
10186 &isl_basic_map_range_product
, 1);
10189 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10190 __isl_take isl_map
*map2
)
10192 return isl_map_align_params_map_map_and(map1
, map2
,
10193 &map_domain_product_aligned
);
10196 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10197 __isl_take isl_map
*map2
)
10199 return isl_map_align_params_map_map_and(map1
, map2
,
10200 &map_range_product_aligned
);
10203 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10205 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10208 int total1
, keep1
, total2
, keep2
;
10212 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10213 !isl_space_range_is_wrapping(map
->dim
))
10214 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10215 "not a product", return isl_map_free(map
));
10217 space
= isl_map_get_space(map
);
10218 total1
= isl_space_dim(space
, isl_dim_in
);
10219 total2
= isl_space_dim(space
, isl_dim_out
);
10220 space
= isl_space_factor_domain(space
);
10221 keep1
= isl_space_dim(space
, isl_dim_in
);
10222 keep2
= isl_space_dim(space
, isl_dim_out
);
10223 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10224 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10225 map
= isl_map_reset_space(map
, space
);
10230 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10232 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10235 int total1
, keep1
, total2
, keep2
;
10239 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10240 !isl_space_range_is_wrapping(map
->dim
))
10241 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10242 "not a product", return isl_map_free(map
));
10244 space
= isl_map_get_space(map
);
10245 total1
= isl_space_dim(space
, isl_dim_in
);
10246 total2
= isl_space_dim(space
, isl_dim_out
);
10247 space
= isl_space_factor_range(space
);
10248 keep1
= isl_space_dim(space
, isl_dim_in
);
10249 keep2
= isl_space_dim(space
, isl_dim_out
);
10250 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10251 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10252 map
= isl_map_reset_space(map
, space
);
10257 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10259 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10266 if (!isl_space_domain_is_wrapping(map
->dim
))
10267 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10268 "domain is not a product", return isl_map_free(map
));
10270 space
= isl_map_get_space(map
);
10271 total
= isl_space_dim(space
, isl_dim_in
);
10272 space
= isl_space_domain_factor_domain(space
);
10273 keep
= isl_space_dim(space
, isl_dim_in
);
10274 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10275 map
= isl_map_reset_space(map
, space
);
10280 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10282 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10289 if (!isl_space_domain_is_wrapping(map
->dim
))
10290 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10291 "domain is not a product", return isl_map_free(map
));
10293 space
= isl_map_get_space(map
);
10294 total
= isl_space_dim(space
, isl_dim_in
);
10295 space
= isl_space_domain_factor_range(space
);
10296 keep
= isl_space_dim(space
, isl_dim_in
);
10297 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10298 map
= isl_map_reset_space(map
, space
);
10303 /* Given a map A -> [B -> C], extract the map A -> B.
10305 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10312 if (!isl_space_range_is_wrapping(map
->dim
))
10313 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10314 "range is not a product", return isl_map_free(map
));
10316 space
= isl_map_get_space(map
);
10317 total
= isl_space_dim(space
, isl_dim_out
);
10318 space
= isl_space_range_factor_domain(space
);
10319 keep
= isl_space_dim(space
, isl_dim_out
);
10320 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10321 map
= isl_map_reset_space(map
, space
);
10326 /* Given a map A -> [B -> C], extract the map A -> C.
10328 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10335 if (!isl_space_range_is_wrapping(map
->dim
))
10336 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10337 "range is not a product", return isl_map_free(map
));
10339 space
= isl_map_get_space(map
);
10340 total
= isl_space_dim(space
, isl_dim_out
);
10341 space
= isl_space_range_factor_range(space
);
10342 keep
= isl_space_dim(space
, isl_dim_out
);
10343 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10344 map
= isl_map_reset_space(map
, space
);
10349 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10351 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10352 __isl_take isl_map
*map2
)
10356 prod
= isl_map_domain_product(map1
, map2
);
10357 prod
= isl_map_flatten_domain(prod
);
10361 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10363 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10364 __isl_take isl_map
*map2
)
10368 prod
= isl_map_range_product(map1
, map2
);
10369 prod
= isl_map_flatten_range(prod
);
10373 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10376 uint32_t hash
= isl_hash_init();
10381 bmap
= isl_basic_map_copy(bmap
);
10382 bmap
= isl_basic_map_normalize(bmap
);
10385 total
= isl_basic_map_total_dim(bmap
);
10386 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10387 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10389 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10390 isl_hash_hash(hash
, c_hash
);
10392 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10393 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10395 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10396 isl_hash_hash(hash
, c_hash
);
10398 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10399 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10401 if (isl_int_is_zero(bmap
->div
[i
][0]))
10403 isl_hash_byte(hash
, i
& 0xFF);
10404 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10405 isl_hash_hash(hash
, c_hash
);
10407 isl_basic_map_free(bmap
);
10411 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10413 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10416 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10423 map
= isl_map_copy(map
);
10424 map
= isl_map_normalize(map
);
10428 hash
= isl_hash_init();
10429 for (i
= 0; i
< map
->n
; ++i
) {
10430 uint32_t bmap_hash
;
10431 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10432 isl_hash_hash(hash
, bmap_hash
);
10440 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10442 return isl_map_get_hash(set_to_map(set
));
10445 /* Return the number of basic maps in the (current) representation of "map".
10447 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10449 return map
? map
->n
: 0;
10452 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10454 return set
? set
->n
: 0;
10457 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10458 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10463 return isl_stat_error
;
10465 for (i
= 0; i
< map
->n
; ++i
)
10466 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10467 return isl_stat_error
;
10469 return isl_stat_ok
;
10472 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10473 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10478 return isl_stat_error
;
10480 for (i
= 0; i
< set
->n
; ++i
)
10481 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10482 return isl_stat_error
;
10484 return isl_stat_ok
;
10487 /* Return a list of basic sets, the union of which is equal to "set".
10489 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10490 __isl_keep isl_set
*set
)
10493 isl_basic_set_list
*list
;
10498 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10499 for (i
= 0; i
< set
->n
; ++i
) {
10500 isl_basic_set
*bset
;
10502 bset
= isl_basic_set_copy(set
->p
[i
]);
10503 list
= isl_basic_set_list_add(list
, bset
);
10509 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10516 bset
= isl_basic_set_cow(bset
);
10520 dim
= isl_basic_set_get_space(bset
);
10521 dim
= isl_space_lift(dim
, bset
->n_div
);
10524 isl_space_free(bset
->dim
);
10526 bset
->extra
-= bset
->n_div
;
10529 bset
= isl_basic_set_finalize(bset
);
10533 isl_basic_set_free(bset
);
10537 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10543 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10548 set
= isl_set_cow(set
);
10552 n_div
= set
->p
[0]->n_div
;
10553 dim
= isl_set_get_space(set
);
10554 dim
= isl_space_lift(dim
, n_div
);
10557 isl_space_free(set
->dim
);
10560 for (i
= 0; i
< set
->n
; ++i
) {
10561 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10572 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10580 dim
= isl_basic_set_total_dim(bset
);
10581 size
+= bset
->n_eq
* (1 + dim
);
10582 size
+= bset
->n_ineq
* (1 + dim
);
10583 size
+= bset
->n_div
* (2 + dim
);
10588 int isl_set_size(__isl_keep isl_set
*set
)
10596 for (i
= 0; i
< set
->n
; ++i
)
10597 size
+= isl_basic_set_size(set
->p
[i
]);
10602 /* Check if there is any lower bound (if lower == 0) and/or upper
10603 * bound (if upper == 0) on the specified dim.
10605 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10606 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10610 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10611 return isl_bool_error
;
10613 pos
+= isl_basic_map_offset(bmap
, type
);
10615 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10616 if (isl_int_is_zero(bmap
->div
[i
][0]))
10618 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10619 return isl_bool_true
;
10622 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10623 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10624 return isl_bool_true
;
10626 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10627 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10634 return lower
&& upper
;
10637 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10638 enum isl_dim_type type
, unsigned pos
)
10640 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10643 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10644 enum isl_dim_type type
, unsigned pos
)
10646 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10649 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10650 enum isl_dim_type type
, unsigned pos
)
10652 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10655 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10656 enum isl_dim_type type
, unsigned pos
)
10661 return isl_bool_error
;
10663 for (i
= 0; i
< map
->n
; ++i
) {
10665 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10666 if (bounded
< 0 || !bounded
)
10670 return isl_bool_true
;
10673 /* Return true if the specified dim is involved in both an upper bound
10674 * and a lower bound.
10676 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10677 enum isl_dim_type type
, unsigned pos
)
10679 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10682 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10684 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10685 enum isl_dim_type type
, unsigned pos
,
10686 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10687 enum isl_dim_type type
, unsigned pos
))
10692 return isl_bool_error
;
10694 for (i
= 0; i
< map
->n
; ++i
) {
10696 bounded
= fn(map
->p
[i
], type
, pos
);
10697 if (bounded
< 0 || bounded
)
10701 return isl_bool_false
;
10704 /* Return 1 if the specified dim is involved in any lower bound.
10706 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10707 enum isl_dim_type type
, unsigned pos
)
10709 return has_any_bound(set
, type
, pos
,
10710 &isl_basic_map_dim_has_lower_bound
);
10713 /* Return 1 if the specified dim is involved in any upper bound.
10715 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10716 enum isl_dim_type type
, unsigned pos
)
10718 return has_any_bound(set
, type
, pos
,
10719 &isl_basic_map_dim_has_upper_bound
);
10722 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10724 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10725 enum isl_dim_type type
, unsigned pos
,
10726 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10727 enum isl_dim_type type
, unsigned pos
))
10732 return isl_bool_error
;
10734 for (i
= 0; i
< map
->n
; ++i
) {
10736 bounded
= fn(map
->p
[i
], type
, pos
);
10737 if (bounded
< 0 || !bounded
)
10741 return isl_bool_true
;
10744 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10746 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10747 enum isl_dim_type type
, unsigned pos
)
10749 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10752 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10754 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10755 enum isl_dim_type type
, unsigned pos
)
10757 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10760 /* For each of the "n" variables starting at "first", determine
10761 * the sign of the variable and put the results in the first "n"
10762 * elements of the array "signs".
10764 * 1 means that the variable is non-negative
10765 * -1 means that the variable is non-positive
10766 * 0 means the variable attains both positive and negative values.
10768 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10769 unsigned first
, unsigned n
, int *signs
)
10771 isl_vec
*bound
= NULL
;
10772 struct isl_tab
*tab
= NULL
;
10773 struct isl_tab_undo
*snap
;
10776 if (!bset
|| !signs
)
10777 return isl_stat_error
;
10779 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10780 tab
= isl_tab_from_basic_set(bset
, 0);
10781 if (!bound
|| !tab
)
10784 isl_seq_clr(bound
->el
, bound
->size
);
10785 isl_int_set_si(bound
->el
[0], -1);
10787 snap
= isl_tab_snap(tab
);
10788 for (i
= 0; i
< n
; ++i
) {
10791 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10792 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10794 empty
= tab
->empty
;
10795 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10796 if (isl_tab_rollback(tab
, snap
) < 0)
10804 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10805 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10807 empty
= tab
->empty
;
10808 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10809 if (isl_tab_rollback(tab
, snap
) < 0)
10812 signs
[i
] = empty
? -1 : 0;
10816 isl_vec_free(bound
);
10817 return isl_stat_ok
;
10820 isl_vec_free(bound
);
10821 return isl_stat_error
;
10824 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10825 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10827 if (!bset
|| !signs
)
10828 return isl_stat_error
;
10829 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10830 return isl_stat_error
);
10832 first
+= pos(bset
->dim
, type
) - 1;
10833 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10836 /* Is it possible for the integer division "div" to depend (possibly
10837 * indirectly) on any output dimensions?
10839 * If the div is undefined, then we conservatively assume that it
10840 * may depend on them.
10841 * Otherwise, we check if it actually depends on them or on any integer
10842 * divisions that may depend on them.
10844 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10847 unsigned n_out
, o_out
;
10848 unsigned n_div
, o_div
;
10850 if (isl_int_is_zero(bmap
->div
[div
][0]))
10851 return isl_bool_true
;
10853 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10854 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10856 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10857 return isl_bool_true
;
10859 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10860 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10862 for (i
= 0; i
< n_div
; ++i
) {
10863 isl_bool may_involve
;
10865 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10867 may_involve
= div_may_involve_output(bmap
, i
);
10868 if (may_involve
< 0 || may_involve
)
10869 return may_involve
;
10872 return isl_bool_false
;
10875 /* Return the first integer division of "bmap" in the range
10876 * [first, first + n[ that may depend on any output dimensions and
10877 * that has a non-zero coefficient in "c" (where the first coefficient
10878 * in "c" corresponds to integer division "first").
10880 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10881 isl_int
*c
, int first
, int n
)
10888 for (k
= first
; k
< first
+ n
; ++k
) {
10889 isl_bool may_involve
;
10891 if (isl_int_is_zero(c
[k
]))
10893 may_involve
= div_may_involve_output(bmap
, k
);
10894 if (may_involve
< 0)
10903 /* Look for a pair of inequality constraints in "bmap" of the form
10905 * -l + i >= 0 or i >= l
10907 * n + l - i >= 0 or i <= l + n
10909 * with n < "m" and i the output dimension at position "pos".
10910 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10911 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10912 * and earlier output dimensions, as well as integer divisions that do
10913 * not involve any of the output dimensions.
10915 * Return the index of the first inequality constraint or bmap->n_ineq
10916 * if no such pair can be found.
10918 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10919 int pos
, isl_int m
)
10924 unsigned n_div
, o_div
;
10925 unsigned n_out
, o_out
;
10931 ctx
= isl_basic_map_get_ctx(bmap
);
10932 total
= isl_basic_map_total_dim(bmap
);
10933 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10934 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10935 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10936 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10937 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10938 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10940 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10941 n_out
- (pos
+ 1)) != -1)
10943 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10946 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10947 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10950 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10951 bmap
->ineq
[j
] + 1, total
))
10955 if (j
>= bmap
->n_ineq
)
10957 isl_int_add(bmap
->ineq
[i
][0],
10958 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10959 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10960 isl_int_sub(bmap
->ineq
[i
][0],
10961 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10964 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10970 return bmap
->n_ineq
;
10973 /* Return the index of the equality of "bmap" that defines
10974 * the output dimension "pos" in terms of earlier dimensions.
10975 * The equality may also involve integer divisions, as long
10976 * as those integer divisions are defined in terms of
10977 * parameters or input dimensions.
10978 * In this case, *div is set to the number of integer divisions and
10979 * *ineq is set to the number of inequality constraints (provided
10980 * div and ineq are not NULL).
10982 * The equality may also involve a single integer division involving
10983 * the output dimensions (typically only output dimension "pos") as
10984 * long as the coefficient of output dimension "pos" is 1 or -1 and
10985 * there is a pair of constraints i >= l and i <= l + n, with i referring
10986 * to output dimension "pos", l an expression involving only earlier
10987 * dimensions and n smaller than the coefficient of the integer division
10988 * in the equality. In this case, the output dimension can be defined
10989 * in terms of a modulo expression that does not involve the integer division.
10990 * *div is then set to this single integer division and
10991 * *ineq is set to the index of constraint i >= l.
10993 * Return bmap->n_eq if there is no such equality.
10994 * Return -1 on error.
10996 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10997 int pos
, int *div
, int *ineq
)
11000 unsigned n_out
, o_out
;
11001 unsigned n_div
, o_div
;
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
);
11012 *ineq
= bmap
->n_ineq
;
11015 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
11016 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
11018 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
11019 n_out
- (pos
+ 1)) != -1)
11021 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11025 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
11026 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
11028 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11029 k
+ 1, n_div
- (k
+1)) < n_div
)
11031 l
= find_modulo_constraint_pair(bmap
, pos
,
11032 bmap
->eq
[j
][o_div
+ k
]);
11035 if (l
>= bmap
->n_ineq
)
11047 /* Check if the given basic map is obviously single-valued.
11048 * In particular, for each output dimension, check that there is
11049 * an equality that defines the output dimension in terms of
11050 * earlier dimensions.
11052 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11058 return isl_bool_error
;
11060 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11062 for (i
= 0; i
< n_out
; ++i
) {
11065 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11068 return isl_bool_error
;
11069 if (eq
>= bmap
->n_eq
)
11070 return isl_bool_false
;
11073 return isl_bool_true
;
11076 /* Check if the given basic map is single-valued.
11077 * We simply compute
11081 * and check if the result is a subset of the identity mapping.
11083 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11086 isl_basic_map
*test
;
11090 sv
= isl_basic_map_plain_is_single_valued(bmap
);
11094 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
11095 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
11097 space
= isl_basic_map_get_space(bmap
);
11098 space
= isl_space_map_from_set(isl_space_range(space
));
11099 id
= isl_basic_map_identity(space
);
11101 sv
= isl_basic_map_is_subset(test
, id
);
11103 isl_basic_map_free(test
);
11104 isl_basic_map_free(id
);
11109 /* Check if the given map is obviously single-valued.
11111 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
11114 return isl_bool_error
;
11116 return isl_bool_true
;
11118 return isl_bool_false
;
11120 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
11123 /* Check if the given map is single-valued.
11124 * We simply compute
11128 * and check if the result is a subset of the identity mapping.
11130 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
11137 sv
= isl_map_plain_is_single_valued(map
);
11141 test
= isl_map_reverse(isl_map_copy(map
));
11142 test
= isl_map_apply_range(test
, isl_map_copy(map
));
11144 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
11145 id
= isl_map_identity(dim
);
11147 sv
= isl_map_is_subset(test
, id
);
11149 isl_map_free(test
);
11155 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
11159 map
= isl_map_copy(map
);
11160 map
= isl_map_reverse(map
);
11161 in
= isl_map_is_single_valued(map
);
11167 /* Check if the given map is obviously injective.
11169 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11173 map
= isl_map_copy(map
);
11174 map
= isl_map_reverse(map
);
11175 in
= isl_map_plain_is_single_valued(map
);
11181 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11185 sv
= isl_map_is_single_valued(map
);
11189 return isl_map_is_injective(map
);
11192 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11194 return isl_map_is_single_valued(set_to_map(set
));
11197 /* Does "map" only map elements to themselves?
11199 * If the domain and range spaces are different, then "map"
11200 * is considered not to be an identity relation, even if it is empty.
11201 * Otherwise, construct the maximal identity relation and
11202 * check whether "map" is a subset of this relation.
11204 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11208 isl_bool equal
, is_identity
;
11210 space
= isl_map_get_space(map
);
11211 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11212 isl_space_free(space
);
11213 if (equal
< 0 || !equal
)
11216 id
= isl_map_identity(isl_map_get_space(map
));
11217 is_identity
= isl_map_is_subset(map
, id
);
11220 return is_identity
;
11223 int isl_map_is_translation(__isl_keep isl_map
*map
)
11228 delta
= isl_map_deltas(isl_map_copy(map
));
11229 ok
= isl_set_is_singleton(delta
);
11230 isl_set_free(delta
);
11235 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11237 if (isl_seq_first_non_zero(p
, pos
) != -1)
11239 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11244 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11251 return isl_bool_error
;
11253 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11254 return isl_bool_false
;
11256 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11257 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11258 for (j
= 0; j
< nvar
; ++j
) {
11259 int lower
= 0, upper
= 0;
11260 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11261 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11263 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11264 return isl_bool_false
;
11267 if (i
< bset
->n_eq
)
11269 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11270 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11272 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11273 return isl_bool_false
;
11274 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11279 if (!lower
|| !upper
)
11280 return isl_bool_false
;
11283 return isl_bool_true
;
11286 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11289 return isl_bool_error
;
11291 return isl_bool_false
;
11293 return isl_basic_set_is_box(set
->p
[0]);
11296 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11299 return isl_bool_error
;
11301 return isl_space_is_wrapping(bset
->dim
);
11304 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11307 return isl_bool_error
;
11309 return isl_space_is_wrapping(set
->dim
);
11312 /* Modify the space of "map" through a call to "change".
11313 * If "can_change" is set (not NULL), then first call it to check
11314 * if the modification is allowed, printing the error message "cannot_change"
11317 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11318 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11319 const char *cannot_change
,
11320 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11328 ok
= can_change
? can_change(map
) : isl_bool_true
;
11330 return isl_map_free(map
);
11332 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11333 return isl_map_free(map
));
11335 space
= change(isl_map_get_space(map
));
11336 map
= isl_map_reset_space(map
, space
);
11341 /* Is the domain of "map" a wrapped relation?
11343 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11346 return isl_bool_error
;
11348 return isl_space_domain_is_wrapping(map
->dim
);
11351 /* Does "map" have a wrapped relation in both domain and range?
11353 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
11355 return isl_space_is_product(isl_map_peek_space(map
));
11358 /* Is the range of "map" a wrapped relation?
11360 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11363 return isl_bool_error
;
11365 return isl_space_range_is_wrapping(map
->dim
);
11368 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11370 bmap
= isl_basic_map_cow(bmap
);
11374 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11378 bmap
= isl_basic_map_finalize(bmap
);
11380 return bset_from_bmap(bmap
);
11382 isl_basic_map_free(bmap
);
11386 /* Given a map A -> B, return the set (A -> B).
11388 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11390 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11393 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11395 bset
= isl_basic_set_cow(bset
);
11399 bset
->dim
= isl_space_unwrap(bset
->dim
);
11403 bset
= isl_basic_set_finalize(bset
);
11405 return bset_to_bmap(bset
);
11407 isl_basic_set_free(bset
);
11411 /* Given a set (A -> B), return the map A -> B.
11412 * Error out if "set" is not of the form (A -> B).
11414 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11416 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11417 "not a wrapping set", &isl_space_unwrap
);
11420 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11421 enum isl_dim_type type
)
11426 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11429 bmap
= isl_basic_map_cow(bmap
);
11433 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11437 bmap
= isl_basic_map_finalize(bmap
);
11441 isl_basic_map_free(bmap
);
11445 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11446 enum isl_dim_type type
)
11453 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11456 map
= isl_map_cow(map
);
11460 for (i
= 0; i
< map
->n
; ++i
) {
11461 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11465 map
->dim
= isl_space_reset(map
->dim
, type
);
11475 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11480 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11483 bmap
= isl_basic_map_cow(bmap
);
11487 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11491 bmap
= isl_basic_map_finalize(bmap
);
11495 isl_basic_map_free(bmap
);
11499 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11501 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11504 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11505 __isl_take isl_basic_map
*bmap
)
11510 if (!bmap
->dim
->nested
[0])
11513 bmap
= isl_basic_map_cow(bmap
);
11517 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11521 bmap
= isl_basic_map_finalize(bmap
);
11525 isl_basic_map_free(bmap
);
11529 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11530 __isl_take isl_basic_map
*bmap
)
11535 if (!bmap
->dim
->nested
[1])
11538 bmap
= isl_basic_map_cow(bmap
);
11542 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11546 bmap
= isl_basic_map_finalize(bmap
);
11550 isl_basic_map_free(bmap
);
11554 /* Remove any internal structure from the spaces of domain and range of "map".
11556 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11561 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11564 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11567 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11569 return set_from_map(isl_map_flatten(set_to_map(set
)));
11572 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11574 isl_space
*dim
, *flat_dim
;
11577 dim
= isl_set_get_space(set
);
11578 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11579 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11580 map
= isl_map_intersect_domain(map
, set
);
11585 /* Remove any internal structure from the space of the domain of "map".
11587 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11592 if (!map
->dim
->nested
[0])
11595 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11598 /* Remove any internal structure from the space of the range of "map".
11600 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11605 if (!map
->dim
->nested
[1])
11608 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11611 /* Reorder the dimensions of "bmap" according to the given dim_map
11612 * and set the dimension specification to "dim" and
11613 * perform Gaussian elimination on the result.
11615 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11616 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11618 isl_basic_map
*res
;
11621 bmap
= isl_basic_map_cow(bmap
);
11622 if (!bmap
|| !dim
|| !dim_map
)
11625 flags
= bmap
->flags
;
11626 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11627 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11628 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11629 res
= isl_basic_map_alloc_space(dim
,
11630 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11631 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11633 res
->flags
= flags
;
11634 res
= isl_basic_map_gauss(res
, NULL
);
11635 res
= isl_basic_map_finalize(res
);
11639 isl_basic_map_free(bmap
);
11640 isl_space_free(dim
);
11644 /* Reorder the dimensions of "map" according to given reordering.
11646 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11647 __isl_take isl_reordering
*r
)
11650 struct isl_dim_map
*dim_map
;
11652 map
= isl_map_cow(map
);
11653 dim_map
= isl_dim_map_from_reordering(r
);
11654 if (!map
|| !r
|| !dim_map
)
11657 for (i
= 0; i
< map
->n
; ++i
) {
11658 struct isl_dim_map
*dim_map_i
;
11660 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11662 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11663 isl_space_copy(r
->dim
), dim_map_i
);
11669 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11671 isl_reordering_free(r
);
11677 isl_reordering_free(r
);
11681 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11682 __isl_take isl_reordering
*r
)
11684 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11687 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11688 __isl_take isl_space
*model
)
11693 if (!map
|| !model
)
11696 ctx
= isl_space_get_ctx(model
);
11697 if (!isl_space_has_named_params(model
))
11698 isl_die(ctx
, isl_error_invalid
,
11699 "model has unnamed parameters", goto error
);
11700 if (isl_map_check_named_params(map
) < 0)
11702 aligned
= isl_map_space_has_equal_params(map
, model
);
11706 isl_reordering
*exp
;
11708 model
= isl_space_drop_dims(model
, isl_dim_in
,
11709 0, isl_space_dim(model
, isl_dim_in
));
11710 model
= isl_space_drop_dims(model
, isl_dim_out
,
11711 0, isl_space_dim(model
, isl_dim_out
));
11712 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11713 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11714 map
= isl_map_realign(map
, exp
);
11717 isl_space_free(model
);
11720 isl_space_free(model
);
11725 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11726 __isl_take isl_space
*model
)
11728 return isl_map_align_params(set
, model
);
11731 /* Align the parameters of "bmap" to those of "model", introducing
11732 * additional parameters if needed.
11734 __isl_give isl_basic_map
*isl_basic_map_align_params(
11735 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11738 isl_bool equal_params
;
11740 if (!bmap
|| !model
)
11743 ctx
= isl_space_get_ctx(model
);
11744 if (!isl_space_has_named_params(model
))
11745 isl_die(ctx
, isl_error_invalid
,
11746 "model has unnamed parameters", goto error
);
11747 if (!isl_space_has_named_params(bmap
->dim
))
11748 isl_die(ctx
, isl_error_invalid
,
11749 "relation has unnamed parameters", goto error
);
11750 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11751 if (equal_params
< 0)
11753 if (!equal_params
) {
11754 isl_reordering
*exp
;
11755 struct isl_dim_map
*dim_map
;
11757 model
= isl_space_drop_dims(model
, isl_dim_in
,
11758 0, isl_space_dim(model
, isl_dim_in
));
11759 model
= isl_space_drop_dims(model
, isl_dim_out
,
11760 0, isl_space_dim(model
, isl_dim_out
));
11761 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11762 exp
= isl_reordering_extend_space(exp
,
11763 isl_basic_map_get_space(bmap
));
11764 dim_map
= isl_dim_map_from_reordering(exp
);
11765 bmap
= isl_basic_map_realign(bmap
,
11766 exp
? isl_space_copy(exp
->dim
) : NULL
,
11767 isl_dim_map_extend(dim_map
, bmap
));
11768 isl_reordering_free(exp
);
11772 isl_space_free(model
);
11775 isl_space_free(model
);
11776 isl_basic_map_free(bmap
);
11780 /* Do "bset" and "space" have the same parameters?
11782 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11783 __isl_keep isl_space
*space
)
11785 isl_space
*bset_space
;
11787 bset_space
= isl_basic_set_peek_space(bset
);
11788 return isl_space_has_equal_params(bset_space
, space
);
11791 /* Do "map" and "space" have the same parameters?
11793 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11794 __isl_keep isl_space
*space
)
11796 isl_space
*map_space
;
11798 map_space
= isl_map_peek_space(map
);
11799 return isl_space_has_equal_params(map_space
, space
);
11802 /* Do "set" and "space" have the same parameters?
11804 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11805 __isl_keep isl_space
*space
)
11807 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11810 /* Align the parameters of "bset" to those of "model", introducing
11811 * additional parameters if needed.
11813 __isl_give isl_basic_set
*isl_basic_set_align_params(
11814 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11816 return isl_basic_map_align_params(bset
, model
);
11819 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11820 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11821 enum isl_dim_type c2
, enum isl_dim_type c3
,
11822 enum isl_dim_type c4
, enum isl_dim_type c5
)
11824 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11825 struct isl_mat
*mat
;
11831 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11832 isl_basic_map_total_dim(bmap
) + 1);
11835 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11836 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11837 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11838 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11839 isl_int_set(mat
->row
[i
][pos
],
11840 bmap
->eq
[i
][off
+ k
]);
11848 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11849 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11850 enum isl_dim_type c2
, enum isl_dim_type c3
,
11851 enum isl_dim_type c4
, enum isl_dim_type c5
)
11853 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11854 struct isl_mat
*mat
;
11860 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11861 isl_basic_map_total_dim(bmap
) + 1);
11864 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11865 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11866 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11867 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11868 isl_int_set(mat
->row
[i
][pos
],
11869 bmap
->ineq
[i
][off
+ k
]);
11877 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11878 __isl_take isl_space
*dim
,
11879 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11880 enum isl_dim_type c2
, enum isl_dim_type c3
,
11881 enum isl_dim_type c4
, enum isl_dim_type c5
)
11883 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11884 isl_basic_map
*bmap
;
11890 if (!dim
|| !eq
|| !ineq
)
11893 if (eq
->n_col
!= ineq
->n_col
)
11894 isl_die(dim
->ctx
, isl_error_invalid
,
11895 "equalities and inequalities matrices should have "
11896 "same number of columns", goto error
);
11898 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11900 if (eq
->n_col
< total
)
11901 isl_die(dim
->ctx
, isl_error_invalid
,
11902 "number of columns too small", goto error
);
11904 extra
= eq
->n_col
- total
;
11906 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11907 eq
->n_row
, ineq
->n_row
);
11910 for (i
= 0; i
< extra
; ++i
) {
11911 k
= isl_basic_map_alloc_div(bmap
);
11914 isl_int_set_si(bmap
->div
[k
][0], 0);
11916 for (i
= 0; i
< eq
->n_row
; ++i
) {
11917 l
= isl_basic_map_alloc_equality(bmap
);
11920 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11921 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11922 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11923 isl_int_set(bmap
->eq
[l
][off
+ k
],
11929 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11930 l
= isl_basic_map_alloc_inequality(bmap
);
11933 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11934 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11935 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11936 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11937 ineq
->row
[i
][pos
]);
11943 isl_space_free(dim
);
11945 isl_mat_free(ineq
);
11947 bmap
= isl_basic_map_simplify(bmap
);
11948 return isl_basic_map_finalize(bmap
);
11950 isl_space_free(dim
);
11952 isl_mat_free(ineq
);
11956 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11957 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11958 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11960 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11961 c1
, c2
, c3
, c4
, isl_dim_in
);
11964 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11965 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11966 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11968 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11969 c1
, c2
, c3
, c4
, isl_dim_in
);
11972 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11973 __isl_take isl_space
*dim
,
11974 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11975 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11977 isl_basic_map
*bmap
;
11978 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11979 c1
, c2
, c3
, c4
, isl_dim_in
);
11980 return bset_from_bmap(bmap
);
11983 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11986 return isl_bool_error
;
11988 return isl_space_can_zip(bmap
->dim
);
11991 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11994 return isl_bool_error
;
11996 return isl_space_can_zip(map
->dim
);
11999 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
12000 * (A -> C) -> (B -> D).
12002 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
12011 if (!isl_basic_map_can_zip(bmap
))
12012 isl_die(bmap
->ctx
, isl_error_invalid
,
12013 "basic map cannot be zipped", goto error
);
12014 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
12015 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
12016 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
12017 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
12018 bmap
= isl_basic_map_cow(bmap
);
12019 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
12022 bmap
->dim
= isl_space_zip(bmap
->dim
);
12025 bmap
= isl_basic_map_mark_final(bmap
);
12028 isl_basic_map_free(bmap
);
12032 /* Given a map (A -> B) -> (C -> D), return the corresponding map
12033 * (A -> C) -> (B -> D).
12035 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
12042 if (!isl_map_can_zip(map
))
12043 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
12046 map
= isl_map_cow(map
);
12050 for (i
= 0; i
< map
->n
; ++i
) {
12051 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
12056 map
->dim
= isl_space_zip(map
->dim
);
12066 /* Can we apply isl_basic_map_curry to "bmap"?
12067 * That is, does it have a nested relation in its domain?
12069 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
12072 return isl_bool_error
;
12074 return isl_space_can_curry(bmap
->dim
);
12077 /* Can we apply isl_map_curry to "map"?
12078 * That is, does it have a nested relation in its domain?
12080 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
12083 return isl_bool_error
;
12085 return isl_space_can_curry(map
->dim
);
12088 /* Given a basic map (A -> B) -> C, return the corresponding basic map
12091 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
12097 if (!isl_basic_map_can_curry(bmap
))
12098 isl_die(bmap
->ctx
, isl_error_invalid
,
12099 "basic map cannot be curried", goto error
);
12100 bmap
= isl_basic_map_cow(bmap
);
12103 bmap
->dim
= isl_space_curry(bmap
->dim
);
12106 bmap
= isl_basic_map_mark_final(bmap
);
12109 isl_basic_map_free(bmap
);
12113 /* Given a map (A -> B) -> C, return the corresponding map
12116 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
12118 return isl_map_change_space(map
, &isl_map_can_curry
,
12119 "map cannot be curried", &isl_space_curry
);
12122 /* Can isl_map_range_curry be applied to "map"?
12123 * That is, does it have a nested relation in its range,
12124 * the domain of which is itself a nested relation?
12126 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
12129 return isl_bool_error
;
12131 return isl_space_can_range_curry(map
->dim
);
12134 /* Given a map A -> ((B -> C) -> D), return the corresponding map
12135 * A -> (B -> (C -> D)).
12137 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
12139 return isl_map_change_space(map
, &isl_map_can_range_curry
,
12140 "map range cannot be curried",
12141 &isl_space_range_curry
);
12144 /* Can we apply isl_basic_map_uncurry to "bmap"?
12145 * That is, does it have a nested relation in its domain?
12147 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
12150 return isl_bool_error
;
12152 return isl_space_can_uncurry(bmap
->dim
);
12155 /* Can we apply isl_map_uncurry to "map"?
12156 * That is, does it have a nested relation in its domain?
12158 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
12161 return isl_bool_error
;
12163 return isl_space_can_uncurry(map
->dim
);
12166 /* Given a basic map A -> (B -> C), return the corresponding basic map
12169 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12175 if (!isl_basic_map_can_uncurry(bmap
))
12176 isl_die(bmap
->ctx
, isl_error_invalid
,
12177 "basic map cannot be uncurried",
12178 return isl_basic_map_free(bmap
));
12179 bmap
= isl_basic_map_cow(bmap
);
12182 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12184 return isl_basic_map_free(bmap
);
12185 bmap
= isl_basic_map_mark_final(bmap
);
12189 /* Given a map A -> (B -> C), return the corresponding map
12192 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12194 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12195 "map cannot be uncurried", &isl_space_uncurry
);
12198 /* Construct a basic map mapping the domain of the affine expression
12199 * to a one-dimensional range prescribed by the affine expression.
12200 * If "rational" is set, then construct a rational basic map.
12202 * A NaN affine expression cannot be converted to a basic map.
12204 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
12205 __isl_take isl_aff
*aff
, int rational
)
12210 isl_local_space
*ls
;
12211 isl_basic_map
*bmap
= NULL
;
12215 is_nan
= isl_aff_is_nan(aff
);
12219 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
12220 "cannot convert NaN", goto error
);
12222 ls
= isl_aff_get_local_space(aff
);
12223 bmap
= isl_basic_map_from_local_space(ls
);
12224 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
12225 k
= isl_basic_map_alloc_equality(bmap
);
12229 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
12230 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
12231 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
12232 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
12233 aff
->v
->size
- (pos
+ 1));
12237 bmap
= isl_basic_map_set_rational(bmap
);
12238 bmap
= isl_basic_map_gauss(bmap
, NULL
);
12239 bmap
= isl_basic_map_finalize(bmap
);
12243 isl_basic_map_free(bmap
);
12247 /* Construct a basic map mapping the domain of the affine expression
12248 * to a one-dimensional range prescribed by the affine expression.
12250 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
12252 return isl_basic_map_from_aff2(aff
, 0);
12255 /* Construct a map mapping the domain of the affine expression
12256 * to a one-dimensional range prescribed by the affine expression.
12258 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
12260 isl_basic_map
*bmap
;
12262 bmap
= isl_basic_map_from_aff(aff
);
12263 return isl_map_from_basic_map(bmap
);
12266 /* Construct a basic map mapping the domain the multi-affine expression
12267 * to its range, with each dimension in the range equated to the
12268 * corresponding affine expression.
12269 * If "rational" is set, then construct a rational basic map.
12271 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
12272 __isl_take isl_multi_aff
*maff
, int rational
)
12276 isl_basic_map
*bmap
;
12281 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
12282 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
12283 "invalid space", goto error
);
12285 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
12286 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
12288 bmap
= isl_basic_map_set_rational(bmap
);
12290 for (i
= 0; i
< maff
->n
; ++i
) {
12292 isl_basic_map
*bmap_i
;
12294 aff
= isl_aff_copy(maff
->u
.p
[i
]);
12295 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
12297 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12300 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
12302 isl_multi_aff_free(maff
);
12305 isl_multi_aff_free(maff
);
12309 /* Construct a basic map mapping the domain the multi-affine expression
12310 * to its range, with each dimension in the range equated to the
12311 * corresponding affine expression.
12313 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
12314 __isl_take isl_multi_aff
*ma
)
12316 return isl_basic_map_from_multi_aff2(ma
, 0);
12319 /* Construct a map mapping the domain the multi-affine expression
12320 * to its range, with each dimension in the range equated to the
12321 * corresponding affine expression.
12323 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
12325 isl_basic_map
*bmap
;
12327 bmap
= isl_basic_map_from_multi_aff(maff
);
12328 return isl_map_from_basic_map(bmap
);
12331 /* Construct a basic map mapping a domain in the given space to
12332 * to an n-dimensional range, with n the number of elements in the list,
12333 * where each coordinate in the range is prescribed by the
12334 * corresponding affine expression.
12335 * The domains of all affine expressions in the list are assumed to match
12338 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
12339 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
12343 isl_basic_map
*bmap
;
12348 dim
= isl_space_from_domain(domain_dim
);
12349 bmap
= isl_basic_map_universe(dim
);
12351 for (i
= 0; i
< list
->n
; ++i
) {
12353 isl_basic_map
*bmap_i
;
12355 aff
= isl_aff_copy(list
->p
[i
]);
12356 bmap_i
= isl_basic_map_from_aff(aff
);
12358 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12361 isl_aff_list_free(list
);
12365 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12366 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12368 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12371 /* Construct a basic map where the given dimensions are equal to each other.
12373 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12374 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12376 isl_basic_map
*bmap
= NULL
;
12382 if (pos1
>= isl_space_dim(space
, type1
))
12383 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12384 "index out of bounds", goto error
);
12385 if (pos2
>= isl_space_dim(space
, type2
))
12386 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12387 "index out of bounds", goto error
);
12389 if (type1
== type2
&& pos1
== pos2
)
12390 return isl_basic_map_universe(space
);
12392 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12393 i
= isl_basic_map_alloc_equality(bmap
);
12396 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12397 pos1
+= isl_basic_map_offset(bmap
, type1
);
12398 pos2
+= isl_basic_map_offset(bmap
, type2
);
12399 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12400 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12401 bmap
= isl_basic_map_finalize(bmap
);
12402 isl_space_free(space
);
12405 isl_space_free(space
);
12406 isl_basic_map_free(bmap
);
12410 /* Add a constraint imposing that the given two dimensions are equal.
12412 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12413 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12417 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12419 bmap
= isl_basic_map_intersect(bmap
, eq
);
12424 /* Add a constraint imposing that the given two dimensions are equal.
12426 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12427 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12429 isl_basic_map
*bmap
;
12431 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12433 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12438 /* Add a constraint imposing that the given two dimensions have opposite values.
12440 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12441 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12443 isl_basic_map
*bmap
= NULL
;
12449 if (pos1
>= isl_map_dim(map
, type1
))
12450 isl_die(map
->ctx
, isl_error_invalid
,
12451 "index out of bounds", goto error
);
12452 if (pos2
>= isl_map_dim(map
, type2
))
12453 isl_die(map
->ctx
, isl_error_invalid
,
12454 "index out of bounds", goto error
);
12456 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12457 i
= isl_basic_map_alloc_equality(bmap
);
12460 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12461 pos1
+= isl_basic_map_offset(bmap
, type1
);
12462 pos2
+= isl_basic_map_offset(bmap
, type2
);
12463 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12464 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12465 bmap
= isl_basic_map_finalize(bmap
);
12467 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12471 isl_basic_map_free(bmap
);
12476 /* Construct a constraint imposing that the value of the first dimension is
12477 * greater than or equal to that of the second.
12479 static __isl_give isl_constraint
*constraint_order_ge(
12480 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12481 enum isl_dim_type type2
, int pos2
)
12488 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12490 if (pos1
>= isl_constraint_dim(c
, type1
))
12491 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12492 "index out of bounds", return isl_constraint_free(c
));
12493 if (pos2
>= isl_constraint_dim(c
, type2
))
12494 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12495 "index out of bounds", return isl_constraint_free(c
));
12497 if (type1
== type2
&& pos1
== pos2
)
12500 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12501 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12506 /* Add a constraint imposing that the value of the first dimension is
12507 * greater than or equal to that of the second.
12509 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12510 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12515 if (type1
== type2
&& pos1
== pos2
)
12517 space
= isl_basic_map_get_space(bmap
);
12518 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12519 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12524 /* Add a constraint imposing that the value of the first dimension is
12525 * greater than or equal to that of the second.
12527 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12528 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12533 if (type1
== type2
&& pos1
== pos2
)
12535 space
= isl_map_get_space(map
);
12536 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12537 map
= isl_map_add_constraint(map
, c
);
12542 /* Add a constraint imposing that the value of the first dimension is
12543 * less than or equal to that of the second.
12545 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12546 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12548 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12551 /* Construct a basic map where the value of the first dimension is
12552 * greater than that of the second.
12554 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12555 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12557 isl_basic_map
*bmap
= NULL
;
12563 if (pos1
>= isl_space_dim(space
, type1
))
12564 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12565 "index out of bounds", goto error
);
12566 if (pos2
>= isl_space_dim(space
, type2
))
12567 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12568 "index out of bounds", goto error
);
12570 if (type1
== type2
&& pos1
== pos2
)
12571 return isl_basic_map_empty(space
);
12573 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12574 i
= isl_basic_map_alloc_inequality(bmap
);
12576 return isl_basic_map_free(bmap
);
12577 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12578 pos1
+= isl_basic_map_offset(bmap
, type1
);
12579 pos2
+= isl_basic_map_offset(bmap
, type2
);
12580 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12581 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12582 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12583 bmap
= isl_basic_map_finalize(bmap
);
12587 isl_space_free(space
);
12588 isl_basic_map_free(bmap
);
12592 /* Add a constraint imposing that the value of the first dimension is
12593 * greater than that of the second.
12595 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12596 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12600 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12602 bmap
= isl_basic_map_intersect(bmap
, gt
);
12607 /* Add a constraint imposing that the value of the first dimension is
12608 * greater than that of the second.
12610 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12611 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12613 isl_basic_map
*bmap
;
12615 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12617 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12622 /* Add a constraint imposing that the value of the first dimension is
12623 * smaller than that of the second.
12625 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12626 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12628 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12631 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12635 isl_local_space
*ls
;
12640 if (!isl_basic_map_divs_known(bmap
))
12641 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12642 "some divs are unknown", return NULL
);
12644 ls
= isl_basic_map_get_local_space(bmap
);
12645 div
= isl_local_space_get_div(ls
, pos
);
12646 isl_local_space_free(ls
);
12651 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12654 return isl_basic_map_get_div(bset
, pos
);
12657 /* Plug in "subs" for dimension "type", "pos" of "bset".
12659 * Let i be the dimension to replace and let "subs" be of the form
12663 * Any integer division with a non-zero coefficient for i,
12665 * floor((a i + g)/m)
12669 * floor((a f + d g)/(m d))
12671 * Constraints of the form
12679 * We currently require that "subs" is an integral expression.
12680 * Handling rational expressions may require us to add stride constraints
12681 * as we do in isl_basic_set_preimage_multi_aff.
12683 __isl_give isl_basic_set
*isl_basic_set_substitute(
12684 __isl_take isl_basic_set
*bset
,
12685 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12691 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12694 bset
= isl_basic_set_cow(bset
);
12695 if (!bset
|| !subs
)
12698 ctx
= isl_basic_set_get_ctx(bset
);
12699 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12700 isl_die(ctx
, isl_error_invalid
,
12701 "spaces don't match", goto error
);
12702 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12703 isl_die(ctx
, isl_error_unsupported
,
12704 "cannot handle divs yet", goto error
);
12705 if (!isl_int_is_one(subs
->v
->el
[0]))
12706 isl_die(ctx
, isl_error_invalid
,
12707 "can only substitute integer expressions", goto error
);
12709 pos
+= isl_basic_set_offset(bset
, type
);
12713 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12714 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12716 isl_int_set(v
, bset
->eq
[i
][pos
]);
12717 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12718 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12719 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12722 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12723 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12725 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12726 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12727 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12728 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12731 for (i
= 0; i
< bset
->n_div
; ++i
) {
12732 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12734 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12735 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12736 isl_seq_combine(bset
->div
[i
] + 1,
12737 subs
->v
->el
[0], bset
->div
[i
] + 1,
12738 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12739 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12744 bset
= isl_basic_set_simplify(bset
);
12745 return isl_basic_set_finalize(bset
);
12747 isl_basic_set_free(bset
);
12751 /* Plug in "subs" for dimension "type", "pos" of "set".
12753 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12754 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12758 if (set
&& isl_set_plain_is_empty(set
))
12761 set
= isl_set_cow(set
);
12765 for (i
= set
->n
- 1; i
>= 0; --i
) {
12766 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12767 if (remove_if_empty(set
, i
) < 0)
12777 /* Check if the range of "ma" is compatible with the domain or range
12778 * (depending on "type") of "bmap".
12780 static isl_stat
check_basic_map_compatible_range_multi_aff(
12781 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12782 __isl_keep isl_multi_aff
*ma
)
12785 isl_space
*ma_space
;
12787 ma_space
= isl_multi_aff_get_space(ma
);
12789 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12793 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12794 "parameters don't match", goto error
);
12795 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12799 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12800 "spaces don't match", goto error
);
12802 isl_space_free(ma_space
);
12803 return isl_stat_ok
;
12805 isl_space_free(ma_space
);
12806 return isl_stat_error
;
12809 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12810 * coefficients before the transformed range of dimensions,
12811 * the "n_after" coefficients after the transformed range of dimensions
12812 * and the coefficients of the other divs in "bmap".
12814 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12815 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12820 isl_local_space
*ls
;
12825 ls
= isl_aff_get_domain_local_space(ma
->u
.p
[0]);
12829 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12830 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12831 for (i
= 0; i
< n_div
; ++i
) {
12832 int o_bmap
= 0, o_ls
= 0;
12834 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12835 o_bmap
+= 1 + 1 + n_param
;
12836 o_ls
+= 1 + 1 + n_param
;
12837 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12838 o_bmap
+= n_before
;
12839 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12840 ls
->div
->row
[i
] + o_ls
, n_set
);
12843 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12845 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12846 ls
->div
->row
[i
] + o_ls
, n_div
);
12849 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12850 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12854 isl_local_space_free(ls
);
12857 isl_local_space_free(ls
);
12861 /* How many stride constraints does "ma" enforce?
12862 * That is, how many of the affine expressions have a denominator
12863 * different from one?
12865 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12870 for (i
= 0; i
< ma
->n
; ++i
)
12871 if (!isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12877 /* For each affine expression in ma of the form
12879 * x_i = (f_i y + h_i)/m_i
12881 * with m_i different from one, add a constraint to "bmap"
12884 * f_i y + h_i = m_i alpha_i
12886 * with alpha_i an additional existentially quantified variable.
12888 * The input variables of "ma" correspond to a subset of the variables
12889 * of "bmap". There are "n_before" variables in "bmap" before this
12890 * subset and "n_after" variables after this subset.
12891 * The integer divisions of the affine expressions in "ma" are assumed
12892 * to have been aligned. There are "n_div_ma" of them and
12893 * they appear first in "bmap", straight after the "n_after" variables.
12895 static __isl_give isl_basic_map
*add_ma_strides(
12896 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12897 int n_before
, int n_after
, int n_div_ma
)
12905 total
= isl_basic_map_total_dim(bmap
);
12906 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12907 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12908 for (i
= 0; i
< ma
->n
; ++i
) {
12909 int o_bmap
= 0, o_ma
= 1;
12911 if (isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12913 div
= isl_basic_map_alloc_div(bmap
);
12914 k
= isl_basic_map_alloc_equality(bmap
);
12915 if (div
< 0 || k
< 0)
12917 isl_int_set_si(bmap
->div
[div
][0], 0);
12918 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12919 ma
->u
.p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12920 o_bmap
+= 1 + n_param
;
12921 o_ma
+= 1 + n_param
;
12922 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12923 o_bmap
+= n_before
;
12924 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12925 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_in
);
12928 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12930 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12931 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12932 o_bmap
+= n_div_ma
;
12934 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12935 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->u
.p
[i
]->v
->el
[0]);
12941 isl_basic_map_free(bmap
);
12945 /* Replace the domain or range space (depending on "type) of "space" by "set".
12947 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12948 enum isl_dim_type type
, __isl_take isl_space
*set
)
12950 if (type
== isl_dim_in
) {
12951 space
= isl_space_range(space
);
12952 space
= isl_space_map_from_domain_and_range(set
, space
);
12954 space
= isl_space_domain(space
);
12955 space
= isl_space_map_from_domain_and_range(space
, set
);
12961 /* Compute the preimage of the domain or range (depending on "type")
12962 * of "bmap" under the function represented by "ma".
12963 * In other words, plug in "ma" in the domain or range of "bmap".
12964 * The result is a basic map that lives in the same space as "bmap"
12965 * except that the domain or range has been replaced by
12966 * the domain space of "ma".
12968 * If bmap is represented by
12970 * A(p) + S u + B x + T v + C(divs) >= 0,
12972 * where u and x are input and output dimensions if type == isl_dim_out
12973 * while x and v are input and output dimensions if type == isl_dim_in,
12974 * and ma is represented by
12976 * x = D(p) + F(y) + G(divs')
12978 * then the result is
12980 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12982 * The divs in the input set are similarly adjusted.
12985 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12989 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12990 * B_i G(divs') + c_i(divs))/n_i)
12992 * If bmap is not a rational map and if F(y) involves any denominators
12994 * x_i = (f_i y + h_i)/m_i
12996 * then additional constraints are added to ensure that we only
12997 * map back integer points. That is we enforce
12999 * f_i y + h_i = m_i alpha_i
13001 * with alpha_i an additional existentially quantified variable.
13003 * We first copy over the divs from "ma".
13004 * Then we add the modified constraints and divs from "bmap".
13005 * Finally, we add the stride constraints, if needed.
13007 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
13008 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
13009 __isl_take isl_multi_aff
*ma
)
13013 isl_basic_map
*res
= NULL
;
13014 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
13015 isl_int f
, c1
, c2
, g
;
13024 ma
= isl_multi_aff_align_divs(ma
);
13027 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
13030 if (type
== isl_dim_in
) {
13032 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
13034 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
13037 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
13038 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
13040 space
= isl_multi_aff_get_domain_space(ma
);
13041 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
13042 rational
= isl_basic_map_is_rational(bmap
);
13043 strides
= rational
? 0 : multi_aff_strides(ma
);
13044 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
13045 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
13047 res
= isl_basic_map_set_rational(res
);
13049 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
13050 if (isl_basic_map_alloc_div(res
) < 0)
13053 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
13056 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
13057 k
= isl_basic_map_alloc_equality(res
);
13060 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
13061 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13064 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
13065 k
= isl_basic_map_alloc_inequality(res
);
13068 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
13069 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13072 for (i
= 0; i
< bmap
->n_div
; ++i
) {
13073 if (isl_int_is_zero(bmap
->div
[i
][0])) {
13074 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
13077 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
13078 n_before
, n_after
, n_div_ma
, n_div_bmap
,
13083 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
13089 isl_basic_map_free(bmap
);
13090 isl_multi_aff_free(ma
);
13091 res
= isl_basic_map_simplify(res
);
13092 return isl_basic_map_finalize(res
);
13098 isl_basic_map_free(bmap
);
13099 isl_multi_aff_free(ma
);
13100 isl_basic_map_free(res
);
13104 /* Compute the preimage of "bset" under the function represented by "ma".
13105 * In other words, plug in "ma" in "bset". The result is a basic set
13106 * that lives in the domain space of "ma".
13108 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
13109 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
13111 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
13114 /* Compute the preimage of the domain of "bmap" under the function
13115 * represented by "ma".
13116 * In other words, plug in "ma" in the domain of "bmap".
13117 * The result is a basic map that lives in the same space as "bmap"
13118 * except that the domain has been replaced by the domain space of "ma".
13120 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
13121 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13123 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
13126 /* Compute the preimage of the range of "bmap" under the function
13127 * represented by "ma".
13128 * In other words, plug in "ma" in the range of "bmap".
13129 * The result is a basic map that lives in the same space as "bmap"
13130 * except that the range has been replaced by the domain space of "ma".
13132 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
13133 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13135 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
13138 /* Check if the range of "ma" is compatible with the domain or range
13139 * (depending on "type") of "map".
13140 * Return isl_stat_error if anything is wrong.
13142 static isl_stat
check_map_compatible_range_multi_aff(
13143 __isl_keep isl_map
*map
, enum isl_dim_type type
,
13144 __isl_keep isl_multi_aff
*ma
)
13147 isl_space
*ma_space
;
13149 ma_space
= isl_multi_aff_get_space(ma
);
13150 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
13151 isl_space_free(ma_space
);
13153 return isl_stat_error
;
13155 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
13156 "spaces don't match", return isl_stat_error
);
13157 return isl_stat_ok
;
13160 /* Compute the preimage of the domain or range (depending on "type")
13161 * of "map" under the function represented by "ma".
13162 * In other words, plug in "ma" in the domain or range of "map".
13163 * The result is a map that lives in the same space as "map"
13164 * except that the domain or range has been replaced by
13165 * the domain space of "ma".
13167 * The parameters are assumed to have been aligned.
13169 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13170 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13175 map
= isl_map_cow(map
);
13176 ma
= isl_multi_aff_align_divs(ma
);
13179 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13182 for (i
= 0; i
< map
->n
; ++i
) {
13183 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13184 isl_multi_aff_copy(ma
));
13189 space
= isl_multi_aff_get_domain_space(ma
);
13190 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13192 isl_space_free(map
->dim
);
13197 isl_multi_aff_free(ma
);
13199 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13200 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13203 isl_multi_aff_free(ma
);
13208 /* Compute the preimage of the domain or range (depending on "type")
13209 * of "map" under the function represented by "ma".
13210 * In other words, plug in "ma" in the domain or range of "map".
13211 * The result is a map that lives in the same space as "map"
13212 * except that the domain or range has been replaced by
13213 * the domain space of "ma".
13215 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13216 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13223 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13227 return map_preimage_multi_aff(map
, type
, ma
);
13229 if (isl_map_check_named_params(map
) < 0)
13231 if (!isl_space_has_named_params(ma
->space
))
13232 isl_die(map
->ctx
, isl_error_invalid
,
13233 "unaligned unnamed parameters", goto error
);
13234 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13235 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13237 return map_preimage_multi_aff(map
, type
, ma
);
13239 isl_multi_aff_free(ma
);
13240 return isl_map_free(map
);
13243 /* Compute the preimage of "set" under the function represented by "ma".
13244 * In other words, plug in "ma" in "set". The result is a set
13245 * that lives in the domain space of "ma".
13247 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13248 __isl_take isl_multi_aff
*ma
)
13250 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13253 /* Compute the preimage of the domain of "map" under the function
13254 * represented by "ma".
13255 * In other words, plug in "ma" in the domain of "map".
13256 * The result is a map that lives in the same space as "map"
13257 * except that the domain has been replaced by the domain space of "ma".
13259 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13260 __isl_take isl_multi_aff
*ma
)
13262 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13265 /* Compute the preimage of the range of "map" under the function
13266 * represented by "ma".
13267 * In other words, plug in "ma" in the range of "map".
13268 * The result is a map that lives in the same space as "map"
13269 * except that the range has been replaced by the domain space of "ma".
13271 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13272 __isl_take isl_multi_aff
*ma
)
13274 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13277 /* Compute the preimage of "map" under the function represented by "pma".
13278 * In other words, plug in "pma" in the domain or range of "map".
13279 * The result is a map that lives in the same space as "map",
13280 * except that the space of type "type" has been replaced by
13281 * the domain space of "pma".
13283 * The parameters of "map" and "pma" are assumed to have been aligned.
13285 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13286 __isl_take isl_map
*map
, enum isl_dim_type type
,
13287 __isl_take isl_pw_multi_aff
*pma
)
13296 isl_pw_multi_aff_free(pma
);
13297 res
= isl_map_empty(isl_map_get_space(map
));
13302 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13303 isl_multi_aff_copy(pma
->p
[0].maff
));
13304 if (type
== isl_dim_in
)
13305 res
= isl_map_intersect_domain(res
,
13306 isl_map_copy(pma
->p
[0].set
));
13308 res
= isl_map_intersect_range(res
,
13309 isl_map_copy(pma
->p
[0].set
));
13311 for (i
= 1; i
< pma
->n
; ++i
) {
13314 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13315 isl_multi_aff_copy(pma
->p
[i
].maff
));
13316 if (type
== isl_dim_in
)
13317 res_i
= isl_map_intersect_domain(res_i
,
13318 isl_map_copy(pma
->p
[i
].set
));
13320 res_i
= isl_map_intersect_range(res_i
,
13321 isl_map_copy(pma
->p
[i
].set
));
13322 res
= isl_map_union(res
, res_i
);
13325 isl_pw_multi_aff_free(pma
);
13329 isl_pw_multi_aff_free(pma
);
13334 /* Compute the preimage of "map" under the function represented by "pma".
13335 * In other words, plug in "pma" in the domain or range of "map".
13336 * The result is a map that lives in the same space as "map",
13337 * except that the space of type "type" has been replaced by
13338 * the domain space of "pma".
13340 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13341 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13348 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13352 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13354 if (isl_map_check_named_params(map
) < 0)
13356 if (!isl_space_has_named_params(pma
->dim
))
13357 isl_die(map
->ctx
, isl_error_invalid
,
13358 "unaligned unnamed parameters", goto error
);
13359 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13360 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13362 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13364 isl_pw_multi_aff_free(pma
);
13365 return isl_map_free(map
);
13368 /* Compute the preimage of "set" under the function represented by "pma".
13369 * In other words, plug in "pma" in "set". The result is a set
13370 * that lives in the domain space of "pma".
13372 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13373 __isl_take isl_pw_multi_aff
*pma
)
13375 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13378 /* Compute the preimage of the domain of "map" under the function
13379 * represented by "pma".
13380 * In other words, plug in "pma" in the domain of "map".
13381 * The result is a map that lives in the same space as "map",
13382 * except that domain space has been replaced by the domain space of "pma".
13384 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13385 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13387 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13390 /* Compute the preimage of the range of "map" under the function
13391 * represented by "pma".
13392 * In other words, plug in "pma" in the range of "map".
13393 * The result is a map that lives in the same space as "map",
13394 * except that range space has been replaced by the domain space of "pma".
13396 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13397 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13399 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13402 /* Compute the preimage of "map" under the function represented by "mpa".
13403 * In other words, plug in "mpa" in the domain or range of "map".
13404 * The result is a map that lives in the same space as "map",
13405 * except that the space of type "type" has been replaced by
13406 * the domain space of "mpa".
13408 * If the map does not involve any constraints that refer to the
13409 * dimensions of the substituted space, then the only possible
13410 * effect of "mpa" on the map is to map the space to a different space.
13411 * We create a separate isl_multi_aff to effectuate this change
13412 * in order to avoid spurious splitting of the map along the pieces
13414 * If "mpa" has a non-trivial explicit domain, however,
13415 * then the full substitution should be performed.
13417 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13418 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13422 isl_pw_multi_aff
*pma
;
13427 n
= isl_map_dim(map
, type
);
13428 full
= isl_map_involves_dims(map
, type
, 0, n
);
13429 if (full
>= 0 && !full
)
13430 full
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
13437 space
= isl_multi_pw_aff_get_space(mpa
);
13438 isl_multi_pw_aff_free(mpa
);
13439 ma
= isl_multi_aff_zero(space
);
13440 return isl_map_preimage_multi_aff(map
, type
, ma
);
13443 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13444 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13447 isl_multi_pw_aff_free(mpa
);
13451 /* Compute the preimage of "map" under the function represented by "mpa".
13452 * In other words, plug in "mpa" in the domain "map".
13453 * The result is a map that lives in the same space as "map",
13454 * except that domain space has been replaced by the domain space of "mpa".
13456 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13457 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13459 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13462 /* Compute the preimage of "set" by the function represented by "mpa".
13463 * In other words, plug in "mpa" in "set".
13465 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13466 __isl_take isl_multi_pw_aff
*mpa
)
13468 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13471 /* Return a copy of the equality constraints of "bset" as a matrix.
13473 __isl_give isl_mat
*isl_basic_set_extract_equalities(
13474 __isl_keep isl_basic_set
*bset
)
13482 ctx
= isl_basic_set_get_ctx(bset
);
13483 total
= 1 + isl_basic_set_dim(bset
, isl_dim_all
);
13484 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, total
);
13487 /* Are the "n" "coefficients" starting at "first" of the integer division
13488 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13490 * The "coefficient" at position 0 is the denominator.
13491 * The "coefficient" at position 1 is the constant term.
13493 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13494 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13495 unsigned first
, unsigned n
)
13497 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13498 return isl_bool_error
;
13499 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13500 return isl_bool_error
;
13501 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13502 bmap2
->div
[pos2
] + first
, n
);
13505 /* Are the integer division expressions at position "pos1" in "bmap1" and
13506 * "pos2" in "bmap2" equal to each other, except that the constant terms
13509 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13510 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13511 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13516 if (!bmap1
|| !bmap2
)
13517 return isl_bool_error
;
13518 total
= isl_basic_map_total_dim(bmap1
);
13519 if (total
!= isl_basic_map_total_dim(bmap2
))
13520 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13521 "incomparable div expressions", return isl_bool_error
);
13522 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13524 if (equal
< 0 || !equal
)
13526 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13528 if (equal
< 0 || equal
)
13529 return isl_bool_not(equal
);
13530 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13534 /* Replace the numerator of the constant term of the integer division
13535 * expression at position "div" in "bmap" by "value".
13536 * The caller guarantees that this does not change the meaning
13539 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13540 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13542 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13543 return isl_basic_map_free(bmap
);
13545 isl_int_set_si(bmap
->div
[div
][1], value
);
13550 /* Is the point "inner" internal to inequality constraint "ineq"
13552 * The point is considered to be internal to the inequality constraint,
13553 * if it strictly lies on the positive side of the inequality constraint,
13554 * or if it lies on the constraint and the constraint is lexico-positive.
13556 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13557 __isl_keep isl_basic_set
*bset
, int ineq
)
13563 if (!inner
|| !bset
)
13564 return isl_bool_error
;
13566 ctx
= isl_basic_set_get_ctx(bset
);
13567 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13568 &ctx
->normalize_gcd
);
13569 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13570 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13572 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13573 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13574 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13577 /* Tighten the inequality constraints of "bset" that are outward with respect
13578 * to the point "vec".
13579 * That is, tighten the constraints that are not satisfied by "vec".
13581 * "vec" is a point internal to some superset S of "bset" that is used
13582 * to make the subsets of S disjoint, by tightening one half of the constraints
13583 * that separate two subsets. In particular, the constraints of S
13584 * are all satisfied by "vec" and should not be tightened.
13585 * Of the internal constraints, those that have "vec" on the outside
13586 * are tightened. The shared facet is included in the adjacent subset
13587 * with the opposite constraint.
13588 * For constraints that saturate "vec", this criterion cannot be used
13589 * to determine which of the two sides should be tightened.
13590 * Instead, the sign of the first non-zero coefficient is used
13591 * to make this choice. Note that this second criterion is never used
13592 * on the constraints of S since "vec" is interior to "S".
13594 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13595 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13599 bset
= isl_basic_set_cow(bset
);
13602 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13605 internal
= is_internal(vec
, bset
, j
);
13607 return isl_basic_set_free(bset
);
13610 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13616 /* Replace the variables x of type "type" starting at "first" in "bmap"
13617 * by x' with x = M x' with M the matrix trans.
13618 * That is, replace the corresponding coefficients c by c M.
13620 * The transformation matrix should be a square matrix.
13622 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13623 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13624 __isl_take isl_mat
*trans
)
13628 bmap
= isl_basic_map_cow(bmap
);
13629 if (!bmap
|| !trans
)
13632 if (trans
->n_row
!= trans
->n_col
)
13633 isl_die(trans
->ctx
, isl_error_invalid
,
13634 "expecting square transformation matrix", goto error
);
13635 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13636 isl_die(trans
->ctx
, isl_error_invalid
,
13637 "oversized transformation matrix", goto error
);
13639 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13641 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13642 isl_mat_copy(trans
)) < 0)
13644 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13645 isl_mat_copy(trans
)) < 0)
13647 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13648 isl_mat_copy(trans
)) < 0)
13651 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
13652 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13654 isl_mat_free(trans
);
13657 isl_mat_free(trans
);
13658 isl_basic_map_free(bmap
);
13662 /* Replace the variables x of type "type" starting at "first" in "bset"
13663 * by x' with x = M x' with M the matrix trans.
13664 * That is, replace the corresponding coefficients c by c M.
13666 * The transformation matrix should be a square matrix.
13668 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13669 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13670 __isl_take isl_mat
*trans
)
13672 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);