2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 INRIA Paris
7 * Copyright 2016 Sven Verdoolaege
9 * Use of this software is governed by the MIT license
11 * Written by Sven Verdoolaege, K.U.Leuven, Departement
12 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
14 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
17 * B.P. 105 - 78153 Le Chesnay, France
18 * and Centre de Recherche Inria de Paris, 2 rue Simone Iff - Voie DQ12,
19 * CS 42112, 75589 Paris Cedex 12, France
23 #include <isl_ctx_private.h>
24 #include <isl_map_private.h>
27 #include <isl/constraint.h>
28 #include "isl_space_private.h"
29 #include "isl_equalities.h"
30 #include <isl_lp_private.h>
34 #include <isl_reordering.h>
35 #include "isl_sample.h"
39 #include <isl_mat_private.h>
40 #include <isl_vec_private.h>
41 #include <isl_dim_map.h>
42 #include <isl_local_space_private.h>
43 #include <isl_aff_private.h>
44 #include <isl_options_private.h>
45 #include <isl_morph.h>
46 #include <isl_val_private.h>
48 #include <bset_to_bmap.c>
49 #include <bset_from_bmap.c>
50 #include <set_to_map.c>
51 #include <set_from_map.c>
53 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
56 case isl_dim_param
: return dim
->nparam
;
57 case isl_dim_in
: return dim
->n_in
;
58 case isl_dim_out
: return dim
->n_out
;
59 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
64 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
67 case isl_dim_param
: return 1;
68 case isl_dim_in
: return 1 + dim
->nparam
;
69 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
74 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
75 enum isl_dim_type type
)
80 case isl_dim_cst
: return 1;
83 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
84 case isl_dim_div
: return bmap
->n_div
;
85 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
90 /* Return the space of "map".
92 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
94 return map
? map
->dim
: NULL
;
97 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
99 return map
? n(map
->dim
, type
) : 0;
102 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
104 return set
? n(set
->dim
, type
) : 0;
107 unsigned isl_basic_map_offset(__isl_keep isl_basic_map
*bmap
,
108 enum isl_dim_type type
)
117 case isl_dim_cst
: return 0;
118 case isl_dim_param
: return 1;
119 case isl_dim_in
: return 1 + space
->nparam
;
120 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
121 case isl_dim_div
: return 1 + space
->nparam
+ space
->n_in
+
127 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
128 enum isl_dim_type type
)
130 return isl_basic_map_offset(bset
, type
);
133 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
135 return pos(map
->dim
, type
);
138 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
139 enum isl_dim_type type
)
141 return isl_basic_map_dim(bset
, type
);
144 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
146 return isl_basic_set_dim(bset
, isl_dim_set
);
149 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
151 return isl_basic_set_dim(bset
, isl_dim_param
);
154 unsigned isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
158 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
161 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
163 return isl_set_dim(set
, isl_dim_set
);
166 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
168 return isl_set_dim(set
, isl_dim_param
);
171 unsigned isl_basic_map_n_in(__isl_keep
const isl_basic_map
*bmap
)
173 return bmap
? bmap
->dim
->n_in
: 0;
176 unsigned isl_basic_map_n_out(__isl_keep
const isl_basic_map
*bmap
)
178 return bmap
? bmap
->dim
->n_out
: 0;
181 unsigned isl_basic_map_n_param(__isl_keep
const isl_basic_map
*bmap
)
183 return bmap
? bmap
->dim
->nparam
: 0;
186 unsigned isl_basic_map_n_div(__isl_keep
const isl_basic_map
*bmap
)
188 return bmap
? bmap
->n_div
: 0;
191 unsigned isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
193 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
196 unsigned isl_map_n_in(__isl_keep
const isl_map
*map
)
198 return map
? map
->dim
->n_in
: 0;
201 unsigned isl_map_n_out(__isl_keep
const isl_map
*map
)
203 return map
? map
->dim
->n_out
: 0;
206 unsigned isl_map_n_param(__isl_keep
const isl_map
*map
)
208 return map
? map
->dim
->nparam
: 0;
211 /* Return the number of equality constraints in the description of "bmap".
212 * Return -1 on error.
214 int isl_basic_map_n_equality(__isl_keep isl_basic_map
*bmap
)
221 /* Return the number of equality constraints in the description of "bset".
222 * Return -1 on error.
224 int isl_basic_set_n_equality(__isl_keep isl_basic_set
*bset
)
226 return isl_basic_map_n_equality(bset_to_bmap(bset
));
229 /* Return the number of inequality constraints in the description of "bmap".
230 * Return -1 on error.
232 int isl_basic_map_n_inequality(__isl_keep isl_basic_map
*bmap
)
239 /* Return the number of inequality constraints in the description of "bset".
240 * Return -1 on error.
242 int isl_basic_set_n_inequality(__isl_keep isl_basic_set
*bset
)
244 return isl_basic_map_n_inequality(bset_to_bmap(bset
));
247 /* Do "bmap1" and "bmap2" have the same parameters?
249 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
250 __isl_keep isl_basic_map
*bmap2
)
252 isl_space
*space1
, *space2
;
254 space1
= isl_basic_map_peek_space(bmap1
);
255 space2
= isl_basic_map_peek_space(bmap2
);
256 return isl_space_has_equal_params(space1
, space2
);
259 /* Do "map1" and "map2" have the same parameters?
261 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
262 __isl_keep isl_map
*map2
)
264 isl_space
*space1
, *space2
;
266 space1
= isl_map_peek_space(map1
);
267 space2
= isl_map_peek_space(map2
);
268 return isl_space_has_equal_params(space1
, space2
);
271 /* Do "map" and "set" have the same parameters?
273 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
274 __isl_keep isl_set
*set
)
276 return isl_map_has_equal_params(map
, set_to_map(set
));
279 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
280 __isl_keep isl_set
*set
)
284 return isl_bool_error
;
285 m
= isl_map_has_equal_params(map
, set_to_map(set
));
288 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
289 set
->dim
, isl_dim_set
);
292 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
293 __isl_keep isl_basic_set
*bset
)
297 return isl_bool_error
;
298 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
301 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
302 bset
->dim
, isl_dim_set
);
305 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
306 __isl_keep isl_set
*set
)
310 return isl_bool_error
;
311 m
= isl_map_has_equal_params(map
, set_to_map(set
));
314 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
315 set
->dim
, isl_dim_set
);
318 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
319 __isl_keep isl_basic_set
*bset
)
323 return isl_bool_error
;
324 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
327 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
328 bset
->dim
, isl_dim_set
);
331 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
333 return bmap
? bmap
->ctx
: NULL
;
336 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
338 return bset
? bset
->ctx
: NULL
;
341 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
343 return map
? map
->ctx
: NULL
;
346 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
348 return set
? set
->ctx
: NULL
;
351 /* Return the space of "bmap".
353 __isl_keep isl_space
*isl_basic_map_peek_space(
354 __isl_keep
const isl_basic_map
*bmap
)
356 return bmap
? bmap
->dim
: NULL
;
359 /* Return the space of "bset".
361 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
363 return isl_basic_map_peek_space(bset_to_bmap(bset
));
366 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
368 return isl_space_copy(isl_basic_map_peek_space(bmap
));
371 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
373 return isl_basic_map_get_space(bset_to_bmap(bset
));
376 /* Extract the divs in "bmap" as a matrix.
378 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
389 ctx
= isl_basic_map_get_ctx(bmap
);
390 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
391 cols
= 1 + 1 + total
+ bmap
->n_div
;
392 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
396 for (i
= 0; i
< bmap
->n_div
; ++i
)
397 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
402 /* Extract the divs in "bset" as a matrix.
404 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
406 return isl_basic_map_get_divs(bset
);
409 __isl_give isl_local_space
*isl_basic_map_get_local_space(
410 __isl_keep isl_basic_map
*bmap
)
417 div
= isl_basic_map_get_divs(bmap
);
418 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
421 __isl_give isl_local_space
*isl_basic_set_get_local_space(
422 __isl_keep isl_basic_set
*bset
)
424 return isl_basic_map_get_local_space(bset
);
427 /* For each known div d = floor(f/m), add the constraints
430 * -(f-(m-1)) + m d >= 0
432 * Do not finalize the result.
434 static __isl_give isl_basic_map
*add_known_div_constraints(
435 __isl_take isl_basic_map
*bmap
)
442 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
445 bmap
= isl_basic_map_cow(bmap
);
446 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
449 for (i
= 0; i
< n_div
; ++i
) {
450 if (isl_int_is_zero(bmap
->div
[i
][0]))
452 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
453 return isl_basic_map_free(bmap
);
459 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
460 __isl_take isl_local_space
*ls
)
469 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
470 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
471 n_div
, 0, 2 * n_div
);
473 for (i
= 0; i
< n_div
; ++i
)
474 if (isl_basic_map_alloc_div(bmap
) < 0)
477 for (i
= 0; i
< n_div
; ++i
)
478 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
479 bmap
= add_known_div_constraints(bmap
);
481 isl_local_space_free(ls
);
484 isl_local_space_free(ls
);
485 isl_basic_map_free(bmap
);
489 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
490 __isl_take isl_local_space
*ls
)
492 return isl_basic_map_from_local_space(ls
);
495 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
497 return isl_space_copy(isl_map_peek_space(map
));
500 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
504 return isl_space_copy(set
->dim
);
507 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
508 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
510 bmap
= isl_basic_map_cow(bmap
);
513 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
516 bmap
= isl_basic_map_finalize(bmap
);
519 isl_basic_map_free(bmap
);
523 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
524 __isl_take isl_basic_set
*bset
, const char *s
)
526 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
529 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
530 enum isl_dim_type type
)
532 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
535 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
536 enum isl_dim_type type
, const char *s
)
540 map
= isl_map_cow(map
);
544 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
548 for (i
= 0; i
< map
->n
; ++i
) {
549 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
560 /* Replace the identifier of the tuple of type "type" by "id".
562 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
563 __isl_take isl_basic_map
*bmap
,
564 enum isl_dim_type type
, __isl_take isl_id
*id
)
566 bmap
= isl_basic_map_cow(bmap
);
569 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
571 return isl_basic_map_free(bmap
);
572 bmap
= isl_basic_map_finalize(bmap
);
579 /* Replace the identifier of the tuple by "id".
581 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
582 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
584 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
587 /* Does the input or output tuple have a name?
589 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
591 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
594 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
595 enum isl_dim_type type
)
597 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
600 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
603 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
607 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
608 enum isl_dim_type type
, __isl_take isl_id
*id
)
610 map
= isl_map_cow(map
);
614 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
616 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
622 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
623 __isl_take isl_id
*id
)
625 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
628 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
629 enum isl_dim_type type
)
631 map
= isl_map_cow(map
);
635 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
637 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
640 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
642 return isl_map_reset_tuple_id(set
, isl_dim_set
);
645 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
647 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
650 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
651 enum isl_dim_type type
)
653 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
656 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
658 return isl_map_has_tuple_id(set
, isl_dim_set
);
661 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
663 return isl_map_get_tuple_id(set
, isl_dim_set
);
666 /* Does the set tuple have a name?
668 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
671 return isl_bool_error
;
672 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
676 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
678 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
681 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
683 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
686 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
687 enum isl_dim_type type
, unsigned pos
)
689 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
692 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
693 enum isl_dim_type type
, unsigned pos
)
695 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
698 /* Does the given dimension have a name?
700 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
701 enum isl_dim_type type
, unsigned pos
)
704 return isl_bool_error
;
705 return isl_space_has_dim_name(map
->dim
, type
, pos
);
708 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
709 enum isl_dim_type type
, unsigned pos
)
711 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
714 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
715 enum isl_dim_type type
, unsigned pos
)
717 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
720 /* Does the given dimension have a name?
722 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
723 enum isl_dim_type type
, unsigned pos
)
726 return isl_bool_error
;
727 return isl_space_has_dim_name(set
->dim
, type
, pos
);
730 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
731 __isl_take isl_basic_map
*bmap
,
732 enum isl_dim_type type
, unsigned pos
, const char *s
)
734 bmap
= isl_basic_map_cow(bmap
);
737 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
740 return isl_basic_map_finalize(bmap
);
742 isl_basic_map_free(bmap
);
746 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
747 enum isl_dim_type type
, unsigned pos
, const char *s
)
751 map
= isl_map_cow(map
);
755 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
759 for (i
= 0; i
< map
->n
; ++i
) {
760 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
771 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
772 __isl_take isl_basic_set
*bset
,
773 enum isl_dim_type type
, unsigned pos
, const char *s
)
775 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
779 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
780 enum isl_dim_type type
, unsigned pos
, const char *s
)
782 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
786 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
787 enum isl_dim_type type
, unsigned pos
)
790 return isl_bool_error
;
791 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
794 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
795 enum isl_dim_type type
, unsigned pos
)
797 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
800 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
801 enum isl_dim_type type
, unsigned pos
)
803 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
806 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
807 enum isl_dim_type type
, unsigned pos
)
809 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
812 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
813 enum isl_dim_type type
, unsigned pos
)
815 return isl_map_has_dim_id(set
, type
, pos
);
818 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
819 enum isl_dim_type type
, unsigned pos
)
821 return isl_map_get_dim_id(set
, type
, pos
);
824 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
825 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
827 map
= isl_map_cow(map
);
831 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
833 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
839 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
840 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
842 return isl_map_set_dim_id(set
, type
, pos
, id
);
845 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
846 __isl_keep isl_id
*id
)
850 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
853 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
854 __isl_keep isl_id
*id
)
856 return isl_map_find_dim_by_id(set
, type
, id
);
859 /* Return the position of the dimension of the given type and name
861 * Return -1 if no such dimension can be found.
863 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
864 enum isl_dim_type type
, const char *name
)
868 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
871 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
876 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
879 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
882 return isl_map_find_dim_by_name(set
, type
, name
);
885 /* Check whether equality i of bset is a pure stride constraint
886 * on a single dimension, i.e., of the form
890 * with k a constant and e an existentially quantified variable.
892 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
901 return isl_bool_error
;
903 if (!isl_int_is_zero(bset
->eq
[i
][0]))
904 return isl_bool_false
;
906 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
907 d
= isl_basic_set_dim(bset
, isl_dim_set
);
908 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
910 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
911 return isl_bool_false
;
912 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
914 return isl_bool_false
;
915 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
917 return isl_bool_false
;
919 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
921 return isl_bool_false
;
922 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
923 n_div
- pos2
- 1) != -1)
924 return isl_bool_false
;
925 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
926 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
927 return isl_bool_false
;
929 return isl_bool_true
;
932 /* Reset the user pointer on all identifiers of parameters and tuples
933 * of the space of "map".
935 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
939 space
= isl_map_get_space(map
);
940 space
= isl_space_reset_user(space
);
941 map
= isl_map_reset_space(map
, space
);
946 /* Reset the user pointer on all identifiers of parameters and tuples
947 * of the space of "set".
949 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
951 return isl_map_reset_user(set
);
954 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
957 return isl_bool_error
;
958 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
961 /* Has "map" been marked as a rational map?
962 * In particular, have all basic maps in "map" been marked this way?
963 * An empty map is not considered to be rational.
964 * Maps where only some of the basic maps are marked rational
967 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
973 return isl_bool_error
;
975 return isl_bool_false
;
976 rational
= isl_basic_map_is_rational(map
->p
[0]);
979 for (i
= 1; i
< map
->n
; ++i
) {
982 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
985 if (rational
!= rational_i
)
986 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
987 "mixed rational and integer basic maps "
988 "not supported", return isl_bool_error
);
994 /* Has "set" been marked as a rational set?
995 * In particular, have all basic set in "set" been marked this way?
996 * An empty set is not considered to be rational.
997 * Sets where only some of the basic sets are marked rational
1000 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
1002 return isl_map_is_rational(set
);
1005 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
1007 return isl_basic_map_is_rational(bset
);
1010 /* Does "bmap" contain any rational points?
1012 * If "bmap" has an equality for each dimension, equating the dimension
1013 * to an integer constant, then it has no rational points, even if it
1014 * is marked as rational.
1016 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
1018 isl_bool has_rational
= isl_bool_true
;
1022 return isl_bool_error
;
1023 if (isl_basic_map_plain_is_empty(bmap
))
1024 return isl_bool_false
;
1025 if (!isl_basic_map_is_rational(bmap
))
1026 return isl_bool_false
;
1027 bmap
= isl_basic_map_copy(bmap
);
1028 bmap
= isl_basic_map_implicit_equalities(bmap
);
1030 return isl_bool_error
;
1031 total
= isl_basic_map_total_dim(bmap
);
1032 if (bmap
->n_eq
== total
) {
1034 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1035 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1038 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1039 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1041 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1046 if (i
== bmap
->n_eq
)
1047 has_rational
= isl_bool_false
;
1049 isl_basic_map_free(bmap
);
1051 return has_rational
;
1054 /* Does "map" contain any rational points?
1056 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1059 isl_bool has_rational
;
1062 return isl_bool_error
;
1063 for (i
= 0; i
< map
->n
; ++i
) {
1064 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1065 if (has_rational
< 0 || has_rational
)
1066 return has_rational
;
1068 return isl_bool_false
;
1071 /* Does "set" contain any rational points?
1073 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1075 return isl_map_has_rational(set
);
1078 /* Is this basic set a parameter domain?
1080 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1083 return isl_bool_error
;
1084 return isl_space_is_params(bset
->dim
);
1087 /* Is this set a parameter domain?
1089 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1092 return isl_bool_error
;
1093 return isl_space_is_params(set
->dim
);
1096 /* Is this map actually a parameter domain?
1097 * Users should never call this function. Outside of isl,
1098 * a map can never be a parameter domain.
1100 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1103 return isl_bool_error
;
1104 return isl_space_is_params(map
->dim
);
1107 static __isl_give isl_basic_map
*basic_map_init(isl_ctx
*ctx
,
1108 __isl_take isl_basic_map
*bmap
, unsigned extra
,
1109 unsigned n_eq
, unsigned n_ineq
)
1112 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
1117 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1118 if (isl_blk_is_error(bmap
->block
))
1121 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1122 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1126 bmap
->block2
= isl_blk_empty();
1129 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1130 if (isl_blk_is_error(bmap
->block2
))
1133 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1138 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1139 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1141 for (i
= 0; i
< extra
; ++i
)
1142 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1146 bmap
->c_size
= n_eq
+ n_ineq
;
1147 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1148 bmap
->extra
= extra
;
1152 bmap
->sample
= NULL
;
1156 isl_basic_map_free(bmap
);
1160 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1161 unsigned nparam
, unsigned dim
, unsigned extra
,
1162 unsigned n_eq
, unsigned n_ineq
)
1164 struct isl_basic_map
*bmap
;
1167 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1171 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1172 return bset_from_bmap(bmap
);
1175 __isl_give isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1176 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1178 struct isl_basic_map
*bmap
;
1181 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1182 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1183 return bset_from_bmap(bmap
);
1185 isl_space_free(dim
);
1189 __isl_give isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*space
,
1190 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1192 struct isl_basic_map
*bmap
;
1196 bmap
= isl_calloc_type(space
->ctx
, struct isl_basic_map
);
1201 return basic_map_init(space
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1203 isl_space_free(space
);
1207 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1208 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1209 unsigned n_eq
, unsigned n_ineq
)
1211 struct isl_basic_map
*bmap
;
1214 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1218 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1222 static __isl_give isl_basic_map
*dup_constraints(__isl_take isl_basic_map
*dst
,
1223 __isl_keep isl_basic_map
*src
)
1226 unsigned total
= isl_basic_map_total_dim(src
);
1231 for (i
= 0; i
< src
->n_eq
; ++i
) {
1232 int j
= isl_basic_map_alloc_equality(dst
);
1234 return isl_basic_map_free(dst
);
1235 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1238 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1239 int j
= isl_basic_map_alloc_inequality(dst
);
1241 return isl_basic_map_free(dst
);
1242 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1245 for (i
= 0; i
< src
->n_div
; ++i
) {
1246 int j
= isl_basic_map_alloc_div(dst
);
1248 return isl_basic_map_free(dst
);
1249 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1251 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1255 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1257 struct isl_basic_map
*dup
;
1261 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1262 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1263 dup
= dup_constraints(dup
, bmap
);
1266 dup
->flags
= bmap
->flags
;
1267 dup
->sample
= isl_vec_copy(bmap
->sample
);
1271 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1273 struct isl_basic_map
*dup
;
1275 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1276 return bset_from_bmap(dup
);
1279 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1284 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1288 return isl_basic_set_dup(bset
);
1291 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1300 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1305 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1309 bmap
= isl_basic_map_dup(bmap
);
1311 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1315 __isl_give isl_map
*isl_map_copy(__isl_keep isl_map
*map
)
1324 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1329 if (--bmap
->ref
> 0)
1332 isl_ctx_deref(bmap
->ctx
);
1334 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1336 isl_blk_free(bmap
->ctx
, bmap
->block
);
1337 isl_vec_free(bmap
->sample
);
1338 isl_space_free(bmap
->dim
);
1344 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1346 return isl_basic_map_free(bset_to_bmap(bset
));
1349 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1351 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1354 /* Check that "map" has only named parameters, reporting an error
1357 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1359 return isl_space_check_named_params(isl_map_peek_space(map
));
1362 /* Check that "bmap" has only named parameters, reporting an error
1365 static isl_stat
isl_basic_map_check_named_params(__isl_keep isl_basic_map
*bmap
)
1367 return isl_space_check_named_params(isl_basic_map_peek_space(bmap
));
1370 /* Check that "bmap1" and "bmap2" have the same parameters,
1371 * reporting an error if they do not.
1373 static isl_stat
isl_basic_map_check_equal_params(
1374 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1378 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1380 return isl_stat_error
;
1382 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1383 "parameters don't match", return isl_stat_error
);
1387 __isl_give isl_map
*isl_map_align_params_map_map_and(
1388 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1389 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1390 __isl_take isl_map
*map2
))
1394 if (isl_map_has_equal_params(map1
, map2
))
1395 return fn(map1
, map2
);
1396 if (isl_map_check_named_params(map1
) < 0)
1398 if (isl_map_check_named_params(map2
) < 0)
1400 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1401 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1402 return fn(map1
, map2
);
1409 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1410 __isl_keep isl_map
*map2
,
1411 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1416 return isl_bool_error
;
1417 if (isl_map_has_equal_params(map1
, map2
))
1418 return fn(map1
, map2
);
1419 if (isl_map_check_named_params(map1
) < 0)
1420 return isl_bool_error
;
1421 if (isl_map_check_named_params(map2
) < 0)
1422 return isl_bool_error
;
1423 map1
= isl_map_copy(map1
);
1424 map2
= isl_map_copy(map2
);
1425 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1426 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1433 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1435 struct isl_ctx
*ctx
;
1439 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1440 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1442 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1443 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1444 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1445 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1446 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1448 int j
= isl_basic_map_alloc_inequality(bmap
);
1452 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1453 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1460 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1461 bmap
->extra
- bmap
->n_div
);
1462 return bmap
->n_eq
++;
1465 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1467 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1470 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1474 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1479 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1481 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1484 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1489 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1491 if (pos
!= bmap
->n_eq
- 1) {
1493 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1494 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1500 /* Turn inequality "pos" of "bmap" into an equality.
1502 * In particular, we move the inequality in front of the equalities
1503 * and move the last inequality in the position of the moved inequality.
1504 * Note that isl_tab_make_equalities_explicit depends on this particular
1505 * change in the ordering of the constraints.
1507 void isl_basic_map_inequality_to_equality(
1508 struct isl_basic_map
*bmap
, unsigned pos
)
1512 t
= bmap
->ineq
[pos
];
1513 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1514 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1519 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1520 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1521 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1522 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1525 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1527 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1530 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1532 struct isl_ctx
*ctx
;
1536 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1537 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1538 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1539 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1540 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1541 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1542 1 + isl_basic_map_total_dim(bmap
),
1543 bmap
->extra
- bmap
->n_div
);
1544 return bmap
->n_ineq
++;
1547 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1549 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1552 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1556 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1561 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1563 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1566 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1571 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1573 if (pos
!= bmap
->n_ineq
- 1) {
1574 t
= bmap
->ineq
[pos
];
1575 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1576 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1577 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1583 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1585 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1588 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1593 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1596 k
= isl_basic_map_alloc_equality(bmap
);
1599 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1602 isl_basic_map_free(bmap
);
1606 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1609 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1612 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1617 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1620 k
= isl_basic_map_alloc_inequality(bmap
);
1623 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1626 isl_basic_map_free(bmap
);
1630 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1633 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1636 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1640 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1641 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1642 1 + 1 + isl_basic_map_total_dim(bmap
),
1643 bmap
->extra
- bmap
->n_div
);
1644 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1645 return bmap
->n_div
++;
1648 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1650 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1653 /* Check that there are "n" dimensions of type "type" starting at "first"
1656 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1657 enum isl_dim_type type
, unsigned first
, unsigned n
)
1662 return isl_stat_error
;
1663 dim
= isl_basic_map_dim(bmap
, type
);
1664 if (first
+ n
> dim
|| first
+ n
< first
)
1665 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1666 "position or range out of bounds",
1667 return isl_stat_error
);
1671 /* Insert an extra integer division, prescribed by "div", to "bmap"
1672 * at (integer division) position "pos".
1674 * The integer division is first added at the end and then moved
1675 * into the right position.
1677 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1678 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1682 bmap
= isl_basic_map_cow(bmap
);
1684 return isl_basic_map_free(bmap
);
1686 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1687 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1688 "unexpected size", return isl_basic_map_free(bmap
));
1689 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1690 return isl_basic_map_free(bmap
);
1692 bmap
= isl_basic_map_extend_space(bmap
,
1693 isl_basic_map_get_space(bmap
), 1, 0, 2);
1694 k
= isl_basic_map_alloc_div(bmap
);
1696 return isl_basic_map_free(bmap
);
1697 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1698 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1700 for (i
= k
; i
> pos
; --i
)
1701 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1706 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1709 return isl_stat_error
;
1710 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1715 /* Copy constraint from src to dst, putting the vars of src at offset
1716 * dim_off in dst and the divs of src at offset div_off in dst.
1717 * If both sets are actually map, then dim_off applies to the input
1720 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1721 struct isl_basic_map
*src_map
, isl_int
*src
,
1722 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1724 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1725 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1726 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1727 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1728 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1729 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1730 isl_int_set(dst
[0], src
[0]);
1731 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1732 if (dst_nparam
> src_nparam
)
1733 isl_seq_clr(dst
+1+src_nparam
,
1734 dst_nparam
- src_nparam
);
1735 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1736 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1738 isl_min(dst_in
-in_off
, src_in
));
1739 if (dst_in
-in_off
> src_in
)
1740 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1741 dst_in
- in_off
- src_in
);
1742 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1743 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1744 src
+1+src_nparam
+src_in
,
1745 isl_min(dst_out
-out_off
, src_out
));
1746 if (dst_out
-out_off
> src_out
)
1747 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1748 dst_out
- out_off
- src_out
);
1749 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1750 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1751 src
+1+src_nparam
+src_in
+src_out
,
1752 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1753 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1754 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1755 div_off
+src_map
->n_div
,
1756 dst_map
->n_div
- div_off
- src_map
->n_div
);
1759 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1760 struct isl_basic_map
*src_map
, isl_int
*src
,
1761 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1763 isl_int_set(dst
[0], src
[0]);
1764 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1767 static __isl_give isl_basic_map
*add_constraints(
1768 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1769 unsigned i_pos
, unsigned o_pos
)
1774 if (!bmap1
|| !bmap2
)
1777 div_off
= bmap1
->n_div
;
1779 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1780 int i1
= isl_basic_map_alloc_equality(bmap1
);
1783 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1784 i_pos
, o_pos
, div_off
);
1787 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1788 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1791 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1792 i_pos
, o_pos
, div_off
);
1795 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1796 int i1
= isl_basic_map_alloc_div(bmap1
);
1799 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1800 i_pos
, o_pos
, div_off
);
1803 isl_basic_map_free(bmap2
);
1808 isl_basic_map_free(bmap1
);
1809 isl_basic_map_free(bmap2
);
1813 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1814 struct isl_basic_set
*bset2
, unsigned pos
)
1816 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1817 bset_to_bmap(bset2
), 0, pos
));
1820 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1821 __isl_take isl_basic_map
*base
, __isl_take isl_space
*space
,
1822 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1824 struct isl_basic_map
*ext
;
1834 dims_ok
= isl_space_is_equal(base
->dim
, space
) &&
1835 base
->extra
>= base
->n_div
+ extra
;
1837 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1838 room_for_ineq(base
, n_ineq
)) {
1839 isl_space_free(space
);
1843 isl_assert(base
->ctx
, base
->dim
->nparam
<= space
->nparam
, goto error
);
1844 isl_assert(base
->ctx
, base
->dim
->n_in
<= space
->n_in
, goto error
);
1845 isl_assert(base
->ctx
, base
->dim
->n_out
<= space
->n_out
, goto error
);
1846 extra
+= base
->extra
;
1848 n_ineq
+= base
->n_ineq
;
1850 ext
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1856 ext
->sample
= isl_vec_copy(base
->sample
);
1857 flags
= base
->flags
;
1858 ext
= add_constraints(ext
, base
, 0, 0);
1861 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1867 isl_space_free(space
);
1868 isl_basic_map_free(base
);
1872 __isl_give isl_basic_set
*isl_basic_set_extend_space(
1873 __isl_take isl_basic_set
*base
,
1874 __isl_take isl_space
*dim
, unsigned extra
,
1875 unsigned n_eq
, unsigned n_ineq
)
1877 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1878 dim
, extra
, n_eq
, n_ineq
));
1881 struct isl_basic_map
*isl_basic_map_extend_constraints(
1882 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1886 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1890 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1891 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1892 unsigned n_eq
, unsigned n_ineq
)
1894 struct isl_basic_map
*bmap
;
1899 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1903 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1906 isl_basic_map_free(base
);
1910 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1911 unsigned nparam
, unsigned dim
, unsigned extra
,
1912 unsigned n_eq
, unsigned n_ineq
)
1914 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1915 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1918 struct isl_basic_set
*isl_basic_set_extend_constraints(
1919 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1921 isl_basic_map
*bmap
= bset_to_bmap(base
);
1922 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1923 return bset_from_bmap(bmap
);
1926 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1928 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1931 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1936 if (bmap
->ref
> 1) {
1938 bmap
= isl_basic_map_dup(bmap
);
1941 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1942 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1947 /* Clear all cached information in "map", either because it is about
1948 * to be modified or because it is being freed.
1949 * Always return the same pointer that is passed in.
1950 * This is needed for the use in isl_map_free.
1952 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1954 isl_basic_map_free(map
->cached_simple_hull
[0]);
1955 isl_basic_map_free(map
->cached_simple_hull
[1]);
1956 map
->cached_simple_hull
[0] = NULL
;
1957 map
->cached_simple_hull
[1] = NULL
;
1961 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1963 return isl_map_cow(set
);
1966 /* Return an isl_map that is equal to "map" and that has only
1967 * a single reference.
1969 * If the original input already has only one reference, then
1970 * simply return it, but clear all cached information, since
1971 * it may be rendered invalid by the operations that will be
1972 * performed on the result.
1974 * Otherwise, create a duplicate (without any cached information).
1976 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
1982 return clear_caches(map
);
1984 return isl_map_dup(map
);
1987 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1988 unsigned a_len
, unsigned b_len
)
1990 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1991 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1992 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1995 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1996 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
2004 isl_assert(bmap
->ctx
,
2005 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
2007 if (n1
== 0 || n2
== 0)
2010 bmap
= isl_basic_map_cow(bmap
);
2014 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
2015 if (isl_blk_is_error(blk
))
2018 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2020 bmap
->eq
[i
] + pos
, n1
, n2
);
2022 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2024 bmap
->ineq
[i
] + pos
, n1
, n2
);
2026 for (i
= 0; i
< bmap
->n_div
; ++i
)
2028 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2030 isl_blk_free(bmap
->ctx
, blk
);
2032 ISL_F_CLR(bmap
, ISL_BASIC_SET_SORTED
);
2033 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2034 return isl_basic_map_finalize(bmap
);
2036 isl_basic_map_free(bmap
);
2040 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2041 __isl_take isl_basic_map
*bmap
)
2047 total
= isl_basic_map_total_dim(bmap
);
2048 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2049 return isl_basic_map_free(bmap
);
2050 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2052 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2054 i
= isl_basic_map_alloc_equality(bmap
);
2058 isl_int_set_si(bmap
->eq
[i
][0], 1);
2059 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2060 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2061 isl_vec_free(bmap
->sample
);
2062 bmap
->sample
= NULL
;
2063 return isl_basic_map_finalize(bmap
);
2065 isl_basic_map_free(bmap
);
2069 __isl_give isl_basic_set
*isl_basic_set_set_to_empty(
2070 __isl_take isl_basic_set
*bset
)
2072 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2075 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2076 __isl_take isl_basic_map
*bmap
)
2081 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2084 bmap
= isl_basic_map_cow(bmap
);
2088 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2090 return isl_basic_map_finalize(bmap
);
2093 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2094 __isl_take isl_basic_set
*bset
)
2096 return isl_basic_map_set_rational(bset
);
2099 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2100 __isl_take isl_basic_set
*bset
)
2105 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2108 bset
= isl_basic_set_cow(bset
);
2112 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2114 return isl_basic_set_finalize(bset
);
2117 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2121 map
= isl_map_cow(map
);
2124 for (i
= 0; i
< map
->n
; ++i
) {
2125 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2135 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2137 return isl_map_set_rational(set
);
2140 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2143 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2145 isl_int
*t
= bmap
->div
[a
];
2146 bmap
->div
[a
] = bmap
->div
[b
];
2150 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2151 * div definitions accordingly.
2153 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
2156 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2158 swap_div(bmap
, a
, b
);
2160 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2161 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2163 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2164 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2166 for (i
= 0; i
< bmap
->n_div
; ++i
)
2167 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2168 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2171 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2173 isl_seq_cpy(c
, c
+ n
, rem
);
2174 isl_seq_clr(c
+ rem
, n
);
2177 /* Drop n dimensions starting at first.
2179 * In principle, this frees up some extra variables as the number
2180 * of columns remains constant, but we would have to extend
2181 * the div array too as the number of rows in this array is assumed
2182 * to be equal to extra.
2184 __isl_give isl_basic_set
*isl_basic_set_drop_dims(
2185 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2187 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2190 /* Move "n" divs starting at "first" to the end of the list of divs.
2192 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2193 unsigned first
, unsigned n
)
2198 if (first
+ n
== bmap
->n_div
)
2201 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2204 for (i
= 0; i
< n
; ++i
)
2205 div
[i
] = bmap
->div
[first
+ i
];
2206 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2207 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2208 for (i
= 0; i
< n
; ++i
)
2209 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2213 isl_basic_map_free(bmap
);
2217 /* Check that there are "n" dimensions of type "type" starting at "first"
2220 static isl_stat
isl_map_check_range(__isl_keep isl_map
*map
,
2221 enum isl_dim_type type
, unsigned first
, unsigned n
)
2224 return isl_stat_error
;
2225 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2226 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2227 "position or range out of bounds",
2228 return isl_stat_error
);
2232 /* Drop "n" dimensions of type "type" starting at "first".
2234 * In principle, this frees up some extra variables as the number
2235 * of columns remains constant, but we would have to extend
2236 * the div array too as the number of rows in this array is assumed
2237 * to be equal to extra.
2239 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2240 enum isl_dim_type type
, unsigned first
, unsigned n
)
2250 dim
= isl_basic_map_dim(bmap
, type
);
2251 isl_assert(bmap
->ctx
, first
+ n
<= dim
, goto error
);
2253 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2256 bmap
= isl_basic_map_cow(bmap
);
2260 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2261 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2262 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2263 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2265 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2266 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2268 for (i
= 0; i
< bmap
->n_div
; ++i
)
2269 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2271 if (type
== isl_dim_div
) {
2272 bmap
= move_divs_last(bmap
, first
, n
);
2275 if (isl_basic_map_free_div(bmap
, n
) < 0)
2276 return isl_basic_map_free(bmap
);
2278 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2282 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
2283 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2284 bmap
= isl_basic_map_simplify(bmap
);
2285 return isl_basic_map_finalize(bmap
);
2287 isl_basic_map_free(bmap
);
2291 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2292 enum isl_dim_type type
, unsigned first
, unsigned n
)
2294 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2298 /* No longer consider "map" to be normalized.
2300 static __isl_give isl_map
*isl_map_unmark_normalized(__isl_take isl_map
*map
)
2304 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2308 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2309 enum isl_dim_type type
, unsigned first
, unsigned n
)
2313 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2314 return isl_map_free(map
);
2316 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2318 map
= isl_map_cow(map
);
2321 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2325 for (i
= 0; i
< map
->n
; ++i
) {
2326 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2330 map
= isl_map_unmark_normalized(map
);
2338 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2339 enum isl_dim_type type
, unsigned first
, unsigned n
)
2341 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2345 * We don't cow, as the div is assumed to be redundant.
2347 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2348 __isl_take isl_basic_map
*bmap
, unsigned div
)
2356 pos
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + div
;
2358 isl_assert(bmap
->ctx
, div
< bmap
->n_div
, goto error
);
2360 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2361 constraint_drop_vars(bmap
->eq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2363 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2364 if (!isl_int_is_zero(bmap
->ineq
[i
][pos
])) {
2365 isl_basic_map_drop_inequality(bmap
, i
);
2369 constraint_drop_vars(bmap
->ineq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2372 for (i
= 0; i
< bmap
->n_div
; ++i
)
2373 constraint_drop_vars(bmap
->div
[i
]+1+pos
, 1, bmap
->extra
-div
-1);
2375 if (div
!= bmap
->n_div
- 1) {
2377 isl_int
*t
= bmap
->div
[div
];
2379 for (j
= div
; j
< bmap
->n_div
- 1; ++j
)
2380 bmap
->div
[j
] = bmap
->div
[j
+1];
2382 bmap
->div
[bmap
->n_div
- 1] = t
;
2384 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
2385 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2386 if (isl_basic_map_free_div(bmap
, 1) < 0)
2387 return isl_basic_map_free(bmap
);
2391 isl_basic_map_free(bmap
);
2395 /* Eliminate the specified n dimensions starting at first from the
2396 * constraints, without removing the dimensions from the space.
2397 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2399 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2400 enum isl_dim_type type
, unsigned first
, unsigned n
)
2407 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2408 return isl_map_free(map
);
2410 map
= isl_map_cow(map
);
2414 for (i
= 0; i
< map
->n
; ++i
) {
2415 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2425 /* Eliminate the specified n dimensions starting at first from the
2426 * constraints, without removing the dimensions from the space.
2427 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2429 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2430 enum isl_dim_type type
, unsigned first
, unsigned n
)
2432 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2435 /* Eliminate the specified n dimensions starting at first from the
2436 * constraints, without removing the dimensions from the space.
2437 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2439 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2440 unsigned first
, unsigned n
)
2442 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2445 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2446 __isl_take isl_basic_map
*bmap
)
2450 bmap
= isl_basic_map_eliminate_vars(bmap
,
2451 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2455 return isl_basic_map_finalize(bmap
);
2458 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2459 __isl_take isl_basic_set
*bset
)
2461 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2464 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2473 map
= isl_map_cow(map
);
2477 for (i
= 0; i
< map
->n
; ++i
) {
2478 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2488 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2490 return isl_map_remove_divs(set
);
2493 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2494 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2495 unsigned first
, unsigned n
)
2497 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2498 return isl_basic_map_free(bmap
);
2499 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2501 bmap
= isl_basic_map_eliminate_vars(bmap
,
2502 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2505 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2507 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2511 /* Return true if the definition of the given div (recursively) involves
2512 * any of the given variables.
2514 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2515 unsigned first
, unsigned n
)
2518 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2520 if (isl_int_is_zero(bmap
->div
[div
][0]))
2521 return isl_bool_false
;
2522 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2523 return isl_bool_true
;
2525 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2528 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2530 involves
= div_involves_vars(bmap
, i
, first
, n
);
2531 if (involves
< 0 || involves
)
2535 return isl_bool_false
;
2538 /* Try and add a lower and/or upper bound on "div" to "bmap"
2539 * based on inequality "i".
2540 * "total" is the total number of variables (excluding the divs).
2541 * "v" is a temporary object that can be used during the calculations.
2542 * If "lb" is set, then a lower bound should be constructed.
2543 * If "ub" is set, then an upper bound should be constructed.
2545 * The calling function has already checked that the inequality does not
2546 * reference "div", but we still need to check that the inequality is
2547 * of the right form. We'll consider the case where we want to construct
2548 * a lower bound. The construction of upper bounds is similar.
2550 * Let "div" be of the form
2552 * q = floor((a + f(x))/d)
2554 * We essentially check if constraint "i" is of the form
2558 * so that we can use it to derive a lower bound on "div".
2559 * However, we allow a slightly more general form
2563 * with the condition that the coefficients of g(x) - f(x) are all
2565 * Rewriting this constraint as
2569 * adding a + f(x) to both sides and dividing by d, we obtain
2571 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2573 * Taking the floor on both sides, we obtain
2575 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2579 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2581 * In the case of an upper bound, we construct the constraint
2583 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2586 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2587 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2588 unsigned total
, isl_int v
, int lb
, int ub
)
2592 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2594 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2595 bmap
->div
[div
][1 + 1 + j
]);
2596 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2599 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2600 bmap
->div
[div
][1 + 1 + j
]);
2601 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2607 bmap
= isl_basic_map_cow(bmap
);
2608 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2610 int k
= isl_basic_map_alloc_inequality(bmap
);
2613 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2614 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2615 bmap
->div
[div
][1 + j
]);
2616 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2617 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2619 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2622 int k
= isl_basic_map_alloc_inequality(bmap
);
2625 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2626 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2627 bmap
->div
[div
][1 + j
]);
2628 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2629 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2631 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2636 isl_basic_map_free(bmap
);
2640 /* This function is called right before "div" is eliminated from "bmap"
2641 * using Fourier-Motzkin.
2642 * Look through the constraints of "bmap" for constraints on the argument
2643 * of the integer division and use them to construct constraints on the
2644 * integer division itself. These constraints can then be combined
2645 * during the Fourier-Motzkin elimination.
2646 * Note that it is only useful to introduce lower bounds on "div"
2647 * if "bmap" already contains upper bounds on "div" as the newly
2648 * introduce lower bounds can then be combined with the pre-existing
2649 * upper bounds. Similarly for upper bounds.
2650 * We therefore first check if "bmap" contains any lower and/or upper bounds
2653 * It is interesting to note that the introduction of these constraints
2654 * can indeed lead to more accurate results, even when compared to
2655 * deriving constraints on the argument of "div" from constraints on "div".
2656 * Consider, for example, the set
2658 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2660 * The second constraint can be rewritten as
2662 * 2 * [(-i-2j+3)/4] + k >= 0
2664 * from which we can derive
2666 * -i - 2j + 3 >= -2k
2672 * Combined with the first constraint, we obtain
2674 * -3 <= 3 + 2k or k >= -3
2676 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2677 * the first constraint, we obtain
2679 * [(i + 2j)/4] >= [-3/4] = -1
2681 * Combining this constraint with the second constraint, we obtain
2685 static __isl_give isl_basic_map
*insert_bounds_on_div(
2686 __isl_take isl_basic_map
*bmap
, int div
)
2689 int check_lb
, check_ub
;
2696 if (isl_int_is_zero(bmap
->div
[div
][0]))
2699 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2703 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2704 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2711 if (!check_lb
&& !check_ub
)
2716 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2717 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2720 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2721 check_lb
, check_ub
);
2729 /* Remove all divs (recursively) involving any of the given dimensions
2730 * in their definitions.
2732 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2733 __isl_take isl_basic_map
*bmap
,
2734 enum isl_dim_type type
, unsigned first
, unsigned n
)
2738 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2739 return isl_basic_map_free(bmap
);
2740 first
+= isl_basic_map_offset(bmap
, type
);
2742 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2745 involves
= div_involves_vars(bmap
, i
, first
, n
);
2747 return isl_basic_map_free(bmap
);
2750 bmap
= insert_bounds_on_div(bmap
, i
);
2751 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2760 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2761 __isl_take isl_basic_set
*bset
,
2762 enum isl_dim_type type
, unsigned first
, unsigned n
)
2764 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2767 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2768 enum isl_dim_type type
, unsigned first
, unsigned n
)
2777 map
= isl_map_cow(map
);
2781 for (i
= 0; i
< map
->n
; ++i
) {
2782 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2793 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2794 enum isl_dim_type type
, unsigned first
, unsigned n
)
2796 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2800 /* Does the description of "bmap" depend on the specified dimensions?
2801 * We also check whether the dimensions appear in any of the div definitions.
2802 * In principle there is no need for this check. If the dimensions appear
2803 * in a div definition, they also appear in the defining constraints of that
2806 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2807 enum isl_dim_type type
, unsigned first
, unsigned n
)
2811 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2812 return isl_bool_error
;
2814 first
+= isl_basic_map_offset(bmap
, type
);
2815 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2816 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2817 return isl_bool_true
;
2818 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2819 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2820 return isl_bool_true
;
2821 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2822 if (isl_int_is_zero(bmap
->div
[i
][0]))
2824 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2825 return isl_bool_true
;
2828 return isl_bool_false
;
2831 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2832 enum isl_dim_type type
, unsigned first
, unsigned n
)
2836 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2837 return isl_bool_error
;
2839 for (i
= 0; i
< map
->n
; ++i
) {
2840 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2842 if (involves
< 0 || involves
)
2846 return isl_bool_false
;
2849 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2850 enum isl_dim_type type
, unsigned first
, unsigned n
)
2852 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2855 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2856 enum isl_dim_type type
, unsigned first
, unsigned n
)
2858 return isl_map_involves_dims(set
, type
, first
, n
);
2861 /* Drop all constraints in bmap that involve any of the dimensions
2862 * first to first+n-1.
2864 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2865 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2872 bmap
= isl_basic_map_cow(bmap
);
2877 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2878 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2880 isl_basic_map_drop_equality(bmap
, i
);
2883 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2884 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2886 isl_basic_map_drop_inequality(bmap
, i
);
2889 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2893 /* Drop all constraints in bset that involve any of the dimensions
2894 * first to first+n-1.
2896 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2897 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2899 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2902 /* Drop all constraints in bmap that do not involve any of the dimensions
2903 * first to first + n - 1 of the given type.
2905 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2906 __isl_take isl_basic_map
*bmap
,
2907 enum isl_dim_type type
, unsigned first
, unsigned n
)
2912 isl_space
*space
= isl_basic_map_get_space(bmap
);
2913 isl_basic_map_free(bmap
);
2914 return isl_basic_map_universe(space
);
2916 bmap
= isl_basic_map_cow(bmap
);
2920 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2921 return isl_basic_map_free(bmap
);
2923 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2925 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2926 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2928 isl_basic_map_drop_equality(bmap
, i
);
2931 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2932 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2934 isl_basic_map_drop_inequality(bmap
, i
);
2937 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2941 /* Drop all constraints in bset that do not involve any of the dimensions
2942 * first to first + n - 1 of the given type.
2944 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2945 __isl_take isl_basic_set
*bset
,
2946 enum isl_dim_type type
, unsigned first
, unsigned n
)
2948 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2952 /* Drop all constraints in bmap that involve any of the dimensions
2953 * first to first + n - 1 of the given type.
2955 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2956 __isl_take isl_basic_map
*bmap
,
2957 enum isl_dim_type type
, unsigned first
, unsigned n
)
2964 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2965 return isl_basic_map_free(bmap
);
2967 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2968 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2969 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2972 /* Drop all constraints in bset that involve any of the dimensions
2973 * first to first + n - 1 of the given type.
2975 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2976 __isl_take isl_basic_set
*bset
,
2977 enum isl_dim_type type
, unsigned first
, unsigned n
)
2979 return isl_basic_map_drop_constraints_involving_dims(bset
,
2983 /* Drop constraints from "map" by applying "drop" to each basic map.
2985 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2986 enum isl_dim_type type
, unsigned first
, unsigned n
,
2987 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2988 enum isl_dim_type type
, unsigned first
, unsigned n
))
2992 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2993 return isl_map_free(map
);
2995 map
= isl_map_cow(map
);
2999 for (i
= 0; i
< map
->n
; ++i
) {
3000 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
3002 return isl_map_free(map
);
3006 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3011 /* Drop all constraints in map that involve any of the dimensions
3012 * first to first + n - 1 of the given type.
3014 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
3015 __isl_take isl_map
*map
,
3016 enum isl_dim_type type
, unsigned first
, unsigned n
)
3020 return drop_constraints(map
, type
, first
, n
,
3021 &isl_basic_map_drop_constraints_involving_dims
);
3024 /* Drop all constraints in "map" that do not involve any of the dimensions
3025 * first to first + n - 1 of the given type.
3027 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
3028 __isl_take isl_map
*map
,
3029 enum isl_dim_type type
, unsigned first
, unsigned n
)
3032 isl_space
*space
= isl_map_get_space(map
);
3034 return isl_map_universe(space
);
3036 return drop_constraints(map
, type
, first
, n
,
3037 &isl_basic_map_drop_constraints_not_involving_dims
);
3040 /* Drop all constraints in set that involve any of the dimensions
3041 * first to first + n - 1 of the given type.
3043 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
3044 __isl_take isl_set
*set
,
3045 enum isl_dim_type type
, unsigned first
, unsigned n
)
3047 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
3050 /* Drop all constraints in "set" that do not involve any of the dimensions
3051 * first to first + n - 1 of the given type.
3053 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
3054 __isl_take isl_set
*set
,
3055 enum isl_dim_type type
, unsigned first
, unsigned n
)
3057 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3060 /* Does local variable "div" of "bmap" have a complete explicit representation?
3061 * Having a complete explicit representation requires not only
3062 * an explicit representation, but also that all local variables
3063 * that appear in this explicit representation in turn have
3064 * a complete explicit representation.
3066 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3069 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3072 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3073 if (marked
< 0 || marked
)
3074 return isl_bool_not(marked
);
3076 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3079 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3081 known
= isl_basic_map_div_is_known(bmap
, i
);
3082 if (known
< 0 || !known
)
3086 return isl_bool_true
;
3089 /* Remove all divs that are unknown or defined in terms of unknown divs.
3091 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3092 __isl_take isl_basic_map
*bmap
)
3099 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3100 if (isl_basic_map_div_is_known(bmap
, i
))
3102 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3111 /* Remove all divs that are unknown or defined in terms of unknown divs.
3113 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3114 __isl_take isl_basic_set
*bset
)
3116 return isl_basic_map_remove_unknown_divs(bset
);
3119 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3128 map
= isl_map_cow(map
);
3132 for (i
= 0; i
< map
->n
; ++i
) {
3133 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3143 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3145 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3148 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3149 __isl_take isl_basic_set
*bset
,
3150 enum isl_dim_type type
, unsigned first
, unsigned n
)
3152 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3153 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3154 return bset_from_bmap(bmap
);
3157 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3158 enum isl_dim_type type
, unsigned first
, unsigned n
)
3165 map
= isl_map_cow(map
);
3166 if (isl_map_check_range(map
, type
, first
, n
) < 0)
3167 return isl_map_free(map
);
3169 for (i
= 0; i
< map
->n
; ++i
) {
3170 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3171 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3175 map
= isl_map_drop(map
, type
, first
, n
);
3182 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3183 enum isl_dim_type type
, unsigned first
, unsigned n
)
3185 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3189 /* Project out n inputs starting at first using Fourier-Motzkin */
3190 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3191 unsigned first
, unsigned n
)
3193 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3196 static void dump_term(struct isl_basic_map
*bmap
,
3197 isl_int c
, int pos
, FILE *out
)
3200 unsigned in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3201 unsigned dim
= in
+ isl_basic_map_dim(bmap
, isl_dim_out
);
3202 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3204 isl_int_print(out
, c
, 0);
3206 if (!isl_int_is_one(c
))
3207 isl_int_print(out
, c
, 0);
3208 if (pos
< 1 + nparam
) {
3209 name
= isl_space_get_dim_name(bmap
->dim
,
3210 isl_dim_param
, pos
- 1);
3212 fprintf(out
, "%s", name
);
3214 fprintf(out
, "p%d", pos
- 1);
3215 } else if (pos
< 1 + nparam
+ in
)
3216 fprintf(out
, "i%d", pos
- 1 - nparam
);
3217 else if (pos
< 1 + nparam
+ dim
)
3218 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
3220 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
3224 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
3225 int sign
, FILE *out
)
3229 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
3233 for (i
= 0, first
= 1; i
< len
; ++i
) {
3234 if (isl_int_sgn(c
[i
]) * sign
<= 0)
3237 fprintf(out
, " + ");
3239 isl_int_abs(v
, c
[i
]);
3240 dump_term(bmap
, v
, i
, out
);
3247 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
3248 const char *op
, FILE *out
, int indent
)
3252 fprintf(out
, "%*s", indent
, "");
3254 dump_constraint_sign(bmap
, c
, 1, out
);
3255 fprintf(out
, " %s ", op
);
3256 dump_constraint_sign(bmap
, c
, -1, out
);
3260 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
3261 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
3263 fprintf(out
, "%*s", indent
, "");
3264 fprintf(out
, "ERROR: unused div coefficient not zero\n");
3269 static void dump_constraints(struct isl_basic_map
*bmap
,
3270 isl_int
**c
, unsigned n
,
3271 const char *op
, FILE *out
, int indent
)
3275 for (i
= 0; i
< n
; ++i
)
3276 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
3279 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
3283 unsigned total
= isl_basic_map_total_dim(bmap
);
3285 for (j
= 0; j
< 1 + total
; ++j
) {
3286 if (isl_int_is_zero(exp
[j
]))
3288 if (!first
&& isl_int_is_pos(exp
[j
]))
3290 dump_term(bmap
, exp
[j
], j
, out
);
3295 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
3299 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
3300 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
3302 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3303 fprintf(out
, "%*s", indent
, "");
3304 fprintf(out
, "e%d = [(", i
);
3305 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
3307 isl_int_print(out
, bmap
->div
[i
][0], 0);
3308 fprintf(out
, "]\n");
3312 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3313 FILE *out
, int indent
)
3316 fprintf(out
, "null basic set\n");
3320 fprintf(out
, "%*s", indent
, "");
3321 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3322 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3323 bset
->extra
, bset
->flags
);
3324 dump(bset_to_bmap(bset
), out
, indent
);
3327 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3328 FILE *out
, int indent
)
3331 fprintf(out
, "null basic map\n");
3335 fprintf(out
, "%*s", indent
, "");
3336 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3337 "flags: %x, n_name: %d\n",
3339 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3340 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3341 dump(bmap
, out
, indent
);
3344 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
3349 total
= isl_basic_map_total_dim(bmap
);
3350 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
3351 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3352 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3353 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
3354 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
3358 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3361 if (isl_space_check_is_set(space
) < 0)
3363 return isl_map_alloc_space(space
, n
, flags
);
3365 isl_space_free(space
);
3369 /* Make sure "map" has room for at least "n" more basic maps.
3371 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3374 struct isl_map
*grown
= NULL
;
3378 isl_assert(map
->ctx
, n
>= 0, goto error
);
3379 if (map
->n
+ n
<= map
->size
)
3381 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3384 for (i
= 0; i
< map
->n
; ++i
) {
3385 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3393 isl_map_free(grown
);
3398 /* Make sure "set" has room for at least "n" more basic sets.
3400 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3402 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3405 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3407 return isl_map_from_basic_map(bset
);
3410 __isl_give isl_map
*isl_map_from_basic_map(__isl_take isl_basic_map
*bmap
)
3412 struct isl_map
*map
;
3417 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3418 return isl_map_add_basic_map(map
, bmap
);
3421 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3422 __isl_take isl_basic_set
*bset
)
3424 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3425 bset_to_bmap(bset
)));
3428 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3430 return isl_map_free(set
);
3433 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3438 fprintf(out
, "null set\n");
3442 fprintf(out
, "%*s", indent
, "");
3443 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3444 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3446 for (i
= 0; i
< set
->n
; ++i
) {
3447 fprintf(out
, "%*s", indent
, "");
3448 fprintf(out
, "basic set %d:\n", i
);
3449 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3453 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3458 fprintf(out
, "null map\n");
3462 fprintf(out
, "%*s", indent
, "");
3463 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3464 "flags: %x, n_name: %d\n",
3465 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3466 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3467 for (i
= 0; i
< map
->n
; ++i
) {
3468 fprintf(out
, "%*s", indent
, "");
3469 fprintf(out
, "basic map %d:\n", i
);
3470 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3474 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3475 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3477 struct isl_basic_map
*bmap_domain
;
3479 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3482 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3483 isl_assert(bset
->ctx
,
3484 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3486 bmap
= isl_basic_map_cow(bmap
);
3489 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3490 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3491 bmap_domain
= isl_basic_map_from_domain(bset
);
3492 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3494 bmap
= isl_basic_map_simplify(bmap
);
3495 return isl_basic_map_finalize(bmap
);
3497 isl_basic_map_free(bmap
);
3498 isl_basic_set_free(bset
);
3502 /* Check that the space of "bset" is the same as that of the range of "bmap".
3504 static isl_stat
isl_basic_map_check_compatible_range(
3505 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3509 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3511 return isl_stat_error
;
3513 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3514 "incompatible spaces", return isl_stat_error
);
3519 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3520 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3522 struct isl_basic_map
*bmap_range
;
3524 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3527 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3528 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3531 if (isl_basic_set_plain_is_universe(bset
)) {
3532 isl_basic_set_free(bset
);
3536 bmap
= isl_basic_map_cow(bmap
);
3539 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3540 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3541 bmap_range
= bset_to_bmap(bset
);
3542 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3544 bmap
= isl_basic_map_simplify(bmap
);
3545 return isl_basic_map_finalize(bmap
);
3547 isl_basic_map_free(bmap
);
3548 isl_basic_set_free(bset
);
3552 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3553 __isl_keep isl_vec
*vec
)
3560 return isl_bool_error
;
3562 total
= 1 + isl_basic_map_total_dim(bmap
);
3563 if (total
!= vec
->size
)
3564 return isl_bool_false
;
3568 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3569 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3570 if (!isl_int_is_zero(s
)) {
3572 return isl_bool_false
;
3576 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3577 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3578 if (isl_int_is_neg(s
)) {
3580 return isl_bool_false
;
3586 return isl_bool_true
;
3589 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3590 __isl_keep isl_vec
*vec
)
3592 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3595 __isl_give isl_basic_map
*isl_basic_map_intersect(
3596 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3598 struct isl_vec
*sample
= NULL
;
3600 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3602 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3603 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3604 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3605 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3606 return isl_basic_map_intersect(bmap2
, bmap1
);
3608 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3609 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3610 isl_assert(bmap1
->ctx
,
3611 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3613 if (isl_basic_map_plain_is_empty(bmap1
)) {
3614 isl_basic_map_free(bmap2
);
3617 if (isl_basic_map_plain_is_empty(bmap2
)) {
3618 isl_basic_map_free(bmap1
);
3622 if (bmap1
->sample
&&
3623 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3624 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3625 sample
= isl_vec_copy(bmap1
->sample
);
3626 else if (bmap2
->sample
&&
3627 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3628 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3629 sample
= isl_vec_copy(bmap2
->sample
);
3631 bmap1
= isl_basic_map_cow(bmap1
);
3634 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3635 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3636 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3639 isl_vec_free(sample
);
3641 isl_vec_free(bmap1
->sample
);
3642 bmap1
->sample
= sample
;
3645 bmap1
= isl_basic_map_simplify(bmap1
);
3646 return isl_basic_map_finalize(bmap1
);
3649 isl_vec_free(sample
);
3650 isl_basic_map_free(bmap1
);
3651 isl_basic_map_free(bmap2
);
3655 struct isl_basic_set
*isl_basic_set_intersect(
3656 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3658 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3659 bset_to_bmap(bset2
)));
3662 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3663 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3665 return isl_basic_set_intersect(bset1
, bset2
);
3668 /* Special case of isl_map_intersect, where both map1 and map2
3669 * are convex, without any divs and such that either map1 or map2
3670 * contains a single constraint. This constraint is then simply
3671 * added to the other map.
3673 static __isl_give isl_map
*map_intersect_add_constraint(
3674 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3676 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3677 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3678 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3679 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3681 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3682 return isl_map_intersect(map2
, map1
);
3684 map1
= isl_map_cow(map1
);
3687 if (isl_map_plain_is_empty(map1
)) {
3691 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3692 if (map2
->p
[0]->n_eq
== 1)
3693 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3695 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3696 map2
->p
[0]->ineq
[0]);
3698 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3699 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3703 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3704 isl_basic_map_free(map1
->p
[0]);
3710 map1
= isl_map_unmark_normalized(map1
);
3718 /* map2 may be either a parameter domain or a map living in the same
3721 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3722 __isl_take isl_map
*map2
)
3732 if ((isl_map_plain_is_empty(map1
) ||
3733 isl_map_plain_is_universe(map2
)) &&
3734 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3738 if ((isl_map_plain_is_empty(map2
) ||
3739 isl_map_plain_is_universe(map1
)) &&
3740 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3745 if (map1
->n
== 1 && map2
->n
== 1 &&
3746 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3747 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3748 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3749 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3750 return map_intersect_add_constraint(map1
, map2
);
3752 equal
= isl_map_plain_is_equal(map1
, map2
);
3760 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3761 isl_space_dim(map2
->dim
, isl_dim_param
))
3762 isl_assert(map1
->ctx
,
3763 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3765 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3766 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3767 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3769 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3770 map1
->n
* map2
->n
, flags
);
3773 for (i
= 0; i
< map1
->n
; ++i
)
3774 for (j
= 0; j
< map2
->n
; ++j
) {
3775 struct isl_basic_map
*part
;
3776 part
= isl_basic_map_intersect(
3777 isl_basic_map_copy(map1
->p
[i
]),
3778 isl_basic_map_copy(map2
->p
[j
]));
3779 if (isl_basic_map_is_empty(part
) < 0)
3780 part
= isl_basic_map_free(part
);
3781 result
= isl_map_add_basic_map(result
, part
);
3794 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3795 __isl_take isl_map
*map2
)
3799 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3800 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3801 "spaces don't match", goto error
);
3802 return map_intersect_internal(map1
, map2
);
3809 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3810 __isl_take isl_map
*map2
)
3812 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3815 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3817 return set_from_map(isl_map_intersect(set_to_map(set1
),
3821 /* map_intersect_internal accepts intersections
3822 * with parameter domains, so we can just call that function.
3824 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3825 __isl_take isl_set
*params
)
3827 return map_intersect_internal(map
, params
);
3830 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3831 __isl_take isl_map
*map2
)
3833 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3836 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3837 __isl_take isl_set
*params
)
3839 return isl_map_intersect_params(set
, params
);
3842 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3845 unsigned pos
, n1
, n2
;
3849 bmap
= isl_basic_map_cow(bmap
);
3852 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3853 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3854 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3855 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3856 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3857 return isl_basic_map_reset_space(bmap
, space
);
3860 static __isl_give isl_basic_map
*basic_map_space_reset(
3861 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3867 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3870 space
= isl_basic_map_get_space(bmap
);
3871 space
= isl_space_reset(space
, type
);
3872 bmap
= isl_basic_map_reset_space(bmap
, space
);
3876 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3877 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3878 unsigned pos
, unsigned n
)
3881 isl_space
*res_space
;
3882 struct isl_basic_map
*res
;
3883 struct isl_dim_map
*dim_map
;
3884 unsigned total
, off
;
3885 enum isl_dim_type t
;
3888 return basic_map_space_reset(bmap
, type
);
3890 res_space
= isl_space_insert_dims(isl_basic_map_get_space(bmap
),
3893 return isl_basic_map_free(bmap
);
3895 total
= isl_basic_map_total_dim(bmap
) + n
;
3896 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3898 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3900 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3902 unsigned size
= isl_basic_map_dim(bmap
, t
);
3903 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3905 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3906 pos
, size
- pos
, off
+ pos
+ n
);
3908 off
+= isl_space_dim(res_space
, t
);
3910 isl_dim_map_div(dim_map
, bmap
, off
);
3912 res
= isl_basic_map_alloc_space(res_space
,
3913 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3914 rational
= isl_basic_map_is_rational(bmap
);
3916 res
= isl_basic_map_free(res
);
3918 res
= isl_basic_map_set_rational(res
);
3919 if (isl_basic_map_plain_is_empty(bmap
)) {
3920 isl_basic_map_free(bmap
);
3922 return isl_basic_map_set_to_empty(res
);
3924 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3925 return isl_basic_map_finalize(res
);
3928 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3929 __isl_take isl_basic_set
*bset
,
3930 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3932 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3935 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3936 enum isl_dim_type type
, unsigned n
)
3940 return isl_basic_map_insert_dims(bmap
, type
,
3941 isl_basic_map_dim(bmap
, type
), n
);
3944 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3945 enum isl_dim_type type
, unsigned n
)
3949 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3950 return isl_basic_map_add_dims(bset
, type
, n
);
3952 isl_basic_set_free(bset
);
3956 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3957 enum isl_dim_type type
)
3961 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3964 space
= isl_map_get_space(map
);
3965 space
= isl_space_reset(space
, type
);
3966 map
= isl_map_reset_space(map
, space
);
3970 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3971 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3976 return map_space_reset(map
, type
);
3978 map
= isl_map_cow(map
);
3982 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3986 for (i
= 0; i
< map
->n
; ++i
) {
3987 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3998 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3999 enum isl_dim_type type
, unsigned pos
, unsigned n
)
4001 return isl_map_insert_dims(set
, type
, pos
, n
);
4004 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
4005 enum isl_dim_type type
, unsigned n
)
4009 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
4012 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
4013 enum isl_dim_type type
, unsigned n
)
4017 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
4018 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
4024 __isl_give isl_basic_map
*isl_basic_map_move_dims(
4025 __isl_take isl_basic_map
*bmap
,
4026 enum isl_dim_type dst_type
, unsigned dst_pos
,
4027 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4029 struct isl_dim_map
*dim_map
;
4030 struct isl_basic_map
*res
;
4031 enum isl_dim_type t
;
4032 unsigned total
, off
;
4037 bmap
= isl_basic_map_reset(bmap
, src_type
);
4038 bmap
= isl_basic_map_reset(bmap
, dst_type
);
4042 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
4043 return isl_basic_map_free(bmap
);
4045 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4048 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
4050 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
4051 pos(bmap
->dim
, src_type
) + src_pos
+
4052 ((src_type
< dst_type
) ? n
: 0)) {
4053 bmap
= isl_basic_map_cow(bmap
);
4057 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4058 src_type
, src_pos
, n
);
4062 bmap
= isl_basic_map_finalize(bmap
);
4067 total
= isl_basic_map_total_dim(bmap
);
4068 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4071 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4072 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4073 if (t
== dst_type
) {
4074 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4077 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
4080 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4081 dst_pos
, size
- dst_pos
, off
);
4082 off
+= size
- dst_pos
;
4083 } else if (t
== src_type
) {
4084 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4087 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4088 src_pos
+ n
, size
- src_pos
- n
, off
);
4089 off
+= size
- src_pos
- n
;
4091 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4095 isl_dim_map_div(dim_map
, bmap
, off
);
4097 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4098 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4099 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4103 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4104 src_type
, src_pos
, n
);
4108 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
4109 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4110 bmap
= isl_basic_map_finalize(bmap
);
4114 isl_basic_map_free(bmap
);
4118 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4119 enum isl_dim_type dst_type
, unsigned dst_pos
,
4120 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4122 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4123 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4124 src_type
, src_pos
, n
);
4125 return bset_from_bmap(bmap
);
4128 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4129 enum isl_dim_type dst_type
, unsigned dst_pos
,
4130 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4134 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4135 return set_from_map(isl_map_move_dims(set_to_map(set
),
4136 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4142 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4143 enum isl_dim_type dst_type
, unsigned dst_pos
,
4144 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4149 map
= isl_map_reset(map
, src_type
);
4150 map
= isl_map_reset(map
, dst_type
);
4154 if (isl_map_check_range(map
, src_type
, src_pos
, n
))
4155 return isl_map_free(map
);
4157 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4160 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4162 map
= isl_map_cow(map
);
4166 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4170 for (i
= 0; i
< map
->n
; ++i
) {
4171 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4173 src_type
, src_pos
, n
);
4184 /* Move the specified dimensions to the last columns right before
4185 * the divs. Don't change the dimension specification of bmap.
4186 * That's the responsibility of the caller.
4188 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4189 enum isl_dim_type type
, unsigned first
, unsigned n
)
4191 struct isl_dim_map
*dim_map
;
4192 struct isl_basic_map
*res
;
4193 enum isl_dim_type t
;
4194 unsigned total
, off
;
4198 if (pos(bmap
->dim
, type
) + first
+ n
==
4199 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
4202 total
= isl_basic_map_total_dim(bmap
);
4203 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4206 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4207 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4209 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4212 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4213 first
, n
, total
- bmap
->n_div
- n
);
4214 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4215 first
+ n
, size
- (first
+ n
), off
);
4216 off
+= size
- (first
+ n
);
4218 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4222 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4224 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4225 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4226 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4230 /* Insert "n" rows in the divs of "bmap".
4232 * The number of columns is not changed, which means that the last
4233 * dimensions of "bmap" are being reintepreted as the new divs.
4234 * The space of "bmap" is not adjusted, however, which means
4235 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4236 * from the space of "bmap" is the responsibility of the caller.
4238 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4246 bmap
= isl_basic_map_cow(bmap
);
4250 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
4251 old
= bmap
->block2
.data
;
4252 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4253 (bmap
->extra
+ n
) * (1 + row_size
));
4254 if (!bmap
->block2
.data
)
4255 return isl_basic_map_free(bmap
);
4256 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4258 return isl_basic_map_free(bmap
);
4259 for (i
= 0; i
< n
; ++i
) {
4260 new_div
[i
] = bmap
->block2
.data
+
4261 (bmap
->extra
+ i
) * (1 + row_size
);
4262 isl_seq_clr(new_div
[i
], 1 + row_size
);
4264 for (i
= 0; i
< bmap
->extra
; ++i
)
4265 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4267 bmap
->div
= new_div
;
4274 /* Drop constraints from "bmap" that only involve the variables
4275 * of "type" in the range [first, first + n] that are not related
4276 * to any of the variables outside that interval.
4277 * These constraints cannot influence the values for the variables
4278 * outside the interval, except in case they cause "bmap" to be empty.
4279 * Only drop the constraints if "bmap" is known to be non-empty.
4281 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4282 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4283 unsigned first
, unsigned n
)
4287 unsigned dim
, n_div
;
4290 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4292 return isl_basic_map_free(bmap
);
4296 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4297 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4298 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4300 return isl_basic_map_free(bmap
);
4301 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4302 for (i
= 0; i
< first
; ++i
)
4304 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4307 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4312 /* Turn the n dimensions of type type, starting at first
4313 * into existentially quantified variables.
4315 * If a subset of the projected out variables are unrelated
4316 * to any of the variables that remain, then the constraints
4317 * involving this subset are simply dropped first.
4319 __isl_give isl_basic_map
*isl_basic_map_project_out(
4320 __isl_take isl_basic_map
*bmap
,
4321 enum isl_dim_type type
, unsigned first
, unsigned n
)
4326 return basic_map_space_reset(bmap
, type
);
4327 if (type
== isl_dim_div
)
4328 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4329 "cannot project out existentially quantified variables",
4330 return isl_basic_map_free(bmap
));
4332 empty
= isl_basic_map_plain_is_empty(bmap
);
4334 return isl_basic_map_free(bmap
);
4336 bmap
= isl_basic_map_set_to_empty(bmap
);
4338 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4342 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4343 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4345 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4346 return isl_basic_map_free(bmap
);
4348 bmap
= move_last(bmap
, type
, first
, n
);
4349 bmap
= isl_basic_map_cow(bmap
);
4350 bmap
= insert_div_rows(bmap
, n
);
4354 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4357 bmap
= isl_basic_map_simplify(bmap
);
4358 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4359 return isl_basic_map_finalize(bmap
);
4361 isl_basic_map_free(bmap
);
4365 /* Turn the n dimensions of type type, starting at first
4366 * into existentially quantified variables.
4368 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4369 enum isl_dim_type type
, unsigned first
, unsigned n
)
4371 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4375 /* Turn the n dimensions of type type, starting at first
4376 * into existentially quantified variables.
4378 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4379 enum isl_dim_type type
, unsigned first
, unsigned n
)
4384 return map_space_reset(map
, type
);
4386 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4387 return isl_map_free(map
);
4389 map
= isl_map_cow(map
);
4393 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4397 for (i
= 0; i
< map
->n
; ++i
) {
4398 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4409 /* Turn all the dimensions of type "type", except the "n" starting at "first"
4410 * into existentially quantified variables.
4412 __isl_give isl_map
*isl_map_project_onto(__isl_take isl_map
*map
,
4413 enum isl_dim_type type
, unsigned first
, unsigned n
)
4417 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4418 return isl_map_free(map
);
4419 dim
= isl_map_dim(map
, type
);
4420 map
= isl_map_project_out(map
, type
, first
+ n
, dim
- (first
+ n
));
4421 map
= isl_map_project_out(map
, type
, 0, first
);
4425 /* Turn the n dimensions of type type, starting at first
4426 * into existentially quantified variables.
4428 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4429 enum isl_dim_type type
, unsigned first
, unsigned n
)
4431 return set_from_map(isl_map_project_out(set_to_map(set
),
4435 /* Return a map that projects the elements in "set" onto their
4436 * "n" set dimensions starting at "first".
4437 * "type" should be equal to isl_dim_set.
4439 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4440 enum isl_dim_type type
, unsigned first
, unsigned n
)
4448 if (type
!= isl_dim_set
)
4449 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4450 "only set dimensions can be projected out", goto error
);
4451 dim
= isl_set_dim(set
, isl_dim_set
);
4452 if (first
+ n
> dim
|| first
+ n
< first
)
4453 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4454 "index out of bounds", goto error
);
4456 map
= isl_map_from_domain(set
);
4457 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4458 for (i
= 0; i
< n
; ++i
)
4459 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4467 static __isl_give isl_basic_map
*add_divs(__isl_take isl_basic_map
*bmap
,
4472 for (i
= 0; i
< n
; ++i
) {
4473 j
= isl_basic_map_alloc_div(bmap
);
4476 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4480 isl_basic_map_free(bmap
);
4484 struct isl_basic_map
*isl_basic_map_apply_range(
4485 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4487 isl_space
*space_result
= NULL
;
4488 struct isl_basic_map
*bmap
;
4489 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4490 struct isl_dim_map
*dim_map1
, *dim_map2
;
4492 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4494 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4495 bmap2
->dim
, isl_dim_in
))
4496 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4497 "spaces don't match", goto error
);
4499 space_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4500 isl_space_copy(bmap2
->dim
));
4502 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4503 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4504 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4505 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4507 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4508 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4509 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4510 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4511 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4512 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4513 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4514 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4515 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4516 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4517 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4519 bmap
= isl_basic_map_alloc_space(space_result
,
4520 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4521 bmap1
->n_eq
+ bmap2
->n_eq
,
4522 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4523 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4524 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4525 bmap
= add_divs(bmap
, n
);
4526 bmap
= isl_basic_map_simplify(bmap
);
4527 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4528 return isl_basic_map_finalize(bmap
);
4530 isl_basic_map_free(bmap1
);
4531 isl_basic_map_free(bmap2
);
4535 struct isl_basic_set
*isl_basic_set_apply(
4536 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4541 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4544 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4547 isl_basic_set_free(bset
);
4548 isl_basic_map_free(bmap
);
4552 struct isl_basic_map
*isl_basic_map_apply_domain(
4553 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4555 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4557 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4558 bmap2
->dim
, isl_dim_in
))
4559 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4560 "spaces don't match", goto error
);
4562 bmap1
= isl_basic_map_reverse(bmap1
);
4563 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4564 return isl_basic_map_reverse(bmap1
);
4566 isl_basic_map_free(bmap1
);
4567 isl_basic_map_free(bmap2
);
4571 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4572 * A \cap B -> f(A) + f(B)
4574 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4575 __isl_take isl_basic_map
*bmap2
)
4577 unsigned n_in
, n_out
, nparam
, total
, pos
;
4578 struct isl_basic_map
*bmap
= NULL
;
4579 struct isl_dim_map
*dim_map1
, *dim_map2
;
4582 if (!bmap1
|| !bmap2
)
4585 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4588 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4589 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4590 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4592 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4593 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4594 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4595 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4596 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4597 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4598 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4599 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4600 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4601 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4602 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4604 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4605 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4606 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4607 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4608 for (i
= 0; i
< n_out
; ++i
) {
4609 int j
= isl_basic_map_alloc_equality(bmap
);
4612 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4613 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4614 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4615 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4617 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4618 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4619 bmap
= add_divs(bmap
, 2 * n_out
);
4621 bmap
= isl_basic_map_simplify(bmap
);
4622 return isl_basic_map_finalize(bmap
);
4624 isl_basic_map_free(bmap
);
4625 isl_basic_map_free(bmap1
);
4626 isl_basic_map_free(bmap2
);
4630 /* Given two maps A -> f(A) and B -> g(B), construct a map
4631 * A \cap B -> f(A) + f(B)
4633 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4634 __isl_take isl_map
*map2
)
4636 struct isl_map
*result
;
4642 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4644 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4645 map1
->n
* map2
->n
, 0);
4648 for (i
= 0; i
< map1
->n
; ++i
)
4649 for (j
= 0; j
< map2
->n
; ++j
) {
4650 struct isl_basic_map
*part
;
4651 part
= isl_basic_map_sum(
4652 isl_basic_map_copy(map1
->p
[i
]),
4653 isl_basic_map_copy(map2
->p
[j
]));
4654 if (isl_basic_map_is_empty(part
))
4655 isl_basic_map_free(part
);
4657 result
= isl_map_add_basic_map(result
, part
);
4670 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4671 __isl_take isl_set
*set2
)
4673 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4676 /* Given a basic map A -> f(A), construct A -> -f(A).
4678 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4683 bmap
= isl_basic_map_cow(bmap
);
4687 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4688 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4689 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4690 for (j
= 0; j
< n
; ++j
)
4691 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4692 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4693 for (j
= 0; j
< n
; ++j
)
4694 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4695 for (i
= 0; i
< bmap
->n_div
; ++i
)
4696 for (j
= 0; j
< n
; ++j
)
4697 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4698 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4699 return isl_basic_map_finalize(bmap
);
4702 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4704 return isl_basic_map_neg(bset
);
4707 /* Given a map A -> f(A), construct A -> -f(A).
4709 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4713 map
= isl_map_cow(map
);
4717 for (i
= 0; i
< map
->n
; ++i
) {
4718 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4729 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4731 return set_from_map(isl_map_neg(set_to_map(set
)));
4734 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4735 * A -> floor(f(A)/d).
4737 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4740 unsigned n_in
, n_out
, nparam
, total
, pos
;
4741 struct isl_basic_map
*result
= NULL
;
4742 struct isl_dim_map
*dim_map
;
4748 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4749 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4750 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4752 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4753 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4754 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4755 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4756 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4757 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4759 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4760 bmap
->n_div
+ n_out
,
4761 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4762 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4763 result
= add_divs(result
, n_out
);
4764 for (i
= 0; i
< n_out
; ++i
) {
4766 j
= isl_basic_map_alloc_inequality(result
);
4769 isl_seq_clr(result
->ineq
[j
], 1+total
);
4770 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4771 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4772 j
= isl_basic_map_alloc_inequality(result
);
4775 isl_seq_clr(result
->ineq
[j
], 1+total
);
4776 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4777 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4778 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4781 result
= isl_basic_map_simplify(result
);
4782 return isl_basic_map_finalize(result
);
4784 isl_basic_map_free(result
);
4788 /* Given a map A -> f(A) and an integer d, construct a map
4789 * A -> floor(f(A)/d).
4791 __isl_give isl_map
*isl_map_floordiv(__isl_take isl_map
*map
, isl_int d
)
4795 map
= isl_map_cow(map
);
4799 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4800 for (i
= 0; i
< map
->n
; ++i
) {
4801 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4805 map
= isl_map_unmark_normalized(map
);
4813 /* Given a map A -> f(A) and an integer d, construct a map
4814 * A -> floor(f(A)/d).
4816 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4817 __isl_take isl_val
*d
)
4821 if (!isl_val_is_int(d
))
4822 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4823 "expecting integer denominator", goto error
);
4824 map
= isl_map_floordiv(map
, d
->n
);
4833 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4840 i
= isl_basic_map_alloc_equality(bmap
);
4843 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4844 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4845 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4846 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4847 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4848 return isl_basic_map_finalize(bmap
);
4850 isl_basic_map_free(bmap
);
4854 /* Add a constraint to "bmap" expressing i_pos < o_pos
4856 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4863 i
= isl_basic_map_alloc_inequality(bmap
);
4866 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4867 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4868 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4869 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4870 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4871 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4872 return isl_basic_map_finalize(bmap
);
4874 isl_basic_map_free(bmap
);
4878 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4880 static __isl_give isl_basic_map
*var_less_or_equal(
4881 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4887 i
= isl_basic_map_alloc_inequality(bmap
);
4890 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4891 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4892 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4893 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4894 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4895 return isl_basic_map_finalize(bmap
);
4897 isl_basic_map_free(bmap
);
4901 /* Add a constraint to "bmap" expressing i_pos > o_pos
4903 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4910 i
= isl_basic_map_alloc_inequality(bmap
);
4913 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4914 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4915 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4916 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4917 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4918 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4919 return isl_basic_map_finalize(bmap
);
4921 isl_basic_map_free(bmap
);
4925 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4927 static __isl_give isl_basic_map
*var_more_or_equal(
4928 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4934 i
= isl_basic_map_alloc_inequality(bmap
);
4937 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4938 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4939 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4940 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4941 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4942 return isl_basic_map_finalize(bmap
);
4944 isl_basic_map_free(bmap
);
4948 __isl_give isl_basic_map
*isl_basic_map_equal(
4949 __isl_take isl_space
*space
, unsigned n_equal
)
4952 struct isl_basic_map
*bmap
;
4953 bmap
= isl_basic_map_alloc_space(space
, 0, n_equal
, 0);
4956 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4957 bmap
= var_equal(bmap
, i
);
4958 return isl_basic_map_finalize(bmap
);
4961 /* Return a relation on of dimension "space" expressing i_[0..pos] << o_[0..pos]
4963 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*space
,
4967 struct isl_basic_map
*bmap
;
4968 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
4971 for (i
= 0; i
< pos
&& bmap
; ++i
)
4972 bmap
= var_equal(bmap
, i
);
4974 bmap
= var_less(bmap
, pos
);
4975 return isl_basic_map_finalize(bmap
);
4978 /* Return a relation on "space" expressing i_[0..pos] <<= o_[0..pos]
4980 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4981 __isl_take isl_space
*space
, unsigned pos
)
4984 isl_basic_map
*bmap
;
4986 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
4987 for (i
= 0; i
< pos
; ++i
)
4988 bmap
= var_equal(bmap
, i
);
4989 bmap
= var_less_or_equal(bmap
, pos
);
4990 return isl_basic_map_finalize(bmap
);
4993 /* Return a relation on "space" expressing i_pos > o_pos
4995 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*space
,
4999 struct isl_basic_map
*bmap
;
5000 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
5003 for (i
= 0; i
< pos
&& bmap
; ++i
)
5004 bmap
= var_equal(bmap
, i
);
5006 bmap
= var_more(bmap
, pos
);
5007 return isl_basic_map_finalize(bmap
);
5010 /* Return a relation on "space" expressing i_[0..pos] >>= o_[0..pos]
5012 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
5013 __isl_take isl_space
*space
, unsigned pos
)
5016 isl_basic_map
*bmap
;
5018 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
5019 for (i
= 0; i
< pos
; ++i
)
5020 bmap
= var_equal(bmap
, i
);
5021 bmap
= var_more_or_equal(bmap
, pos
);
5022 return isl_basic_map_finalize(bmap
);
5025 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*space
,
5026 unsigned n
, int equal
)
5028 struct isl_map
*map
;
5031 if (n
== 0 && equal
)
5032 return isl_map_universe(space
);
5034 map
= isl_map_alloc_space(isl_space_copy(space
), n
, ISL_MAP_DISJOINT
);
5036 for (i
= 0; i
+ 1 < n
; ++i
)
5037 map
= isl_map_add_basic_map(map
,
5038 isl_basic_map_less_at(isl_space_copy(space
), i
));
5041 map
= isl_map_add_basic_map(map
,
5042 isl_basic_map_less_or_equal_at(space
, n
- 1));
5044 map
= isl_map_add_basic_map(map
,
5045 isl_basic_map_less_at(space
, n
- 1));
5047 isl_space_free(space
);
5052 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*space
, int equal
)
5056 return map_lex_lte_first(space
, space
->n_out
, equal
);
5059 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
5061 return map_lex_lte_first(dim
, n
, 0);
5064 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
5066 return map_lex_lte_first(dim
, n
, 1);
5069 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
5071 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
5074 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
5076 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
5079 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*space
,
5080 unsigned n
, int equal
)
5082 struct isl_map
*map
;
5085 if (n
== 0 && equal
)
5086 return isl_map_universe(space
);
5088 map
= isl_map_alloc_space(isl_space_copy(space
), n
, ISL_MAP_DISJOINT
);
5090 for (i
= 0; i
+ 1 < n
; ++i
)
5091 map
= isl_map_add_basic_map(map
,
5092 isl_basic_map_more_at(isl_space_copy(space
), i
));
5095 map
= isl_map_add_basic_map(map
,
5096 isl_basic_map_more_or_equal_at(space
, n
- 1));
5098 map
= isl_map_add_basic_map(map
,
5099 isl_basic_map_more_at(space
, n
- 1));
5101 isl_space_free(space
);
5106 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*space
, int equal
)
5110 return map_lex_gte_first(space
, space
->n_out
, equal
);
5113 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5115 return map_lex_gte_first(dim
, n
, 0);
5118 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5120 return map_lex_gte_first(dim
, n
, 1);
5123 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5125 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5128 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5130 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5133 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5134 __isl_take isl_set
*set2
)
5137 map
= isl_map_lex_le(isl_set_get_space(set1
));
5138 map
= isl_map_intersect_domain(map
, set1
);
5139 map
= isl_map_intersect_range(map
, set2
);
5143 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5144 __isl_take isl_set
*set2
)
5147 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5148 map
= isl_map_intersect_domain(map
, set1
);
5149 map
= isl_map_intersect_range(map
, set2
);
5153 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5154 __isl_take isl_set
*set2
)
5157 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5158 map
= isl_map_intersect_domain(map
, set1
);
5159 map
= isl_map_intersect_range(map
, set2
);
5163 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5164 __isl_take isl_set
*set2
)
5167 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5168 map
= isl_map_intersect_domain(map
, set1
);
5169 map
= isl_map_intersect_range(map
, set2
);
5173 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5174 __isl_take isl_map
*map2
)
5177 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5178 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5179 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5183 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5184 __isl_take isl_map
*map2
)
5187 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5188 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5189 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5193 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5194 __isl_take isl_map
*map2
)
5197 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5198 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5199 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5203 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5204 __isl_take isl_map
*map2
)
5207 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5208 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5209 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5213 /* For a div d = floor(f/m), add the constraint
5217 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
5218 unsigned pos
, isl_int
*div
)
5221 unsigned total
= isl_basic_map_total_dim(bmap
);
5223 i
= isl_basic_map_alloc_inequality(bmap
);
5225 return isl_stat_error
;
5226 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5227 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
5232 /* For a div d = floor(f/m), add the constraint
5234 * -(f-(m-1)) + m d >= 0
5236 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
5237 unsigned pos
, isl_int
*div
)
5240 unsigned total
= isl_basic_map_total_dim(bmap
);
5242 i
= isl_basic_map_alloc_inequality(bmap
);
5244 return isl_stat_error
;
5245 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5246 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
5247 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5248 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5253 /* For a div d = floor(f/m), add the constraints
5256 * -(f-(m-1)) + m d >= 0
5258 * Note that the second constraint is the negation of
5262 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
5263 unsigned pos
, isl_int
*div
)
5265 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
5267 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
5272 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
5273 unsigned pos
, isl_int
*div
)
5275 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
5279 int isl_basic_map_add_div_constraints(__isl_keep isl_basic_map
*bmap
,
5282 unsigned total
= isl_basic_map_total_dim(bmap
);
5283 unsigned div_pos
= total
- bmap
->n_div
+ div
;
5285 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
5289 /* For each known div d = floor(f/m), add the constraints
5292 * -(f-(m-1)) + m d >= 0
5294 * Remove duplicate constraints in case of some these div constraints
5295 * already appear in "bmap".
5297 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5298 __isl_take isl_basic_map
*bmap
)
5304 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5308 bmap
= add_known_div_constraints(bmap
);
5309 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5310 bmap
= isl_basic_map_finalize(bmap
);
5314 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5316 * In particular, if this div is of the form d = floor(f/m),
5317 * then add the constraint
5321 * if sign < 0 or the constraint
5323 * -(f-(m-1)) + m d >= 0
5327 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
5328 unsigned div
, int sign
)
5336 total
= isl_basic_map_total_dim(bmap
);
5337 div_pos
= total
- bmap
->n_div
+ div
;
5340 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5342 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5345 __isl_give isl_basic_set
*isl_basic_map_underlying_set(
5346 __isl_take isl_basic_map
*bmap
)
5350 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5352 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5353 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5354 return bset_from_bmap(bmap
);
5355 bmap
= isl_basic_map_cow(bmap
);
5358 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5361 bmap
->extra
-= bmap
->n_div
;
5363 bmap
= isl_basic_map_finalize(bmap
);
5364 return bset_from_bmap(bmap
);
5366 isl_basic_map_free(bmap
);
5370 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5371 __isl_take isl_basic_set
*bset
)
5373 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5376 /* Replace each element in "list" by the result of applying
5377 * isl_basic_map_underlying_set to the element.
5379 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5380 __isl_take isl_basic_map_list
*list
)
5387 n
= isl_basic_map_list_n_basic_map(list
);
5388 for (i
= 0; i
< n
; ++i
) {
5389 isl_basic_map
*bmap
;
5390 isl_basic_set
*bset
;
5392 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5393 bset
= isl_basic_set_underlying_set(bmap
);
5394 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5400 __isl_give isl_basic_map
*isl_basic_map_overlying_set(
5401 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_map
*like
)
5403 struct isl_basic_map
*bmap
;
5404 struct isl_ctx
*ctx
;
5411 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5412 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5413 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5415 if (like
->n_div
== 0) {
5416 isl_space
*space
= isl_basic_map_get_space(like
);
5417 isl_basic_map_free(like
);
5418 return isl_basic_map_reset_space(bset
, space
);
5420 bset
= isl_basic_set_cow(bset
);
5423 total
= bset
->dim
->n_out
+ bset
->extra
;
5424 bmap
= bset_to_bmap(bset
);
5425 isl_space_free(bmap
->dim
);
5426 bmap
->dim
= isl_space_copy(like
->dim
);
5429 bmap
->n_div
= like
->n_div
;
5430 bmap
->extra
+= like
->n_div
;
5434 ltotal
= total
- bmap
->extra
+ like
->extra
;
5437 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5438 bmap
->extra
* (1 + 1 + total
));
5439 if (isl_blk_is_error(bmap
->block2
))
5441 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5445 for (i
= 0; i
< bmap
->extra
; ++i
)
5446 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5447 for (i
= 0; i
< like
->n_div
; ++i
) {
5448 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5449 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5451 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5453 isl_basic_map_free(like
);
5454 bmap
= isl_basic_map_simplify(bmap
);
5455 bmap
= isl_basic_map_finalize(bmap
);
5458 isl_basic_map_free(like
);
5459 isl_basic_set_free(bset
);
5463 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5464 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5466 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5467 bset_to_bmap(like
)));
5470 __isl_give isl_set
*isl_map_underlying_set(__isl_take isl_map
*map
)
5474 map
= isl_map_cow(map
);
5477 map
->dim
= isl_space_cow(map
->dim
);
5481 for (i
= 1; i
< map
->n
; ++i
)
5482 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5484 for (i
= 0; i
< map
->n
; ++i
) {
5485 map
->p
[i
] = bset_to_bmap(
5486 isl_basic_map_underlying_set(map
->p
[i
]));
5491 map
->dim
= isl_space_underlying(map
->dim
, 0);
5493 isl_space_free(map
->dim
);
5494 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5498 return set_from_map(map
);
5504 /* Replace the space of "bmap" by "space".
5506 * If the space of "bmap" is identical to "space" (including the identifiers
5507 * of the input and output dimensions), then simply return the original input.
5509 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5510 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5513 isl_space
*bmap_space
;
5515 bmap_space
= isl_basic_map_peek_space(bmap
);
5516 equal
= isl_space_is_equal(bmap_space
, space
);
5517 if (equal
>= 0 && equal
)
5518 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5522 isl_space_free(space
);
5525 bmap
= isl_basic_map_cow(bmap
);
5526 if (!bmap
|| !space
)
5529 isl_space_free(bmap
->dim
);
5532 bmap
= isl_basic_map_finalize(bmap
);
5536 isl_basic_map_free(bmap
);
5537 isl_space_free(space
);
5541 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5542 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5544 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5548 /* Check that the total dimensions of "map" and "space" are the same.
5550 static isl_stat
check_map_space_equal_total_dim(__isl_keep isl_map
*map
,
5551 __isl_keep isl_space
*space
)
5553 unsigned dim1
, dim2
;
5556 return isl_stat_error
;
5557 dim1
= isl_map_dim(map
, isl_dim_all
);
5558 dim2
= isl_space_dim(space
, isl_dim_all
);
5561 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5562 "total dimensions do not match", return isl_stat_error
);
5565 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5566 __isl_take isl_space
*space
)
5570 map
= isl_map_cow(map
);
5574 for (i
= 0; i
< map
->n
; ++i
) {
5575 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5576 isl_space_copy(space
));
5580 isl_space_free(map
->dim
);
5586 isl_space_free(space
);
5590 /* Replace the space of "map" by "space", without modifying
5591 * the dimension of "map".
5593 * If the space of "map" is identical to "space" (including the identifiers
5594 * of the input and output dimensions), then simply return the original input.
5596 __isl_give isl_map
*isl_map_reset_equal_dim_space(__isl_take isl_map
*map
,
5597 __isl_take isl_space
*space
)
5600 isl_space
*map_space
;
5602 map_space
= isl_map_peek_space(map
);
5603 equal
= isl_space_is_equal(map_space
, space
);
5604 if (equal
>= 0 && equal
)
5605 equal
= isl_space_has_equal_ids(map_space
, space
);
5609 isl_space_free(space
);
5612 if (check_map_space_equal_total_dim(map
, space
) < 0)
5614 return isl_map_reset_space(map
, space
);
5617 isl_space_free(space
);
5621 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5622 __isl_take isl_space
*dim
)
5624 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5627 /* Compute the parameter domain of the given basic set.
5629 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5635 is_params
= isl_basic_set_is_params(bset
);
5637 return isl_basic_set_free(bset
);
5641 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5642 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5643 space
= isl_basic_set_get_space(bset
);
5644 space
= isl_space_params(space
);
5645 bset
= isl_basic_set_reset_space(bset
, space
);
5649 /* Construct a zero-dimensional basic set with the given parameter domain.
5651 __isl_give isl_basic_set
*isl_basic_set_from_params(
5652 __isl_take isl_basic_set
*bset
)
5655 space
= isl_basic_set_get_space(bset
);
5656 space
= isl_space_set_from_params(space
);
5657 bset
= isl_basic_set_reset_space(bset
, space
);
5661 /* Compute the parameter domain of the given set.
5663 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5668 if (isl_set_is_params(set
))
5671 n
= isl_set_dim(set
, isl_dim_set
);
5672 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5673 space
= isl_set_get_space(set
);
5674 space
= isl_space_params(space
);
5675 set
= isl_set_reset_space(set
, space
);
5679 /* Construct a zero-dimensional set with the given parameter domain.
5681 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5684 space
= isl_set_get_space(set
);
5685 space
= isl_space_set_from_params(space
);
5686 set
= isl_set_reset_space(set
, space
);
5690 /* Compute the parameter domain of the given map.
5692 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5697 n
= isl_map_dim(map
, isl_dim_in
);
5698 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5699 n
= isl_map_dim(map
, isl_dim_out
);
5700 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5701 space
= isl_map_get_space(map
);
5702 space
= isl_space_params(space
);
5703 map
= isl_map_reset_space(map
, space
);
5707 __isl_give isl_basic_set
*isl_basic_map_domain(__isl_take isl_basic_map
*bmap
)
5714 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5716 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5717 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5719 return isl_basic_map_reset_space(bmap
, space
);
5722 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5725 return isl_bool_error
;
5726 return isl_space_may_be_set(bmap
->dim
);
5729 /* Is this basic map actually a set?
5730 * Users should never call this function. Outside of isl,
5731 * the type should indicate whether something is a set or a map.
5733 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5736 return isl_bool_error
;
5737 return isl_space_is_set(bmap
->dim
);
5740 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5744 is_set
= isl_basic_map_is_set(bmap
);
5749 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5751 isl_basic_map_free(bmap
);
5755 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5756 __isl_take isl_basic_map
*bmap
)
5760 isl_basic_map
*domain
;
5761 int nparam
, n_in
, n_out
;
5763 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5764 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5765 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5767 space
= isl_basic_map_get_space(bmap
);
5768 space
= isl_space_from_range(isl_space_domain(space
));
5769 domain
= isl_basic_map_universe(space
);
5771 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5772 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5773 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5775 for (i
= 0; i
< n_in
; ++i
)
5776 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5779 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5780 return isl_basic_map_finalize(bmap
);
5783 __isl_give isl_basic_map
*isl_basic_map_range_map(
5784 __isl_take isl_basic_map
*bmap
)
5788 isl_basic_map
*range
;
5789 int nparam
, n_in
, n_out
;
5791 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5792 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5793 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5795 space
= isl_basic_map_get_space(bmap
);
5796 space
= isl_space_from_range(isl_space_range(space
));
5797 range
= isl_basic_map_universe(space
);
5799 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5800 bmap
= isl_basic_map_apply_range(bmap
, range
);
5801 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5803 for (i
= 0; i
< n_out
; ++i
)
5804 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5807 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5808 return isl_basic_map_finalize(bmap
);
5811 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5815 return isl_space_may_be_set(map
->dim
);
5818 /* Is this map actually a set?
5819 * Users should never call this function. Outside of isl,
5820 * the type should indicate whether something is a set or a map.
5822 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5825 return isl_bool_error
;
5826 return isl_space_is_set(map
->dim
);
5829 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
5833 struct isl_set
*set
;
5835 is_set
= isl_map_is_set(map
);
5839 return set_from_map(map
);
5841 map
= isl_map_cow(map
);
5845 set
= set_from_map(map
);
5846 set
->dim
= isl_space_range(set
->dim
);
5849 for (i
= 0; i
< map
->n
; ++i
) {
5850 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5854 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5855 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5862 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5866 map
= isl_map_cow(map
);
5870 map
->dim
= isl_space_domain_map(map
->dim
);
5873 for (i
= 0; i
< map
->n
; ++i
) {
5874 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5878 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5879 map
= isl_map_unmark_normalized(map
);
5886 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5889 isl_space
*range_dim
;
5891 map
= isl_map_cow(map
);
5895 range_dim
= isl_space_range(isl_map_get_space(map
));
5896 range_dim
= isl_space_from_range(range_dim
);
5897 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5898 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5901 for (i
= 0; i
< map
->n
; ++i
) {
5902 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5906 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5907 map
= isl_map_unmark_normalized(map
);
5914 /* Given a wrapped map of the form A[B -> C],
5915 * return the map A[B -> C] -> B.
5917 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5924 if (!isl_set_has_tuple_id(set
))
5925 return isl_map_domain_map(isl_set_unwrap(set
));
5927 id
= isl_set_get_tuple_id(set
);
5928 map
= isl_map_domain_map(isl_set_unwrap(set
));
5929 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5934 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5935 __isl_take isl_basic_set
*bset
)
5937 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5940 __isl_give isl_basic_map
*isl_basic_map_from_range(
5941 __isl_take isl_basic_set
*bset
)
5944 space
= isl_basic_set_get_space(bset
);
5945 space
= isl_space_from_range(space
);
5946 bset
= isl_basic_set_reset_space(bset
, space
);
5947 return bset_to_bmap(bset
);
5950 /* Create a relation with the given set as range.
5951 * The domain of the created relation is a zero-dimensional
5952 * flat anonymous space.
5954 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5957 space
= isl_set_get_space(set
);
5958 space
= isl_space_from_range(space
);
5959 set
= isl_set_reset_space(set
, space
);
5960 return set_to_map(set
);
5963 /* Create a relation with the given set as domain.
5964 * The range of the created relation is a zero-dimensional
5965 * flat anonymous space.
5967 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5969 return isl_map_reverse(isl_map_from_range(set
));
5972 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5973 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5975 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5978 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5979 __isl_take isl_set
*range
)
5981 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5984 /* Return a newly allocated isl_map with given space and flags and
5985 * room for "n" basic maps.
5986 * Make sure that all cached information is cleared.
5988 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5991 struct isl_map
*map
;
5996 isl_die(space
->ctx
, isl_error_internal
,
5997 "negative number of basic maps", goto error
);
5998 map
= isl_calloc(space
->ctx
, struct isl_map
,
5999 sizeof(struct isl_map
) +
6000 (n
- 1) * sizeof(struct isl_basic_map
*));
6004 map
->ctx
= space
->ctx
;
6005 isl_ctx_ref(map
->ctx
);
6013 isl_space_free(space
);
6017 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*space
)
6019 struct isl_basic_map
*bmap
;
6020 bmap
= isl_basic_map_alloc_space(space
, 0, 1, 0);
6021 bmap
= isl_basic_map_set_to_empty(bmap
);
6025 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*space
)
6027 struct isl_basic_set
*bset
;
6028 bset
= isl_basic_set_alloc_space(space
, 0, 1, 0);
6029 bset
= isl_basic_set_set_to_empty(bset
);
6033 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*space
)
6035 struct isl_basic_map
*bmap
;
6036 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 0);
6037 bmap
= isl_basic_map_finalize(bmap
);
6041 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*space
)
6043 struct isl_basic_set
*bset
;
6044 bset
= isl_basic_set_alloc_space(space
, 0, 0, 0);
6045 bset
= isl_basic_set_finalize(bset
);
6049 __isl_give isl_basic_map
*isl_basic_map_nat_universe(
6050 __isl_take isl_space
*space
)
6053 unsigned total
= isl_space_dim(space
, isl_dim_all
);
6054 isl_basic_map
*bmap
;
6056 bmap
= isl_basic_map_alloc_space(space
, 0, 0, total
);
6057 for (i
= 0; i
< total
; ++i
) {
6058 int k
= isl_basic_map_alloc_inequality(bmap
);
6061 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
6062 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
6066 isl_basic_map_free(bmap
);
6070 __isl_give isl_basic_set
*isl_basic_set_nat_universe(
6071 __isl_take isl_space
*space
)
6073 return isl_basic_map_nat_universe(space
);
6076 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
6078 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
6081 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
6083 return isl_map_nat_universe(dim
);
6086 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*space
)
6088 return isl_map_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6091 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*space
)
6093 return isl_set_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6096 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*space
)
6098 struct isl_map
*map
;
6101 map
= isl_map_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6102 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(space
));
6106 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*space
)
6108 struct isl_set
*set
;
6111 set
= isl_set_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6112 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(space
));
6116 struct isl_map
*isl_map_dup(struct isl_map
*map
)
6119 struct isl_map
*dup
;
6123 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6124 for (i
= 0; i
< map
->n
; ++i
)
6125 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6129 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6130 __isl_take isl_basic_map
*bmap
)
6134 if (isl_basic_map_plain_is_empty(bmap
)) {
6135 isl_basic_map_free(bmap
);
6138 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6139 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6140 map
->p
[map
->n
] = bmap
;
6142 map
= isl_map_unmark_normalized(map
);
6148 isl_basic_map_free(bmap
);
6152 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6163 isl_ctx_deref(map
->ctx
);
6164 for (i
= 0; i
< map
->n
; ++i
)
6165 isl_basic_map_free(map
->p
[i
]);
6166 isl_space_free(map
->dim
);
6172 static __isl_give isl_basic_map
*isl_basic_map_fix_pos_si(
6173 __isl_take isl_basic_map
*bmap
, unsigned pos
, int value
)
6177 bmap
= isl_basic_map_cow(bmap
);
6178 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6179 j
= isl_basic_map_alloc_equality(bmap
);
6182 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6183 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6184 isl_int_set_si(bmap
->eq
[j
][0], value
);
6185 bmap
= isl_basic_map_simplify(bmap
);
6186 return isl_basic_map_finalize(bmap
);
6188 isl_basic_map_free(bmap
);
6192 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6193 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6197 bmap
= isl_basic_map_cow(bmap
);
6198 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6199 j
= isl_basic_map_alloc_equality(bmap
);
6202 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6203 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6204 isl_int_set(bmap
->eq
[j
][0], value
);
6205 bmap
= isl_basic_map_simplify(bmap
);
6206 return isl_basic_map_finalize(bmap
);
6208 isl_basic_map_free(bmap
);
6212 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6213 enum isl_dim_type type
, unsigned pos
, int value
)
6215 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6216 return isl_basic_map_free(bmap
);
6217 return isl_basic_map_fix_pos_si(bmap
,
6218 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6221 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6222 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6224 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6225 return isl_basic_map_free(bmap
);
6226 return isl_basic_map_fix_pos(bmap
,
6227 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6230 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6231 * to be equal to "v".
6233 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6234 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6238 if (!isl_val_is_int(v
))
6239 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6240 "expecting integer value", goto error
);
6241 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6243 pos
+= isl_basic_map_offset(bmap
, type
);
6244 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6248 isl_basic_map_free(bmap
);
6253 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6254 * to be equal to "v".
6256 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6257 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6259 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6262 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6263 enum isl_dim_type type
, unsigned pos
, int value
)
6265 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6269 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6270 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6272 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6276 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6277 unsigned input
, int value
)
6279 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6282 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6283 unsigned dim
, int value
)
6285 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6286 isl_dim_set
, dim
, value
));
6289 /* Remove the basic map at position "i" from "map" if this basic map
6290 * is (obviously) empty.
6292 static __isl_give isl_map
*remove_if_empty(__isl_take isl_map
*map
, int i
)
6299 empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6301 return isl_map_free(map
);
6305 isl_basic_map_free(map
->p
[i
]);
6308 map
->p
[i
] = map
->p
[map
->n
];
6309 map
= isl_map_unmark_normalized(map
);
6316 /* Perform "fn" on each basic map of "map", where we may not be holding
6317 * the only reference to "map".
6318 * In particular, "fn" should be a semantics preserving operation
6319 * that we want to apply to all copies of "map". We therefore need
6320 * to be careful not to modify "map" in a way that breaks "map"
6321 * in case anything goes wrong.
6323 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6324 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6326 struct isl_basic_map
*bmap
;
6332 for (i
= map
->n
- 1; i
>= 0; --i
) {
6333 bmap
= isl_basic_map_copy(map
->p
[i
]);
6337 isl_basic_map_free(map
->p
[i
]);
6339 map
= remove_if_empty(map
, i
);
6350 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6351 enum isl_dim_type type
, unsigned pos
, int value
)
6355 map
= isl_map_cow(map
);
6359 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6360 for (i
= map
->n
- 1; i
>= 0; --i
) {
6361 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6362 map
= remove_if_empty(map
, i
);
6366 map
= isl_map_unmark_normalized(map
);
6373 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6374 enum isl_dim_type type
, unsigned pos
, int value
)
6376 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6379 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6380 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6384 map
= isl_map_cow(map
);
6388 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6389 for (i
= 0; i
< map
->n
; ++i
) {
6390 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6394 map
= isl_map_unmark_normalized(map
);
6401 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6402 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6404 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6407 /* Fix the value of the variable at position "pos" of type "type" of "map"
6408 * to be equal to "v".
6410 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6411 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6415 map
= isl_map_cow(map
);
6419 if (!isl_val_is_int(v
))
6420 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6421 "expecting integer value", goto error
);
6422 if (pos
>= isl_map_dim(map
, type
))
6423 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6424 "index out of bounds", goto error
);
6425 for (i
= map
->n
- 1; i
>= 0; --i
) {
6426 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6428 map
= remove_if_empty(map
, i
);
6432 map
= isl_map_unmark_normalized(map
);
6441 /* Fix the value of the variable at position "pos" of type "type" of "set"
6442 * to be equal to "v".
6444 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6445 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6447 return isl_map_fix_val(set
, type
, pos
, v
);
6450 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6451 unsigned input
, int value
)
6453 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6456 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6458 return set_from_map(isl_map_fix_si(set_to_map(set
),
6459 isl_dim_set
, dim
, value
));
6462 static __isl_give isl_basic_map
*basic_map_bound_si(
6463 __isl_take isl_basic_map
*bmap
,
6464 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6468 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6469 return isl_basic_map_free(bmap
);
6470 pos
+= isl_basic_map_offset(bmap
, type
);
6471 bmap
= isl_basic_map_cow(bmap
);
6472 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6473 j
= isl_basic_map_alloc_inequality(bmap
);
6476 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6478 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6479 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6481 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6482 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6484 bmap
= isl_basic_map_simplify(bmap
);
6485 return isl_basic_map_finalize(bmap
);
6487 isl_basic_map_free(bmap
);
6491 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6492 __isl_take isl_basic_map
*bmap
,
6493 enum isl_dim_type type
, unsigned pos
, int value
)
6495 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6498 /* Constrain the values of the given dimension to be no greater than "value".
6500 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6501 __isl_take isl_basic_map
*bmap
,
6502 enum isl_dim_type type
, unsigned pos
, int value
)
6504 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6507 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6508 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6512 map
= isl_map_cow(map
);
6516 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6517 for (i
= 0; i
< map
->n
; ++i
) {
6518 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6519 type
, pos
, value
, upper
);
6523 map
= isl_map_unmark_normalized(map
);
6530 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6531 enum isl_dim_type type
, unsigned pos
, int value
)
6533 return map_bound_si(map
, type
, pos
, value
, 0);
6536 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6537 enum isl_dim_type type
, unsigned pos
, int value
)
6539 return map_bound_si(map
, type
, pos
, value
, 1);
6542 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6543 enum isl_dim_type type
, unsigned pos
, int value
)
6545 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6549 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6550 enum isl_dim_type type
, unsigned pos
, int value
)
6552 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6555 /* Bound the given variable of "bmap" from below (or above is "upper"
6556 * is set) to "value".
6558 static __isl_give isl_basic_map
*basic_map_bound(
6559 __isl_take isl_basic_map
*bmap
,
6560 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6564 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6565 return isl_basic_map_free(bmap
);
6566 pos
+= isl_basic_map_offset(bmap
, type
);
6567 bmap
= isl_basic_map_cow(bmap
);
6568 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6569 j
= isl_basic_map_alloc_inequality(bmap
);
6572 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6574 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6575 isl_int_set(bmap
->ineq
[j
][0], value
);
6577 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6578 isl_int_neg(bmap
->ineq
[j
][0], value
);
6580 bmap
= isl_basic_map_simplify(bmap
);
6581 return isl_basic_map_finalize(bmap
);
6583 isl_basic_map_free(bmap
);
6587 /* Bound the given variable of "map" from below (or above is "upper"
6588 * is set) to "value".
6590 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6591 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6595 map
= isl_map_cow(map
);
6599 if (pos
>= isl_map_dim(map
, type
))
6600 isl_die(map
->ctx
, isl_error_invalid
,
6601 "index out of bounds", goto error
);
6602 for (i
= map
->n
- 1; i
>= 0; --i
) {
6603 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6604 map
= remove_if_empty(map
, i
);
6608 map
= isl_map_unmark_normalized(map
);
6615 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6616 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6618 return map_bound(map
, type
, pos
, value
, 0);
6621 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6622 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6624 return map_bound(map
, type
, pos
, value
, 1);
6627 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6628 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6630 return isl_map_lower_bound(set
, type
, pos
, value
);
6633 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6634 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6636 return isl_map_upper_bound(set
, type
, pos
, value
);
6639 /* Force the values of the variable at position "pos" of type "type" of "set"
6640 * to be no smaller than "value".
6642 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6643 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6647 if (!isl_val_is_int(value
))
6648 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6649 "expecting integer value", goto error
);
6650 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6651 isl_val_free(value
);
6654 isl_val_free(value
);
6659 /* Force the values of the variable at position "pos" of type "type" of "set"
6660 * to be no greater than "value".
6662 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6663 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6667 if (!isl_val_is_int(value
))
6668 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6669 "expecting integer value", goto error
);
6670 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6671 isl_val_free(value
);
6674 isl_val_free(value
);
6679 /* Bound the given variable of "bset" from below (or above is "upper"
6680 * is set) to "value".
6682 static __isl_give isl_basic_set
*isl_basic_set_bound(
6683 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6684 isl_int value
, int upper
)
6686 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
6687 type
, pos
, value
, upper
));
6690 /* Bound the given variable of "bset" from below (or above is "upper"
6691 * is set) to "value".
6693 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
6694 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6695 __isl_take isl_val
*value
, int upper
)
6699 if (!isl_val_is_int(value
))
6700 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
6701 "expecting integer value", goto error
);
6702 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
6703 isl_val_free(value
);
6706 isl_val_free(value
);
6707 isl_basic_set_free(bset
);
6711 /* Bound the given variable of "bset" from below to "value".
6713 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
6714 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6715 __isl_take isl_val
*value
)
6717 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
6720 /* Bound the given variable of "bset" from above to "value".
6722 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
6723 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6724 __isl_take isl_val
*value
)
6726 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
6729 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6733 map
= isl_map_cow(map
);
6737 map
->dim
= isl_space_reverse(map
->dim
);
6740 for (i
= 0; i
< map
->n
; ++i
) {
6741 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6745 map
= isl_map_unmark_normalized(map
);
6753 #define TYPE isl_pw_multi_aff
6755 #define SUFFIX _pw_multi_aff
6757 #define EMPTY isl_pw_multi_aff_empty
6759 #define ADD isl_pw_multi_aff_union_add
6760 #include "isl_map_lexopt_templ.c"
6762 /* Given a map "map", compute the lexicographically minimal
6763 * (or maximal) image element for each domain element in dom,
6764 * in the form of an isl_pw_multi_aff.
6765 * If "empty" is not NULL, then set *empty to those elements in dom that
6766 * do not have an image element.
6767 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6768 * should be computed over the domain of "map". "empty" is also NULL
6771 * We first compute the lexicographically minimal or maximal element
6772 * in the first basic map. This results in a partial solution "res"
6773 * and a subset "todo" of dom that still need to be handled.
6774 * We then consider each of the remaining maps in "map" and successively
6775 * update both "res" and "todo".
6776 * If "empty" is NULL, then the todo sets are not needed and therefore
6777 * also not computed.
6779 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6780 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6781 __isl_give isl_set
**empty
, unsigned flags
)
6785 isl_pw_multi_aff
*res
;
6788 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6789 if (!map
|| (!full
&& !dom
))
6792 if (isl_map_plain_is_empty(map
)) {
6797 return isl_pw_multi_aff_from_map(map
);
6800 res
= basic_map_partial_lexopt_pw_multi_aff(
6801 isl_basic_map_copy(map
->p
[0]),
6802 isl_set_copy(dom
), empty
, flags
);
6806 for (i
= 1; i
< map
->n
; ++i
) {
6807 isl_pw_multi_aff
*res_i
;
6809 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6810 isl_basic_map_copy(map
->p
[i
]),
6811 isl_set_copy(dom
), empty
, flags
);
6813 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6814 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6816 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6819 todo
= isl_set_intersect(todo
, *empty
);
6838 #define TYPE isl_map
6842 #define EMPTY isl_map_empty
6844 #define ADD isl_map_union_disjoint
6845 #include "isl_map_lexopt_templ.c"
6847 /* Given a map "map", compute the lexicographically minimal
6848 * (or maximal) image element for each domain element in "dom",
6849 * in the form of an isl_map.
6850 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6851 * do not have an image element.
6852 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6853 * should be computed over the domain of "map". "empty" is also NULL
6856 * If the input consists of more than one disjunct, then first
6857 * compute the desired result in the form of an isl_pw_multi_aff and
6858 * then convert that into an isl_map.
6860 * This function used to have an explicit implementation in terms
6861 * of isl_maps, but it would continually intersect the domains of
6862 * partial results with the complement of the domain of the next
6863 * partial solution, potentially leading to an explosion in the number
6864 * of disjuncts if there are several disjuncts in the input.
6865 * An even earlier implementation of this function would look for
6866 * better results in the domain of the partial result and for extra
6867 * results in the complement of this domain, which would lead to
6868 * even more splintering.
6870 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6871 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6872 __isl_give isl_set
**empty
, unsigned flags
)
6875 struct isl_map
*res
;
6876 isl_pw_multi_aff
*pma
;
6878 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6879 if (!map
|| (!full
&& !dom
))
6882 if (isl_map_plain_is_empty(map
)) {
6891 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6897 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6899 return isl_map_from_pw_multi_aff(pma
);
6908 __isl_give isl_map
*isl_map_partial_lexmax(
6909 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6910 __isl_give isl_set
**empty
)
6912 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6915 __isl_give isl_map
*isl_map_partial_lexmin(
6916 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6917 __isl_give isl_set
**empty
)
6919 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6922 __isl_give isl_set
*isl_set_partial_lexmin(
6923 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6924 __isl_give isl_set
**empty
)
6926 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6930 __isl_give isl_set
*isl_set_partial_lexmax(
6931 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6932 __isl_give isl_set
**empty
)
6934 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6938 /* Compute the lexicographic minimum (or maximum if "flags" includes
6939 * ISL_OPT_MAX) of "bset" over its parametric domain.
6941 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6944 return isl_basic_map_lexopt(bset
, flags
);
6947 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6949 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6952 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6954 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6957 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6959 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6962 /* Compute the lexicographic minimum of "bset" over its parametric domain
6963 * for the purpose of quantifier elimination.
6964 * That is, find an explicit representation for all the existentially
6965 * quantified variables in "bset" by computing their lexicographic
6968 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6969 __isl_take isl_basic_set
*bset
)
6971 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6974 /* Given a basic map with one output dimension, compute the minimum or
6975 * maximum of that dimension as an isl_pw_aff.
6977 * Compute the optimum as a lexicographic optimum over the single
6978 * output dimension and extract the single isl_pw_aff from the result.
6980 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6983 isl_pw_multi_aff
*pma
;
6986 bmap
= isl_basic_map_copy(bmap
);
6987 pma
= isl_basic_map_lexopt_pw_multi_aff(bmap
, max
? ISL_OPT_MAX
: 0);
6988 pwaff
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
6989 isl_pw_multi_aff_free(pma
);
6994 /* Compute the minimum or maximum of the given output dimension
6995 * as a function of the parameters and the input dimensions,
6996 * but independently of the other output dimensions.
6998 * We first project out the other output dimension and then compute
6999 * the "lexicographic" maximum in each basic map, combining the results
7000 * using isl_pw_aff_union_max.
7002 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
7009 n_out
= isl_map_dim(map
, isl_dim_out
);
7010 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
7011 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
7016 isl_space
*space
= isl_map_get_space(map
);
7018 return isl_pw_aff_empty(space
);
7021 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
7022 for (i
= 1; i
< map
->n
; ++i
) {
7023 isl_pw_aff
*pwaff_i
;
7025 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
7026 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
7034 /* Compute the minimum of the given output dimension as a function of the
7035 * parameters and input dimensions, but independently of
7036 * the other output dimensions.
7038 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
7040 return map_dim_opt(map
, pos
, 0);
7043 /* Compute the maximum of the given output dimension as a function of the
7044 * parameters and input dimensions, but independently of
7045 * the other output dimensions.
7047 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
7049 return map_dim_opt(map
, pos
, 1);
7052 /* Compute the minimum or maximum of the given set dimension
7053 * as a function of the parameters,
7054 * but independently of the other set dimensions.
7056 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
7059 return map_dim_opt(set
, pos
, max
);
7062 /* Compute the maximum of the given set dimension as a function of the
7063 * parameters, but independently of the other set dimensions.
7065 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
7067 return set_dim_opt(set
, pos
, 1);
7070 /* Compute the minimum of the given set dimension as a function of the
7071 * parameters, but independently of the other set dimensions.
7073 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
7075 return set_dim_opt(set
, pos
, 0);
7078 /* Apply a preimage specified by "mat" on the parameters of "bset".
7079 * bset is assumed to have only parameters and divs.
7081 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
7082 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
7089 bset
->dim
= isl_space_cow(bset
->dim
);
7093 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7095 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
7097 bset
->dim
->nparam
= 0;
7098 bset
->dim
->n_out
= nparam
;
7099 bset
= isl_basic_set_preimage(bset
, mat
);
7101 bset
->dim
->nparam
= bset
->dim
->n_out
;
7102 bset
->dim
->n_out
= 0;
7107 isl_basic_set_free(bset
);
7111 /* Apply a preimage specified by "mat" on the parameters of "set".
7112 * set is assumed to have only parameters and divs.
7114 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
7115 __isl_take isl_mat
*mat
)
7123 nparam
= isl_set_dim(set
, isl_dim_param
);
7125 if (mat
->n_row
!= 1 + nparam
)
7126 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
7127 "unexpected number of rows", goto error
);
7129 space
= isl_set_get_space(set
);
7130 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7131 isl_dim_param
, 0, nparam
);
7132 set
= isl_set_reset_space(set
, space
);
7133 set
= isl_set_preimage(set
, mat
);
7134 nparam
= isl_set_dim(set
, isl_dim_out
);
7135 space
= isl_set_get_space(set
);
7136 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7137 isl_dim_out
, 0, nparam
);
7138 set
= isl_set_reset_space(set
, space
);
7146 /* Intersect the basic set "bset" with the affine space specified by the
7147 * equalities in "eq".
7149 static __isl_give isl_basic_set
*basic_set_append_equalities(
7150 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7158 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7163 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7164 for (i
= 0; i
< eq
->n_row
; ++i
) {
7165 k
= isl_basic_set_alloc_equality(bset
);
7168 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7169 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7173 bset
= isl_basic_set_gauss(bset
, NULL
);
7174 bset
= isl_basic_set_finalize(bset
);
7179 isl_basic_set_free(bset
);
7183 /* Intersect the set "set" with the affine space specified by the
7184 * equalities in "eq".
7186 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7194 for (i
= 0; i
< set
->n
; ++i
) {
7195 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7208 /* Given a basic set "bset" that only involves parameters and existentially
7209 * quantified variables, return the index of the first equality
7210 * that only involves parameters. If there is no such equality then
7211 * return bset->n_eq.
7213 * This function assumes that isl_basic_set_gauss has been called on "bset".
7215 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7218 unsigned nparam
, n_div
;
7223 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7224 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7226 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7227 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7234 /* Compute an explicit representation for the existentially quantified
7235 * variables in "bset" by computing the "minimal value" of the set
7236 * variables. Since there are no set variables, the computation of
7237 * the minimal value essentially computes an explicit representation
7238 * of the non-empty part(s) of "bset".
7240 * The input only involves parameters and existentially quantified variables.
7241 * All equalities among parameters have been removed.
7243 * Since the existentially quantified variables in the result are in general
7244 * going to be different from those in the input, we first replace
7245 * them by the minimal number of variables based on their equalities.
7246 * This should simplify the parametric integer programming.
7248 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7250 isl_morph
*morph1
, *morph2
;
7256 if (bset
->n_eq
== 0)
7257 return isl_basic_set_lexmin_compute_divs(bset
);
7259 morph1
= isl_basic_set_parameter_compression(bset
);
7260 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7261 bset
= isl_basic_set_lift(bset
);
7262 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7263 bset
= isl_morph_basic_set(morph2
, bset
);
7264 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7265 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7267 set
= isl_basic_set_lexmin_compute_divs(bset
);
7269 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7274 /* Project the given basic set onto its parameter domain, possibly introducing
7275 * new, explicit, existential variables in the constraints.
7276 * The input has parameters and (possibly implicit) existential variables.
7277 * The output has the same parameters, but only
7278 * explicit existentially quantified variables.
7280 * The actual projection is performed by pip, but pip doesn't seem
7281 * to like equalities very much, so we first remove the equalities
7282 * among the parameters by performing a variable compression on
7283 * the parameters. Afterward, an inverse transformation is performed
7284 * and the equalities among the parameters are inserted back in.
7286 * The variable compression on the parameters may uncover additional
7287 * equalities that were only implicit before. We therefore check
7288 * if there are any new parameter equalities in the result and
7289 * if so recurse. The removal of parameter equalities is required
7290 * for the parameter compression performed by base_compute_divs.
7292 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7296 struct isl_mat
*T
, *T2
;
7297 struct isl_set
*set
;
7300 bset
= isl_basic_set_cow(bset
);
7304 if (bset
->n_eq
== 0)
7305 return base_compute_divs(bset
);
7307 bset
= isl_basic_set_gauss(bset
, NULL
);
7310 if (isl_basic_set_plain_is_empty(bset
))
7311 return isl_set_from_basic_set(bset
);
7313 i
= first_parameter_equality(bset
);
7314 if (i
== bset
->n_eq
)
7315 return base_compute_divs(bset
);
7317 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7318 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7320 eq
= isl_mat_cow(eq
);
7321 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7322 if (T
&& T
->n_col
== 0) {
7326 bset
= isl_basic_set_set_to_empty(bset
);
7327 return isl_set_from_basic_set(bset
);
7329 bset
= basic_set_parameter_preimage(bset
, T
);
7331 i
= first_parameter_equality(bset
);
7334 else if (i
== bset
->n_eq
)
7335 set
= base_compute_divs(bset
);
7337 set
= parameter_compute_divs(bset
);
7338 set
= set_parameter_preimage(set
, T2
);
7339 set
= set_append_equalities(set
, eq
);
7343 /* Insert the divs from "ls" before those of "bmap".
7345 * The number of columns is not changed, which means that the last
7346 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7347 * The caller is responsible for removing the same number of dimensions
7348 * from the space of "bmap".
7350 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7351 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7357 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7361 old_n_div
= bmap
->n_div
;
7362 bmap
= insert_div_rows(bmap
, n_div
);
7366 for (i
= 0; i
< n_div
; ++i
) {
7367 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7368 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7374 /* Replace the space of "bmap" by the space and divs of "ls".
7376 * If "ls" has any divs, then we simplify the result since we may
7377 * have discovered some additional equalities that could simplify
7378 * the div expressions.
7380 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7381 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7385 bmap
= isl_basic_map_cow(bmap
);
7389 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7390 bmap
= insert_divs_from_local_space(bmap
, ls
);
7394 isl_space_free(bmap
->dim
);
7395 bmap
->dim
= isl_local_space_get_space(ls
);
7399 isl_local_space_free(ls
);
7401 bmap
= isl_basic_map_simplify(bmap
);
7402 bmap
= isl_basic_map_finalize(bmap
);
7405 isl_basic_map_free(bmap
);
7406 isl_local_space_free(ls
);
7410 /* Replace the space of "map" by the space and divs of "ls".
7412 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7413 __isl_take isl_local_space
*ls
)
7417 map
= isl_map_cow(map
);
7421 for (i
= 0; i
< map
->n
; ++i
) {
7422 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7423 isl_local_space_copy(ls
));
7427 isl_space_free(map
->dim
);
7428 map
->dim
= isl_local_space_get_space(ls
);
7432 isl_local_space_free(ls
);
7435 isl_local_space_free(ls
);
7440 /* Compute an explicit representation for the existentially
7441 * quantified variables for which do not know any explicit representation yet.
7443 * We first sort the existentially quantified variables so that the
7444 * existentially quantified variables for which we already have an explicit
7445 * representation are placed before those for which we do not.
7446 * The input dimensions, the output dimensions and the existentially
7447 * quantified variables for which we already have an explicit
7448 * representation are then turned into parameters.
7449 * compute_divs returns a map with the same parameters and
7450 * no input or output dimensions and the dimension specification
7451 * is reset to that of the input, including the existentially quantified
7452 * variables for which we already had an explicit representation.
7454 static __isl_give isl_map
*compute_divs(__isl_take isl_basic_map
*bmap
)
7456 struct isl_basic_set
*bset
;
7457 struct isl_set
*set
;
7458 struct isl_map
*map
;
7460 isl_local_space
*ls
;
7467 bmap
= isl_basic_map_sort_divs(bmap
);
7468 bmap
= isl_basic_map_cow(bmap
);
7472 n_known
= isl_basic_map_first_unknown_div(bmap
);
7474 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7476 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7477 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7478 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7479 space
= isl_space_set_alloc(bmap
->ctx
,
7480 nparam
+ n_in
+ n_out
+ n_known
, 0);
7484 ls
= isl_basic_map_get_local_space(bmap
);
7485 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7486 n_known
, bmap
->n_div
- n_known
);
7488 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7489 swap_div(bmap
, i
- n_known
, i
);
7490 bmap
->n_div
-= n_known
;
7491 bmap
->extra
-= n_known
;
7493 bmap
= isl_basic_map_reset_space(bmap
, space
);
7494 bset
= bset_from_bmap(bmap
);
7496 set
= parameter_compute_divs(bset
);
7497 map
= set_to_map(set
);
7498 map
= replace_space_by_local_space(map
, ls
);
7502 isl_basic_map_free(bmap
);
7506 /* Remove the explicit representation of local variable "div",
7509 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7510 __isl_take isl_basic_map
*bmap
, int div
)
7514 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7516 return isl_basic_map_free(bmap
);
7520 bmap
= isl_basic_map_cow(bmap
);
7523 isl_int_set_si(bmap
->div
[div
][0], 0);
7527 /* Is local variable "div" of "bmap" marked as not having an explicit
7529 * Note that even if "div" is not marked in this way and therefore
7530 * has an explicit representation, this representation may still
7531 * depend (indirectly) on other local variables that do not
7532 * have an explicit representation.
7534 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7537 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7538 return isl_bool_error
;
7539 return isl_int_is_zero(bmap
->div
[div
][0]);
7542 /* Return the position of the first local variable that does not
7543 * have an explicit representation.
7544 * Return the total number of local variables if they all have
7545 * an explicit representation.
7546 * Return -1 on error.
7548 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7555 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7556 if (!isl_basic_map_div_is_known(bmap
, i
))
7562 /* Return the position of the first local variable that does not
7563 * have an explicit representation.
7564 * Return the total number of local variables if they all have
7565 * an explicit representation.
7566 * Return -1 on error.
7568 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7570 return isl_basic_map_first_unknown_div(bset
);
7573 /* Does "bmap" have an explicit representation for all local variables?
7575 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7579 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7580 first
= isl_basic_map_first_unknown_div(bmap
);
7582 return isl_bool_error
;
7586 /* Do all basic maps in "map" have an explicit representation
7587 * for all local variables?
7589 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7594 return isl_bool_error
;
7596 for (i
= 0; i
< map
->n
; ++i
) {
7597 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7602 return isl_bool_true
;
7605 /* If bmap contains any unknown divs, then compute explicit
7606 * expressions for them. However, this computation may be
7607 * quite expensive, so first try to remove divs that aren't
7610 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7613 struct isl_map
*map
;
7615 known
= isl_basic_map_divs_known(bmap
);
7619 return isl_map_from_basic_map(bmap
);
7621 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7623 known
= isl_basic_map_divs_known(bmap
);
7627 return isl_map_from_basic_map(bmap
);
7629 map
= compute_divs(bmap
);
7632 isl_basic_map_free(bmap
);
7636 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
7640 struct isl_map
*res
;
7647 known
= isl_map_divs_known(map
);
7655 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7656 for (i
= 1 ; i
< map
->n
; ++i
) {
7658 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7659 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7660 res
= isl_map_union_disjoint(res
, r2
);
7662 res
= isl_map_union(res
, r2
);
7669 __isl_give isl_set
*isl_basic_set_compute_divs(__isl_take isl_basic_set
*bset
)
7671 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7674 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7676 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7679 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
7682 struct isl_set
*set
;
7687 map
= isl_map_cow(map
);
7691 set
= set_from_map(map
);
7692 set
->dim
= isl_space_domain(set
->dim
);
7695 for (i
= 0; i
< map
->n
; ++i
) {
7696 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7700 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7701 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7708 /* Return the union of "map1" and "map2", where we assume for now that
7709 * "map1" and "map2" are disjoint. Note that the basic maps inside
7710 * "map1" or "map2" may not be disjoint from each other.
7711 * Also note that this function is also called from isl_map_union,
7712 * which takes care of handling the situation where "map1" and "map2"
7713 * may not be disjoint.
7715 * If one of the inputs is empty, we can simply return the other input.
7716 * Similarly, if one of the inputs is universal, then it is equal to the union.
7718 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7719 __isl_take isl_map
*map2
)
7723 struct isl_map
*map
= NULL
;
7729 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7730 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7731 "spaces don't match", goto error
);
7742 is_universe
= isl_map_plain_is_universe(map1
);
7743 if (is_universe
< 0)
7750 is_universe
= isl_map_plain_is_universe(map2
);
7751 if (is_universe
< 0)
7758 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7759 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7760 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7762 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7763 map1
->n
+ map2
->n
, flags
);
7766 for (i
= 0; i
< map1
->n
; ++i
) {
7767 map
= isl_map_add_basic_map(map
,
7768 isl_basic_map_copy(map1
->p
[i
]));
7772 for (i
= 0; i
< map2
->n
; ++i
) {
7773 map
= isl_map_add_basic_map(map
,
7774 isl_basic_map_copy(map2
->p
[i
]));
7788 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7789 * guaranteed to be disjoint by the caller.
7791 * Note that this functions is called from within isl_map_make_disjoint,
7792 * so we have to be careful not to touch the constraints of the inputs
7795 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7796 __isl_take isl_map
*map2
)
7798 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7801 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7802 * not be disjoint. The parameters are assumed to have been aligned.
7804 * We currently simply call map_union_disjoint, the internal operation
7805 * of which does not really depend on the inputs being disjoint.
7806 * If the result contains more than one basic map, then we clear
7807 * the disjoint flag since the result may contain basic maps from
7808 * both inputs and these are not guaranteed to be disjoint.
7810 * As a special case, if "map1" and "map2" are obviously equal,
7811 * then we simply return "map1".
7813 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7814 __isl_take isl_map
*map2
)
7821 equal
= isl_map_plain_is_equal(map1
, map2
);
7829 map1
= map_union_disjoint(map1
, map2
);
7833 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7841 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7844 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7845 __isl_take isl_map
*map2
)
7847 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7850 __isl_give isl_set
*isl_set_union_disjoint(
7851 __isl_take isl_set
*set1
, __isl_take isl_set
*set2
)
7853 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7857 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7859 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7862 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7865 * "map" and "set" are assumed to be compatible and non-NULL.
7867 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7868 __isl_take isl_set
*set
,
7869 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7870 __isl_take isl_basic_set
*bset
))
7873 struct isl_map
*result
;
7876 if (isl_set_plain_is_universe(set
)) {
7881 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7882 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7883 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7885 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7886 map
->n
* set
->n
, flags
);
7887 for (i
= 0; result
&& i
< map
->n
; ++i
)
7888 for (j
= 0; j
< set
->n
; ++j
) {
7889 result
= isl_map_add_basic_map(result
,
7890 fn(isl_basic_map_copy(map
->p
[i
]),
7891 isl_basic_set_copy(set
->p
[j
])));
7901 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7902 __isl_take isl_set
*set
)
7906 ok
= isl_map_compatible_range(map
, set
);
7910 isl_die(set
->ctx
, isl_error_invalid
,
7911 "incompatible spaces", goto error
);
7913 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7920 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7921 __isl_take isl_set
*set
)
7923 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7926 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7927 __isl_take isl_set
*set
)
7931 ok
= isl_map_compatible_domain(map
, set
);
7935 isl_die(set
->ctx
, isl_error_invalid
,
7936 "incompatible spaces", goto error
);
7938 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7945 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7946 __isl_take isl_set
*set
)
7948 return isl_map_align_params_map_map_and(map
, set
,
7949 &map_intersect_domain
);
7952 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7953 * in the space B -> C, return the intersection.
7954 * The parameters are assumed to have been aligned.
7956 * The map "factor" is first extended to a map living in the space
7957 * [A -> B] -> C and then a regular intersection is computed.
7959 static __isl_give isl_map
*map_intersect_domain_factor_range(
7960 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7963 isl_map
*ext_factor
;
7965 space
= isl_space_domain_factor_domain(isl_map_get_space(map
));
7966 ext_factor
= isl_map_universe(space
);
7967 ext_factor
= isl_map_domain_product(ext_factor
, factor
);
7968 return map_intersect(map
, ext_factor
);
7971 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7972 * in the space B -> C, return the intersection.
7974 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
7975 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7977 return isl_map_align_params_map_map_and(map
, factor
,
7978 &map_intersect_domain_factor_range
);
7981 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7982 * in the space A -> C, return the intersection.
7984 * The map "factor" is first extended to a map living in the space
7985 * A -> [B -> C] and then a regular intersection is computed.
7987 static __isl_give isl_map
*map_intersect_range_factor_range(
7988 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7991 isl_map
*ext_factor
;
7993 space
= isl_space_range_factor_domain(isl_map_get_space(map
));
7994 ext_factor
= isl_map_universe(space
);
7995 ext_factor
= isl_map_range_product(ext_factor
, factor
);
7996 return isl_map_intersect(map
, ext_factor
);
7999 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
8000 * in the space A -> C, return the intersection.
8002 __isl_give isl_map
*isl_map_intersect_range_factor_range(
8003 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
8005 return isl_map_align_params_map_map_and(map
, factor
,
8006 &map_intersect_range_factor_range
);
8009 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
8010 __isl_take isl_map
*map2
)
8014 map1
= isl_map_reverse(map1
);
8015 map1
= isl_map_apply_range(map1
, map2
);
8016 return isl_map_reverse(map1
);
8023 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
8024 __isl_take isl_map
*map2
)
8026 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
8029 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
8030 __isl_take isl_map
*map2
)
8033 struct isl_map
*result
;
8039 space
= isl_space_join(isl_space_copy(map1
->dim
),
8040 isl_space_copy(map2
->dim
));
8042 result
= isl_map_alloc_space(space
, map1
->n
* map2
->n
, 0);
8045 for (i
= 0; i
< map1
->n
; ++i
)
8046 for (j
= 0; j
< map2
->n
; ++j
) {
8047 result
= isl_map_add_basic_map(result
,
8048 isl_basic_map_apply_range(
8049 isl_basic_map_copy(map1
->p
[i
]),
8050 isl_basic_map_copy(map2
->p
[j
])));
8056 if (result
&& result
->n
<= 1)
8057 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
8065 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
8066 __isl_take isl_map
*map2
)
8068 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
8072 * returns range - domain
8074 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
8076 isl_space
*target_space
;
8077 struct isl_basic_set
*bset
;
8084 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8085 bmap
->dim
, isl_dim_out
),
8087 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
8088 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
8089 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8090 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
8091 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
8092 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
8093 for (i
= 0; i
< dim
; ++i
) {
8094 int j
= isl_basic_map_alloc_equality(bmap
);
8096 bmap
= isl_basic_map_free(bmap
);
8099 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8100 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8101 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
8102 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
8104 bset
= isl_basic_map_domain(bmap
);
8105 bset
= isl_basic_set_reset_space(bset
, target_space
);
8108 isl_basic_map_free(bmap
);
8113 * returns range - domain
8115 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8119 struct isl_set
*result
;
8124 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8125 map
->dim
, isl_dim_out
),
8127 dim
= isl_map_get_space(map
);
8128 dim
= isl_space_domain(dim
);
8129 result
= isl_set_alloc_space(dim
, map
->n
, 0);
8132 for (i
= 0; i
< map
->n
; ++i
)
8133 result
= isl_set_add_basic_set(result
,
8134 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8143 * returns [domain -> range] -> range - domain
8145 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8146 __isl_take isl_basic_map
*bmap
)
8150 isl_basic_map
*domain
;
8154 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8155 bmap
->dim
, isl_dim_out
))
8156 isl_die(bmap
->ctx
, isl_error_invalid
,
8157 "domain and range don't match", goto error
);
8159 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8160 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8162 space
= isl_basic_map_get_space(bmap
);
8163 space
= isl_space_from_range(isl_space_domain(space
));
8164 domain
= isl_basic_map_universe(space
);
8166 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8167 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8168 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8170 total
= isl_basic_map_total_dim(bmap
);
8172 for (i
= 0; i
< n
; ++i
) {
8173 k
= isl_basic_map_alloc_equality(bmap
);
8176 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8177 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8178 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8179 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8182 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8183 return isl_basic_map_finalize(bmap
);
8185 isl_basic_map_free(bmap
);
8190 * returns [domain -> range] -> range - domain
8192 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8195 isl_space
*domain_space
;
8200 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8201 map
->dim
, isl_dim_out
))
8202 isl_die(map
->ctx
, isl_error_invalid
,
8203 "domain and range don't match", goto error
);
8205 map
= isl_map_cow(map
);
8209 domain_space
= isl_space_domain(isl_map_get_space(map
));
8210 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
8211 map
->dim
= isl_space_join(map
->dim
, isl_space_from_range(domain_space
));
8214 for (i
= 0; i
< map
->n
; ++i
) {
8215 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8219 map
= isl_map_unmark_normalized(map
);
8226 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*space
)
8228 unsigned n_in
, n_out
;
8232 n_in
= isl_space_dim(space
, isl_dim_in
);
8233 n_out
= isl_space_dim(space
, isl_dim_out
);
8235 isl_die(space
->ctx
, isl_error_invalid
,
8236 "number of input and output dimensions needs to be "
8237 "the same", goto error
);
8238 return isl_basic_map_equal(space
, n_in
);
8240 isl_space_free(space
);
8244 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8246 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8249 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8251 isl_space
*dim
= isl_set_get_space(set
);
8253 id
= isl_map_identity(isl_space_map_from_set(dim
));
8254 return isl_map_intersect_range(id
, set
);
8257 /* Construct a basic set with all set dimensions having only non-negative
8260 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8261 __isl_take isl_space
*space
)
8266 struct isl_basic_set
*bset
;
8270 nparam
= space
->nparam
;
8272 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8275 for (i
= 0; i
< dim
; ++i
) {
8276 int k
= isl_basic_set_alloc_inequality(bset
);
8279 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8280 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8284 isl_basic_set_free(bset
);
8288 /* Construct the half-space x_pos >= 0.
8290 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*space
,
8294 isl_basic_set
*nonneg
;
8296 nonneg
= isl_basic_set_alloc_space(space
, 0, 0, 1);
8297 k
= isl_basic_set_alloc_inequality(nonneg
);
8300 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8301 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8303 return isl_basic_set_finalize(nonneg
);
8305 isl_basic_set_free(nonneg
);
8309 /* Construct the half-space x_pos <= -1.
8311 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*space
,
8317 neg
= isl_basic_set_alloc_space(space
, 0, 0, 1);
8318 k
= isl_basic_set_alloc_inequality(neg
);
8321 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8322 isl_int_set_si(neg
->ineq
[k
][0], -1);
8323 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8325 return isl_basic_set_finalize(neg
);
8327 isl_basic_set_free(neg
);
8331 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8332 enum isl_dim_type type
, unsigned first
, unsigned n
)
8336 isl_basic_set
*nonneg
;
8344 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8346 offset
= pos(set
->dim
, type
);
8347 for (i
= 0; i
< n
; ++i
) {
8348 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8349 offset
+ first
+ i
);
8350 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8352 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8361 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8363 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8369 return isl_stat_error
;
8370 if (isl_set_plain_is_empty(set
)) {
8375 return fn(set
, signs
, user
);
8378 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8380 half
= isl_set_intersect(half
, isl_set_copy(set
));
8381 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8385 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8387 half
= isl_set_intersect(half
, set
);
8388 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8391 return isl_stat_error
;
8394 /* Call "fn" on the intersections of "set" with each of the orthants
8395 * (except for obviously empty intersections). The orthant is identified
8396 * by the signs array, with each entry having value 1 or -1 according
8397 * to the sign of the corresponding variable.
8399 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8400 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8409 return isl_stat_error
;
8410 if (isl_set_plain_is_empty(set
))
8413 nparam
= isl_set_dim(set
, isl_dim_param
);
8414 nvar
= isl_set_dim(set
, isl_dim_set
);
8416 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8418 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8426 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8428 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8431 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8432 __isl_keep isl_basic_map
*bmap2
)
8435 struct isl_map
*map1
;
8436 struct isl_map
*map2
;
8438 if (!bmap1
|| !bmap2
)
8439 return isl_bool_error
;
8441 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8442 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8444 is_subset
= isl_map_is_subset(map1
, map2
);
8452 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8453 __isl_keep isl_basic_set
*bset2
)
8455 return isl_basic_map_is_subset(bset1
, bset2
);
8458 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8459 __isl_keep isl_basic_map
*bmap2
)
8463 if (!bmap1
|| !bmap2
)
8464 return isl_bool_error
;
8465 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8466 if (is_subset
!= isl_bool_true
)
8468 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8472 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8473 __isl_keep isl_basic_set
*bset2
)
8475 return isl_basic_map_is_equal(
8476 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8479 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8485 return isl_bool_error
;
8486 for (i
= 0; i
< map
->n
; ++i
) {
8487 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8489 return isl_bool_error
;
8491 return isl_bool_false
;
8493 return isl_bool_true
;
8496 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8498 return map
? map
->n
== 0 : isl_bool_error
;
8501 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8503 return set
? set
->n
== 0 : isl_bool_error
;
8506 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8508 return isl_map_is_empty(set_to_map(set
));
8511 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8512 __isl_keep isl_map
*map2
)
8515 return isl_bool_error
;
8517 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8520 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8521 __isl_keep isl_set
*set2
)
8524 return isl_bool_error
;
8526 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8529 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8534 return isl_bool_error
;
8535 is_subset
= isl_map_is_subset(map1
, map2
);
8536 if (is_subset
!= isl_bool_true
)
8538 is_subset
= isl_map_is_subset(map2
, map1
);
8542 /* Is "map1" equal to "map2"?
8544 * First check if they are obviously equal.
8545 * If not, then perform a more detailed analysis.
8547 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8551 equal
= isl_map_plain_is_equal(map1
, map2
);
8552 if (equal
< 0 || equal
)
8554 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8557 isl_bool
isl_basic_map_is_strict_subset(
8558 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8562 if (!bmap1
|| !bmap2
)
8563 return isl_bool_error
;
8564 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8565 if (is_subset
!= isl_bool_true
)
8567 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8568 if (is_subset
== isl_bool_error
)
8573 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8574 __isl_keep isl_map
*map2
)
8579 return isl_bool_error
;
8580 is_subset
= isl_map_is_subset(map1
, map2
);
8581 if (is_subset
!= isl_bool_true
)
8583 is_subset
= isl_map_is_subset(map2
, map1
);
8584 if (is_subset
== isl_bool_error
)
8589 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8590 __isl_keep isl_set
*set2
)
8592 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8595 /* Is "bmap" obviously equal to the universe with the same space?
8597 * That is, does it not have any constraints?
8599 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8602 return isl_bool_error
;
8603 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8606 /* Is "bset" obviously equal to the universe with the same space?
8608 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8610 return isl_basic_map_plain_is_universe(bset
);
8613 /* If "c" does not involve any existentially quantified variables,
8614 * then set *univ to false and abort
8616 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8618 isl_bool
*univ
= user
;
8621 n
= isl_constraint_dim(c
, isl_dim_div
);
8622 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8623 isl_constraint_free(c
);
8624 if (*univ
< 0 || !*univ
)
8625 return isl_stat_error
;
8629 /* Is "bmap" equal to the universe with the same space?
8631 * First check if it is obviously equal to the universe.
8632 * If not and if there are any constraints not involving
8633 * existentially quantified variables, then it is certainly
8634 * not equal to the universe.
8635 * Otherwise, check if the universe is a subset of "bmap".
8637 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8640 isl_basic_map
*test
;
8642 univ
= isl_basic_map_plain_is_universe(bmap
);
8643 if (univ
< 0 || univ
)
8645 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8646 return isl_bool_false
;
8647 univ
= isl_bool_true
;
8648 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8650 return isl_bool_error
;
8651 if (univ
< 0 || !univ
)
8653 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8654 univ
= isl_basic_map_is_subset(test
, bmap
);
8655 isl_basic_map_free(test
);
8659 /* Is "bset" equal to the universe with the same space?
8661 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8663 return isl_basic_map_is_universe(bset
);
8666 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8671 return isl_bool_error
;
8673 for (i
= 0; i
< map
->n
; ++i
) {
8674 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8679 return isl_bool_false
;
8682 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8684 return isl_map_plain_is_universe(set_to_map(set
));
8687 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8689 struct isl_basic_set
*bset
= NULL
;
8690 struct isl_vec
*sample
= NULL
;
8691 isl_bool empty
, non_empty
;
8694 return isl_bool_error
;
8696 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8697 return isl_bool_true
;
8699 if (isl_basic_map_plain_is_universe(bmap
))
8700 return isl_bool_false
;
8702 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8703 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8704 copy
= isl_basic_map_remove_redundancies(copy
);
8705 empty
= isl_basic_map_plain_is_empty(copy
);
8706 isl_basic_map_free(copy
);
8710 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8712 return isl_bool_error
;
8714 return isl_bool_false
;
8715 isl_vec_free(bmap
->sample
);
8716 bmap
->sample
= NULL
;
8717 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8719 return isl_bool_error
;
8720 sample
= isl_basic_set_sample_vec(bset
);
8722 return isl_bool_error
;
8723 empty
= sample
->size
== 0;
8724 isl_vec_free(bmap
->sample
);
8725 bmap
->sample
= sample
;
8727 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8732 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8735 return isl_bool_error
;
8736 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8739 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8742 return isl_bool_error
;
8743 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8746 /* Is "bmap" known to be non-empty?
8748 * That is, is the cached sample still valid?
8750 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8755 return isl_bool_error
;
8757 return isl_bool_false
;
8758 total
= 1 + isl_basic_map_total_dim(bmap
);
8759 if (bmap
->sample
->size
!= total
)
8760 return isl_bool_false
;
8761 return isl_basic_map_contains(bmap
, bmap
->sample
);
8764 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8766 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8769 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8770 __isl_take isl_basic_map
*bmap2
)
8772 struct isl_map
*map
;
8773 if (!bmap1
|| !bmap2
)
8776 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8778 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8781 map
= isl_map_add_basic_map(map
, bmap1
);
8782 map
= isl_map_add_basic_map(map
, bmap2
);
8785 isl_basic_map_free(bmap1
);
8786 isl_basic_map_free(bmap2
);
8790 struct isl_set
*isl_basic_set_union(
8791 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8793 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8794 bset_to_bmap(bset2
)));
8797 /* Order divs such that any div only depends on previous divs */
8798 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8799 __isl_take isl_basic_map
*bmap
)
8807 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8809 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8811 if (isl_int_is_zero(bmap
->div
[i
][0]))
8813 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8818 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8819 "integer division depends on itself",
8820 return isl_basic_map_free(bmap
));
8821 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8827 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8829 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8832 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8839 for (i
= 0; i
< map
->n
; ++i
) {
8840 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8851 /* Sort the local variables of "bset".
8853 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8854 __isl_take isl_basic_set
*bset
)
8856 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8859 /* Apply the expansion computed by isl_merge_divs.
8860 * The expansion itself is given by "exp" while the resulting
8861 * list of divs is given by "div".
8863 * Move the integer divisions of "bmap" into the right position
8864 * according to "exp" and then introduce the additional integer
8865 * divisions, adding div constraints.
8866 * The moving should be done first to avoid moving coefficients
8867 * in the definitions of the extra integer divisions.
8869 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8870 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8875 bmap
= isl_basic_map_cow(bmap
);
8879 if (div
->n_row
< bmap
->n_div
)
8880 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8881 "not an expansion", goto error
);
8883 n_div
= bmap
->n_div
;
8884 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8885 div
->n_row
- n_div
, 0,
8886 2 * (div
->n_row
- n_div
));
8888 for (i
= n_div
; i
< div
->n_row
; ++i
)
8889 if (isl_basic_map_alloc_div(bmap
) < 0)
8892 for (j
= n_div
- 1; j
>= 0; --j
) {
8895 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8898 for (i
= 0; i
< div
->n_row
; ++i
) {
8899 if (j
< n_div
&& exp
[j
] == i
) {
8902 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8903 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8905 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8913 isl_basic_map_free(bmap
);
8918 /* Apply the expansion computed by isl_merge_divs.
8919 * The expansion itself is given by "exp" while the resulting
8920 * list of divs is given by "div".
8922 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8923 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8925 return isl_basic_map_expand_divs(bset
, div
, exp
);
8928 /* Look for a div in dst that corresponds to the div "div" in src.
8929 * The divs before "div" in src and dst are assumed to be the same.
8931 * Returns -1 if no corresponding div was found and the position
8932 * of the corresponding div in dst otherwise.
8934 static int find_div(__isl_keep isl_basic_map
*dst
,
8935 __isl_keep isl_basic_map
*src
, unsigned div
)
8939 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8941 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8942 for (i
= div
; i
< dst
->n_div
; ++i
)
8943 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8944 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8945 dst
->n_div
- div
) == -1)
8950 /* Align the divs of "dst" to those of "src", adding divs from "src"
8951 * if needed. That is, make sure that the first src->n_div divs
8952 * of the result are equal to those of src.
8954 * The result is not finalized as by design it will have redundant
8955 * divs if any divs from "src" were copied.
8957 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8958 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8966 return isl_basic_map_free(dst
);
8968 if (src
->n_div
== 0)
8971 known
= isl_basic_map_divs_known(src
);
8973 return isl_basic_map_free(dst
);
8975 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8976 "some src divs are unknown",
8977 return isl_basic_map_free(dst
));
8979 src
= isl_basic_map_order_divs(isl_basic_map_copy(src
));
8981 return isl_basic_map_free(dst
);
8984 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8985 for (i
= 0; i
< src
->n_div
; ++i
) {
8986 int j
= find_div(dst
, src
, i
);
8989 int extra
= src
->n_div
- i
;
8990 dst
= isl_basic_map_cow(dst
);
8993 dst
= isl_basic_map_extend_space(dst
,
8994 isl_space_copy(dst
->dim
),
8995 extra
, 0, 2 * extra
);
8998 j
= isl_basic_map_alloc_div(dst
);
9001 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
9002 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
9003 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
9007 isl_basic_map_swap_div(dst
, i
, j
);
9009 isl_basic_map_free(src
);
9012 isl_basic_map_free(src
);
9013 isl_basic_map_free(dst
);
9017 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
9025 map
= isl_map_compute_divs(map
);
9026 map
= isl_map_cow(map
);
9030 for (i
= 1; i
< map
->n
; ++i
)
9031 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
9032 for (i
= 1; i
< map
->n
; ++i
) {
9033 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
9035 return isl_map_free(map
);
9038 map
= isl_map_unmark_normalized(map
);
9042 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
9044 return isl_map_align_divs_internal(map
);
9047 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
9049 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
9052 /* Align the divs of the basic maps in "map" to those
9053 * of the basic maps in "list", as well as to the other basic maps in "map".
9054 * The elements in "list" are assumed to have known divs.
9056 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
9057 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
9061 map
= isl_map_compute_divs(map
);
9062 map
= isl_map_cow(map
);
9064 return isl_map_free(map
);
9068 n
= isl_basic_map_list_n_basic_map(list
);
9069 for (i
= 0; i
< n
; ++i
) {
9070 isl_basic_map
*bmap
;
9072 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
9073 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
9074 isl_basic_map_free(bmap
);
9077 return isl_map_free(map
);
9079 return isl_map_align_divs_internal(map
);
9082 /* Align the divs of each element of "list" to those of "bmap".
9083 * Both "bmap" and the elements of "list" are assumed to have known divs.
9085 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
9086 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
9091 return isl_basic_map_list_free(list
);
9093 n
= isl_basic_map_list_n_basic_map(list
);
9094 for (i
= 0; i
< n
; ++i
) {
9095 isl_basic_map
*bmap_i
;
9097 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9098 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
9099 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
9105 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
9106 __isl_take isl_map
*map
)
9110 ok
= isl_map_compatible_domain(map
, set
);
9114 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9115 "incompatible spaces", goto error
);
9116 map
= isl_map_intersect_domain(map
, set
);
9117 set
= isl_map_range(map
);
9125 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9126 __isl_take isl_map
*map
)
9128 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
9131 /* There is no need to cow as removing empty parts doesn't change
9132 * the meaning of the set.
9134 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9141 for (i
= map
->n
- 1; i
>= 0; --i
)
9142 map
= remove_if_empty(map
, i
);
9147 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
9149 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9152 /* Create a binary relation that maps the shared initial "pos" dimensions
9153 * of "bset1" and "bset2" to the remaining dimensions of "bset1" and "bset2".
9155 static __isl_give isl_basic_map
*join_initial(__isl_keep isl_basic_set
*bset1
,
9156 __isl_keep isl_basic_set
*bset2
, int pos
)
9158 isl_basic_map
*bmap1
;
9159 isl_basic_map
*bmap2
;
9161 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9162 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9163 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9164 isl_dim_out
, 0, pos
);
9165 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9166 isl_dim_out
, 0, pos
);
9167 return isl_basic_map_range_product(bmap1
, bmap2
);
9170 /* Given two basic sets bset1 and bset2, compute the maximal difference
9171 * between the values of dimension pos in bset1 and those in bset2
9172 * for any common value of the parameters and dimensions preceding pos.
9174 static enum isl_lp_result
basic_set_maximal_difference_at(
9175 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9176 int pos
, isl_int
*opt
)
9178 isl_basic_map
*bmap1
;
9179 struct isl_ctx
*ctx
;
9180 struct isl_vec
*obj
;
9184 enum isl_lp_result res
;
9186 if (!bset1
|| !bset2
)
9187 return isl_lp_error
;
9189 nparam
= isl_basic_set_n_param(bset1
);
9190 dim1
= isl_basic_set_n_dim(bset1
);
9192 bmap1
= join_initial(bset1
, bset2
, pos
);
9194 return isl_lp_error
;
9196 total
= isl_basic_map_total_dim(bmap1
);
9198 obj
= isl_vec_alloc(ctx
, 1 + total
);
9201 isl_seq_clr(obj
->block
.data
, 1 + total
);
9202 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9203 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9204 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9206 isl_basic_map_free(bmap1
);
9210 isl_basic_map_free(bmap1
);
9211 return isl_lp_error
;
9214 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9215 * for any common value of the parameters and dimensions preceding pos
9216 * in both basic sets, the values of dimension pos in bset1 are
9217 * smaller or larger than those in bset2.
9220 * 1 if bset1 follows bset2
9221 * -1 if bset1 precedes bset2
9222 * 0 if bset1 and bset2 are incomparable
9223 * -2 if some error occurred.
9225 int isl_basic_set_compare_at(__isl_keep isl_basic_set
*bset1
,
9226 __isl_keep isl_basic_set
*bset2
, int pos
)
9229 enum isl_lp_result res
;
9234 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9236 if (res
== isl_lp_empty
)
9238 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9239 res
== isl_lp_unbounded
)
9241 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9250 /* Given two basic sets bset1 and bset2, check whether
9251 * for any common value of the parameters and dimensions preceding pos
9252 * there is a value of dimension pos in bset1 that is larger
9253 * than a value of the same dimension in bset2.
9256 * 1 if there exists such a pair
9257 * 0 if there is no such pair, but there is a pair of equal values
9259 * -2 if some error occurred.
9261 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9262 __isl_keep isl_basic_set
*bset2
, int pos
)
9265 isl_basic_map
*bmap
;
9268 dim1
= isl_basic_set_dim(bset1
, isl_dim_set
);
9269 bmap
= join_initial(bset1
, bset2
, pos
);
9270 bmap
= isl_basic_map_order_ge(bmap
, isl_dim_out
, 0,
9271 isl_dim_out
, dim1
- pos
);
9272 empty
= isl_basic_map_is_empty(bmap
);
9276 isl_basic_map_free(bmap
);
9279 bmap
= isl_basic_map_order_gt(bmap
, isl_dim_out
, 0,
9280 isl_dim_out
, dim1
- pos
);
9281 empty
= isl_basic_map_is_empty(bmap
);
9284 isl_basic_map_free(bmap
);
9289 isl_basic_map_free(bmap
);
9293 /* Given two sets set1 and set2, check whether
9294 * for any common value of the parameters and dimensions preceding pos
9295 * there is a value of dimension pos in set1 that is larger
9296 * than a value of the same dimension in set2.
9299 * 1 if there exists such a pair
9300 * 0 if there is no such pair, but there is a pair of equal values
9302 * -2 if some error occurred.
9304 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9305 __isl_keep isl_set
*set2
, int pos
)
9313 for (i
= 0; i
< set1
->n
; ++i
)
9314 for (j
= 0; j
< set2
->n
; ++j
) {
9316 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9317 if (f
== 1 || f
== -2)
9326 static isl_bool
isl_basic_map_plain_has_fixed_var(
9327 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9334 return isl_bool_error
;
9335 total
= isl_basic_map_total_dim(bmap
);
9336 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9337 for (; d
+1 > pos
; --d
)
9338 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9342 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9343 return isl_bool_false
;
9344 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9345 return isl_bool_false
;
9346 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9347 return isl_bool_false
;
9349 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9350 return isl_bool_true
;
9352 return isl_bool_false
;
9355 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9356 unsigned pos
, isl_int
*val
)
9364 return isl_bool_error
;
9366 return isl_bool_false
;
9368 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9371 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9372 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9373 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9374 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9375 fixed
= isl_bool_false
;
9378 isl_int_set(*val
, v
);
9384 static isl_bool
isl_basic_set_plain_has_fixed_var(
9385 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9387 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9391 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9392 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9394 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9395 return isl_bool_error
;
9396 return isl_basic_map_plain_has_fixed_var(bmap
,
9397 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9400 /* If "bmap" obviously lies on a hyperplane where the given dimension
9401 * has a fixed value, then return that value.
9402 * Otherwise return NaN.
9404 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9405 __isl_keep isl_basic_map
*bmap
,
9406 enum isl_dim_type type
, unsigned pos
)
9414 ctx
= isl_basic_map_get_ctx(bmap
);
9415 v
= isl_val_alloc(ctx
);
9418 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9420 return isl_val_free(v
);
9422 isl_int_set_si(v
->d
, 1);
9426 return isl_val_nan(ctx
);
9429 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9430 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9432 if (pos
>= isl_map_dim(map
, type
))
9433 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9434 "position out of bounds", return isl_bool_error
);
9435 return isl_map_plain_has_fixed_var(map
,
9436 map_offset(map
, type
) - 1 + pos
, val
);
9439 /* If "map" obviously lies on a hyperplane where the given dimension
9440 * has a fixed value, then return that value.
9441 * Otherwise return NaN.
9443 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9444 enum isl_dim_type type
, unsigned pos
)
9452 ctx
= isl_map_get_ctx(map
);
9453 v
= isl_val_alloc(ctx
);
9456 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9458 return isl_val_free(v
);
9460 isl_int_set_si(v
->d
, 1);
9464 return isl_val_nan(ctx
);
9467 /* If "set" obviously lies on a hyperplane where the given dimension
9468 * has a fixed value, then return that value.
9469 * Otherwise return NaN.
9471 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9472 enum isl_dim_type type
, unsigned pos
)
9474 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9477 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9478 * then return this fixed value in *val.
9480 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9481 unsigned dim
, isl_int
*val
)
9483 return isl_basic_set_plain_has_fixed_var(bset
,
9484 isl_basic_set_n_param(bset
) + dim
, val
);
9487 /* Return -1 if the constraint "c1" should be sorted before "c2"
9488 * and 1 if it should be sorted after "c2".
9489 * Return 0 if the two constraints are the same (up to the constant term).
9491 * In particular, if a constraint involves later variables than another
9492 * then it is sorted after this other constraint.
9493 * uset_gist depends on constraints without existentially quantified
9494 * variables sorting first.
9496 * For constraints that have the same latest variable, those
9497 * with the same coefficient for this latest variable (first in absolute value
9498 * and then in actual value) are grouped together.
9499 * This is useful for detecting pairs of constraints that can
9500 * be chained in their printed representation.
9502 * Finally, within a group, constraints are sorted according to
9503 * their coefficients (excluding the constant term).
9505 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9507 isl_int
**c1
= (isl_int
**) p1
;
9508 isl_int
**c2
= (isl_int
**) p2
;
9510 unsigned size
= *(unsigned *) arg
;
9513 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9514 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9519 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9522 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9526 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9529 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9530 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9531 * and 0 if the two constraints are the same (up to the constant term).
9533 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9534 isl_int
*c1
, isl_int
*c2
)
9540 total
= isl_basic_map_total_dim(bmap
);
9541 return sort_constraint_cmp(&c1
, &c2
, &total
);
9544 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9545 __isl_take isl_basic_map
*bmap
)
9551 if (bmap
->n_ineq
== 0)
9553 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_SORTED
))
9555 total
= isl_basic_map_total_dim(bmap
);
9556 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9557 &sort_constraint_cmp
, &total
) < 0)
9558 return isl_basic_map_free(bmap
);
9559 ISL_F_SET(bmap
, ISL_BASIC_MAP_SORTED
);
9563 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9564 __isl_take isl_basic_set
*bset
)
9566 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9567 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9570 __isl_give isl_basic_map
*isl_basic_map_normalize(
9571 __isl_take isl_basic_map
*bmap
)
9573 bmap
= isl_basic_map_remove_redundancies(bmap
);
9574 bmap
= isl_basic_map_sort_constraints(bmap
);
9577 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9578 __isl_keep isl_basic_map
*bmap2
)
9582 isl_space
*space1
, *space2
;
9584 if (!bmap1
|| !bmap2
)
9589 space1
= isl_basic_map_peek_space(bmap1
);
9590 space2
= isl_basic_map_peek_space(bmap2
);
9591 cmp
= isl_space_cmp(space1
, space2
);
9594 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9595 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9596 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9597 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9598 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9600 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9602 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9604 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9605 return bmap1
->n_eq
- bmap2
->n_eq
;
9606 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9607 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9608 if (bmap1
->n_div
!= bmap2
->n_div
)
9609 return bmap1
->n_div
- bmap2
->n_div
;
9610 total
= isl_basic_map_total_dim(bmap1
);
9611 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9612 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9616 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9617 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9621 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9622 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9629 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9630 __isl_keep isl_basic_set
*bset2
)
9632 return isl_basic_map_plain_cmp(bset1
, bset2
);
9635 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9641 if (set1
->n
!= set2
->n
)
9642 return set1
->n
- set2
->n
;
9644 for (i
= 0; i
< set1
->n
; ++i
) {
9645 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9653 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9654 __isl_keep isl_basic_map
*bmap2
)
9656 if (!bmap1
|| !bmap2
)
9657 return isl_bool_error
;
9658 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9661 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9662 __isl_keep isl_basic_set
*bset2
)
9664 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9665 bset_to_bmap(bset2
));
9668 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9670 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9671 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9673 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9676 /* Sort the basic maps of "map" and remove duplicate basic maps.
9678 * While removing basic maps, we make sure that the basic maps remain
9679 * sorted because isl_map_normalize expects the basic maps of the result
9682 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9686 map
= isl_map_remove_empty_parts(map
);
9689 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9690 for (i
= map
->n
- 1; i
>= 1; --i
) {
9691 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9693 isl_basic_map_free(map
->p
[i
-1]);
9694 for (j
= i
; j
< map
->n
; ++j
)
9695 map
->p
[j
- 1] = map
->p
[j
];
9702 /* Remove obvious duplicates among the basic maps of "map".
9704 * Unlike isl_map_normalize, this function does not remove redundant
9705 * constraints and only removes duplicates that have exactly the same
9706 * constraints in the input. It does sort the constraints and
9707 * the basic maps to ease the detection of duplicates.
9709 * If "map" has already been normalized or if the basic maps are
9710 * disjoint, then there can be no duplicates.
9712 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9715 isl_basic_map
*bmap
;
9721 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9723 for (i
= 0; i
< map
->n
; ++i
) {
9724 bmap
= isl_basic_map_copy(map
->p
[i
]);
9725 bmap
= isl_basic_map_sort_constraints(bmap
);
9727 return isl_map_free(map
);
9728 isl_basic_map_free(map
->p
[i
]);
9732 map
= sort_and_remove_duplicates(map
);
9736 /* We normalize in place, but if anything goes wrong we need
9737 * to return NULL, so we need to make sure we don't change the
9738 * meaning of any possible other copies of map.
9740 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9743 struct isl_basic_map
*bmap
;
9747 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9749 for (i
= 0; i
< map
->n
; ++i
) {
9750 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9753 isl_basic_map_free(map
->p
[i
]);
9757 map
= sort_and_remove_duplicates(map
);
9759 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9766 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9768 return set_from_map(isl_map_normalize(set_to_map(set
)));
9771 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9772 __isl_keep isl_map
*map2
)
9778 return isl_bool_error
;
9781 return isl_bool_true
;
9782 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9783 return isl_bool_false
;
9785 map1
= isl_map_copy(map1
);
9786 map2
= isl_map_copy(map2
);
9787 map1
= isl_map_normalize(map1
);
9788 map2
= isl_map_normalize(map2
);
9791 equal
= map1
->n
== map2
->n
;
9792 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9793 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9803 return isl_bool_error
;
9806 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9807 __isl_keep isl_set
*set2
)
9809 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9812 /* Return the basic maps in "map" as a list.
9814 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9815 __isl_keep isl_map
*map
)
9819 isl_basic_map_list
*list
;
9823 ctx
= isl_map_get_ctx(map
);
9824 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9826 for (i
= 0; i
< map
->n
; ++i
) {
9827 isl_basic_map
*bmap
;
9829 bmap
= isl_basic_map_copy(map
->p
[i
]);
9830 list
= isl_basic_map_list_add(list
, bmap
);
9836 /* Return the intersection of the elements in the non-empty list "list".
9837 * All elements are assumed to live in the same space.
9839 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9840 __isl_take isl_basic_map_list
*list
)
9843 isl_basic_map
*bmap
;
9847 n
= isl_basic_map_list_n_basic_map(list
);
9849 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9850 "expecting non-empty list", goto error
);
9852 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9853 for (i
= 1; i
< n
; ++i
) {
9854 isl_basic_map
*bmap_i
;
9856 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9857 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9860 isl_basic_map_list_free(list
);
9863 isl_basic_map_list_free(list
);
9867 /* Return the intersection of the elements in the non-empty list "list".
9868 * All elements are assumed to live in the same space.
9870 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9871 __isl_take isl_basic_set_list
*list
)
9873 return isl_basic_map_list_intersect(list
);
9876 /* Return the union of the elements of "list".
9877 * The list is required to have at least one element.
9879 __isl_give isl_set
*isl_basic_set_list_union(
9880 __isl_take isl_basic_set_list
*list
)
9884 isl_basic_set
*bset
;
9889 n
= isl_basic_set_list_n_basic_set(list
);
9891 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9892 "expecting non-empty list", goto error
);
9894 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9895 space
= isl_basic_set_get_space(bset
);
9896 isl_basic_set_free(bset
);
9898 set
= isl_set_alloc_space(space
, n
, 0);
9899 for (i
= 0; i
< n
; ++i
) {
9900 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9901 set
= isl_set_add_basic_set(set
, bset
);
9904 isl_basic_set_list_free(list
);
9907 isl_basic_set_list_free(list
);
9911 /* Return the union of the elements in the non-empty list "list".
9912 * All elements are assumed to live in the same space.
9914 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9921 n
= isl_set_list_n_set(list
);
9923 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9924 "expecting non-empty list", goto error
);
9926 set
= isl_set_list_get_set(list
, 0);
9927 for (i
= 1; i
< n
; ++i
) {
9930 set_i
= isl_set_list_get_set(list
, i
);
9931 set
= isl_set_union(set
, set_i
);
9934 isl_set_list_free(list
);
9937 isl_set_list_free(list
);
9941 __isl_give isl_basic_map
*isl_basic_map_product(
9942 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9944 isl_space
*space_result
= NULL
;
9945 struct isl_basic_map
*bmap
;
9946 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9947 struct isl_dim_map
*dim_map1
, *dim_map2
;
9949 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9951 space_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9952 isl_space_copy(bmap2
->dim
));
9954 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9955 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9956 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9957 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9958 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9960 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9961 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9962 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9963 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9964 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9965 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9966 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9967 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9968 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9969 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9970 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9972 bmap
= isl_basic_map_alloc_space(space_result
,
9973 bmap1
->n_div
+ bmap2
->n_div
,
9974 bmap1
->n_eq
+ bmap2
->n_eq
,
9975 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9976 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9977 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9978 bmap
= isl_basic_map_simplify(bmap
);
9979 return isl_basic_map_finalize(bmap
);
9981 isl_basic_map_free(bmap1
);
9982 isl_basic_map_free(bmap2
);
9986 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9987 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9989 isl_basic_map
*prod
;
9991 prod
= isl_basic_map_product(bmap1
, bmap2
);
9992 prod
= isl_basic_map_flatten(prod
);
9996 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9997 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9999 return isl_basic_map_flat_range_product(bset1
, bset2
);
10002 __isl_give isl_basic_map
*isl_basic_map_domain_product(
10003 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10005 isl_space
*space_result
= NULL
;
10006 isl_basic_map
*bmap
;
10007 unsigned in1
, in2
, out
, nparam
, total
, pos
;
10008 struct isl_dim_map
*dim_map1
, *dim_map2
;
10010 if (!bmap1
|| !bmap2
)
10013 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
10014 isl_space_copy(bmap2
->dim
));
10016 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10017 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
10018 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10019 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10021 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
10022 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10023 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10024 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10025 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10026 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10027 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
10028 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
10029 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
10030 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
10031 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10033 bmap
= isl_basic_map_alloc_space(space_result
,
10034 bmap1
->n_div
+ bmap2
->n_div
,
10035 bmap1
->n_eq
+ bmap2
->n_eq
,
10036 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10037 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10038 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10039 bmap
= isl_basic_map_simplify(bmap
);
10040 return isl_basic_map_finalize(bmap
);
10042 isl_basic_map_free(bmap1
);
10043 isl_basic_map_free(bmap2
);
10047 __isl_give isl_basic_map
*isl_basic_map_range_product(
10048 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10051 isl_space
*space_result
= NULL
;
10052 isl_basic_map
*bmap
;
10053 unsigned in
, out1
, out2
, nparam
, total
, pos
;
10054 struct isl_dim_map
*dim_map1
, *dim_map2
;
10056 rational
= isl_basic_map_is_rational(bmap1
);
10057 if (rational
>= 0 && rational
)
10058 rational
= isl_basic_map_is_rational(bmap2
);
10059 if (!bmap1
|| !bmap2
|| rational
< 0)
10062 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
10065 space_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
10066 isl_space_copy(bmap2
->dim
));
10068 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10069 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10070 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
10071 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10073 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
10074 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10075 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10076 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10077 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10078 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10079 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
10080 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
10081 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10082 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10083 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10085 bmap
= isl_basic_map_alloc_space(space_result
,
10086 bmap1
->n_div
+ bmap2
->n_div
,
10087 bmap1
->n_eq
+ bmap2
->n_eq
,
10088 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10089 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10090 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10092 bmap
= isl_basic_map_set_rational(bmap
);
10093 bmap
= isl_basic_map_simplify(bmap
);
10094 return isl_basic_map_finalize(bmap
);
10096 isl_basic_map_free(bmap1
);
10097 isl_basic_map_free(bmap2
);
10101 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
10102 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10104 isl_basic_map
*prod
;
10106 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10107 prod
= isl_basic_map_flatten_range(prod
);
10111 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10112 * and collect the results.
10113 * The result live in the space obtained by calling "space_product"
10114 * on the spaces of "map1" and "map2".
10115 * If "remove_duplicates" is set then the result may contain duplicates
10116 * (even if the inputs do not) and so we try and remove the obvious
10119 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10120 __isl_take isl_map
*map2
,
10121 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10122 __isl_take isl_space
*right
),
10123 __isl_give isl_basic_map
*(*basic_map_product
)(
10124 __isl_take isl_basic_map
*left
,
10125 __isl_take isl_basic_map
*right
),
10126 int remove_duplicates
)
10128 unsigned flags
= 0;
10129 struct isl_map
*result
;
10133 m
= isl_map_has_equal_params(map1
, map2
);
10137 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10138 "parameters don't match", goto error
);
10140 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10141 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10142 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10144 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10145 isl_space_copy(map2
->dim
)),
10146 map1
->n
* map2
->n
, flags
);
10149 for (i
= 0; i
< map1
->n
; ++i
)
10150 for (j
= 0; j
< map2
->n
; ++j
) {
10151 struct isl_basic_map
*part
;
10152 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
10153 isl_basic_map_copy(map2
->p
[j
]));
10154 if (isl_basic_map_is_empty(part
))
10155 isl_basic_map_free(part
);
10157 result
= isl_map_add_basic_map(result
, part
);
10161 if (remove_duplicates
)
10162 result
= isl_map_remove_obvious_duplicates(result
);
10163 isl_map_free(map1
);
10164 isl_map_free(map2
);
10167 isl_map_free(map1
);
10168 isl_map_free(map2
);
10172 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
10174 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
10175 __isl_take isl_map
*map2
)
10177 return map_product(map1
, map2
, &isl_space_product
,
10178 &isl_basic_map_product
, 0);
10181 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
10182 __isl_take isl_map
*map2
)
10184 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
10187 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
10189 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
10190 __isl_take isl_map
*map2
)
10194 prod
= isl_map_product(map1
, map2
);
10195 prod
= isl_map_flatten(prod
);
10199 /* Given two set A and B, construct its Cartesian product A x B.
10201 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10203 return isl_map_range_product(set1
, set2
);
10206 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10207 __isl_take isl_set
*set2
)
10209 return isl_map_flat_range_product(set1
, set2
);
10212 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10214 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10215 __isl_take isl_map
*map2
)
10217 return map_product(map1
, map2
, &isl_space_domain_product
,
10218 &isl_basic_map_domain_product
, 1);
10221 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10223 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10224 __isl_take isl_map
*map2
)
10226 return map_product(map1
, map2
, &isl_space_range_product
,
10227 &isl_basic_map_range_product
, 1);
10230 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10231 __isl_take isl_map
*map2
)
10233 return isl_map_align_params_map_map_and(map1
, map2
,
10234 &map_domain_product_aligned
);
10237 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10238 __isl_take isl_map
*map2
)
10240 return isl_map_align_params_map_map_and(map1
, map2
,
10241 &map_range_product_aligned
);
10244 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10246 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10249 int total1
, keep1
, total2
, keep2
;
10253 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10254 !isl_space_range_is_wrapping(map
->dim
))
10255 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10256 "not a product", return isl_map_free(map
));
10258 space
= isl_map_get_space(map
);
10259 total1
= isl_space_dim(space
, isl_dim_in
);
10260 total2
= isl_space_dim(space
, isl_dim_out
);
10261 space
= isl_space_factor_domain(space
);
10262 keep1
= isl_space_dim(space
, isl_dim_in
);
10263 keep2
= isl_space_dim(space
, isl_dim_out
);
10264 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10265 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10266 map
= isl_map_reset_space(map
, space
);
10271 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10273 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10276 int total1
, keep1
, total2
, keep2
;
10280 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10281 !isl_space_range_is_wrapping(map
->dim
))
10282 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10283 "not a product", return isl_map_free(map
));
10285 space
= isl_map_get_space(map
);
10286 total1
= isl_space_dim(space
, isl_dim_in
);
10287 total2
= isl_space_dim(space
, isl_dim_out
);
10288 space
= isl_space_factor_range(space
);
10289 keep1
= isl_space_dim(space
, isl_dim_in
);
10290 keep2
= isl_space_dim(space
, isl_dim_out
);
10291 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10292 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10293 map
= isl_map_reset_space(map
, space
);
10298 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10300 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10307 if (!isl_space_domain_is_wrapping(map
->dim
))
10308 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10309 "domain is not a product", return isl_map_free(map
));
10311 space
= isl_map_get_space(map
);
10312 total
= isl_space_dim(space
, isl_dim_in
);
10313 space
= isl_space_domain_factor_domain(space
);
10314 keep
= isl_space_dim(space
, isl_dim_in
);
10315 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10316 map
= isl_map_reset_space(map
, space
);
10321 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10323 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10330 if (!isl_space_domain_is_wrapping(map
->dim
))
10331 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10332 "domain is not a product", return isl_map_free(map
));
10334 space
= isl_map_get_space(map
);
10335 total
= isl_space_dim(space
, isl_dim_in
);
10336 space
= isl_space_domain_factor_range(space
);
10337 keep
= isl_space_dim(space
, isl_dim_in
);
10338 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10339 map
= isl_map_reset_space(map
, space
);
10344 /* Given a map A -> [B -> C], extract the map A -> B.
10346 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10353 if (!isl_space_range_is_wrapping(map
->dim
))
10354 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10355 "range is not a product", return isl_map_free(map
));
10357 space
= isl_map_get_space(map
);
10358 total
= isl_space_dim(space
, isl_dim_out
);
10359 space
= isl_space_range_factor_domain(space
);
10360 keep
= isl_space_dim(space
, isl_dim_out
);
10361 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10362 map
= isl_map_reset_space(map
, space
);
10367 /* Given a map A -> [B -> C], extract the map A -> C.
10369 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10376 if (!isl_space_range_is_wrapping(map
->dim
))
10377 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10378 "range is not a product", return isl_map_free(map
));
10380 space
= isl_map_get_space(map
);
10381 total
= isl_space_dim(space
, isl_dim_out
);
10382 space
= isl_space_range_factor_range(space
);
10383 keep
= isl_space_dim(space
, isl_dim_out
);
10384 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10385 map
= isl_map_reset_space(map
, space
);
10390 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10392 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10393 __isl_take isl_map
*map2
)
10397 prod
= isl_map_domain_product(map1
, map2
);
10398 prod
= isl_map_flatten_domain(prod
);
10402 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10404 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10405 __isl_take isl_map
*map2
)
10409 prod
= isl_map_range_product(map1
, map2
);
10410 prod
= isl_map_flatten_range(prod
);
10414 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10417 uint32_t hash
= isl_hash_init();
10422 bmap
= isl_basic_map_copy(bmap
);
10423 bmap
= isl_basic_map_normalize(bmap
);
10426 total
= isl_basic_map_total_dim(bmap
);
10427 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10428 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10430 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10431 isl_hash_hash(hash
, c_hash
);
10433 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10434 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10436 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10437 isl_hash_hash(hash
, c_hash
);
10439 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10440 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10442 if (isl_int_is_zero(bmap
->div
[i
][0]))
10444 isl_hash_byte(hash
, i
& 0xFF);
10445 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10446 isl_hash_hash(hash
, c_hash
);
10448 isl_basic_map_free(bmap
);
10452 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10454 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10457 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10464 map
= isl_map_copy(map
);
10465 map
= isl_map_normalize(map
);
10469 hash
= isl_hash_init();
10470 for (i
= 0; i
< map
->n
; ++i
) {
10471 uint32_t bmap_hash
;
10472 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10473 isl_hash_hash(hash
, bmap_hash
);
10481 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10483 return isl_map_get_hash(set_to_map(set
));
10486 /* Return the number of basic maps in the (current) representation of "map".
10488 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10490 return map
? map
->n
: 0;
10493 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10495 return set
? set
->n
: 0;
10498 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10499 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10504 return isl_stat_error
;
10506 for (i
= 0; i
< map
->n
; ++i
)
10507 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10508 return isl_stat_error
;
10510 return isl_stat_ok
;
10513 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10514 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10519 return isl_stat_error
;
10521 for (i
= 0; i
< set
->n
; ++i
)
10522 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10523 return isl_stat_error
;
10525 return isl_stat_ok
;
10528 /* Return a list of basic sets, the union of which is equal to "set".
10530 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10531 __isl_keep isl_set
*set
)
10534 isl_basic_set_list
*list
;
10539 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10540 for (i
= 0; i
< set
->n
; ++i
) {
10541 isl_basic_set
*bset
;
10543 bset
= isl_basic_set_copy(set
->p
[i
]);
10544 list
= isl_basic_set_list_add(list
, bset
);
10550 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10557 bset
= isl_basic_set_cow(bset
);
10561 space
= isl_basic_set_get_space(bset
);
10562 space
= isl_space_lift(space
, bset
->n_div
);
10565 isl_space_free(bset
->dim
);
10567 bset
->extra
-= bset
->n_div
;
10570 bset
= isl_basic_set_finalize(bset
);
10574 isl_basic_set_free(bset
);
10578 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10584 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10589 set
= isl_set_cow(set
);
10593 n_div
= set
->p
[0]->n_div
;
10594 space
= isl_set_get_space(set
);
10595 space
= isl_space_lift(space
, n_div
);
10598 isl_space_free(set
->dim
);
10601 for (i
= 0; i
< set
->n
; ++i
) {
10602 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10613 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10621 dim
= isl_basic_set_total_dim(bset
);
10622 size
+= bset
->n_eq
* (1 + dim
);
10623 size
+= bset
->n_ineq
* (1 + dim
);
10624 size
+= bset
->n_div
* (2 + dim
);
10629 int isl_set_size(__isl_keep isl_set
*set
)
10637 for (i
= 0; i
< set
->n
; ++i
)
10638 size
+= isl_basic_set_size(set
->p
[i
]);
10643 /* Check if there is any lower bound (if lower == 0) and/or upper
10644 * bound (if upper == 0) on the specified dim.
10646 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10647 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10651 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10652 return isl_bool_error
;
10654 pos
+= isl_basic_map_offset(bmap
, type
);
10656 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10657 if (isl_int_is_zero(bmap
->div
[i
][0]))
10659 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10660 return isl_bool_true
;
10663 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10664 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10665 return isl_bool_true
;
10667 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10668 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10675 return lower
&& upper
;
10678 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10679 enum isl_dim_type type
, unsigned pos
)
10681 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10684 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10685 enum isl_dim_type type
, unsigned pos
)
10687 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10690 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10691 enum isl_dim_type type
, unsigned pos
)
10693 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10696 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10697 enum isl_dim_type type
, unsigned pos
)
10702 return isl_bool_error
;
10704 for (i
= 0; i
< map
->n
; ++i
) {
10706 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10707 if (bounded
< 0 || !bounded
)
10711 return isl_bool_true
;
10714 /* Return true if the specified dim is involved in both an upper bound
10715 * and a lower bound.
10717 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10718 enum isl_dim_type type
, unsigned pos
)
10720 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10723 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10725 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10726 enum isl_dim_type type
, unsigned pos
,
10727 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10728 enum isl_dim_type type
, unsigned pos
))
10733 return isl_bool_error
;
10735 for (i
= 0; i
< map
->n
; ++i
) {
10737 bounded
= fn(map
->p
[i
], type
, pos
);
10738 if (bounded
< 0 || bounded
)
10742 return isl_bool_false
;
10745 /* Return 1 if the specified dim is involved in any lower bound.
10747 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10748 enum isl_dim_type type
, unsigned pos
)
10750 return has_any_bound(set
, type
, pos
,
10751 &isl_basic_map_dim_has_lower_bound
);
10754 /* Return 1 if the specified dim is involved in any upper bound.
10756 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10757 enum isl_dim_type type
, unsigned pos
)
10759 return has_any_bound(set
, type
, pos
,
10760 &isl_basic_map_dim_has_upper_bound
);
10763 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10765 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10766 enum isl_dim_type type
, unsigned pos
,
10767 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10768 enum isl_dim_type type
, unsigned pos
))
10773 return isl_bool_error
;
10775 for (i
= 0; i
< map
->n
; ++i
) {
10777 bounded
= fn(map
->p
[i
], type
, pos
);
10778 if (bounded
< 0 || !bounded
)
10782 return isl_bool_true
;
10785 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10787 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10788 enum isl_dim_type type
, unsigned pos
)
10790 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10793 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10795 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10796 enum isl_dim_type type
, unsigned pos
)
10798 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10801 /* For each of the "n" variables starting at "first", determine
10802 * the sign of the variable and put the results in the first "n"
10803 * elements of the array "signs".
10805 * 1 means that the variable is non-negative
10806 * -1 means that the variable is non-positive
10807 * 0 means the variable attains both positive and negative values.
10809 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10810 unsigned first
, unsigned n
, int *signs
)
10812 isl_vec
*bound
= NULL
;
10813 struct isl_tab
*tab
= NULL
;
10814 struct isl_tab_undo
*snap
;
10817 if (!bset
|| !signs
)
10818 return isl_stat_error
;
10820 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10821 tab
= isl_tab_from_basic_set(bset
, 0);
10822 if (!bound
|| !tab
)
10825 isl_seq_clr(bound
->el
, bound
->size
);
10826 isl_int_set_si(bound
->el
[0], -1);
10828 snap
= isl_tab_snap(tab
);
10829 for (i
= 0; i
< n
; ++i
) {
10832 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10833 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10835 empty
= tab
->empty
;
10836 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10837 if (isl_tab_rollback(tab
, snap
) < 0)
10845 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10846 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10848 empty
= tab
->empty
;
10849 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10850 if (isl_tab_rollback(tab
, snap
) < 0)
10853 signs
[i
] = empty
? -1 : 0;
10857 isl_vec_free(bound
);
10858 return isl_stat_ok
;
10861 isl_vec_free(bound
);
10862 return isl_stat_error
;
10865 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10866 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10868 if (!bset
|| !signs
)
10869 return isl_stat_error
;
10870 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10871 return isl_stat_error
);
10873 first
+= pos(bset
->dim
, type
) - 1;
10874 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10877 /* Is it possible for the integer division "div" to depend (possibly
10878 * indirectly) on any output dimensions?
10880 * If the div is undefined, then we conservatively assume that it
10881 * may depend on them.
10882 * Otherwise, we check if it actually depends on them or on any integer
10883 * divisions that may depend on them.
10885 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10888 unsigned n_out
, o_out
;
10889 unsigned n_div
, o_div
;
10891 if (isl_int_is_zero(bmap
->div
[div
][0]))
10892 return isl_bool_true
;
10894 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10895 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10897 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10898 return isl_bool_true
;
10900 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10901 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10903 for (i
= 0; i
< n_div
; ++i
) {
10904 isl_bool may_involve
;
10906 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10908 may_involve
= div_may_involve_output(bmap
, i
);
10909 if (may_involve
< 0 || may_involve
)
10910 return may_involve
;
10913 return isl_bool_false
;
10916 /* Return the first integer division of "bmap" in the range
10917 * [first, first + n[ that may depend on any output dimensions and
10918 * that has a non-zero coefficient in "c" (where the first coefficient
10919 * in "c" corresponds to integer division "first").
10921 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10922 isl_int
*c
, int first
, int n
)
10929 for (k
= first
; k
< first
+ n
; ++k
) {
10930 isl_bool may_involve
;
10932 if (isl_int_is_zero(c
[k
]))
10934 may_involve
= div_may_involve_output(bmap
, k
);
10935 if (may_involve
< 0)
10944 /* Look for a pair of inequality constraints in "bmap" of the form
10946 * -l + i >= 0 or i >= l
10948 * n + l - i >= 0 or i <= l + n
10950 * with n < "m" and i the output dimension at position "pos".
10951 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10952 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10953 * and earlier output dimensions, as well as integer divisions that do
10954 * not involve any of the output dimensions.
10956 * Return the index of the first inequality constraint or bmap->n_ineq
10957 * if no such pair can be found.
10959 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10960 int pos
, isl_int m
)
10965 unsigned n_div
, o_div
;
10966 unsigned n_out
, o_out
;
10972 ctx
= isl_basic_map_get_ctx(bmap
);
10973 total
= isl_basic_map_total_dim(bmap
);
10974 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10975 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10976 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10977 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10978 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10979 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10981 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10982 n_out
- (pos
+ 1)) != -1)
10984 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10987 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10988 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10991 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10992 bmap
->ineq
[j
] + 1, total
))
10996 if (j
>= bmap
->n_ineq
)
10998 isl_int_add(bmap
->ineq
[i
][0],
10999 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
11000 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
11001 isl_int_sub(bmap
->ineq
[i
][0],
11002 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
11005 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
11011 return bmap
->n_ineq
;
11014 /* Return the index of the equality of "bmap" that defines
11015 * the output dimension "pos" in terms of earlier dimensions.
11016 * The equality may also involve integer divisions, as long
11017 * as those integer divisions are defined in terms of
11018 * parameters or input dimensions.
11019 * In this case, *div is set to the number of integer divisions and
11020 * *ineq is set to the number of inequality constraints (provided
11021 * div and ineq are not NULL).
11023 * The equality may also involve a single integer division involving
11024 * the output dimensions (typically only output dimension "pos") as
11025 * long as the coefficient of output dimension "pos" is 1 or -1 and
11026 * there is a pair of constraints i >= l and i <= l + n, with i referring
11027 * to output dimension "pos", l an expression involving only earlier
11028 * dimensions and n smaller than the coefficient of the integer division
11029 * in the equality. In this case, the output dimension can be defined
11030 * in terms of a modulo expression that does not involve the integer division.
11031 * *div is then set to this single integer division and
11032 * *ineq is set to the index of constraint i >= l.
11034 * Return bmap->n_eq if there is no such equality.
11035 * Return -1 on error.
11037 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
11038 int pos
, int *div
, int *ineq
)
11041 unsigned n_out
, o_out
;
11042 unsigned n_div
, o_div
;
11047 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11048 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
11049 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11050 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11053 *ineq
= bmap
->n_ineq
;
11056 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
11057 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
11059 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
11060 n_out
- (pos
+ 1)) != -1)
11062 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11066 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
11067 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
11069 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11070 k
+ 1, n_div
- (k
+1)) < n_div
)
11072 l
= find_modulo_constraint_pair(bmap
, pos
,
11073 bmap
->eq
[j
][o_div
+ k
]);
11076 if (l
>= bmap
->n_ineq
)
11088 /* Check if the given basic map is obviously single-valued.
11089 * In particular, for each output dimension, check that there is
11090 * an equality that defines the output dimension in terms of
11091 * earlier dimensions.
11093 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11099 return isl_bool_error
;
11101 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11103 for (i
= 0; i
< n_out
; ++i
) {
11106 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11109 return isl_bool_error
;
11110 if (eq
>= bmap
->n_eq
)
11111 return isl_bool_false
;
11114 return isl_bool_true
;
11117 /* Check if the given basic map is single-valued.
11118 * We simply compute
11122 * and check if the result is a subset of the identity mapping.
11124 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11127 isl_basic_map
*test
;
11131 sv
= isl_basic_map_plain_is_single_valued(bmap
);
11135 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
11136 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
11138 space
= isl_basic_map_get_space(bmap
);
11139 space
= isl_space_map_from_set(isl_space_range(space
));
11140 id
= isl_basic_map_identity(space
);
11142 sv
= isl_basic_map_is_subset(test
, id
);
11144 isl_basic_map_free(test
);
11145 isl_basic_map_free(id
);
11150 /* Check if the given map is obviously single-valued.
11152 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
11155 return isl_bool_error
;
11157 return isl_bool_true
;
11159 return isl_bool_false
;
11161 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
11164 /* Check if the given map is single-valued.
11165 * We simply compute
11169 * and check if the result is a subset of the identity mapping.
11171 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
11178 sv
= isl_map_plain_is_single_valued(map
);
11182 test
= isl_map_reverse(isl_map_copy(map
));
11183 test
= isl_map_apply_range(test
, isl_map_copy(map
));
11185 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
11186 id
= isl_map_identity(dim
);
11188 sv
= isl_map_is_subset(test
, id
);
11190 isl_map_free(test
);
11196 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
11200 map
= isl_map_copy(map
);
11201 map
= isl_map_reverse(map
);
11202 in
= isl_map_is_single_valued(map
);
11208 /* Check if the given map is obviously injective.
11210 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11214 map
= isl_map_copy(map
);
11215 map
= isl_map_reverse(map
);
11216 in
= isl_map_plain_is_single_valued(map
);
11222 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11226 sv
= isl_map_is_single_valued(map
);
11230 return isl_map_is_injective(map
);
11233 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11235 return isl_map_is_single_valued(set_to_map(set
));
11238 /* Does "map" only map elements to themselves?
11240 * If the domain and range spaces are different, then "map"
11241 * is considered not to be an identity relation, even if it is empty.
11242 * Otherwise, construct the maximal identity relation and
11243 * check whether "map" is a subset of this relation.
11245 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11249 isl_bool equal
, is_identity
;
11251 space
= isl_map_get_space(map
);
11252 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11253 isl_space_free(space
);
11254 if (equal
< 0 || !equal
)
11257 id
= isl_map_identity(isl_map_get_space(map
));
11258 is_identity
= isl_map_is_subset(map
, id
);
11261 return is_identity
;
11264 int isl_map_is_translation(__isl_keep isl_map
*map
)
11269 delta
= isl_map_deltas(isl_map_copy(map
));
11270 ok
= isl_set_is_singleton(delta
);
11271 isl_set_free(delta
);
11276 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11278 if (isl_seq_first_non_zero(p
, pos
) != -1)
11280 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11285 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11292 return isl_bool_error
;
11294 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11295 return isl_bool_false
;
11297 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11298 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11299 for (j
= 0; j
< nvar
; ++j
) {
11300 int lower
= 0, upper
= 0;
11301 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11302 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11304 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11305 return isl_bool_false
;
11308 if (i
< bset
->n_eq
)
11310 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11311 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11313 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11314 return isl_bool_false
;
11315 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11320 if (!lower
|| !upper
)
11321 return isl_bool_false
;
11324 return isl_bool_true
;
11327 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11330 return isl_bool_error
;
11332 return isl_bool_false
;
11334 return isl_basic_set_is_box(set
->p
[0]);
11337 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11340 return isl_bool_error
;
11342 return isl_space_is_wrapping(bset
->dim
);
11345 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11348 return isl_bool_error
;
11350 return isl_space_is_wrapping(set
->dim
);
11353 /* Modify the space of "map" through a call to "change".
11354 * If "can_change" is set (not NULL), then first call it to check
11355 * if the modification is allowed, printing the error message "cannot_change"
11358 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11359 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11360 const char *cannot_change
,
11361 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11369 ok
= can_change
? can_change(map
) : isl_bool_true
;
11371 return isl_map_free(map
);
11373 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11374 return isl_map_free(map
));
11376 space
= change(isl_map_get_space(map
));
11377 map
= isl_map_reset_space(map
, space
);
11382 /* Is the domain of "map" a wrapped relation?
11384 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11387 return isl_bool_error
;
11389 return isl_space_domain_is_wrapping(map
->dim
);
11392 /* Does "map" have a wrapped relation in both domain and range?
11394 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
11396 return isl_space_is_product(isl_map_peek_space(map
));
11399 /* Is the range of "map" a wrapped relation?
11401 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11404 return isl_bool_error
;
11406 return isl_space_range_is_wrapping(map
->dim
);
11409 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11411 bmap
= isl_basic_map_cow(bmap
);
11415 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11419 bmap
= isl_basic_map_finalize(bmap
);
11421 return bset_from_bmap(bmap
);
11423 isl_basic_map_free(bmap
);
11427 /* Given a map A -> B, return the set (A -> B).
11429 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11431 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11434 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11436 bset
= isl_basic_set_cow(bset
);
11440 bset
->dim
= isl_space_unwrap(bset
->dim
);
11444 bset
= isl_basic_set_finalize(bset
);
11446 return bset_to_bmap(bset
);
11448 isl_basic_set_free(bset
);
11452 /* Given a set (A -> B), return the map A -> B.
11453 * Error out if "set" is not of the form (A -> B).
11455 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11457 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11458 "not a wrapping set", &isl_space_unwrap
);
11461 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11462 enum isl_dim_type type
)
11467 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11470 bmap
= isl_basic_map_cow(bmap
);
11474 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11478 bmap
= isl_basic_map_finalize(bmap
);
11482 isl_basic_map_free(bmap
);
11486 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11487 enum isl_dim_type type
)
11494 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11497 map
= isl_map_cow(map
);
11501 for (i
= 0; i
< map
->n
; ++i
) {
11502 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11506 map
->dim
= isl_space_reset(map
->dim
, type
);
11516 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11521 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11524 bmap
= isl_basic_map_cow(bmap
);
11528 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11532 bmap
= isl_basic_map_finalize(bmap
);
11536 isl_basic_map_free(bmap
);
11540 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11542 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11545 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11546 __isl_take isl_basic_map
*bmap
)
11551 if (!bmap
->dim
->nested
[0])
11554 bmap
= isl_basic_map_cow(bmap
);
11558 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11562 bmap
= isl_basic_map_finalize(bmap
);
11566 isl_basic_map_free(bmap
);
11570 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11571 __isl_take isl_basic_map
*bmap
)
11576 if (!bmap
->dim
->nested
[1])
11579 bmap
= isl_basic_map_cow(bmap
);
11583 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11587 bmap
= isl_basic_map_finalize(bmap
);
11591 isl_basic_map_free(bmap
);
11595 /* Remove any internal structure from the spaces of domain and range of "map".
11597 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11602 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11605 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11608 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11610 return set_from_map(isl_map_flatten(set_to_map(set
)));
11613 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11615 isl_space
*space
, *flat_space
;
11618 space
= isl_set_get_space(set
);
11619 flat_space
= isl_space_flatten(isl_space_copy(space
));
11620 map
= isl_map_identity(isl_space_join(isl_space_reverse(space
),
11622 map
= isl_map_intersect_domain(map
, set
);
11627 /* Remove any internal structure from the space of the domain of "map".
11629 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11634 if (!map
->dim
->nested
[0])
11637 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11640 /* Remove any internal structure from the space of the range of "map".
11642 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11647 if (!map
->dim
->nested
[1])
11650 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11653 /* Reorder the dimensions of "bmap" according to the given dim_map
11654 * and set the dimension specification to "space" and
11655 * perform Gaussian elimination on the result.
11657 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11658 __isl_take isl_space
*space
, __isl_take
struct isl_dim_map
*dim_map
)
11660 isl_basic_map
*res
;
11664 if (!bmap
|| !space
|| !dim_map
)
11667 flags
= bmap
->flags
;
11668 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11669 ISL_FL_CLR(flags
, ISL_BASIC_MAP_SORTED
);
11670 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11671 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11672 res
= isl_basic_map_alloc_space(space
, n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11673 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11675 res
->flags
= flags
;
11676 res
= isl_basic_map_gauss(res
, NULL
);
11677 res
= isl_basic_map_finalize(res
);
11681 isl_basic_map_free(bmap
);
11682 isl_space_free(space
);
11686 /* Reorder the dimensions of "map" according to given reordering.
11688 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11689 __isl_take isl_reordering
*r
)
11692 struct isl_dim_map
*dim_map
;
11694 map
= isl_map_cow(map
);
11695 dim_map
= isl_dim_map_from_reordering(r
);
11696 if (!map
|| !r
|| !dim_map
)
11699 for (i
= 0; i
< map
->n
; ++i
) {
11700 struct isl_dim_map
*dim_map_i
;
11703 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11705 space
= isl_reordering_get_space(r
);
11706 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
], space
, dim_map_i
);
11712 map
= isl_map_reset_space(map
, isl_reordering_get_space(r
));
11713 map
= isl_map_unmark_normalized(map
);
11715 isl_reordering_free(r
);
11721 isl_reordering_free(r
);
11725 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11726 __isl_take isl_reordering
*r
)
11728 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11731 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11732 __isl_take isl_space
*model
)
11737 if (!map
|| !model
)
11740 ctx
= isl_space_get_ctx(model
);
11741 if (!isl_space_has_named_params(model
))
11742 isl_die(ctx
, isl_error_invalid
,
11743 "model has unnamed parameters", goto error
);
11744 if (isl_map_check_named_params(map
) < 0)
11746 aligned
= isl_map_space_has_equal_params(map
, model
);
11750 isl_reordering
*exp
;
11752 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11753 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11754 map
= isl_map_realign(map
, exp
);
11757 isl_space_free(model
);
11760 isl_space_free(model
);
11765 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11766 __isl_take isl_space
*model
)
11768 return isl_map_align_params(set
, model
);
11771 /* Align the parameters of "bmap" to those of "model", introducing
11772 * additional parameters if needed.
11774 __isl_give isl_basic_map
*isl_basic_map_align_params(
11775 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11778 isl_bool equal_params
;
11780 if (!bmap
|| !model
)
11783 ctx
= isl_space_get_ctx(model
);
11784 if (!isl_space_has_named_params(model
))
11785 isl_die(ctx
, isl_error_invalid
,
11786 "model has unnamed parameters", goto error
);
11787 if (isl_basic_map_check_named_params(bmap
) < 0)
11789 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11790 if (equal_params
< 0)
11792 if (!equal_params
) {
11793 isl_reordering
*exp
;
11794 struct isl_dim_map
*dim_map
;
11796 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11797 exp
= isl_reordering_extend_space(exp
,
11798 isl_basic_map_get_space(bmap
));
11799 dim_map
= isl_dim_map_from_reordering(exp
);
11800 bmap
= isl_basic_map_realign(bmap
,
11801 isl_reordering_get_space(exp
),
11802 isl_dim_map_extend(dim_map
, bmap
));
11803 isl_reordering_free(exp
);
11807 isl_space_free(model
);
11810 isl_space_free(model
);
11811 isl_basic_map_free(bmap
);
11815 /* Do "bset" and "space" have the same parameters?
11817 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11818 __isl_keep isl_space
*space
)
11820 isl_space
*bset_space
;
11822 bset_space
= isl_basic_set_peek_space(bset
);
11823 return isl_space_has_equal_params(bset_space
, space
);
11826 /* Do "map" and "space" have the same parameters?
11828 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11829 __isl_keep isl_space
*space
)
11831 isl_space
*map_space
;
11833 map_space
= isl_map_peek_space(map
);
11834 return isl_space_has_equal_params(map_space
, space
);
11837 /* Do "set" and "space" have the same parameters?
11839 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11840 __isl_keep isl_space
*space
)
11842 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11845 /* Align the parameters of "bset" to those of "model", introducing
11846 * additional parameters if needed.
11848 __isl_give isl_basic_set
*isl_basic_set_align_params(
11849 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11851 return isl_basic_map_align_params(bset
, model
);
11854 /* Drop all parameters not referenced by "map".
11856 __isl_give isl_map
*isl_map_drop_unused_params(__isl_take isl_map
*map
)
11860 if (isl_map_check_named_params(map
) < 0)
11861 return isl_map_free(map
);
11863 for (i
= isl_map_dim(map
, isl_dim_param
) - 1; i
>= 0; i
--) {
11866 involves
= isl_map_involves_dims(map
, isl_dim_param
, i
, 1);
11868 return isl_map_free(map
);
11870 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
11876 /* Drop all parameters not referenced by "set".
11878 __isl_give isl_set
*isl_set_drop_unused_params(
11879 __isl_take isl_set
*set
)
11881 return set_from_map(isl_map_drop_unused_params(set_to_map(set
)));
11884 /* Drop all parameters not referenced by "bmap".
11886 __isl_give isl_basic_map
*isl_basic_map_drop_unused_params(
11887 __isl_take isl_basic_map
*bmap
)
11891 if (isl_basic_map_check_named_params(bmap
) < 0)
11892 return isl_basic_map_free(bmap
);
11894 for (i
= isl_basic_map_dim(bmap
, isl_dim_param
) - 1; i
>= 0; i
--) {
11897 involves
= isl_basic_map_involves_dims(bmap
,
11898 isl_dim_param
, i
, 1);
11900 return isl_basic_map_free(bmap
);
11902 bmap
= isl_basic_map_drop(bmap
, isl_dim_param
, i
, 1);
11908 /* Drop all parameters not referenced by "bset".
11910 __isl_give isl_basic_set
*isl_basic_set_drop_unused_params(
11911 __isl_take isl_basic_set
*bset
)
11913 return bset_from_bmap(isl_basic_map_drop_unused_params(
11914 bset_to_bmap(bset
)));
11917 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11918 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11919 enum isl_dim_type c2
, enum isl_dim_type c3
,
11920 enum isl_dim_type c4
, enum isl_dim_type c5
)
11922 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11923 struct isl_mat
*mat
;
11929 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11930 isl_basic_map_total_dim(bmap
) + 1);
11933 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11934 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11935 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11936 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11937 isl_int_set(mat
->row
[i
][pos
],
11938 bmap
->eq
[i
][off
+ k
]);
11946 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11947 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11948 enum isl_dim_type c2
, enum isl_dim_type c3
,
11949 enum isl_dim_type c4
, enum isl_dim_type c5
)
11951 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11952 struct isl_mat
*mat
;
11958 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11959 isl_basic_map_total_dim(bmap
) + 1);
11962 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11963 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11964 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11965 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11966 isl_int_set(mat
->row
[i
][pos
],
11967 bmap
->ineq
[i
][off
+ k
]);
11975 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11976 __isl_take isl_space
*space
,
11977 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11978 enum isl_dim_type c2
, enum isl_dim_type c3
,
11979 enum isl_dim_type c4
, enum isl_dim_type c5
)
11981 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11982 isl_basic_map
*bmap
= NULL
;
11988 if (!space
|| !eq
|| !ineq
)
11991 if (eq
->n_col
!= ineq
->n_col
)
11992 isl_die(space
->ctx
, isl_error_invalid
,
11993 "equalities and inequalities matrices should have "
11994 "same number of columns", goto error
);
11996 total
= 1 + isl_space_dim(space
, isl_dim_all
);
11998 if (eq
->n_col
< total
)
11999 isl_die(space
->ctx
, isl_error_invalid
,
12000 "number of columns too small", goto error
);
12002 extra
= eq
->n_col
- total
;
12004 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), extra
,
12005 eq
->n_row
, ineq
->n_row
);
12008 for (i
= 0; i
< extra
; ++i
) {
12009 k
= isl_basic_map_alloc_div(bmap
);
12012 isl_int_set_si(bmap
->div
[k
][0], 0);
12014 for (i
= 0; i
< eq
->n_row
; ++i
) {
12015 l
= isl_basic_map_alloc_equality(bmap
);
12018 for (j
= 0, pos
= 0; j
< 5; ++j
) {
12019 int off
= isl_basic_map_offset(bmap
, c
[j
]);
12020 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
12021 isl_int_set(bmap
->eq
[l
][off
+ k
],
12027 for (i
= 0; i
< ineq
->n_row
; ++i
) {
12028 l
= isl_basic_map_alloc_inequality(bmap
);
12031 for (j
= 0, pos
= 0; j
< 5; ++j
) {
12032 int off
= isl_basic_map_offset(bmap
, c
[j
]);
12033 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
12034 isl_int_set(bmap
->ineq
[l
][off
+ k
],
12035 ineq
->row
[i
][pos
]);
12041 isl_space_free(space
);
12043 isl_mat_free(ineq
);
12045 bmap
= isl_basic_map_simplify(bmap
);
12046 return isl_basic_map_finalize(bmap
);
12048 isl_space_free(space
);
12050 isl_mat_free(ineq
);
12051 isl_basic_map_free(bmap
);
12055 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
12056 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
12057 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
12059 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
12060 c1
, c2
, c3
, c4
, isl_dim_in
);
12063 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
12064 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
12065 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
12067 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
12068 c1
, c2
, c3
, c4
, isl_dim_in
);
12071 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
12072 __isl_take isl_space
*dim
,
12073 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
12074 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
12076 isl_basic_map
*bmap
;
12077 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
12078 c1
, c2
, c3
, c4
, isl_dim_in
);
12079 return bset_from_bmap(bmap
);
12082 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
12085 return isl_bool_error
;
12087 return isl_space_can_zip(bmap
->dim
);
12090 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
12093 return isl_bool_error
;
12095 return isl_space_can_zip(map
->dim
);
12098 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
12099 * (A -> C) -> (B -> D).
12101 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
12110 if (!isl_basic_map_can_zip(bmap
))
12111 isl_die(bmap
->ctx
, isl_error_invalid
,
12112 "basic map cannot be zipped", goto error
);
12113 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
12114 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
12115 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
12116 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
12117 bmap
= isl_basic_map_cow(bmap
);
12118 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
12121 bmap
->dim
= isl_space_zip(bmap
->dim
);
12124 bmap
= isl_basic_map_mark_final(bmap
);
12127 isl_basic_map_free(bmap
);
12131 /* Given a map (A -> B) -> (C -> D), return the corresponding map
12132 * (A -> C) -> (B -> D).
12134 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
12141 if (!isl_map_can_zip(map
))
12142 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
12145 map
= isl_map_cow(map
);
12149 for (i
= 0; i
< map
->n
; ++i
) {
12150 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
12155 map
->dim
= isl_space_zip(map
->dim
);
12165 /* Can we apply isl_basic_map_curry to "bmap"?
12166 * That is, does it have a nested relation in its domain?
12168 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
12171 return isl_bool_error
;
12173 return isl_space_can_curry(bmap
->dim
);
12176 /* Can we apply isl_map_curry to "map"?
12177 * That is, does it have a nested relation in its domain?
12179 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
12182 return isl_bool_error
;
12184 return isl_space_can_curry(map
->dim
);
12187 /* Given a basic map (A -> B) -> C, return the corresponding basic map
12190 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
12196 if (!isl_basic_map_can_curry(bmap
))
12197 isl_die(bmap
->ctx
, isl_error_invalid
,
12198 "basic map cannot be curried", goto error
);
12199 bmap
= isl_basic_map_cow(bmap
);
12202 bmap
->dim
= isl_space_curry(bmap
->dim
);
12205 bmap
= isl_basic_map_mark_final(bmap
);
12208 isl_basic_map_free(bmap
);
12212 /* Given a map (A -> B) -> C, return the corresponding map
12215 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
12217 return isl_map_change_space(map
, &isl_map_can_curry
,
12218 "map cannot be curried", &isl_space_curry
);
12221 /* Can isl_map_range_curry be applied to "map"?
12222 * That is, does it have a nested relation in its range,
12223 * the domain of which is itself a nested relation?
12225 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
12228 return isl_bool_error
;
12230 return isl_space_can_range_curry(map
->dim
);
12233 /* Given a map A -> ((B -> C) -> D), return the corresponding map
12234 * A -> (B -> (C -> D)).
12236 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
12238 return isl_map_change_space(map
, &isl_map_can_range_curry
,
12239 "map range cannot be curried",
12240 &isl_space_range_curry
);
12243 /* Can we apply isl_basic_map_uncurry to "bmap"?
12244 * That is, does it have a nested relation in its domain?
12246 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
12249 return isl_bool_error
;
12251 return isl_space_can_uncurry(bmap
->dim
);
12254 /* Can we apply isl_map_uncurry to "map"?
12255 * That is, does it have a nested relation in its domain?
12257 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
12260 return isl_bool_error
;
12262 return isl_space_can_uncurry(map
->dim
);
12265 /* Given a basic map A -> (B -> C), return the corresponding basic map
12268 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12274 if (!isl_basic_map_can_uncurry(bmap
))
12275 isl_die(bmap
->ctx
, isl_error_invalid
,
12276 "basic map cannot be uncurried",
12277 return isl_basic_map_free(bmap
));
12278 bmap
= isl_basic_map_cow(bmap
);
12281 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12283 return isl_basic_map_free(bmap
);
12284 bmap
= isl_basic_map_mark_final(bmap
);
12288 /* Given a map A -> (B -> C), return the corresponding map
12291 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12293 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12294 "map cannot be uncurried", &isl_space_uncurry
);
12297 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12298 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12300 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12303 /* Construct a basic map where the given dimensions are equal to each other.
12305 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12306 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12308 isl_basic_map
*bmap
= NULL
;
12314 if (pos1
>= isl_space_dim(space
, type1
))
12315 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12316 "index out of bounds", goto error
);
12317 if (pos2
>= isl_space_dim(space
, type2
))
12318 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12319 "index out of bounds", goto error
);
12321 if (type1
== type2
&& pos1
== pos2
)
12322 return isl_basic_map_universe(space
);
12324 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12325 i
= isl_basic_map_alloc_equality(bmap
);
12328 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12329 pos1
+= isl_basic_map_offset(bmap
, type1
);
12330 pos2
+= isl_basic_map_offset(bmap
, type2
);
12331 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12332 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12333 bmap
= isl_basic_map_finalize(bmap
);
12334 isl_space_free(space
);
12337 isl_space_free(space
);
12338 isl_basic_map_free(bmap
);
12342 /* Add a constraint imposing that the given two dimensions are equal.
12344 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12345 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12349 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12351 bmap
= isl_basic_map_intersect(bmap
, eq
);
12356 /* Add a constraint imposing that the given two dimensions are equal.
12358 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12359 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12361 isl_basic_map
*bmap
;
12363 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12365 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12370 /* Add a constraint imposing that the given two dimensions have opposite values.
12372 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12373 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12375 isl_basic_map
*bmap
= NULL
;
12381 if (pos1
>= isl_map_dim(map
, type1
))
12382 isl_die(map
->ctx
, isl_error_invalid
,
12383 "index out of bounds", goto error
);
12384 if (pos2
>= isl_map_dim(map
, type2
))
12385 isl_die(map
->ctx
, isl_error_invalid
,
12386 "index out of bounds", goto error
);
12388 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12389 i
= isl_basic_map_alloc_equality(bmap
);
12392 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12393 pos1
+= isl_basic_map_offset(bmap
, type1
);
12394 pos2
+= isl_basic_map_offset(bmap
, type2
);
12395 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12396 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12397 bmap
= isl_basic_map_finalize(bmap
);
12399 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12403 isl_basic_map_free(bmap
);
12408 /* Construct a constraint imposing that the value of the first dimension is
12409 * greater than or equal to that of the second.
12411 static __isl_give isl_constraint
*constraint_order_ge(
12412 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12413 enum isl_dim_type type2
, int pos2
)
12420 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12422 if (pos1
>= isl_constraint_dim(c
, type1
))
12423 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12424 "index out of bounds", return isl_constraint_free(c
));
12425 if (pos2
>= isl_constraint_dim(c
, type2
))
12426 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12427 "index out of bounds", return isl_constraint_free(c
));
12429 if (type1
== type2
&& pos1
== pos2
)
12432 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12433 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12438 /* Add a constraint imposing that the value of the first dimension is
12439 * greater than or equal to that of the second.
12441 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12442 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12447 if (type1
== type2
&& pos1
== pos2
)
12449 space
= isl_basic_map_get_space(bmap
);
12450 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12451 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12456 /* Add a constraint imposing that the value of the first dimension is
12457 * greater than or equal to that of the second.
12459 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12460 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12465 if (type1
== type2
&& pos1
== pos2
)
12467 space
= isl_map_get_space(map
);
12468 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12469 map
= isl_map_add_constraint(map
, c
);
12474 /* Add a constraint imposing that the value of the first dimension is
12475 * less than or equal to that of the second.
12477 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12478 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12480 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12483 /* Construct a basic map where the value of the first dimension is
12484 * greater than that of the second.
12486 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12487 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12489 isl_basic_map
*bmap
= NULL
;
12495 if (pos1
>= isl_space_dim(space
, type1
))
12496 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12497 "index out of bounds", goto error
);
12498 if (pos2
>= isl_space_dim(space
, type2
))
12499 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12500 "index out of bounds", goto error
);
12502 if (type1
== type2
&& pos1
== pos2
)
12503 return isl_basic_map_empty(space
);
12505 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12506 i
= isl_basic_map_alloc_inequality(bmap
);
12508 return isl_basic_map_free(bmap
);
12509 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12510 pos1
+= isl_basic_map_offset(bmap
, type1
);
12511 pos2
+= isl_basic_map_offset(bmap
, type2
);
12512 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12513 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12514 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12515 bmap
= isl_basic_map_finalize(bmap
);
12519 isl_space_free(space
);
12520 isl_basic_map_free(bmap
);
12524 /* Add a constraint imposing that the value of the first dimension is
12525 * greater than that of the second.
12527 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12528 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12532 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12534 bmap
= isl_basic_map_intersect(bmap
, gt
);
12539 /* Add a constraint imposing that the value of the first dimension is
12540 * greater than that of the second.
12542 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12543 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12545 isl_basic_map
*bmap
;
12547 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12549 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12554 /* Add a constraint imposing that the value of the first dimension is
12555 * smaller than that of the second.
12557 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12558 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12560 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12563 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12567 isl_local_space
*ls
;
12572 if (!isl_basic_map_divs_known(bmap
))
12573 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12574 "some divs are unknown", return NULL
);
12576 ls
= isl_basic_map_get_local_space(bmap
);
12577 div
= isl_local_space_get_div(ls
, pos
);
12578 isl_local_space_free(ls
);
12583 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12586 return isl_basic_map_get_div(bset
, pos
);
12589 /* Plug in "subs" for dimension "type", "pos" of "bset".
12591 * Let i be the dimension to replace and let "subs" be of the form
12595 * Any integer division with a non-zero coefficient for i,
12597 * floor((a i + g)/m)
12601 * floor((a f + d g)/(m d))
12603 * Constraints of the form
12611 * We currently require that "subs" is an integral expression.
12612 * Handling rational expressions may require us to add stride constraints
12613 * as we do in isl_basic_set_preimage_multi_aff.
12615 __isl_give isl_basic_set
*isl_basic_set_substitute(
12616 __isl_take isl_basic_set
*bset
,
12617 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12623 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12626 bset
= isl_basic_set_cow(bset
);
12627 if (!bset
|| !subs
)
12630 ctx
= isl_basic_set_get_ctx(bset
);
12631 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12632 isl_die(ctx
, isl_error_invalid
,
12633 "spaces don't match", goto error
);
12634 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12635 isl_die(ctx
, isl_error_unsupported
,
12636 "cannot handle divs yet", goto error
);
12637 if (!isl_int_is_one(subs
->v
->el
[0]))
12638 isl_die(ctx
, isl_error_invalid
,
12639 "can only substitute integer expressions", goto error
);
12641 pos
+= isl_basic_set_offset(bset
, type
);
12645 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12646 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12648 isl_int_set(v
, bset
->eq
[i
][pos
]);
12649 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12650 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12651 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12654 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12655 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12657 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12658 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12659 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12660 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12663 for (i
= 0; i
< bset
->n_div
; ++i
) {
12664 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12666 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12667 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12668 isl_seq_combine(bset
->div
[i
] + 1,
12669 subs
->v
->el
[0], bset
->div
[i
] + 1,
12670 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12671 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12676 bset
= isl_basic_set_simplify(bset
);
12677 return isl_basic_set_finalize(bset
);
12679 isl_basic_set_free(bset
);
12683 /* Plug in "subs" for dimension "type", "pos" of "set".
12685 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12686 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12690 if (set
&& isl_set_plain_is_empty(set
))
12693 set
= isl_set_cow(set
);
12697 for (i
= set
->n
- 1; i
>= 0; --i
) {
12698 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12699 set
= set_from_map(remove_if_empty(set_to_map(set
), i
));
12710 /* Check if the range of "ma" is compatible with the domain or range
12711 * (depending on "type") of "bmap".
12713 static isl_stat
check_basic_map_compatible_range_multi_aff(
12714 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12715 __isl_keep isl_multi_aff
*ma
)
12718 isl_space
*ma_space
;
12720 ma_space
= isl_multi_aff_get_space(ma
);
12722 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12726 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12727 "parameters don't match", goto error
);
12728 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12732 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12733 "spaces don't match", goto error
);
12735 isl_space_free(ma_space
);
12736 return isl_stat_ok
;
12738 isl_space_free(ma_space
);
12739 return isl_stat_error
;
12742 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12743 * coefficients before the transformed range of dimensions,
12744 * the "n_after" coefficients after the transformed range of dimensions
12745 * and the coefficients of the other divs in "bmap".
12747 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12748 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12753 isl_local_space
*ls
;
12758 ls
= isl_aff_get_domain_local_space(ma
->u
.p
[0]);
12762 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12763 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12764 for (i
= 0; i
< n_div
; ++i
) {
12765 int o_bmap
= 0, o_ls
= 0;
12767 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12768 o_bmap
+= 1 + 1 + n_param
;
12769 o_ls
+= 1 + 1 + n_param
;
12770 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12771 o_bmap
+= n_before
;
12772 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12773 ls
->div
->row
[i
] + o_ls
, n_set
);
12776 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12778 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12779 ls
->div
->row
[i
] + o_ls
, n_div
);
12782 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12783 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12787 isl_local_space_free(ls
);
12790 isl_local_space_free(ls
);
12794 /* How many stride constraints does "ma" enforce?
12795 * That is, how many of the affine expressions have a denominator
12796 * different from one?
12798 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12803 for (i
= 0; i
< ma
->n
; ++i
)
12804 if (!isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12810 /* For each affine expression in ma of the form
12812 * x_i = (f_i y + h_i)/m_i
12814 * with m_i different from one, add a constraint to "bmap"
12817 * f_i y + h_i = m_i alpha_i
12819 * with alpha_i an additional existentially quantified variable.
12821 * The input variables of "ma" correspond to a subset of the variables
12822 * of "bmap". There are "n_before" variables in "bmap" before this
12823 * subset and "n_after" variables after this subset.
12824 * The integer divisions of the affine expressions in "ma" are assumed
12825 * to have been aligned. There are "n_div_ma" of them and
12826 * they appear first in "bmap", straight after the "n_after" variables.
12828 static __isl_give isl_basic_map
*add_ma_strides(
12829 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12830 int n_before
, int n_after
, int n_div_ma
)
12838 total
= isl_basic_map_total_dim(bmap
);
12839 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12840 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12841 for (i
= 0; i
< ma
->n
; ++i
) {
12842 int o_bmap
= 0, o_ma
= 1;
12844 if (isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12846 div
= isl_basic_map_alloc_div(bmap
);
12847 k
= isl_basic_map_alloc_equality(bmap
);
12848 if (div
< 0 || k
< 0)
12850 isl_int_set_si(bmap
->div
[div
][0], 0);
12851 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12852 ma
->u
.p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12853 o_bmap
+= 1 + n_param
;
12854 o_ma
+= 1 + n_param
;
12855 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12856 o_bmap
+= n_before
;
12857 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12858 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_in
);
12861 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12863 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12864 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12865 o_bmap
+= n_div_ma
;
12867 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12868 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->u
.p
[i
]->v
->el
[0]);
12874 isl_basic_map_free(bmap
);
12878 /* Replace the domain or range space (depending on "type) of "space" by "set".
12880 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12881 enum isl_dim_type type
, __isl_take isl_space
*set
)
12883 if (type
== isl_dim_in
) {
12884 space
= isl_space_range(space
);
12885 space
= isl_space_map_from_domain_and_range(set
, space
);
12887 space
= isl_space_domain(space
);
12888 space
= isl_space_map_from_domain_and_range(space
, set
);
12894 /* Compute the preimage of the domain or range (depending on "type")
12895 * of "bmap" under the function represented by "ma".
12896 * In other words, plug in "ma" in the domain or range of "bmap".
12897 * The result is a basic map that lives in the same space as "bmap"
12898 * except that the domain or range has been replaced by
12899 * the domain space of "ma".
12901 * If bmap is represented by
12903 * A(p) + S u + B x + T v + C(divs) >= 0,
12905 * where u and x are input and output dimensions if type == isl_dim_out
12906 * while x and v are input and output dimensions if type == isl_dim_in,
12907 * and ma is represented by
12909 * x = D(p) + F(y) + G(divs')
12911 * then the result is
12913 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12915 * The divs in the input set are similarly adjusted.
12918 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12922 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12923 * B_i G(divs') + c_i(divs))/n_i)
12925 * If bmap is not a rational map and if F(y) involves any denominators
12927 * x_i = (f_i y + h_i)/m_i
12929 * then additional constraints are added to ensure that we only
12930 * map back integer points. That is we enforce
12932 * f_i y + h_i = m_i alpha_i
12934 * with alpha_i an additional existentially quantified variable.
12936 * We first copy over the divs from "ma".
12937 * Then we add the modified constraints and divs from "bmap".
12938 * Finally, we add the stride constraints, if needed.
12940 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12941 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12942 __isl_take isl_multi_aff
*ma
)
12946 isl_basic_map
*res
= NULL
;
12947 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12948 isl_int f
, c1
, c2
, g
;
12957 ma
= isl_multi_aff_align_divs(ma
);
12960 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12963 if (type
== isl_dim_in
) {
12965 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12967 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12970 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12971 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
12973 space
= isl_multi_aff_get_domain_space(ma
);
12974 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12975 rational
= isl_basic_map_is_rational(bmap
);
12976 strides
= rational
? 0 : multi_aff_strides(ma
);
12977 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12978 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12980 res
= isl_basic_map_set_rational(res
);
12982 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12983 if (isl_basic_map_alloc_div(res
) < 0)
12986 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12989 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12990 k
= isl_basic_map_alloc_equality(res
);
12993 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12994 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12997 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12998 k
= isl_basic_map_alloc_inequality(res
);
13001 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
13002 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13005 for (i
= 0; i
< bmap
->n_div
; ++i
) {
13006 if (isl_int_is_zero(bmap
->div
[i
][0])) {
13007 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
13010 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
13011 n_before
, n_after
, n_div_ma
, n_div_bmap
,
13016 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
13022 isl_basic_map_free(bmap
);
13023 isl_multi_aff_free(ma
);
13024 res
= isl_basic_map_simplify(res
);
13025 return isl_basic_map_finalize(res
);
13031 isl_basic_map_free(bmap
);
13032 isl_multi_aff_free(ma
);
13033 isl_basic_map_free(res
);
13037 /* Compute the preimage of "bset" under the function represented by "ma".
13038 * In other words, plug in "ma" in "bset". The result is a basic set
13039 * that lives in the domain space of "ma".
13041 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
13042 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
13044 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
13047 /* Compute the preimage of the domain of "bmap" under the function
13048 * represented by "ma".
13049 * In other words, plug in "ma" in the domain of "bmap".
13050 * The result is a basic map that lives in the same space as "bmap"
13051 * except that the domain has been replaced by the domain space of "ma".
13053 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
13054 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13056 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
13059 /* Compute the preimage of the range of "bmap" under the function
13060 * represented by "ma".
13061 * In other words, plug in "ma" in the range of "bmap".
13062 * The result is a basic map that lives in the same space as "bmap"
13063 * except that the range has been replaced by the domain space of "ma".
13065 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
13066 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13068 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
13071 /* Check if the range of "ma" is compatible with the domain or range
13072 * (depending on "type") of "map".
13073 * Return isl_stat_error if anything is wrong.
13075 static isl_stat
check_map_compatible_range_multi_aff(
13076 __isl_keep isl_map
*map
, enum isl_dim_type type
,
13077 __isl_keep isl_multi_aff
*ma
)
13080 isl_space
*ma_space
;
13082 ma_space
= isl_multi_aff_get_space(ma
);
13083 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
13084 isl_space_free(ma_space
);
13086 return isl_stat_error
;
13088 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
13089 "spaces don't match", return isl_stat_error
);
13090 return isl_stat_ok
;
13093 /* Compute the preimage of the domain or range (depending on "type")
13094 * of "map" under the function represented by "ma".
13095 * In other words, plug in "ma" in the domain or range of "map".
13096 * The result is a map that lives in the same space as "map"
13097 * except that the domain or range has been replaced by
13098 * the domain space of "ma".
13100 * The parameters are assumed to have been aligned.
13102 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13103 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13108 map
= isl_map_cow(map
);
13109 ma
= isl_multi_aff_align_divs(ma
);
13112 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13115 for (i
= 0; i
< map
->n
; ++i
) {
13116 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13117 isl_multi_aff_copy(ma
));
13122 space
= isl_multi_aff_get_domain_space(ma
);
13123 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13125 isl_space_free(map
->dim
);
13130 isl_multi_aff_free(ma
);
13132 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13133 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13136 isl_multi_aff_free(ma
);
13141 /* Compute the preimage of the domain or range (depending on "type")
13142 * of "map" under the function represented by "ma".
13143 * In other words, plug in "ma" in the domain or range of "map".
13144 * The result is a map that lives in the same space as "map"
13145 * except that the domain or range has been replaced by
13146 * the domain space of "ma".
13148 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13149 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13156 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13160 return map_preimage_multi_aff(map
, type
, ma
);
13162 if (isl_map_check_named_params(map
) < 0)
13164 if (!isl_space_has_named_params(ma
->space
))
13165 isl_die(map
->ctx
, isl_error_invalid
,
13166 "unaligned unnamed parameters", goto error
);
13167 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13168 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13170 return map_preimage_multi_aff(map
, type
, ma
);
13172 isl_multi_aff_free(ma
);
13173 return isl_map_free(map
);
13176 /* Compute the preimage of "set" under the function represented by "ma".
13177 * In other words, plug in "ma" in "set". The result is a set
13178 * that lives in the domain space of "ma".
13180 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13181 __isl_take isl_multi_aff
*ma
)
13183 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13186 /* Compute the preimage of the domain of "map" under the function
13187 * represented by "ma".
13188 * In other words, plug in "ma" in the domain of "map".
13189 * The result is a map that lives in the same space as "map"
13190 * except that the domain has been replaced by the domain space of "ma".
13192 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13193 __isl_take isl_multi_aff
*ma
)
13195 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13198 /* Compute the preimage of the range of "map" under the function
13199 * represented by "ma".
13200 * In other words, plug in "ma" in the range of "map".
13201 * The result is a map that lives in the same space as "map"
13202 * except that the range has been replaced by the domain space of "ma".
13204 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13205 __isl_take isl_multi_aff
*ma
)
13207 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13210 /* Compute the preimage of "map" under the function represented by "pma".
13211 * In other words, plug in "pma" in the domain or range of "map".
13212 * The result is a map that lives in the same space as "map",
13213 * except that the space of type "type" has been replaced by
13214 * the domain space of "pma".
13216 * The parameters of "map" and "pma" are assumed to have been aligned.
13218 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13219 __isl_take isl_map
*map
, enum isl_dim_type type
,
13220 __isl_take isl_pw_multi_aff
*pma
)
13229 isl_pw_multi_aff_free(pma
);
13230 res
= isl_map_empty(isl_map_get_space(map
));
13235 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13236 isl_multi_aff_copy(pma
->p
[0].maff
));
13237 if (type
== isl_dim_in
)
13238 res
= isl_map_intersect_domain(res
,
13239 isl_map_copy(pma
->p
[0].set
));
13241 res
= isl_map_intersect_range(res
,
13242 isl_map_copy(pma
->p
[0].set
));
13244 for (i
= 1; i
< pma
->n
; ++i
) {
13247 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13248 isl_multi_aff_copy(pma
->p
[i
].maff
));
13249 if (type
== isl_dim_in
)
13250 res_i
= isl_map_intersect_domain(res_i
,
13251 isl_map_copy(pma
->p
[i
].set
));
13253 res_i
= isl_map_intersect_range(res_i
,
13254 isl_map_copy(pma
->p
[i
].set
));
13255 res
= isl_map_union(res
, res_i
);
13258 isl_pw_multi_aff_free(pma
);
13262 isl_pw_multi_aff_free(pma
);
13267 /* Compute the preimage of "map" under the function represented by "pma".
13268 * In other words, plug in "pma" in the domain or range of "map".
13269 * The result is a map that lives in the same space as "map",
13270 * except that the space of type "type" has been replaced by
13271 * the domain space of "pma".
13273 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13274 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13281 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13285 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13287 if (isl_map_check_named_params(map
) < 0)
13289 if (isl_pw_multi_aff_check_named_params(pma
) < 0)
13291 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13292 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13294 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13296 isl_pw_multi_aff_free(pma
);
13297 return isl_map_free(map
);
13300 /* Compute the preimage of "set" under the function represented by "pma".
13301 * In other words, plug in "pma" in "set". The result is a set
13302 * that lives in the domain space of "pma".
13304 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13305 __isl_take isl_pw_multi_aff
*pma
)
13307 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13310 /* Compute the preimage of the domain of "map" under the function
13311 * represented by "pma".
13312 * In other words, plug in "pma" in the domain of "map".
13313 * The result is a map that lives in the same space as "map",
13314 * except that domain space has been replaced by the domain space of "pma".
13316 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13317 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13319 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13322 /* Compute the preimage of the range of "map" under the function
13323 * represented by "pma".
13324 * In other words, plug in "pma" in the range of "map".
13325 * The result is a map that lives in the same space as "map",
13326 * except that range space has been replaced by the domain space of "pma".
13328 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13329 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13331 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13334 /* Compute the preimage of "map" under the function represented by "mpa".
13335 * In other words, plug in "mpa" 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 "mpa".
13340 * If the map does not involve any constraints that refer to the
13341 * dimensions of the substituted space, then the only possible
13342 * effect of "mpa" on the map is to map the space to a different space.
13343 * We create a separate isl_multi_aff to effectuate this change
13344 * in order to avoid spurious splitting of the map along the pieces
13346 * If "mpa" has a non-trivial explicit domain, however,
13347 * then the full substitution should be performed.
13349 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13350 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13354 isl_pw_multi_aff
*pma
;
13359 n
= isl_map_dim(map
, type
);
13360 full
= isl_map_involves_dims(map
, type
, 0, n
);
13361 if (full
>= 0 && !full
)
13362 full
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
13369 space
= isl_multi_pw_aff_get_space(mpa
);
13370 isl_multi_pw_aff_free(mpa
);
13371 ma
= isl_multi_aff_zero(space
);
13372 return isl_map_preimage_multi_aff(map
, type
, ma
);
13375 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13376 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13379 isl_multi_pw_aff_free(mpa
);
13383 /* Compute the preimage of "map" under the function represented by "mpa".
13384 * In other words, plug in "mpa" in the domain "map".
13385 * The result is a map that lives in the same space as "map",
13386 * except that domain space has been replaced by the domain space of "mpa".
13388 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13389 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13391 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13394 /* Compute the preimage of "set" by the function represented by "mpa".
13395 * In other words, plug in "mpa" in "set".
13397 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13398 __isl_take isl_multi_pw_aff
*mpa
)
13400 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13403 /* Return a copy of the equality constraints of "bset" as a matrix.
13405 __isl_give isl_mat
*isl_basic_set_extract_equalities(
13406 __isl_keep isl_basic_set
*bset
)
13414 ctx
= isl_basic_set_get_ctx(bset
);
13415 total
= 1 + isl_basic_set_dim(bset
, isl_dim_all
);
13416 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, total
);
13419 /* Are the "n" "coefficients" starting at "first" of the integer division
13420 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13422 * The "coefficient" at position 0 is the denominator.
13423 * The "coefficient" at position 1 is the constant term.
13425 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13426 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13427 unsigned first
, unsigned n
)
13429 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13430 return isl_bool_error
;
13431 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13432 return isl_bool_error
;
13433 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13434 bmap2
->div
[pos2
] + first
, n
);
13437 /* Are the integer division expressions at position "pos1" in "bmap1" and
13438 * "pos2" in "bmap2" equal to each other, except that the constant terms
13441 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13442 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13443 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13448 if (!bmap1
|| !bmap2
)
13449 return isl_bool_error
;
13450 total
= isl_basic_map_total_dim(bmap1
);
13451 if (total
!= isl_basic_map_total_dim(bmap2
))
13452 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13453 "incomparable div expressions", return isl_bool_error
);
13454 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13456 if (equal
< 0 || !equal
)
13458 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13460 if (equal
< 0 || equal
)
13461 return isl_bool_not(equal
);
13462 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13466 /* Replace the numerator of the constant term of the integer division
13467 * expression at position "div" in "bmap" by "value".
13468 * The caller guarantees that this does not change the meaning
13471 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13472 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13474 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13475 return isl_basic_map_free(bmap
);
13477 isl_int_set_si(bmap
->div
[div
][1], value
);
13482 /* Is the point "inner" internal to inequality constraint "ineq"
13484 * The point is considered to be internal to the inequality constraint,
13485 * if it strictly lies on the positive side of the inequality constraint,
13486 * or if it lies on the constraint and the constraint is lexico-positive.
13488 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13489 __isl_keep isl_basic_set
*bset
, int ineq
)
13495 if (!inner
|| !bset
)
13496 return isl_bool_error
;
13498 ctx
= isl_basic_set_get_ctx(bset
);
13499 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13500 &ctx
->normalize_gcd
);
13501 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13502 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13504 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13505 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13506 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13509 /* Tighten the inequality constraints of "bset" that are outward with respect
13510 * to the point "vec".
13511 * That is, tighten the constraints that are not satisfied by "vec".
13513 * "vec" is a point internal to some superset S of "bset" that is used
13514 * to make the subsets of S disjoint, by tightening one half of the constraints
13515 * that separate two subsets. In particular, the constraints of S
13516 * are all satisfied by "vec" and should not be tightened.
13517 * Of the internal constraints, those that have "vec" on the outside
13518 * are tightened. The shared facet is included in the adjacent subset
13519 * with the opposite constraint.
13520 * For constraints that saturate "vec", this criterion cannot be used
13521 * to determine which of the two sides should be tightened.
13522 * Instead, the sign of the first non-zero coefficient is used
13523 * to make this choice. Note that this second criterion is never used
13524 * on the constraints of S since "vec" is interior to "S".
13526 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13527 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13531 bset
= isl_basic_set_cow(bset
);
13534 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13537 internal
= is_internal(vec
, bset
, j
);
13539 return isl_basic_set_free(bset
);
13542 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13548 /* Replace the variables x of type "type" starting at "first" in "bmap"
13549 * by x' with x = M x' with M the matrix trans.
13550 * That is, replace the corresponding coefficients c by c M.
13552 * The transformation matrix should be a square matrix.
13554 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13555 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13556 __isl_take isl_mat
*trans
)
13560 bmap
= isl_basic_map_cow(bmap
);
13561 if (!bmap
|| !trans
)
13564 if (trans
->n_row
!= trans
->n_col
)
13565 isl_die(trans
->ctx
, isl_error_invalid
,
13566 "expecting square transformation matrix", goto error
);
13567 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13568 isl_die(trans
->ctx
, isl_error_invalid
,
13569 "oversized transformation matrix", goto error
);
13571 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13573 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13574 isl_mat_copy(trans
)) < 0)
13576 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13577 isl_mat_copy(trans
)) < 0)
13579 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13580 isl_mat_copy(trans
)) < 0)
13583 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
13584 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13586 isl_mat_free(trans
);
13589 isl_mat_free(trans
);
13590 isl_basic_map_free(bmap
);
13594 /* Replace the variables x of type "type" starting at "first" in "bset"
13595 * by x' with x = M x' with M the matrix trans.
13596 * That is, replace the corresponding coefficients c by c M.
13598 * The transformation matrix should be a square matrix.
13600 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13601 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13602 __isl_take isl_mat
*trans
)
13604 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);