2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 INRIA Paris
7 * Copyright 2016 Sven Verdoolaege
9 * Use of this software is governed by the MIT license
11 * Written by Sven Verdoolaege, K.U.Leuven, Departement
12 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
14 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
17 * B.P. 105 - 78153 Le Chesnay, France
18 * and Centre de Recherche Inria de Paris, 2 rue Simone Iff - Voie DQ12,
19 * CS 42112, 75589 Paris Cedex 12, France
23 #include <isl_ctx_private.h>
24 #include <isl_map_private.h>
27 #include <isl/constraint.h>
28 #include "isl_space_private.h"
29 #include "isl_equalities.h"
30 #include <isl_lp_private.h>
34 #include <isl_reordering.h>
35 #include "isl_sample.h"
39 #include <isl_mat_private.h>
40 #include <isl_vec_private.h>
41 #include <isl_dim_map.h>
42 #include <isl_local_space_private.h>
43 #include <isl_aff_private.h>
44 #include <isl_options_private.h>
45 #include <isl_morph.h>
46 #include <isl_val_private.h>
48 #include <bset_to_bmap.c>
49 #include <bset_from_bmap.c>
50 #include <set_to_map.c>
51 #include <set_from_map.c>
53 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
56 case isl_dim_param
: return dim
->nparam
;
57 case isl_dim_in
: return dim
->n_in
;
58 case isl_dim_out
: return dim
->n_out
;
59 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
64 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
67 case isl_dim_param
: return 1;
68 case isl_dim_in
: return 1 + dim
->nparam
;
69 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
74 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
75 enum isl_dim_type type
)
80 case isl_dim_cst
: return 1;
83 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
84 case isl_dim_div
: return bmap
->n_div
;
85 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
90 /* Return the space of "map".
92 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
94 return map
? map
->dim
: NULL
;
97 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
99 return map
? n(map
->dim
, type
) : 0;
102 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
104 return set
? n(set
->dim
, type
) : 0;
107 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
108 enum isl_dim_type type
)
117 case isl_dim_cst
: return 0;
118 case isl_dim_param
: return 1;
119 case isl_dim_in
: return 1 + space
->nparam
;
120 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
121 case isl_dim_div
: return 1 + space
->nparam
+ space
->n_in
+
127 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
128 enum isl_dim_type type
)
130 return isl_basic_map_offset(bset
, type
);
133 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
135 return pos(map
->dim
, type
);
138 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
139 enum isl_dim_type type
)
141 return isl_basic_map_dim(bset
, type
);
144 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
146 return isl_basic_set_dim(bset
, isl_dim_set
);
149 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
151 return isl_basic_set_dim(bset
, isl_dim_param
);
154 unsigned isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
158 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
161 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
163 return isl_set_dim(set
, isl_dim_set
);
166 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
168 return isl_set_dim(set
, isl_dim_param
);
171 unsigned isl_basic_map_n_in(__isl_keep
const isl_basic_map
*bmap
)
173 return bmap
? bmap
->dim
->n_in
: 0;
176 unsigned isl_basic_map_n_out(__isl_keep
const isl_basic_map
*bmap
)
178 return bmap
? bmap
->dim
->n_out
: 0;
181 unsigned isl_basic_map_n_param(__isl_keep
const isl_basic_map
*bmap
)
183 return bmap
? bmap
->dim
->nparam
: 0;
186 unsigned isl_basic_map_n_div(__isl_keep
const isl_basic_map
*bmap
)
188 return bmap
? bmap
->n_div
: 0;
191 unsigned isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
193 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
196 unsigned isl_map_n_in(__isl_keep
const isl_map
*map
)
198 return map
? map
->dim
->n_in
: 0;
201 unsigned isl_map_n_out(__isl_keep
const isl_map
*map
)
203 return map
? map
->dim
->n_out
: 0;
206 unsigned isl_map_n_param(__isl_keep
const isl_map
*map
)
208 return map
? map
->dim
->nparam
: 0;
211 /* Return the number of equality constraints in the description of "bmap".
212 * Return -1 on error.
214 int isl_basic_map_n_equality(__isl_keep isl_basic_map
*bmap
)
221 /* Return the number of equality constraints in the description of "bset".
222 * Return -1 on error.
224 int isl_basic_set_n_equality(__isl_keep isl_basic_set
*bset
)
226 return isl_basic_map_n_equality(bset_to_bmap(bset
));
229 /* Return the number of inequality constraints in the description of "bmap".
230 * Return -1 on error.
232 int isl_basic_map_n_inequality(__isl_keep isl_basic_map
*bmap
)
239 /* Return the number of inequality constraints in the description of "bset".
240 * Return -1 on error.
242 int isl_basic_set_n_inequality(__isl_keep isl_basic_set
*bset
)
244 return isl_basic_map_n_inequality(bset_to_bmap(bset
));
247 /* Do "bmap1" and "bmap2" have the same parameters?
249 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
250 __isl_keep isl_basic_map
*bmap2
)
252 isl_space
*space1
, *space2
;
254 space1
= isl_basic_map_peek_space(bmap1
);
255 space2
= isl_basic_map_peek_space(bmap2
);
256 return isl_space_has_equal_params(space1
, space2
);
259 /* Do "map1" and "map2" have the same parameters?
261 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
262 __isl_keep isl_map
*map2
)
264 isl_space
*space1
, *space2
;
266 space1
= isl_map_peek_space(map1
);
267 space2
= isl_map_peek_space(map2
);
268 return isl_space_has_equal_params(space1
, space2
);
271 /* Do "map" and "set" have the same parameters?
273 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
274 __isl_keep isl_set
*set
)
276 return isl_map_has_equal_params(map
, set_to_map(set
));
279 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
280 __isl_keep isl_set
*set
)
284 return isl_bool_error
;
285 m
= isl_map_has_equal_params(map
, set_to_map(set
));
288 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
289 set
->dim
, isl_dim_set
);
292 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
293 __isl_keep isl_basic_set
*bset
)
297 return isl_bool_error
;
298 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
301 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
302 bset
->dim
, isl_dim_set
);
305 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
306 __isl_keep isl_set
*set
)
310 return isl_bool_error
;
311 m
= isl_map_has_equal_params(map
, set_to_map(set
));
314 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
315 set
->dim
, isl_dim_set
);
318 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
319 __isl_keep isl_basic_set
*bset
)
323 return isl_bool_error
;
324 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
327 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
328 bset
->dim
, isl_dim_set
);
331 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
333 return bmap
? bmap
->ctx
: NULL
;
336 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
338 return bset
? bset
->ctx
: NULL
;
341 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
343 return map
? map
->ctx
: NULL
;
346 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
348 return set
? set
->ctx
: NULL
;
351 /* Return the space of "bmap".
353 __isl_keep isl_space
*isl_basic_map_peek_space(
354 __isl_keep
const isl_basic_map
*bmap
)
356 return bmap
? bmap
->dim
: NULL
;
359 /* Return the space of "bset".
361 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
363 return isl_basic_map_peek_space(bset_to_bmap(bset
));
366 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
368 return isl_space_copy(isl_basic_map_peek_space(bmap
));
371 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
373 return isl_basic_map_get_space(bset_to_bmap(bset
));
376 /* Extract the divs in "bmap" as a matrix.
378 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
389 ctx
= isl_basic_map_get_ctx(bmap
);
390 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
391 cols
= 1 + 1 + total
+ bmap
->n_div
;
392 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
396 for (i
= 0; i
< bmap
->n_div
; ++i
)
397 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
402 /* Extract the divs in "bset" as a matrix.
404 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
406 return isl_basic_map_get_divs(bset
);
409 __isl_give isl_local_space
*isl_basic_map_get_local_space(
410 __isl_keep isl_basic_map
*bmap
)
417 div
= isl_basic_map_get_divs(bmap
);
418 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
421 __isl_give isl_local_space
*isl_basic_set_get_local_space(
422 __isl_keep isl_basic_set
*bset
)
424 return isl_basic_map_get_local_space(bset
);
427 /* For each known div d = floor(f/m), add the constraints
430 * -(f-(m-1)) + m d >= 0
432 * Do not finalize the result.
434 static __isl_give isl_basic_map
*add_known_div_constraints(
435 __isl_take isl_basic_map
*bmap
)
442 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
445 bmap
= isl_basic_map_cow(bmap
);
446 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
449 for (i
= 0; i
< n_div
; ++i
) {
450 if (isl_int_is_zero(bmap
->div
[i
][0]))
452 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
453 return isl_basic_map_free(bmap
);
459 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
460 __isl_take isl_local_space
*ls
)
469 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
470 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
471 n_div
, 0, 2 * n_div
);
473 for (i
= 0; i
< n_div
; ++i
)
474 if (isl_basic_map_alloc_div(bmap
) < 0)
477 for (i
= 0; i
< n_div
; ++i
)
478 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
479 bmap
= add_known_div_constraints(bmap
);
481 isl_local_space_free(ls
);
484 isl_local_space_free(ls
);
485 isl_basic_map_free(bmap
);
489 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
490 __isl_take isl_local_space
*ls
)
492 return isl_basic_map_from_local_space(ls
);
495 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
497 return isl_space_copy(isl_map_peek_space(map
));
500 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
504 return isl_space_copy(set
->dim
);
507 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
508 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
510 bmap
= isl_basic_map_cow(bmap
);
513 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
516 bmap
= isl_basic_map_finalize(bmap
);
519 isl_basic_map_free(bmap
);
523 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
524 __isl_take isl_basic_set
*bset
, const char *s
)
526 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
529 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
530 enum isl_dim_type type
)
532 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
535 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
536 enum isl_dim_type type
, const char *s
)
540 map
= isl_map_cow(map
);
544 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
548 for (i
= 0; i
< map
->n
; ++i
) {
549 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
560 /* Replace the identifier of the tuple of type "type" by "id".
562 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
563 __isl_take isl_basic_map
*bmap
,
564 enum isl_dim_type type
, __isl_take isl_id
*id
)
566 bmap
= isl_basic_map_cow(bmap
);
569 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
571 return isl_basic_map_free(bmap
);
572 bmap
= isl_basic_map_finalize(bmap
);
579 /* Replace the identifier of the tuple by "id".
581 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
582 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
584 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
587 /* Does the input or output tuple have a name?
589 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
591 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
594 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
595 enum isl_dim_type type
)
597 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
600 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
603 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
607 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
608 enum isl_dim_type type
, __isl_take isl_id
*id
)
610 map
= isl_map_cow(map
);
614 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
616 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
622 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
623 __isl_take isl_id
*id
)
625 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
628 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
629 enum isl_dim_type type
)
631 map
= isl_map_cow(map
);
635 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
637 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
640 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
642 return isl_map_reset_tuple_id(set
, isl_dim_set
);
645 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
647 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
650 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
651 enum isl_dim_type type
)
653 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
656 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
658 return isl_map_has_tuple_id(set
, isl_dim_set
);
661 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
663 return isl_map_get_tuple_id(set
, isl_dim_set
);
666 /* Does the set tuple have a name?
668 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
671 return isl_bool_error
;
672 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
676 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
678 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
681 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
683 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
686 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
687 enum isl_dim_type type
, unsigned pos
)
689 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
692 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
693 enum isl_dim_type type
, unsigned pos
)
695 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
698 /* Does the given dimension have a name?
700 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
701 enum isl_dim_type type
, unsigned pos
)
704 return isl_bool_error
;
705 return isl_space_has_dim_name(map
->dim
, type
, pos
);
708 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
709 enum isl_dim_type type
, unsigned pos
)
711 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
714 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
715 enum isl_dim_type type
, unsigned pos
)
717 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
720 /* Does the given dimension have a name?
722 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
723 enum isl_dim_type type
, unsigned pos
)
726 return isl_bool_error
;
727 return isl_space_has_dim_name(set
->dim
, type
, pos
);
730 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
731 __isl_take isl_basic_map
*bmap
,
732 enum isl_dim_type type
, unsigned pos
, const char *s
)
734 bmap
= isl_basic_map_cow(bmap
);
737 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
740 return isl_basic_map_finalize(bmap
);
742 isl_basic_map_free(bmap
);
746 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
747 enum isl_dim_type type
, unsigned pos
, const char *s
)
751 map
= isl_map_cow(map
);
755 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
759 for (i
= 0; i
< map
->n
; ++i
) {
760 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
771 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
772 __isl_take isl_basic_set
*bset
,
773 enum isl_dim_type type
, unsigned pos
, const char *s
)
775 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
779 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
780 enum isl_dim_type type
, unsigned pos
, const char *s
)
782 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
786 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
787 enum isl_dim_type type
, unsigned pos
)
790 return isl_bool_error
;
791 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
794 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
795 enum isl_dim_type type
, unsigned pos
)
797 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
800 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
801 enum isl_dim_type type
, unsigned pos
)
803 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
806 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
807 enum isl_dim_type type
, unsigned pos
)
809 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
812 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
813 enum isl_dim_type type
, unsigned pos
)
815 return isl_map_has_dim_id(set
, type
, pos
);
818 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
819 enum isl_dim_type type
, unsigned pos
)
821 return isl_map_get_dim_id(set
, type
, pos
);
824 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
825 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
827 map
= isl_map_cow(map
);
831 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
833 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
839 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
840 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
842 return isl_map_set_dim_id(set
, type
, pos
, id
);
845 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
846 __isl_keep isl_id
*id
)
850 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
853 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
854 __isl_keep isl_id
*id
)
856 return isl_map_find_dim_by_id(set
, type
, id
);
859 /* Return the position of the dimension of the given type and name
861 * Return -1 if no such dimension can be found.
863 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
864 enum isl_dim_type type
, const char *name
)
868 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
871 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
876 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
879 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
882 return isl_map_find_dim_by_name(set
, type
, name
);
885 /* Check whether equality i of bset is a pure stride constraint
886 * on a single dimension, i.e., of the form
890 * with k a constant and e an existentially quantified variable.
892 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
901 return isl_bool_error
;
903 if (!isl_int_is_zero(bset
->eq
[i
][0]))
904 return isl_bool_false
;
906 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
907 d
= isl_basic_set_dim(bset
, isl_dim_set
);
908 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
910 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
911 return isl_bool_false
;
912 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
914 return isl_bool_false
;
915 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
917 return isl_bool_false
;
919 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
921 return isl_bool_false
;
922 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
923 n_div
- pos2
- 1) != -1)
924 return isl_bool_false
;
925 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
926 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
927 return isl_bool_false
;
929 return isl_bool_true
;
932 /* Reset the user pointer on all identifiers of parameters and tuples
933 * of the space of "map".
935 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
939 space
= isl_map_get_space(map
);
940 space
= isl_space_reset_user(space
);
941 map
= isl_map_reset_space(map
, space
);
946 /* Reset the user pointer on all identifiers of parameters and tuples
947 * of the space of "set".
949 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
951 return isl_map_reset_user(set
);
954 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
957 return isl_bool_error
;
958 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
961 /* Has "map" been marked as a rational map?
962 * In particular, have all basic maps in "map" been marked this way?
963 * An empty map is not considered to be rational.
964 * Maps where only some of the basic maps are marked rational
967 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
973 return isl_bool_error
;
975 return isl_bool_false
;
976 rational
= isl_basic_map_is_rational(map
->p
[0]);
979 for (i
= 1; i
< map
->n
; ++i
) {
982 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
985 if (rational
!= rational_i
)
986 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
987 "mixed rational and integer basic maps "
988 "not supported", return isl_bool_error
);
994 /* Has "set" been marked as a rational set?
995 * In particular, have all basic set in "set" been marked this way?
996 * An empty set is not considered to be rational.
997 * Sets where only some of the basic sets are marked rational
1000 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
1002 return isl_map_is_rational(set
);
1005 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
1007 return isl_basic_map_is_rational(bset
);
1010 /* Does "bmap" contain any rational points?
1012 * If "bmap" has an equality for each dimension, equating the dimension
1013 * to an integer constant, then it has no rational points, even if it
1014 * is marked as rational.
1016 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
1018 isl_bool has_rational
= isl_bool_true
;
1022 return isl_bool_error
;
1023 if (isl_basic_map_plain_is_empty(bmap
))
1024 return isl_bool_false
;
1025 if (!isl_basic_map_is_rational(bmap
))
1026 return isl_bool_false
;
1027 bmap
= isl_basic_map_copy(bmap
);
1028 bmap
= isl_basic_map_implicit_equalities(bmap
);
1030 return isl_bool_error
;
1031 total
= isl_basic_map_total_dim(bmap
);
1032 if (bmap
->n_eq
== total
) {
1034 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1035 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1038 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1039 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1041 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1046 if (i
== bmap
->n_eq
)
1047 has_rational
= isl_bool_false
;
1049 isl_basic_map_free(bmap
);
1051 return has_rational
;
1054 /* Does "map" contain any rational points?
1056 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1059 isl_bool has_rational
;
1062 return isl_bool_error
;
1063 for (i
= 0; i
< map
->n
; ++i
) {
1064 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1065 if (has_rational
< 0 || has_rational
)
1066 return has_rational
;
1068 return isl_bool_false
;
1071 /* Does "set" contain any rational points?
1073 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1075 return isl_map_has_rational(set
);
1078 /* Is this basic set a parameter domain?
1080 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1083 return isl_bool_error
;
1084 return isl_space_is_params(bset
->dim
);
1087 /* Is this set a parameter domain?
1089 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1092 return isl_bool_error
;
1093 return isl_space_is_params(set
->dim
);
1096 /* Is this map actually a parameter domain?
1097 * Users should never call this function. Outside of isl,
1098 * a map can never be a parameter domain.
1100 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1103 return isl_bool_error
;
1104 return isl_space_is_params(map
->dim
);
1107 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
1108 struct isl_basic_map
*bmap
, unsigned extra
,
1109 unsigned n_eq
, unsigned n_ineq
)
1112 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
1117 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1118 if (isl_blk_is_error(bmap
->block
))
1121 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1122 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1126 bmap
->block2
= isl_blk_empty();
1129 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1130 if (isl_blk_is_error(bmap
->block2
))
1133 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1138 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1139 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1141 for (i
= 0; i
< extra
; ++i
)
1142 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1146 bmap
->c_size
= n_eq
+ n_ineq
;
1147 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1148 bmap
->extra
= extra
;
1152 bmap
->sample
= NULL
;
1156 isl_basic_map_free(bmap
);
1160 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1161 unsigned nparam
, unsigned dim
, unsigned extra
,
1162 unsigned n_eq
, unsigned n_ineq
)
1164 struct isl_basic_map
*bmap
;
1167 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1171 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1172 return bset_from_bmap(bmap
);
1175 __isl_give isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1176 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1178 struct isl_basic_map
*bmap
;
1181 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1182 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1183 return bset_from_bmap(bmap
);
1185 isl_space_free(dim
);
1189 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1190 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1192 struct isl_basic_map
*bmap
;
1196 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1201 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1203 isl_space_free(dim
);
1207 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1208 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1209 unsigned n_eq
, unsigned n_ineq
)
1211 struct isl_basic_map
*bmap
;
1214 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1218 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1222 static void dup_constraints(
1223 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1226 unsigned total
= isl_basic_map_total_dim(src
);
1228 for (i
= 0; i
< src
->n_eq
; ++i
) {
1229 int j
= isl_basic_map_alloc_equality(dst
);
1230 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1233 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1234 int j
= isl_basic_map_alloc_inequality(dst
);
1235 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1238 for (i
= 0; i
< src
->n_div
; ++i
) {
1239 int j
= isl_basic_map_alloc_div(dst
);
1240 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1242 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1245 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1247 struct isl_basic_map
*dup
;
1251 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1252 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1255 dup_constraints(dup
, bmap
);
1256 dup
->flags
= bmap
->flags
;
1257 dup
->sample
= isl_vec_copy(bmap
->sample
);
1261 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1263 struct isl_basic_map
*dup
;
1265 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1266 return bset_from_bmap(dup
);
1269 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1274 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1278 return isl_basic_set_dup(bset
);
1281 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1290 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1295 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1299 bmap
= isl_basic_map_dup(bmap
);
1301 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1305 __isl_give isl_map
*isl_map_copy(__isl_keep isl_map
*map
)
1314 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1319 if (--bmap
->ref
> 0)
1322 isl_ctx_deref(bmap
->ctx
);
1324 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1326 isl_blk_free(bmap
->ctx
, bmap
->block
);
1327 isl_vec_free(bmap
->sample
);
1328 isl_space_free(bmap
->dim
);
1334 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1336 return isl_basic_map_free(bset_to_bmap(bset
));
1339 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1341 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1344 /* Check that "map" has only named parameters, reporting an error
1347 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1349 return isl_space_check_named_params(isl_map_peek_space(map
));
1352 /* Check that "bmap1" and "bmap2" have the same parameters,
1353 * reporting an error if they do not.
1355 static isl_stat
isl_basic_map_check_equal_params(
1356 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1360 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1362 return isl_stat_error
;
1364 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1365 "parameters don't match", return isl_stat_error
);
1369 __isl_give isl_map
*isl_map_align_params_map_map_and(
1370 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1371 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1372 __isl_take isl_map
*map2
))
1376 if (isl_map_has_equal_params(map1
, map2
))
1377 return fn(map1
, map2
);
1378 if (isl_map_check_named_params(map1
) < 0)
1380 if (isl_map_check_named_params(map2
) < 0)
1382 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1383 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1384 return fn(map1
, map2
);
1391 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1392 __isl_keep isl_map
*map2
,
1393 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1398 return isl_bool_error
;
1399 if (isl_map_has_equal_params(map1
, map2
))
1400 return fn(map1
, map2
);
1401 if (isl_map_check_named_params(map1
) < 0)
1402 return isl_bool_error
;
1403 if (isl_map_check_named_params(map2
) < 0)
1404 return isl_bool_error
;
1405 map1
= isl_map_copy(map1
);
1406 map2
= isl_map_copy(map2
);
1407 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1408 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1415 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1417 struct isl_ctx
*ctx
;
1421 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1422 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1424 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1425 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1426 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1427 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1428 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1429 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1431 int j
= isl_basic_map_alloc_inequality(bmap
);
1435 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1436 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1443 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1444 bmap
->extra
- bmap
->n_div
);
1445 return bmap
->n_eq
++;
1448 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1450 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1453 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1457 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1462 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1464 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1467 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1472 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1474 if (pos
!= bmap
->n_eq
- 1) {
1476 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1477 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1483 /* Turn inequality "pos" of "bmap" into an equality.
1485 * In particular, we move the inequality in front of the equalities
1486 * and move the last inequality in the position of the moved inequality.
1487 * Note that isl_tab_make_equalities_explicit depends on this particular
1488 * change in the ordering of the constraints.
1490 void isl_basic_map_inequality_to_equality(
1491 struct isl_basic_map
*bmap
, unsigned pos
)
1495 t
= bmap
->ineq
[pos
];
1496 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1497 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1502 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1503 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1504 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1505 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1508 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1510 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1513 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1515 struct isl_ctx
*ctx
;
1519 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1520 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1521 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1522 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1523 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1524 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1525 1 + isl_basic_map_total_dim(bmap
),
1526 bmap
->extra
- bmap
->n_div
);
1527 return bmap
->n_ineq
++;
1530 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1532 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1535 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1539 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1544 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1546 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1549 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1554 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1556 if (pos
!= bmap
->n_ineq
- 1) {
1557 t
= bmap
->ineq
[pos
];
1558 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1559 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1560 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1566 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1568 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1571 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1576 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1579 k
= isl_basic_map_alloc_equality(bmap
);
1582 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1585 isl_basic_map_free(bmap
);
1589 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1592 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1595 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1600 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1603 k
= isl_basic_map_alloc_inequality(bmap
);
1606 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1609 isl_basic_map_free(bmap
);
1613 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1616 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1619 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1623 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1624 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1625 1 + 1 + isl_basic_map_total_dim(bmap
),
1626 bmap
->extra
- bmap
->n_div
);
1627 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1628 return bmap
->n_div
++;
1631 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1633 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1636 /* Check that there are "n" dimensions of type "type" starting at "first"
1639 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1640 enum isl_dim_type type
, unsigned first
, unsigned n
)
1645 return isl_stat_error
;
1646 dim
= isl_basic_map_dim(bmap
, type
);
1647 if (first
+ n
> dim
|| first
+ n
< first
)
1648 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1649 "position or range out of bounds",
1650 return isl_stat_error
);
1654 /* Insert an extra integer division, prescribed by "div", to "bmap"
1655 * at (integer division) position "pos".
1657 * The integer division is first added at the end and then moved
1658 * into the right position.
1660 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1661 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1665 bmap
= isl_basic_map_cow(bmap
);
1667 return isl_basic_map_free(bmap
);
1669 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1670 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1671 "unexpected size", return isl_basic_map_free(bmap
));
1672 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1673 return isl_basic_map_free(bmap
);
1675 bmap
= isl_basic_map_extend_space(bmap
,
1676 isl_basic_map_get_space(bmap
), 1, 0, 2);
1677 k
= isl_basic_map_alloc_div(bmap
);
1679 return isl_basic_map_free(bmap
);
1680 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1681 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1683 for (i
= k
; i
> pos
; --i
)
1684 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1689 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1692 return isl_stat_error
;
1693 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1698 /* Copy constraint from src to dst, putting the vars of src at offset
1699 * dim_off in dst and the divs of src at offset div_off in dst.
1700 * If both sets are actually map, then dim_off applies to the input
1703 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1704 struct isl_basic_map
*src_map
, isl_int
*src
,
1705 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1707 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1708 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1709 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1710 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1711 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1712 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1713 isl_int_set(dst
[0], src
[0]);
1714 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1715 if (dst_nparam
> src_nparam
)
1716 isl_seq_clr(dst
+1+src_nparam
,
1717 dst_nparam
- src_nparam
);
1718 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1719 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1721 isl_min(dst_in
-in_off
, src_in
));
1722 if (dst_in
-in_off
> src_in
)
1723 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1724 dst_in
- in_off
- src_in
);
1725 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1726 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1727 src
+1+src_nparam
+src_in
,
1728 isl_min(dst_out
-out_off
, src_out
));
1729 if (dst_out
-out_off
> src_out
)
1730 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1731 dst_out
- out_off
- src_out
);
1732 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1733 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1734 src
+1+src_nparam
+src_in
+src_out
,
1735 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1736 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1737 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1738 div_off
+src_map
->n_div
,
1739 dst_map
->n_div
- div_off
- src_map
->n_div
);
1742 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1743 struct isl_basic_map
*src_map
, isl_int
*src
,
1744 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1746 isl_int_set(dst
[0], src
[0]);
1747 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1750 static __isl_give isl_basic_map
*add_constraints(
1751 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1752 unsigned i_pos
, unsigned o_pos
)
1757 if (!bmap1
|| !bmap2
)
1760 div_off
= bmap1
->n_div
;
1762 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1763 int i1
= isl_basic_map_alloc_equality(bmap1
);
1766 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1767 i_pos
, o_pos
, div_off
);
1770 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1771 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1774 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1775 i_pos
, o_pos
, div_off
);
1778 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1779 int i1
= isl_basic_map_alloc_div(bmap1
);
1782 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1783 i_pos
, o_pos
, div_off
);
1786 isl_basic_map_free(bmap2
);
1791 isl_basic_map_free(bmap1
);
1792 isl_basic_map_free(bmap2
);
1796 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1797 struct isl_basic_set
*bset2
, unsigned pos
)
1799 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1800 bset_to_bmap(bset2
), 0, pos
));
1803 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1804 __isl_take isl_basic_map
*base
, __isl_take isl_space
*dim
,
1805 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1807 struct isl_basic_map
*ext
;
1817 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1818 base
->extra
>= base
->n_div
+ extra
;
1820 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1821 room_for_ineq(base
, n_ineq
)) {
1822 isl_space_free(dim
);
1826 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1827 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1828 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1829 extra
+= base
->extra
;
1831 n_ineq
+= base
->n_ineq
;
1833 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1839 ext
->sample
= isl_vec_copy(base
->sample
);
1840 flags
= base
->flags
;
1841 ext
= add_constraints(ext
, base
, 0, 0);
1844 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1850 isl_space_free(dim
);
1851 isl_basic_map_free(base
);
1855 __isl_give isl_basic_set
*isl_basic_set_extend_space(
1856 __isl_take isl_basic_set
*base
,
1857 __isl_take isl_space
*dim
, unsigned extra
,
1858 unsigned n_eq
, unsigned n_ineq
)
1860 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1861 dim
, extra
, n_eq
, n_ineq
));
1864 struct isl_basic_map
*isl_basic_map_extend_constraints(
1865 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1869 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1873 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1874 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1875 unsigned n_eq
, unsigned n_ineq
)
1877 struct isl_basic_map
*bmap
;
1882 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1886 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1889 isl_basic_map_free(base
);
1893 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1894 unsigned nparam
, unsigned dim
, unsigned extra
,
1895 unsigned n_eq
, unsigned n_ineq
)
1897 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1898 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1901 struct isl_basic_set
*isl_basic_set_extend_constraints(
1902 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1904 isl_basic_map
*bmap
= bset_to_bmap(base
);
1905 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1906 return bset_from_bmap(bmap
);
1909 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1911 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1914 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1919 if (bmap
->ref
> 1) {
1921 bmap
= isl_basic_map_dup(bmap
);
1924 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1925 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1930 /* Clear all cached information in "map", either because it is about
1931 * to be modified or because it is being freed.
1932 * Always return the same pointer that is passed in.
1933 * This is needed for the use in isl_map_free.
1935 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1937 isl_basic_map_free(map
->cached_simple_hull
[0]);
1938 isl_basic_map_free(map
->cached_simple_hull
[1]);
1939 map
->cached_simple_hull
[0] = NULL
;
1940 map
->cached_simple_hull
[1] = NULL
;
1944 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1946 return isl_map_cow(set
);
1949 /* Return an isl_map that is equal to "map" and that has only
1950 * a single reference.
1952 * If the original input already has only one reference, then
1953 * simply return it, but clear all cached information, since
1954 * it may be rendered invalid by the operations that will be
1955 * performed on the result.
1957 * Otherwise, create a duplicate (without any cached information).
1959 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
1965 return clear_caches(map
);
1967 return isl_map_dup(map
);
1970 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1971 unsigned a_len
, unsigned b_len
)
1973 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1974 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1975 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1978 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1979 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1987 isl_assert(bmap
->ctx
,
1988 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1990 if (n1
== 0 || n2
== 0)
1993 bmap
= isl_basic_map_cow(bmap
);
1997 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1998 if (isl_blk_is_error(blk
))
2001 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2003 bmap
->eq
[i
] + pos
, n1
, n2
);
2005 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2007 bmap
->ineq
[i
] + pos
, n1
, n2
);
2009 for (i
= 0; i
< bmap
->n_div
; ++i
)
2011 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2013 isl_blk_free(bmap
->ctx
, blk
);
2015 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
2016 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2017 return isl_basic_map_finalize(bmap
);
2019 isl_basic_map_free(bmap
);
2023 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2024 __isl_take isl_basic_map
*bmap
)
2030 total
= isl_basic_map_total_dim(bmap
);
2031 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2032 return isl_basic_map_free(bmap
);
2033 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2035 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2037 i
= isl_basic_map_alloc_equality(bmap
);
2041 isl_int_set_si(bmap
->eq
[i
][0], 1);
2042 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2043 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2044 isl_vec_free(bmap
->sample
);
2045 bmap
->sample
= NULL
;
2046 return isl_basic_map_finalize(bmap
);
2048 isl_basic_map_free(bmap
);
2052 __isl_give isl_basic_set
*isl_basic_set_set_to_empty(
2053 __isl_take isl_basic_set
*bset
)
2055 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2058 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2059 __isl_take isl_basic_map
*bmap
)
2064 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2067 bmap
= isl_basic_map_cow(bmap
);
2071 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2073 return isl_basic_map_finalize(bmap
);
2076 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2077 __isl_take isl_basic_set
*bset
)
2079 return isl_basic_map_set_rational(bset
);
2082 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2083 __isl_take isl_basic_set
*bset
)
2088 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2091 bset
= isl_basic_set_cow(bset
);
2095 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2097 return isl_basic_set_finalize(bset
);
2100 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2104 map
= isl_map_cow(map
);
2107 for (i
= 0; i
< map
->n
; ++i
) {
2108 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2118 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2120 return isl_map_set_rational(set
);
2123 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2126 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2128 isl_int
*t
= bmap
->div
[a
];
2129 bmap
->div
[a
] = bmap
->div
[b
];
2133 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2134 * div definitions accordingly.
2136 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
2139 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2141 swap_div(bmap
, a
, b
);
2143 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2144 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2146 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2147 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2149 for (i
= 0; i
< bmap
->n_div
; ++i
)
2150 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2151 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2154 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
2155 * div definitions accordingly.
2157 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
2159 isl_basic_map_swap_div(bset
, a
, b
);
2162 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2164 isl_seq_cpy(c
, c
+ n
, rem
);
2165 isl_seq_clr(c
+ rem
, n
);
2168 /* Drop n dimensions starting at first.
2170 * In principle, this frees up some extra variables as the number
2171 * of columns remains constant, but we would have to extend
2172 * the div array too as the number of rows in this array is assumed
2173 * to be equal to extra.
2175 __isl_give isl_basic_set
*isl_basic_set_drop_dims(
2176 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2178 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2181 /* Move "n" divs starting at "first" to the end of the list of divs.
2183 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2184 unsigned first
, unsigned n
)
2189 if (first
+ n
== bmap
->n_div
)
2192 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2195 for (i
= 0; i
< n
; ++i
)
2196 div
[i
] = bmap
->div
[first
+ i
];
2197 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2198 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2199 for (i
= 0; i
< n
; ++i
)
2200 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2204 isl_basic_map_free(bmap
);
2208 /* Drop "n" dimensions of type "type" starting at "first".
2210 * In principle, this frees up some extra variables as the number
2211 * of columns remains constant, but we would have to extend
2212 * the div array too as the number of rows in this array is assumed
2213 * to be equal to extra.
2215 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2216 enum isl_dim_type type
, unsigned first
, unsigned n
)
2226 dim
= isl_basic_map_dim(bmap
, type
);
2227 isl_assert(bmap
->ctx
, first
+ n
<= dim
, goto error
);
2229 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2232 bmap
= isl_basic_map_cow(bmap
);
2236 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2237 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2238 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2239 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2241 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2242 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2244 for (i
= 0; i
< bmap
->n_div
; ++i
)
2245 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2247 if (type
== isl_dim_div
) {
2248 bmap
= move_divs_last(bmap
, first
, n
);
2251 if (isl_basic_map_free_div(bmap
, n
) < 0)
2252 return isl_basic_map_free(bmap
);
2254 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2258 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2259 bmap
= isl_basic_map_simplify(bmap
);
2260 return isl_basic_map_finalize(bmap
);
2262 isl_basic_map_free(bmap
);
2266 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2267 enum isl_dim_type type
, unsigned first
, unsigned n
)
2269 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2273 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2274 enum isl_dim_type type
, unsigned first
, unsigned n
)
2281 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2283 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2285 map
= isl_map_cow(map
);
2288 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2292 for (i
= 0; i
< map
->n
; ++i
) {
2293 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2297 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2305 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2306 enum isl_dim_type type
, unsigned first
, unsigned n
)
2308 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2312 * We don't cow, as the div is assumed to be redundant.
2314 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2315 __isl_take isl_basic_map
*bmap
, unsigned div
)
2323 pos
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + div
;
2325 isl_assert(bmap
->ctx
, div
< bmap
->n_div
, goto error
);
2327 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2328 constraint_drop_vars(bmap
->eq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2330 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2331 if (!isl_int_is_zero(bmap
->ineq
[i
][pos
])) {
2332 isl_basic_map_drop_inequality(bmap
, i
);
2336 constraint_drop_vars(bmap
->ineq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2339 for (i
= 0; i
< bmap
->n_div
; ++i
)
2340 constraint_drop_vars(bmap
->div
[i
]+1+pos
, 1, bmap
->extra
-div
-1);
2342 if (div
!= bmap
->n_div
- 1) {
2344 isl_int
*t
= bmap
->div
[div
];
2346 for (j
= div
; j
< bmap
->n_div
- 1; ++j
)
2347 bmap
->div
[j
] = bmap
->div
[j
+1];
2349 bmap
->div
[bmap
->n_div
- 1] = t
;
2351 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2352 if (isl_basic_map_free_div(bmap
, 1) < 0)
2353 return isl_basic_map_free(bmap
);
2357 isl_basic_map_free(bmap
);
2361 /* Eliminate the specified n dimensions starting at first from the
2362 * constraints, without removing the dimensions from the space.
2363 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2365 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2366 enum isl_dim_type type
, unsigned first
, unsigned n
)
2375 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2376 isl_die(map
->ctx
, isl_error_invalid
,
2377 "index out of bounds", goto error
);
2379 map
= isl_map_cow(map
);
2383 for (i
= 0; i
< map
->n
; ++i
) {
2384 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2394 /* Eliminate the specified n dimensions starting at first from the
2395 * constraints, without removing the dimensions from the space.
2396 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2398 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2399 enum isl_dim_type type
, unsigned first
, unsigned n
)
2401 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2404 /* Eliminate the specified n dimensions starting at first from the
2405 * constraints, without removing the dimensions from the space.
2406 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2408 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2409 unsigned first
, unsigned n
)
2411 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2414 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2415 __isl_take isl_basic_map
*bmap
)
2419 bmap
= isl_basic_map_eliminate_vars(bmap
,
2420 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2424 return isl_basic_map_finalize(bmap
);
2427 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2428 __isl_take isl_basic_set
*bset
)
2430 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2433 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2442 map
= isl_map_cow(map
);
2446 for (i
= 0; i
< map
->n
; ++i
) {
2447 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2457 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2459 return isl_map_remove_divs(set
);
2462 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2463 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2464 unsigned first
, unsigned n
)
2466 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2467 return isl_basic_map_free(bmap
);
2468 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2470 bmap
= isl_basic_map_eliminate_vars(bmap
,
2471 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2474 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2476 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2480 /* Return true if the definition of the given div (recursively) involves
2481 * any of the given variables.
2483 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2484 unsigned first
, unsigned n
)
2487 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2489 if (isl_int_is_zero(bmap
->div
[div
][0]))
2490 return isl_bool_false
;
2491 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2492 return isl_bool_true
;
2494 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2497 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2499 involves
= div_involves_vars(bmap
, i
, first
, n
);
2500 if (involves
< 0 || involves
)
2504 return isl_bool_false
;
2507 /* Try and add a lower and/or upper bound on "div" to "bmap"
2508 * based on inequality "i".
2509 * "total" is the total number of variables (excluding the divs).
2510 * "v" is a temporary object that can be used during the calculations.
2511 * If "lb" is set, then a lower bound should be constructed.
2512 * If "ub" is set, then an upper bound should be constructed.
2514 * The calling function has already checked that the inequality does not
2515 * reference "div", but we still need to check that the inequality is
2516 * of the right form. We'll consider the case where we want to construct
2517 * a lower bound. The construction of upper bounds is similar.
2519 * Let "div" be of the form
2521 * q = floor((a + f(x))/d)
2523 * We essentially check if constraint "i" is of the form
2527 * so that we can use it to derive a lower bound on "div".
2528 * However, we allow a slightly more general form
2532 * with the condition that the coefficients of g(x) - f(x) are all
2534 * Rewriting this constraint as
2538 * adding a + f(x) to both sides and dividing by d, we obtain
2540 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2542 * Taking the floor on both sides, we obtain
2544 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2548 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2550 * In the case of an upper bound, we construct the constraint
2552 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2555 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2556 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2557 unsigned total
, isl_int v
, int lb
, int ub
)
2561 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2563 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2564 bmap
->div
[div
][1 + 1 + j
]);
2565 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2568 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2569 bmap
->div
[div
][1 + 1 + j
]);
2570 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2576 bmap
= isl_basic_map_cow(bmap
);
2577 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2579 int k
= isl_basic_map_alloc_inequality(bmap
);
2582 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2583 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2584 bmap
->div
[div
][1 + j
]);
2585 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2586 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2588 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2591 int k
= isl_basic_map_alloc_inequality(bmap
);
2594 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2595 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2596 bmap
->div
[div
][1 + j
]);
2597 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2598 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2600 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2603 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2606 isl_basic_map_free(bmap
);
2610 /* This function is called right before "div" is eliminated from "bmap"
2611 * using Fourier-Motzkin.
2612 * Look through the constraints of "bmap" for constraints on the argument
2613 * of the integer division and use them to construct constraints on the
2614 * integer division itself. These constraints can then be combined
2615 * during the Fourier-Motzkin elimination.
2616 * Note that it is only useful to introduce lower bounds on "div"
2617 * if "bmap" already contains upper bounds on "div" as the newly
2618 * introduce lower bounds can then be combined with the pre-existing
2619 * upper bounds. Similarly for upper bounds.
2620 * We therefore first check if "bmap" contains any lower and/or upper bounds
2623 * It is interesting to note that the introduction of these constraints
2624 * can indeed lead to more accurate results, even when compared to
2625 * deriving constraints on the argument of "div" from constraints on "div".
2626 * Consider, for example, the set
2628 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2630 * The second constraint can be rewritten as
2632 * 2 * [(-i-2j+3)/4] + k >= 0
2634 * from which we can derive
2636 * -i - 2j + 3 >= -2k
2642 * Combined with the first constraint, we obtain
2644 * -3 <= 3 + 2k or k >= -3
2646 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2647 * the first constraint, we obtain
2649 * [(i + 2j)/4] >= [-3/4] = -1
2651 * Combining this constraint with the second constraint, we obtain
2655 static __isl_give isl_basic_map
*insert_bounds_on_div(
2656 __isl_take isl_basic_map
*bmap
, int div
)
2659 int check_lb
, check_ub
;
2666 if (isl_int_is_zero(bmap
->div
[div
][0]))
2669 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2673 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2674 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2681 if (!check_lb
&& !check_ub
)
2686 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2687 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2690 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2691 check_lb
, check_ub
);
2699 /* Remove all divs (recursively) involving any of the given dimensions
2700 * in their definitions.
2702 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2703 __isl_take isl_basic_map
*bmap
,
2704 enum isl_dim_type type
, unsigned first
, unsigned n
)
2708 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2709 return isl_basic_map_free(bmap
);
2710 first
+= isl_basic_map_offset(bmap
, type
);
2712 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2715 involves
= div_involves_vars(bmap
, i
, first
, n
);
2717 return isl_basic_map_free(bmap
);
2720 bmap
= insert_bounds_on_div(bmap
, i
);
2721 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2730 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2731 __isl_take isl_basic_set
*bset
,
2732 enum isl_dim_type type
, unsigned first
, unsigned n
)
2734 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2737 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2738 enum isl_dim_type type
, unsigned first
, unsigned n
)
2747 map
= isl_map_cow(map
);
2751 for (i
= 0; i
< map
->n
; ++i
) {
2752 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2763 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2764 enum isl_dim_type type
, unsigned first
, unsigned n
)
2766 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2770 /* Does the description of "bmap" depend on the specified dimensions?
2771 * We also check whether the dimensions appear in any of the div definitions.
2772 * In principle there is no need for this check. If the dimensions appear
2773 * in a div definition, they also appear in the defining constraints of that
2776 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2777 enum isl_dim_type type
, unsigned first
, unsigned n
)
2781 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2782 return isl_bool_error
;
2784 first
+= isl_basic_map_offset(bmap
, type
);
2785 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2786 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2787 return isl_bool_true
;
2788 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2789 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2790 return isl_bool_true
;
2791 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2792 if (isl_int_is_zero(bmap
->div
[i
][0]))
2794 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2795 return isl_bool_true
;
2798 return isl_bool_false
;
2801 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2802 enum isl_dim_type type
, unsigned first
, unsigned n
)
2807 return isl_bool_error
;
2809 if (first
+ n
> isl_map_dim(map
, type
))
2810 isl_die(map
->ctx
, isl_error_invalid
,
2811 "index out of bounds", return isl_bool_error
);
2813 for (i
= 0; i
< map
->n
; ++i
) {
2814 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2816 if (involves
< 0 || involves
)
2820 return isl_bool_false
;
2823 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2824 enum isl_dim_type type
, unsigned first
, unsigned n
)
2826 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2829 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2830 enum isl_dim_type type
, unsigned first
, unsigned n
)
2832 return isl_map_involves_dims(set
, type
, first
, n
);
2835 /* Drop all constraints in bmap that involve any of the dimensions
2836 * first to first+n-1.
2838 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2839 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2846 bmap
= isl_basic_map_cow(bmap
);
2851 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2852 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2854 isl_basic_map_drop_equality(bmap
, i
);
2857 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2858 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2860 isl_basic_map_drop_inequality(bmap
, i
);
2863 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2867 /* Drop all constraints in bset that involve any of the dimensions
2868 * first to first+n-1.
2870 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2871 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2873 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2876 /* Drop all constraints in bmap that do not involve any of the dimensions
2877 * first to first + n - 1 of the given type.
2879 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2880 __isl_take isl_basic_map
*bmap
,
2881 enum isl_dim_type type
, unsigned first
, unsigned n
)
2886 isl_space
*space
= isl_basic_map_get_space(bmap
);
2887 isl_basic_map_free(bmap
);
2888 return isl_basic_map_universe(space
);
2890 bmap
= isl_basic_map_cow(bmap
);
2894 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2895 return isl_basic_map_free(bmap
);
2897 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2899 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2900 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2902 isl_basic_map_drop_equality(bmap
, i
);
2905 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2906 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2908 isl_basic_map_drop_inequality(bmap
, i
);
2911 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2915 /* Drop all constraints in bset that do not involve any of the dimensions
2916 * first to first + n - 1 of the given type.
2918 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2919 __isl_take isl_basic_set
*bset
,
2920 enum isl_dim_type type
, unsigned first
, unsigned n
)
2922 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2926 /* Drop all constraints in bmap that involve any of the dimensions
2927 * first to first + n - 1 of the given type.
2929 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2930 __isl_take isl_basic_map
*bmap
,
2931 enum isl_dim_type type
, unsigned first
, unsigned n
)
2938 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2939 return isl_basic_map_free(bmap
);
2941 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2942 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2943 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2946 /* Drop all constraints in bset that involve any of the dimensions
2947 * first to first + n - 1 of the given type.
2949 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2950 __isl_take isl_basic_set
*bset
,
2951 enum isl_dim_type type
, unsigned first
, unsigned n
)
2953 return isl_basic_map_drop_constraints_involving_dims(bset
,
2957 /* Drop constraints from "map" by applying "drop" to each basic map.
2959 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2960 enum isl_dim_type type
, unsigned first
, unsigned n
,
2961 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2962 enum isl_dim_type type
, unsigned first
, unsigned n
))
2970 dim
= isl_map_dim(map
, type
);
2971 if (first
+ n
> dim
|| first
+ n
< first
)
2972 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2973 "index out of bounds", return isl_map_free(map
));
2975 map
= isl_map_cow(map
);
2979 for (i
= 0; i
< map
->n
; ++i
) {
2980 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
2982 return isl_map_free(map
);
2986 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2991 /* Drop all constraints in map that involve any of the dimensions
2992 * first to first + n - 1 of the given type.
2994 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
2995 __isl_take isl_map
*map
,
2996 enum isl_dim_type type
, unsigned first
, unsigned n
)
3000 return drop_constraints(map
, type
, first
, n
,
3001 &isl_basic_map_drop_constraints_involving_dims
);
3004 /* Drop all constraints in "map" that do not involve any of the dimensions
3005 * first to first + n - 1 of the given type.
3007 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
3008 __isl_take isl_map
*map
,
3009 enum isl_dim_type type
, unsigned first
, unsigned n
)
3012 isl_space
*space
= isl_map_get_space(map
);
3014 return isl_map_universe(space
);
3016 return drop_constraints(map
, type
, first
, n
,
3017 &isl_basic_map_drop_constraints_not_involving_dims
);
3020 /* Drop all constraints in set that involve any of the dimensions
3021 * first to first + n - 1 of the given type.
3023 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
3024 __isl_take isl_set
*set
,
3025 enum isl_dim_type type
, unsigned first
, unsigned n
)
3027 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
3030 /* Drop all constraints in "set" that do not involve any of the dimensions
3031 * first to first + n - 1 of the given type.
3033 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
3034 __isl_take isl_set
*set
,
3035 enum isl_dim_type type
, unsigned first
, unsigned n
)
3037 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3040 /* Does local variable "div" of "bmap" have a complete explicit representation?
3041 * Having a complete explicit representation requires not only
3042 * an explicit representation, but also that all local variables
3043 * that appear in this explicit representation in turn have
3044 * a complete explicit representation.
3046 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3049 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3052 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3053 if (marked
< 0 || marked
)
3054 return isl_bool_not(marked
);
3056 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3059 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3061 known
= isl_basic_map_div_is_known(bmap
, i
);
3062 if (known
< 0 || !known
)
3066 return isl_bool_true
;
3069 /* Remove all divs that are unknown or defined in terms of unknown divs.
3071 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3072 __isl_take isl_basic_map
*bmap
)
3079 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3080 if (isl_basic_map_div_is_known(bmap
, i
))
3082 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3091 /* Remove all divs that are unknown or defined in terms of unknown divs.
3093 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3094 __isl_take isl_basic_set
*bset
)
3096 return isl_basic_map_remove_unknown_divs(bset
);
3099 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3108 map
= isl_map_cow(map
);
3112 for (i
= 0; i
< map
->n
; ++i
) {
3113 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3123 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3125 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3128 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3129 __isl_take isl_basic_set
*bset
,
3130 enum isl_dim_type type
, unsigned first
, unsigned n
)
3132 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3133 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3134 return bset_from_bmap(bmap
);
3137 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3138 enum isl_dim_type type
, unsigned first
, unsigned n
)
3145 map
= isl_map_cow(map
);
3148 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3150 for (i
= 0; i
< map
->n
; ++i
) {
3151 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3152 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3156 map
= isl_map_drop(map
, type
, first
, n
);
3163 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3164 enum isl_dim_type type
, unsigned first
, unsigned n
)
3166 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3170 /* Project out n inputs starting at first using Fourier-Motzkin */
3171 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3172 unsigned first
, unsigned n
)
3174 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3177 static void dump_term(struct isl_basic_map
*bmap
,
3178 isl_int c
, int pos
, FILE *out
)
3181 unsigned in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3182 unsigned dim
= in
+ isl_basic_map_dim(bmap
, isl_dim_out
);
3183 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3185 isl_int_print(out
, c
, 0);
3187 if (!isl_int_is_one(c
))
3188 isl_int_print(out
, c
, 0);
3189 if (pos
< 1 + nparam
) {
3190 name
= isl_space_get_dim_name(bmap
->dim
,
3191 isl_dim_param
, pos
- 1);
3193 fprintf(out
, "%s", name
);
3195 fprintf(out
, "p%d", pos
- 1);
3196 } else if (pos
< 1 + nparam
+ in
)
3197 fprintf(out
, "i%d", pos
- 1 - nparam
);
3198 else if (pos
< 1 + nparam
+ dim
)
3199 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
3201 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
3205 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
3206 int sign
, FILE *out
)
3210 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
3214 for (i
= 0, first
= 1; i
< len
; ++i
) {
3215 if (isl_int_sgn(c
[i
]) * sign
<= 0)
3218 fprintf(out
, " + ");
3220 isl_int_abs(v
, c
[i
]);
3221 dump_term(bmap
, v
, i
, out
);
3228 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
3229 const char *op
, FILE *out
, int indent
)
3233 fprintf(out
, "%*s", indent
, "");
3235 dump_constraint_sign(bmap
, c
, 1, out
);
3236 fprintf(out
, " %s ", op
);
3237 dump_constraint_sign(bmap
, c
, -1, out
);
3241 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
3242 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
3244 fprintf(out
, "%*s", indent
, "");
3245 fprintf(out
, "ERROR: unused div coefficient not zero\n");
3250 static void dump_constraints(struct isl_basic_map
*bmap
,
3251 isl_int
**c
, unsigned n
,
3252 const char *op
, FILE *out
, int indent
)
3256 for (i
= 0; i
< n
; ++i
)
3257 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
3260 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
3264 unsigned total
= isl_basic_map_total_dim(bmap
);
3266 for (j
= 0; j
< 1 + total
; ++j
) {
3267 if (isl_int_is_zero(exp
[j
]))
3269 if (!first
&& isl_int_is_pos(exp
[j
]))
3271 dump_term(bmap
, exp
[j
], j
, out
);
3276 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
3280 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
3281 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
3283 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3284 fprintf(out
, "%*s", indent
, "");
3285 fprintf(out
, "e%d = [(", i
);
3286 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
3288 isl_int_print(out
, bmap
->div
[i
][0], 0);
3289 fprintf(out
, "]\n");
3293 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3294 FILE *out
, int indent
)
3297 fprintf(out
, "null basic set\n");
3301 fprintf(out
, "%*s", indent
, "");
3302 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3303 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3304 bset
->extra
, bset
->flags
);
3305 dump(bset_to_bmap(bset
), out
, indent
);
3308 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3309 FILE *out
, int indent
)
3312 fprintf(out
, "null basic map\n");
3316 fprintf(out
, "%*s", indent
, "");
3317 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3318 "flags: %x, n_name: %d\n",
3320 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3321 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3322 dump(bmap
, out
, indent
);
3325 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
3330 total
= isl_basic_map_total_dim(bmap
);
3331 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
3332 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3333 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3334 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3338 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3343 if (isl_space_dim(space
, isl_dim_in
) != 0)
3344 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3345 "set cannot have input dimensions", goto error
);
3346 return isl_map_alloc_space(space
, n
, flags
);
3348 isl_space_free(space
);
3352 /* Make sure "map" has room for at least "n" more basic maps.
3354 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3357 struct isl_map
*grown
= NULL
;
3361 isl_assert(map
->ctx
, n
>= 0, goto error
);
3362 if (map
->n
+ n
<= map
->size
)
3364 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3367 for (i
= 0; i
< map
->n
; ++i
) {
3368 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3376 isl_map_free(grown
);
3381 /* Make sure "set" has room for at least "n" more basic sets.
3383 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3385 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3388 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3390 return isl_map_from_basic_map(bset
);
3393 __isl_give isl_map
*isl_map_from_basic_map(__isl_take isl_basic_map
*bmap
)
3395 struct isl_map
*map
;
3400 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3401 return isl_map_add_basic_map(map
, bmap
);
3404 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3405 __isl_take isl_basic_set
*bset
)
3407 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3408 bset_to_bmap(bset
)));
3411 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3413 return isl_map_free(set
);
3416 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3421 fprintf(out
, "null set\n");
3425 fprintf(out
, "%*s", indent
, "");
3426 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3427 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3429 for (i
= 0; i
< set
->n
; ++i
) {
3430 fprintf(out
, "%*s", indent
, "");
3431 fprintf(out
, "basic set %d:\n", i
);
3432 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3436 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3441 fprintf(out
, "null map\n");
3445 fprintf(out
, "%*s", indent
, "");
3446 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3447 "flags: %x, n_name: %d\n",
3448 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3449 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3450 for (i
= 0; i
< map
->n
; ++i
) {
3451 fprintf(out
, "%*s", indent
, "");
3452 fprintf(out
, "basic map %d:\n", i
);
3453 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3457 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3458 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3460 struct isl_basic_map
*bmap_domain
;
3462 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3465 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3466 isl_assert(bset
->ctx
,
3467 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3469 bmap
= isl_basic_map_cow(bmap
);
3472 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3473 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3474 bmap_domain
= isl_basic_map_from_domain(bset
);
3475 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3477 bmap
= isl_basic_map_simplify(bmap
);
3478 return isl_basic_map_finalize(bmap
);
3480 isl_basic_map_free(bmap
);
3481 isl_basic_set_free(bset
);
3485 /* Check that the space of "bset" is the same as that of the range of "bmap".
3487 static isl_stat
isl_basic_map_check_compatible_range(
3488 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3492 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3494 return isl_stat_error
;
3496 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3497 "incompatible spaces", return isl_stat_error
);
3502 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3503 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3505 struct isl_basic_map
*bmap_range
;
3507 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3510 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3511 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3514 if (isl_basic_set_plain_is_universe(bset
)) {
3515 isl_basic_set_free(bset
);
3519 bmap
= isl_basic_map_cow(bmap
);
3522 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3523 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3524 bmap_range
= bset_to_bmap(bset
);
3525 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3527 bmap
= isl_basic_map_simplify(bmap
);
3528 return isl_basic_map_finalize(bmap
);
3530 isl_basic_map_free(bmap
);
3531 isl_basic_set_free(bset
);
3535 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3536 __isl_keep isl_vec
*vec
)
3543 return isl_bool_error
;
3545 total
= 1 + isl_basic_map_total_dim(bmap
);
3546 if (total
!= vec
->size
)
3547 return isl_bool_false
;
3551 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3552 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3553 if (!isl_int_is_zero(s
)) {
3555 return isl_bool_false
;
3559 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3560 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3561 if (isl_int_is_neg(s
)) {
3563 return isl_bool_false
;
3569 return isl_bool_true
;
3572 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3573 __isl_keep isl_vec
*vec
)
3575 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3578 __isl_give isl_basic_map
*isl_basic_map_intersect(
3579 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3581 struct isl_vec
*sample
= NULL
;
3583 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3585 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3586 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3587 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3588 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3589 return isl_basic_map_intersect(bmap2
, bmap1
);
3591 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3592 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3593 isl_assert(bmap1
->ctx
,
3594 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3596 if (isl_basic_map_plain_is_empty(bmap1
)) {
3597 isl_basic_map_free(bmap2
);
3600 if (isl_basic_map_plain_is_empty(bmap2
)) {
3601 isl_basic_map_free(bmap1
);
3605 if (bmap1
->sample
&&
3606 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3607 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3608 sample
= isl_vec_copy(bmap1
->sample
);
3609 else if (bmap2
->sample
&&
3610 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3611 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3612 sample
= isl_vec_copy(bmap2
->sample
);
3614 bmap1
= isl_basic_map_cow(bmap1
);
3617 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3618 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3619 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3622 isl_vec_free(sample
);
3624 isl_vec_free(bmap1
->sample
);
3625 bmap1
->sample
= sample
;
3628 bmap1
= isl_basic_map_simplify(bmap1
);
3629 return isl_basic_map_finalize(bmap1
);
3632 isl_vec_free(sample
);
3633 isl_basic_map_free(bmap1
);
3634 isl_basic_map_free(bmap2
);
3638 struct isl_basic_set
*isl_basic_set_intersect(
3639 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3641 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3642 bset_to_bmap(bset2
)));
3645 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3646 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3648 return isl_basic_set_intersect(bset1
, bset2
);
3651 /* Special case of isl_map_intersect, where both map1 and map2
3652 * are convex, without any divs and such that either map1 or map2
3653 * contains a single constraint. This constraint is then simply
3654 * added to the other map.
3656 static __isl_give isl_map
*map_intersect_add_constraint(
3657 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3659 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3660 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3661 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3662 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3664 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3665 return isl_map_intersect(map2
, map1
);
3667 map1
= isl_map_cow(map1
);
3670 if (isl_map_plain_is_empty(map1
)) {
3674 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3675 if (map2
->p
[0]->n_eq
== 1)
3676 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3678 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3679 map2
->p
[0]->ineq
[0]);
3681 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3682 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3686 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3687 isl_basic_map_free(map1
->p
[0]);
3700 /* map2 may be either a parameter domain or a map living in the same
3703 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3704 __isl_take isl_map
*map2
)
3713 if ((isl_map_plain_is_empty(map1
) ||
3714 isl_map_plain_is_universe(map2
)) &&
3715 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3719 if ((isl_map_plain_is_empty(map2
) ||
3720 isl_map_plain_is_universe(map1
)) &&
3721 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3726 if (map1
->n
== 1 && map2
->n
== 1 &&
3727 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3728 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3729 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3730 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3731 return map_intersect_add_constraint(map1
, map2
);
3733 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3734 isl_space_dim(map2
->dim
, isl_dim_param
))
3735 isl_assert(map1
->ctx
,
3736 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3738 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3739 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3740 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3742 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3743 map1
->n
* map2
->n
, flags
);
3746 for (i
= 0; i
< map1
->n
; ++i
)
3747 for (j
= 0; j
< map2
->n
; ++j
) {
3748 struct isl_basic_map
*part
;
3749 part
= isl_basic_map_intersect(
3750 isl_basic_map_copy(map1
->p
[i
]),
3751 isl_basic_map_copy(map2
->p
[j
]));
3752 if (isl_basic_map_is_empty(part
) < 0)
3753 part
= isl_basic_map_free(part
);
3754 result
= isl_map_add_basic_map(result
, part
);
3767 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3768 __isl_take isl_map
*map2
)
3772 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3773 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3774 "spaces don't match", goto error
);
3775 return map_intersect_internal(map1
, map2
);
3782 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3783 __isl_take isl_map
*map2
)
3785 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3788 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3790 return set_from_map(isl_map_intersect(set_to_map(set1
),
3794 /* map_intersect_internal accepts intersections
3795 * with parameter domains, so we can just call that function.
3797 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3798 __isl_take isl_set
*params
)
3800 return map_intersect_internal(map
, params
);
3803 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3804 __isl_take isl_map
*map2
)
3806 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3809 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3810 __isl_take isl_set
*params
)
3812 return isl_map_intersect_params(set
, params
);
3815 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3818 unsigned pos
, n1
, n2
;
3822 bmap
= isl_basic_map_cow(bmap
);
3825 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3826 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3827 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3828 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3829 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3830 return isl_basic_map_reset_space(bmap
, space
);
3833 static __isl_give isl_basic_map
*basic_map_space_reset(
3834 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3840 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3843 space
= isl_basic_map_get_space(bmap
);
3844 space
= isl_space_reset(space
, type
);
3845 bmap
= isl_basic_map_reset_space(bmap
, space
);
3849 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3850 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3851 unsigned pos
, unsigned n
)
3855 struct isl_basic_map
*res
;
3856 struct isl_dim_map
*dim_map
;
3857 unsigned total
, off
;
3858 enum isl_dim_type t
;
3861 return basic_map_space_reset(bmap
, type
);
3866 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3868 total
= isl_basic_map_total_dim(bmap
) + n
;
3869 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3871 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3873 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3875 unsigned size
= isl_basic_map_dim(bmap
, t
);
3876 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3878 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3879 pos
, size
- pos
, off
+ pos
+ n
);
3881 off
+= isl_space_dim(res_dim
, t
);
3883 isl_dim_map_div(dim_map
, bmap
, off
);
3885 res
= isl_basic_map_alloc_space(res_dim
,
3886 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3887 rational
= isl_basic_map_is_rational(bmap
);
3889 res
= isl_basic_map_free(res
);
3891 res
= isl_basic_map_set_rational(res
);
3892 if (isl_basic_map_plain_is_empty(bmap
)) {
3893 isl_basic_map_free(bmap
);
3895 return isl_basic_map_set_to_empty(res
);
3897 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3898 return isl_basic_map_finalize(res
);
3901 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3902 __isl_take isl_basic_set
*bset
,
3903 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3905 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3908 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3909 enum isl_dim_type type
, unsigned n
)
3913 return isl_basic_map_insert_dims(bmap
, type
,
3914 isl_basic_map_dim(bmap
, type
), n
);
3917 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3918 enum isl_dim_type type
, unsigned n
)
3922 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3923 return isl_basic_map_add_dims(bset
, type
, n
);
3925 isl_basic_set_free(bset
);
3929 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3930 enum isl_dim_type type
)
3934 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3937 space
= isl_map_get_space(map
);
3938 space
= isl_space_reset(space
, type
);
3939 map
= isl_map_reset_space(map
, space
);
3943 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3944 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3949 return map_space_reset(map
, type
);
3951 map
= isl_map_cow(map
);
3955 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3959 for (i
= 0; i
< map
->n
; ++i
) {
3960 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3971 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3972 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3974 return isl_map_insert_dims(set
, type
, pos
, n
);
3977 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3978 enum isl_dim_type type
, unsigned n
)
3982 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3985 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3986 enum isl_dim_type type
, unsigned n
)
3990 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3991 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
3997 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3998 __isl_take isl_basic_map
*bmap
,
3999 enum isl_dim_type dst_type
, unsigned dst_pos
,
4000 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4002 struct isl_dim_map
*dim_map
;
4003 struct isl_basic_map
*res
;
4004 enum isl_dim_type t
;
4005 unsigned total
, off
;
4010 bmap
= isl_basic_map_reset(bmap
, src_type
);
4011 bmap
= isl_basic_map_reset(bmap
, dst_type
);
4015 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
4016 return isl_basic_map_free(bmap
);
4018 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4021 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
4023 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
4024 pos(bmap
->dim
, src_type
) + src_pos
+
4025 ((src_type
< dst_type
) ? n
: 0)) {
4026 bmap
= isl_basic_map_cow(bmap
);
4030 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4031 src_type
, src_pos
, n
);
4035 bmap
= isl_basic_map_finalize(bmap
);
4040 total
= isl_basic_map_total_dim(bmap
);
4041 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4044 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4045 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4046 if (t
== dst_type
) {
4047 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4050 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
4053 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4054 dst_pos
, size
- dst_pos
, off
);
4055 off
+= size
- dst_pos
;
4056 } else if (t
== src_type
) {
4057 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4060 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4061 src_pos
+ n
, size
- src_pos
- n
, off
);
4062 off
+= size
- src_pos
- n
;
4064 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4068 isl_dim_map_div(dim_map
, bmap
, off
);
4070 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4071 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4072 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4076 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4077 src_type
, src_pos
, n
);
4081 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4082 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4083 bmap
= isl_basic_map_finalize(bmap
);
4087 isl_basic_map_free(bmap
);
4091 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4092 enum isl_dim_type dst_type
, unsigned dst_pos
,
4093 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4095 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4096 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4097 src_type
, src_pos
, n
);
4098 return bset_from_bmap(bmap
);
4101 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4102 enum isl_dim_type dst_type
, unsigned dst_pos
,
4103 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4107 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4108 return set_from_map(isl_map_move_dims(set_to_map(set
),
4109 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4115 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4116 enum isl_dim_type dst_type
, unsigned dst_pos
,
4117 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4124 map
= isl_map_reset(map
, src_type
);
4125 map
= isl_map_reset(map
, dst_type
);
4129 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
4132 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4135 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4137 map
= isl_map_cow(map
);
4141 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4145 for (i
= 0; i
< map
->n
; ++i
) {
4146 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4148 src_type
, src_pos
, n
);
4159 /* Move the specified dimensions to the last columns right before
4160 * the divs. Don't change the dimension specification of bmap.
4161 * That's the responsibility of the caller.
4163 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4164 enum isl_dim_type type
, unsigned first
, unsigned n
)
4166 struct isl_dim_map
*dim_map
;
4167 struct isl_basic_map
*res
;
4168 enum isl_dim_type t
;
4169 unsigned total
, off
;
4173 if (pos(bmap
->dim
, type
) + first
+ n
==
4174 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
4177 total
= isl_basic_map_total_dim(bmap
);
4178 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4181 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4182 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4184 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4187 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4188 first
, n
, total
- bmap
->n_div
- n
);
4189 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4190 first
+ n
, size
- (first
+ n
), off
);
4191 off
+= size
- (first
+ n
);
4193 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4197 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4199 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4200 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4201 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4205 /* Insert "n" rows in the divs of "bmap".
4207 * The number of columns is not changed, which means that the last
4208 * dimensions of "bmap" are being reintepreted as the new divs.
4209 * The space of "bmap" is not adjusted, however, which means
4210 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4211 * from the space of "bmap" is the responsibility of the caller.
4213 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4221 bmap
= isl_basic_map_cow(bmap
);
4225 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
4226 old
= bmap
->block2
.data
;
4227 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4228 (bmap
->extra
+ n
) * (1 + row_size
));
4229 if (!bmap
->block2
.data
)
4230 return isl_basic_map_free(bmap
);
4231 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4233 return isl_basic_map_free(bmap
);
4234 for (i
= 0; i
< n
; ++i
) {
4235 new_div
[i
] = bmap
->block2
.data
+
4236 (bmap
->extra
+ i
) * (1 + row_size
);
4237 isl_seq_clr(new_div
[i
], 1 + row_size
);
4239 for (i
= 0; i
< bmap
->extra
; ++i
)
4240 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4242 bmap
->div
= new_div
;
4249 /* Drop constraints from "bmap" that only involve the variables
4250 * of "type" in the range [first, first + n] that are not related
4251 * to any of the variables outside that interval.
4252 * These constraints cannot influence the values for the variables
4253 * outside the interval, except in case they cause "bmap" to be empty.
4254 * Only drop the constraints if "bmap" is known to be non-empty.
4256 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4257 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4258 unsigned first
, unsigned n
)
4262 unsigned dim
, n_div
;
4265 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4267 return isl_basic_map_free(bmap
);
4271 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4272 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4273 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4275 return isl_basic_map_free(bmap
);
4276 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4277 for (i
= 0; i
< first
; ++i
)
4279 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4282 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4287 /* Turn the n dimensions of type type, starting at first
4288 * into existentially quantified variables.
4290 * If a subset of the projected out variables are unrelated
4291 * to any of the variables that remain, then the constraints
4292 * involving this subset are simply dropped first.
4294 __isl_give isl_basic_map
*isl_basic_map_project_out(
4295 __isl_take isl_basic_map
*bmap
,
4296 enum isl_dim_type type
, unsigned first
, unsigned n
)
4301 return basic_map_space_reset(bmap
, type
);
4302 if (type
== isl_dim_div
)
4303 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4304 "cannot project out existentially quantified variables",
4305 return isl_basic_map_free(bmap
));
4307 empty
= isl_basic_map_plain_is_empty(bmap
);
4309 return isl_basic_map_free(bmap
);
4311 bmap
= isl_basic_map_set_to_empty(bmap
);
4313 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4317 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4318 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4320 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4321 return isl_basic_map_free(bmap
);
4323 bmap
= move_last(bmap
, type
, first
, n
);
4324 bmap
= isl_basic_map_cow(bmap
);
4325 bmap
= insert_div_rows(bmap
, n
);
4329 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4332 bmap
= isl_basic_map_simplify(bmap
);
4333 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4334 return isl_basic_map_finalize(bmap
);
4336 isl_basic_map_free(bmap
);
4340 /* Turn the n dimensions of type type, starting at first
4341 * into existentially quantified variables.
4343 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4344 enum isl_dim_type type
, unsigned first
, unsigned n
)
4346 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4350 /* Turn the n dimensions of type type, starting at first
4351 * into existentially quantified variables.
4353 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4354 enum isl_dim_type type
, unsigned first
, unsigned n
)
4362 return map_space_reset(map
, type
);
4364 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
4366 map
= isl_map_cow(map
);
4370 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4374 for (i
= 0; i
< map
->n
; ++i
) {
4375 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4386 /* Turn the n dimensions of type type, starting at first
4387 * into existentially quantified variables.
4389 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4390 enum isl_dim_type type
, unsigned first
, unsigned n
)
4392 return set_from_map(isl_map_project_out(set_to_map(set
),
4396 /* Return a map that projects the elements in "set" onto their
4397 * "n" set dimensions starting at "first".
4398 * "type" should be equal to isl_dim_set.
4400 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4401 enum isl_dim_type type
, unsigned first
, unsigned n
)
4409 if (type
!= isl_dim_set
)
4410 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4411 "only set dimensions can be projected out", goto error
);
4412 dim
= isl_set_dim(set
, isl_dim_set
);
4413 if (first
+ n
> dim
|| first
+ n
< first
)
4414 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4415 "index out of bounds", goto error
);
4417 map
= isl_map_from_domain(set
);
4418 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4419 for (i
= 0; i
< n
; ++i
)
4420 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4428 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
4432 for (i
= 0; i
< n
; ++i
) {
4433 j
= isl_basic_map_alloc_div(bmap
);
4436 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4440 isl_basic_map_free(bmap
);
4444 struct isl_basic_map
*isl_basic_map_apply_range(
4445 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4447 isl_space
*dim_result
= NULL
;
4448 struct isl_basic_map
*bmap
;
4449 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4450 struct isl_dim_map
*dim_map1
, *dim_map2
;
4452 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4454 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4455 bmap2
->dim
, isl_dim_in
))
4456 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4457 "spaces don't match", goto error
);
4459 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4460 isl_space_copy(bmap2
->dim
));
4462 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4463 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4464 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4465 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4467 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4468 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4469 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4470 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4471 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4472 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4473 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4474 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4475 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4476 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4477 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4479 bmap
= isl_basic_map_alloc_space(dim_result
,
4480 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4481 bmap1
->n_eq
+ bmap2
->n_eq
,
4482 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4483 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4484 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4485 bmap
= add_divs(bmap
, n
);
4486 bmap
= isl_basic_map_simplify(bmap
);
4487 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4488 return isl_basic_map_finalize(bmap
);
4490 isl_basic_map_free(bmap1
);
4491 isl_basic_map_free(bmap2
);
4495 struct isl_basic_set
*isl_basic_set_apply(
4496 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4501 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4504 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4507 isl_basic_set_free(bset
);
4508 isl_basic_map_free(bmap
);
4512 struct isl_basic_map
*isl_basic_map_apply_domain(
4513 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4515 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4517 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4518 bmap2
->dim
, isl_dim_in
))
4519 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4520 "spaces don't match", goto error
);
4522 bmap1
= isl_basic_map_reverse(bmap1
);
4523 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4524 return isl_basic_map_reverse(bmap1
);
4526 isl_basic_map_free(bmap1
);
4527 isl_basic_map_free(bmap2
);
4531 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4532 * A \cap B -> f(A) + f(B)
4534 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4535 __isl_take isl_basic_map
*bmap2
)
4537 unsigned n_in
, n_out
, nparam
, total
, pos
;
4538 struct isl_basic_map
*bmap
= NULL
;
4539 struct isl_dim_map
*dim_map1
, *dim_map2
;
4542 if (!bmap1
|| !bmap2
)
4545 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4548 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4549 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4550 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4552 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4553 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4554 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4555 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4556 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4557 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4558 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4559 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4560 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4561 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4562 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4564 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4565 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4566 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4567 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4568 for (i
= 0; i
< n_out
; ++i
) {
4569 int j
= isl_basic_map_alloc_equality(bmap
);
4572 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4573 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4574 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4575 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4577 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4578 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4579 bmap
= add_divs(bmap
, 2 * n_out
);
4581 bmap
= isl_basic_map_simplify(bmap
);
4582 return isl_basic_map_finalize(bmap
);
4584 isl_basic_map_free(bmap
);
4585 isl_basic_map_free(bmap1
);
4586 isl_basic_map_free(bmap2
);
4590 /* Given two maps A -> f(A) and B -> g(B), construct a map
4591 * A \cap B -> f(A) + f(B)
4593 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4594 __isl_take isl_map
*map2
)
4596 struct isl_map
*result
;
4602 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4604 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4605 map1
->n
* map2
->n
, 0);
4608 for (i
= 0; i
< map1
->n
; ++i
)
4609 for (j
= 0; j
< map2
->n
; ++j
) {
4610 struct isl_basic_map
*part
;
4611 part
= isl_basic_map_sum(
4612 isl_basic_map_copy(map1
->p
[i
]),
4613 isl_basic_map_copy(map2
->p
[j
]));
4614 if (isl_basic_map_is_empty(part
))
4615 isl_basic_map_free(part
);
4617 result
= isl_map_add_basic_map(result
, part
);
4630 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4631 __isl_take isl_set
*set2
)
4633 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4636 /* Given a basic map A -> f(A), construct A -> -f(A).
4638 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4643 bmap
= isl_basic_map_cow(bmap
);
4647 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4648 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4649 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4650 for (j
= 0; j
< n
; ++j
)
4651 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4652 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4653 for (j
= 0; j
< n
; ++j
)
4654 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4655 for (i
= 0; i
< bmap
->n_div
; ++i
)
4656 for (j
= 0; j
< n
; ++j
)
4657 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4658 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4659 return isl_basic_map_finalize(bmap
);
4662 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4664 return isl_basic_map_neg(bset
);
4667 /* Given a map A -> f(A), construct A -> -f(A).
4669 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4673 map
= isl_map_cow(map
);
4677 for (i
= 0; i
< map
->n
; ++i
) {
4678 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4689 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4691 return set_from_map(isl_map_neg(set_to_map(set
)));
4694 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4695 * A -> floor(f(A)/d).
4697 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4700 unsigned n_in
, n_out
, nparam
, total
, pos
;
4701 struct isl_basic_map
*result
= NULL
;
4702 struct isl_dim_map
*dim_map
;
4708 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4709 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4710 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4712 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4713 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4714 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4715 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4716 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4717 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4719 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4720 bmap
->n_div
+ n_out
,
4721 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4722 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4723 result
= add_divs(result
, n_out
);
4724 for (i
= 0; i
< n_out
; ++i
) {
4726 j
= isl_basic_map_alloc_inequality(result
);
4729 isl_seq_clr(result
->ineq
[j
], 1+total
);
4730 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4731 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4732 j
= isl_basic_map_alloc_inequality(result
);
4735 isl_seq_clr(result
->ineq
[j
], 1+total
);
4736 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4737 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4738 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4741 result
= isl_basic_map_simplify(result
);
4742 return isl_basic_map_finalize(result
);
4744 isl_basic_map_free(result
);
4748 /* Given a map A -> f(A) and an integer d, construct a map
4749 * A -> floor(f(A)/d).
4751 __isl_give isl_map
*isl_map_floordiv(__isl_take isl_map
*map
, isl_int d
)
4755 map
= isl_map_cow(map
);
4759 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4760 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4761 for (i
= 0; i
< map
->n
; ++i
) {
4762 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4773 /* Given a map A -> f(A) and an integer d, construct a map
4774 * A -> floor(f(A)/d).
4776 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4777 __isl_take isl_val
*d
)
4781 if (!isl_val_is_int(d
))
4782 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4783 "expecting integer denominator", goto error
);
4784 map
= isl_map_floordiv(map
, d
->n
);
4793 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4800 i
= isl_basic_map_alloc_equality(bmap
);
4803 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4804 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4805 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4806 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4807 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4808 return isl_basic_map_finalize(bmap
);
4810 isl_basic_map_free(bmap
);
4814 /* Add a constraint to "bmap" expressing i_pos < o_pos
4816 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4823 i
= isl_basic_map_alloc_inequality(bmap
);
4826 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4827 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4828 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4829 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4830 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4831 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4832 return isl_basic_map_finalize(bmap
);
4834 isl_basic_map_free(bmap
);
4838 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4840 static __isl_give isl_basic_map
*var_less_or_equal(
4841 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4847 i
= isl_basic_map_alloc_inequality(bmap
);
4850 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4851 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4852 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4853 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4854 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4855 return isl_basic_map_finalize(bmap
);
4857 isl_basic_map_free(bmap
);
4861 /* Add a constraint to "bmap" expressing i_pos > o_pos
4863 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4870 i
= isl_basic_map_alloc_inequality(bmap
);
4873 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4874 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4875 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4876 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4877 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4878 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4879 return isl_basic_map_finalize(bmap
);
4881 isl_basic_map_free(bmap
);
4885 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4887 static __isl_give isl_basic_map
*var_more_or_equal(
4888 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4894 i
= isl_basic_map_alloc_inequality(bmap
);
4897 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4898 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4899 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4900 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4901 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4902 return isl_basic_map_finalize(bmap
);
4904 isl_basic_map_free(bmap
);
4908 __isl_give isl_basic_map
*isl_basic_map_equal(
4909 __isl_take isl_space
*dim
, unsigned n_equal
)
4912 struct isl_basic_map
*bmap
;
4913 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4916 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4917 bmap
= var_equal(bmap
, i
);
4918 return isl_basic_map_finalize(bmap
);
4921 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4923 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4927 struct isl_basic_map
*bmap
;
4928 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4931 for (i
= 0; i
< pos
&& bmap
; ++i
)
4932 bmap
= var_equal(bmap
, i
);
4934 bmap
= var_less(bmap
, pos
);
4935 return isl_basic_map_finalize(bmap
);
4938 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4940 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4941 __isl_take isl_space
*dim
, unsigned pos
)
4944 isl_basic_map
*bmap
;
4946 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4947 for (i
= 0; i
< pos
; ++i
)
4948 bmap
= var_equal(bmap
, i
);
4949 bmap
= var_less_or_equal(bmap
, pos
);
4950 return isl_basic_map_finalize(bmap
);
4953 /* Return a relation on "dim" expressing i_pos > o_pos
4955 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4959 struct isl_basic_map
*bmap
;
4960 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4963 for (i
= 0; i
< pos
&& bmap
; ++i
)
4964 bmap
= var_equal(bmap
, i
);
4966 bmap
= var_more(bmap
, pos
);
4967 return isl_basic_map_finalize(bmap
);
4970 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
4972 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4973 __isl_take isl_space
*dim
, unsigned pos
)
4976 isl_basic_map
*bmap
;
4978 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4979 for (i
= 0; i
< pos
; ++i
)
4980 bmap
= var_equal(bmap
, i
);
4981 bmap
= var_more_or_equal(bmap
, pos
);
4982 return isl_basic_map_finalize(bmap
);
4985 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4986 unsigned n
, int equal
)
4988 struct isl_map
*map
;
4991 if (n
== 0 && equal
)
4992 return isl_map_universe(dims
);
4994 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4996 for (i
= 0; i
+ 1 < n
; ++i
)
4997 map
= isl_map_add_basic_map(map
,
4998 isl_basic_map_less_at(isl_space_copy(dims
), i
));
5001 map
= isl_map_add_basic_map(map
,
5002 isl_basic_map_less_or_equal_at(dims
, n
- 1));
5004 map
= isl_map_add_basic_map(map
,
5005 isl_basic_map_less_at(dims
, n
- 1));
5007 isl_space_free(dims
);
5012 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
5016 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
5019 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
5021 return map_lex_lte_first(dim
, n
, 0);
5024 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
5026 return map_lex_lte_first(dim
, n
, 1);
5029 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
5031 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
5034 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
5036 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
5039 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
5040 unsigned n
, int equal
)
5042 struct isl_map
*map
;
5045 if (n
== 0 && equal
)
5046 return isl_map_universe(dims
);
5048 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5050 for (i
= 0; i
+ 1 < n
; ++i
)
5051 map
= isl_map_add_basic_map(map
,
5052 isl_basic_map_more_at(isl_space_copy(dims
), i
));
5055 map
= isl_map_add_basic_map(map
,
5056 isl_basic_map_more_or_equal_at(dims
, n
- 1));
5058 map
= isl_map_add_basic_map(map
,
5059 isl_basic_map_more_at(dims
, n
- 1));
5061 isl_space_free(dims
);
5066 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
5070 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
5073 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5075 return map_lex_gte_first(dim
, n
, 0);
5078 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5080 return map_lex_gte_first(dim
, n
, 1);
5083 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5085 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5088 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5090 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5093 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5094 __isl_take isl_set
*set2
)
5097 map
= isl_map_lex_le(isl_set_get_space(set1
));
5098 map
= isl_map_intersect_domain(map
, set1
);
5099 map
= isl_map_intersect_range(map
, set2
);
5103 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5104 __isl_take isl_set
*set2
)
5107 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5108 map
= isl_map_intersect_domain(map
, set1
);
5109 map
= isl_map_intersect_range(map
, set2
);
5113 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5114 __isl_take isl_set
*set2
)
5117 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5118 map
= isl_map_intersect_domain(map
, set1
);
5119 map
= isl_map_intersect_range(map
, set2
);
5123 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5124 __isl_take isl_set
*set2
)
5127 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5128 map
= isl_map_intersect_domain(map
, set1
);
5129 map
= isl_map_intersect_range(map
, set2
);
5133 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5134 __isl_take isl_map
*map2
)
5137 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5138 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5139 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5143 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5144 __isl_take isl_map
*map2
)
5147 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5148 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5149 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5153 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5154 __isl_take isl_map
*map2
)
5157 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5158 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5159 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5163 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5164 __isl_take isl_map
*map2
)
5167 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5168 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5169 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5173 /* For a div d = floor(f/m), add the constraint
5177 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
5178 unsigned pos
, isl_int
*div
)
5181 unsigned total
= isl_basic_map_total_dim(bmap
);
5183 i
= isl_basic_map_alloc_inequality(bmap
);
5185 return isl_stat_error
;
5186 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5187 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
5192 /* For a div d = floor(f/m), add the constraint
5194 * -(f-(m-1)) + m d >= 0
5196 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
5197 unsigned pos
, isl_int
*div
)
5200 unsigned total
= isl_basic_map_total_dim(bmap
);
5202 i
= isl_basic_map_alloc_inequality(bmap
);
5204 return isl_stat_error
;
5205 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5206 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
5207 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5208 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5213 /* For a div d = floor(f/m), add the constraints
5216 * -(f-(m-1)) + m d >= 0
5218 * Note that the second constraint is the negation of
5222 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
5223 unsigned pos
, isl_int
*div
)
5225 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
5227 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
5232 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
5233 unsigned pos
, isl_int
*div
)
5235 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
5239 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
5241 unsigned total
= isl_basic_map_total_dim(bmap
);
5242 unsigned div_pos
= total
- bmap
->n_div
+ div
;
5244 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
5248 /* For each known div d = floor(f/m), add the constraints
5251 * -(f-(m-1)) + m d >= 0
5253 * Remove duplicate constraints in case of some these div constraints
5254 * already appear in "bmap".
5256 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5257 __isl_take isl_basic_map
*bmap
)
5263 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5267 bmap
= add_known_div_constraints(bmap
);
5268 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5269 bmap
= isl_basic_map_finalize(bmap
);
5273 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5275 * In particular, if this div is of the form d = floor(f/m),
5276 * then add the constraint
5280 * if sign < 0 or the constraint
5282 * -(f-(m-1)) + m d >= 0
5286 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
5287 unsigned div
, int sign
)
5295 total
= isl_basic_map_total_dim(bmap
);
5296 div_pos
= total
- bmap
->n_div
+ div
;
5299 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5301 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5304 __isl_give isl_basic_set
*isl_basic_map_underlying_set(
5305 __isl_take isl_basic_map
*bmap
)
5309 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5311 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5312 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5313 return bset_from_bmap(bmap
);
5314 bmap
= isl_basic_map_cow(bmap
);
5317 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5320 bmap
->extra
-= bmap
->n_div
;
5322 bmap
= isl_basic_map_finalize(bmap
);
5323 return bset_from_bmap(bmap
);
5325 isl_basic_map_free(bmap
);
5329 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5330 __isl_take isl_basic_set
*bset
)
5332 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5335 /* Replace each element in "list" by the result of applying
5336 * isl_basic_map_underlying_set to the element.
5338 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5339 __isl_take isl_basic_map_list
*list
)
5346 n
= isl_basic_map_list_n_basic_map(list
);
5347 for (i
= 0; i
< n
; ++i
) {
5348 isl_basic_map
*bmap
;
5349 isl_basic_set
*bset
;
5351 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5352 bset
= isl_basic_set_underlying_set(bmap
);
5353 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5359 __isl_give isl_basic_map
*isl_basic_map_overlying_set(
5360 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_map
*like
)
5362 struct isl_basic_map
*bmap
;
5363 struct isl_ctx
*ctx
;
5370 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5371 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5372 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5374 if (like
->n_div
== 0) {
5375 isl_space
*space
= isl_basic_map_get_space(like
);
5376 isl_basic_map_free(like
);
5377 return isl_basic_map_reset_space(bset
, space
);
5379 bset
= isl_basic_set_cow(bset
);
5382 total
= bset
->dim
->n_out
+ bset
->extra
;
5383 bmap
= bset_to_bmap(bset
);
5384 isl_space_free(bmap
->dim
);
5385 bmap
->dim
= isl_space_copy(like
->dim
);
5388 bmap
->n_div
= like
->n_div
;
5389 bmap
->extra
+= like
->n_div
;
5393 ltotal
= total
- bmap
->extra
+ like
->extra
;
5396 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5397 bmap
->extra
* (1 + 1 + total
));
5398 if (isl_blk_is_error(bmap
->block2
))
5400 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5404 for (i
= 0; i
< bmap
->extra
; ++i
)
5405 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5406 for (i
= 0; i
< like
->n_div
; ++i
) {
5407 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5408 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5410 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5412 isl_basic_map_free(like
);
5413 bmap
= isl_basic_map_simplify(bmap
);
5414 bmap
= isl_basic_map_finalize(bmap
);
5417 isl_basic_map_free(like
);
5418 isl_basic_set_free(bset
);
5422 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5423 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5425 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5426 bset_to_bmap(like
)));
5429 __isl_give isl_set
*isl_map_underlying_set(__isl_take isl_map
*map
)
5433 map
= isl_map_cow(map
);
5436 map
->dim
= isl_space_cow(map
->dim
);
5440 for (i
= 1; i
< map
->n
; ++i
)
5441 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5443 for (i
= 0; i
< map
->n
; ++i
) {
5444 map
->p
[i
] = bset_to_bmap(
5445 isl_basic_map_underlying_set(map
->p
[i
]));
5450 map
->dim
= isl_space_underlying(map
->dim
, 0);
5452 isl_space_free(map
->dim
);
5453 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5457 return set_from_map(map
);
5463 /* Replace the space of "bmap" by "space".
5465 * If the space of "bmap" is identical to "space" (including the identifiers
5466 * of the input and output dimensions), then simply return the original input.
5468 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5469 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5472 isl_space
*bmap_space
;
5474 bmap_space
= isl_basic_map_peek_space(bmap
);
5475 equal
= isl_space_is_equal(bmap_space
, space
);
5476 if (equal
>= 0 && equal
)
5477 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5481 isl_space_free(space
);
5484 bmap
= isl_basic_map_cow(bmap
);
5485 if (!bmap
|| !space
)
5488 isl_space_free(bmap
->dim
);
5491 bmap
= isl_basic_map_finalize(bmap
);
5495 isl_basic_map_free(bmap
);
5496 isl_space_free(space
);
5500 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5501 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5503 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5507 /* Check that the total dimensions of "map" and "space" are the same.
5509 static isl_stat
check_map_space_equal_total_dim(__isl_keep isl_map
*map
,
5510 __isl_keep isl_space
*space
)
5512 unsigned dim1
, dim2
;
5515 return isl_stat_error
;
5516 dim1
= isl_map_dim(map
, isl_dim_all
);
5517 dim2
= isl_space_dim(space
, isl_dim_all
);
5520 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5521 "total dimensions do not match", return isl_stat_error
);
5524 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5525 __isl_take isl_space
*dim
)
5529 map
= isl_map_cow(map
);
5533 for (i
= 0; i
< map
->n
; ++i
) {
5534 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5535 isl_space_copy(dim
));
5539 isl_space_free(map
->dim
);
5545 isl_space_free(dim
);
5549 /* Replace the space of "map" by "space", without modifying
5550 * the dimension of "map".
5552 * If the space of "map" is identical to "space" (including the identifiers
5553 * of the input and output dimensions), then simply return the original input.
5555 __isl_give isl_map
*isl_map_reset_equal_dim_space(__isl_take isl_map
*map
,
5556 __isl_take isl_space
*space
)
5559 isl_space
*map_space
;
5561 map_space
= isl_map_peek_space(map
);
5562 equal
= isl_space_is_equal(map_space
, space
);
5563 if (equal
>= 0 && equal
)
5564 equal
= isl_space_has_equal_ids(map_space
, space
);
5568 isl_space_free(space
);
5571 if (check_map_space_equal_total_dim(map
, space
) < 0)
5573 return isl_map_reset_space(map
, space
);
5576 isl_space_free(space
);
5580 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5581 __isl_take isl_space
*dim
)
5583 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5586 /* Compute the parameter domain of the given basic set.
5588 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5594 is_params
= isl_basic_set_is_params(bset
);
5596 return isl_basic_set_free(bset
);
5600 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5601 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5602 space
= isl_basic_set_get_space(bset
);
5603 space
= isl_space_params(space
);
5604 bset
= isl_basic_set_reset_space(bset
, space
);
5608 /* Construct a zero-dimensional basic set with the given parameter domain.
5610 __isl_give isl_basic_set
*isl_basic_set_from_params(
5611 __isl_take isl_basic_set
*bset
)
5614 space
= isl_basic_set_get_space(bset
);
5615 space
= isl_space_set_from_params(space
);
5616 bset
= isl_basic_set_reset_space(bset
, space
);
5620 /* Compute the parameter domain of the given set.
5622 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5627 if (isl_set_is_params(set
))
5630 n
= isl_set_dim(set
, isl_dim_set
);
5631 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5632 space
= isl_set_get_space(set
);
5633 space
= isl_space_params(space
);
5634 set
= isl_set_reset_space(set
, space
);
5638 /* Construct a zero-dimensional set with the given parameter domain.
5640 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5643 space
= isl_set_get_space(set
);
5644 space
= isl_space_set_from_params(space
);
5645 set
= isl_set_reset_space(set
, space
);
5649 /* Compute the parameter domain of the given map.
5651 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5656 n
= isl_map_dim(map
, isl_dim_in
);
5657 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5658 n
= isl_map_dim(map
, isl_dim_out
);
5659 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5660 space
= isl_map_get_space(map
);
5661 space
= isl_space_params(space
);
5662 map
= isl_map_reset_space(map
, space
);
5666 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5673 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5675 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5676 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5678 return isl_basic_map_reset_space(bmap
, space
);
5681 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5684 return isl_bool_error
;
5685 return isl_space_may_be_set(bmap
->dim
);
5688 /* Is this basic map actually a set?
5689 * Users should never call this function. Outside of isl,
5690 * the type should indicate whether something is a set or a map.
5692 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5695 return isl_bool_error
;
5696 return isl_space_is_set(bmap
->dim
);
5699 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5703 is_set
= isl_basic_map_is_set(bmap
);
5708 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5710 isl_basic_map_free(bmap
);
5714 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5715 __isl_take isl_basic_map
*bmap
)
5719 isl_basic_map
*domain
;
5720 int nparam
, n_in
, n_out
;
5722 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5723 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5724 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5726 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5727 domain
= isl_basic_map_universe(dim
);
5729 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5730 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5731 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5733 for (i
= 0; i
< n_in
; ++i
)
5734 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5737 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5738 return isl_basic_map_finalize(bmap
);
5741 __isl_give isl_basic_map
*isl_basic_map_range_map(
5742 __isl_take isl_basic_map
*bmap
)
5746 isl_basic_map
*range
;
5747 int nparam
, n_in
, n_out
;
5749 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5750 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5751 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5753 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5754 range
= isl_basic_map_universe(dim
);
5756 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5757 bmap
= isl_basic_map_apply_range(bmap
, range
);
5758 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5760 for (i
= 0; i
< n_out
; ++i
)
5761 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5764 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5765 return isl_basic_map_finalize(bmap
);
5768 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5772 return isl_space_may_be_set(map
->dim
);
5775 /* Is this map actually a set?
5776 * Users should never call this function. Outside of isl,
5777 * the type should indicate whether something is a set or a map.
5779 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5782 return isl_bool_error
;
5783 return isl_space_is_set(map
->dim
);
5786 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
5790 struct isl_set
*set
;
5792 is_set
= isl_map_is_set(map
);
5796 return set_from_map(map
);
5798 map
= isl_map_cow(map
);
5802 set
= set_from_map(map
);
5803 set
->dim
= isl_space_range(set
->dim
);
5806 for (i
= 0; i
< map
->n
; ++i
) {
5807 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5811 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5812 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5819 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5823 map
= isl_map_cow(map
);
5827 map
->dim
= isl_space_domain_map(map
->dim
);
5830 for (i
= 0; i
< map
->n
; ++i
) {
5831 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5835 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5836 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5843 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5846 isl_space
*range_dim
;
5848 map
= isl_map_cow(map
);
5852 range_dim
= isl_space_range(isl_map_get_space(map
));
5853 range_dim
= isl_space_from_range(range_dim
);
5854 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5855 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5858 for (i
= 0; i
< map
->n
; ++i
) {
5859 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5863 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5864 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5871 /* Given a wrapped map of the form A[B -> C],
5872 * return the map A[B -> C] -> B.
5874 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5881 if (!isl_set_has_tuple_id(set
))
5882 return isl_map_domain_map(isl_set_unwrap(set
));
5884 id
= isl_set_get_tuple_id(set
);
5885 map
= isl_map_domain_map(isl_set_unwrap(set
));
5886 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5891 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5892 __isl_take isl_basic_set
*bset
)
5894 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5897 __isl_give isl_basic_map
*isl_basic_map_from_range(
5898 __isl_take isl_basic_set
*bset
)
5901 space
= isl_basic_set_get_space(bset
);
5902 space
= isl_space_from_range(space
);
5903 bset
= isl_basic_set_reset_space(bset
, space
);
5904 return bset_to_bmap(bset
);
5907 /* Create a relation with the given set as range.
5908 * The domain of the created relation is a zero-dimensional
5909 * flat anonymous space.
5911 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5914 space
= isl_set_get_space(set
);
5915 space
= isl_space_from_range(space
);
5916 set
= isl_set_reset_space(set
, space
);
5917 return set_to_map(set
);
5920 /* Create a relation with the given set as domain.
5921 * The range of the created relation is a zero-dimensional
5922 * flat anonymous space.
5924 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5926 return isl_map_reverse(isl_map_from_range(set
));
5929 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5930 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5932 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5935 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5936 __isl_take isl_set
*range
)
5938 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5941 /* Return a newly allocated isl_map with given space and flags and
5942 * room for "n" basic maps.
5943 * Make sure that all cached information is cleared.
5945 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5948 struct isl_map
*map
;
5953 isl_die(space
->ctx
, isl_error_internal
,
5954 "negative number of basic maps", goto error
);
5955 map
= isl_calloc(space
->ctx
, struct isl_map
,
5956 sizeof(struct isl_map
) +
5957 (n
- 1) * sizeof(struct isl_basic_map
*));
5961 map
->ctx
= space
->ctx
;
5962 isl_ctx_ref(map
->ctx
);
5970 isl_space_free(space
);
5974 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*space
)
5976 struct isl_basic_map
*bmap
;
5977 bmap
= isl_basic_map_alloc_space(space
, 0, 1, 0);
5978 bmap
= isl_basic_map_set_to_empty(bmap
);
5982 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*space
)
5984 struct isl_basic_set
*bset
;
5985 bset
= isl_basic_set_alloc_space(space
, 0, 1, 0);
5986 bset
= isl_basic_set_set_to_empty(bset
);
5990 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*space
)
5992 struct isl_basic_map
*bmap
;
5993 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 0);
5994 bmap
= isl_basic_map_finalize(bmap
);
5998 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*space
)
6000 struct isl_basic_set
*bset
;
6001 bset
= isl_basic_set_alloc_space(space
, 0, 0, 0);
6002 bset
= isl_basic_set_finalize(bset
);
6006 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
6009 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
6010 isl_basic_map
*bmap
;
6012 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
6013 for (i
= 0; i
< total
; ++i
) {
6014 int k
= isl_basic_map_alloc_inequality(bmap
);
6017 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
6018 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
6022 isl_basic_map_free(bmap
);
6026 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
6028 return isl_basic_map_nat_universe(dim
);
6031 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
6033 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
6036 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
6038 return isl_map_nat_universe(dim
);
6041 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*space
)
6043 return isl_map_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6046 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*space
)
6048 return isl_set_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6051 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*space
)
6053 struct isl_map
*map
;
6056 map
= isl_map_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6057 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(space
));
6061 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*space
)
6063 struct isl_set
*set
;
6066 set
= isl_set_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6067 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(space
));
6071 struct isl_map
*isl_map_dup(struct isl_map
*map
)
6074 struct isl_map
*dup
;
6078 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6079 for (i
= 0; i
< map
->n
; ++i
)
6080 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6084 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6085 __isl_take isl_basic_map
*bmap
)
6089 if (isl_basic_map_plain_is_empty(bmap
)) {
6090 isl_basic_map_free(bmap
);
6093 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6094 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6095 map
->p
[map
->n
] = bmap
;
6097 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6103 isl_basic_map_free(bmap
);
6107 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6118 isl_ctx_deref(map
->ctx
);
6119 for (i
= 0; i
< map
->n
; ++i
)
6120 isl_basic_map_free(map
->p
[i
]);
6121 isl_space_free(map
->dim
);
6127 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
6128 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
6132 bmap
= isl_basic_map_cow(bmap
);
6133 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6134 j
= isl_basic_map_alloc_equality(bmap
);
6137 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6138 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6139 isl_int_set_si(bmap
->eq
[j
][0], value
);
6140 bmap
= isl_basic_map_simplify(bmap
);
6141 return isl_basic_map_finalize(bmap
);
6143 isl_basic_map_free(bmap
);
6147 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6148 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6152 bmap
= isl_basic_map_cow(bmap
);
6153 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6154 j
= isl_basic_map_alloc_equality(bmap
);
6157 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6158 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6159 isl_int_set(bmap
->eq
[j
][0], value
);
6160 bmap
= isl_basic_map_simplify(bmap
);
6161 return isl_basic_map_finalize(bmap
);
6163 isl_basic_map_free(bmap
);
6167 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6168 enum isl_dim_type type
, unsigned pos
, int value
)
6170 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6171 return isl_basic_map_free(bmap
);
6172 return isl_basic_map_fix_pos_si(bmap
,
6173 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6176 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6177 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6179 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6180 return isl_basic_map_free(bmap
);
6181 return isl_basic_map_fix_pos(bmap
,
6182 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6185 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6186 * to be equal to "v".
6188 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6189 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6193 if (!isl_val_is_int(v
))
6194 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6195 "expecting integer value", goto error
);
6196 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6198 pos
+= isl_basic_map_offset(bmap
, type
);
6199 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6203 isl_basic_map_free(bmap
);
6208 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6209 * to be equal to "v".
6211 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6212 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6214 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6217 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6218 enum isl_dim_type type
, unsigned pos
, int value
)
6220 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6224 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6225 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6227 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6231 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6232 unsigned input
, int value
)
6234 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6237 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6238 unsigned dim
, int value
)
6240 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6241 isl_dim_set
, dim
, value
));
6244 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
6246 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6253 isl_basic_map_free(map
->p
[i
]);
6254 if (i
!= map
->n
- 1) {
6255 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6256 map
->p
[i
] = map
->p
[map
->n
- 1];
6263 /* Perform "fn" on each basic map of "map", where we may not be holding
6264 * the only reference to "map".
6265 * In particular, "fn" should be a semantics preserving operation
6266 * that we want to apply to all copies of "map". We therefore need
6267 * to be careful not to modify "map" in a way that breaks "map"
6268 * in case anything goes wrong.
6270 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6271 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6273 struct isl_basic_map
*bmap
;
6279 for (i
= map
->n
- 1; i
>= 0; --i
) {
6280 bmap
= isl_basic_map_copy(map
->p
[i
]);
6284 isl_basic_map_free(map
->p
[i
]);
6286 if (remove_if_empty(map
, i
) < 0)
6296 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6297 enum isl_dim_type type
, unsigned pos
, int value
)
6301 map
= isl_map_cow(map
);
6305 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6306 for (i
= map
->n
- 1; i
>= 0; --i
) {
6307 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6308 if (remove_if_empty(map
, i
) < 0)
6311 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6318 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6319 enum isl_dim_type type
, unsigned pos
, int value
)
6321 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6324 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6325 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6329 map
= isl_map_cow(map
);
6333 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6334 for (i
= 0; i
< map
->n
; ++i
) {
6335 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6339 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6346 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6347 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6349 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6352 /* Fix the value of the variable at position "pos" of type "type" of "map"
6353 * to be equal to "v".
6355 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6356 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6360 map
= isl_map_cow(map
);
6364 if (!isl_val_is_int(v
))
6365 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6366 "expecting integer value", goto error
);
6367 if (pos
>= isl_map_dim(map
, type
))
6368 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6369 "index out of bounds", goto error
);
6370 for (i
= map
->n
- 1; i
>= 0; --i
) {
6371 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6373 if (remove_if_empty(map
, i
) < 0)
6376 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6385 /* Fix the value of the variable at position "pos" of type "type" of "set"
6386 * to be equal to "v".
6388 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6389 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6391 return isl_map_fix_val(set
, type
, pos
, v
);
6394 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6395 unsigned input
, int value
)
6397 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6400 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6402 return set_from_map(isl_map_fix_si(set_to_map(set
),
6403 isl_dim_set
, dim
, value
));
6406 static __isl_give isl_basic_map
*basic_map_bound_si(
6407 __isl_take isl_basic_map
*bmap
,
6408 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6412 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6413 return isl_basic_map_free(bmap
);
6414 pos
+= isl_basic_map_offset(bmap
, type
);
6415 bmap
= isl_basic_map_cow(bmap
);
6416 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6417 j
= isl_basic_map_alloc_inequality(bmap
);
6420 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6422 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6423 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6425 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6426 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6428 bmap
= isl_basic_map_simplify(bmap
);
6429 return isl_basic_map_finalize(bmap
);
6431 isl_basic_map_free(bmap
);
6435 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6436 __isl_take isl_basic_map
*bmap
,
6437 enum isl_dim_type type
, unsigned pos
, int value
)
6439 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6442 /* Constrain the values of the given dimension to be no greater than "value".
6444 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6445 __isl_take isl_basic_map
*bmap
,
6446 enum isl_dim_type type
, unsigned pos
, int value
)
6448 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6451 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6452 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6456 map
= isl_map_cow(map
);
6460 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6461 for (i
= 0; i
< map
->n
; ++i
) {
6462 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6463 type
, pos
, value
, upper
);
6467 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6474 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6475 enum isl_dim_type type
, unsigned pos
, int value
)
6477 return map_bound_si(map
, type
, pos
, value
, 0);
6480 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6481 enum isl_dim_type type
, unsigned pos
, int value
)
6483 return map_bound_si(map
, type
, pos
, value
, 1);
6486 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6487 enum isl_dim_type type
, unsigned pos
, int value
)
6489 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6493 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6494 enum isl_dim_type type
, unsigned pos
, int value
)
6496 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6499 /* Bound the given variable of "bmap" from below (or above is "upper"
6500 * is set) to "value".
6502 static __isl_give isl_basic_map
*basic_map_bound(
6503 __isl_take isl_basic_map
*bmap
,
6504 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6508 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6509 return isl_basic_map_free(bmap
);
6510 pos
+= isl_basic_map_offset(bmap
, type
);
6511 bmap
= isl_basic_map_cow(bmap
);
6512 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6513 j
= isl_basic_map_alloc_inequality(bmap
);
6516 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6518 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6519 isl_int_set(bmap
->ineq
[j
][0], value
);
6521 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6522 isl_int_neg(bmap
->ineq
[j
][0], value
);
6524 bmap
= isl_basic_map_simplify(bmap
);
6525 return isl_basic_map_finalize(bmap
);
6527 isl_basic_map_free(bmap
);
6531 /* Bound the given variable of "map" from below (or above is "upper"
6532 * is set) to "value".
6534 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6535 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6539 map
= isl_map_cow(map
);
6543 if (pos
>= isl_map_dim(map
, type
))
6544 isl_die(map
->ctx
, isl_error_invalid
,
6545 "index out of bounds", goto error
);
6546 for (i
= map
->n
- 1; i
>= 0; --i
) {
6547 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6548 if (remove_if_empty(map
, i
) < 0)
6551 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6558 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6559 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6561 return map_bound(map
, type
, pos
, value
, 0);
6564 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6565 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6567 return map_bound(map
, type
, pos
, value
, 1);
6570 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6571 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6573 return isl_map_lower_bound(set
, type
, pos
, value
);
6576 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6577 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6579 return isl_map_upper_bound(set
, type
, pos
, value
);
6582 /* Force the values of the variable at position "pos" of type "type" of "set"
6583 * to be no smaller than "value".
6585 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6586 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6590 if (!isl_val_is_int(value
))
6591 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6592 "expecting integer value", goto error
);
6593 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6594 isl_val_free(value
);
6597 isl_val_free(value
);
6602 /* Force the values of the variable at position "pos" of type "type" of "set"
6603 * to be no greater than "value".
6605 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6606 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6610 if (!isl_val_is_int(value
))
6611 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6612 "expecting integer value", goto error
);
6613 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6614 isl_val_free(value
);
6617 isl_val_free(value
);
6622 /* Bound the given variable of "bset" from below (or above is "upper"
6623 * is set) to "value".
6625 static __isl_give isl_basic_set
*isl_basic_set_bound(
6626 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6627 isl_int value
, int upper
)
6629 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
6630 type
, pos
, value
, upper
));
6633 /* Bound the given variable of "bset" from below (or above is "upper"
6634 * is set) to "value".
6636 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
6637 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6638 __isl_take isl_val
*value
, int upper
)
6642 if (!isl_val_is_int(value
))
6643 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
6644 "expecting integer value", goto error
);
6645 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
6646 isl_val_free(value
);
6649 isl_val_free(value
);
6650 isl_basic_set_free(bset
);
6654 /* Bound the given variable of "bset" from below to "value".
6656 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
6657 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6658 __isl_take isl_val
*value
)
6660 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
6663 /* Bound the given variable of "bset" from above to "value".
6665 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
6666 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6667 __isl_take isl_val
*value
)
6669 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
6672 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6676 map
= isl_map_cow(map
);
6680 map
->dim
= isl_space_reverse(map
->dim
);
6683 for (i
= 0; i
< map
->n
; ++i
) {
6684 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6688 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6696 #define TYPE isl_pw_multi_aff
6698 #define SUFFIX _pw_multi_aff
6700 #define EMPTY isl_pw_multi_aff_empty
6702 #define ADD isl_pw_multi_aff_union_add
6703 #include "isl_map_lexopt_templ.c"
6705 /* Given a map "map", compute the lexicographically minimal
6706 * (or maximal) image element for each domain element in dom,
6707 * in the form of an isl_pw_multi_aff.
6708 * If "empty" is not NULL, then set *empty to those elements in dom that
6709 * do not have an image element.
6710 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6711 * should be computed over the domain of "map". "empty" is also NULL
6714 * We first compute the lexicographically minimal or maximal element
6715 * in the first basic map. This results in a partial solution "res"
6716 * and a subset "todo" of dom that still need to be handled.
6717 * We then consider each of the remaining maps in "map" and successively
6718 * update both "res" and "todo".
6719 * If "empty" is NULL, then the todo sets are not needed and therefore
6720 * also not computed.
6722 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6723 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6724 __isl_give isl_set
**empty
, unsigned flags
)
6728 isl_pw_multi_aff
*res
;
6731 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6732 if (!map
|| (!full
&& !dom
))
6735 if (isl_map_plain_is_empty(map
)) {
6740 return isl_pw_multi_aff_from_map(map
);
6743 res
= basic_map_partial_lexopt_pw_multi_aff(
6744 isl_basic_map_copy(map
->p
[0]),
6745 isl_set_copy(dom
), empty
, flags
);
6749 for (i
= 1; i
< map
->n
; ++i
) {
6750 isl_pw_multi_aff
*res_i
;
6752 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6753 isl_basic_map_copy(map
->p
[i
]),
6754 isl_set_copy(dom
), empty
, flags
);
6756 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6757 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6759 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6762 todo
= isl_set_intersect(todo
, *empty
);
6781 #define TYPE isl_map
6785 #define EMPTY isl_map_empty
6787 #define ADD isl_map_union_disjoint
6788 #include "isl_map_lexopt_templ.c"
6790 /* Given a map "map", compute the lexicographically minimal
6791 * (or maximal) image element for each domain element in "dom",
6792 * in the form of an isl_map.
6793 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6794 * do not have an image element.
6795 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6796 * should be computed over the domain of "map". "empty" is also NULL
6799 * If the input consists of more than one disjunct, then first
6800 * compute the desired result in the form of an isl_pw_multi_aff and
6801 * then convert that into an isl_map.
6803 * This function used to have an explicit implementation in terms
6804 * of isl_maps, but it would continually intersect the domains of
6805 * partial results with the complement of the domain of the next
6806 * partial solution, potentially leading to an explosion in the number
6807 * of disjuncts if there are several disjuncts in the input.
6808 * An even earlier implementation of this function would look for
6809 * better results in the domain of the partial result and for extra
6810 * results in the complement of this domain, which would lead to
6811 * even more splintering.
6813 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6814 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6815 __isl_give isl_set
**empty
, unsigned flags
)
6818 struct isl_map
*res
;
6819 isl_pw_multi_aff
*pma
;
6821 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6822 if (!map
|| (!full
&& !dom
))
6825 if (isl_map_plain_is_empty(map
)) {
6834 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6840 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6842 return isl_map_from_pw_multi_aff(pma
);
6851 __isl_give isl_map
*isl_map_partial_lexmax(
6852 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6853 __isl_give isl_set
**empty
)
6855 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6858 __isl_give isl_map
*isl_map_partial_lexmin(
6859 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6860 __isl_give isl_set
**empty
)
6862 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6865 __isl_give isl_set
*isl_set_partial_lexmin(
6866 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6867 __isl_give isl_set
**empty
)
6869 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6873 __isl_give isl_set
*isl_set_partial_lexmax(
6874 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6875 __isl_give isl_set
**empty
)
6877 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6881 /* Compute the lexicographic minimum (or maximum if "flags" includes
6882 * ISL_OPT_MAX) of "bset" over its parametric domain.
6884 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6887 return isl_basic_map_lexopt(bset
, flags
);
6890 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6892 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6895 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6897 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6900 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6902 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6905 /* Compute the lexicographic minimum of "bset" over its parametric domain
6906 * for the purpose of quantifier elimination.
6907 * That is, find an explicit representation for all the existentially
6908 * quantified variables in "bset" by computing their lexicographic
6911 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6912 __isl_take isl_basic_set
*bset
)
6914 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6917 /* Given a basic map with one output dimension, compute the minimum or
6918 * maximum of that dimension as an isl_pw_aff.
6920 * Compute the optimum as a lexicographic optimum over the single
6921 * output dimension and extract the single isl_pw_aff from the result.
6923 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6926 isl_pw_multi_aff
*pma
;
6929 bmap
= isl_basic_map_copy(bmap
);
6930 pma
= isl_basic_map_lexopt_pw_multi_aff(bmap
, max
? ISL_OPT_MAX
: 0);
6931 pwaff
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
6932 isl_pw_multi_aff_free(pma
);
6937 /* Compute the minimum or maximum of the given output dimension
6938 * as a function of the parameters and the input dimensions,
6939 * but independently of the other output dimensions.
6941 * We first project out the other output dimension and then compute
6942 * the "lexicographic" maximum in each basic map, combining the results
6943 * using isl_pw_aff_union_max.
6945 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6952 n_out
= isl_map_dim(map
, isl_dim_out
);
6953 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6954 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6959 isl_space
*dim
= isl_map_get_space(map
);
6961 return isl_pw_aff_empty(dim
);
6964 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6965 for (i
= 1; i
< map
->n
; ++i
) {
6966 isl_pw_aff
*pwaff_i
;
6968 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6969 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6977 /* Compute the minimum of the given output dimension as a function of the
6978 * parameters and input dimensions, but independently of
6979 * the other output dimensions.
6981 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6983 return map_dim_opt(map
, pos
, 0);
6986 /* Compute the maximum of the given output dimension as a function of the
6987 * parameters and input dimensions, but independently of
6988 * the other output dimensions.
6990 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6992 return map_dim_opt(map
, pos
, 1);
6995 /* Compute the minimum or maximum of the given set dimension
6996 * as a function of the parameters,
6997 * but independently of the other set dimensions.
6999 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
7002 return map_dim_opt(set
, pos
, max
);
7005 /* Compute the maximum of the given set dimension as a function of the
7006 * parameters, but independently of the other set dimensions.
7008 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
7010 return set_dim_opt(set
, pos
, 1);
7013 /* Compute the minimum of the given set dimension as a function of the
7014 * parameters, but independently of the other set dimensions.
7016 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
7018 return set_dim_opt(set
, pos
, 0);
7021 /* Apply a preimage specified by "mat" on the parameters of "bset".
7022 * bset is assumed to have only parameters and divs.
7024 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
7025 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
7032 bset
->dim
= isl_space_cow(bset
->dim
);
7036 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7038 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
7040 bset
->dim
->nparam
= 0;
7041 bset
->dim
->n_out
= nparam
;
7042 bset
= isl_basic_set_preimage(bset
, mat
);
7044 bset
->dim
->nparam
= bset
->dim
->n_out
;
7045 bset
->dim
->n_out
= 0;
7050 isl_basic_set_free(bset
);
7054 /* Apply a preimage specified by "mat" on the parameters of "set".
7055 * set is assumed to have only parameters and divs.
7057 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
7058 __isl_take isl_mat
*mat
)
7066 nparam
= isl_set_dim(set
, isl_dim_param
);
7068 if (mat
->n_row
!= 1 + nparam
)
7069 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
7070 "unexpected number of rows", goto error
);
7072 space
= isl_set_get_space(set
);
7073 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7074 isl_dim_param
, 0, nparam
);
7075 set
= isl_set_reset_space(set
, space
);
7076 set
= isl_set_preimage(set
, mat
);
7077 nparam
= isl_set_dim(set
, isl_dim_out
);
7078 space
= isl_set_get_space(set
);
7079 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7080 isl_dim_out
, 0, nparam
);
7081 set
= isl_set_reset_space(set
, space
);
7089 /* Intersect the basic set "bset" with the affine space specified by the
7090 * equalities in "eq".
7092 static __isl_give isl_basic_set
*basic_set_append_equalities(
7093 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7101 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7106 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7107 for (i
= 0; i
< eq
->n_row
; ++i
) {
7108 k
= isl_basic_set_alloc_equality(bset
);
7111 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7112 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7116 bset
= isl_basic_set_gauss(bset
, NULL
);
7117 bset
= isl_basic_set_finalize(bset
);
7122 isl_basic_set_free(bset
);
7126 /* Intersect the set "set" with the affine space specified by the
7127 * equalities in "eq".
7129 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7137 for (i
= 0; i
< set
->n
; ++i
) {
7138 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7151 /* Given a basic set "bset" that only involves parameters and existentially
7152 * quantified variables, return the index of the first equality
7153 * that only involves parameters. If there is no such equality then
7154 * return bset->n_eq.
7156 * This function assumes that isl_basic_set_gauss has been called on "bset".
7158 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7161 unsigned nparam
, n_div
;
7166 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7167 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7169 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7170 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7177 /* Compute an explicit representation for the existentially quantified
7178 * variables in "bset" by computing the "minimal value" of the set
7179 * variables. Since there are no set variables, the computation of
7180 * the minimal value essentially computes an explicit representation
7181 * of the non-empty part(s) of "bset".
7183 * The input only involves parameters and existentially quantified variables.
7184 * All equalities among parameters have been removed.
7186 * Since the existentially quantified variables in the result are in general
7187 * going to be different from those in the input, we first replace
7188 * them by the minimal number of variables based on their equalities.
7189 * This should simplify the parametric integer programming.
7191 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7193 isl_morph
*morph1
, *morph2
;
7199 if (bset
->n_eq
== 0)
7200 return isl_basic_set_lexmin_compute_divs(bset
);
7202 morph1
= isl_basic_set_parameter_compression(bset
);
7203 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7204 bset
= isl_basic_set_lift(bset
);
7205 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7206 bset
= isl_morph_basic_set(morph2
, bset
);
7207 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7208 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7210 set
= isl_basic_set_lexmin_compute_divs(bset
);
7212 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7217 /* Project the given basic set onto its parameter domain, possibly introducing
7218 * new, explicit, existential variables in the constraints.
7219 * The input has parameters and (possibly implicit) existential variables.
7220 * The output has the same parameters, but only
7221 * explicit existentially quantified variables.
7223 * The actual projection is performed by pip, but pip doesn't seem
7224 * to like equalities very much, so we first remove the equalities
7225 * among the parameters by performing a variable compression on
7226 * the parameters. Afterward, an inverse transformation is performed
7227 * and the equalities among the parameters are inserted back in.
7229 * The variable compression on the parameters may uncover additional
7230 * equalities that were only implicit before. We therefore check
7231 * if there are any new parameter equalities in the result and
7232 * if so recurse. The removal of parameter equalities is required
7233 * for the parameter compression performed by base_compute_divs.
7235 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7239 struct isl_mat
*T
, *T2
;
7240 struct isl_set
*set
;
7243 bset
= isl_basic_set_cow(bset
);
7247 if (bset
->n_eq
== 0)
7248 return base_compute_divs(bset
);
7250 bset
= isl_basic_set_gauss(bset
, NULL
);
7253 if (isl_basic_set_plain_is_empty(bset
))
7254 return isl_set_from_basic_set(bset
);
7256 i
= first_parameter_equality(bset
);
7257 if (i
== bset
->n_eq
)
7258 return base_compute_divs(bset
);
7260 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7261 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7263 eq
= isl_mat_cow(eq
);
7264 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7265 if (T
&& T
->n_col
== 0) {
7269 bset
= isl_basic_set_set_to_empty(bset
);
7270 return isl_set_from_basic_set(bset
);
7272 bset
= basic_set_parameter_preimage(bset
, T
);
7274 i
= first_parameter_equality(bset
);
7277 else if (i
== bset
->n_eq
)
7278 set
= base_compute_divs(bset
);
7280 set
= parameter_compute_divs(bset
);
7281 set
= set_parameter_preimage(set
, T2
);
7282 set
= set_append_equalities(set
, eq
);
7286 /* Insert the divs from "ls" before those of "bmap".
7288 * The number of columns is not changed, which means that the last
7289 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7290 * The caller is responsible for removing the same number of dimensions
7291 * from the space of "bmap".
7293 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7294 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7300 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7304 old_n_div
= bmap
->n_div
;
7305 bmap
= insert_div_rows(bmap
, n_div
);
7309 for (i
= 0; i
< n_div
; ++i
) {
7310 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7311 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7317 /* Replace the space of "bmap" by the space and divs of "ls".
7319 * If "ls" has any divs, then we simplify the result since we may
7320 * have discovered some additional equalities that could simplify
7321 * the div expressions.
7323 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7324 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7328 bmap
= isl_basic_map_cow(bmap
);
7332 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7333 bmap
= insert_divs_from_local_space(bmap
, ls
);
7337 isl_space_free(bmap
->dim
);
7338 bmap
->dim
= isl_local_space_get_space(ls
);
7342 isl_local_space_free(ls
);
7344 bmap
= isl_basic_map_simplify(bmap
);
7345 bmap
= isl_basic_map_finalize(bmap
);
7348 isl_basic_map_free(bmap
);
7349 isl_local_space_free(ls
);
7353 /* Replace the space of "map" by the space and divs of "ls".
7355 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7356 __isl_take isl_local_space
*ls
)
7360 map
= isl_map_cow(map
);
7364 for (i
= 0; i
< map
->n
; ++i
) {
7365 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7366 isl_local_space_copy(ls
));
7370 isl_space_free(map
->dim
);
7371 map
->dim
= isl_local_space_get_space(ls
);
7375 isl_local_space_free(ls
);
7378 isl_local_space_free(ls
);
7383 /* Compute an explicit representation for the existentially
7384 * quantified variables for which do not know any explicit representation yet.
7386 * We first sort the existentially quantified variables so that the
7387 * existentially quantified variables for which we already have an explicit
7388 * representation are placed before those for which we do not.
7389 * The input dimensions, the output dimensions and the existentially
7390 * quantified variables for which we already have an explicit
7391 * representation are then turned into parameters.
7392 * compute_divs returns a map with the same parameters and
7393 * no input or output dimensions and the dimension specification
7394 * is reset to that of the input, including the existentially quantified
7395 * variables for which we already had an explicit representation.
7397 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
7399 struct isl_basic_set
*bset
;
7400 struct isl_set
*set
;
7401 struct isl_map
*map
;
7403 isl_local_space
*ls
;
7410 bmap
= isl_basic_map_sort_divs(bmap
);
7411 bmap
= isl_basic_map_cow(bmap
);
7415 n_known
= isl_basic_map_first_unknown_div(bmap
);
7417 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7419 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7420 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7421 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7422 dim
= isl_space_set_alloc(bmap
->ctx
,
7423 nparam
+ n_in
+ n_out
+ n_known
, 0);
7427 ls
= isl_basic_map_get_local_space(bmap
);
7428 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7429 n_known
, bmap
->n_div
- n_known
);
7431 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7432 swap_div(bmap
, i
- n_known
, i
);
7433 bmap
->n_div
-= n_known
;
7434 bmap
->extra
-= n_known
;
7436 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7437 bset
= bset_from_bmap(bmap
);
7439 set
= parameter_compute_divs(bset
);
7440 map
= set_to_map(set
);
7441 map
= replace_space_by_local_space(map
, ls
);
7445 isl_basic_map_free(bmap
);
7449 /* Remove the explicit representation of local variable "div",
7452 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7453 __isl_take isl_basic_map
*bmap
, int div
)
7457 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7459 return isl_basic_map_free(bmap
);
7463 bmap
= isl_basic_map_cow(bmap
);
7466 isl_int_set_si(bmap
->div
[div
][0], 0);
7470 /* Is local variable "div" of "bmap" marked as not having an explicit
7472 * Note that even if "div" is not marked in this way and therefore
7473 * has an explicit representation, this representation may still
7474 * depend (indirectly) on other local variables that do not
7475 * have an explicit representation.
7477 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7480 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7481 return isl_bool_error
;
7482 return isl_int_is_zero(bmap
->div
[div
][0]);
7485 /* Return the position of the first local variable that does not
7486 * have an explicit representation.
7487 * Return the total number of local variables if they all have
7488 * an explicit representation.
7489 * Return -1 on error.
7491 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7498 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7499 if (!isl_basic_map_div_is_known(bmap
, i
))
7505 /* Return the position of the first local variable that does not
7506 * have an explicit representation.
7507 * Return the total number of local variables if they all have
7508 * an explicit representation.
7509 * Return -1 on error.
7511 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7513 return isl_basic_map_first_unknown_div(bset
);
7516 /* Does "bmap" have an explicit representation for all local variables?
7518 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7522 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7523 first
= isl_basic_map_first_unknown_div(bmap
);
7525 return isl_bool_error
;
7529 /* Do all basic maps in "map" have an explicit representation
7530 * for all local variables?
7532 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7537 return isl_bool_error
;
7539 for (i
= 0; i
< map
->n
; ++i
) {
7540 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7545 return isl_bool_true
;
7548 /* If bmap contains any unknown divs, then compute explicit
7549 * expressions for them. However, this computation may be
7550 * quite expensive, so first try to remove divs that aren't
7553 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7556 struct isl_map
*map
;
7558 known
= isl_basic_map_divs_known(bmap
);
7562 return isl_map_from_basic_map(bmap
);
7564 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7566 known
= isl_basic_map_divs_known(bmap
);
7570 return isl_map_from_basic_map(bmap
);
7572 map
= compute_divs(bmap
);
7575 isl_basic_map_free(bmap
);
7579 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
7583 struct isl_map
*res
;
7590 known
= isl_map_divs_known(map
);
7598 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7599 for (i
= 1 ; i
< map
->n
; ++i
) {
7601 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7602 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7603 res
= isl_map_union_disjoint(res
, r2
);
7605 res
= isl_map_union(res
, r2
);
7612 __isl_give isl_set
*isl_basic_set_compute_divs(__isl_take isl_basic_set
*bset
)
7614 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7617 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7619 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7622 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
7625 struct isl_set
*set
;
7630 map
= isl_map_cow(map
);
7634 set
= set_from_map(map
);
7635 set
->dim
= isl_space_domain(set
->dim
);
7638 for (i
= 0; i
< map
->n
; ++i
) {
7639 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7643 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7644 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7651 /* Return the union of "map1" and "map2", where we assume for now that
7652 * "map1" and "map2" are disjoint. Note that the basic maps inside
7653 * "map1" or "map2" may not be disjoint from each other.
7654 * Also note that this function is also called from isl_map_union,
7655 * which takes care of handling the situation where "map1" and "map2"
7656 * may not be disjoint.
7658 * If one of the inputs is empty, we can simply return the other input.
7659 * Similarly, if one of the inputs is universal, then it is equal to the union.
7661 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7662 __isl_take isl_map
*map2
)
7666 struct isl_map
*map
= NULL
;
7672 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7673 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7674 "spaces don't match", goto error
);
7685 is_universe
= isl_map_plain_is_universe(map1
);
7686 if (is_universe
< 0)
7693 is_universe
= isl_map_plain_is_universe(map2
);
7694 if (is_universe
< 0)
7701 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7702 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7703 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7705 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7706 map1
->n
+ map2
->n
, flags
);
7709 for (i
= 0; i
< map1
->n
; ++i
) {
7710 map
= isl_map_add_basic_map(map
,
7711 isl_basic_map_copy(map1
->p
[i
]));
7715 for (i
= 0; i
< map2
->n
; ++i
) {
7716 map
= isl_map_add_basic_map(map
,
7717 isl_basic_map_copy(map2
->p
[i
]));
7731 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7732 * guaranteed to be disjoint by the caller.
7734 * Note that this functions is called from within isl_map_make_disjoint,
7735 * so we have to be careful not to touch the constraints of the inputs
7738 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7739 __isl_take isl_map
*map2
)
7741 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7744 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7745 * not be disjoint. The parameters are assumed to have been aligned.
7747 * We currently simply call map_union_disjoint, the internal operation
7748 * of which does not really depend on the inputs being disjoint.
7749 * If the result contains more than one basic map, then we clear
7750 * the disjoint flag since the result may contain basic maps from
7751 * both inputs and these are not guaranteed to be disjoint.
7753 * As a special case, if "map1" and "map2" are obviously equal,
7754 * then we simply return "map1".
7756 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7757 __isl_take isl_map
*map2
)
7764 equal
= isl_map_plain_is_equal(map1
, map2
);
7772 map1
= map_union_disjoint(map1
, map2
);
7776 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7784 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7787 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7788 __isl_take isl_map
*map2
)
7790 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7793 __isl_give isl_set
*isl_set_union_disjoint(
7794 __isl_take isl_set
*set1
, __isl_take isl_set
*set2
)
7796 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7800 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7802 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7805 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7808 * "map" and "set" are assumed to be compatible and non-NULL.
7810 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7811 __isl_take isl_set
*set
,
7812 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7813 __isl_take isl_basic_set
*bset
))
7816 struct isl_map
*result
;
7819 if (isl_set_plain_is_universe(set
)) {
7824 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7825 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7826 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7828 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7829 map
->n
* set
->n
, flags
);
7830 for (i
= 0; result
&& i
< map
->n
; ++i
)
7831 for (j
= 0; j
< set
->n
; ++j
) {
7832 result
= isl_map_add_basic_map(result
,
7833 fn(isl_basic_map_copy(map
->p
[i
]),
7834 isl_basic_set_copy(set
->p
[j
])));
7844 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7845 __isl_take isl_set
*set
)
7849 ok
= isl_map_compatible_range(map
, set
);
7853 isl_die(set
->ctx
, isl_error_invalid
,
7854 "incompatible spaces", goto error
);
7856 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7863 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7864 __isl_take isl_set
*set
)
7866 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7869 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7870 __isl_take isl_set
*set
)
7874 ok
= isl_map_compatible_domain(map
, set
);
7878 isl_die(set
->ctx
, isl_error_invalid
,
7879 "incompatible spaces", goto error
);
7881 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7888 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7889 __isl_take isl_set
*set
)
7891 return isl_map_align_params_map_map_and(map
, set
,
7892 &map_intersect_domain
);
7895 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7896 * in the space B -> C, return the intersection.
7897 * The parameters are assumed to have been aligned.
7899 * The map "factor" is first extended to a map living in the space
7900 * [A -> B] -> C and then a regular intersection is computed.
7902 static __isl_give isl_map
*map_intersect_domain_factor_range(
7903 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7906 isl_map
*ext_factor
;
7908 space
= isl_space_domain_factor_domain(isl_map_get_space(map
));
7909 ext_factor
= isl_map_universe(space
);
7910 ext_factor
= isl_map_domain_product(ext_factor
, factor
);
7911 return map_intersect(map
, ext_factor
);
7914 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7915 * in the space B -> C, return the intersection.
7917 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
7918 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7920 return isl_map_align_params_map_map_and(map
, factor
,
7921 &map_intersect_domain_factor_range
);
7924 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7925 * in the space A -> C, return the intersection.
7927 * The map "factor" is first extended to a map living in the space
7928 * A -> [B -> C] and then a regular intersection is computed.
7930 static __isl_give isl_map
*map_intersect_range_factor_range(
7931 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7934 isl_map
*ext_factor
;
7936 space
= isl_space_range_factor_domain(isl_map_get_space(map
));
7937 ext_factor
= isl_map_universe(space
);
7938 ext_factor
= isl_map_range_product(ext_factor
, factor
);
7939 return isl_map_intersect(map
, ext_factor
);
7942 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7943 * in the space A -> C, return the intersection.
7945 __isl_give isl_map
*isl_map_intersect_range_factor_range(
7946 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7948 return isl_map_align_params_map_map_and(map
, factor
,
7949 &map_intersect_range_factor_range
);
7952 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7953 __isl_take isl_map
*map2
)
7957 map1
= isl_map_reverse(map1
);
7958 map1
= isl_map_apply_range(map1
, map2
);
7959 return isl_map_reverse(map1
);
7966 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7967 __isl_take isl_map
*map2
)
7969 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7972 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7973 __isl_take isl_map
*map2
)
7975 isl_space
*dim_result
;
7976 struct isl_map
*result
;
7982 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7983 isl_space_copy(map2
->dim
));
7985 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7988 for (i
= 0; i
< map1
->n
; ++i
)
7989 for (j
= 0; j
< map2
->n
; ++j
) {
7990 result
= isl_map_add_basic_map(result
,
7991 isl_basic_map_apply_range(
7992 isl_basic_map_copy(map1
->p
[i
]),
7993 isl_basic_map_copy(map2
->p
[j
])));
7999 if (result
&& result
->n
<= 1)
8000 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
8008 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
8009 __isl_take isl_map
*map2
)
8011 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
8015 * returns range - domain
8017 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
8019 isl_space
*target_space
;
8020 struct isl_basic_set
*bset
;
8027 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8028 bmap
->dim
, isl_dim_out
),
8030 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
8031 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
8032 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8033 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
8034 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
8035 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
8036 for (i
= 0; i
< dim
; ++i
) {
8037 int j
= isl_basic_map_alloc_equality(bmap
);
8039 bmap
= isl_basic_map_free(bmap
);
8042 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8043 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8044 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
8045 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
8047 bset
= isl_basic_map_domain(bmap
);
8048 bset
= isl_basic_set_reset_space(bset
, target_space
);
8051 isl_basic_map_free(bmap
);
8056 * returns range - domain
8058 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8062 struct isl_set
*result
;
8067 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8068 map
->dim
, isl_dim_out
),
8070 dim
= isl_map_get_space(map
);
8071 dim
= isl_space_domain(dim
);
8072 result
= isl_set_alloc_space(dim
, map
->n
, 0);
8075 for (i
= 0; i
< map
->n
; ++i
)
8076 result
= isl_set_add_basic_set(result
,
8077 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8086 * returns [domain -> range] -> range - domain
8088 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8089 __isl_take isl_basic_map
*bmap
)
8093 isl_basic_map
*domain
;
8097 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8098 bmap
->dim
, isl_dim_out
))
8099 isl_die(bmap
->ctx
, isl_error_invalid
,
8100 "domain and range don't match", goto error
);
8102 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8103 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8105 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
8106 domain
= isl_basic_map_universe(dim
);
8108 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8109 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8110 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8112 total
= isl_basic_map_total_dim(bmap
);
8114 for (i
= 0; i
< n
; ++i
) {
8115 k
= isl_basic_map_alloc_equality(bmap
);
8118 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8119 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8120 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8121 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8124 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8125 return isl_basic_map_finalize(bmap
);
8127 isl_basic_map_free(bmap
);
8132 * returns [domain -> range] -> range - domain
8134 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8137 isl_space
*domain_dim
;
8142 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8143 map
->dim
, isl_dim_out
))
8144 isl_die(map
->ctx
, isl_error_invalid
,
8145 "domain and range don't match", goto error
);
8147 map
= isl_map_cow(map
);
8151 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
8152 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
8153 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
8156 for (i
= 0; i
< map
->n
; ++i
) {
8157 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8161 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8168 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
8170 struct isl_basic_map
*bmap
;
8178 nparam
= dims
->nparam
;
8180 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
8184 for (i
= 0; i
< dim
; ++i
) {
8185 int j
= isl_basic_map_alloc_equality(bmap
);
8188 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8189 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8190 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
8192 return isl_basic_map_finalize(bmap
);
8194 isl_basic_map_free(bmap
);
8198 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
8202 if (dim
->n_in
!= dim
->n_out
)
8203 isl_die(dim
->ctx
, isl_error_invalid
,
8204 "number of input and output dimensions needs to be "
8205 "the same", goto error
);
8206 return basic_map_identity(dim
);
8208 isl_space_free(dim
);
8212 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8214 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8217 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8219 isl_space
*dim
= isl_set_get_space(set
);
8221 id
= isl_map_identity(isl_space_map_from_set(dim
));
8222 return isl_map_intersect_range(id
, set
);
8225 /* Construct a basic set with all set dimensions having only non-negative
8228 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8229 __isl_take isl_space
*space
)
8234 struct isl_basic_set
*bset
;
8238 nparam
= space
->nparam
;
8240 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8243 for (i
= 0; i
< dim
; ++i
) {
8244 int k
= isl_basic_set_alloc_inequality(bset
);
8247 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8248 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8252 isl_basic_set_free(bset
);
8256 /* Construct the half-space x_pos >= 0.
8258 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
8262 isl_basic_set
*nonneg
;
8264 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8265 k
= isl_basic_set_alloc_inequality(nonneg
);
8268 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8269 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8271 return isl_basic_set_finalize(nonneg
);
8273 isl_basic_set_free(nonneg
);
8277 /* Construct the half-space x_pos <= -1.
8279 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
8284 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8285 k
= isl_basic_set_alloc_inequality(neg
);
8288 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8289 isl_int_set_si(neg
->ineq
[k
][0], -1);
8290 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8292 return isl_basic_set_finalize(neg
);
8294 isl_basic_set_free(neg
);
8298 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8299 enum isl_dim_type type
, unsigned first
, unsigned n
)
8303 isl_basic_set
*nonneg
;
8311 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8313 offset
= pos(set
->dim
, type
);
8314 for (i
= 0; i
< n
; ++i
) {
8315 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8316 offset
+ first
+ i
);
8317 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8319 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8328 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8330 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8336 return isl_stat_error
;
8337 if (isl_set_plain_is_empty(set
)) {
8342 return fn(set
, signs
, user
);
8345 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8347 half
= isl_set_intersect(half
, isl_set_copy(set
));
8348 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8352 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8354 half
= isl_set_intersect(half
, set
);
8355 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8358 return isl_stat_error
;
8361 /* Call "fn" on the intersections of "set" with each of the orthants
8362 * (except for obviously empty intersections). The orthant is identified
8363 * by the signs array, with each entry having value 1 or -1 according
8364 * to the sign of the corresponding variable.
8366 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8367 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8376 return isl_stat_error
;
8377 if (isl_set_plain_is_empty(set
))
8380 nparam
= isl_set_dim(set
, isl_dim_param
);
8381 nvar
= isl_set_dim(set
, isl_dim_set
);
8383 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8385 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8393 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8395 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8398 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8399 __isl_keep isl_basic_map
*bmap2
)
8402 struct isl_map
*map1
;
8403 struct isl_map
*map2
;
8405 if (!bmap1
|| !bmap2
)
8406 return isl_bool_error
;
8408 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8409 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8411 is_subset
= isl_map_is_subset(map1
, map2
);
8419 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8420 __isl_keep isl_basic_set
*bset2
)
8422 return isl_basic_map_is_subset(bset1
, bset2
);
8425 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8426 __isl_keep isl_basic_map
*bmap2
)
8430 if (!bmap1
|| !bmap2
)
8431 return isl_bool_error
;
8432 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8433 if (is_subset
!= isl_bool_true
)
8435 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8439 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8440 __isl_keep isl_basic_set
*bset2
)
8442 return isl_basic_map_is_equal(
8443 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8446 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8452 return isl_bool_error
;
8453 for (i
= 0; i
< map
->n
; ++i
) {
8454 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8456 return isl_bool_error
;
8458 return isl_bool_false
;
8460 return isl_bool_true
;
8463 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8465 return map
? map
->n
== 0 : isl_bool_error
;
8468 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8470 return set
? set
->n
== 0 : isl_bool_error
;
8473 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8475 return isl_map_is_empty(set_to_map(set
));
8478 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8479 __isl_keep isl_map
*map2
)
8482 return isl_bool_error
;
8484 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8487 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8488 __isl_keep isl_set
*set2
)
8491 return isl_bool_error
;
8493 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8496 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8501 return isl_bool_error
;
8502 is_subset
= isl_map_is_subset(map1
, map2
);
8503 if (is_subset
!= isl_bool_true
)
8505 is_subset
= isl_map_is_subset(map2
, map1
);
8509 /* Is "map1" equal to "map2"?
8511 * First check if they are obviously equal.
8512 * If not, then perform a more detailed analysis.
8514 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8518 equal
= isl_map_plain_is_equal(map1
, map2
);
8519 if (equal
< 0 || equal
)
8521 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8524 isl_bool
isl_basic_map_is_strict_subset(
8525 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8529 if (!bmap1
|| !bmap2
)
8530 return isl_bool_error
;
8531 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8532 if (is_subset
!= isl_bool_true
)
8534 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8535 if (is_subset
== isl_bool_error
)
8540 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8541 __isl_keep isl_map
*map2
)
8546 return isl_bool_error
;
8547 is_subset
= isl_map_is_subset(map1
, map2
);
8548 if (is_subset
!= isl_bool_true
)
8550 is_subset
= isl_map_is_subset(map2
, map1
);
8551 if (is_subset
== isl_bool_error
)
8556 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8557 __isl_keep isl_set
*set2
)
8559 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8562 /* Is "bmap" obviously equal to the universe with the same space?
8564 * That is, does it not have any constraints?
8566 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8569 return isl_bool_error
;
8570 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8573 /* Is "bset" obviously equal to the universe with the same space?
8575 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8577 return isl_basic_map_plain_is_universe(bset
);
8580 /* If "c" does not involve any existentially quantified variables,
8581 * then set *univ to false and abort
8583 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8585 isl_bool
*univ
= user
;
8588 n
= isl_constraint_dim(c
, isl_dim_div
);
8589 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8590 isl_constraint_free(c
);
8591 if (*univ
< 0 || !*univ
)
8592 return isl_stat_error
;
8596 /* Is "bmap" equal to the universe with the same space?
8598 * First check if it is obviously equal to the universe.
8599 * If not and if there are any constraints not involving
8600 * existentially quantified variables, then it is certainly
8601 * not equal to the universe.
8602 * Otherwise, check if the universe is a subset of "bmap".
8604 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8607 isl_basic_map
*test
;
8609 univ
= isl_basic_map_plain_is_universe(bmap
);
8610 if (univ
< 0 || univ
)
8612 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8613 return isl_bool_false
;
8614 univ
= isl_bool_true
;
8615 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8617 return isl_bool_error
;
8618 if (univ
< 0 || !univ
)
8620 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8621 univ
= isl_basic_map_is_subset(test
, bmap
);
8622 isl_basic_map_free(test
);
8626 /* Is "bset" equal to the universe with the same space?
8628 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8630 return isl_basic_map_is_universe(bset
);
8633 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8638 return isl_bool_error
;
8640 for (i
= 0; i
< map
->n
; ++i
) {
8641 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8646 return isl_bool_false
;
8649 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8651 return isl_map_plain_is_universe(set_to_map(set
));
8654 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8656 struct isl_basic_set
*bset
= NULL
;
8657 struct isl_vec
*sample
= NULL
;
8658 isl_bool empty
, non_empty
;
8661 return isl_bool_error
;
8663 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8664 return isl_bool_true
;
8666 if (isl_basic_map_plain_is_universe(bmap
))
8667 return isl_bool_false
;
8669 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8670 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8671 copy
= isl_basic_map_remove_redundancies(copy
);
8672 empty
= isl_basic_map_plain_is_empty(copy
);
8673 isl_basic_map_free(copy
);
8677 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8679 return isl_bool_error
;
8681 return isl_bool_false
;
8682 isl_vec_free(bmap
->sample
);
8683 bmap
->sample
= NULL
;
8684 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8686 return isl_bool_error
;
8687 sample
= isl_basic_set_sample_vec(bset
);
8689 return isl_bool_error
;
8690 empty
= sample
->size
== 0;
8691 isl_vec_free(bmap
->sample
);
8692 bmap
->sample
= sample
;
8694 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8699 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8702 return isl_bool_error
;
8703 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8706 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8709 return isl_bool_error
;
8710 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8713 /* Is "bmap" known to be non-empty?
8715 * That is, is the cached sample still valid?
8717 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8722 return isl_bool_error
;
8724 return isl_bool_false
;
8725 total
= 1 + isl_basic_map_total_dim(bmap
);
8726 if (bmap
->sample
->size
!= total
)
8727 return isl_bool_false
;
8728 return isl_basic_map_contains(bmap
, bmap
->sample
);
8731 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8733 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8736 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8737 __isl_take isl_basic_map
*bmap2
)
8739 struct isl_map
*map
;
8740 if (!bmap1
|| !bmap2
)
8743 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8745 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8748 map
= isl_map_add_basic_map(map
, bmap1
);
8749 map
= isl_map_add_basic_map(map
, bmap2
);
8752 isl_basic_map_free(bmap1
);
8753 isl_basic_map_free(bmap2
);
8757 struct isl_set
*isl_basic_set_union(
8758 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8760 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8761 bset_to_bmap(bset2
)));
8764 /* Order divs such that any div only depends on previous divs */
8765 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8766 __isl_take isl_basic_map
*bmap
)
8774 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8776 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8778 if (isl_int_is_zero(bmap
->div
[i
][0]))
8780 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8785 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8786 "integer division depends on itself",
8787 return isl_basic_map_free(bmap
));
8788 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8794 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8796 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8799 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8806 for (i
= 0; i
< map
->n
; ++i
) {
8807 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8818 /* Sort the local variables of "bset".
8820 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8821 __isl_take isl_basic_set
*bset
)
8823 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8826 /* Apply the expansion computed by isl_merge_divs.
8827 * The expansion itself is given by "exp" while the resulting
8828 * list of divs is given by "div".
8830 * Move the integer divisions of "bmap" into the right position
8831 * according to "exp" and then introduce the additional integer
8832 * divisions, adding div constraints.
8833 * The moving should be done first to avoid moving coefficients
8834 * in the definitions of the extra integer divisions.
8836 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8837 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8842 bmap
= isl_basic_map_cow(bmap
);
8846 if (div
->n_row
< bmap
->n_div
)
8847 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8848 "not an expansion", goto error
);
8850 n_div
= bmap
->n_div
;
8851 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8852 div
->n_row
- n_div
, 0,
8853 2 * (div
->n_row
- n_div
));
8855 for (i
= n_div
; i
< div
->n_row
; ++i
)
8856 if (isl_basic_map_alloc_div(bmap
) < 0)
8859 for (j
= n_div
- 1; j
>= 0; --j
) {
8862 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8865 for (i
= 0; i
< div
->n_row
; ++i
) {
8866 if (j
< n_div
&& exp
[j
] == i
) {
8869 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8870 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8872 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8880 isl_basic_map_free(bmap
);
8885 /* Apply the expansion computed by isl_merge_divs.
8886 * The expansion itself is given by "exp" while the resulting
8887 * list of divs is given by "div".
8889 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8890 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8892 return isl_basic_map_expand_divs(bset
, div
, exp
);
8895 /* Look for a div in dst that corresponds to the div "div" in src.
8896 * The divs before "div" in src and dst are assumed to be the same.
8898 * Returns -1 if no corresponding div was found and the position
8899 * of the corresponding div in dst otherwise.
8901 static int find_div(__isl_keep isl_basic_map
*dst
,
8902 __isl_keep isl_basic_map
*src
, unsigned div
)
8906 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8908 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8909 for (i
= div
; i
< dst
->n_div
; ++i
)
8910 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8911 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8912 dst
->n_div
- div
) == -1)
8917 /* Align the divs of "dst" to those of "src", adding divs from "src"
8918 * if needed. That is, make sure that the first src->n_div divs
8919 * of the result are equal to those of src.
8921 * The result is not finalized as by design it will have redundant
8922 * divs if any divs from "src" were copied.
8924 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8925 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8928 int known
, extended
;
8932 return isl_basic_map_free(dst
);
8934 if (src
->n_div
== 0)
8937 known
= isl_basic_map_divs_known(src
);
8939 return isl_basic_map_free(dst
);
8941 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8942 "some src divs are unknown",
8943 return isl_basic_map_free(dst
));
8945 src
= isl_basic_map_order_divs(src
);
8948 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8949 for (i
= 0; i
< src
->n_div
; ++i
) {
8950 int j
= find_div(dst
, src
, i
);
8953 int extra
= src
->n_div
- i
;
8954 dst
= isl_basic_map_cow(dst
);
8957 dst
= isl_basic_map_extend_space(dst
,
8958 isl_space_copy(dst
->dim
),
8959 extra
, 0, 2 * extra
);
8962 j
= isl_basic_map_alloc_div(dst
);
8964 return isl_basic_map_free(dst
);
8965 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8966 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8967 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8968 return isl_basic_map_free(dst
);
8971 isl_basic_map_swap_div(dst
, i
, j
);
8976 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
8984 map
= isl_map_compute_divs(map
);
8985 map
= isl_map_cow(map
);
8989 for (i
= 1; i
< map
->n
; ++i
)
8990 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8991 for (i
= 1; i
< map
->n
; ++i
) {
8992 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8994 return isl_map_free(map
);
8997 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
9001 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
9003 return isl_map_align_divs_internal(map
);
9006 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
9008 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
9011 /* Align the divs of the basic maps in "map" to those
9012 * of the basic maps in "list", as well as to the other basic maps in "map".
9013 * The elements in "list" are assumed to have known divs.
9015 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
9016 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
9020 map
= isl_map_compute_divs(map
);
9021 map
= isl_map_cow(map
);
9023 return isl_map_free(map
);
9027 n
= isl_basic_map_list_n_basic_map(list
);
9028 for (i
= 0; i
< n
; ++i
) {
9029 isl_basic_map
*bmap
;
9031 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
9032 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
9033 isl_basic_map_free(bmap
);
9036 return isl_map_free(map
);
9038 return isl_map_align_divs_internal(map
);
9041 /* Align the divs of each element of "list" to those of "bmap".
9042 * Both "bmap" and the elements of "list" are assumed to have known divs.
9044 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
9045 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
9050 return isl_basic_map_list_free(list
);
9052 n
= isl_basic_map_list_n_basic_map(list
);
9053 for (i
= 0; i
< n
; ++i
) {
9054 isl_basic_map
*bmap_i
;
9056 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9057 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
9058 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
9064 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
9065 __isl_take isl_map
*map
)
9069 ok
= isl_map_compatible_domain(map
, set
);
9073 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9074 "incompatible spaces", goto error
);
9075 map
= isl_map_intersect_domain(map
, set
);
9076 set
= isl_map_range(map
);
9084 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9085 __isl_take isl_map
*map
)
9087 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
9090 /* There is no need to cow as removing empty parts doesn't change
9091 * the meaning of the set.
9093 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9100 for (i
= map
->n
- 1; i
>= 0; --i
)
9101 remove_if_empty(map
, i
);
9106 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
9108 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9111 /* Create a binary relation that maps the shared initial "pos" dimensions
9112 * of "bset1" and "bset2" to the remaining dimensions of "bset1" and "bset2".
9114 static __isl_give isl_basic_map
*join_initial(__isl_keep isl_basic_set
*bset1
,
9115 __isl_keep isl_basic_set
*bset2
, int pos
)
9117 isl_basic_map
*bmap1
;
9118 isl_basic_map
*bmap2
;
9120 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9121 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9122 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9123 isl_dim_out
, 0, pos
);
9124 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9125 isl_dim_out
, 0, pos
);
9126 return isl_basic_map_range_product(bmap1
, bmap2
);
9129 /* Given two basic sets bset1 and bset2, compute the maximal difference
9130 * between the values of dimension pos in bset1 and those in bset2
9131 * for any common value of the parameters and dimensions preceding pos.
9133 static enum isl_lp_result
basic_set_maximal_difference_at(
9134 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9135 int pos
, isl_int
*opt
)
9137 isl_basic_map
*bmap1
;
9138 struct isl_ctx
*ctx
;
9139 struct isl_vec
*obj
;
9143 enum isl_lp_result res
;
9145 if (!bset1
|| !bset2
)
9146 return isl_lp_error
;
9148 nparam
= isl_basic_set_n_param(bset1
);
9149 dim1
= isl_basic_set_n_dim(bset1
);
9151 bmap1
= join_initial(bset1
, bset2
, pos
);
9153 return isl_lp_error
;
9155 total
= isl_basic_map_total_dim(bmap1
);
9157 obj
= isl_vec_alloc(ctx
, 1 + total
);
9160 isl_seq_clr(obj
->block
.data
, 1 + total
);
9161 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9162 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9163 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9165 isl_basic_map_free(bmap1
);
9169 isl_basic_map_free(bmap1
);
9170 return isl_lp_error
;
9173 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9174 * for any common value of the parameters and dimensions preceding pos
9175 * in both basic sets, the values of dimension pos in bset1 are
9176 * smaller or larger than those in bset2.
9179 * 1 if bset1 follows bset2
9180 * -1 if bset1 precedes bset2
9181 * 0 if bset1 and bset2 are incomparable
9182 * -2 if some error occurred.
9184 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
9185 struct isl_basic_set
*bset2
, int pos
)
9188 enum isl_lp_result res
;
9193 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9195 if (res
== isl_lp_empty
)
9197 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9198 res
== isl_lp_unbounded
)
9200 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9209 /* Given two basic sets bset1 and bset2, check whether
9210 * for any common value of the parameters and dimensions preceding pos
9211 * there is a value of dimension pos in bset1 that is larger
9212 * than a value of the same dimension in bset2.
9215 * 1 if there exists such a pair
9216 * 0 if there is no such pair, but there is a pair of equal values
9218 * -2 if some error occurred.
9220 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9221 __isl_keep isl_basic_set
*bset2
, int pos
)
9224 isl_basic_map
*bmap
;
9227 dim1
= isl_basic_set_dim(bset1
, isl_dim_set
);
9228 bmap
= join_initial(bset1
, bset2
, pos
);
9229 bmap
= isl_basic_map_order_ge(bmap
, isl_dim_out
, 0,
9230 isl_dim_out
, dim1
- pos
);
9231 empty
= isl_basic_map_is_empty(bmap
);
9235 isl_basic_map_free(bmap
);
9238 bmap
= isl_basic_map_order_gt(bmap
, isl_dim_out
, 0,
9239 isl_dim_out
, dim1
- pos
);
9240 empty
= isl_basic_map_is_empty(bmap
);
9243 isl_basic_map_free(bmap
);
9248 isl_basic_map_free(bmap
);
9252 /* Given two sets set1 and set2, check whether
9253 * for any common value of the parameters and dimensions preceding pos
9254 * there is a value of dimension pos in set1 that is larger
9255 * than a value of the same dimension in set2.
9258 * 1 if there exists such a pair
9259 * 0 if there is no such pair, but there is a pair of equal values
9261 * -2 if some error occurred.
9263 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9264 __isl_keep isl_set
*set2
, int pos
)
9272 for (i
= 0; i
< set1
->n
; ++i
)
9273 for (j
= 0; j
< set2
->n
; ++j
) {
9275 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9276 if (f
== 1 || f
== -2)
9285 static isl_bool
isl_basic_map_plain_has_fixed_var(
9286 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9293 return isl_bool_error
;
9294 total
= isl_basic_map_total_dim(bmap
);
9295 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9296 for (; d
+1 > pos
; --d
)
9297 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9301 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9302 return isl_bool_false
;
9303 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9304 return isl_bool_false
;
9305 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9306 return isl_bool_false
;
9308 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9309 return isl_bool_true
;
9311 return isl_bool_false
;
9314 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9315 unsigned pos
, isl_int
*val
)
9323 return isl_bool_error
;
9325 return isl_bool_false
;
9327 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9330 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9331 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9332 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9333 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9334 fixed
= isl_bool_false
;
9337 isl_int_set(*val
, v
);
9343 static isl_bool
isl_basic_set_plain_has_fixed_var(
9344 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9346 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9350 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9351 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9353 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9354 return isl_bool_error
;
9355 return isl_basic_map_plain_has_fixed_var(bmap
,
9356 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9359 /* If "bmap" obviously lies on a hyperplane where the given dimension
9360 * has a fixed value, then return that value.
9361 * Otherwise return NaN.
9363 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9364 __isl_keep isl_basic_map
*bmap
,
9365 enum isl_dim_type type
, unsigned pos
)
9373 ctx
= isl_basic_map_get_ctx(bmap
);
9374 v
= isl_val_alloc(ctx
);
9377 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9379 return isl_val_free(v
);
9381 isl_int_set_si(v
->d
, 1);
9385 return isl_val_nan(ctx
);
9388 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9389 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9391 if (pos
>= isl_map_dim(map
, type
))
9392 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9393 "position out of bounds", return isl_bool_error
);
9394 return isl_map_plain_has_fixed_var(map
,
9395 map_offset(map
, type
) - 1 + pos
, val
);
9398 /* If "map" obviously lies on a hyperplane where the given dimension
9399 * has a fixed value, then return that value.
9400 * Otherwise return NaN.
9402 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9403 enum isl_dim_type type
, unsigned pos
)
9411 ctx
= isl_map_get_ctx(map
);
9412 v
= isl_val_alloc(ctx
);
9415 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9417 return isl_val_free(v
);
9419 isl_int_set_si(v
->d
, 1);
9423 return isl_val_nan(ctx
);
9426 /* If "set" obviously lies on a hyperplane where the given dimension
9427 * has a fixed value, then return that value.
9428 * Otherwise return NaN.
9430 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9431 enum isl_dim_type type
, unsigned pos
)
9433 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9436 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9437 * then return this fixed value in *val.
9439 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9440 unsigned dim
, isl_int
*val
)
9442 return isl_basic_set_plain_has_fixed_var(bset
,
9443 isl_basic_set_n_param(bset
) + dim
, val
);
9446 /* Return -1 if the constraint "c1" should be sorted before "c2"
9447 * and 1 if it should be sorted after "c2".
9448 * Return 0 if the two constraints are the same (up to the constant term).
9450 * In particular, if a constraint involves later variables than another
9451 * then it is sorted after this other constraint.
9452 * uset_gist depends on constraints without existentially quantified
9453 * variables sorting first.
9455 * For constraints that have the same latest variable, those
9456 * with the same coefficient for this latest variable (first in absolute value
9457 * and then in actual value) are grouped together.
9458 * This is useful for detecting pairs of constraints that can
9459 * be chained in their printed representation.
9461 * Finally, within a group, constraints are sorted according to
9462 * their coefficients (excluding the constant term).
9464 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9466 isl_int
**c1
= (isl_int
**) p1
;
9467 isl_int
**c2
= (isl_int
**) p2
;
9469 unsigned size
= *(unsigned *) arg
;
9472 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9473 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9478 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9481 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9485 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9488 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9489 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9490 * and 0 if the two constraints are the same (up to the constant term).
9492 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9493 isl_int
*c1
, isl_int
*c2
)
9499 total
= isl_basic_map_total_dim(bmap
);
9500 return sort_constraint_cmp(&c1
, &c2
, &total
);
9503 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9504 __isl_take isl_basic_map
*bmap
)
9510 if (bmap
->n_ineq
== 0)
9512 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9514 total
= isl_basic_map_total_dim(bmap
);
9515 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9516 &sort_constraint_cmp
, &total
) < 0)
9517 return isl_basic_map_free(bmap
);
9521 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9522 __isl_take isl_basic_set
*bset
)
9524 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9525 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9528 __isl_give isl_basic_map
*isl_basic_map_normalize(
9529 __isl_take isl_basic_map
*bmap
)
9533 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9535 bmap
= isl_basic_map_remove_redundancies(bmap
);
9536 bmap
= isl_basic_map_sort_constraints(bmap
);
9538 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9541 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9542 __isl_keep isl_basic_map
*bmap2
)
9546 isl_space
*space1
, *space2
;
9548 if (!bmap1
|| !bmap2
)
9553 space1
= isl_basic_map_peek_space(bmap1
);
9554 space2
= isl_basic_map_peek_space(bmap2
);
9555 cmp
= isl_space_cmp(space1
, space2
);
9558 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9559 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9560 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9561 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9562 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9564 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9566 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9568 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9569 return bmap1
->n_eq
- bmap2
->n_eq
;
9570 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9571 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9572 if (bmap1
->n_div
!= bmap2
->n_div
)
9573 return bmap1
->n_div
- bmap2
->n_div
;
9574 total
= isl_basic_map_total_dim(bmap1
);
9575 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9576 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9580 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9581 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9585 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9586 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9593 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9594 __isl_keep isl_basic_set
*bset2
)
9596 return isl_basic_map_plain_cmp(bset1
, bset2
);
9599 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9605 if (set1
->n
!= set2
->n
)
9606 return set1
->n
- set2
->n
;
9608 for (i
= 0; i
< set1
->n
; ++i
) {
9609 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9617 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9618 __isl_keep isl_basic_map
*bmap2
)
9620 if (!bmap1
|| !bmap2
)
9621 return isl_bool_error
;
9622 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9625 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9626 __isl_keep isl_basic_set
*bset2
)
9628 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9629 bset_to_bmap(bset2
));
9632 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9634 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9635 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9637 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9640 /* Sort the basic maps of "map" and remove duplicate basic maps.
9642 * While removing basic maps, we make sure that the basic maps remain
9643 * sorted because isl_map_normalize expects the basic maps of the result
9646 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9650 map
= isl_map_remove_empty_parts(map
);
9653 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9654 for (i
= map
->n
- 1; i
>= 1; --i
) {
9655 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9657 isl_basic_map_free(map
->p
[i
-1]);
9658 for (j
= i
; j
< map
->n
; ++j
)
9659 map
->p
[j
- 1] = map
->p
[j
];
9666 /* Remove obvious duplicates among the basic maps of "map".
9668 * Unlike isl_map_normalize, this function does not remove redundant
9669 * constraints and only removes duplicates that have exactly the same
9670 * constraints in the input. It does sort the constraints and
9671 * the basic maps to ease the detection of duplicates.
9673 * If "map" has already been normalized or if the basic maps are
9674 * disjoint, then there can be no duplicates.
9676 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9679 isl_basic_map
*bmap
;
9685 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9687 for (i
= 0; i
< map
->n
; ++i
) {
9688 bmap
= isl_basic_map_copy(map
->p
[i
]);
9689 bmap
= isl_basic_map_sort_constraints(bmap
);
9691 return isl_map_free(map
);
9692 isl_basic_map_free(map
->p
[i
]);
9696 map
= sort_and_remove_duplicates(map
);
9700 /* We normalize in place, but if anything goes wrong we need
9701 * to return NULL, so we need to make sure we don't change the
9702 * meaning of any possible other copies of map.
9704 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9707 struct isl_basic_map
*bmap
;
9711 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9713 for (i
= 0; i
< map
->n
; ++i
) {
9714 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9717 isl_basic_map_free(map
->p
[i
]);
9721 map
= sort_and_remove_duplicates(map
);
9723 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9730 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9732 return set_from_map(isl_map_normalize(set_to_map(set
)));
9735 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9736 __isl_keep isl_map
*map2
)
9742 return isl_bool_error
;
9745 return isl_bool_true
;
9746 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9747 return isl_bool_false
;
9749 map1
= isl_map_copy(map1
);
9750 map2
= isl_map_copy(map2
);
9751 map1
= isl_map_normalize(map1
);
9752 map2
= isl_map_normalize(map2
);
9755 equal
= map1
->n
== map2
->n
;
9756 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9757 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9767 return isl_bool_error
;
9770 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9771 __isl_keep isl_set
*set2
)
9773 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9776 /* Return the basic maps in "map" as a list.
9778 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9779 __isl_keep isl_map
*map
)
9783 isl_basic_map_list
*list
;
9787 ctx
= isl_map_get_ctx(map
);
9788 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9790 for (i
= 0; i
< map
->n
; ++i
) {
9791 isl_basic_map
*bmap
;
9793 bmap
= isl_basic_map_copy(map
->p
[i
]);
9794 list
= isl_basic_map_list_add(list
, bmap
);
9800 /* Return the intersection of the elements in the non-empty list "list".
9801 * All elements are assumed to live in the same space.
9803 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9804 __isl_take isl_basic_map_list
*list
)
9807 isl_basic_map
*bmap
;
9811 n
= isl_basic_map_list_n_basic_map(list
);
9813 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9814 "expecting non-empty list", goto error
);
9816 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9817 for (i
= 1; i
< n
; ++i
) {
9818 isl_basic_map
*bmap_i
;
9820 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9821 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9824 isl_basic_map_list_free(list
);
9827 isl_basic_map_list_free(list
);
9831 /* Return the intersection of the elements in the non-empty list "list".
9832 * All elements are assumed to live in the same space.
9834 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9835 __isl_take isl_basic_set_list
*list
)
9837 return isl_basic_map_list_intersect(list
);
9840 /* Return the union of the elements of "list".
9841 * The list is required to have at least one element.
9843 __isl_give isl_set
*isl_basic_set_list_union(
9844 __isl_take isl_basic_set_list
*list
)
9848 isl_basic_set
*bset
;
9853 n
= isl_basic_set_list_n_basic_set(list
);
9855 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9856 "expecting non-empty list", goto error
);
9858 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9859 space
= isl_basic_set_get_space(bset
);
9860 isl_basic_set_free(bset
);
9862 set
= isl_set_alloc_space(space
, n
, 0);
9863 for (i
= 0; i
< n
; ++i
) {
9864 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9865 set
= isl_set_add_basic_set(set
, bset
);
9868 isl_basic_set_list_free(list
);
9871 isl_basic_set_list_free(list
);
9875 /* Return the union of the elements in the non-empty list "list".
9876 * All elements are assumed to live in the same space.
9878 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9885 n
= isl_set_list_n_set(list
);
9887 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9888 "expecting non-empty list", goto error
);
9890 set
= isl_set_list_get_set(list
, 0);
9891 for (i
= 1; i
< n
; ++i
) {
9894 set_i
= isl_set_list_get_set(list
, i
);
9895 set
= isl_set_union(set
, set_i
);
9898 isl_set_list_free(list
);
9901 isl_set_list_free(list
);
9905 __isl_give isl_basic_map
*isl_basic_map_product(
9906 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9908 isl_space
*dim_result
= NULL
;
9909 struct isl_basic_map
*bmap
;
9910 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9911 struct isl_dim_map
*dim_map1
, *dim_map2
;
9913 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9915 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9916 isl_space_copy(bmap2
->dim
));
9918 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9919 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9920 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9921 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9922 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9924 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9925 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9926 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9927 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9928 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9929 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9930 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9931 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9932 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9933 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9934 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9936 bmap
= isl_basic_map_alloc_space(dim_result
,
9937 bmap1
->n_div
+ bmap2
->n_div
,
9938 bmap1
->n_eq
+ bmap2
->n_eq
,
9939 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9940 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9941 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9942 bmap
= isl_basic_map_simplify(bmap
);
9943 return isl_basic_map_finalize(bmap
);
9945 isl_basic_map_free(bmap1
);
9946 isl_basic_map_free(bmap2
);
9950 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9951 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9953 isl_basic_map
*prod
;
9955 prod
= isl_basic_map_product(bmap1
, bmap2
);
9956 prod
= isl_basic_map_flatten(prod
);
9960 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9961 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9963 return isl_basic_map_flat_range_product(bset1
, bset2
);
9966 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9967 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9969 isl_space
*space_result
= NULL
;
9970 isl_basic_map
*bmap
;
9971 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9972 struct isl_dim_map
*dim_map1
, *dim_map2
;
9974 if (!bmap1
|| !bmap2
)
9977 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9978 isl_space_copy(bmap2
->dim
));
9980 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9981 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9982 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9983 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9985 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9986 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9987 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9988 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9989 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9990 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9991 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9992 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9993 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9994 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9995 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9997 bmap
= isl_basic_map_alloc_space(space_result
,
9998 bmap1
->n_div
+ bmap2
->n_div
,
9999 bmap1
->n_eq
+ bmap2
->n_eq
,
10000 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10001 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10002 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10003 bmap
= isl_basic_map_simplify(bmap
);
10004 return isl_basic_map_finalize(bmap
);
10006 isl_basic_map_free(bmap1
);
10007 isl_basic_map_free(bmap2
);
10011 __isl_give isl_basic_map
*isl_basic_map_range_product(
10012 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10015 isl_space
*dim_result
= NULL
;
10016 isl_basic_map
*bmap
;
10017 unsigned in
, out1
, out2
, nparam
, total
, pos
;
10018 struct isl_dim_map
*dim_map1
, *dim_map2
;
10020 rational
= isl_basic_map_is_rational(bmap1
);
10021 if (rational
>= 0 && rational
)
10022 rational
= isl_basic_map_is_rational(bmap2
);
10023 if (!bmap1
|| !bmap2
|| rational
< 0)
10026 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
10029 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
10030 isl_space_copy(bmap2
->dim
));
10032 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10033 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10034 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
10035 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10037 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
10038 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10039 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10040 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10041 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10042 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10043 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
10044 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
10045 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10046 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10047 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10049 bmap
= isl_basic_map_alloc_space(dim_result
,
10050 bmap1
->n_div
+ bmap2
->n_div
,
10051 bmap1
->n_eq
+ bmap2
->n_eq
,
10052 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10053 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10054 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10056 bmap
= isl_basic_map_set_rational(bmap
);
10057 bmap
= isl_basic_map_simplify(bmap
);
10058 return isl_basic_map_finalize(bmap
);
10060 isl_basic_map_free(bmap1
);
10061 isl_basic_map_free(bmap2
);
10065 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
10066 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10068 isl_basic_map
*prod
;
10070 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10071 prod
= isl_basic_map_flatten_range(prod
);
10075 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10076 * and collect the results.
10077 * The result live in the space obtained by calling "space_product"
10078 * on the spaces of "map1" and "map2".
10079 * If "remove_duplicates" is set then the result may contain duplicates
10080 * (even if the inputs do not) and so we try and remove the obvious
10083 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10084 __isl_take isl_map
*map2
,
10085 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10086 __isl_take isl_space
*right
),
10087 __isl_give isl_basic_map
*(*basic_map_product
)(
10088 __isl_take isl_basic_map
*left
,
10089 __isl_take isl_basic_map
*right
),
10090 int remove_duplicates
)
10092 unsigned flags
= 0;
10093 struct isl_map
*result
;
10097 m
= isl_map_has_equal_params(map1
, map2
);
10101 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10102 "parameters don't match", goto error
);
10104 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10105 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10106 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10108 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10109 isl_space_copy(map2
->dim
)),
10110 map1
->n
* map2
->n
, flags
);
10113 for (i
= 0; i
< map1
->n
; ++i
)
10114 for (j
= 0; j
< map2
->n
; ++j
) {
10115 struct isl_basic_map
*part
;
10116 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
10117 isl_basic_map_copy(map2
->p
[j
]));
10118 if (isl_basic_map_is_empty(part
))
10119 isl_basic_map_free(part
);
10121 result
= isl_map_add_basic_map(result
, part
);
10125 if (remove_duplicates
)
10126 result
= isl_map_remove_obvious_duplicates(result
);
10127 isl_map_free(map1
);
10128 isl_map_free(map2
);
10131 isl_map_free(map1
);
10132 isl_map_free(map2
);
10136 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
10138 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
10139 __isl_take isl_map
*map2
)
10141 return map_product(map1
, map2
, &isl_space_product
,
10142 &isl_basic_map_product
, 0);
10145 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
10146 __isl_take isl_map
*map2
)
10148 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
10151 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
10153 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
10154 __isl_take isl_map
*map2
)
10158 prod
= isl_map_product(map1
, map2
);
10159 prod
= isl_map_flatten(prod
);
10163 /* Given two set A and B, construct its Cartesian product A x B.
10165 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10167 return isl_map_range_product(set1
, set2
);
10170 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10171 __isl_take isl_set
*set2
)
10173 return isl_map_flat_range_product(set1
, set2
);
10176 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10178 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10179 __isl_take isl_map
*map2
)
10181 return map_product(map1
, map2
, &isl_space_domain_product
,
10182 &isl_basic_map_domain_product
, 1);
10185 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10187 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10188 __isl_take isl_map
*map2
)
10190 return map_product(map1
, map2
, &isl_space_range_product
,
10191 &isl_basic_map_range_product
, 1);
10194 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10195 __isl_take isl_map
*map2
)
10197 return isl_map_align_params_map_map_and(map1
, map2
,
10198 &map_domain_product_aligned
);
10201 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10202 __isl_take isl_map
*map2
)
10204 return isl_map_align_params_map_map_and(map1
, map2
,
10205 &map_range_product_aligned
);
10208 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10210 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10213 int total1
, keep1
, total2
, keep2
;
10217 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10218 !isl_space_range_is_wrapping(map
->dim
))
10219 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10220 "not a product", return isl_map_free(map
));
10222 space
= isl_map_get_space(map
);
10223 total1
= isl_space_dim(space
, isl_dim_in
);
10224 total2
= isl_space_dim(space
, isl_dim_out
);
10225 space
= isl_space_factor_domain(space
);
10226 keep1
= isl_space_dim(space
, isl_dim_in
);
10227 keep2
= isl_space_dim(space
, isl_dim_out
);
10228 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10229 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10230 map
= isl_map_reset_space(map
, space
);
10235 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10237 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10240 int total1
, keep1
, total2
, keep2
;
10244 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10245 !isl_space_range_is_wrapping(map
->dim
))
10246 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10247 "not a product", return isl_map_free(map
));
10249 space
= isl_map_get_space(map
);
10250 total1
= isl_space_dim(space
, isl_dim_in
);
10251 total2
= isl_space_dim(space
, isl_dim_out
);
10252 space
= isl_space_factor_range(space
);
10253 keep1
= isl_space_dim(space
, isl_dim_in
);
10254 keep2
= isl_space_dim(space
, isl_dim_out
);
10255 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10256 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10257 map
= isl_map_reset_space(map
, space
);
10262 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10264 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10271 if (!isl_space_domain_is_wrapping(map
->dim
))
10272 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10273 "domain is not a product", return isl_map_free(map
));
10275 space
= isl_map_get_space(map
);
10276 total
= isl_space_dim(space
, isl_dim_in
);
10277 space
= isl_space_domain_factor_domain(space
);
10278 keep
= isl_space_dim(space
, isl_dim_in
);
10279 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10280 map
= isl_map_reset_space(map
, space
);
10285 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10287 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10294 if (!isl_space_domain_is_wrapping(map
->dim
))
10295 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10296 "domain is not a product", return isl_map_free(map
));
10298 space
= isl_map_get_space(map
);
10299 total
= isl_space_dim(space
, isl_dim_in
);
10300 space
= isl_space_domain_factor_range(space
);
10301 keep
= isl_space_dim(space
, isl_dim_in
);
10302 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10303 map
= isl_map_reset_space(map
, space
);
10308 /* Given a map A -> [B -> C], extract the map A -> B.
10310 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10317 if (!isl_space_range_is_wrapping(map
->dim
))
10318 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10319 "range is not a product", return isl_map_free(map
));
10321 space
= isl_map_get_space(map
);
10322 total
= isl_space_dim(space
, isl_dim_out
);
10323 space
= isl_space_range_factor_domain(space
);
10324 keep
= isl_space_dim(space
, isl_dim_out
);
10325 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10326 map
= isl_map_reset_space(map
, space
);
10331 /* Given a map A -> [B -> C], extract the map A -> C.
10333 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10340 if (!isl_space_range_is_wrapping(map
->dim
))
10341 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10342 "range is not a product", return isl_map_free(map
));
10344 space
= isl_map_get_space(map
);
10345 total
= isl_space_dim(space
, isl_dim_out
);
10346 space
= isl_space_range_factor_range(space
);
10347 keep
= isl_space_dim(space
, isl_dim_out
);
10348 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10349 map
= isl_map_reset_space(map
, space
);
10354 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10356 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10357 __isl_take isl_map
*map2
)
10361 prod
= isl_map_domain_product(map1
, map2
);
10362 prod
= isl_map_flatten_domain(prod
);
10366 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10368 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10369 __isl_take isl_map
*map2
)
10373 prod
= isl_map_range_product(map1
, map2
);
10374 prod
= isl_map_flatten_range(prod
);
10378 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10381 uint32_t hash
= isl_hash_init();
10386 bmap
= isl_basic_map_copy(bmap
);
10387 bmap
= isl_basic_map_normalize(bmap
);
10390 total
= isl_basic_map_total_dim(bmap
);
10391 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10392 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10394 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10395 isl_hash_hash(hash
, c_hash
);
10397 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10398 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10400 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10401 isl_hash_hash(hash
, c_hash
);
10403 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10404 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10406 if (isl_int_is_zero(bmap
->div
[i
][0]))
10408 isl_hash_byte(hash
, i
& 0xFF);
10409 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10410 isl_hash_hash(hash
, c_hash
);
10412 isl_basic_map_free(bmap
);
10416 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10418 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10421 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10428 map
= isl_map_copy(map
);
10429 map
= isl_map_normalize(map
);
10433 hash
= isl_hash_init();
10434 for (i
= 0; i
< map
->n
; ++i
) {
10435 uint32_t bmap_hash
;
10436 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10437 isl_hash_hash(hash
, bmap_hash
);
10445 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10447 return isl_map_get_hash(set_to_map(set
));
10450 /* Return the number of basic maps in the (current) representation of "map".
10452 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10454 return map
? map
->n
: 0;
10457 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10459 return set
? set
->n
: 0;
10462 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10463 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10468 return isl_stat_error
;
10470 for (i
= 0; i
< map
->n
; ++i
)
10471 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10472 return isl_stat_error
;
10474 return isl_stat_ok
;
10477 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10478 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10483 return isl_stat_error
;
10485 for (i
= 0; i
< set
->n
; ++i
)
10486 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10487 return isl_stat_error
;
10489 return isl_stat_ok
;
10492 /* Return a list of basic sets, the union of which is equal to "set".
10494 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10495 __isl_keep isl_set
*set
)
10498 isl_basic_set_list
*list
;
10503 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10504 for (i
= 0; i
< set
->n
; ++i
) {
10505 isl_basic_set
*bset
;
10507 bset
= isl_basic_set_copy(set
->p
[i
]);
10508 list
= isl_basic_set_list_add(list
, bset
);
10514 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10521 bset
= isl_basic_set_cow(bset
);
10525 dim
= isl_basic_set_get_space(bset
);
10526 dim
= isl_space_lift(dim
, bset
->n_div
);
10529 isl_space_free(bset
->dim
);
10531 bset
->extra
-= bset
->n_div
;
10534 bset
= isl_basic_set_finalize(bset
);
10538 isl_basic_set_free(bset
);
10542 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10548 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10553 set
= isl_set_cow(set
);
10557 n_div
= set
->p
[0]->n_div
;
10558 dim
= isl_set_get_space(set
);
10559 dim
= isl_space_lift(dim
, n_div
);
10562 isl_space_free(set
->dim
);
10565 for (i
= 0; i
< set
->n
; ++i
) {
10566 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10577 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10585 dim
= isl_basic_set_total_dim(bset
);
10586 size
+= bset
->n_eq
* (1 + dim
);
10587 size
+= bset
->n_ineq
* (1 + dim
);
10588 size
+= bset
->n_div
* (2 + dim
);
10593 int isl_set_size(__isl_keep isl_set
*set
)
10601 for (i
= 0; i
< set
->n
; ++i
)
10602 size
+= isl_basic_set_size(set
->p
[i
]);
10607 /* Check if there is any lower bound (if lower == 0) and/or upper
10608 * bound (if upper == 0) on the specified dim.
10610 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10611 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10615 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10616 return isl_bool_error
;
10618 pos
+= isl_basic_map_offset(bmap
, type
);
10620 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10621 if (isl_int_is_zero(bmap
->div
[i
][0]))
10623 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10624 return isl_bool_true
;
10627 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10628 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10629 return isl_bool_true
;
10631 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10632 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10639 return lower
&& upper
;
10642 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10643 enum isl_dim_type type
, unsigned pos
)
10645 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10648 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10649 enum isl_dim_type type
, unsigned pos
)
10651 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10654 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10655 enum isl_dim_type type
, unsigned pos
)
10657 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10660 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10661 enum isl_dim_type type
, unsigned pos
)
10666 return isl_bool_error
;
10668 for (i
= 0; i
< map
->n
; ++i
) {
10670 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10671 if (bounded
< 0 || !bounded
)
10675 return isl_bool_true
;
10678 /* Return true if the specified dim is involved in both an upper bound
10679 * and a lower bound.
10681 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10682 enum isl_dim_type type
, unsigned pos
)
10684 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10687 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10689 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10690 enum isl_dim_type type
, unsigned pos
,
10691 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10692 enum isl_dim_type type
, unsigned pos
))
10697 return isl_bool_error
;
10699 for (i
= 0; i
< map
->n
; ++i
) {
10701 bounded
= fn(map
->p
[i
], type
, pos
);
10702 if (bounded
< 0 || bounded
)
10706 return isl_bool_false
;
10709 /* Return 1 if the specified dim is involved in any lower bound.
10711 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10712 enum isl_dim_type type
, unsigned pos
)
10714 return has_any_bound(set
, type
, pos
,
10715 &isl_basic_map_dim_has_lower_bound
);
10718 /* Return 1 if the specified dim is involved in any upper bound.
10720 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10721 enum isl_dim_type type
, unsigned pos
)
10723 return has_any_bound(set
, type
, pos
,
10724 &isl_basic_map_dim_has_upper_bound
);
10727 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10729 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10730 enum isl_dim_type type
, unsigned pos
,
10731 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10732 enum isl_dim_type type
, unsigned pos
))
10737 return isl_bool_error
;
10739 for (i
= 0; i
< map
->n
; ++i
) {
10741 bounded
= fn(map
->p
[i
], type
, pos
);
10742 if (bounded
< 0 || !bounded
)
10746 return isl_bool_true
;
10749 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10751 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10752 enum isl_dim_type type
, unsigned pos
)
10754 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10757 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10759 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10760 enum isl_dim_type type
, unsigned pos
)
10762 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10765 /* For each of the "n" variables starting at "first", determine
10766 * the sign of the variable and put the results in the first "n"
10767 * elements of the array "signs".
10769 * 1 means that the variable is non-negative
10770 * -1 means that the variable is non-positive
10771 * 0 means the variable attains both positive and negative values.
10773 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10774 unsigned first
, unsigned n
, int *signs
)
10776 isl_vec
*bound
= NULL
;
10777 struct isl_tab
*tab
= NULL
;
10778 struct isl_tab_undo
*snap
;
10781 if (!bset
|| !signs
)
10782 return isl_stat_error
;
10784 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10785 tab
= isl_tab_from_basic_set(bset
, 0);
10786 if (!bound
|| !tab
)
10789 isl_seq_clr(bound
->el
, bound
->size
);
10790 isl_int_set_si(bound
->el
[0], -1);
10792 snap
= isl_tab_snap(tab
);
10793 for (i
= 0; i
< n
; ++i
) {
10796 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10797 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10799 empty
= tab
->empty
;
10800 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10801 if (isl_tab_rollback(tab
, snap
) < 0)
10809 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10810 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10812 empty
= tab
->empty
;
10813 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10814 if (isl_tab_rollback(tab
, snap
) < 0)
10817 signs
[i
] = empty
? -1 : 0;
10821 isl_vec_free(bound
);
10822 return isl_stat_ok
;
10825 isl_vec_free(bound
);
10826 return isl_stat_error
;
10829 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10830 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10832 if (!bset
|| !signs
)
10833 return isl_stat_error
;
10834 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10835 return isl_stat_error
);
10837 first
+= pos(bset
->dim
, type
) - 1;
10838 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10841 /* Is it possible for the integer division "div" to depend (possibly
10842 * indirectly) on any output dimensions?
10844 * If the div is undefined, then we conservatively assume that it
10845 * may depend on them.
10846 * Otherwise, we check if it actually depends on them or on any integer
10847 * divisions that may depend on them.
10849 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10852 unsigned n_out
, o_out
;
10853 unsigned n_div
, o_div
;
10855 if (isl_int_is_zero(bmap
->div
[div
][0]))
10856 return isl_bool_true
;
10858 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10859 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10861 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10862 return isl_bool_true
;
10864 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10865 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10867 for (i
= 0; i
< n_div
; ++i
) {
10868 isl_bool may_involve
;
10870 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10872 may_involve
= div_may_involve_output(bmap
, i
);
10873 if (may_involve
< 0 || may_involve
)
10874 return may_involve
;
10877 return isl_bool_false
;
10880 /* Return the first integer division of "bmap" in the range
10881 * [first, first + n[ that may depend on any output dimensions and
10882 * that has a non-zero coefficient in "c" (where the first coefficient
10883 * in "c" corresponds to integer division "first").
10885 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10886 isl_int
*c
, int first
, int n
)
10893 for (k
= first
; k
< first
+ n
; ++k
) {
10894 isl_bool may_involve
;
10896 if (isl_int_is_zero(c
[k
]))
10898 may_involve
= div_may_involve_output(bmap
, k
);
10899 if (may_involve
< 0)
10908 /* Look for a pair of inequality constraints in "bmap" of the form
10910 * -l + i >= 0 or i >= l
10912 * n + l - i >= 0 or i <= l + n
10914 * with n < "m" and i the output dimension at position "pos".
10915 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10916 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10917 * and earlier output dimensions, as well as integer divisions that do
10918 * not involve any of the output dimensions.
10920 * Return the index of the first inequality constraint or bmap->n_ineq
10921 * if no such pair can be found.
10923 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10924 int pos
, isl_int m
)
10929 unsigned n_div
, o_div
;
10930 unsigned n_out
, o_out
;
10936 ctx
= isl_basic_map_get_ctx(bmap
);
10937 total
= isl_basic_map_total_dim(bmap
);
10938 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10939 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10940 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10941 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10942 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10943 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10945 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10946 n_out
- (pos
+ 1)) != -1)
10948 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10951 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10952 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10955 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10956 bmap
->ineq
[j
] + 1, total
))
10960 if (j
>= bmap
->n_ineq
)
10962 isl_int_add(bmap
->ineq
[i
][0],
10963 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10964 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10965 isl_int_sub(bmap
->ineq
[i
][0],
10966 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10969 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10975 return bmap
->n_ineq
;
10978 /* Return the index of the equality of "bmap" that defines
10979 * the output dimension "pos" in terms of earlier dimensions.
10980 * The equality may also involve integer divisions, as long
10981 * as those integer divisions are defined in terms of
10982 * parameters or input dimensions.
10983 * In this case, *div is set to the number of integer divisions and
10984 * *ineq is set to the number of inequality constraints (provided
10985 * div and ineq are not NULL).
10987 * The equality may also involve a single integer division involving
10988 * the output dimensions (typically only output dimension "pos") as
10989 * long as the coefficient of output dimension "pos" is 1 or -1 and
10990 * there is a pair of constraints i >= l and i <= l + n, with i referring
10991 * to output dimension "pos", l an expression involving only earlier
10992 * dimensions and n smaller than the coefficient of the integer division
10993 * in the equality. In this case, the output dimension can be defined
10994 * in terms of a modulo expression that does not involve the integer division.
10995 * *div is then set to this single integer division and
10996 * *ineq is set to the index of constraint i >= l.
10998 * Return bmap->n_eq if there is no such equality.
10999 * Return -1 on error.
11001 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
11002 int pos
, int *div
, int *ineq
)
11005 unsigned n_out
, o_out
;
11006 unsigned n_div
, o_div
;
11011 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11012 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
11013 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11014 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11017 *ineq
= bmap
->n_ineq
;
11020 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
11021 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
11023 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
11024 n_out
- (pos
+ 1)) != -1)
11026 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11030 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
11031 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
11033 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11034 k
+ 1, n_div
- (k
+1)) < n_div
)
11036 l
= find_modulo_constraint_pair(bmap
, pos
,
11037 bmap
->eq
[j
][o_div
+ k
]);
11040 if (l
>= bmap
->n_ineq
)
11052 /* Check if the given basic map is obviously single-valued.
11053 * In particular, for each output dimension, check that there is
11054 * an equality that defines the output dimension in terms of
11055 * earlier dimensions.
11057 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11063 return isl_bool_error
;
11065 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11067 for (i
= 0; i
< n_out
; ++i
) {
11070 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11073 return isl_bool_error
;
11074 if (eq
>= bmap
->n_eq
)
11075 return isl_bool_false
;
11078 return isl_bool_true
;
11081 /* Check if the given basic map is single-valued.
11082 * We simply compute
11086 * and check if the result is a subset of the identity mapping.
11088 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11091 isl_basic_map
*test
;
11095 sv
= isl_basic_map_plain_is_single_valued(bmap
);
11099 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
11100 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
11102 space
= isl_basic_map_get_space(bmap
);
11103 space
= isl_space_map_from_set(isl_space_range(space
));
11104 id
= isl_basic_map_identity(space
);
11106 sv
= isl_basic_map_is_subset(test
, id
);
11108 isl_basic_map_free(test
);
11109 isl_basic_map_free(id
);
11114 /* Check if the given map is obviously single-valued.
11116 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
11119 return isl_bool_error
;
11121 return isl_bool_true
;
11123 return isl_bool_false
;
11125 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
11128 /* Check if the given map is single-valued.
11129 * We simply compute
11133 * and check if the result is a subset of the identity mapping.
11135 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
11142 sv
= isl_map_plain_is_single_valued(map
);
11146 test
= isl_map_reverse(isl_map_copy(map
));
11147 test
= isl_map_apply_range(test
, isl_map_copy(map
));
11149 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
11150 id
= isl_map_identity(dim
);
11152 sv
= isl_map_is_subset(test
, id
);
11154 isl_map_free(test
);
11160 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
11164 map
= isl_map_copy(map
);
11165 map
= isl_map_reverse(map
);
11166 in
= isl_map_is_single_valued(map
);
11172 /* Check if the given map is obviously injective.
11174 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11178 map
= isl_map_copy(map
);
11179 map
= isl_map_reverse(map
);
11180 in
= isl_map_plain_is_single_valued(map
);
11186 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11190 sv
= isl_map_is_single_valued(map
);
11194 return isl_map_is_injective(map
);
11197 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11199 return isl_map_is_single_valued(set_to_map(set
));
11202 /* Does "map" only map elements to themselves?
11204 * If the domain and range spaces are different, then "map"
11205 * is considered not to be an identity relation, even if it is empty.
11206 * Otherwise, construct the maximal identity relation and
11207 * check whether "map" is a subset of this relation.
11209 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11213 isl_bool equal
, is_identity
;
11215 space
= isl_map_get_space(map
);
11216 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11217 isl_space_free(space
);
11218 if (equal
< 0 || !equal
)
11221 id
= isl_map_identity(isl_map_get_space(map
));
11222 is_identity
= isl_map_is_subset(map
, id
);
11225 return is_identity
;
11228 int isl_map_is_translation(__isl_keep isl_map
*map
)
11233 delta
= isl_map_deltas(isl_map_copy(map
));
11234 ok
= isl_set_is_singleton(delta
);
11235 isl_set_free(delta
);
11240 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11242 if (isl_seq_first_non_zero(p
, pos
) != -1)
11244 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11249 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11256 return isl_bool_error
;
11258 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11259 return isl_bool_false
;
11261 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11262 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11263 for (j
= 0; j
< nvar
; ++j
) {
11264 int lower
= 0, upper
= 0;
11265 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11266 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11268 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11269 return isl_bool_false
;
11272 if (i
< bset
->n_eq
)
11274 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11275 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11277 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11278 return isl_bool_false
;
11279 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11284 if (!lower
|| !upper
)
11285 return isl_bool_false
;
11288 return isl_bool_true
;
11291 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11294 return isl_bool_error
;
11296 return isl_bool_false
;
11298 return isl_basic_set_is_box(set
->p
[0]);
11301 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11304 return isl_bool_error
;
11306 return isl_space_is_wrapping(bset
->dim
);
11309 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11312 return isl_bool_error
;
11314 return isl_space_is_wrapping(set
->dim
);
11317 /* Modify the space of "map" through a call to "change".
11318 * If "can_change" is set (not NULL), then first call it to check
11319 * if the modification is allowed, printing the error message "cannot_change"
11322 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11323 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11324 const char *cannot_change
,
11325 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11333 ok
= can_change
? can_change(map
) : isl_bool_true
;
11335 return isl_map_free(map
);
11337 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11338 return isl_map_free(map
));
11340 space
= change(isl_map_get_space(map
));
11341 map
= isl_map_reset_space(map
, space
);
11346 /* Is the domain of "map" a wrapped relation?
11348 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11351 return isl_bool_error
;
11353 return isl_space_domain_is_wrapping(map
->dim
);
11356 /* Does "map" have a wrapped relation in both domain and range?
11358 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
11360 return isl_space_is_product(isl_map_peek_space(map
));
11363 /* Is the range of "map" a wrapped relation?
11365 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11368 return isl_bool_error
;
11370 return isl_space_range_is_wrapping(map
->dim
);
11373 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11375 bmap
= isl_basic_map_cow(bmap
);
11379 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11383 bmap
= isl_basic_map_finalize(bmap
);
11385 return bset_from_bmap(bmap
);
11387 isl_basic_map_free(bmap
);
11391 /* Given a map A -> B, return the set (A -> B).
11393 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11395 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11398 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11400 bset
= isl_basic_set_cow(bset
);
11404 bset
->dim
= isl_space_unwrap(bset
->dim
);
11408 bset
= isl_basic_set_finalize(bset
);
11410 return bset_to_bmap(bset
);
11412 isl_basic_set_free(bset
);
11416 /* Given a set (A -> B), return the map A -> B.
11417 * Error out if "set" is not of the form (A -> B).
11419 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11421 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11422 "not a wrapping set", &isl_space_unwrap
);
11425 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11426 enum isl_dim_type type
)
11431 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11434 bmap
= isl_basic_map_cow(bmap
);
11438 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11442 bmap
= isl_basic_map_finalize(bmap
);
11446 isl_basic_map_free(bmap
);
11450 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11451 enum isl_dim_type type
)
11458 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11461 map
= isl_map_cow(map
);
11465 for (i
= 0; i
< map
->n
; ++i
) {
11466 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11470 map
->dim
= isl_space_reset(map
->dim
, type
);
11480 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11485 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11488 bmap
= isl_basic_map_cow(bmap
);
11492 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11496 bmap
= isl_basic_map_finalize(bmap
);
11500 isl_basic_map_free(bmap
);
11504 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11506 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11509 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11510 __isl_take isl_basic_map
*bmap
)
11515 if (!bmap
->dim
->nested
[0])
11518 bmap
= isl_basic_map_cow(bmap
);
11522 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11526 bmap
= isl_basic_map_finalize(bmap
);
11530 isl_basic_map_free(bmap
);
11534 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11535 __isl_take isl_basic_map
*bmap
)
11540 if (!bmap
->dim
->nested
[1])
11543 bmap
= isl_basic_map_cow(bmap
);
11547 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11551 bmap
= isl_basic_map_finalize(bmap
);
11555 isl_basic_map_free(bmap
);
11559 /* Remove any internal structure from the spaces of domain and range of "map".
11561 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11566 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11569 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11572 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11574 return set_from_map(isl_map_flatten(set_to_map(set
)));
11577 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11579 isl_space
*dim
, *flat_dim
;
11582 dim
= isl_set_get_space(set
);
11583 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11584 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11585 map
= isl_map_intersect_domain(map
, set
);
11590 /* Remove any internal structure from the space of the domain of "map".
11592 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11597 if (!map
->dim
->nested
[0])
11600 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11603 /* Remove any internal structure from the space of the range of "map".
11605 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11610 if (!map
->dim
->nested
[1])
11613 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11616 /* Reorder the dimensions of "bmap" according to the given dim_map
11617 * and set the dimension specification to "dim" and
11618 * perform Gaussian elimination on the result.
11620 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11621 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11623 isl_basic_map
*res
;
11626 bmap
= isl_basic_map_cow(bmap
);
11627 if (!bmap
|| !dim
|| !dim_map
)
11630 flags
= bmap
->flags
;
11631 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11632 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11633 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11634 res
= isl_basic_map_alloc_space(dim
,
11635 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11636 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11638 res
->flags
= flags
;
11639 res
= isl_basic_map_gauss(res
, NULL
);
11640 res
= isl_basic_map_finalize(res
);
11644 isl_basic_map_free(bmap
);
11645 isl_space_free(dim
);
11649 /* Reorder the dimensions of "map" according to given reordering.
11651 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11652 __isl_take isl_reordering
*r
)
11655 struct isl_dim_map
*dim_map
;
11657 map
= isl_map_cow(map
);
11658 dim_map
= isl_dim_map_from_reordering(r
);
11659 if (!map
|| !r
|| !dim_map
)
11662 for (i
= 0; i
< map
->n
; ++i
) {
11663 struct isl_dim_map
*dim_map_i
;
11665 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11667 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11668 isl_space_copy(r
->dim
), dim_map_i
);
11674 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11676 isl_reordering_free(r
);
11682 isl_reordering_free(r
);
11686 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11687 __isl_take isl_reordering
*r
)
11689 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11692 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11693 __isl_take isl_space
*model
)
11698 if (!map
|| !model
)
11701 ctx
= isl_space_get_ctx(model
);
11702 if (!isl_space_has_named_params(model
))
11703 isl_die(ctx
, isl_error_invalid
,
11704 "model has unnamed parameters", goto error
);
11705 if (isl_map_check_named_params(map
) < 0)
11707 aligned
= isl_map_space_has_equal_params(map
, model
);
11711 isl_reordering
*exp
;
11713 model
= isl_space_drop_dims(model
, isl_dim_in
,
11714 0, isl_space_dim(model
, isl_dim_in
));
11715 model
= isl_space_drop_dims(model
, isl_dim_out
,
11716 0, isl_space_dim(model
, isl_dim_out
));
11717 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11718 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11719 map
= isl_map_realign(map
, exp
);
11722 isl_space_free(model
);
11725 isl_space_free(model
);
11730 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11731 __isl_take isl_space
*model
)
11733 return isl_map_align_params(set
, model
);
11736 /* Align the parameters of "bmap" to those of "model", introducing
11737 * additional parameters if needed.
11739 __isl_give isl_basic_map
*isl_basic_map_align_params(
11740 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11743 isl_bool equal_params
;
11745 if (!bmap
|| !model
)
11748 ctx
= isl_space_get_ctx(model
);
11749 if (!isl_space_has_named_params(model
))
11750 isl_die(ctx
, isl_error_invalid
,
11751 "model has unnamed parameters", goto error
);
11752 if (!isl_space_has_named_params(bmap
->dim
))
11753 isl_die(ctx
, isl_error_invalid
,
11754 "relation has unnamed parameters", goto error
);
11755 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11756 if (equal_params
< 0)
11758 if (!equal_params
) {
11759 isl_reordering
*exp
;
11760 struct isl_dim_map
*dim_map
;
11762 model
= isl_space_drop_dims(model
, isl_dim_in
,
11763 0, isl_space_dim(model
, isl_dim_in
));
11764 model
= isl_space_drop_dims(model
, isl_dim_out
,
11765 0, isl_space_dim(model
, isl_dim_out
));
11766 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11767 exp
= isl_reordering_extend_space(exp
,
11768 isl_basic_map_get_space(bmap
));
11769 dim_map
= isl_dim_map_from_reordering(exp
);
11770 bmap
= isl_basic_map_realign(bmap
,
11771 exp
? isl_space_copy(exp
->dim
) : NULL
,
11772 isl_dim_map_extend(dim_map
, bmap
));
11773 isl_reordering_free(exp
);
11777 isl_space_free(model
);
11780 isl_space_free(model
);
11781 isl_basic_map_free(bmap
);
11785 /* Do "bset" and "space" have the same parameters?
11787 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11788 __isl_keep isl_space
*space
)
11790 isl_space
*bset_space
;
11792 bset_space
= isl_basic_set_peek_space(bset
);
11793 return isl_space_has_equal_params(bset_space
, space
);
11796 /* Do "map" and "space" have the same parameters?
11798 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11799 __isl_keep isl_space
*space
)
11801 isl_space
*map_space
;
11803 map_space
= isl_map_peek_space(map
);
11804 return isl_space_has_equal_params(map_space
, space
);
11807 /* Do "set" and "space" have the same parameters?
11809 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11810 __isl_keep isl_space
*space
)
11812 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11815 /* Align the parameters of "bset" to those of "model", introducing
11816 * additional parameters if needed.
11818 __isl_give isl_basic_set
*isl_basic_set_align_params(
11819 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11821 return isl_basic_map_align_params(bset
, model
);
11824 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11825 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11826 enum isl_dim_type c2
, enum isl_dim_type c3
,
11827 enum isl_dim_type c4
, enum isl_dim_type c5
)
11829 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11830 struct isl_mat
*mat
;
11836 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11837 isl_basic_map_total_dim(bmap
) + 1);
11840 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11841 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11842 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11843 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11844 isl_int_set(mat
->row
[i
][pos
],
11845 bmap
->eq
[i
][off
+ k
]);
11853 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11854 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11855 enum isl_dim_type c2
, enum isl_dim_type c3
,
11856 enum isl_dim_type c4
, enum isl_dim_type c5
)
11858 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11859 struct isl_mat
*mat
;
11865 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11866 isl_basic_map_total_dim(bmap
) + 1);
11869 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11870 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11871 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11872 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11873 isl_int_set(mat
->row
[i
][pos
],
11874 bmap
->ineq
[i
][off
+ k
]);
11882 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11883 __isl_take isl_space
*dim
,
11884 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11885 enum isl_dim_type c2
, enum isl_dim_type c3
,
11886 enum isl_dim_type c4
, enum isl_dim_type c5
)
11888 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11889 isl_basic_map
*bmap
;
11895 if (!dim
|| !eq
|| !ineq
)
11898 if (eq
->n_col
!= ineq
->n_col
)
11899 isl_die(dim
->ctx
, isl_error_invalid
,
11900 "equalities and inequalities matrices should have "
11901 "same number of columns", goto error
);
11903 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11905 if (eq
->n_col
< total
)
11906 isl_die(dim
->ctx
, isl_error_invalid
,
11907 "number of columns too small", goto error
);
11909 extra
= eq
->n_col
- total
;
11911 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11912 eq
->n_row
, ineq
->n_row
);
11915 for (i
= 0; i
< extra
; ++i
) {
11916 k
= isl_basic_map_alloc_div(bmap
);
11919 isl_int_set_si(bmap
->div
[k
][0], 0);
11921 for (i
= 0; i
< eq
->n_row
; ++i
) {
11922 l
= isl_basic_map_alloc_equality(bmap
);
11925 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11926 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11927 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11928 isl_int_set(bmap
->eq
[l
][off
+ k
],
11934 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11935 l
= isl_basic_map_alloc_inequality(bmap
);
11938 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11939 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11940 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11941 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11942 ineq
->row
[i
][pos
]);
11948 isl_space_free(dim
);
11950 isl_mat_free(ineq
);
11952 bmap
= isl_basic_map_simplify(bmap
);
11953 return isl_basic_map_finalize(bmap
);
11955 isl_space_free(dim
);
11957 isl_mat_free(ineq
);
11961 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11962 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11963 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11965 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11966 c1
, c2
, c3
, c4
, isl_dim_in
);
11969 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11970 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11971 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11973 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11974 c1
, c2
, c3
, c4
, isl_dim_in
);
11977 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11978 __isl_take isl_space
*dim
,
11979 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11980 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11982 isl_basic_map
*bmap
;
11983 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11984 c1
, c2
, c3
, c4
, isl_dim_in
);
11985 return bset_from_bmap(bmap
);
11988 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11991 return isl_bool_error
;
11993 return isl_space_can_zip(bmap
->dim
);
11996 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11999 return isl_bool_error
;
12001 return isl_space_can_zip(map
->dim
);
12004 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
12005 * (A -> C) -> (B -> D).
12007 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
12016 if (!isl_basic_map_can_zip(bmap
))
12017 isl_die(bmap
->ctx
, isl_error_invalid
,
12018 "basic map cannot be zipped", goto error
);
12019 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
12020 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
12021 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
12022 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
12023 bmap
= isl_basic_map_cow(bmap
);
12024 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
12027 bmap
->dim
= isl_space_zip(bmap
->dim
);
12030 bmap
= isl_basic_map_mark_final(bmap
);
12033 isl_basic_map_free(bmap
);
12037 /* Given a map (A -> B) -> (C -> D), return the corresponding map
12038 * (A -> C) -> (B -> D).
12040 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
12047 if (!isl_map_can_zip(map
))
12048 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
12051 map
= isl_map_cow(map
);
12055 for (i
= 0; i
< map
->n
; ++i
) {
12056 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
12061 map
->dim
= isl_space_zip(map
->dim
);
12071 /* Can we apply isl_basic_map_curry to "bmap"?
12072 * That is, does it have a nested relation in its domain?
12074 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
12077 return isl_bool_error
;
12079 return isl_space_can_curry(bmap
->dim
);
12082 /* Can we apply isl_map_curry to "map"?
12083 * That is, does it have a nested relation in its domain?
12085 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
12088 return isl_bool_error
;
12090 return isl_space_can_curry(map
->dim
);
12093 /* Given a basic map (A -> B) -> C, return the corresponding basic map
12096 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
12102 if (!isl_basic_map_can_curry(bmap
))
12103 isl_die(bmap
->ctx
, isl_error_invalid
,
12104 "basic map cannot be curried", goto error
);
12105 bmap
= isl_basic_map_cow(bmap
);
12108 bmap
->dim
= isl_space_curry(bmap
->dim
);
12111 bmap
= isl_basic_map_mark_final(bmap
);
12114 isl_basic_map_free(bmap
);
12118 /* Given a map (A -> B) -> C, return the corresponding map
12121 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
12123 return isl_map_change_space(map
, &isl_map_can_curry
,
12124 "map cannot be curried", &isl_space_curry
);
12127 /* Can isl_map_range_curry be applied to "map"?
12128 * That is, does it have a nested relation in its range,
12129 * the domain of which is itself a nested relation?
12131 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
12134 return isl_bool_error
;
12136 return isl_space_can_range_curry(map
->dim
);
12139 /* Given a map A -> ((B -> C) -> D), return the corresponding map
12140 * A -> (B -> (C -> D)).
12142 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
12144 return isl_map_change_space(map
, &isl_map_can_range_curry
,
12145 "map range cannot be curried",
12146 &isl_space_range_curry
);
12149 /* Can we apply isl_basic_map_uncurry to "bmap"?
12150 * That is, does it have a nested relation in its domain?
12152 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
12155 return isl_bool_error
;
12157 return isl_space_can_uncurry(bmap
->dim
);
12160 /* Can we apply isl_map_uncurry to "map"?
12161 * That is, does it have a nested relation in its domain?
12163 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
12166 return isl_bool_error
;
12168 return isl_space_can_uncurry(map
->dim
);
12171 /* Given a basic map A -> (B -> C), return the corresponding basic map
12174 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12180 if (!isl_basic_map_can_uncurry(bmap
))
12181 isl_die(bmap
->ctx
, isl_error_invalid
,
12182 "basic map cannot be uncurried",
12183 return isl_basic_map_free(bmap
));
12184 bmap
= isl_basic_map_cow(bmap
);
12187 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12189 return isl_basic_map_free(bmap
);
12190 bmap
= isl_basic_map_mark_final(bmap
);
12194 /* Given a map A -> (B -> C), return the corresponding map
12197 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12199 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12200 "map cannot be uncurried", &isl_space_uncurry
);
12203 /* Construct a basic map mapping the domain of the affine expression
12204 * to a one-dimensional range prescribed by the affine expression.
12205 * If "rational" is set, then construct a rational basic map.
12207 * A NaN affine expression cannot be converted to a basic map.
12209 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
12210 __isl_take isl_aff
*aff
, int rational
)
12215 isl_local_space
*ls
;
12216 isl_basic_map
*bmap
= NULL
;
12220 is_nan
= isl_aff_is_nan(aff
);
12224 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
12225 "cannot convert NaN", goto error
);
12227 ls
= isl_aff_get_local_space(aff
);
12228 bmap
= isl_basic_map_from_local_space(ls
);
12229 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
12230 k
= isl_basic_map_alloc_equality(bmap
);
12234 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
12235 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
12236 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
12237 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
12238 aff
->v
->size
- (pos
+ 1));
12242 bmap
= isl_basic_map_set_rational(bmap
);
12243 bmap
= isl_basic_map_gauss(bmap
, NULL
);
12244 bmap
= isl_basic_map_finalize(bmap
);
12248 isl_basic_map_free(bmap
);
12252 /* Construct a basic map mapping the domain of the affine expression
12253 * to a one-dimensional range prescribed by the affine expression.
12255 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
12257 return isl_basic_map_from_aff2(aff
, 0);
12260 /* Construct a map mapping the domain of the affine expression
12261 * to a one-dimensional range prescribed by the affine expression.
12263 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
12265 isl_basic_map
*bmap
;
12267 bmap
= isl_basic_map_from_aff(aff
);
12268 return isl_map_from_basic_map(bmap
);
12271 /* Construct a basic map mapping the domain the multi-affine expression
12272 * to its range, with each dimension in the range equated to the
12273 * corresponding affine expression.
12274 * If "rational" is set, then construct a rational basic map.
12276 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
12277 __isl_take isl_multi_aff
*maff
, int rational
)
12281 isl_basic_map
*bmap
;
12286 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
12287 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
12288 "invalid space", goto error
);
12290 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
12291 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
12293 bmap
= isl_basic_map_set_rational(bmap
);
12295 for (i
= 0; i
< maff
->n
; ++i
) {
12297 isl_basic_map
*bmap_i
;
12299 aff
= isl_aff_copy(maff
->u
.p
[i
]);
12300 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
12302 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12305 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
12307 isl_multi_aff_free(maff
);
12310 isl_multi_aff_free(maff
);
12314 /* Construct a basic map mapping the domain the multi-affine expression
12315 * to its range, with each dimension in the range equated to the
12316 * corresponding affine expression.
12318 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
12319 __isl_take isl_multi_aff
*ma
)
12321 return isl_basic_map_from_multi_aff2(ma
, 0);
12324 /* Construct a map mapping the domain the multi-affine expression
12325 * to its range, with each dimension in the range equated to the
12326 * corresponding affine expression.
12328 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
12330 isl_basic_map
*bmap
;
12332 bmap
= isl_basic_map_from_multi_aff(maff
);
12333 return isl_map_from_basic_map(bmap
);
12336 /* Construct a basic map mapping a domain in the given space to
12337 * to an n-dimensional range, with n the number of elements in the list,
12338 * where each coordinate in the range is prescribed by the
12339 * corresponding affine expression.
12340 * The domains of all affine expressions in the list are assumed to match
12343 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
12344 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
12348 isl_basic_map
*bmap
;
12353 dim
= isl_space_from_domain(domain_dim
);
12354 bmap
= isl_basic_map_universe(dim
);
12356 for (i
= 0; i
< list
->n
; ++i
) {
12358 isl_basic_map
*bmap_i
;
12360 aff
= isl_aff_copy(list
->p
[i
]);
12361 bmap_i
= isl_basic_map_from_aff(aff
);
12363 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12366 isl_aff_list_free(list
);
12370 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12371 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12373 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12376 /* Construct a basic map where the given dimensions are equal to each other.
12378 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12379 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12381 isl_basic_map
*bmap
= NULL
;
12387 if (pos1
>= isl_space_dim(space
, type1
))
12388 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12389 "index out of bounds", goto error
);
12390 if (pos2
>= isl_space_dim(space
, type2
))
12391 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12392 "index out of bounds", goto error
);
12394 if (type1
== type2
&& pos1
== pos2
)
12395 return isl_basic_map_universe(space
);
12397 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12398 i
= isl_basic_map_alloc_equality(bmap
);
12401 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12402 pos1
+= isl_basic_map_offset(bmap
, type1
);
12403 pos2
+= isl_basic_map_offset(bmap
, type2
);
12404 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12405 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12406 bmap
= isl_basic_map_finalize(bmap
);
12407 isl_space_free(space
);
12410 isl_space_free(space
);
12411 isl_basic_map_free(bmap
);
12415 /* Add a constraint imposing that the given two dimensions are equal.
12417 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12418 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12422 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12424 bmap
= isl_basic_map_intersect(bmap
, eq
);
12429 /* Add a constraint imposing that the given two dimensions are equal.
12431 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12432 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12434 isl_basic_map
*bmap
;
12436 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12438 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12443 /* Add a constraint imposing that the given two dimensions have opposite values.
12445 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12446 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12448 isl_basic_map
*bmap
= NULL
;
12454 if (pos1
>= isl_map_dim(map
, type1
))
12455 isl_die(map
->ctx
, isl_error_invalid
,
12456 "index out of bounds", goto error
);
12457 if (pos2
>= isl_map_dim(map
, type2
))
12458 isl_die(map
->ctx
, isl_error_invalid
,
12459 "index out of bounds", goto error
);
12461 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12462 i
= isl_basic_map_alloc_equality(bmap
);
12465 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12466 pos1
+= isl_basic_map_offset(bmap
, type1
);
12467 pos2
+= isl_basic_map_offset(bmap
, type2
);
12468 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12469 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12470 bmap
= isl_basic_map_finalize(bmap
);
12472 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12476 isl_basic_map_free(bmap
);
12481 /* Construct a constraint imposing that the value of the first dimension is
12482 * greater than or equal to that of the second.
12484 static __isl_give isl_constraint
*constraint_order_ge(
12485 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12486 enum isl_dim_type type2
, int pos2
)
12493 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12495 if (pos1
>= isl_constraint_dim(c
, type1
))
12496 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12497 "index out of bounds", return isl_constraint_free(c
));
12498 if (pos2
>= isl_constraint_dim(c
, type2
))
12499 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12500 "index out of bounds", return isl_constraint_free(c
));
12502 if (type1
== type2
&& pos1
== pos2
)
12505 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12506 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12511 /* Add a constraint imposing that the value of the first dimension is
12512 * greater than or equal to that of the second.
12514 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12515 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12520 if (type1
== type2
&& pos1
== pos2
)
12522 space
= isl_basic_map_get_space(bmap
);
12523 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12524 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12529 /* Add a constraint imposing that the value of the first dimension is
12530 * greater than or equal to that of the second.
12532 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12533 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12538 if (type1
== type2
&& pos1
== pos2
)
12540 space
= isl_map_get_space(map
);
12541 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12542 map
= isl_map_add_constraint(map
, c
);
12547 /* Add a constraint imposing that the value of the first dimension is
12548 * less than or equal to that of the second.
12550 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12551 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12553 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12556 /* Construct a basic map where the value of the first dimension is
12557 * greater than that of the second.
12559 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12560 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12562 isl_basic_map
*bmap
= NULL
;
12568 if (pos1
>= isl_space_dim(space
, type1
))
12569 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12570 "index out of bounds", goto error
);
12571 if (pos2
>= isl_space_dim(space
, type2
))
12572 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12573 "index out of bounds", goto error
);
12575 if (type1
== type2
&& pos1
== pos2
)
12576 return isl_basic_map_empty(space
);
12578 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12579 i
= isl_basic_map_alloc_inequality(bmap
);
12581 return isl_basic_map_free(bmap
);
12582 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12583 pos1
+= isl_basic_map_offset(bmap
, type1
);
12584 pos2
+= isl_basic_map_offset(bmap
, type2
);
12585 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12586 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12587 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12588 bmap
= isl_basic_map_finalize(bmap
);
12592 isl_space_free(space
);
12593 isl_basic_map_free(bmap
);
12597 /* Add a constraint imposing that the value of the first dimension is
12598 * greater than that of the second.
12600 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12601 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12605 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12607 bmap
= isl_basic_map_intersect(bmap
, gt
);
12612 /* Add a constraint imposing that the value of the first dimension is
12613 * greater than that of the second.
12615 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12616 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12618 isl_basic_map
*bmap
;
12620 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12622 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12627 /* Add a constraint imposing that the value of the first dimension is
12628 * smaller than that of the second.
12630 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12631 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12633 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12636 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12640 isl_local_space
*ls
;
12645 if (!isl_basic_map_divs_known(bmap
))
12646 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12647 "some divs are unknown", return NULL
);
12649 ls
= isl_basic_map_get_local_space(bmap
);
12650 div
= isl_local_space_get_div(ls
, pos
);
12651 isl_local_space_free(ls
);
12656 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12659 return isl_basic_map_get_div(bset
, pos
);
12662 /* Plug in "subs" for dimension "type", "pos" of "bset".
12664 * Let i be the dimension to replace and let "subs" be of the form
12668 * Any integer division with a non-zero coefficient for i,
12670 * floor((a i + g)/m)
12674 * floor((a f + d g)/(m d))
12676 * Constraints of the form
12684 * We currently require that "subs" is an integral expression.
12685 * Handling rational expressions may require us to add stride constraints
12686 * as we do in isl_basic_set_preimage_multi_aff.
12688 __isl_give isl_basic_set
*isl_basic_set_substitute(
12689 __isl_take isl_basic_set
*bset
,
12690 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12696 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12699 bset
= isl_basic_set_cow(bset
);
12700 if (!bset
|| !subs
)
12703 ctx
= isl_basic_set_get_ctx(bset
);
12704 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12705 isl_die(ctx
, isl_error_invalid
,
12706 "spaces don't match", goto error
);
12707 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12708 isl_die(ctx
, isl_error_unsupported
,
12709 "cannot handle divs yet", goto error
);
12710 if (!isl_int_is_one(subs
->v
->el
[0]))
12711 isl_die(ctx
, isl_error_invalid
,
12712 "can only substitute integer expressions", goto error
);
12714 pos
+= isl_basic_set_offset(bset
, type
);
12718 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12719 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12721 isl_int_set(v
, bset
->eq
[i
][pos
]);
12722 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12723 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12724 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12727 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12728 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12730 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12731 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12732 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12733 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12736 for (i
= 0; i
< bset
->n_div
; ++i
) {
12737 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12739 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12740 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12741 isl_seq_combine(bset
->div
[i
] + 1,
12742 subs
->v
->el
[0], bset
->div
[i
] + 1,
12743 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12744 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12749 bset
= isl_basic_set_simplify(bset
);
12750 return isl_basic_set_finalize(bset
);
12752 isl_basic_set_free(bset
);
12756 /* Plug in "subs" for dimension "type", "pos" of "set".
12758 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12759 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12763 if (set
&& isl_set_plain_is_empty(set
))
12766 set
= isl_set_cow(set
);
12770 for (i
= set
->n
- 1; i
>= 0; --i
) {
12771 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12772 if (remove_if_empty(set
, i
) < 0)
12782 /* Check if the range of "ma" is compatible with the domain or range
12783 * (depending on "type") of "bmap".
12785 static isl_stat
check_basic_map_compatible_range_multi_aff(
12786 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12787 __isl_keep isl_multi_aff
*ma
)
12790 isl_space
*ma_space
;
12792 ma_space
= isl_multi_aff_get_space(ma
);
12794 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12798 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12799 "parameters don't match", goto error
);
12800 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12804 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12805 "spaces don't match", goto error
);
12807 isl_space_free(ma_space
);
12808 return isl_stat_ok
;
12810 isl_space_free(ma_space
);
12811 return isl_stat_error
;
12814 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12815 * coefficients before the transformed range of dimensions,
12816 * the "n_after" coefficients after the transformed range of dimensions
12817 * and the coefficients of the other divs in "bmap".
12819 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12820 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12825 isl_local_space
*ls
;
12830 ls
= isl_aff_get_domain_local_space(ma
->u
.p
[0]);
12834 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12835 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12836 for (i
= 0; i
< n_div
; ++i
) {
12837 int o_bmap
= 0, o_ls
= 0;
12839 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12840 o_bmap
+= 1 + 1 + n_param
;
12841 o_ls
+= 1 + 1 + n_param
;
12842 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12843 o_bmap
+= n_before
;
12844 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12845 ls
->div
->row
[i
] + o_ls
, n_set
);
12848 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12850 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12851 ls
->div
->row
[i
] + o_ls
, n_div
);
12854 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12855 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12859 isl_local_space_free(ls
);
12862 isl_local_space_free(ls
);
12866 /* How many stride constraints does "ma" enforce?
12867 * That is, how many of the affine expressions have a denominator
12868 * different from one?
12870 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12875 for (i
= 0; i
< ma
->n
; ++i
)
12876 if (!isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12882 /* For each affine expression in ma of the form
12884 * x_i = (f_i y + h_i)/m_i
12886 * with m_i different from one, add a constraint to "bmap"
12889 * f_i y + h_i = m_i alpha_i
12891 * with alpha_i an additional existentially quantified variable.
12893 * The input variables of "ma" correspond to a subset of the variables
12894 * of "bmap". There are "n_before" variables in "bmap" before this
12895 * subset and "n_after" variables after this subset.
12896 * The integer divisions of the affine expressions in "ma" are assumed
12897 * to have been aligned. There are "n_div_ma" of them and
12898 * they appear first in "bmap", straight after the "n_after" variables.
12900 static __isl_give isl_basic_map
*add_ma_strides(
12901 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12902 int n_before
, int n_after
, int n_div_ma
)
12910 total
= isl_basic_map_total_dim(bmap
);
12911 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12912 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12913 for (i
= 0; i
< ma
->n
; ++i
) {
12914 int o_bmap
= 0, o_ma
= 1;
12916 if (isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12918 div
= isl_basic_map_alloc_div(bmap
);
12919 k
= isl_basic_map_alloc_equality(bmap
);
12920 if (div
< 0 || k
< 0)
12922 isl_int_set_si(bmap
->div
[div
][0], 0);
12923 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12924 ma
->u
.p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12925 o_bmap
+= 1 + n_param
;
12926 o_ma
+= 1 + n_param
;
12927 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12928 o_bmap
+= n_before
;
12929 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12930 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_in
);
12933 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12935 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12936 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12937 o_bmap
+= n_div_ma
;
12939 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12940 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->u
.p
[i
]->v
->el
[0]);
12946 isl_basic_map_free(bmap
);
12950 /* Replace the domain or range space (depending on "type) of "space" by "set".
12952 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12953 enum isl_dim_type type
, __isl_take isl_space
*set
)
12955 if (type
== isl_dim_in
) {
12956 space
= isl_space_range(space
);
12957 space
= isl_space_map_from_domain_and_range(set
, space
);
12959 space
= isl_space_domain(space
);
12960 space
= isl_space_map_from_domain_and_range(space
, set
);
12966 /* Compute the preimage of the domain or range (depending on "type")
12967 * of "bmap" under the function represented by "ma".
12968 * In other words, plug in "ma" in the domain or range of "bmap".
12969 * The result is a basic map that lives in the same space as "bmap"
12970 * except that the domain or range has been replaced by
12971 * the domain space of "ma".
12973 * If bmap is represented by
12975 * A(p) + S u + B x + T v + C(divs) >= 0,
12977 * where u and x are input and output dimensions if type == isl_dim_out
12978 * while x and v are input and output dimensions if type == isl_dim_in,
12979 * and ma is represented by
12981 * x = D(p) + F(y) + G(divs')
12983 * then the result is
12985 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12987 * The divs in the input set are similarly adjusted.
12990 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12994 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12995 * B_i G(divs') + c_i(divs))/n_i)
12997 * If bmap is not a rational map and if F(y) involves any denominators
12999 * x_i = (f_i y + h_i)/m_i
13001 * then additional constraints are added to ensure that we only
13002 * map back integer points. That is we enforce
13004 * f_i y + h_i = m_i alpha_i
13006 * with alpha_i an additional existentially quantified variable.
13008 * We first copy over the divs from "ma".
13009 * Then we add the modified constraints and divs from "bmap".
13010 * Finally, we add the stride constraints, if needed.
13012 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
13013 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
13014 __isl_take isl_multi_aff
*ma
)
13018 isl_basic_map
*res
= NULL
;
13019 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
13020 isl_int f
, c1
, c2
, g
;
13029 ma
= isl_multi_aff_align_divs(ma
);
13032 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
13035 if (type
== isl_dim_in
) {
13037 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
13039 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
13042 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
13043 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
13045 space
= isl_multi_aff_get_domain_space(ma
);
13046 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
13047 rational
= isl_basic_map_is_rational(bmap
);
13048 strides
= rational
? 0 : multi_aff_strides(ma
);
13049 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
13050 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
13052 res
= isl_basic_map_set_rational(res
);
13054 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
13055 if (isl_basic_map_alloc_div(res
) < 0)
13058 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
13061 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
13062 k
= isl_basic_map_alloc_equality(res
);
13065 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
13066 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13069 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
13070 k
= isl_basic_map_alloc_inequality(res
);
13073 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
13074 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13077 for (i
= 0; i
< bmap
->n_div
; ++i
) {
13078 if (isl_int_is_zero(bmap
->div
[i
][0])) {
13079 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
13082 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
13083 n_before
, n_after
, n_div_ma
, n_div_bmap
,
13088 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
13094 isl_basic_map_free(bmap
);
13095 isl_multi_aff_free(ma
);
13096 res
= isl_basic_map_simplify(res
);
13097 return isl_basic_map_finalize(res
);
13103 isl_basic_map_free(bmap
);
13104 isl_multi_aff_free(ma
);
13105 isl_basic_map_free(res
);
13109 /* Compute the preimage of "bset" under the function represented by "ma".
13110 * In other words, plug in "ma" in "bset". The result is a basic set
13111 * that lives in the domain space of "ma".
13113 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
13114 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
13116 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
13119 /* Compute the preimage of the domain of "bmap" under the function
13120 * represented by "ma".
13121 * In other words, plug in "ma" in the domain of "bmap".
13122 * The result is a basic map that lives in the same space as "bmap"
13123 * except that the domain has been replaced by the domain space of "ma".
13125 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
13126 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13128 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
13131 /* Compute the preimage of the range of "bmap" under the function
13132 * represented by "ma".
13133 * In other words, plug in "ma" in the range of "bmap".
13134 * The result is a basic map that lives in the same space as "bmap"
13135 * except that the range has been replaced by the domain space of "ma".
13137 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
13138 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13140 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
13143 /* Check if the range of "ma" is compatible with the domain or range
13144 * (depending on "type") of "map".
13145 * Return isl_stat_error if anything is wrong.
13147 static isl_stat
check_map_compatible_range_multi_aff(
13148 __isl_keep isl_map
*map
, enum isl_dim_type type
,
13149 __isl_keep isl_multi_aff
*ma
)
13152 isl_space
*ma_space
;
13154 ma_space
= isl_multi_aff_get_space(ma
);
13155 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
13156 isl_space_free(ma_space
);
13158 return isl_stat_error
;
13160 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
13161 "spaces don't match", return isl_stat_error
);
13162 return isl_stat_ok
;
13165 /* Compute the preimage of the domain or range (depending on "type")
13166 * of "map" under the function represented by "ma".
13167 * In other words, plug in "ma" in the domain or range of "map".
13168 * The result is a map that lives in the same space as "map"
13169 * except that the domain or range has been replaced by
13170 * the domain space of "ma".
13172 * The parameters are assumed to have been aligned.
13174 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13175 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13180 map
= isl_map_cow(map
);
13181 ma
= isl_multi_aff_align_divs(ma
);
13184 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13187 for (i
= 0; i
< map
->n
; ++i
) {
13188 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13189 isl_multi_aff_copy(ma
));
13194 space
= isl_multi_aff_get_domain_space(ma
);
13195 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13197 isl_space_free(map
->dim
);
13202 isl_multi_aff_free(ma
);
13204 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13205 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13208 isl_multi_aff_free(ma
);
13213 /* Compute the preimage of the domain or range (depending on "type")
13214 * of "map" under the function represented by "ma".
13215 * In other words, plug in "ma" in the domain or range of "map".
13216 * The result is a map that lives in the same space as "map"
13217 * except that the domain or range has been replaced by
13218 * the domain space of "ma".
13220 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13221 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13228 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13232 return map_preimage_multi_aff(map
, type
, ma
);
13234 if (isl_map_check_named_params(map
) < 0)
13236 if (!isl_space_has_named_params(ma
->space
))
13237 isl_die(map
->ctx
, isl_error_invalid
,
13238 "unaligned unnamed parameters", goto error
);
13239 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13240 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13242 return map_preimage_multi_aff(map
, type
, ma
);
13244 isl_multi_aff_free(ma
);
13245 return isl_map_free(map
);
13248 /* Compute the preimage of "set" under the function represented by "ma".
13249 * In other words, plug in "ma" in "set". The result is a set
13250 * that lives in the domain space of "ma".
13252 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13253 __isl_take isl_multi_aff
*ma
)
13255 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13258 /* Compute the preimage of the domain of "map" under the function
13259 * represented by "ma".
13260 * In other words, plug in "ma" in the domain of "map".
13261 * The result is a map that lives in the same space as "map"
13262 * except that the domain has been replaced by the domain space of "ma".
13264 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13265 __isl_take isl_multi_aff
*ma
)
13267 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13270 /* Compute the preimage of the range of "map" under the function
13271 * represented by "ma".
13272 * In other words, plug in "ma" in the range of "map".
13273 * The result is a map that lives in the same space as "map"
13274 * except that the range has been replaced by the domain space of "ma".
13276 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13277 __isl_take isl_multi_aff
*ma
)
13279 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13282 /* Compute the preimage of "map" under the function represented by "pma".
13283 * In other words, plug in "pma" in the domain or range of "map".
13284 * The result is a map that lives in the same space as "map",
13285 * except that the space of type "type" has been replaced by
13286 * the domain space of "pma".
13288 * The parameters of "map" and "pma" are assumed to have been aligned.
13290 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13291 __isl_take isl_map
*map
, enum isl_dim_type type
,
13292 __isl_take isl_pw_multi_aff
*pma
)
13301 isl_pw_multi_aff_free(pma
);
13302 res
= isl_map_empty(isl_map_get_space(map
));
13307 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13308 isl_multi_aff_copy(pma
->p
[0].maff
));
13309 if (type
== isl_dim_in
)
13310 res
= isl_map_intersect_domain(res
,
13311 isl_map_copy(pma
->p
[0].set
));
13313 res
= isl_map_intersect_range(res
,
13314 isl_map_copy(pma
->p
[0].set
));
13316 for (i
= 1; i
< pma
->n
; ++i
) {
13319 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13320 isl_multi_aff_copy(pma
->p
[i
].maff
));
13321 if (type
== isl_dim_in
)
13322 res_i
= isl_map_intersect_domain(res_i
,
13323 isl_map_copy(pma
->p
[i
].set
));
13325 res_i
= isl_map_intersect_range(res_i
,
13326 isl_map_copy(pma
->p
[i
].set
));
13327 res
= isl_map_union(res
, res_i
);
13330 isl_pw_multi_aff_free(pma
);
13334 isl_pw_multi_aff_free(pma
);
13339 /* Compute the preimage of "map" under the function represented by "pma".
13340 * In other words, plug in "pma" in the domain or range of "map".
13341 * The result is a map that lives in the same space as "map",
13342 * except that the space of type "type" has been replaced by
13343 * the domain space of "pma".
13345 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13346 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13353 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13357 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13359 if (isl_map_check_named_params(map
) < 0)
13361 if (!isl_space_has_named_params(pma
->dim
))
13362 isl_die(map
->ctx
, isl_error_invalid
,
13363 "unaligned unnamed parameters", goto error
);
13364 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13365 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13367 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13369 isl_pw_multi_aff_free(pma
);
13370 return isl_map_free(map
);
13373 /* Compute the preimage of "set" under the function represented by "pma".
13374 * In other words, plug in "pma" in "set". The result is a set
13375 * that lives in the domain space of "pma".
13377 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13378 __isl_take isl_pw_multi_aff
*pma
)
13380 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13383 /* Compute the preimage of the domain of "map" under the function
13384 * represented by "pma".
13385 * In other words, plug in "pma" in the domain of "map".
13386 * The result is a map that lives in the same space as "map",
13387 * except that domain space has been replaced by the domain space of "pma".
13389 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13390 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13392 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13395 /* Compute the preimage of the range of "map" under the function
13396 * represented by "pma".
13397 * In other words, plug in "pma" in the range of "map".
13398 * The result is a map that lives in the same space as "map",
13399 * except that range space has been replaced by the domain space of "pma".
13401 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13402 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13404 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13407 /* Compute the preimage of "map" under the function represented by "mpa".
13408 * In other words, plug in "mpa" in the domain or range of "map".
13409 * The result is a map that lives in the same space as "map",
13410 * except that the space of type "type" has been replaced by
13411 * the domain space of "mpa".
13413 * If the map does not involve any constraints that refer to the
13414 * dimensions of the substituted space, then the only possible
13415 * effect of "mpa" on the map is to map the space to a different space.
13416 * We create a separate isl_multi_aff to effectuate this change
13417 * in order to avoid spurious splitting of the map along the pieces
13419 * If "mpa" has a non-trivial explicit domain, however,
13420 * then the full substitution should be performed.
13422 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13423 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13427 isl_pw_multi_aff
*pma
;
13432 n
= isl_map_dim(map
, type
);
13433 full
= isl_map_involves_dims(map
, type
, 0, n
);
13434 if (full
>= 0 && !full
)
13435 full
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
13442 space
= isl_multi_pw_aff_get_space(mpa
);
13443 isl_multi_pw_aff_free(mpa
);
13444 ma
= isl_multi_aff_zero(space
);
13445 return isl_map_preimage_multi_aff(map
, type
, ma
);
13448 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13449 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13452 isl_multi_pw_aff_free(mpa
);
13456 /* Compute the preimage of "map" under the function represented by "mpa".
13457 * In other words, plug in "mpa" in the domain "map".
13458 * The result is a map that lives in the same space as "map",
13459 * except that domain space has been replaced by the domain space of "mpa".
13461 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13462 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13464 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13467 /* Compute the preimage of "set" by the function represented by "mpa".
13468 * In other words, plug in "mpa" in "set".
13470 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13471 __isl_take isl_multi_pw_aff
*mpa
)
13473 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13476 /* Return a copy of the equality constraints of "bset" as a matrix.
13478 __isl_give isl_mat
*isl_basic_set_extract_equalities(
13479 __isl_keep isl_basic_set
*bset
)
13487 ctx
= isl_basic_set_get_ctx(bset
);
13488 total
= 1 + isl_basic_set_dim(bset
, isl_dim_all
);
13489 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, total
);
13492 /* Are the "n" "coefficients" starting at "first" of the integer division
13493 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13495 * The "coefficient" at position 0 is the denominator.
13496 * The "coefficient" at position 1 is the constant term.
13498 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13499 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13500 unsigned first
, unsigned n
)
13502 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13503 return isl_bool_error
;
13504 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13505 return isl_bool_error
;
13506 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13507 bmap2
->div
[pos2
] + first
, n
);
13510 /* Are the integer division expressions at position "pos1" in "bmap1" and
13511 * "pos2" in "bmap2" equal to each other, except that the constant terms
13514 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13515 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13516 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13521 if (!bmap1
|| !bmap2
)
13522 return isl_bool_error
;
13523 total
= isl_basic_map_total_dim(bmap1
);
13524 if (total
!= isl_basic_map_total_dim(bmap2
))
13525 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13526 "incomparable div expressions", return isl_bool_error
);
13527 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13529 if (equal
< 0 || !equal
)
13531 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13533 if (equal
< 0 || equal
)
13534 return isl_bool_not(equal
);
13535 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13539 /* Replace the numerator of the constant term of the integer division
13540 * expression at position "div" in "bmap" by "value".
13541 * The caller guarantees that this does not change the meaning
13544 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13545 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13547 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13548 return isl_basic_map_free(bmap
);
13550 isl_int_set_si(bmap
->div
[div
][1], value
);
13555 /* Is the point "inner" internal to inequality constraint "ineq"
13557 * The point is considered to be internal to the inequality constraint,
13558 * if it strictly lies on the positive side of the inequality constraint,
13559 * or if it lies on the constraint and the constraint is lexico-positive.
13561 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13562 __isl_keep isl_basic_set
*bset
, int ineq
)
13568 if (!inner
|| !bset
)
13569 return isl_bool_error
;
13571 ctx
= isl_basic_set_get_ctx(bset
);
13572 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13573 &ctx
->normalize_gcd
);
13574 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13575 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13577 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13578 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13579 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13582 /* Tighten the inequality constraints of "bset" that are outward with respect
13583 * to the point "vec".
13584 * That is, tighten the constraints that are not satisfied by "vec".
13586 * "vec" is a point internal to some superset S of "bset" that is used
13587 * to make the subsets of S disjoint, by tightening one half of the constraints
13588 * that separate two subsets. In particular, the constraints of S
13589 * are all satisfied by "vec" and should not be tightened.
13590 * Of the internal constraints, those that have "vec" on the outside
13591 * are tightened. The shared facet is included in the adjacent subset
13592 * with the opposite constraint.
13593 * For constraints that saturate "vec", this criterion cannot be used
13594 * to determine which of the two sides should be tightened.
13595 * Instead, the sign of the first non-zero coefficient is used
13596 * to make this choice. Note that this second criterion is never used
13597 * on the constraints of S since "vec" is interior to "S".
13599 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13600 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13604 bset
= isl_basic_set_cow(bset
);
13607 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13610 internal
= is_internal(vec
, bset
, j
);
13612 return isl_basic_set_free(bset
);
13615 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13621 /* Replace the variables x of type "type" starting at "first" in "bmap"
13622 * by x' with x = M x' with M the matrix trans.
13623 * That is, replace the corresponding coefficients c by c M.
13625 * The transformation matrix should be a square matrix.
13627 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13628 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13629 __isl_take isl_mat
*trans
)
13633 bmap
= isl_basic_map_cow(bmap
);
13634 if (!bmap
|| !trans
)
13637 if (trans
->n_row
!= trans
->n_col
)
13638 isl_die(trans
->ctx
, isl_error_invalid
,
13639 "expecting square transformation matrix", goto error
);
13640 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13641 isl_die(trans
->ctx
, isl_error_invalid
,
13642 "oversized transformation matrix", goto error
);
13644 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13646 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13647 isl_mat_copy(trans
)) < 0)
13649 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13650 isl_mat_copy(trans
)) < 0)
13652 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13653 isl_mat_copy(trans
)) < 0)
13656 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
13657 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13659 isl_mat_free(trans
);
13662 isl_mat_free(trans
);
13663 isl_basic_map_free(bmap
);
13667 /* Replace the variables x of type "type" starting at "first" in "bset"
13668 * by x' with x = M x' with M the matrix trans.
13669 * That is, replace the corresponding coefficients c by c M.
13671 * The transformation matrix should be a square matrix.
13673 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13674 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13675 __isl_take isl_mat
*trans
)
13677 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);