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 "bmap" has only named parameters, reporting an error
1355 static isl_stat
isl_basic_map_check_named_params(__isl_keep isl_basic_map
*bmap
)
1357 return isl_space_check_named_params(isl_basic_map_peek_space(bmap
));
1360 /* Check that "bmap1" and "bmap2" have the same parameters,
1361 * reporting an error if they do not.
1363 static isl_stat
isl_basic_map_check_equal_params(
1364 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1368 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1370 return isl_stat_error
;
1372 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1373 "parameters don't match", return isl_stat_error
);
1377 __isl_give isl_map
*isl_map_align_params_map_map_and(
1378 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1379 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1380 __isl_take isl_map
*map2
))
1384 if (isl_map_has_equal_params(map1
, map2
))
1385 return fn(map1
, map2
);
1386 if (isl_map_check_named_params(map1
) < 0)
1388 if (isl_map_check_named_params(map2
) < 0)
1390 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1391 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1392 return fn(map1
, map2
);
1399 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1400 __isl_keep isl_map
*map2
,
1401 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1406 return isl_bool_error
;
1407 if (isl_map_has_equal_params(map1
, map2
))
1408 return fn(map1
, map2
);
1409 if (isl_map_check_named_params(map1
) < 0)
1410 return isl_bool_error
;
1411 if (isl_map_check_named_params(map2
) < 0)
1412 return isl_bool_error
;
1413 map1
= isl_map_copy(map1
);
1414 map2
= isl_map_copy(map2
);
1415 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1416 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1423 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1425 struct isl_ctx
*ctx
;
1429 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1430 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1432 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1433 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1434 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1435 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1436 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1437 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1439 int j
= isl_basic_map_alloc_inequality(bmap
);
1443 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1444 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1451 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1452 bmap
->extra
- bmap
->n_div
);
1453 return bmap
->n_eq
++;
1456 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1458 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1461 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1465 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1470 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1472 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1475 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1480 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1482 if (pos
!= bmap
->n_eq
- 1) {
1484 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1485 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1491 /* Turn inequality "pos" of "bmap" into an equality.
1493 * In particular, we move the inequality in front of the equalities
1494 * and move the last inequality in the position of the moved inequality.
1495 * Note that isl_tab_make_equalities_explicit depends on this particular
1496 * change in the ordering of the constraints.
1498 void isl_basic_map_inequality_to_equality(
1499 struct isl_basic_map
*bmap
, unsigned pos
)
1503 t
= bmap
->ineq
[pos
];
1504 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1505 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1510 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1511 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1512 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1513 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1516 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1518 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1521 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1523 struct isl_ctx
*ctx
;
1527 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1528 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1529 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1530 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1531 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1532 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1533 1 + isl_basic_map_total_dim(bmap
),
1534 bmap
->extra
- bmap
->n_div
);
1535 return bmap
->n_ineq
++;
1538 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1540 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1543 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1547 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1552 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1554 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1557 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1562 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1564 if (pos
!= bmap
->n_ineq
- 1) {
1565 t
= bmap
->ineq
[pos
];
1566 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1567 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1568 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1574 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1576 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1579 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1584 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1587 k
= isl_basic_map_alloc_equality(bmap
);
1590 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1593 isl_basic_map_free(bmap
);
1597 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1600 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1603 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1608 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1611 k
= isl_basic_map_alloc_inequality(bmap
);
1614 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1617 isl_basic_map_free(bmap
);
1621 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1624 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1627 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1631 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1632 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1633 1 + 1 + isl_basic_map_total_dim(bmap
),
1634 bmap
->extra
- bmap
->n_div
);
1635 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1636 return bmap
->n_div
++;
1639 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1641 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1644 /* Check that there are "n" dimensions of type "type" starting at "first"
1647 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1648 enum isl_dim_type type
, unsigned first
, unsigned n
)
1653 return isl_stat_error
;
1654 dim
= isl_basic_map_dim(bmap
, type
);
1655 if (first
+ n
> dim
|| first
+ n
< first
)
1656 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1657 "position or range out of bounds",
1658 return isl_stat_error
);
1662 /* Insert an extra integer division, prescribed by "div", to "bmap"
1663 * at (integer division) position "pos".
1665 * The integer division is first added at the end and then moved
1666 * into the right position.
1668 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1669 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1673 bmap
= isl_basic_map_cow(bmap
);
1675 return isl_basic_map_free(bmap
);
1677 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1678 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1679 "unexpected size", return isl_basic_map_free(bmap
));
1680 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1681 return isl_basic_map_free(bmap
);
1683 bmap
= isl_basic_map_extend_space(bmap
,
1684 isl_basic_map_get_space(bmap
), 1, 0, 2);
1685 k
= isl_basic_map_alloc_div(bmap
);
1687 return isl_basic_map_free(bmap
);
1688 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1689 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1691 for (i
= k
; i
> pos
; --i
)
1692 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1697 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1700 return isl_stat_error
;
1701 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1706 /* Copy constraint from src to dst, putting the vars of src at offset
1707 * dim_off in dst and the divs of src at offset div_off in dst.
1708 * If both sets are actually map, then dim_off applies to the input
1711 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1712 struct isl_basic_map
*src_map
, isl_int
*src
,
1713 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1715 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1716 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1717 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1718 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1719 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1720 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1721 isl_int_set(dst
[0], src
[0]);
1722 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1723 if (dst_nparam
> src_nparam
)
1724 isl_seq_clr(dst
+1+src_nparam
,
1725 dst_nparam
- src_nparam
);
1726 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1727 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1729 isl_min(dst_in
-in_off
, src_in
));
1730 if (dst_in
-in_off
> src_in
)
1731 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1732 dst_in
- in_off
- src_in
);
1733 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1734 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1735 src
+1+src_nparam
+src_in
,
1736 isl_min(dst_out
-out_off
, src_out
));
1737 if (dst_out
-out_off
> src_out
)
1738 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1739 dst_out
- out_off
- src_out
);
1740 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1741 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1742 src
+1+src_nparam
+src_in
+src_out
,
1743 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1744 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1745 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1746 div_off
+src_map
->n_div
,
1747 dst_map
->n_div
- div_off
- src_map
->n_div
);
1750 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1751 struct isl_basic_map
*src_map
, isl_int
*src
,
1752 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1754 isl_int_set(dst
[0], src
[0]);
1755 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1758 static __isl_give isl_basic_map
*add_constraints(
1759 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1760 unsigned i_pos
, unsigned o_pos
)
1765 if (!bmap1
|| !bmap2
)
1768 div_off
= bmap1
->n_div
;
1770 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1771 int i1
= isl_basic_map_alloc_equality(bmap1
);
1774 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1775 i_pos
, o_pos
, div_off
);
1778 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1779 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1782 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1783 i_pos
, o_pos
, div_off
);
1786 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1787 int i1
= isl_basic_map_alloc_div(bmap1
);
1790 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1791 i_pos
, o_pos
, div_off
);
1794 isl_basic_map_free(bmap2
);
1799 isl_basic_map_free(bmap1
);
1800 isl_basic_map_free(bmap2
);
1804 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1805 struct isl_basic_set
*bset2
, unsigned pos
)
1807 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1808 bset_to_bmap(bset2
), 0, pos
));
1811 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1812 __isl_take isl_basic_map
*base
, __isl_take isl_space
*dim
,
1813 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1815 struct isl_basic_map
*ext
;
1825 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1826 base
->extra
>= base
->n_div
+ extra
;
1828 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1829 room_for_ineq(base
, n_ineq
)) {
1830 isl_space_free(dim
);
1834 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1835 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1836 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1837 extra
+= base
->extra
;
1839 n_ineq
+= base
->n_ineq
;
1841 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1847 ext
->sample
= isl_vec_copy(base
->sample
);
1848 flags
= base
->flags
;
1849 ext
= add_constraints(ext
, base
, 0, 0);
1852 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1858 isl_space_free(dim
);
1859 isl_basic_map_free(base
);
1863 __isl_give isl_basic_set
*isl_basic_set_extend_space(
1864 __isl_take isl_basic_set
*base
,
1865 __isl_take isl_space
*dim
, unsigned extra
,
1866 unsigned n_eq
, unsigned n_ineq
)
1868 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1869 dim
, extra
, n_eq
, n_ineq
));
1872 struct isl_basic_map
*isl_basic_map_extend_constraints(
1873 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1877 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1881 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1882 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1883 unsigned n_eq
, unsigned n_ineq
)
1885 struct isl_basic_map
*bmap
;
1890 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1894 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1897 isl_basic_map_free(base
);
1901 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1902 unsigned nparam
, unsigned dim
, unsigned extra
,
1903 unsigned n_eq
, unsigned n_ineq
)
1905 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1906 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1909 struct isl_basic_set
*isl_basic_set_extend_constraints(
1910 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1912 isl_basic_map
*bmap
= bset_to_bmap(base
);
1913 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1914 return bset_from_bmap(bmap
);
1917 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1919 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1922 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1927 if (bmap
->ref
> 1) {
1929 bmap
= isl_basic_map_dup(bmap
);
1932 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1933 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1938 /* Clear all cached information in "map", either because it is about
1939 * to be modified or because it is being freed.
1940 * Always return the same pointer that is passed in.
1941 * This is needed for the use in isl_map_free.
1943 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1945 isl_basic_map_free(map
->cached_simple_hull
[0]);
1946 isl_basic_map_free(map
->cached_simple_hull
[1]);
1947 map
->cached_simple_hull
[0] = NULL
;
1948 map
->cached_simple_hull
[1] = NULL
;
1952 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1954 return isl_map_cow(set
);
1957 /* Return an isl_map that is equal to "map" and that has only
1958 * a single reference.
1960 * If the original input already has only one reference, then
1961 * simply return it, but clear all cached information, since
1962 * it may be rendered invalid by the operations that will be
1963 * performed on the result.
1965 * Otherwise, create a duplicate (without any cached information).
1967 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
1973 return clear_caches(map
);
1975 return isl_map_dup(map
);
1978 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1979 unsigned a_len
, unsigned b_len
)
1981 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1982 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1983 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1986 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1987 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1995 isl_assert(bmap
->ctx
,
1996 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1998 if (n1
== 0 || n2
== 0)
2001 bmap
= isl_basic_map_cow(bmap
);
2005 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
2006 if (isl_blk_is_error(blk
))
2009 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2011 bmap
->eq
[i
] + pos
, n1
, n2
);
2013 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2015 bmap
->ineq
[i
] + pos
, n1
, n2
);
2017 for (i
= 0; i
< bmap
->n_div
; ++i
)
2019 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2021 isl_blk_free(bmap
->ctx
, blk
);
2023 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
2024 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2025 return isl_basic_map_finalize(bmap
);
2027 isl_basic_map_free(bmap
);
2031 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2032 __isl_take isl_basic_map
*bmap
)
2038 total
= isl_basic_map_total_dim(bmap
);
2039 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2040 return isl_basic_map_free(bmap
);
2041 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2043 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2045 i
= isl_basic_map_alloc_equality(bmap
);
2049 isl_int_set_si(bmap
->eq
[i
][0], 1);
2050 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2051 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2052 isl_vec_free(bmap
->sample
);
2053 bmap
->sample
= NULL
;
2054 return isl_basic_map_finalize(bmap
);
2056 isl_basic_map_free(bmap
);
2060 __isl_give isl_basic_set
*isl_basic_set_set_to_empty(
2061 __isl_take isl_basic_set
*bset
)
2063 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2066 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2067 __isl_take isl_basic_map
*bmap
)
2072 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2075 bmap
= isl_basic_map_cow(bmap
);
2079 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2081 return isl_basic_map_finalize(bmap
);
2084 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2085 __isl_take isl_basic_set
*bset
)
2087 return isl_basic_map_set_rational(bset
);
2090 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2091 __isl_take isl_basic_set
*bset
)
2096 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2099 bset
= isl_basic_set_cow(bset
);
2103 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2105 return isl_basic_set_finalize(bset
);
2108 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2112 map
= isl_map_cow(map
);
2115 for (i
= 0; i
< map
->n
; ++i
) {
2116 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2126 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2128 return isl_map_set_rational(set
);
2131 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2134 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2136 isl_int
*t
= bmap
->div
[a
];
2137 bmap
->div
[a
] = bmap
->div
[b
];
2141 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2142 * div definitions accordingly.
2144 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
2147 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2149 swap_div(bmap
, a
, b
);
2151 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2152 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2154 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2155 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2157 for (i
= 0; i
< bmap
->n_div
; ++i
)
2158 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2159 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2162 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
2163 * div definitions accordingly.
2165 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
2167 isl_basic_map_swap_div(bset
, a
, b
);
2170 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2172 isl_seq_cpy(c
, c
+ n
, rem
);
2173 isl_seq_clr(c
+ rem
, n
);
2176 /* Drop n dimensions starting at first.
2178 * In principle, this frees up some extra variables as the number
2179 * of columns remains constant, but we would have to extend
2180 * the div array too as the number of rows in this array is assumed
2181 * to be equal to extra.
2183 __isl_give isl_basic_set
*isl_basic_set_drop_dims(
2184 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2186 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2189 /* Move "n" divs starting at "first" to the end of the list of divs.
2191 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2192 unsigned first
, unsigned n
)
2197 if (first
+ n
== bmap
->n_div
)
2200 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2203 for (i
= 0; i
< n
; ++i
)
2204 div
[i
] = bmap
->div
[first
+ i
];
2205 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2206 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2207 for (i
= 0; i
< n
; ++i
)
2208 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2212 isl_basic_map_free(bmap
);
2216 /* Check that there are "n" dimensions of type "type" starting at "first"
2219 static isl_stat
isl_map_check_range(__isl_keep isl_map
*map
,
2220 enum isl_dim_type type
, unsigned first
, unsigned n
)
2223 return isl_stat_error
;
2224 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2225 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2226 "position or range out of bounds",
2227 return isl_stat_error
);
2231 /* Drop "n" dimensions of type "type" starting at "first".
2233 * In principle, this frees up some extra variables as the number
2234 * of columns remains constant, but we would have to extend
2235 * the div array too as the number of rows in this array is assumed
2236 * to be equal to extra.
2238 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2239 enum isl_dim_type type
, unsigned first
, unsigned n
)
2249 dim
= isl_basic_map_dim(bmap
, type
);
2250 isl_assert(bmap
->ctx
, first
+ n
<= dim
, goto error
);
2252 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2255 bmap
= isl_basic_map_cow(bmap
);
2259 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2260 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2261 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2262 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2264 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2265 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2267 for (i
= 0; i
< bmap
->n_div
; ++i
)
2268 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2270 if (type
== isl_dim_div
) {
2271 bmap
= move_divs_last(bmap
, first
, n
);
2274 if (isl_basic_map_free_div(bmap
, n
) < 0)
2275 return isl_basic_map_free(bmap
);
2277 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2281 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2282 bmap
= isl_basic_map_simplify(bmap
);
2283 return isl_basic_map_finalize(bmap
);
2285 isl_basic_map_free(bmap
);
2289 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2290 enum isl_dim_type type
, unsigned first
, unsigned n
)
2292 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2296 /* No longer consider "map" to be normalized.
2298 static __isl_give isl_map
*isl_map_unmark_normalized(__isl_take isl_map
*map
)
2302 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2306 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2307 enum isl_dim_type type
, unsigned first
, unsigned n
)
2311 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2312 return isl_map_free(map
);
2314 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2316 map
= isl_map_cow(map
);
2319 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2323 for (i
= 0; i
< map
->n
; ++i
) {
2324 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2328 map
= isl_map_unmark_normalized(map
);
2336 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2337 enum isl_dim_type type
, unsigned first
, unsigned n
)
2339 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2343 * We don't cow, as the div is assumed to be redundant.
2345 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2346 __isl_take isl_basic_map
*bmap
, unsigned div
)
2354 pos
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + div
;
2356 isl_assert(bmap
->ctx
, div
< bmap
->n_div
, goto error
);
2358 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2359 constraint_drop_vars(bmap
->eq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2361 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2362 if (!isl_int_is_zero(bmap
->ineq
[i
][pos
])) {
2363 isl_basic_map_drop_inequality(bmap
, i
);
2367 constraint_drop_vars(bmap
->ineq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2370 for (i
= 0; i
< bmap
->n_div
; ++i
)
2371 constraint_drop_vars(bmap
->div
[i
]+1+pos
, 1, bmap
->extra
-div
-1);
2373 if (div
!= bmap
->n_div
- 1) {
2375 isl_int
*t
= bmap
->div
[div
];
2377 for (j
= div
; j
< bmap
->n_div
- 1; ++j
)
2378 bmap
->div
[j
] = bmap
->div
[j
+1];
2380 bmap
->div
[bmap
->n_div
- 1] = t
;
2382 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2383 if (isl_basic_map_free_div(bmap
, 1) < 0)
2384 return isl_basic_map_free(bmap
);
2388 isl_basic_map_free(bmap
);
2392 /* Eliminate the specified n dimensions starting at first from the
2393 * constraints, without removing the dimensions from the space.
2394 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2396 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2397 enum isl_dim_type type
, unsigned first
, unsigned n
)
2404 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2405 return isl_map_free(map
);
2407 map
= isl_map_cow(map
);
2411 for (i
= 0; i
< map
->n
; ++i
) {
2412 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2422 /* Eliminate the specified n dimensions starting at first from the
2423 * constraints, without removing the dimensions from the space.
2424 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2426 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2427 enum isl_dim_type type
, unsigned first
, unsigned n
)
2429 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2432 /* Eliminate the specified n dimensions starting at first from the
2433 * constraints, without removing the dimensions from the space.
2434 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2436 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2437 unsigned first
, unsigned n
)
2439 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2442 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2443 __isl_take isl_basic_map
*bmap
)
2447 bmap
= isl_basic_map_eliminate_vars(bmap
,
2448 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2452 return isl_basic_map_finalize(bmap
);
2455 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2456 __isl_take isl_basic_set
*bset
)
2458 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2461 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2470 map
= isl_map_cow(map
);
2474 for (i
= 0; i
< map
->n
; ++i
) {
2475 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2485 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2487 return isl_map_remove_divs(set
);
2490 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2491 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2492 unsigned first
, unsigned n
)
2494 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2495 return isl_basic_map_free(bmap
);
2496 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2498 bmap
= isl_basic_map_eliminate_vars(bmap
,
2499 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2502 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2504 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2508 /* Return true if the definition of the given div (recursively) involves
2509 * any of the given variables.
2511 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2512 unsigned first
, unsigned n
)
2515 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2517 if (isl_int_is_zero(bmap
->div
[div
][0]))
2518 return isl_bool_false
;
2519 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2520 return isl_bool_true
;
2522 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2525 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2527 involves
= div_involves_vars(bmap
, i
, first
, n
);
2528 if (involves
< 0 || involves
)
2532 return isl_bool_false
;
2535 /* Try and add a lower and/or upper bound on "div" to "bmap"
2536 * based on inequality "i".
2537 * "total" is the total number of variables (excluding the divs).
2538 * "v" is a temporary object that can be used during the calculations.
2539 * If "lb" is set, then a lower bound should be constructed.
2540 * If "ub" is set, then an upper bound should be constructed.
2542 * The calling function has already checked that the inequality does not
2543 * reference "div", but we still need to check that the inequality is
2544 * of the right form. We'll consider the case where we want to construct
2545 * a lower bound. The construction of upper bounds is similar.
2547 * Let "div" be of the form
2549 * q = floor((a + f(x))/d)
2551 * We essentially check if constraint "i" is of the form
2555 * so that we can use it to derive a lower bound on "div".
2556 * However, we allow a slightly more general form
2560 * with the condition that the coefficients of g(x) - f(x) are all
2562 * Rewriting this constraint as
2566 * adding a + f(x) to both sides and dividing by d, we obtain
2568 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2570 * Taking the floor on both sides, we obtain
2572 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2576 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2578 * In the case of an upper bound, we construct the constraint
2580 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2583 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2584 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2585 unsigned total
, isl_int v
, int lb
, int ub
)
2589 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2591 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2592 bmap
->div
[div
][1 + 1 + j
]);
2593 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2596 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2597 bmap
->div
[div
][1 + 1 + j
]);
2598 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2604 bmap
= isl_basic_map_cow(bmap
);
2605 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2607 int k
= isl_basic_map_alloc_inequality(bmap
);
2610 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2611 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2612 bmap
->div
[div
][1 + j
]);
2613 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2614 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2616 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2619 int k
= isl_basic_map_alloc_inequality(bmap
);
2622 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2623 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2624 bmap
->div
[div
][1 + j
]);
2625 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2626 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2628 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2631 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2634 isl_basic_map_free(bmap
);
2638 /* This function is called right before "div" is eliminated from "bmap"
2639 * using Fourier-Motzkin.
2640 * Look through the constraints of "bmap" for constraints on the argument
2641 * of the integer division and use them to construct constraints on the
2642 * integer division itself. These constraints can then be combined
2643 * during the Fourier-Motzkin elimination.
2644 * Note that it is only useful to introduce lower bounds on "div"
2645 * if "bmap" already contains upper bounds on "div" as the newly
2646 * introduce lower bounds can then be combined with the pre-existing
2647 * upper bounds. Similarly for upper bounds.
2648 * We therefore first check if "bmap" contains any lower and/or upper bounds
2651 * It is interesting to note that the introduction of these constraints
2652 * can indeed lead to more accurate results, even when compared to
2653 * deriving constraints on the argument of "div" from constraints on "div".
2654 * Consider, for example, the set
2656 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2658 * The second constraint can be rewritten as
2660 * 2 * [(-i-2j+3)/4] + k >= 0
2662 * from which we can derive
2664 * -i - 2j + 3 >= -2k
2670 * Combined with the first constraint, we obtain
2672 * -3 <= 3 + 2k or k >= -3
2674 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2675 * the first constraint, we obtain
2677 * [(i + 2j)/4] >= [-3/4] = -1
2679 * Combining this constraint with the second constraint, we obtain
2683 static __isl_give isl_basic_map
*insert_bounds_on_div(
2684 __isl_take isl_basic_map
*bmap
, int div
)
2687 int check_lb
, check_ub
;
2694 if (isl_int_is_zero(bmap
->div
[div
][0]))
2697 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2701 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2702 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2709 if (!check_lb
&& !check_ub
)
2714 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2715 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2718 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2719 check_lb
, check_ub
);
2727 /* Remove all divs (recursively) involving any of the given dimensions
2728 * in their definitions.
2730 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2731 __isl_take isl_basic_map
*bmap
,
2732 enum isl_dim_type type
, unsigned first
, unsigned n
)
2736 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2737 return isl_basic_map_free(bmap
);
2738 first
+= isl_basic_map_offset(bmap
, type
);
2740 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2743 involves
= div_involves_vars(bmap
, i
, first
, n
);
2745 return isl_basic_map_free(bmap
);
2748 bmap
= insert_bounds_on_div(bmap
, i
);
2749 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2758 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2759 __isl_take isl_basic_set
*bset
,
2760 enum isl_dim_type type
, unsigned first
, unsigned n
)
2762 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2765 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2766 enum isl_dim_type type
, unsigned first
, unsigned n
)
2775 map
= isl_map_cow(map
);
2779 for (i
= 0; i
< map
->n
; ++i
) {
2780 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2791 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2792 enum isl_dim_type type
, unsigned first
, unsigned n
)
2794 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2798 /* Does the description of "bmap" depend on the specified dimensions?
2799 * We also check whether the dimensions appear in any of the div definitions.
2800 * In principle there is no need for this check. If the dimensions appear
2801 * in a div definition, they also appear in the defining constraints of that
2804 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2805 enum isl_dim_type type
, unsigned first
, unsigned n
)
2809 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2810 return isl_bool_error
;
2812 first
+= isl_basic_map_offset(bmap
, type
);
2813 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2814 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2815 return isl_bool_true
;
2816 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2817 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2818 return isl_bool_true
;
2819 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2820 if (isl_int_is_zero(bmap
->div
[i
][0]))
2822 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2823 return isl_bool_true
;
2826 return isl_bool_false
;
2829 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2830 enum isl_dim_type type
, unsigned first
, unsigned n
)
2834 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2835 return isl_bool_error
;
2837 for (i
= 0; i
< map
->n
; ++i
) {
2838 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2840 if (involves
< 0 || involves
)
2844 return isl_bool_false
;
2847 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2848 enum isl_dim_type type
, unsigned first
, unsigned n
)
2850 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2853 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2854 enum isl_dim_type type
, unsigned first
, unsigned n
)
2856 return isl_map_involves_dims(set
, type
, first
, n
);
2859 /* Drop all constraints in bmap that involve any of the dimensions
2860 * first to first+n-1.
2862 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2863 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2870 bmap
= isl_basic_map_cow(bmap
);
2875 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2876 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2878 isl_basic_map_drop_equality(bmap
, i
);
2881 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2882 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2884 isl_basic_map_drop_inequality(bmap
, i
);
2887 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2891 /* Drop all constraints in bset that involve any of the dimensions
2892 * first to first+n-1.
2894 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2895 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2897 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2900 /* Drop all constraints in bmap that do not involve any of the dimensions
2901 * first to first + n - 1 of the given type.
2903 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2904 __isl_take isl_basic_map
*bmap
,
2905 enum isl_dim_type type
, unsigned first
, unsigned n
)
2910 isl_space
*space
= isl_basic_map_get_space(bmap
);
2911 isl_basic_map_free(bmap
);
2912 return isl_basic_map_universe(space
);
2914 bmap
= isl_basic_map_cow(bmap
);
2918 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2919 return isl_basic_map_free(bmap
);
2921 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2923 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2924 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2926 isl_basic_map_drop_equality(bmap
, i
);
2929 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2930 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2932 isl_basic_map_drop_inequality(bmap
, i
);
2935 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2939 /* Drop all constraints in bset that do not involve any of the dimensions
2940 * first to first + n - 1 of the given type.
2942 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2943 __isl_take isl_basic_set
*bset
,
2944 enum isl_dim_type type
, unsigned first
, unsigned n
)
2946 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2950 /* Drop all constraints in bmap that involve any of the dimensions
2951 * first to first + n - 1 of the given type.
2953 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2954 __isl_take isl_basic_map
*bmap
,
2955 enum isl_dim_type type
, unsigned first
, unsigned n
)
2962 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2963 return isl_basic_map_free(bmap
);
2965 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2966 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2967 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2970 /* Drop all constraints in bset that involve any of the dimensions
2971 * first to first + n - 1 of the given type.
2973 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2974 __isl_take isl_basic_set
*bset
,
2975 enum isl_dim_type type
, unsigned first
, unsigned n
)
2977 return isl_basic_map_drop_constraints_involving_dims(bset
,
2981 /* Drop constraints from "map" by applying "drop" to each basic map.
2983 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2984 enum isl_dim_type type
, unsigned first
, unsigned n
,
2985 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2986 enum isl_dim_type type
, unsigned first
, unsigned n
))
2990 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2991 return isl_map_free(map
);
2993 map
= isl_map_cow(map
);
2997 for (i
= 0; i
< map
->n
; ++i
) {
2998 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
3000 return isl_map_free(map
);
3004 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3009 /* Drop all constraints in map that involve any of the dimensions
3010 * first to first + n - 1 of the given type.
3012 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
3013 __isl_take isl_map
*map
,
3014 enum isl_dim_type type
, unsigned first
, unsigned n
)
3018 return drop_constraints(map
, type
, first
, n
,
3019 &isl_basic_map_drop_constraints_involving_dims
);
3022 /* Drop all constraints in "map" that do not involve any of the dimensions
3023 * first to first + n - 1 of the given type.
3025 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
3026 __isl_take isl_map
*map
,
3027 enum isl_dim_type type
, unsigned first
, unsigned n
)
3030 isl_space
*space
= isl_map_get_space(map
);
3032 return isl_map_universe(space
);
3034 return drop_constraints(map
, type
, first
, n
,
3035 &isl_basic_map_drop_constraints_not_involving_dims
);
3038 /* Drop all constraints in set that involve any of the dimensions
3039 * first to first + n - 1 of the given type.
3041 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
3042 __isl_take isl_set
*set
,
3043 enum isl_dim_type type
, unsigned first
, unsigned n
)
3045 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
3048 /* Drop all constraints in "set" that do not involve any of the dimensions
3049 * first to first + n - 1 of the given type.
3051 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
3052 __isl_take isl_set
*set
,
3053 enum isl_dim_type type
, unsigned first
, unsigned n
)
3055 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3058 /* Does local variable "div" of "bmap" have a complete explicit representation?
3059 * Having a complete explicit representation requires not only
3060 * an explicit representation, but also that all local variables
3061 * that appear in this explicit representation in turn have
3062 * a complete explicit representation.
3064 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3067 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3070 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3071 if (marked
< 0 || marked
)
3072 return isl_bool_not(marked
);
3074 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3077 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3079 known
= isl_basic_map_div_is_known(bmap
, i
);
3080 if (known
< 0 || !known
)
3084 return isl_bool_true
;
3087 /* Remove all divs that are unknown or defined in terms of unknown divs.
3089 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3090 __isl_take isl_basic_map
*bmap
)
3097 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3098 if (isl_basic_map_div_is_known(bmap
, i
))
3100 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3109 /* Remove all divs that are unknown or defined in terms of unknown divs.
3111 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3112 __isl_take isl_basic_set
*bset
)
3114 return isl_basic_map_remove_unknown_divs(bset
);
3117 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3126 map
= isl_map_cow(map
);
3130 for (i
= 0; i
< map
->n
; ++i
) {
3131 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3141 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3143 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3146 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3147 __isl_take isl_basic_set
*bset
,
3148 enum isl_dim_type type
, unsigned first
, unsigned n
)
3150 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3151 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3152 return bset_from_bmap(bmap
);
3155 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3156 enum isl_dim_type type
, unsigned first
, unsigned n
)
3163 map
= isl_map_cow(map
);
3164 if (isl_map_check_range(map
, type
, first
, n
) < 0)
3165 return isl_map_free(map
);
3167 for (i
= 0; i
< map
->n
; ++i
) {
3168 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3169 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3173 map
= isl_map_drop(map
, type
, first
, n
);
3180 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3181 enum isl_dim_type type
, unsigned first
, unsigned n
)
3183 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3187 /* Project out n inputs starting at first using Fourier-Motzkin */
3188 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3189 unsigned first
, unsigned n
)
3191 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3194 static void dump_term(struct isl_basic_map
*bmap
,
3195 isl_int c
, int pos
, FILE *out
)
3198 unsigned in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3199 unsigned dim
= in
+ isl_basic_map_dim(bmap
, isl_dim_out
);
3200 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3202 isl_int_print(out
, c
, 0);
3204 if (!isl_int_is_one(c
))
3205 isl_int_print(out
, c
, 0);
3206 if (pos
< 1 + nparam
) {
3207 name
= isl_space_get_dim_name(bmap
->dim
,
3208 isl_dim_param
, pos
- 1);
3210 fprintf(out
, "%s", name
);
3212 fprintf(out
, "p%d", pos
- 1);
3213 } else if (pos
< 1 + nparam
+ in
)
3214 fprintf(out
, "i%d", pos
- 1 - nparam
);
3215 else if (pos
< 1 + nparam
+ dim
)
3216 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
3218 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
3222 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
3223 int sign
, FILE *out
)
3227 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
3231 for (i
= 0, first
= 1; i
< len
; ++i
) {
3232 if (isl_int_sgn(c
[i
]) * sign
<= 0)
3235 fprintf(out
, " + ");
3237 isl_int_abs(v
, c
[i
]);
3238 dump_term(bmap
, v
, i
, out
);
3245 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
3246 const char *op
, FILE *out
, int indent
)
3250 fprintf(out
, "%*s", indent
, "");
3252 dump_constraint_sign(bmap
, c
, 1, out
);
3253 fprintf(out
, " %s ", op
);
3254 dump_constraint_sign(bmap
, c
, -1, out
);
3258 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
3259 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
3261 fprintf(out
, "%*s", indent
, "");
3262 fprintf(out
, "ERROR: unused div coefficient not zero\n");
3267 static void dump_constraints(struct isl_basic_map
*bmap
,
3268 isl_int
**c
, unsigned n
,
3269 const char *op
, FILE *out
, int indent
)
3273 for (i
= 0; i
< n
; ++i
)
3274 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
3277 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
3281 unsigned total
= isl_basic_map_total_dim(bmap
);
3283 for (j
= 0; j
< 1 + total
; ++j
) {
3284 if (isl_int_is_zero(exp
[j
]))
3286 if (!first
&& isl_int_is_pos(exp
[j
]))
3288 dump_term(bmap
, exp
[j
], j
, out
);
3293 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
3297 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
3298 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
3300 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3301 fprintf(out
, "%*s", indent
, "");
3302 fprintf(out
, "e%d = [(", i
);
3303 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
3305 isl_int_print(out
, bmap
->div
[i
][0], 0);
3306 fprintf(out
, "]\n");
3310 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3311 FILE *out
, int indent
)
3314 fprintf(out
, "null basic set\n");
3318 fprintf(out
, "%*s", indent
, "");
3319 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3320 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3321 bset
->extra
, bset
->flags
);
3322 dump(bset_to_bmap(bset
), out
, indent
);
3325 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3326 FILE *out
, int indent
)
3329 fprintf(out
, "null basic map\n");
3333 fprintf(out
, "%*s", indent
, "");
3334 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3335 "flags: %x, n_name: %d\n",
3337 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3338 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3339 dump(bmap
, out
, indent
);
3342 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
3347 total
= isl_basic_map_total_dim(bmap
);
3348 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
3349 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3350 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3351 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3355 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3360 if (isl_space_dim(space
, isl_dim_in
) != 0)
3361 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3362 "set cannot have input dimensions", goto error
);
3363 return isl_map_alloc_space(space
, n
, flags
);
3365 isl_space_free(space
);
3369 /* Make sure "map" has room for at least "n" more basic maps.
3371 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3374 struct isl_map
*grown
= NULL
;
3378 isl_assert(map
->ctx
, n
>= 0, goto error
);
3379 if (map
->n
+ n
<= map
->size
)
3381 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3384 for (i
= 0; i
< map
->n
; ++i
) {
3385 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3393 isl_map_free(grown
);
3398 /* Make sure "set" has room for at least "n" more basic sets.
3400 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3402 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3405 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3407 return isl_map_from_basic_map(bset
);
3410 __isl_give isl_map
*isl_map_from_basic_map(__isl_take isl_basic_map
*bmap
)
3412 struct isl_map
*map
;
3417 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3418 return isl_map_add_basic_map(map
, bmap
);
3421 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3422 __isl_take isl_basic_set
*bset
)
3424 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3425 bset_to_bmap(bset
)));
3428 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3430 return isl_map_free(set
);
3433 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3438 fprintf(out
, "null set\n");
3442 fprintf(out
, "%*s", indent
, "");
3443 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3444 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3446 for (i
= 0; i
< set
->n
; ++i
) {
3447 fprintf(out
, "%*s", indent
, "");
3448 fprintf(out
, "basic set %d:\n", i
);
3449 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3453 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3458 fprintf(out
, "null map\n");
3462 fprintf(out
, "%*s", indent
, "");
3463 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3464 "flags: %x, n_name: %d\n",
3465 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3466 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3467 for (i
= 0; i
< map
->n
; ++i
) {
3468 fprintf(out
, "%*s", indent
, "");
3469 fprintf(out
, "basic map %d:\n", i
);
3470 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3474 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3475 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3477 struct isl_basic_map
*bmap_domain
;
3479 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3482 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3483 isl_assert(bset
->ctx
,
3484 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3486 bmap
= isl_basic_map_cow(bmap
);
3489 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3490 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3491 bmap_domain
= isl_basic_map_from_domain(bset
);
3492 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3494 bmap
= isl_basic_map_simplify(bmap
);
3495 return isl_basic_map_finalize(bmap
);
3497 isl_basic_map_free(bmap
);
3498 isl_basic_set_free(bset
);
3502 /* Check that the space of "bset" is the same as that of the range of "bmap".
3504 static isl_stat
isl_basic_map_check_compatible_range(
3505 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3509 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3511 return isl_stat_error
;
3513 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3514 "incompatible spaces", return isl_stat_error
);
3519 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3520 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3522 struct isl_basic_map
*bmap_range
;
3524 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3527 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3528 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3531 if (isl_basic_set_plain_is_universe(bset
)) {
3532 isl_basic_set_free(bset
);
3536 bmap
= isl_basic_map_cow(bmap
);
3539 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3540 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3541 bmap_range
= bset_to_bmap(bset
);
3542 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3544 bmap
= isl_basic_map_simplify(bmap
);
3545 return isl_basic_map_finalize(bmap
);
3547 isl_basic_map_free(bmap
);
3548 isl_basic_set_free(bset
);
3552 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3553 __isl_keep isl_vec
*vec
)
3560 return isl_bool_error
;
3562 total
= 1 + isl_basic_map_total_dim(bmap
);
3563 if (total
!= vec
->size
)
3564 return isl_bool_false
;
3568 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3569 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3570 if (!isl_int_is_zero(s
)) {
3572 return isl_bool_false
;
3576 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3577 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3578 if (isl_int_is_neg(s
)) {
3580 return isl_bool_false
;
3586 return isl_bool_true
;
3589 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3590 __isl_keep isl_vec
*vec
)
3592 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3595 __isl_give isl_basic_map
*isl_basic_map_intersect(
3596 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3598 struct isl_vec
*sample
= NULL
;
3600 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3602 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3603 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3604 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3605 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3606 return isl_basic_map_intersect(bmap2
, bmap1
);
3608 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3609 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3610 isl_assert(bmap1
->ctx
,
3611 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3613 if (isl_basic_map_plain_is_empty(bmap1
)) {
3614 isl_basic_map_free(bmap2
);
3617 if (isl_basic_map_plain_is_empty(bmap2
)) {
3618 isl_basic_map_free(bmap1
);
3622 if (bmap1
->sample
&&
3623 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3624 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3625 sample
= isl_vec_copy(bmap1
->sample
);
3626 else if (bmap2
->sample
&&
3627 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3628 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3629 sample
= isl_vec_copy(bmap2
->sample
);
3631 bmap1
= isl_basic_map_cow(bmap1
);
3634 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3635 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3636 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3639 isl_vec_free(sample
);
3641 isl_vec_free(bmap1
->sample
);
3642 bmap1
->sample
= sample
;
3645 bmap1
= isl_basic_map_simplify(bmap1
);
3646 return isl_basic_map_finalize(bmap1
);
3649 isl_vec_free(sample
);
3650 isl_basic_map_free(bmap1
);
3651 isl_basic_map_free(bmap2
);
3655 struct isl_basic_set
*isl_basic_set_intersect(
3656 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3658 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3659 bset_to_bmap(bset2
)));
3662 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3663 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3665 return isl_basic_set_intersect(bset1
, bset2
);
3668 /* Special case of isl_map_intersect, where both map1 and map2
3669 * are convex, without any divs and such that either map1 or map2
3670 * contains a single constraint. This constraint is then simply
3671 * added to the other map.
3673 static __isl_give isl_map
*map_intersect_add_constraint(
3674 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3676 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3677 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3678 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3679 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3681 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3682 return isl_map_intersect(map2
, map1
);
3684 map1
= isl_map_cow(map1
);
3687 if (isl_map_plain_is_empty(map1
)) {
3691 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3692 if (map2
->p
[0]->n_eq
== 1)
3693 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3695 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3696 map2
->p
[0]->ineq
[0]);
3698 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3699 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3703 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3704 isl_basic_map_free(map1
->p
[0]);
3710 map1
= isl_map_unmark_normalized(map1
);
3718 /* map2 may be either a parameter domain or a map living in the same
3721 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3722 __isl_take isl_map
*map2
)
3732 if ((isl_map_plain_is_empty(map1
) ||
3733 isl_map_plain_is_universe(map2
)) &&
3734 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3738 if ((isl_map_plain_is_empty(map2
) ||
3739 isl_map_plain_is_universe(map1
)) &&
3740 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3745 if (map1
->n
== 1 && map2
->n
== 1 &&
3746 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3747 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3748 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3749 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3750 return map_intersect_add_constraint(map1
, map2
);
3752 equal
= isl_map_plain_is_equal(map1
, map2
);
3760 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3761 isl_space_dim(map2
->dim
, isl_dim_param
))
3762 isl_assert(map1
->ctx
,
3763 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3765 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3766 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3767 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3769 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3770 map1
->n
* map2
->n
, flags
);
3773 for (i
= 0; i
< map1
->n
; ++i
)
3774 for (j
= 0; j
< map2
->n
; ++j
) {
3775 struct isl_basic_map
*part
;
3776 part
= isl_basic_map_intersect(
3777 isl_basic_map_copy(map1
->p
[i
]),
3778 isl_basic_map_copy(map2
->p
[j
]));
3779 if (isl_basic_map_is_empty(part
) < 0)
3780 part
= isl_basic_map_free(part
);
3781 result
= isl_map_add_basic_map(result
, part
);
3794 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3795 __isl_take isl_map
*map2
)
3799 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3800 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3801 "spaces don't match", goto error
);
3802 return map_intersect_internal(map1
, map2
);
3809 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3810 __isl_take isl_map
*map2
)
3812 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3815 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3817 return set_from_map(isl_map_intersect(set_to_map(set1
),
3821 /* map_intersect_internal accepts intersections
3822 * with parameter domains, so we can just call that function.
3824 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3825 __isl_take isl_set
*params
)
3827 return map_intersect_internal(map
, params
);
3830 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3831 __isl_take isl_map
*map2
)
3833 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3836 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3837 __isl_take isl_set
*params
)
3839 return isl_map_intersect_params(set
, params
);
3842 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3845 unsigned pos
, n1
, n2
;
3849 bmap
= isl_basic_map_cow(bmap
);
3852 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3853 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3854 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3855 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3856 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3857 return isl_basic_map_reset_space(bmap
, space
);
3860 static __isl_give isl_basic_map
*basic_map_space_reset(
3861 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3867 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3870 space
= isl_basic_map_get_space(bmap
);
3871 space
= isl_space_reset(space
, type
);
3872 bmap
= isl_basic_map_reset_space(bmap
, space
);
3876 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3877 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3878 unsigned pos
, unsigned n
)
3881 isl_space
*res_space
;
3882 struct isl_basic_map
*res
;
3883 struct isl_dim_map
*dim_map
;
3884 unsigned total
, off
;
3885 enum isl_dim_type t
;
3888 return basic_map_space_reset(bmap
, type
);
3893 res_space
= isl_space_insert_dims(isl_basic_map_get_space(bmap
),
3896 total
= isl_basic_map_total_dim(bmap
) + n
;
3897 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3899 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3901 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3903 unsigned size
= isl_basic_map_dim(bmap
, t
);
3904 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3906 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3907 pos
, size
- pos
, off
+ pos
+ n
);
3909 off
+= isl_space_dim(res_space
, t
);
3911 isl_dim_map_div(dim_map
, bmap
, off
);
3913 res
= isl_basic_map_alloc_space(res_space
,
3914 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3915 rational
= isl_basic_map_is_rational(bmap
);
3917 res
= isl_basic_map_free(res
);
3919 res
= isl_basic_map_set_rational(res
);
3920 if (isl_basic_map_plain_is_empty(bmap
)) {
3921 isl_basic_map_free(bmap
);
3923 return isl_basic_map_set_to_empty(res
);
3925 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3926 return isl_basic_map_finalize(res
);
3929 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3930 __isl_take isl_basic_set
*bset
,
3931 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3933 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3936 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3937 enum isl_dim_type type
, unsigned n
)
3941 return isl_basic_map_insert_dims(bmap
, type
,
3942 isl_basic_map_dim(bmap
, type
), n
);
3945 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3946 enum isl_dim_type type
, unsigned n
)
3950 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3951 return isl_basic_map_add_dims(bset
, type
, n
);
3953 isl_basic_set_free(bset
);
3957 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3958 enum isl_dim_type type
)
3962 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3965 space
= isl_map_get_space(map
);
3966 space
= isl_space_reset(space
, type
);
3967 map
= isl_map_reset_space(map
, space
);
3971 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3972 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3977 return map_space_reset(map
, type
);
3979 map
= isl_map_cow(map
);
3983 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3987 for (i
= 0; i
< map
->n
; ++i
) {
3988 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3999 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
4000 enum isl_dim_type type
, unsigned pos
, unsigned n
)
4002 return isl_map_insert_dims(set
, type
, pos
, n
);
4005 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
4006 enum isl_dim_type type
, unsigned n
)
4010 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
4013 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
4014 enum isl_dim_type type
, unsigned n
)
4018 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
4019 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
4025 __isl_give isl_basic_map
*isl_basic_map_move_dims(
4026 __isl_take isl_basic_map
*bmap
,
4027 enum isl_dim_type dst_type
, unsigned dst_pos
,
4028 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4030 struct isl_dim_map
*dim_map
;
4031 struct isl_basic_map
*res
;
4032 enum isl_dim_type t
;
4033 unsigned total
, off
;
4038 bmap
= isl_basic_map_reset(bmap
, src_type
);
4039 bmap
= isl_basic_map_reset(bmap
, dst_type
);
4043 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
4044 return isl_basic_map_free(bmap
);
4046 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4049 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
4051 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
4052 pos(bmap
->dim
, src_type
) + src_pos
+
4053 ((src_type
< dst_type
) ? n
: 0)) {
4054 bmap
= isl_basic_map_cow(bmap
);
4058 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4059 src_type
, src_pos
, n
);
4063 bmap
= isl_basic_map_finalize(bmap
);
4068 total
= isl_basic_map_total_dim(bmap
);
4069 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4072 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4073 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4074 if (t
== dst_type
) {
4075 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4078 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
4081 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4082 dst_pos
, size
- dst_pos
, off
);
4083 off
+= size
- dst_pos
;
4084 } else if (t
== src_type
) {
4085 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4088 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4089 src_pos
+ n
, size
- src_pos
- n
, off
);
4090 off
+= size
- src_pos
- n
;
4092 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4096 isl_dim_map_div(dim_map
, bmap
, off
);
4098 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4099 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4100 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4104 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4105 src_type
, src_pos
, n
);
4109 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4110 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4111 bmap
= isl_basic_map_finalize(bmap
);
4115 isl_basic_map_free(bmap
);
4119 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4120 enum isl_dim_type dst_type
, unsigned dst_pos
,
4121 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4123 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4124 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4125 src_type
, src_pos
, n
);
4126 return bset_from_bmap(bmap
);
4129 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4130 enum isl_dim_type dst_type
, unsigned dst_pos
,
4131 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4135 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4136 return set_from_map(isl_map_move_dims(set_to_map(set
),
4137 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4143 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4144 enum isl_dim_type dst_type
, unsigned dst_pos
,
4145 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4150 map
= isl_map_reset(map
, src_type
);
4151 map
= isl_map_reset(map
, dst_type
);
4155 if (isl_map_check_range(map
, src_type
, src_pos
, n
))
4156 return isl_map_free(map
);
4158 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4161 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4163 map
= isl_map_cow(map
);
4167 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4171 for (i
= 0; i
< map
->n
; ++i
) {
4172 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4174 src_type
, src_pos
, n
);
4185 /* Move the specified dimensions to the last columns right before
4186 * the divs. Don't change the dimension specification of bmap.
4187 * That's the responsibility of the caller.
4189 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4190 enum isl_dim_type type
, unsigned first
, unsigned n
)
4192 struct isl_dim_map
*dim_map
;
4193 struct isl_basic_map
*res
;
4194 enum isl_dim_type t
;
4195 unsigned total
, off
;
4199 if (pos(bmap
->dim
, type
) + first
+ n
==
4200 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
4203 total
= isl_basic_map_total_dim(bmap
);
4204 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4207 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4208 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4210 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4213 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4214 first
, n
, total
- bmap
->n_div
- n
);
4215 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4216 first
+ n
, size
- (first
+ n
), off
);
4217 off
+= size
- (first
+ n
);
4219 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4223 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4225 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4226 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4227 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4231 /* Insert "n" rows in the divs of "bmap".
4233 * The number of columns is not changed, which means that the last
4234 * dimensions of "bmap" are being reintepreted as the new divs.
4235 * The space of "bmap" is not adjusted, however, which means
4236 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4237 * from the space of "bmap" is the responsibility of the caller.
4239 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4247 bmap
= isl_basic_map_cow(bmap
);
4251 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
4252 old
= bmap
->block2
.data
;
4253 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4254 (bmap
->extra
+ n
) * (1 + row_size
));
4255 if (!bmap
->block2
.data
)
4256 return isl_basic_map_free(bmap
);
4257 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4259 return isl_basic_map_free(bmap
);
4260 for (i
= 0; i
< n
; ++i
) {
4261 new_div
[i
] = bmap
->block2
.data
+
4262 (bmap
->extra
+ i
) * (1 + row_size
);
4263 isl_seq_clr(new_div
[i
], 1 + row_size
);
4265 for (i
= 0; i
< bmap
->extra
; ++i
)
4266 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4268 bmap
->div
= new_div
;
4275 /* Drop constraints from "bmap" that only involve the variables
4276 * of "type" in the range [first, first + n] that are not related
4277 * to any of the variables outside that interval.
4278 * These constraints cannot influence the values for the variables
4279 * outside the interval, except in case they cause "bmap" to be empty.
4280 * Only drop the constraints if "bmap" is known to be non-empty.
4282 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4283 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4284 unsigned first
, unsigned n
)
4288 unsigned dim
, n_div
;
4291 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4293 return isl_basic_map_free(bmap
);
4297 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4298 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4299 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4301 return isl_basic_map_free(bmap
);
4302 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4303 for (i
= 0; i
< first
; ++i
)
4305 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4308 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4313 /* Turn the n dimensions of type type, starting at first
4314 * into existentially quantified variables.
4316 * If a subset of the projected out variables are unrelated
4317 * to any of the variables that remain, then the constraints
4318 * involving this subset are simply dropped first.
4320 __isl_give isl_basic_map
*isl_basic_map_project_out(
4321 __isl_take isl_basic_map
*bmap
,
4322 enum isl_dim_type type
, unsigned first
, unsigned n
)
4327 return basic_map_space_reset(bmap
, type
);
4328 if (type
== isl_dim_div
)
4329 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4330 "cannot project out existentially quantified variables",
4331 return isl_basic_map_free(bmap
));
4333 empty
= isl_basic_map_plain_is_empty(bmap
);
4335 return isl_basic_map_free(bmap
);
4337 bmap
= isl_basic_map_set_to_empty(bmap
);
4339 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4343 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4344 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4346 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4347 return isl_basic_map_free(bmap
);
4349 bmap
= move_last(bmap
, type
, first
, n
);
4350 bmap
= isl_basic_map_cow(bmap
);
4351 bmap
= insert_div_rows(bmap
, n
);
4355 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4358 bmap
= isl_basic_map_simplify(bmap
);
4359 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4360 return isl_basic_map_finalize(bmap
);
4362 isl_basic_map_free(bmap
);
4366 /* Turn the n dimensions of type type, starting at first
4367 * into existentially quantified variables.
4369 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4370 enum isl_dim_type type
, unsigned first
, unsigned n
)
4372 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4376 /* Turn the n dimensions of type type, starting at first
4377 * into existentially quantified variables.
4379 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4380 enum isl_dim_type type
, unsigned first
, unsigned n
)
4385 return map_space_reset(map
, type
);
4387 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4388 return isl_map_free(map
);
4390 map
= isl_map_cow(map
);
4394 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4398 for (i
= 0; i
< map
->n
; ++i
) {
4399 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4410 /* Turn all the dimensions of type "type", except the "n" starting at "first"
4411 * into existentially quantified variables.
4413 __isl_give isl_map
*isl_map_project_onto(__isl_take isl_map
*map
,
4414 enum isl_dim_type type
, unsigned first
, unsigned n
)
4418 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4419 return isl_map_free(map
);
4420 dim
= isl_map_dim(map
, type
);
4421 map
= isl_map_project_out(map
, type
, first
+ n
, dim
- (first
+ n
));
4422 map
= isl_map_project_out(map
, type
, 0, first
);
4426 /* Turn the n dimensions of type type, starting at first
4427 * into existentially quantified variables.
4429 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4430 enum isl_dim_type type
, unsigned first
, unsigned n
)
4432 return set_from_map(isl_map_project_out(set_to_map(set
),
4436 /* Return a map that projects the elements in "set" onto their
4437 * "n" set dimensions starting at "first".
4438 * "type" should be equal to isl_dim_set.
4440 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4441 enum isl_dim_type type
, unsigned first
, unsigned n
)
4449 if (type
!= isl_dim_set
)
4450 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4451 "only set dimensions can be projected out", goto error
);
4452 dim
= isl_set_dim(set
, isl_dim_set
);
4453 if (first
+ n
> dim
|| first
+ n
< first
)
4454 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4455 "index out of bounds", goto error
);
4457 map
= isl_map_from_domain(set
);
4458 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4459 for (i
= 0; i
< n
; ++i
)
4460 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4468 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
4472 for (i
= 0; i
< n
; ++i
) {
4473 j
= isl_basic_map_alloc_div(bmap
);
4476 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4480 isl_basic_map_free(bmap
);
4484 struct isl_basic_map
*isl_basic_map_apply_range(
4485 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4487 isl_space
*dim_result
= NULL
;
4488 struct isl_basic_map
*bmap
;
4489 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4490 struct isl_dim_map
*dim_map1
, *dim_map2
;
4492 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4494 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4495 bmap2
->dim
, isl_dim_in
))
4496 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4497 "spaces don't match", goto error
);
4499 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4500 isl_space_copy(bmap2
->dim
));
4502 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4503 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4504 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4505 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4507 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4508 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4509 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4510 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4511 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4512 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4513 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4514 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4515 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4516 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4517 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4519 bmap
= isl_basic_map_alloc_space(dim_result
,
4520 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4521 bmap1
->n_eq
+ bmap2
->n_eq
,
4522 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4523 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4524 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4525 bmap
= add_divs(bmap
, n
);
4526 bmap
= isl_basic_map_simplify(bmap
);
4527 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4528 return isl_basic_map_finalize(bmap
);
4530 isl_basic_map_free(bmap1
);
4531 isl_basic_map_free(bmap2
);
4535 struct isl_basic_set
*isl_basic_set_apply(
4536 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4541 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4544 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4547 isl_basic_set_free(bset
);
4548 isl_basic_map_free(bmap
);
4552 struct isl_basic_map
*isl_basic_map_apply_domain(
4553 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4555 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4557 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4558 bmap2
->dim
, isl_dim_in
))
4559 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4560 "spaces don't match", goto error
);
4562 bmap1
= isl_basic_map_reverse(bmap1
);
4563 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4564 return isl_basic_map_reverse(bmap1
);
4566 isl_basic_map_free(bmap1
);
4567 isl_basic_map_free(bmap2
);
4571 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4572 * A \cap B -> f(A) + f(B)
4574 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4575 __isl_take isl_basic_map
*bmap2
)
4577 unsigned n_in
, n_out
, nparam
, total
, pos
;
4578 struct isl_basic_map
*bmap
= NULL
;
4579 struct isl_dim_map
*dim_map1
, *dim_map2
;
4582 if (!bmap1
|| !bmap2
)
4585 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4588 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4589 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4590 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4592 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4593 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4594 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4595 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4596 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4597 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4598 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4599 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4600 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4601 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4602 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4604 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4605 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4606 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4607 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4608 for (i
= 0; i
< n_out
; ++i
) {
4609 int j
= isl_basic_map_alloc_equality(bmap
);
4612 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4613 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4614 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4615 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4617 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4618 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4619 bmap
= add_divs(bmap
, 2 * n_out
);
4621 bmap
= isl_basic_map_simplify(bmap
);
4622 return isl_basic_map_finalize(bmap
);
4624 isl_basic_map_free(bmap
);
4625 isl_basic_map_free(bmap1
);
4626 isl_basic_map_free(bmap2
);
4630 /* Given two maps A -> f(A) and B -> g(B), construct a map
4631 * A \cap B -> f(A) + f(B)
4633 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4634 __isl_take isl_map
*map2
)
4636 struct isl_map
*result
;
4642 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4644 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4645 map1
->n
* map2
->n
, 0);
4648 for (i
= 0; i
< map1
->n
; ++i
)
4649 for (j
= 0; j
< map2
->n
; ++j
) {
4650 struct isl_basic_map
*part
;
4651 part
= isl_basic_map_sum(
4652 isl_basic_map_copy(map1
->p
[i
]),
4653 isl_basic_map_copy(map2
->p
[j
]));
4654 if (isl_basic_map_is_empty(part
))
4655 isl_basic_map_free(part
);
4657 result
= isl_map_add_basic_map(result
, part
);
4670 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4671 __isl_take isl_set
*set2
)
4673 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4676 /* Given a basic map A -> f(A), construct A -> -f(A).
4678 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4683 bmap
= isl_basic_map_cow(bmap
);
4687 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4688 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4689 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4690 for (j
= 0; j
< n
; ++j
)
4691 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4692 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4693 for (j
= 0; j
< n
; ++j
)
4694 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4695 for (i
= 0; i
< bmap
->n_div
; ++i
)
4696 for (j
= 0; j
< n
; ++j
)
4697 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4698 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4699 return isl_basic_map_finalize(bmap
);
4702 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4704 return isl_basic_map_neg(bset
);
4707 /* Given a map A -> f(A), construct A -> -f(A).
4709 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4713 map
= isl_map_cow(map
);
4717 for (i
= 0; i
< map
->n
; ++i
) {
4718 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4729 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4731 return set_from_map(isl_map_neg(set_to_map(set
)));
4734 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4735 * A -> floor(f(A)/d).
4737 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4740 unsigned n_in
, n_out
, nparam
, total
, pos
;
4741 struct isl_basic_map
*result
= NULL
;
4742 struct isl_dim_map
*dim_map
;
4748 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4749 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4750 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4752 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4753 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4754 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4755 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4756 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4757 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4759 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4760 bmap
->n_div
+ n_out
,
4761 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4762 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4763 result
= add_divs(result
, n_out
);
4764 for (i
= 0; i
< n_out
; ++i
) {
4766 j
= isl_basic_map_alloc_inequality(result
);
4769 isl_seq_clr(result
->ineq
[j
], 1+total
);
4770 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4771 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4772 j
= isl_basic_map_alloc_inequality(result
);
4775 isl_seq_clr(result
->ineq
[j
], 1+total
);
4776 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4777 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4778 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4781 result
= isl_basic_map_simplify(result
);
4782 return isl_basic_map_finalize(result
);
4784 isl_basic_map_free(result
);
4788 /* Given a map A -> f(A) and an integer d, construct a map
4789 * A -> floor(f(A)/d).
4791 __isl_give isl_map
*isl_map_floordiv(__isl_take isl_map
*map
, isl_int d
)
4795 map
= isl_map_cow(map
);
4799 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4800 for (i
= 0; i
< map
->n
; ++i
) {
4801 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4805 map
= isl_map_unmark_normalized(map
);
4813 /* Given a map A -> f(A) and an integer d, construct a map
4814 * A -> floor(f(A)/d).
4816 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4817 __isl_take isl_val
*d
)
4821 if (!isl_val_is_int(d
))
4822 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4823 "expecting integer denominator", goto error
);
4824 map
= isl_map_floordiv(map
, d
->n
);
4833 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4840 i
= isl_basic_map_alloc_equality(bmap
);
4843 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4844 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4845 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4846 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4847 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4848 return isl_basic_map_finalize(bmap
);
4850 isl_basic_map_free(bmap
);
4854 /* Add a constraint to "bmap" expressing i_pos < o_pos
4856 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4863 i
= isl_basic_map_alloc_inequality(bmap
);
4866 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4867 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4868 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4869 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4870 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4871 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4872 return isl_basic_map_finalize(bmap
);
4874 isl_basic_map_free(bmap
);
4878 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4880 static __isl_give isl_basic_map
*var_less_or_equal(
4881 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4887 i
= isl_basic_map_alloc_inequality(bmap
);
4890 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4891 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4892 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4893 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4894 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4895 return isl_basic_map_finalize(bmap
);
4897 isl_basic_map_free(bmap
);
4901 /* Add a constraint to "bmap" expressing i_pos > o_pos
4903 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4910 i
= isl_basic_map_alloc_inequality(bmap
);
4913 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4914 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4915 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4916 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4917 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4918 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4919 return isl_basic_map_finalize(bmap
);
4921 isl_basic_map_free(bmap
);
4925 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4927 static __isl_give isl_basic_map
*var_more_or_equal(
4928 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4934 i
= isl_basic_map_alloc_inequality(bmap
);
4937 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4938 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4939 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4940 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4941 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4942 return isl_basic_map_finalize(bmap
);
4944 isl_basic_map_free(bmap
);
4948 __isl_give isl_basic_map
*isl_basic_map_equal(
4949 __isl_take isl_space
*dim
, unsigned n_equal
)
4952 struct isl_basic_map
*bmap
;
4953 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4956 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4957 bmap
= var_equal(bmap
, i
);
4958 return isl_basic_map_finalize(bmap
);
4961 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4963 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4967 struct isl_basic_map
*bmap
;
4968 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4971 for (i
= 0; i
< pos
&& bmap
; ++i
)
4972 bmap
= var_equal(bmap
, i
);
4974 bmap
= var_less(bmap
, pos
);
4975 return isl_basic_map_finalize(bmap
);
4978 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4980 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4981 __isl_take isl_space
*dim
, unsigned pos
)
4984 isl_basic_map
*bmap
;
4986 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4987 for (i
= 0; i
< pos
; ++i
)
4988 bmap
= var_equal(bmap
, i
);
4989 bmap
= var_less_or_equal(bmap
, pos
);
4990 return isl_basic_map_finalize(bmap
);
4993 /* Return a relation on "dim" expressing i_pos > o_pos
4995 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4999 struct isl_basic_map
*bmap
;
5000 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
5003 for (i
= 0; i
< pos
&& bmap
; ++i
)
5004 bmap
= var_equal(bmap
, i
);
5006 bmap
= var_more(bmap
, pos
);
5007 return isl_basic_map_finalize(bmap
);
5010 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
5012 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
5013 __isl_take isl_space
*dim
, unsigned pos
)
5016 isl_basic_map
*bmap
;
5018 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
5019 for (i
= 0; i
< pos
; ++i
)
5020 bmap
= var_equal(bmap
, i
);
5021 bmap
= var_more_or_equal(bmap
, pos
);
5022 return isl_basic_map_finalize(bmap
);
5025 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
5026 unsigned n
, int equal
)
5028 struct isl_map
*map
;
5031 if (n
== 0 && equal
)
5032 return isl_map_universe(dims
);
5034 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5036 for (i
= 0; i
+ 1 < n
; ++i
)
5037 map
= isl_map_add_basic_map(map
,
5038 isl_basic_map_less_at(isl_space_copy(dims
), i
));
5041 map
= isl_map_add_basic_map(map
,
5042 isl_basic_map_less_or_equal_at(dims
, n
- 1));
5044 map
= isl_map_add_basic_map(map
,
5045 isl_basic_map_less_at(dims
, n
- 1));
5047 isl_space_free(dims
);
5052 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
5056 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
5059 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
5061 return map_lex_lte_first(dim
, n
, 0);
5064 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
5066 return map_lex_lte_first(dim
, n
, 1);
5069 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
5071 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
5074 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
5076 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
5079 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
5080 unsigned n
, int equal
)
5082 struct isl_map
*map
;
5085 if (n
== 0 && equal
)
5086 return isl_map_universe(dims
);
5088 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5090 for (i
= 0; i
+ 1 < n
; ++i
)
5091 map
= isl_map_add_basic_map(map
,
5092 isl_basic_map_more_at(isl_space_copy(dims
), i
));
5095 map
= isl_map_add_basic_map(map
,
5096 isl_basic_map_more_or_equal_at(dims
, n
- 1));
5098 map
= isl_map_add_basic_map(map
,
5099 isl_basic_map_more_at(dims
, n
- 1));
5101 isl_space_free(dims
);
5106 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
5110 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
5113 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5115 return map_lex_gte_first(dim
, n
, 0);
5118 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5120 return map_lex_gte_first(dim
, n
, 1);
5123 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5125 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5128 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5130 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5133 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5134 __isl_take isl_set
*set2
)
5137 map
= isl_map_lex_le(isl_set_get_space(set1
));
5138 map
= isl_map_intersect_domain(map
, set1
);
5139 map
= isl_map_intersect_range(map
, set2
);
5143 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5144 __isl_take isl_set
*set2
)
5147 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5148 map
= isl_map_intersect_domain(map
, set1
);
5149 map
= isl_map_intersect_range(map
, set2
);
5153 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5154 __isl_take isl_set
*set2
)
5157 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5158 map
= isl_map_intersect_domain(map
, set1
);
5159 map
= isl_map_intersect_range(map
, set2
);
5163 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5164 __isl_take isl_set
*set2
)
5167 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5168 map
= isl_map_intersect_domain(map
, set1
);
5169 map
= isl_map_intersect_range(map
, set2
);
5173 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5174 __isl_take isl_map
*map2
)
5177 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5178 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5179 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5183 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5184 __isl_take isl_map
*map2
)
5187 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5188 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5189 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5193 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5194 __isl_take isl_map
*map2
)
5197 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5198 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5199 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5203 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5204 __isl_take isl_map
*map2
)
5207 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5208 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5209 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5213 /* For a div d = floor(f/m), add the constraint
5217 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
5218 unsigned pos
, isl_int
*div
)
5221 unsigned total
= isl_basic_map_total_dim(bmap
);
5223 i
= isl_basic_map_alloc_inequality(bmap
);
5225 return isl_stat_error
;
5226 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5227 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
5232 /* For a div d = floor(f/m), add the constraint
5234 * -(f-(m-1)) + m d >= 0
5236 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
5237 unsigned pos
, isl_int
*div
)
5240 unsigned total
= isl_basic_map_total_dim(bmap
);
5242 i
= isl_basic_map_alloc_inequality(bmap
);
5244 return isl_stat_error
;
5245 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5246 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
5247 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5248 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5253 /* For a div d = floor(f/m), add the constraints
5256 * -(f-(m-1)) + m d >= 0
5258 * Note that the second constraint is the negation of
5262 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
5263 unsigned pos
, isl_int
*div
)
5265 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
5267 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
5272 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
5273 unsigned pos
, isl_int
*div
)
5275 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
5279 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
5281 unsigned total
= isl_basic_map_total_dim(bmap
);
5282 unsigned div_pos
= total
- bmap
->n_div
+ div
;
5284 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
5288 /* For each known div d = floor(f/m), add the constraints
5291 * -(f-(m-1)) + m d >= 0
5293 * Remove duplicate constraints in case of some these div constraints
5294 * already appear in "bmap".
5296 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5297 __isl_take isl_basic_map
*bmap
)
5303 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5307 bmap
= add_known_div_constraints(bmap
);
5308 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5309 bmap
= isl_basic_map_finalize(bmap
);
5313 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5315 * In particular, if this div is of the form d = floor(f/m),
5316 * then add the constraint
5320 * if sign < 0 or the constraint
5322 * -(f-(m-1)) + m d >= 0
5326 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
5327 unsigned div
, int sign
)
5335 total
= isl_basic_map_total_dim(bmap
);
5336 div_pos
= total
- bmap
->n_div
+ div
;
5339 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5341 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5344 __isl_give isl_basic_set
*isl_basic_map_underlying_set(
5345 __isl_take isl_basic_map
*bmap
)
5349 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5351 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5352 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5353 return bset_from_bmap(bmap
);
5354 bmap
= isl_basic_map_cow(bmap
);
5357 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5360 bmap
->extra
-= bmap
->n_div
;
5362 bmap
= isl_basic_map_finalize(bmap
);
5363 return bset_from_bmap(bmap
);
5365 isl_basic_map_free(bmap
);
5369 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5370 __isl_take isl_basic_set
*bset
)
5372 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5375 /* Replace each element in "list" by the result of applying
5376 * isl_basic_map_underlying_set to the element.
5378 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5379 __isl_take isl_basic_map_list
*list
)
5386 n
= isl_basic_map_list_n_basic_map(list
);
5387 for (i
= 0; i
< n
; ++i
) {
5388 isl_basic_map
*bmap
;
5389 isl_basic_set
*bset
;
5391 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5392 bset
= isl_basic_set_underlying_set(bmap
);
5393 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5399 __isl_give isl_basic_map
*isl_basic_map_overlying_set(
5400 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_map
*like
)
5402 struct isl_basic_map
*bmap
;
5403 struct isl_ctx
*ctx
;
5410 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5411 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5412 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5414 if (like
->n_div
== 0) {
5415 isl_space
*space
= isl_basic_map_get_space(like
);
5416 isl_basic_map_free(like
);
5417 return isl_basic_map_reset_space(bset
, space
);
5419 bset
= isl_basic_set_cow(bset
);
5422 total
= bset
->dim
->n_out
+ bset
->extra
;
5423 bmap
= bset_to_bmap(bset
);
5424 isl_space_free(bmap
->dim
);
5425 bmap
->dim
= isl_space_copy(like
->dim
);
5428 bmap
->n_div
= like
->n_div
;
5429 bmap
->extra
+= like
->n_div
;
5433 ltotal
= total
- bmap
->extra
+ like
->extra
;
5436 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5437 bmap
->extra
* (1 + 1 + total
));
5438 if (isl_blk_is_error(bmap
->block2
))
5440 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5444 for (i
= 0; i
< bmap
->extra
; ++i
)
5445 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5446 for (i
= 0; i
< like
->n_div
; ++i
) {
5447 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5448 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5450 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5452 isl_basic_map_free(like
);
5453 bmap
= isl_basic_map_simplify(bmap
);
5454 bmap
= isl_basic_map_finalize(bmap
);
5457 isl_basic_map_free(like
);
5458 isl_basic_set_free(bset
);
5462 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5463 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5465 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5466 bset_to_bmap(like
)));
5469 __isl_give isl_set
*isl_map_underlying_set(__isl_take isl_map
*map
)
5473 map
= isl_map_cow(map
);
5476 map
->dim
= isl_space_cow(map
->dim
);
5480 for (i
= 1; i
< map
->n
; ++i
)
5481 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5483 for (i
= 0; i
< map
->n
; ++i
) {
5484 map
->p
[i
] = bset_to_bmap(
5485 isl_basic_map_underlying_set(map
->p
[i
]));
5490 map
->dim
= isl_space_underlying(map
->dim
, 0);
5492 isl_space_free(map
->dim
);
5493 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5497 return set_from_map(map
);
5503 /* Replace the space of "bmap" by "space".
5505 * If the space of "bmap" is identical to "space" (including the identifiers
5506 * of the input and output dimensions), then simply return the original input.
5508 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5509 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5512 isl_space
*bmap_space
;
5514 bmap_space
= isl_basic_map_peek_space(bmap
);
5515 equal
= isl_space_is_equal(bmap_space
, space
);
5516 if (equal
>= 0 && equal
)
5517 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5521 isl_space_free(space
);
5524 bmap
= isl_basic_map_cow(bmap
);
5525 if (!bmap
|| !space
)
5528 isl_space_free(bmap
->dim
);
5531 bmap
= isl_basic_map_finalize(bmap
);
5535 isl_basic_map_free(bmap
);
5536 isl_space_free(space
);
5540 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5541 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5543 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5547 /* Check that the total dimensions of "map" and "space" are the same.
5549 static isl_stat
check_map_space_equal_total_dim(__isl_keep isl_map
*map
,
5550 __isl_keep isl_space
*space
)
5552 unsigned dim1
, dim2
;
5555 return isl_stat_error
;
5556 dim1
= isl_map_dim(map
, isl_dim_all
);
5557 dim2
= isl_space_dim(space
, isl_dim_all
);
5560 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5561 "total dimensions do not match", return isl_stat_error
);
5564 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5565 __isl_take isl_space
*dim
)
5569 map
= isl_map_cow(map
);
5573 for (i
= 0; i
< map
->n
; ++i
) {
5574 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5575 isl_space_copy(dim
));
5579 isl_space_free(map
->dim
);
5585 isl_space_free(dim
);
5589 /* Replace the space of "map" by "space", without modifying
5590 * the dimension of "map".
5592 * If the space of "map" is identical to "space" (including the identifiers
5593 * of the input and output dimensions), then simply return the original input.
5595 __isl_give isl_map
*isl_map_reset_equal_dim_space(__isl_take isl_map
*map
,
5596 __isl_take isl_space
*space
)
5599 isl_space
*map_space
;
5601 map_space
= isl_map_peek_space(map
);
5602 equal
= isl_space_is_equal(map_space
, space
);
5603 if (equal
>= 0 && equal
)
5604 equal
= isl_space_has_equal_ids(map_space
, space
);
5608 isl_space_free(space
);
5611 if (check_map_space_equal_total_dim(map
, space
) < 0)
5613 return isl_map_reset_space(map
, space
);
5616 isl_space_free(space
);
5620 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5621 __isl_take isl_space
*dim
)
5623 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5626 /* Compute the parameter domain of the given basic set.
5628 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5634 is_params
= isl_basic_set_is_params(bset
);
5636 return isl_basic_set_free(bset
);
5640 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5641 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5642 space
= isl_basic_set_get_space(bset
);
5643 space
= isl_space_params(space
);
5644 bset
= isl_basic_set_reset_space(bset
, space
);
5648 /* Construct a zero-dimensional basic set with the given parameter domain.
5650 __isl_give isl_basic_set
*isl_basic_set_from_params(
5651 __isl_take isl_basic_set
*bset
)
5654 space
= isl_basic_set_get_space(bset
);
5655 space
= isl_space_set_from_params(space
);
5656 bset
= isl_basic_set_reset_space(bset
, space
);
5660 /* Compute the parameter domain of the given set.
5662 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5667 if (isl_set_is_params(set
))
5670 n
= isl_set_dim(set
, isl_dim_set
);
5671 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5672 space
= isl_set_get_space(set
);
5673 space
= isl_space_params(space
);
5674 set
= isl_set_reset_space(set
, space
);
5678 /* Construct a zero-dimensional set with the given parameter domain.
5680 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5683 space
= isl_set_get_space(set
);
5684 space
= isl_space_set_from_params(space
);
5685 set
= isl_set_reset_space(set
, space
);
5689 /* Compute the parameter domain of the given map.
5691 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5696 n
= isl_map_dim(map
, isl_dim_in
);
5697 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5698 n
= isl_map_dim(map
, isl_dim_out
);
5699 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5700 space
= isl_map_get_space(map
);
5701 space
= isl_space_params(space
);
5702 map
= isl_map_reset_space(map
, space
);
5706 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5713 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5715 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5716 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5718 return isl_basic_map_reset_space(bmap
, space
);
5721 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5724 return isl_bool_error
;
5725 return isl_space_may_be_set(bmap
->dim
);
5728 /* Is this basic map actually a set?
5729 * Users should never call this function. Outside of isl,
5730 * the type should indicate whether something is a set or a map.
5732 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5735 return isl_bool_error
;
5736 return isl_space_is_set(bmap
->dim
);
5739 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5743 is_set
= isl_basic_map_is_set(bmap
);
5748 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5750 isl_basic_map_free(bmap
);
5754 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5755 __isl_take isl_basic_map
*bmap
)
5759 isl_basic_map
*domain
;
5760 int nparam
, n_in
, n_out
;
5762 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5763 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5764 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5766 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5767 domain
= isl_basic_map_universe(dim
);
5769 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5770 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5771 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5773 for (i
= 0; i
< n_in
; ++i
)
5774 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5777 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5778 return isl_basic_map_finalize(bmap
);
5781 __isl_give isl_basic_map
*isl_basic_map_range_map(
5782 __isl_take isl_basic_map
*bmap
)
5786 isl_basic_map
*range
;
5787 int nparam
, n_in
, n_out
;
5789 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5790 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5791 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5793 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5794 range
= isl_basic_map_universe(dim
);
5796 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5797 bmap
= isl_basic_map_apply_range(bmap
, range
);
5798 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5800 for (i
= 0; i
< n_out
; ++i
)
5801 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5804 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5805 return isl_basic_map_finalize(bmap
);
5808 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5812 return isl_space_may_be_set(map
->dim
);
5815 /* Is this map actually a set?
5816 * Users should never call this function. Outside of isl,
5817 * the type should indicate whether something is a set or a map.
5819 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5822 return isl_bool_error
;
5823 return isl_space_is_set(map
->dim
);
5826 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
5830 struct isl_set
*set
;
5832 is_set
= isl_map_is_set(map
);
5836 return set_from_map(map
);
5838 map
= isl_map_cow(map
);
5842 set
= set_from_map(map
);
5843 set
->dim
= isl_space_range(set
->dim
);
5846 for (i
= 0; i
< map
->n
; ++i
) {
5847 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5851 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5852 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5859 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5863 map
= isl_map_cow(map
);
5867 map
->dim
= isl_space_domain_map(map
->dim
);
5870 for (i
= 0; i
< map
->n
; ++i
) {
5871 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5875 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5876 map
= isl_map_unmark_normalized(map
);
5883 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5886 isl_space
*range_dim
;
5888 map
= isl_map_cow(map
);
5892 range_dim
= isl_space_range(isl_map_get_space(map
));
5893 range_dim
= isl_space_from_range(range_dim
);
5894 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5895 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5898 for (i
= 0; i
< map
->n
; ++i
) {
5899 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5903 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5904 map
= isl_map_unmark_normalized(map
);
5911 /* Given a wrapped map of the form A[B -> C],
5912 * return the map A[B -> C] -> B.
5914 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5921 if (!isl_set_has_tuple_id(set
))
5922 return isl_map_domain_map(isl_set_unwrap(set
));
5924 id
= isl_set_get_tuple_id(set
);
5925 map
= isl_map_domain_map(isl_set_unwrap(set
));
5926 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5931 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5932 __isl_take isl_basic_set
*bset
)
5934 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5937 __isl_give isl_basic_map
*isl_basic_map_from_range(
5938 __isl_take isl_basic_set
*bset
)
5941 space
= isl_basic_set_get_space(bset
);
5942 space
= isl_space_from_range(space
);
5943 bset
= isl_basic_set_reset_space(bset
, space
);
5944 return bset_to_bmap(bset
);
5947 /* Create a relation with the given set as range.
5948 * The domain of the created relation is a zero-dimensional
5949 * flat anonymous space.
5951 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5954 space
= isl_set_get_space(set
);
5955 space
= isl_space_from_range(space
);
5956 set
= isl_set_reset_space(set
, space
);
5957 return set_to_map(set
);
5960 /* Create a relation with the given set as domain.
5961 * The range of the created relation is a zero-dimensional
5962 * flat anonymous space.
5964 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5966 return isl_map_reverse(isl_map_from_range(set
));
5969 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5970 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5972 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5975 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5976 __isl_take isl_set
*range
)
5978 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5981 /* Return a newly allocated isl_map with given space and flags and
5982 * room for "n" basic maps.
5983 * Make sure that all cached information is cleared.
5985 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5988 struct isl_map
*map
;
5993 isl_die(space
->ctx
, isl_error_internal
,
5994 "negative number of basic maps", goto error
);
5995 map
= isl_calloc(space
->ctx
, struct isl_map
,
5996 sizeof(struct isl_map
) +
5997 (n
- 1) * sizeof(struct isl_basic_map
*));
6001 map
->ctx
= space
->ctx
;
6002 isl_ctx_ref(map
->ctx
);
6010 isl_space_free(space
);
6014 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*space
)
6016 struct isl_basic_map
*bmap
;
6017 bmap
= isl_basic_map_alloc_space(space
, 0, 1, 0);
6018 bmap
= isl_basic_map_set_to_empty(bmap
);
6022 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*space
)
6024 struct isl_basic_set
*bset
;
6025 bset
= isl_basic_set_alloc_space(space
, 0, 1, 0);
6026 bset
= isl_basic_set_set_to_empty(bset
);
6030 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*space
)
6032 struct isl_basic_map
*bmap
;
6033 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 0);
6034 bmap
= isl_basic_map_finalize(bmap
);
6038 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*space
)
6040 struct isl_basic_set
*bset
;
6041 bset
= isl_basic_set_alloc_space(space
, 0, 0, 0);
6042 bset
= isl_basic_set_finalize(bset
);
6046 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
6049 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
6050 isl_basic_map
*bmap
;
6052 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
6053 for (i
= 0; i
< total
; ++i
) {
6054 int k
= isl_basic_map_alloc_inequality(bmap
);
6057 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
6058 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
6062 isl_basic_map_free(bmap
);
6066 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
6068 return isl_basic_map_nat_universe(dim
);
6071 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
6073 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
6076 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
6078 return isl_map_nat_universe(dim
);
6081 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*space
)
6083 return isl_map_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6086 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*space
)
6088 return isl_set_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6091 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*space
)
6093 struct isl_map
*map
;
6096 map
= isl_map_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6097 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(space
));
6101 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*space
)
6103 struct isl_set
*set
;
6106 set
= isl_set_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6107 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(space
));
6111 struct isl_map
*isl_map_dup(struct isl_map
*map
)
6114 struct isl_map
*dup
;
6118 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6119 for (i
= 0; i
< map
->n
; ++i
)
6120 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6124 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6125 __isl_take isl_basic_map
*bmap
)
6129 if (isl_basic_map_plain_is_empty(bmap
)) {
6130 isl_basic_map_free(bmap
);
6133 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6134 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6135 map
->p
[map
->n
] = bmap
;
6137 map
= isl_map_unmark_normalized(map
);
6143 isl_basic_map_free(bmap
);
6147 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6158 isl_ctx_deref(map
->ctx
);
6159 for (i
= 0; i
< map
->n
; ++i
)
6160 isl_basic_map_free(map
->p
[i
]);
6161 isl_space_free(map
->dim
);
6167 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
6168 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
6172 bmap
= isl_basic_map_cow(bmap
);
6173 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6174 j
= isl_basic_map_alloc_equality(bmap
);
6177 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6178 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6179 isl_int_set_si(bmap
->eq
[j
][0], value
);
6180 bmap
= isl_basic_map_simplify(bmap
);
6181 return isl_basic_map_finalize(bmap
);
6183 isl_basic_map_free(bmap
);
6187 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6188 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6192 bmap
= isl_basic_map_cow(bmap
);
6193 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6194 j
= isl_basic_map_alloc_equality(bmap
);
6197 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6198 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6199 isl_int_set(bmap
->eq
[j
][0], value
);
6200 bmap
= isl_basic_map_simplify(bmap
);
6201 return isl_basic_map_finalize(bmap
);
6203 isl_basic_map_free(bmap
);
6207 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6208 enum isl_dim_type type
, unsigned pos
, int value
)
6210 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6211 return isl_basic_map_free(bmap
);
6212 return isl_basic_map_fix_pos_si(bmap
,
6213 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6216 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6217 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6219 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6220 return isl_basic_map_free(bmap
);
6221 return isl_basic_map_fix_pos(bmap
,
6222 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6225 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6226 * to be equal to "v".
6228 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6229 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6233 if (!isl_val_is_int(v
))
6234 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6235 "expecting integer value", goto error
);
6236 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6238 pos
+= isl_basic_map_offset(bmap
, type
);
6239 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6243 isl_basic_map_free(bmap
);
6248 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6249 * to be equal to "v".
6251 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6252 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6254 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6257 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6258 enum isl_dim_type type
, unsigned pos
, int value
)
6260 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6264 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6265 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6267 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6271 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6272 unsigned input
, int value
)
6274 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6277 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6278 unsigned dim
, int value
)
6280 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6281 isl_dim_set
, dim
, value
));
6284 /* Remove the basic map at position "i" from "map" if this basic map
6285 * is (obviously) empty.
6287 static __isl_give isl_map
*remove_if_empty(__isl_take isl_map
*map
, int i
)
6294 empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6296 return isl_map_free(map
);
6300 isl_basic_map_free(map
->p
[i
]);
6303 map
->p
[i
] = map
->p
[map
->n
];
6304 map
= isl_map_unmark_normalized(map
);
6311 /* Perform "fn" on each basic map of "map", where we may not be holding
6312 * the only reference to "map".
6313 * In particular, "fn" should be a semantics preserving operation
6314 * that we want to apply to all copies of "map". We therefore need
6315 * to be careful not to modify "map" in a way that breaks "map"
6316 * in case anything goes wrong.
6318 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6319 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6321 struct isl_basic_map
*bmap
;
6327 for (i
= map
->n
- 1; i
>= 0; --i
) {
6328 bmap
= isl_basic_map_copy(map
->p
[i
]);
6332 isl_basic_map_free(map
->p
[i
]);
6334 map
= remove_if_empty(map
, i
);
6345 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6346 enum isl_dim_type type
, unsigned pos
, int value
)
6350 map
= isl_map_cow(map
);
6354 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6355 for (i
= map
->n
- 1; i
>= 0; --i
) {
6356 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6357 map
= remove_if_empty(map
, i
);
6361 map
= isl_map_unmark_normalized(map
);
6368 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6369 enum isl_dim_type type
, unsigned pos
, int value
)
6371 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6374 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6375 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6379 map
= isl_map_cow(map
);
6383 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6384 for (i
= 0; i
< map
->n
; ++i
) {
6385 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6389 map
= isl_map_unmark_normalized(map
);
6396 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6397 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6399 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6402 /* Fix the value of the variable at position "pos" of type "type" of "map"
6403 * to be equal to "v".
6405 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6406 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6410 map
= isl_map_cow(map
);
6414 if (!isl_val_is_int(v
))
6415 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6416 "expecting integer value", goto error
);
6417 if (pos
>= isl_map_dim(map
, type
))
6418 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6419 "index out of bounds", goto error
);
6420 for (i
= map
->n
- 1; i
>= 0; --i
) {
6421 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6423 map
= remove_if_empty(map
, i
);
6427 map
= isl_map_unmark_normalized(map
);
6436 /* Fix the value of the variable at position "pos" of type "type" of "set"
6437 * to be equal to "v".
6439 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6440 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6442 return isl_map_fix_val(set
, type
, pos
, v
);
6445 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6446 unsigned input
, int value
)
6448 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6451 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6453 return set_from_map(isl_map_fix_si(set_to_map(set
),
6454 isl_dim_set
, dim
, value
));
6457 static __isl_give isl_basic_map
*basic_map_bound_si(
6458 __isl_take isl_basic_map
*bmap
,
6459 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6463 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6464 return isl_basic_map_free(bmap
);
6465 pos
+= isl_basic_map_offset(bmap
, type
);
6466 bmap
= isl_basic_map_cow(bmap
);
6467 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6468 j
= isl_basic_map_alloc_inequality(bmap
);
6471 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6473 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6474 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6476 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6477 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6479 bmap
= isl_basic_map_simplify(bmap
);
6480 return isl_basic_map_finalize(bmap
);
6482 isl_basic_map_free(bmap
);
6486 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6487 __isl_take isl_basic_map
*bmap
,
6488 enum isl_dim_type type
, unsigned pos
, int value
)
6490 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6493 /* Constrain the values of the given dimension to be no greater than "value".
6495 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6496 __isl_take isl_basic_map
*bmap
,
6497 enum isl_dim_type type
, unsigned pos
, int value
)
6499 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6502 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6503 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6507 map
= isl_map_cow(map
);
6511 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6512 for (i
= 0; i
< map
->n
; ++i
) {
6513 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6514 type
, pos
, value
, upper
);
6518 map
= isl_map_unmark_normalized(map
);
6525 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6526 enum isl_dim_type type
, unsigned pos
, int value
)
6528 return map_bound_si(map
, type
, pos
, value
, 0);
6531 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6532 enum isl_dim_type type
, unsigned pos
, int value
)
6534 return map_bound_si(map
, type
, pos
, value
, 1);
6537 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6538 enum isl_dim_type type
, unsigned pos
, int value
)
6540 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6544 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6545 enum isl_dim_type type
, unsigned pos
, int value
)
6547 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6550 /* Bound the given variable of "bmap" from below (or above is "upper"
6551 * is set) to "value".
6553 static __isl_give isl_basic_map
*basic_map_bound(
6554 __isl_take isl_basic_map
*bmap
,
6555 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6559 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6560 return isl_basic_map_free(bmap
);
6561 pos
+= isl_basic_map_offset(bmap
, type
);
6562 bmap
= isl_basic_map_cow(bmap
);
6563 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6564 j
= isl_basic_map_alloc_inequality(bmap
);
6567 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6569 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6570 isl_int_set(bmap
->ineq
[j
][0], value
);
6572 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6573 isl_int_neg(bmap
->ineq
[j
][0], value
);
6575 bmap
= isl_basic_map_simplify(bmap
);
6576 return isl_basic_map_finalize(bmap
);
6578 isl_basic_map_free(bmap
);
6582 /* Bound the given variable of "map" from below (or above is "upper"
6583 * is set) to "value".
6585 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6586 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6590 map
= isl_map_cow(map
);
6594 if (pos
>= isl_map_dim(map
, type
))
6595 isl_die(map
->ctx
, isl_error_invalid
,
6596 "index out of bounds", goto error
);
6597 for (i
= map
->n
- 1; i
>= 0; --i
) {
6598 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6599 map
= remove_if_empty(map
, i
);
6603 map
= isl_map_unmark_normalized(map
);
6610 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6611 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6613 return map_bound(map
, type
, pos
, value
, 0);
6616 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6617 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6619 return map_bound(map
, type
, pos
, value
, 1);
6622 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6623 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6625 return isl_map_lower_bound(set
, type
, pos
, value
);
6628 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6629 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6631 return isl_map_upper_bound(set
, type
, pos
, value
);
6634 /* Force the values of the variable at position "pos" of type "type" of "set"
6635 * to be no smaller than "value".
6637 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6638 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6642 if (!isl_val_is_int(value
))
6643 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6644 "expecting integer value", goto error
);
6645 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6646 isl_val_free(value
);
6649 isl_val_free(value
);
6654 /* Force the values of the variable at position "pos" of type "type" of "set"
6655 * to be no greater than "value".
6657 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6658 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6662 if (!isl_val_is_int(value
))
6663 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6664 "expecting integer value", goto error
);
6665 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6666 isl_val_free(value
);
6669 isl_val_free(value
);
6674 /* Bound the given variable of "bset" from below (or above is "upper"
6675 * is set) to "value".
6677 static __isl_give isl_basic_set
*isl_basic_set_bound(
6678 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6679 isl_int value
, int upper
)
6681 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
6682 type
, pos
, value
, upper
));
6685 /* Bound the given variable of "bset" from below (or above is "upper"
6686 * is set) to "value".
6688 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
6689 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6690 __isl_take isl_val
*value
, int upper
)
6694 if (!isl_val_is_int(value
))
6695 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
6696 "expecting integer value", goto error
);
6697 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
6698 isl_val_free(value
);
6701 isl_val_free(value
);
6702 isl_basic_set_free(bset
);
6706 /* Bound the given variable of "bset" from below to "value".
6708 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
6709 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6710 __isl_take isl_val
*value
)
6712 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
6715 /* Bound the given variable of "bset" from above to "value".
6717 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
6718 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6719 __isl_take isl_val
*value
)
6721 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
6724 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6728 map
= isl_map_cow(map
);
6732 map
->dim
= isl_space_reverse(map
->dim
);
6735 for (i
= 0; i
< map
->n
; ++i
) {
6736 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6740 map
= isl_map_unmark_normalized(map
);
6748 #define TYPE isl_pw_multi_aff
6750 #define SUFFIX _pw_multi_aff
6752 #define EMPTY isl_pw_multi_aff_empty
6754 #define ADD isl_pw_multi_aff_union_add
6755 #include "isl_map_lexopt_templ.c"
6757 /* Given a map "map", compute the lexicographically minimal
6758 * (or maximal) image element for each domain element in dom,
6759 * in the form of an isl_pw_multi_aff.
6760 * If "empty" is not NULL, then set *empty to those elements in dom that
6761 * do not have an image element.
6762 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6763 * should be computed over the domain of "map". "empty" is also NULL
6766 * We first compute the lexicographically minimal or maximal element
6767 * in the first basic map. This results in a partial solution "res"
6768 * and a subset "todo" of dom that still need to be handled.
6769 * We then consider each of the remaining maps in "map" and successively
6770 * update both "res" and "todo".
6771 * If "empty" is NULL, then the todo sets are not needed and therefore
6772 * also not computed.
6774 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6775 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6776 __isl_give isl_set
**empty
, unsigned flags
)
6780 isl_pw_multi_aff
*res
;
6783 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6784 if (!map
|| (!full
&& !dom
))
6787 if (isl_map_plain_is_empty(map
)) {
6792 return isl_pw_multi_aff_from_map(map
);
6795 res
= basic_map_partial_lexopt_pw_multi_aff(
6796 isl_basic_map_copy(map
->p
[0]),
6797 isl_set_copy(dom
), empty
, flags
);
6801 for (i
= 1; i
< map
->n
; ++i
) {
6802 isl_pw_multi_aff
*res_i
;
6804 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6805 isl_basic_map_copy(map
->p
[i
]),
6806 isl_set_copy(dom
), empty
, flags
);
6808 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6809 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6811 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6814 todo
= isl_set_intersect(todo
, *empty
);
6833 #define TYPE isl_map
6837 #define EMPTY isl_map_empty
6839 #define ADD isl_map_union_disjoint
6840 #include "isl_map_lexopt_templ.c"
6842 /* Given a map "map", compute the lexicographically minimal
6843 * (or maximal) image element for each domain element in "dom",
6844 * in the form of an isl_map.
6845 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6846 * do not have an image element.
6847 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6848 * should be computed over the domain of "map". "empty" is also NULL
6851 * If the input consists of more than one disjunct, then first
6852 * compute the desired result in the form of an isl_pw_multi_aff and
6853 * then convert that into an isl_map.
6855 * This function used to have an explicit implementation in terms
6856 * of isl_maps, but it would continually intersect the domains of
6857 * partial results with the complement of the domain of the next
6858 * partial solution, potentially leading to an explosion in the number
6859 * of disjuncts if there are several disjuncts in the input.
6860 * An even earlier implementation of this function would look for
6861 * better results in the domain of the partial result and for extra
6862 * results in the complement of this domain, which would lead to
6863 * even more splintering.
6865 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6866 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6867 __isl_give isl_set
**empty
, unsigned flags
)
6870 struct isl_map
*res
;
6871 isl_pw_multi_aff
*pma
;
6873 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6874 if (!map
|| (!full
&& !dom
))
6877 if (isl_map_plain_is_empty(map
)) {
6886 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6892 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6894 return isl_map_from_pw_multi_aff(pma
);
6903 __isl_give isl_map
*isl_map_partial_lexmax(
6904 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6905 __isl_give isl_set
**empty
)
6907 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6910 __isl_give isl_map
*isl_map_partial_lexmin(
6911 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6912 __isl_give isl_set
**empty
)
6914 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6917 __isl_give isl_set
*isl_set_partial_lexmin(
6918 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6919 __isl_give isl_set
**empty
)
6921 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6925 __isl_give isl_set
*isl_set_partial_lexmax(
6926 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6927 __isl_give isl_set
**empty
)
6929 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6933 /* Compute the lexicographic minimum (or maximum if "flags" includes
6934 * ISL_OPT_MAX) of "bset" over its parametric domain.
6936 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6939 return isl_basic_map_lexopt(bset
, flags
);
6942 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6944 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6947 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6949 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6952 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6954 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6957 /* Compute the lexicographic minimum of "bset" over its parametric domain
6958 * for the purpose of quantifier elimination.
6959 * That is, find an explicit representation for all the existentially
6960 * quantified variables in "bset" by computing their lexicographic
6963 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6964 __isl_take isl_basic_set
*bset
)
6966 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6969 /* Given a basic map with one output dimension, compute the minimum or
6970 * maximum of that dimension as an isl_pw_aff.
6972 * Compute the optimum as a lexicographic optimum over the single
6973 * output dimension and extract the single isl_pw_aff from the result.
6975 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6978 isl_pw_multi_aff
*pma
;
6981 bmap
= isl_basic_map_copy(bmap
);
6982 pma
= isl_basic_map_lexopt_pw_multi_aff(bmap
, max
? ISL_OPT_MAX
: 0);
6983 pwaff
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
6984 isl_pw_multi_aff_free(pma
);
6989 /* Compute the minimum or maximum of the given output dimension
6990 * as a function of the parameters and the input dimensions,
6991 * but independently of the other output dimensions.
6993 * We first project out the other output dimension and then compute
6994 * the "lexicographic" maximum in each basic map, combining the results
6995 * using isl_pw_aff_union_max.
6997 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
7004 n_out
= isl_map_dim(map
, isl_dim_out
);
7005 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
7006 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
7011 isl_space
*dim
= isl_map_get_space(map
);
7013 return isl_pw_aff_empty(dim
);
7016 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
7017 for (i
= 1; i
< map
->n
; ++i
) {
7018 isl_pw_aff
*pwaff_i
;
7020 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
7021 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
7029 /* Compute the minimum of the given output dimension as a function of the
7030 * parameters and input dimensions, but independently of
7031 * the other output dimensions.
7033 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
7035 return map_dim_opt(map
, pos
, 0);
7038 /* Compute the maximum of the given output dimension as a function of the
7039 * parameters and input dimensions, but independently of
7040 * the other output dimensions.
7042 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
7044 return map_dim_opt(map
, pos
, 1);
7047 /* Compute the minimum or maximum of the given set dimension
7048 * as a function of the parameters,
7049 * but independently of the other set dimensions.
7051 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
7054 return map_dim_opt(set
, pos
, max
);
7057 /* Compute the maximum of the given set dimension as a function of the
7058 * parameters, but independently of the other set dimensions.
7060 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
7062 return set_dim_opt(set
, pos
, 1);
7065 /* Compute the minimum of the given set dimension as a function of the
7066 * parameters, but independently of the other set dimensions.
7068 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
7070 return set_dim_opt(set
, pos
, 0);
7073 /* Apply a preimage specified by "mat" on the parameters of "bset".
7074 * bset is assumed to have only parameters and divs.
7076 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
7077 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
7084 bset
->dim
= isl_space_cow(bset
->dim
);
7088 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7090 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
7092 bset
->dim
->nparam
= 0;
7093 bset
->dim
->n_out
= nparam
;
7094 bset
= isl_basic_set_preimage(bset
, mat
);
7096 bset
->dim
->nparam
= bset
->dim
->n_out
;
7097 bset
->dim
->n_out
= 0;
7102 isl_basic_set_free(bset
);
7106 /* Apply a preimage specified by "mat" on the parameters of "set".
7107 * set is assumed to have only parameters and divs.
7109 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
7110 __isl_take isl_mat
*mat
)
7118 nparam
= isl_set_dim(set
, isl_dim_param
);
7120 if (mat
->n_row
!= 1 + nparam
)
7121 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
7122 "unexpected number of rows", goto error
);
7124 space
= isl_set_get_space(set
);
7125 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7126 isl_dim_param
, 0, nparam
);
7127 set
= isl_set_reset_space(set
, space
);
7128 set
= isl_set_preimage(set
, mat
);
7129 nparam
= isl_set_dim(set
, isl_dim_out
);
7130 space
= isl_set_get_space(set
);
7131 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7132 isl_dim_out
, 0, nparam
);
7133 set
= isl_set_reset_space(set
, space
);
7141 /* Intersect the basic set "bset" with the affine space specified by the
7142 * equalities in "eq".
7144 static __isl_give isl_basic_set
*basic_set_append_equalities(
7145 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7153 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7158 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7159 for (i
= 0; i
< eq
->n_row
; ++i
) {
7160 k
= isl_basic_set_alloc_equality(bset
);
7163 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7164 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7168 bset
= isl_basic_set_gauss(bset
, NULL
);
7169 bset
= isl_basic_set_finalize(bset
);
7174 isl_basic_set_free(bset
);
7178 /* Intersect the set "set" with the affine space specified by the
7179 * equalities in "eq".
7181 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7189 for (i
= 0; i
< set
->n
; ++i
) {
7190 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7203 /* Given a basic set "bset" that only involves parameters and existentially
7204 * quantified variables, return the index of the first equality
7205 * that only involves parameters. If there is no such equality then
7206 * return bset->n_eq.
7208 * This function assumes that isl_basic_set_gauss has been called on "bset".
7210 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7213 unsigned nparam
, n_div
;
7218 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7219 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7221 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7222 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7229 /* Compute an explicit representation for the existentially quantified
7230 * variables in "bset" by computing the "minimal value" of the set
7231 * variables. Since there are no set variables, the computation of
7232 * the minimal value essentially computes an explicit representation
7233 * of the non-empty part(s) of "bset".
7235 * The input only involves parameters and existentially quantified variables.
7236 * All equalities among parameters have been removed.
7238 * Since the existentially quantified variables in the result are in general
7239 * going to be different from those in the input, we first replace
7240 * them by the minimal number of variables based on their equalities.
7241 * This should simplify the parametric integer programming.
7243 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7245 isl_morph
*morph1
, *morph2
;
7251 if (bset
->n_eq
== 0)
7252 return isl_basic_set_lexmin_compute_divs(bset
);
7254 morph1
= isl_basic_set_parameter_compression(bset
);
7255 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7256 bset
= isl_basic_set_lift(bset
);
7257 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7258 bset
= isl_morph_basic_set(morph2
, bset
);
7259 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7260 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7262 set
= isl_basic_set_lexmin_compute_divs(bset
);
7264 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7269 /* Project the given basic set onto its parameter domain, possibly introducing
7270 * new, explicit, existential variables in the constraints.
7271 * The input has parameters and (possibly implicit) existential variables.
7272 * The output has the same parameters, but only
7273 * explicit existentially quantified variables.
7275 * The actual projection is performed by pip, but pip doesn't seem
7276 * to like equalities very much, so we first remove the equalities
7277 * among the parameters by performing a variable compression on
7278 * the parameters. Afterward, an inverse transformation is performed
7279 * and the equalities among the parameters are inserted back in.
7281 * The variable compression on the parameters may uncover additional
7282 * equalities that were only implicit before. We therefore check
7283 * if there are any new parameter equalities in the result and
7284 * if so recurse. The removal of parameter equalities is required
7285 * for the parameter compression performed by base_compute_divs.
7287 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7291 struct isl_mat
*T
, *T2
;
7292 struct isl_set
*set
;
7295 bset
= isl_basic_set_cow(bset
);
7299 if (bset
->n_eq
== 0)
7300 return base_compute_divs(bset
);
7302 bset
= isl_basic_set_gauss(bset
, NULL
);
7305 if (isl_basic_set_plain_is_empty(bset
))
7306 return isl_set_from_basic_set(bset
);
7308 i
= first_parameter_equality(bset
);
7309 if (i
== bset
->n_eq
)
7310 return base_compute_divs(bset
);
7312 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7313 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7315 eq
= isl_mat_cow(eq
);
7316 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7317 if (T
&& T
->n_col
== 0) {
7321 bset
= isl_basic_set_set_to_empty(bset
);
7322 return isl_set_from_basic_set(bset
);
7324 bset
= basic_set_parameter_preimage(bset
, T
);
7326 i
= first_parameter_equality(bset
);
7329 else if (i
== bset
->n_eq
)
7330 set
= base_compute_divs(bset
);
7332 set
= parameter_compute_divs(bset
);
7333 set
= set_parameter_preimage(set
, T2
);
7334 set
= set_append_equalities(set
, eq
);
7338 /* Insert the divs from "ls" before those of "bmap".
7340 * The number of columns is not changed, which means that the last
7341 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7342 * The caller is responsible for removing the same number of dimensions
7343 * from the space of "bmap".
7345 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7346 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7352 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7356 old_n_div
= bmap
->n_div
;
7357 bmap
= insert_div_rows(bmap
, n_div
);
7361 for (i
= 0; i
< n_div
; ++i
) {
7362 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7363 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7369 /* Replace the space of "bmap" by the space and divs of "ls".
7371 * If "ls" has any divs, then we simplify the result since we may
7372 * have discovered some additional equalities that could simplify
7373 * the div expressions.
7375 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7376 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7380 bmap
= isl_basic_map_cow(bmap
);
7384 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7385 bmap
= insert_divs_from_local_space(bmap
, ls
);
7389 isl_space_free(bmap
->dim
);
7390 bmap
->dim
= isl_local_space_get_space(ls
);
7394 isl_local_space_free(ls
);
7396 bmap
= isl_basic_map_simplify(bmap
);
7397 bmap
= isl_basic_map_finalize(bmap
);
7400 isl_basic_map_free(bmap
);
7401 isl_local_space_free(ls
);
7405 /* Replace the space of "map" by the space and divs of "ls".
7407 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7408 __isl_take isl_local_space
*ls
)
7412 map
= isl_map_cow(map
);
7416 for (i
= 0; i
< map
->n
; ++i
) {
7417 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7418 isl_local_space_copy(ls
));
7422 isl_space_free(map
->dim
);
7423 map
->dim
= isl_local_space_get_space(ls
);
7427 isl_local_space_free(ls
);
7430 isl_local_space_free(ls
);
7435 /* Compute an explicit representation for the existentially
7436 * quantified variables for which do not know any explicit representation yet.
7438 * We first sort the existentially quantified variables so that the
7439 * existentially quantified variables for which we already have an explicit
7440 * representation are placed before those for which we do not.
7441 * The input dimensions, the output dimensions and the existentially
7442 * quantified variables for which we already have an explicit
7443 * representation are then turned into parameters.
7444 * compute_divs returns a map with the same parameters and
7445 * no input or output dimensions and the dimension specification
7446 * is reset to that of the input, including the existentially quantified
7447 * variables for which we already had an explicit representation.
7449 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
7451 struct isl_basic_set
*bset
;
7452 struct isl_set
*set
;
7453 struct isl_map
*map
;
7455 isl_local_space
*ls
;
7462 bmap
= isl_basic_map_sort_divs(bmap
);
7463 bmap
= isl_basic_map_cow(bmap
);
7467 n_known
= isl_basic_map_first_unknown_div(bmap
);
7469 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7471 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7472 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7473 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7474 dim
= isl_space_set_alloc(bmap
->ctx
,
7475 nparam
+ n_in
+ n_out
+ n_known
, 0);
7479 ls
= isl_basic_map_get_local_space(bmap
);
7480 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7481 n_known
, bmap
->n_div
- n_known
);
7483 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7484 swap_div(bmap
, i
- n_known
, i
);
7485 bmap
->n_div
-= n_known
;
7486 bmap
->extra
-= n_known
;
7488 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7489 bset
= bset_from_bmap(bmap
);
7491 set
= parameter_compute_divs(bset
);
7492 map
= set_to_map(set
);
7493 map
= replace_space_by_local_space(map
, ls
);
7497 isl_basic_map_free(bmap
);
7501 /* Remove the explicit representation of local variable "div",
7504 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7505 __isl_take isl_basic_map
*bmap
, int div
)
7509 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7511 return isl_basic_map_free(bmap
);
7515 bmap
= isl_basic_map_cow(bmap
);
7518 isl_int_set_si(bmap
->div
[div
][0], 0);
7522 /* Is local variable "div" of "bmap" marked as not having an explicit
7524 * Note that even if "div" is not marked in this way and therefore
7525 * has an explicit representation, this representation may still
7526 * depend (indirectly) on other local variables that do not
7527 * have an explicit representation.
7529 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7532 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7533 return isl_bool_error
;
7534 return isl_int_is_zero(bmap
->div
[div
][0]);
7537 /* Return the position of the first local variable that does not
7538 * have an explicit representation.
7539 * Return the total number of local variables if they all have
7540 * an explicit representation.
7541 * Return -1 on error.
7543 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7550 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7551 if (!isl_basic_map_div_is_known(bmap
, i
))
7557 /* Return the position of the first local variable that does not
7558 * have an explicit representation.
7559 * Return the total number of local variables if they all have
7560 * an explicit representation.
7561 * Return -1 on error.
7563 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7565 return isl_basic_map_first_unknown_div(bset
);
7568 /* Does "bmap" have an explicit representation for all local variables?
7570 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7574 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7575 first
= isl_basic_map_first_unknown_div(bmap
);
7577 return isl_bool_error
;
7581 /* Do all basic maps in "map" have an explicit representation
7582 * for all local variables?
7584 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7589 return isl_bool_error
;
7591 for (i
= 0; i
< map
->n
; ++i
) {
7592 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7597 return isl_bool_true
;
7600 /* If bmap contains any unknown divs, then compute explicit
7601 * expressions for them. However, this computation may be
7602 * quite expensive, so first try to remove divs that aren't
7605 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7608 struct isl_map
*map
;
7610 known
= isl_basic_map_divs_known(bmap
);
7614 return isl_map_from_basic_map(bmap
);
7616 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7618 known
= isl_basic_map_divs_known(bmap
);
7622 return isl_map_from_basic_map(bmap
);
7624 map
= compute_divs(bmap
);
7627 isl_basic_map_free(bmap
);
7631 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
7635 struct isl_map
*res
;
7642 known
= isl_map_divs_known(map
);
7650 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7651 for (i
= 1 ; i
< map
->n
; ++i
) {
7653 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7654 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7655 res
= isl_map_union_disjoint(res
, r2
);
7657 res
= isl_map_union(res
, r2
);
7664 __isl_give isl_set
*isl_basic_set_compute_divs(__isl_take isl_basic_set
*bset
)
7666 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7669 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7671 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7674 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
7677 struct isl_set
*set
;
7682 map
= isl_map_cow(map
);
7686 set
= set_from_map(map
);
7687 set
->dim
= isl_space_domain(set
->dim
);
7690 for (i
= 0; i
< map
->n
; ++i
) {
7691 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7695 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7696 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7703 /* Return the union of "map1" and "map2", where we assume for now that
7704 * "map1" and "map2" are disjoint. Note that the basic maps inside
7705 * "map1" or "map2" may not be disjoint from each other.
7706 * Also note that this function is also called from isl_map_union,
7707 * which takes care of handling the situation where "map1" and "map2"
7708 * may not be disjoint.
7710 * If one of the inputs is empty, we can simply return the other input.
7711 * Similarly, if one of the inputs is universal, then it is equal to the union.
7713 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7714 __isl_take isl_map
*map2
)
7718 struct isl_map
*map
= NULL
;
7724 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7725 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7726 "spaces don't match", goto error
);
7737 is_universe
= isl_map_plain_is_universe(map1
);
7738 if (is_universe
< 0)
7745 is_universe
= isl_map_plain_is_universe(map2
);
7746 if (is_universe
< 0)
7753 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7754 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7755 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7757 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7758 map1
->n
+ map2
->n
, flags
);
7761 for (i
= 0; i
< map1
->n
; ++i
) {
7762 map
= isl_map_add_basic_map(map
,
7763 isl_basic_map_copy(map1
->p
[i
]));
7767 for (i
= 0; i
< map2
->n
; ++i
) {
7768 map
= isl_map_add_basic_map(map
,
7769 isl_basic_map_copy(map2
->p
[i
]));
7783 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7784 * guaranteed to be disjoint by the caller.
7786 * Note that this functions is called from within isl_map_make_disjoint,
7787 * so we have to be careful not to touch the constraints of the inputs
7790 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7791 __isl_take isl_map
*map2
)
7793 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7796 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7797 * not be disjoint. The parameters are assumed to have been aligned.
7799 * We currently simply call map_union_disjoint, the internal operation
7800 * of which does not really depend on the inputs being disjoint.
7801 * If the result contains more than one basic map, then we clear
7802 * the disjoint flag since the result may contain basic maps from
7803 * both inputs and these are not guaranteed to be disjoint.
7805 * As a special case, if "map1" and "map2" are obviously equal,
7806 * then we simply return "map1".
7808 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7809 __isl_take isl_map
*map2
)
7816 equal
= isl_map_plain_is_equal(map1
, map2
);
7824 map1
= map_union_disjoint(map1
, map2
);
7828 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7836 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7839 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7840 __isl_take isl_map
*map2
)
7842 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7845 __isl_give isl_set
*isl_set_union_disjoint(
7846 __isl_take isl_set
*set1
, __isl_take isl_set
*set2
)
7848 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7852 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7854 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7857 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7860 * "map" and "set" are assumed to be compatible and non-NULL.
7862 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7863 __isl_take isl_set
*set
,
7864 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7865 __isl_take isl_basic_set
*bset
))
7868 struct isl_map
*result
;
7871 if (isl_set_plain_is_universe(set
)) {
7876 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7877 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7878 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7880 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7881 map
->n
* set
->n
, flags
);
7882 for (i
= 0; result
&& i
< map
->n
; ++i
)
7883 for (j
= 0; j
< set
->n
; ++j
) {
7884 result
= isl_map_add_basic_map(result
,
7885 fn(isl_basic_map_copy(map
->p
[i
]),
7886 isl_basic_set_copy(set
->p
[j
])));
7896 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7897 __isl_take isl_set
*set
)
7901 ok
= isl_map_compatible_range(map
, set
);
7905 isl_die(set
->ctx
, isl_error_invalid
,
7906 "incompatible spaces", goto error
);
7908 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7915 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7916 __isl_take isl_set
*set
)
7918 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7921 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7922 __isl_take isl_set
*set
)
7926 ok
= isl_map_compatible_domain(map
, set
);
7930 isl_die(set
->ctx
, isl_error_invalid
,
7931 "incompatible spaces", goto error
);
7933 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7940 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7941 __isl_take isl_set
*set
)
7943 return isl_map_align_params_map_map_and(map
, set
,
7944 &map_intersect_domain
);
7947 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7948 * in the space B -> C, return the intersection.
7949 * The parameters are assumed to have been aligned.
7951 * The map "factor" is first extended to a map living in the space
7952 * [A -> B] -> C and then a regular intersection is computed.
7954 static __isl_give isl_map
*map_intersect_domain_factor_range(
7955 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7958 isl_map
*ext_factor
;
7960 space
= isl_space_domain_factor_domain(isl_map_get_space(map
));
7961 ext_factor
= isl_map_universe(space
);
7962 ext_factor
= isl_map_domain_product(ext_factor
, factor
);
7963 return map_intersect(map
, ext_factor
);
7966 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7967 * in the space B -> C, return the intersection.
7969 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
7970 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7972 return isl_map_align_params_map_map_and(map
, factor
,
7973 &map_intersect_domain_factor_range
);
7976 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7977 * in the space A -> C, return the intersection.
7979 * The map "factor" is first extended to a map living in the space
7980 * A -> [B -> C] and then a regular intersection is computed.
7982 static __isl_give isl_map
*map_intersect_range_factor_range(
7983 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7986 isl_map
*ext_factor
;
7988 space
= isl_space_range_factor_domain(isl_map_get_space(map
));
7989 ext_factor
= isl_map_universe(space
);
7990 ext_factor
= isl_map_range_product(ext_factor
, factor
);
7991 return isl_map_intersect(map
, ext_factor
);
7994 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7995 * in the space A -> C, return the intersection.
7997 __isl_give isl_map
*isl_map_intersect_range_factor_range(
7998 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
8000 return isl_map_align_params_map_map_and(map
, factor
,
8001 &map_intersect_range_factor_range
);
8004 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
8005 __isl_take isl_map
*map2
)
8009 map1
= isl_map_reverse(map1
);
8010 map1
= isl_map_apply_range(map1
, map2
);
8011 return isl_map_reverse(map1
);
8018 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
8019 __isl_take isl_map
*map2
)
8021 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
8024 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
8025 __isl_take isl_map
*map2
)
8027 isl_space
*dim_result
;
8028 struct isl_map
*result
;
8034 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
8035 isl_space_copy(map2
->dim
));
8037 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
8040 for (i
= 0; i
< map1
->n
; ++i
)
8041 for (j
= 0; j
< map2
->n
; ++j
) {
8042 result
= isl_map_add_basic_map(result
,
8043 isl_basic_map_apply_range(
8044 isl_basic_map_copy(map1
->p
[i
]),
8045 isl_basic_map_copy(map2
->p
[j
])));
8051 if (result
&& result
->n
<= 1)
8052 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
8060 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
8061 __isl_take isl_map
*map2
)
8063 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
8067 * returns range - domain
8069 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
8071 isl_space
*target_space
;
8072 struct isl_basic_set
*bset
;
8079 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8080 bmap
->dim
, isl_dim_out
),
8082 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
8083 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
8084 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8085 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
8086 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
8087 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
8088 for (i
= 0; i
< dim
; ++i
) {
8089 int j
= isl_basic_map_alloc_equality(bmap
);
8091 bmap
= isl_basic_map_free(bmap
);
8094 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8095 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8096 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
8097 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
8099 bset
= isl_basic_map_domain(bmap
);
8100 bset
= isl_basic_set_reset_space(bset
, target_space
);
8103 isl_basic_map_free(bmap
);
8108 * returns range - domain
8110 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8114 struct isl_set
*result
;
8119 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8120 map
->dim
, isl_dim_out
),
8122 dim
= isl_map_get_space(map
);
8123 dim
= isl_space_domain(dim
);
8124 result
= isl_set_alloc_space(dim
, map
->n
, 0);
8127 for (i
= 0; i
< map
->n
; ++i
)
8128 result
= isl_set_add_basic_set(result
,
8129 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8138 * returns [domain -> range] -> range - domain
8140 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8141 __isl_take isl_basic_map
*bmap
)
8145 isl_basic_map
*domain
;
8149 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8150 bmap
->dim
, isl_dim_out
))
8151 isl_die(bmap
->ctx
, isl_error_invalid
,
8152 "domain and range don't match", goto error
);
8154 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8155 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8157 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
8158 domain
= isl_basic_map_universe(dim
);
8160 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8161 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8162 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8164 total
= isl_basic_map_total_dim(bmap
);
8166 for (i
= 0; i
< n
; ++i
) {
8167 k
= isl_basic_map_alloc_equality(bmap
);
8170 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8171 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8172 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8173 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8176 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8177 return isl_basic_map_finalize(bmap
);
8179 isl_basic_map_free(bmap
);
8184 * returns [domain -> range] -> range - domain
8186 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8189 isl_space
*domain_dim
;
8194 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8195 map
->dim
, isl_dim_out
))
8196 isl_die(map
->ctx
, isl_error_invalid
,
8197 "domain and range don't match", goto error
);
8199 map
= isl_map_cow(map
);
8203 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
8204 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
8205 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
8208 for (i
= 0; i
< map
->n
; ++i
) {
8209 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8213 map
= isl_map_unmark_normalized(map
);
8220 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
8222 struct isl_basic_map
*bmap
;
8230 nparam
= dims
->nparam
;
8232 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
8236 for (i
= 0; i
< dim
; ++i
) {
8237 int j
= isl_basic_map_alloc_equality(bmap
);
8240 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8241 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8242 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
8244 return isl_basic_map_finalize(bmap
);
8246 isl_basic_map_free(bmap
);
8250 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
8254 if (dim
->n_in
!= dim
->n_out
)
8255 isl_die(dim
->ctx
, isl_error_invalid
,
8256 "number of input and output dimensions needs to be "
8257 "the same", goto error
);
8258 return basic_map_identity(dim
);
8260 isl_space_free(dim
);
8264 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8266 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8269 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8271 isl_space
*dim
= isl_set_get_space(set
);
8273 id
= isl_map_identity(isl_space_map_from_set(dim
));
8274 return isl_map_intersect_range(id
, set
);
8277 /* Construct a basic set with all set dimensions having only non-negative
8280 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8281 __isl_take isl_space
*space
)
8286 struct isl_basic_set
*bset
;
8290 nparam
= space
->nparam
;
8292 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8295 for (i
= 0; i
< dim
; ++i
) {
8296 int k
= isl_basic_set_alloc_inequality(bset
);
8299 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8300 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8304 isl_basic_set_free(bset
);
8308 /* Construct the half-space x_pos >= 0.
8310 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
8314 isl_basic_set
*nonneg
;
8316 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8317 k
= isl_basic_set_alloc_inequality(nonneg
);
8320 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8321 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8323 return isl_basic_set_finalize(nonneg
);
8325 isl_basic_set_free(nonneg
);
8329 /* Construct the half-space x_pos <= -1.
8331 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
8336 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8337 k
= isl_basic_set_alloc_inequality(neg
);
8340 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8341 isl_int_set_si(neg
->ineq
[k
][0], -1);
8342 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8344 return isl_basic_set_finalize(neg
);
8346 isl_basic_set_free(neg
);
8350 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8351 enum isl_dim_type type
, unsigned first
, unsigned n
)
8355 isl_basic_set
*nonneg
;
8363 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8365 offset
= pos(set
->dim
, type
);
8366 for (i
= 0; i
< n
; ++i
) {
8367 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8368 offset
+ first
+ i
);
8369 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8371 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8380 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8382 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8388 return isl_stat_error
;
8389 if (isl_set_plain_is_empty(set
)) {
8394 return fn(set
, signs
, user
);
8397 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8399 half
= isl_set_intersect(half
, isl_set_copy(set
));
8400 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8404 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8406 half
= isl_set_intersect(half
, set
);
8407 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8410 return isl_stat_error
;
8413 /* Call "fn" on the intersections of "set" with each of the orthants
8414 * (except for obviously empty intersections). The orthant is identified
8415 * by the signs array, with each entry having value 1 or -1 according
8416 * to the sign of the corresponding variable.
8418 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8419 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8428 return isl_stat_error
;
8429 if (isl_set_plain_is_empty(set
))
8432 nparam
= isl_set_dim(set
, isl_dim_param
);
8433 nvar
= isl_set_dim(set
, isl_dim_set
);
8435 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8437 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8445 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8447 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8450 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8451 __isl_keep isl_basic_map
*bmap2
)
8454 struct isl_map
*map1
;
8455 struct isl_map
*map2
;
8457 if (!bmap1
|| !bmap2
)
8458 return isl_bool_error
;
8460 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8461 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8463 is_subset
= isl_map_is_subset(map1
, map2
);
8471 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8472 __isl_keep isl_basic_set
*bset2
)
8474 return isl_basic_map_is_subset(bset1
, bset2
);
8477 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8478 __isl_keep isl_basic_map
*bmap2
)
8482 if (!bmap1
|| !bmap2
)
8483 return isl_bool_error
;
8484 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8485 if (is_subset
!= isl_bool_true
)
8487 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8491 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8492 __isl_keep isl_basic_set
*bset2
)
8494 return isl_basic_map_is_equal(
8495 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8498 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8504 return isl_bool_error
;
8505 for (i
= 0; i
< map
->n
; ++i
) {
8506 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8508 return isl_bool_error
;
8510 return isl_bool_false
;
8512 return isl_bool_true
;
8515 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8517 return map
? map
->n
== 0 : isl_bool_error
;
8520 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8522 return set
? set
->n
== 0 : isl_bool_error
;
8525 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8527 return isl_map_is_empty(set_to_map(set
));
8530 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8531 __isl_keep isl_map
*map2
)
8534 return isl_bool_error
;
8536 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8539 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8540 __isl_keep isl_set
*set2
)
8543 return isl_bool_error
;
8545 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8548 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8553 return isl_bool_error
;
8554 is_subset
= isl_map_is_subset(map1
, map2
);
8555 if (is_subset
!= isl_bool_true
)
8557 is_subset
= isl_map_is_subset(map2
, map1
);
8561 /* Is "map1" equal to "map2"?
8563 * First check if they are obviously equal.
8564 * If not, then perform a more detailed analysis.
8566 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8570 equal
= isl_map_plain_is_equal(map1
, map2
);
8571 if (equal
< 0 || equal
)
8573 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8576 isl_bool
isl_basic_map_is_strict_subset(
8577 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8581 if (!bmap1
|| !bmap2
)
8582 return isl_bool_error
;
8583 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8584 if (is_subset
!= isl_bool_true
)
8586 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8587 if (is_subset
== isl_bool_error
)
8592 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8593 __isl_keep isl_map
*map2
)
8598 return isl_bool_error
;
8599 is_subset
= isl_map_is_subset(map1
, map2
);
8600 if (is_subset
!= isl_bool_true
)
8602 is_subset
= isl_map_is_subset(map2
, map1
);
8603 if (is_subset
== isl_bool_error
)
8608 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8609 __isl_keep isl_set
*set2
)
8611 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8614 /* Is "bmap" obviously equal to the universe with the same space?
8616 * That is, does it not have any constraints?
8618 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8621 return isl_bool_error
;
8622 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8625 /* Is "bset" obviously equal to the universe with the same space?
8627 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8629 return isl_basic_map_plain_is_universe(bset
);
8632 /* If "c" does not involve any existentially quantified variables,
8633 * then set *univ to false and abort
8635 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8637 isl_bool
*univ
= user
;
8640 n
= isl_constraint_dim(c
, isl_dim_div
);
8641 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8642 isl_constraint_free(c
);
8643 if (*univ
< 0 || !*univ
)
8644 return isl_stat_error
;
8648 /* Is "bmap" equal to the universe with the same space?
8650 * First check if it is obviously equal to the universe.
8651 * If not and if there are any constraints not involving
8652 * existentially quantified variables, then it is certainly
8653 * not equal to the universe.
8654 * Otherwise, check if the universe is a subset of "bmap".
8656 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8659 isl_basic_map
*test
;
8661 univ
= isl_basic_map_plain_is_universe(bmap
);
8662 if (univ
< 0 || univ
)
8664 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8665 return isl_bool_false
;
8666 univ
= isl_bool_true
;
8667 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8669 return isl_bool_error
;
8670 if (univ
< 0 || !univ
)
8672 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8673 univ
= isl_basic_map_is_subset(test
, bmap
);
8674 isl_basic_map_free(test
);
8678 /* Is "bset" equal to the universe with the same space?
8680 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8682 return isl_basic_map_is_universe(bset
);
8685 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8690 return isl_bool_error
;
8692 for (i
= 0; i
< map
->n
; ++i
) {
8693 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8698 return isl_bool_false
;
8701 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8703 return isl_map_plain_is_universe(set_to_map(set
));
8706 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8708 struct isl_basic_set
*bset
= NULL
;
8709 struct isl_vec
*sample
= NULL
;
8710 isl_bool empty
, non_empty
;
8713 return isl_bool_error
;
8715 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8716 return isl_bool_true
;
8718 if (isl_basic_map_plain_is_universe(bmap
))
8719 return isl_bool_false
;
8721 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8722 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8723 copy
= isl_basic_map_remove_redundancies(copy
);
8724 empty
= isl_basic_map_plain_is_empty(copy
);
8725 isl_basic_map_free(copy
);
8729 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8731 return isl_bool_error
;
8733 return isl_bool_false
;
8734 isl_vec_free(bmap
->sample
);
8735 bmap
->sample
= NULL
;
8736 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8738 return isl_bool_error
;
8739 sample
= isl_basic_set_sample_vec(bset
);
8741 return isl_bool_error
;
8742 empty
= sample
->size
== 0;
8743 isl_vec_free(bmap
->sample
);
8744 bmap
->sample
= sample
;
8746 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8751 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8754 return isl_bool_error
;
8755 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8758 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8761 return isl_bool_error
;
8762 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8765 /* Is "bmap" known to be non-empty?
8767 * That is, is the cached sample still valid?
8769 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8774 return isl_bool_error
;
8776 return isl_bool_false
;
8777 total
= 1 + isl_basic_map_total_dim(bmap
);
8778 if (bmap
->sample
->size
!= total
)
8779 return isl_bool_false
;
8780 return isl_basic_map_contains(bmap
, bmap
->sample
);
8783 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8785 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8788 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8789 __isl_take isl_basic_map
*bmap2
)
8791 struct isl_map
*map
;
8792 if (!bmap1
|| !bmap2
)
8795 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8797 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8800 map
= isl_map_add_basic_map(map
, bmap1
);
8801 map
= isl_map_add_basic_map(map
, bmap2
);
8804 isl_basic_map_free(bmap1
);
8805 isl_basic_map_free(bmap2
);
8809 struct isl_set
*isl_basic_set_union(
8810 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8812 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8813 bset_to_bmap(bset2
)));
8816 /* Order divs such that any div only depends on previous divs */
8817 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8818 __isl_take isl_basic_map
*bmap
)
8826 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8828 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8830 if (isl_int_is_zero(bmap
->div
[i
][0]))
8832 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8837 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8838 "integer division depends on itself",
8839 return isl_basic_map_free(bmap
));
8840 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8846 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8848 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8851 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8858 for (i
= 0; i
< map
->n
; ++i
) {
8859 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8870 /* Sort the local variables of "bset".
8872 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8873 __isl_take isl_basic_set
*bset
)
8875 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8878 /* Apply the expansion computed by isl_merge_divs.
8879 * The expansion itself is given by "exp" while the resulting
8880 * list of divs is given by "div".
8882 * Move the integer divisions of "bmap" into the right position
8883 * according to "exp" and then introduce the additional integer
8884 * divisions, adding div constraints.
8885 * The moving should be done first to avoid moving coefficients
8886 * in the definitions of the extra integer divisions.
8888 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8889 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8894 bmap
= isl_basic_map_cow(bmap
);
8898 if (div
->n_row
< bmap
->n_div
)
8899 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8900 "not an expansion", goto error
);
8902 n_div
= bmap
->n_div
;
8903 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8904 div
->n_row
- n_div
, 0,
8905 2 * (div
->n_row
- n_div
));
8907 for (i
= n_div
; i
< div
->n_row
; ++i
)
8908 if (isl_basic_map_alloc_div(bmap
) < 0)
8911 for (j
= n_div
- 1; j
>= 0; --j
) {
8914 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8917 for (i
= 0; i
< div
->n_row
; ++i
) {
8918 if (j
< n_div
&& exp
[j
] == i
) {
8921 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8922 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8924 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8932 isl_basic_map_free(bmap
);
8937 /* Apply the expansion computed by isl_merge_divs.
8938 * The expansion itself is given by "exp" while the resulting
8939 * list of divs is given by "div".
8941 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8942 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8944 return isl_basic_map_expand_divs(bset
, div
, exp
);
8947 /* Look for a div in dst that corresponds to the div "div" in src.
8948 * The divs before "div" in src and dst are assumed to be the same.
8950 * Returns -1 if no corresponding div was found and the position
8951 * of the corresponding div in dst otherwise.
8953 static int find_div(__isl_keep isl_basic_map
*dst
,
8954 __isl_keep isl_basic_map
*src
, unsigned div
)
8958 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8960 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8961 for (i
= div
; i
< dst
->n_div
; ++i
)
8962 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8963 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8964 dst
->n_div
- div
) == -1)
8969 /* Align the divs of "dst" to those of "src", adding divs from "src"
8970 * if needed. That is, make sure that the first src->n_div divs
8971 * of the result are equal to those of src.
8973 * The result is not finalized as by design it will have redundant
8974 * divs if any divs from "src" were copied.
8976 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8977 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8980 int known
, extended
;
8984 return isl_basic_map_free(dst
);
8986 if (src
->n_div
== 0)
8989 known
= isl_basic_map_divs_known(src
);
8991 return isl_basic_map_free(dst
);
8993 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8994 "some src divs are unknown",
8995 return isl_basic_map_free(dst
));
8997 src
= isl_basic_map_order_divs(src
);
9000 total
= isl_space_dim(src
->dim
, isl_dim_all
);
9001 for (i
= 0; i
< src
->n_div
; ++i
) {
9002 int j
= find_div(dst
, src
, i
);
9005 int extra
= src
->n_div
- i
;
9006 dst
= isl_basic_map_cow(dst
);
9009 dst
= isl_basic_map_extend_space(dst
,
9010 isl_space_copy(dst
->dim
),
9011 extra
, 0, 2 * extra
);
9014 j
= isl_basic_map_alloc_div(dst
);
9016 return isl_basic_map_free(dst
);
9017 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
9018 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
9019 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
9020 return isl_basic_map_free(dst
);
9023 isl_basic_map_swap_div(dst
, i
, j
);
9028 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
9036 map
= isl_map_compute_divs(map
);
9037 map
= isl_map_cow(map
);
9041 for (i
= 1; i
< map
->n
; ++i
)
9042 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
9043 for (i
= 1; i
< map
->n
; ++i
) {
9044 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
9046 return isl_map_free(map
);
9049 map
= isl_map_unmark_normalized(map
);
9053 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
9055 return isl_map_align_divs_internal(map
);
9058 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
9060 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
9063 /* Align the divs of the basic maps in "map" to those
9064 * of the basic maps in "list", as well as to the other basic maps in "map".
9065 * The elements in "list" are assumed to have known divs.
9067 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
9068 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
9072 map
= isl_map_compute_divs(map
);
9073 map
= isl_map_cow(map
);
9075 return isl_map_free(map
);
9079 n
= isl_basic_map_list_n_basic_map(list
);
9080 for (i
= 0; i
< n
; ++i
) {
9081 isl_basic_map
*bmap
;
9083 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
9084 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
9085 isl_basic_map_free(bmap
);
9088 return isl_map_free(map
);
9090 return isl_map_align_divs_internal(map
);
9093 /* Align the divs of each element of "list" to those of "bmap".
9094 * Both "bmap" and the elements of "list" are assumed to have known divs.
9096 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
9097 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
9102 return isl_basic_map_list_free(list
);
9104 n
= isl_basic_map_list_n_basic_map(list
);
9105 for (i
= 0; i
< n
; ++i
) {
9106 isl_basic_map
*bmap_i
;
9108 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9109 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
9110 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
9116 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
9117 __isl_take isl_map
*map
)
9121 ok
= isl_map_compatible_domain(map
, set
);
9125 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9126 "incompatible spaces", goto error
);
9127 map
= isl_map_intersect_domain(map
, set
);
9128 set
= isl_map_range(map
);
9136 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9137 __isl_take isl_map
*map
)
9139 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
9142 /* There is no need to cow as removing empty parts doesn't change
9143 * the meaning of the set.
9145 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9152 for (i
= map
->n
- 1; i
>= 0; --i
)
9153 map
= remove_if_empty(map
, i
);
9158 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
9160 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9163 /* Create a binary relation that maps the shared initial "pos" dimensions
9164 * of "bset1" and "bset2" to the remaining dimensions of "bset1" and "bset2".
9166 static __isl_give isl_basic_map
*join_initial(__isl_keep isl_basic_set
*bset1
,
9167 __isl_keep isl_basic_set
*bset2
, int pos
)
9169 isl_basic_map
*bmap1
;
9170 isl_basic_map
*bmap2
;
9172 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9173 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9174 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9175 isl_dim_out
, 0, pos
);
9176 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9177 isl_dim_out
, 0, pos
);
9178 return isl_basic_map_range_product(bmap1
, bmap2
);
9181 /* Given two basic sets bset1 and bset2, compute the maximal difference
9182 * between the values of dimension pos in bset1 and those in bset2
9183 * for any common value of the parameters and dimensions preceding pos.
9185 static enum isl_lp_result
basic_set_maximal_difference_at(
9186 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9187 int pos
, isl_int
*opt
)
9189 isl_basic_map
*bmap1
;
9190 struct isl_ctx
*ctx
;
9191 struct isl_vec
*obj
;
9195 enum isl_lp_result res
;
9197 if (!bset1
|| !bset2
)
9198 return isl_lp_error
;
9200 nparam
= isl_basic_set_n_param(bset1
);
9201 dim1
= isl_basic_set_n_dim(bset1
);
9203 bmap1
= join_initial(bset1
, bset2
, pos
);
9205 return isl_lp_error
;
9207 total
= isl_basic_map_total_dim(bmap1
);
9209 obj
= isl_vec_alloc(ctx
, 1 + total
);
9212 isl_seq_clr(obj
->block
.data
, 1 + total
);
9213 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9214 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9215 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9217 isl_basic_map_free(bmap1
);
9221 isl_basic_map_free(bmap1
);
9222 return isl_lp_error
;
9225 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9226 * for any common value of the parameters and dimensions preceding pos
9227 * in both basic sets, the values of dimension pos in bset1 are
9228 * smaller or larger than those in bset2.
9231 * 1 if bset1 follows bset2
9232 * -1 if bset1 precedes bset2
9233 * 0 if bset1 and bset2 are incomparable
9234 * -2 if some error occurred.
9236 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
9237 struct isl_basic_set
*bset2
, int pos
)
9240 enum isl_lp_result res
;
9245 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9247 if (res
== isl_lp_empty
)
9249 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9250 res
== isl_lp_unbounded
)
9252 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9261 /* Given two basic sets bset1 and bset2, check whether
9262 * for any common value of the parameters and dimensions preceding pos
9263 * there is a value of dimension pos in bset1 that is larger
9264 * than a value of the same dimension in bset2.
9267 * 1 if there exists such a pair
9268 * 0 if there is no such pair, but there is a pair of equal values
9270 * -2 if some error occurred.
9272 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9273 __isl_keep isl_basic_set
*bset2
, int pos
)
9276 isl_basic_map
*bmap
;
9279 dim1
= isl_basic_set_dim(bset1
, isl_dim_set
);
9280 bmap
= join_initial(bset1
, bset2
, pos
);
9281 bmap
= isl_basic_map_order_ge(bmap
, isl_dim_out
, 0,
9282 isl_dim_out
, dim1
- pos
);
9283 empty
= isl_basic_map_is_empty(bmap
);
9287 isl_basic_map_free(bmap
);
9290 bmap
= isl_basic_map_order_gt(bmap
, isl_dim_out
, 0,
9291 isl_dim_out
, dim1
- pos
);
9292 empty
= isl_basic_map_is_empty(bmap
);
9295 isl_basic_map_free(bmap
);
9300 isl_basic_map_free(bmap
);
9304 /* Given two sets set1 and set2, check whether
9305 * for any common value of the parameters and dimensions preceding pos
9306 * there is a value of dimension pos in set1 that is larger
9307 * than a value of the same dimension in set2.
9310 * 1 if there exists such a pair
9311 * 0 if there is no such pair, but there is a pair of equal values
9313 * -2 if some error occurred.
9315 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9316 __isl_keep isl_set
*set2
, int pos
)
9324 for (i
= 0; i
< set1
->n
; ++i
)
9325 for (j
= 0; j
< set2
->n
; ++j
) {
9327 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9328 if (f
== 1 || f
== -2)
9337 static isl_bool
isl_basic_map_plain_has_fixed_var(
9338 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9345 return isl_bool_error
;
9346 total
= isl_basic_map_total_dim(bmap
);
9347 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9348 for (; d
+1 > pos
; --d
)
9349 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9353 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9354 return isl_bool_false
;
9355 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9356 return isl_bool_false
;
9357 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9358 return isl_bool_false
;
9360 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9361 return isl_bool_true
;
9363 return isl_bool_false
;
9366 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9367 unsigned pos
, isl_int
*val
)
9375 return isl_bool_error
;
9377 return isl_bool_false
;
9379 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9382 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9383 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9384 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9385 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9386 fixed
= isl_bool_false
;
9389 isl_int_set(*val
, v
);
9395 static isl_bool
isl_basic_set_plain_has_fixed_var(
9396 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9398 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9402 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9403 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9405 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9406 return isl_bool_error
;
9407 return isl_basic_map_plain_has_fixed_var(bmap
,
9408 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9411 /* If "bmap" obviously lies on a hyperplane where the given dimension
9412 * has a fixed value, then return that value.
9413 * Otherwise return NaN.
9415 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9416 __isl_keep isl_basic_map
*bmap
,
9417 enum isl_dim_type type
, unsigned pos
)
9425 ctx
= isl_basic_map_get_ctx(bmap
);
9426 v
= isl_val_alloc(ctx
);
9429 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9431 return isl_val_free(v
);
9433 isl_int_set_si(v
->d
, 1);
9437 return isl_val_nan(ctx
);
9440 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9441 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9443 if (pos
>= isl_map_dim(map
, type
))
9444 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9445 "position out of bounds", return isl_bool_error
);
9446 return isl_map_plain_has_fixed_var(map
,
9447 map_offset(map
, type
) - 1 + pos
, val
);
9450 /* If "map" obviously lies on a hyperplane where the given dimension
9451 * has a fixed value, then return that value.
9452 * Otherwise return NaN.
9454 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9455 enum isl_dim_type type
, unsigned pos
)
9463 ctx
= isl_map_get_ctx(map
);
9464 v
= isl_val_alloc(ctx
);
9467 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9469 return isl_val_free(v
);
9471 isl_int_set_si(v
->d
, 1);
9475 return isl_val_nan(ctx
);
9478 /* If "set" obviously lies on a hyperplane where the given dimension
9479 * has a fixed value, then return that value.
9480 * Otherwise return NaN.
9482 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9483 enum isl_dim_type type
, unsigned pos
)
9485 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9488 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9489 * then return this fixed value in *val.
9491 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9492 unsigned dim
, isl_int
*val
)
9494 return isl_basic_set_plain_has_fixed_var(bset
,
9495 isl_basic_set_n_param(bset
) + dim
, val
);
9498 /* Return -1 if the constraint "c1" should be sorted before "c2"
9499 * and 1 if it should be sorted after "c2".
9500 * Return 0 if the two constraints are the same (up to the constant term).
9502 * In particular, if a constraint involves later variables than another
9503 * then it is sorted after this other constraint.
9504 * uset_gist depends on constraints without existentially quantified
9505 * variables sorting first.
9507 * For constraints that have the same latest variable, those
9508 * with the same coefficient for this latest variable (first in absolute value
9509 * and then in actual value) are grouped together.
9510 * This is useful for detecting pairs of constraints that can
9511 * be chained in their printed representation.
9513 * Finally, within a group, constraints are sorted according to
9514 * their coefficients (excluding the constant term).
9516 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9518 isl_int
**c1
= (isl_int
**) p1
;
9519 isl_int
**c2
= (isl_int
**) p2
;
9521 unsigned size
= *(unsigned *) arg
;
9524 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9525 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9530 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9533 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9537 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9540 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9541 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9542 * and 0 if the two constraints are the same (up to the constant term).
9544 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9545 isl_int
*c1
, isl_int
*c2
)
9551 total
= isl_basic_map_total_dim(bmap
);
9552 return sort_constraint_cmp(&c1
, &c2
, &total
);
9555 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9556 __isl_take isl_basic_map
*bmap
)
9562 if (bmap
->n_ineq
== 0)
9564 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9566 total
= isl_basic_map_total_dim(bmap
);
9567 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9568 &sort_constraint_cmp
, &total
) < 0)
9569 return isl_basic_map_free(bmap
);
9573 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9574 __isl_take isl_basic_set
*bset
)
9576 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9577 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9580 __isl_give isl_basic_map
*isl_basic_map_normalize(
9581 __isl_take isl_basic_map
*bmap
)
9585 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9587 bmap
= isl_basic_map_remove_redundancies(bmap
);
9588 bmap
= isl_basic_map_sort_constraints(bmap
);
9590 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9593 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9594 __isl_keep isl_basic_map
*bmap2
)
9598 isl_space
*space1
, *space2
;
9600 if (!bmap1
|| !bmap2
)
9605 space1
= isl_basic_map_peek_space(bmap1
);
9606 space2
= isl_basic_map_peek_space(bmap2
);
9607 cmp
= isl_space_cmp(space1
, space2
);
9610 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9611 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9612 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9613 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9614 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9616 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9618 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9620 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9621 return bmap1
->n_eq
- bmap2
->n_eq
;
9622 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9623 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9624 if (bmap1
->n_div
!= bmap2
->n_div
)
9625 return bmap1
->n_div
- bmap2
->n_div
;
9626 total
= isl_basic_map_total_dim(bmap1
);
9627 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9628 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9632 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9633 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9637 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9638 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9645 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9646 __isl_keep isl_basic_set
*bset2
)
9648 return isl_basic_map_plain_cmp(bset1
, bset2
);
9651 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9657 if (set1
->n
!= set2
->n
)
9658 return set1
->n
- set2
->n
;
9660 for (i
= 0; i
< set1
->n
; ++i
) {
9661 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9669 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9670 __isl_keep isl_basic_map
*bmap2
)
9672 if (!bmap1
|| !bmap2
)
9673 return isl_bool_error
;
9674 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9677 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9678 __isl_keep isl_basic_set
*bset2
)
9680 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9681 bset_to_bmap(bset2
));
9684 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9686 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9687 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9689 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9692 /* Sort the basic maps of "map" and remove duplicate basic maps.
9694 * While removing basic maps, we make sure that the basic maps remain
9695 * sorted because isl_map_normalize expects the basic maps of the result
9698 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9702 map
= isl_map_remove_empty_parts(map
);
9705 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9706 for (i
= map
->n
- 1; i
>= 1; --i
) {
9707 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9709 isl_basic_map_free(map
->p
[i
-1]);
9710 for (j
= i
; j
< map
->n
; ++j
)
9711 map
->p
[j
- 1] = map
->p
[j
];
9718 /* Remove obvious duplicates among the basic maps of "map".
9720 * Unlike isl_map_normalize, this function does not remove redundant
9721 * constraints and only removes duplicates that have exactly the same
9722 * constraints in the input. It does sort the constraints and
9723 * the basic maps to ease the detection of duplicates.
9725 * If "map" has already been normalized or if the basic maps are
9726 * disjoint, then there can be no duplicates.
9728 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9731 isl_basic_map
*bmap
;
9737 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9739 for (i
= 0; i
< map
->n
; ++i
) {
9740 bmap
= isl_basic_map_copy(map
->p
[i
]);
9741 bmap
= isl_basic_map_sort_constraints(bmap
);
9743 return isl_map_free(map
);
9744 isl_basic_map_free(map
->p
[i
]);
9748 map
= sort_and_remove_duplicates(map
);
9752 /* We normalize in place, but if anything goes wrong we need
9753 * to return NULL, so we need to make sure we don't change the
9754 * meaning of any possible other copies of map.
9756 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9759 struct isl_basic_map
*bmap
;
9763 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9765 for (i
= 0; i
< map
->n
; ++i
) {
9766 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9769 isl_basic_map_free(map
->p
[i
]);
9773 map
= sort_and_remove_duplicates(map
);
9775 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9782 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9784 return set_from_map(isl_map_normalize(set_to_map(set
)));
9787 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9788 __isl_keep isl_map
*map2
)
9794 return isl_bool_error
;
9797 return isl_bool_true
;
9798 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9799 return isl_bool_false
;
9801 map1
= isl_map_copy(map1
);
9802 map2
= isl_map_copy(map2
);
9803 map1
= isl_map_normalize(map1
);
9804 map2
= isl_map_normalize(map2
);
9807 equal
= map1
->n
== map2
->n
;
9808 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9809 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9819 return isl_bool_error
;
9822 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9823 __isl_keep isl_set
*set2
)
9825 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9828 /* Return the basic maps in "map" as a list.
9830 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9831 __isl_keep isl_map
*map
)
9835 isl_basic_map_list
*list
;
9839 ctx
= isl_map_get_ctx(map
);
9840 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9842 for (i
= 0; i
< map
->n
; ++i
) {
9843 isl_basic_map
*bmap
;
9845 bmap
= isl_basic_map_copy(map
->p
[i
]);
9846 list
= isl_basic_map_list_add(list
, bmap
);
9852 /* Return the intersection of the elements in the non-empty list "list".
9853 * All elements are assumed to live in the same space.
9855 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9856 __isl_take isl_basic_map_list
*list
)
9859 isl_basic_map
*bmap
;
9863 n
= isl_basic_map_list_n_basic_map(list
);
9865 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9866 "expecting non-empty list", goto error
);
9868 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9869 for (i
= 1; i
< n
; ++i
) {
9870 isl_basic_map
*bmap_i
;
9872 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9873 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9876 isl_basic_map_list_free(list
);
9879 isl_basic_map_list_free(list
);
9883 /* Return the intersection of the elements in the non-empty list "list".
9884 * All elements are assumed to live in the same space.
9886 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9887 __isl_take isl_basic_set_list
*list
)
9889 return isl_basic_map_list_intersect(list
);
9892 /* Return the union of the elements of "list".
9893 * The list is required to have at least one element.
9895 __isl_give isl_set
*isl_basic_set_list_union(
9896 __isl_take isl_basic_set_list
*list
)
9900 isl_basic_set
*bset
;
9905 n
= isl_basic_set_list_n_basic_set(list
);
9907 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9908 "expecting non-empty list", goto error
);
9910 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9911 space
= isl_basic_set_get_space(bset
);
9912 isl_basic_set_free(bset
);
9914 set
= isl_set_alloc_space(space
, n
, 0);
9915 for (i
= 0; i
< n
; ++i
) {
9916 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9917 set
= isl_set_add_basic_set(set
, bset
);
9920 isl_basic_set_list_free(list
);
9923 isl_basic_set_list_free(list
);
9927 /* Return the union of the elements in the non-empty list "list".
9928 * All elements are assumed to live in the same space.
9930 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9937 n
= isl_set_list_n_set(list
);
9939 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9940 "expecting non-empty list", goto error
);
9942 set
= isl_set_list_get_set(list
, 0);
9943 for (i
= 1; i
< n
; ++i
) {
9946 set_i
= isl_set_list_get_set(list
, i
);
9947 set
= isl_set_union(set
, set_i
);
9950 isl_set_list_free(list
);
9953 isl_set_list_free(list
);
9957 __isl_give isl_basic_map
*isl_basic_map_product(
9958 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9960 isl_space
*dim_result
= NULL
;
9961 struct isl_basic_map
*bmap
;
9962 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9963 struct isl_dim_map
*dim_map1
, *dim_map2
;
9965 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9967 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9968 isl_space_copy(bmap2
->dim
));
9970 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9971 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9972 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9973 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9974 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9976 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9977 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9978 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9979 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9980 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9981 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9982 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9983 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9984 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9985 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9986 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9988 bmap
= isl_basic_map_alloc_space(dim_result
,
9989 bmap1
->n_div
+ bmap2
->n_div
,
9990 bmap1
->n_eq
+ bmap2
->n_eq
,
9991 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9992 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9993 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9994 bmap
= isl_basic_map_simplify(bmap
);
9995 return isl_basic_map_finalize(bmap
);
9997 isl_basic_map_free(bmap1
);
9998 isl_basic_map_free(bmap2
);
10002 __isl_give isl_basic_map
*isl_basic_map_flat_product(
10003 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10005 isl_basic_map
*prod
;
10007 prod
= isl_basic_map_product(bmap1
, bmap2
);
10008 prod
= isl_basic_map_flatten(prod
);
10012 __isl_give isl_basic_set
*isl_basic_set_flat_product(
10013 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
10015 return isl_basic_map_flat_range_product(bset1
, bset2
);
10018 __isl_give isl_basic_map
*isl_basic_map_domain_product(
10019 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10021 isl_space
*space_result
= NULL
;
10022 isl_basic_map
*bmap
;
10023 unsigned in1
, in2
, out
, nparam
, total
, pos
;
10024 struct isl_dim_map
*dim_map1
, *dim_map2
;
10026 if (!bmap1
|| !bmap2
)
10029 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
10030 isl_space_copy(bmap2
->dim
));
10032 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10033 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
10034 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10035 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10037 total
= nparam
+ in1
+ in2
+ out
+ 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
+= in1
);
10044 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
10045 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
10046 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
10047 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10049 bmap
= isl_basic_map_alloc_space(space_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
);
10055 bmap
= isl_basic_map_simplify(bmap
);
10056 return isl_basic_map_finalize(bmap
);
10058 isl_basic_map_free(bmap1
);
10059 isl_basic_map_free(bmap2
);
10063 __isl_give isl_basic_map
*isl_basic_map_range_product(
10064 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10067 isl_space
*dim_result
= NULL
;
10068 isl_basic_map
*bmap
;
10069 unsigned in
, out1
, out2
, nparam
, total
, pos
;
10070 struct isl_dim_map
*dim_map1
, *dim_map2
;
10072 rational
= isl_basic_map_is_rational(bmap1
);
10073 if (rational
>= 0 && rational
)
10074 rational
= isl_basic_map_is_rational(bmap2
);
10075 if (!bmap1
|| !bmap2
|| rational
< 0)
10078 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
10081 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
10082 isl_space_copy(bmap2
->dim
));
10084 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10085 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10086 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
10087 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10089 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
10090 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10091 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10092 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10093 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10094 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10095 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
10096 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
10097 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10098 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10099 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10101 bmap
= isl_basic_map_alloc_space(dim_result
,
10102 bmap1
->n_div
+ bmap2
->n_div
,
10103 bmap1
->n_eq
+ bmap2
->n_eq
,
10104 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10105 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10106 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10108 bmap
= isl_basic_map_set_rational(bmap
);
10109 bmap
= isl_basic_map_simplify(bmap
);
10110 return isl_basic_map_finalize(bmap
);
10112 isl_basic_map_free(bmap1
);
10113 isl_basic_map_free(bmap2
);
10117 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
10118 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10120 isl_basic_map
*prod
;
10122 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10123 prod
= isl_basic_map_flatten_range(prod
);
10127 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10128 * and collect the results.
10129 * The result live in the space obtained by calling "space_product"
10130 * on the spaces of "map1" and "map2".
10131 * If "remove_duplicates" is set then the result may contain duplicates
10132 * (even if the inputs do not) and so we try and remove the obvious
10135 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10136 __isl_take isl_map
*map2
,
10137 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10138 __isl_take isl_space
*right
),
10139 __isl_give isl_basic_map
*(*basic_map_product
)(
10140 __isl_take isl_basic_map
*left
,
10141 __isl_take isl_basic_map
*right
),
10142 int remove_duplicates
)
10144 unsigned flags
= 0;
10145 struct isl_map
*result
;
10149 m
= isl_map_has_equal_params(map1
, map2
);
10153 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10154 "parameters don't match", goto error
);
10156 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10157 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10158 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10160 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10161 isl_space_copy(map2
->dim
)),
10162 map1
->n
* map2
->n
, flags
);
10165 for (i
= 0; i
< map1
->n
; ++i
)
10166 for (j
= 0; j
< map2
->n
; ++j
) {
10167 struct isl_basic_map
*part
;
10168 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
10169 isl_basic_map_copy(map2
->p
[j
]));
10170 if (isl_basic_map_is_empty(part
))
10171 isl_basic_map_free(part
);
10173 result
= isl_map_add_basic_map(result
, part
);
10177 if (remove_duplicates
)
10178 result
= isl_map_remove_obvious_duplicates(result
);
10179 isl_map_free(map1
);
10180 isl_map_free(map2
);
10183 isl_map_free(map1
);
10184 isl_map_free(map2
);
10188 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
10190 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
10191 __isl_take isl_map
*map2
)
10193 return map_product(map1
, map2
, &isl_space_product
,
10194 &isl_basic_map_product
, 0);
10197 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
10198 __isl_take isl_map
*map2
)
10200 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
10203 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
10205 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
10206 __isl_take isl_map
*map2
)
10210 prod
= isl_map_product(map1
, map2
);
10211 prod
= isl_map_flatten(prod
);
10215 /* Given two set A and B, construct its Cartesian product A x B.
10217 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10219 return isl_map_range_product(set1
, set2
);
10222 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10223 __isl_take isl_set
*set2
)
10225 return isl_map_flat_range_product(set1
, set2
);
10228 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10230 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10231 __isl_take isl_map
*map2
)
10233 return map_product(map1
, map2
, &isl_space_domain_product
,
10234 &isl_basic_map_domain_product
, 1);
10237 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10239 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10240 __isl_take isl_map
*map2
)
10242 return map_product(map1
, map2
, &isl_space_range_product
,
10243 &isl_basic_map_range_product
, 1);
10246 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10247 __isl_take isl_map
*map2
)
10249 return isl_map_align_params_map_map_and(map1
, map2
,
10250 &map_domain_product_aligned
);
10253 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10254 __isl_take isl_map
*map2
)
10256 return isl_map_align_params_map_map_and(map1
, map2
,
10257 &map_range_product_aligned
);
10260 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10262 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10265 int total1
, keep1
, total2
, keep2
;
10269 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10270 !isl_space_range_is_wrapping(map
->dim
))
10271 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10272 "not a product", return isl_map_free(map
));
10274 space
= isl_map_get_space(map
);
10275 total1
= isl_space_dim(space
, isl_dim_in
);
10276 total2
= isl_space_dim(space
, isl_dim_out
);
10277 space
= isl_space_factor_domain(space
);
10278 keep1
= isl_space_dim(space
, isl_dim_in
);
10279 keep2
= isl_space_dim(space
, isl_dim_out
);
10280 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10281 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10282 map
= isl_map_reset_space(map
, space
);
10287 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10289 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10292 int total1
, keep1
, total2
, keep2
;
10296 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10297 !isl_space_range_is_wrapping(map
->dim
))
10298 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10299 "not a product", return isl_map_free(map
));
10301 space
= isl_map_get_space(map
);
10302 total1
= isl_space_dim(space
, isl_dim_in
);
10303 total2
= isl_space_dim(space
, isl_dim_out
);
10304 space
= isl_space_factor_range(space
);
10305 keep1
= isl_space_dim(space
, isl_dim_in
);
10306 keep2
= isl_space_dim(space
, isl_dim_out
);
10307 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10308 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10309 map
= isl_map_reset_space(map
, space
);
10314 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10316 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10323 if (!isl_space_domain_is_wrapping(map
->dim
))
10324 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10325 "domain is not a product", return isl_map_free(map
));
10327 space
= isl_map_get_space(map
);
10328 total
= isl_space_dim(space
, isl_dim_in
);
10329 space
= isl_space_domain_factor_domain(space
);
10330 keep
= isl_space_dim(space
, isl_dim_in
);
10331 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10332 map
= isl_map_reset_space(map
, space
);
10337 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10339 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10346 if (!isl_space_domain_is_wrapping(map
->dim
))
10347 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10348 "domain is not a product", return isl_map_free(map
));
10350 space
= isl_map_get_space(map
);
10351 total
= isl_space_dim(space
, isl_dim_in
);
10352 space
= isl_space_domain_factor_range(space
);
10353 keep
= isl_space_dim(space
, isl_dim_in
);
10354 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10355 map
= isl_map_reset_space(map
, space
);
10360 /* Given a map A -> [B -> C], extract the map A -> B.
10362 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10369 if (!isl_space_range_is_wrapping(map
->dim
))
10370 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10371 "range is not a product", return isl_map_free(map
));
10373 space
= isl_map_get_space(map
);
10374 total
= isl_space_dim(space
, isl_dim_out
);
10375 space
= isl_space_range_factor_domain(space
);
10376 keep
= isl_space_dim(space
, isl_dim_out
);
10377 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10378 map
= isl_map_reset_space(map
, space
);
10383 /* Given a map A -> [B -> C], extract the map A -> C.
10385 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10392 if (!isl_space_range_is_wrapping(map
->dim
))
10393 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10394 "range is not a product", return isl_map_free(map
));
10396 space
= isl_map_get_space(map
);
10397 total
= isl_space_dim(space
, isl_dim_out
);
10398 space
= isl_space_range_factor_range(space
);
10399 keep
= isl_space_dim(space
, isl_dim_out
);
10400 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10401 map
= isl_map_reset_space(map
, space
);
10406 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10408 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10409 __isl_take isl_map
*map2
)
10413 prod
= isl_map_domain_product(map1
, map2
);
10414 prod
= isl_map_flatten_domain(prod
);
10418 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10420 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10421 __isl_take isl_map
*map2
)
10425 prod
= isl_map_range_product(map1
, map2
);
10426 prod
= isl_map_flatten_range(prod
);
10430 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10433 uint32_t hash
= isl_hash_init();
10438 bmap
= isl_basic_map_copy(bmap
);
10439 bmap
= isl_basic_map_normalize(bmap
);
10442 total
= isl_basic_map_total_dim(bmap
);
10443 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10444 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10446 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10447 isl_hash_hash(hash
, c_hash
);
10449 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10450 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10452 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10453 isl_hash_hash(hash
, c_hash
);
10455 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10456 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10458 if (isl_int_is_zero(bmap
->div
[i
][0]))
10460 isl_hash_byte(hash
, i
& 0xFF);
10461 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10462 isl_hash_hash(hash
, c_hash
);
10464 isl_basic_map_free(bmap
);
10468 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10470 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10473 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10480 map
= isl_map_copy(map
);
10481 map
= isl_map_normalize(map
);
10485 hash
= isl_hash_init();
10486 for (i
= 0; i
< map
->n
; ++i
) {
10487 uint32_t bmap_hash
;
10488 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10489 isl_hash_hash(hash
, bmap_hash
);
10497 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10499 return isl_map_get_hash(set_to_map(set
));
10502 /* Return the number of basic maps in the (current) representation of "map".
10504 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10506 return map
? map
->n
: 0;
10509 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10511 return set
? set
->n
: 0;
10514 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10515 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10520 return isl_stat_error
;
10522 for (i
= 0; i
< map
->n
; ++i
)
10523 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10524 return isl_stat_error
;
10526 return isl_stat_ok
;
10529 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10530 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10535 return isl_stat_error
;
10537 for (i
= 0; i
< set
->n
; ++i
)
10538 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10539 return isl_stat_error
;
10541 return isl_stat_ok
;
10544 /* Return a list of basic sets, the union of which is equal to "set".
10546 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10547 __isl_keep isl_set
*set
)
10550 isl_basic_set_list
*list
;
10555 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10556 for (i
= 0; i
< set
->n
; ++i
) {
10557 isl_basic_set
*bset
;
10559 bset
= isl_basic_set_copy(set
->p
[i
]);
10560 list
= isl_basic_set_list_add(list
, bset
);
10566 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10573 bset
= isl_basic_set_cow(bset
);
10577 dim
= isl_basic_set_get_space(bset
);
10578 dim
= isl_space_lift(dim
, bset
->n_div
);
10581 isl_space_free(bset
->dim
);
10583 bset
->extra
-= bset
->n_div
;
10586 bset
= isl_basic_set_finalize(bset
);
10590 isl_basic_set_free(bset
);
10594 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10600 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10605 set
= isl_set_cow(set
);
10609 n_div
= set
->p
[0]->n_div
;
10610 dim
= isl_set_get_space(set
);
10611 dim
= isl_space_lift(dim
, n_div
);
10614 isl_space_free(set
->dim
);
10617 for (i
= 0; i
< set
->n
; ++i
) {
10618 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10629 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10637 dim
= isl_basic_set_total_dim(bset
);
10638 size
+= bset
->n_eq
* (1 + dim
);
10639 size
+= bset
->n_ineq
* (1 + dim
);
10640 size
+= bset
->n_div
* (2 + dim
);
10645 int isl_set_size(__isl_keep isl_set
*set
)
10653 for (i
= 0; i
< set
->n
; ++i
)
10654 size
+= isl_basic_set_size(set
->p
[i
]);
10659 /* Check if there is any lower bound (if lower == 0) and/or upper
10660 * bound (if upper == 0) on the specified dim.
10662 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10663 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10667 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10668 return isl_bool_error
;
10670 pos
+= isl_basic_map_offset(bmap
, type
);
10672 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10673 if (isl_int_is_zero(bmap
->div
[i
][0]))
10675 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10676 return isl_bool_true
;
10679 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10680 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10681 return isl_bool_true
;
10683 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10684 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10691 return lower
&& upper
;
10694 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10695 enum isl_dim_type type
, unsigned pos
)
10697 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10700 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10701 enum isl_dim_type type
, unsigned pos
)
10703 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10706 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10707 enum isl_dim_type type
, unsigned pos
)
10709 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10712 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10713 enum isl_dim_type type
, unsigned pos
)
10718 return isl_bool_error
;
10720 for (i
= 0; i
< map
->n
; ++i
) {
10722 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10723 if (bounded
< 0 || !bounded
)
10727 return isl_bool_true
;
10730 /* Return true if the specified dim is involved in both an upper bound
10731 * and a lower bound.
10733 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10734 enum isl_dim_type type
, unsigned pos
)
10736 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10739 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10741 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10742 enum isl_dim_type type
, unsigned pos
,
10743 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10744 enum isl_dim_type type
, unsigned pos
))
10749 return isl_bool_error
;
10751 for (i
= 0; i
< map
->n
; ++i
) {
10753 bounded
= fn(map
->p
[i
], type
, pos
);
10754 if (bounded
< 0 || bounded
)
10758 return isl_bool_false
;
10761 /* Return 1 if the specified dim is involved in any lower bound.
10763 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10764 enum isl_dim_type type
, unsigned pos
)
10766 return has_any_bound(set
, type
, pos
,
10767 &isl_basic_map_dim_has_lower_bound
);
10770 /* Return 1 if the specified dim is involved in any upper bound.
10772 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10773 enum isl_dim_type type
, unsigned pos
)
10775 return has_any_bound(set
, type
, pos
,
10776 &isl_basic_map_dim_has_upper_bound
);
10779 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10781 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10782 enum isl_dim_type type
, unsigned pos
,
10783 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10784 enum isl_dim_type type
, unsigned pos
))
10789 return isl_bool_error
;
10791 for (i
= 0; i
< map
->n
; ++i
) {
10793 bounded
= fn(map
->p
[i
], type
, pos
);
10794 if (bounded
< 0 || !bounded
)
10798 return isl_bool_true
;
10801 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10803 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10804 enum isl_dim_type type
, unsigned pos
)
10806 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10809 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10811 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10812 enum isl_dim_type type
, unsigned pos
)
10814 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10817 /* For each of the "n" variables starting at "first", determine
10818 * the sign of the variable and put the results in the first "n"
10819 * elements of the array "signs".
10821 * 1 means that the variable is non-negative
10822 * -1 means that the variable is non-positive
10823 * 0 means the variable attains both positive and negative values.
10825 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10826 unsigned first
, unsigned n
, int *signs
)
10828 isl_vec
*bound
= NULL
;
10829 struct isl_tab
*tab
= NULL
;
10830 struct isl_tab_undo
*snap
;
10833 if (!bset
|| !signs
)
10834 return isl_stat_error
;
10836 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10837 tab
= isl_tab_from_basic_set(bset
, 0);
10838 if (!bound
|| !tab
)
10841 isl_seq_clr(bound
->el
, bound
->size
);
10842 isl_int_set_si(bound
->el
[0], -1);
10844 snap
= isl_tab_snap(tab
);
10845 for (i
= 0; i
< n
; ++i
) {
10848 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10849 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10851 empty
= tab
->empty
;
10852 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10853 if (isl_tab_rollback(tab
, snap
) < 0)
10861 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10862 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10864 empty
= tab
->empty
;
10865 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10866 if (isl_tab_rollback(tab
, snap
) < 0)
10869 signs
[i
] = empty
? -1 : 0;
10873 isl_vec_free(bound
);
10874 return isl_stat_ok
;
10877 isl_vec_free(bound
);
10878 return isl_stat_error
;
10881 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10882 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10884 if (!bset
|| !signs
)
10885 return isl_stat_error
;
10886 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10887 return isl_stat_error
);
10889 first
+= pos(bset
->dim
, type
) - 1;
10890 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10893 /* Is it possible for the integer division "div" to depend (possibly
10894 * indirectly) on any output dimensions?
10896 * If the div is undefined, then we conservatively assume that it
10897 * may depend on them.
10898 * Otherwise, we check if it actually depends on them or on any integer
10899 * divisions that may depend on them.
10901 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10904 unsigned n_out
, o_out
;
10905 unsigned n_div
, o_div
;
10907 if (isl_int_is_zero(bmap
->div
[div
][0]))
10908 return isl_bool_true
;
10910 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10911 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10913 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10914 return isl_bool_true
;
10916 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10917 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10919 for (i
= 0; i
< n_div
; ++i
) {
10920 isl_bool may_involve
;
10922 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10924 may_involve
= div_may_involve_output(bmap
, i
);
10925 if (may_involve
< 0 || may_involve
)
10926 return may_involve
;
10929 return isl_bool_false
;
10932 /* Return the first integer division of "bmap" in the range
10933 * [first, first + n[ that may depend on any output dimensions and
10934 * that has a non-zero coefficient in "c" (where the first coefficient
10935 * in "c" corresponds to integer division "first").
10937 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10938 isl_int
*c
, int first
, int n
)
10945 for (k
= first
; k
< first
+ n
; ++k
) {
10946 isl_bool may_involve
;
10948 if (isl_int_is_zero(c
[k
]))
10950 may_involve
= div_may_involve_output(bmap
, k
);
10951 if (may_involve
< 0)
10960 /* Look for a pair of inequality constraints in "bmap" of the form
10962 * -l + i >= 0 or i >= l
10964 * n + l - i >= 0 or i <= l + n
10966 * with n < "m" and i the output dimension at position "pos".
10967 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10968 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10969 * and earlier output dimensions, as well as integer divisions that do
10970 * not involve any of the output dimensions.
10972 * Return the index of the first inequality constraint or bmap->n_ineq
10973 * if no such pair can be found.
10975 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10976 int pos
, isl_int m
)
10981 unsigned n_div
, o_div
;
10982 unsigned n_out
, o_out
;
10988 ctx
= isl_basic_map_get_ctx(bmap
);
10989 total
= isl_basic_map_total_dim(bmap
);
10990 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10991 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10992 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10993 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10994 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10995 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10997 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10998 n_out
- (pos
+ 1)) != -1)
11000 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
11003 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
11004 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
11007 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
11008 bmap
->ineq
[j
] + 1, total
))
11012 if (j
>= bmap
->n_ineq
)
11014 isl_int_add(bmap
->ineq
[i
][0],
11015 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
11016 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
11017 isl_int_sub(bmap
->ineq
[i
][0],
11018 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
11021 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
11027 return bmap
->n_ineq
;
11030 /* Return the index of the equality of "bmap" that defines
11031 * the output dimension "pos" in terms of earlier dimensions.
11032 * The equality may also involve integer divisions, as long
11033 * as those integer divisions are defined in terms of
11034 * parameters or input dimensions.
11035 * In this case, *div is set to the number of integer divisions and
11036 * *ineq is set to the number of inequality constraints (provided
11037 * div and ineq are not NULL).
11039 * The equality may also involve a single integer division involving
11040 * the output dimensions (typically only output dimension "pos") as
11041 * long as the coefficient of output dimension "pos" is 1 or -1 and
11042 * there is a pair of constraints i >= l and i <= l + n, with i referring
11043 * to output dimension "pos", l an expression involving only earlier
11044 * dimensions and n smaller than the coefficient of the integer division
11045 * in the equality. In this case, the output dimension can be defined
11046 * in terms of a modulo expression that does not involve the integer division.
11047 * *div is then set to this single integer division and
11048 * *ineq is set to the index of constraint i >= l.
11050 * Return bmap->n_eq if there is no such equality.
11051 * Return -1 on error.
11053 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
11054 int pos
, int *div
, int *ineq
)
11057 unsigned n_out
, o_out
;
11058 unsigned n_div
, o_div
;
11063 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11064 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
11065 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11066 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11069 *ineq
= bmap
->n_ineq
;
11072 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
11073 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
11075 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
11076 n_out
- (pos
+ 1)) != -1)
11078 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11082 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
11083 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
11085 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11086 k
+ 1, n_div
- (k
+1)) < n_div
)
11088 l
= find_modulo_constraint_pair(bmap
, pos
,
11089 bmap
->eq
[j
][o_div
+ k
]);
11092 if (l
>= bmap
->n_ineq
)
11104 /* Check if the given basic map is obviously single-valued.
11105 * In particular, for each output dimension, check that there is
11106 * an equality that defines the output dimension in terms of
11107 * earlier dimensions.
11109 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11115 return isl_bool_error
;
11117 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11119 for (i
= 0; i
< n_out
; ++i
) {
11122 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11125 return isl_bool_error
;
11126 if (eq
>= bmap
->n_eq
)
11127 return isl_bool_false
;
11130 return isl_bool_true
;
11133 /* Check if the given basic map is single-valued.
11134 * We simply compute
11138 * and check if the result is a subset of the identity mapping.
11140 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11143 isl_basic_map
*test
;
11147 sv
= isl_basic_map_plain_is_single_valued(bmap
);
11151 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
11152 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
11154 space
= isl_basic_map_get_space(bmap
);
11155 space
= isl_space_map_from_set(isl_space_range(space
));
11156 id
= isl_basic_map_identity(space
);
11158 sv
= isl_basic_map_is_subset(test
, id
);
11160 isl_basic_map_free(test
);
11161 isl_basic_map_free(id
);
11166 /* Check if the given map is obviously single-valued.
11168 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
11171 return isl_bool_error
;
11173 return isl_bool_true
;
11175 return isl_bool_false
;
11177 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
11180 /* Check if the given map is single-valued.
11181 * We simply compute
11185 * and check if the result is a subset of the identity mapping.
11187 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
11194 sv
= isl_map_plain_is_single_valued(map
);
11198 test
= isl_map_reverse(isl_map_copy(map
));
11199 test
= isl_map_apply_range(test
, isl_map_copy(map
));
11201 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
11202 id
= isl_map_identity(dim
);
11204 sv
= isl_map_is_subset(test
, id
);
11206 isl_map_free(test
);
11212 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
11216 map
= isl_map_copy(map
);
11217 map
= isl_map_reverse(map
);
11218 in
= isl_map_is_single_valued(map
);
11224 /* Check if the given map is obviously injective.
11226 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11230 map
= isl_map_copy(map
);
11231 map
= isl_map_reverse(map
);
11232 in
= isl_map_plain_is_single_valued(map
);
11238 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11242 sv
= isl_map_is_single_valued(map
);
11246 return isl_map_is_injective(map
);
11249 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11251 return isl_map_is_single_valued(set_to_map(set
));
11254 /* Does "map" only map elements to themselves?
11256 * If the domain and range spaces are different, then "map"
11257 * is considered not to be an identity relation, even if it is empty.
11258 * Otherwise, construct the maximal identity relation and
11259 * check whether "map" is a subset of this relation.
11261 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11265 isl_bool equal
, is_identity
;
11267 space
= isl_map_get_space(map
);
11268 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11269 isl_space_free(space
);
11270 if (equal
< 0 || !equal
)
11273 id
= isl_map_identity(isl_map_get_space(map
));
11274 is_identity
= isl_map_is_subset(map
, id
);
11277 return is_identity
;
11280 int isl_map_is_translation(__isl_keep isl_map
*map
)
11285 delta
= isl_map_deltas(isl_map_copy(map
));
11286 ok
= isl_set_is_singleton(delta
);
11287 isl_set_free(delta
);
11292 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11294 if (isl_seq_first_non_zero(p
, pos
) != -1)
11296 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11301 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11308 return isl_bool_error
;
11310 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11311 return isl_bool_false
;
11313 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11314 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11315 for (j
= 0; j
< nvar
; ++j
) {
11316 int lower
= 0, upper
= 0;
11317 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11318 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11320 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11321 return isl_bool_false
;
11324 if (i
< bset
->n_eq
)
11326 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11327 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11329 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11330 return isl_bool_false
;
11331 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11336 if (!lower
|| !upper
)
11337 return isl_bool_false
;
11340 return isl_bool_true
;
11343 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11346 return isl_bool_error
;
11348 return isl_bool_false
;
11350 return isl_basic_set_is_box(set
->p
[0]);
11353 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11356 return isl_bool_error
;
11358 return isl_space_is_wrapping(bset
->dim
);
11361 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11364 return isl_bool_error
;
11366 return isl_space_is_wrapping(set
->dim
);
11369 /* Modify the space of "map" through a call to "change".
11370 * If "can_change" is set (not NULL), then first call it to check
11371 * if the modification is allowed, printing the error message "cannot_change"
11374 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11375 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11376 const char *cannot_change
,
11377 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11385 ok
= can_change
? can_change(map
) : isl_bool_true
;
11387 return isl_map_free(map
);
11389 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11390 return isl_map_free(map
));
11392 space
= change(isl_map_get_space(map
));
11393 map
= isl_map_reset_space(map
, space
);
11398 /* Is the domain of "map" a wrapped relation?
11400 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11403 return isl_bool_error
;
11405 return isl_space_domain_is_wrapping(map
->dim
);
11408 /* Does "map" have a wrapped relation in both domain and range?
11410 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
11412 return isl_space_is_product(isl_map_peek_space(map
));
11415 /* Is the range of "map" a wrapped relation?
11417 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11420 return isl_bool_error
;
11422 return isl_space_range_is_wrapping(map
->dim
);
11425 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11427 bmap
= isl_basic_map_cow(bmap
);
11431 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11435 bmap
= isl_basic_map_finalize(bmap
);
11437 return bset_from_bmap(bmap
);
11439 isl_basic_map_free(bmap
);
11443 /* Given a map A -> B, return the set (A -> B).
11445 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11447 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11450 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11452 bset
= isl_basic_set_cow(bset
);
11456 bset
->dim
= isl_space_unwrap(bset
->dim
);
11460 bset
= isl_basic_set_finalize(bset
);
11462 return bset_to_bmap(bset
);
11464 isl_basic_set_free(bset
);
11468 /* Given a set (A -> B), return the map A -> B.
11469 * Error out if "set" is not of the form (A -> B).
11471 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11473 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11474 "not a wrapping set", &isl_space_unwrap
);
11477 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11478 enum isl_dim_type type
)
11483 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11486 bmap
= isl_basic_map_cow(bmap
);
11490 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11494 bmap
= isl_basic_map_finalize(bmap
);
11498 isl_basic_map_free(bmap
);
11502 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11503 enum isl_dim_type type
)
11510 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11513 map
= isl_map_cow(map
);
11517 for (i
= 0; i
< map
->n
; ++i
) {
11518 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11522 map
->dim
= isl_space_reset(map
->dim
, type
);
11532 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11537 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11540 bmap
= isl_basic_map_cow(bmap
);
11544 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11548 bmap
= isl_basic_map_finalize(bmap
);
11552 isl_basic_map_free(bmap
);
11556 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11558 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11561 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11562 __isl_take isl_basic_map
*bmap
)
11567 if (!bmap
->dim
->nested
[0])
11570 bmap
= isl_basic_map_cow(bmap
);
11574 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11578 bmap
= isl_basic_map_finalize(bmap
);
11582 isl_basic_map_free(bmap
);
11586 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11587 __isl_take isl_basic_map
*bmap
)
11592 if (!bmap
->dim
->nested
[1])
11595 bmap
= isl_basic_map_cow(bmap
);
11599 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11603 bmap
= isl_basic_map_finalize(bmap
);
11607 isl_basic_map_free(bmap
);
11611 /* Remove any internal structure from the spaces of domain and range of "map".
11613 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11618 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11621 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11624 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11626 return set_from_map(isl_map_flatten(set_to_map(set
)));
11629 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11631 isl_space
*dim
, *flat_dim
;
11634 dim
= isl_set_get_space(set
);
11635 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11636 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11637 map
= isl_map_intersect_domain(map
, set
);
11642 /* Remove any internal structure from the space of the domain of "map".
11644 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11649 if (!map
->dim
->nested
[0])
11652 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11655 /* Remove any internal structure from the space of the range of "map".
11657 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11662 if (!map
->dim
->nested
[1])
11665 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11668 /* Reorder the dimensions of "bmap" according to the given dim_map
11669 * and set the dimension specification to "space" and
11670 * perform Gaussian elimination on the result.
11672 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11673 __isl_take isl_space
*space
, __isl_take
struct isl_dim_map
*dim_map
)
11675 isl_basic_map
*res
;
11679 if (!bmap
|| !space
|| !dim_map
)
11682 flags
= bmap
->flags
;
11683 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11684 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11685 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11686 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11687 res
= isl_basic_map_alloc_space(space
, n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11688 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11690 res
->flags
= flags
;
11691 res
= isl_basic_map_gauss(res
, NULL
);
11692 res
= isl_basic_map_finalize(res
);
11696 isl_basic_map_free(bmap
);
11697 isl_space_free(space
);
11701 /* Reorder the dimensions of "map" according to given reordering.
11703 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11704 __isl_take isl_reordering
*r
)
11707 struct isl_dim_map
*dim_map
;
11709 map
= isl_map_cow(map
);
11710 dim_map
= isl_dim_map_from_reordering(r
);
11711 if (!map
|| !r
|| !dim_map
)
11714 for (i
= 0; i
< map
->n
; ++i
) {
11715 struct isl_dim_map
*dim_map_i
;
11718 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11720 space
= isl_reordering_get_space(r
);
11721 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
], space
, dim_map_i
);
11727 map
= isl_map_reset_space(map
, isl_reordering_get_space(r
));
11728 map
= isl_map_unmark_normalized(map
);
11730 isl_reordering_free(r
);
11736 isl_reordering_free(r
);
11740 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11741 __isl_take isl_reordering
*r
)
11743 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11746 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11747 __isl_take isl_space
*model
)
11752 if (!map
|| !model
)
11755 ctx
= isl_space_get_ctx(model
);
11756 if (!isl_space_has_named_params(model
))
11757 isl_die(ctx
, isl_error_invalid
,
11758 "model has unnamed parameters", goto error
);
11759 if (isl_map_check_named_params(map
) < 0)
11761 aligned
= isl_map_space_has_equal_params(map
, model
);
11765 isl_reordering
*exp
;
11767 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11768 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11769 map
= isl_map_realign(map
, exp
);
11772 isl_space_free(model
);
11775 isl_space_free(model
);
11780 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11781 __isl_take isl_space
*model
)
11783 return isl_map_align_params(set
, model
);
11786 /* Align the parameters of "bmap" to those of "model", introducing
11787 * additional parameters if needed.
11789 __isl_give isl_basic_map
*isl_basic_map_align_params(
11790 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11793 isl_bool equal_params
;
11795 if (!bmap
|| !model
)
11798 ctx
= isl_space_get_ctx(model
);
11799 if (!isl_space_has_named_params(model
))
11800 isl_die(ctx
, isl_error_invalid
,
11801 "model has unnamed parameters", goto error
);
11802 if (isl_basic_map_check_named_params(bmap
) < 0)
11804 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11805 if (equal_params
< 0)
11807 if (!equal_params
) {
11808 isl_reordering
*exp
;
11809 struct isl_dim_map
*dim_map
;
11811 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11812 exp
= isl_reordering_extend_space(exp
,
11813 isl_basic_map_get_space(bmap
));
11814 dim_map
= isl_dim_map_from_reordering(exp
);
11815 bmap
= isl_basic_map_realign(bmap
,
11816 isl_reordering_get_space(exp
),
11817 isl_dim_map_extend(dim_map
, bmap
));
11818 isl_reordering_free(exp
);
11822 isl_space_free(model
);
11825 isl_space_free(model
);
11826 isl_basic_map_free(bmap
);
11830 /* Do "bset" and "space" have the same parameters?
11832 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11833 __isl_keep isl_space
*space
)
11835 isl_space
*bset_space
;
11837 bset_space
= isl_basic_set_peek_space(bset
);
11838 return isl_space_has_equal_params(bset_space
, space
);
11841 /* Do "map" and "space" have the same parameters?
11843 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11844 __isl_keep isl_space
*space
)
11846 isl_space
*map_space
;
11848 map_space
= isl_map_peek_space(map
);
11849 return isl_space_has_equal_params(map_space
, space
);
11852 /* Do "set" and "space" have the same parameters?
11854 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11855 __isl_keep isl_space
*space
)
11857 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11860 /* Align the parameters of "bset" to those of "model", introducing
11861 * additional parameters if needed.
11863 __isl_give isl_basic_set
*isl_basic_set_align_params(
11864 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11866 return isl_basic_map_align_params(bset
, model
);
11869 /* Drop all parameters not referenced by "map".
11871 __isl_give isl_map
*isl_map_drop_unused_params(__isl_take isl_map
*map
)
11875 if (isl_map_check_named_params(map
) < 0)
11876 return isl_map_free(map
);
11878 for (i
= isl_map_dim(map
, isl_dim_param
) - 1; i
>= 0; i
--) {
11881 involves
= isl_map_involves_dims(map
, isl_dim_param
, i
, 1);
11883 return isl_map_free(map
);
11885 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
11891 /* Drop all parameters not referenced by "set".
11893 __isl_give isl_set
*isl_set_drop_unused_params(
11894 __isl_take isl_set
*set
)
11896 return set_from_map(isl_map_drop_unused_params(set_to_map(set
)));
11899 /* Drop all parameters not referenced by "bmap".
11901 __isl_give isl_basic_map
*isl_basic_map_drop_unused_params(
11902 __isl_take isl_basic_map
*bmap
)
11906 if (isl_basic_map_check_named_params(bmap
) < 0)
11907 return isl_basic_map_free(bmap
);
11909 for (i
= isl_basic_map_dim(bmap
, isl_dim_param
) - 1; i
>= 0; i
--) {
11912 involves
= isl_basic_map_involves_dims(bmap
,
11913 isl_dim_param
, i
, 1);
11915 return isl_basic_map_free(bmap
);
11917 bmap
= isl_basic_map_drop(bmap
, isl_dim_param
, i
, 1);
11923 /* Drop all parameters not referenced by "bset".
11925 __isl_give isl_basic_set
*isl_basic_set_drop_unused_params(
11926 __isl_take isl_basic_set
*bset
)
11928 return bset_from_bmap(isl_basic_map_drop_unused_params(
11929 bset_to_bmap(bset
)));
11932 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11933 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11934 enum isl_dim_type c2
, enum isl_dim_type c3
,
11935 enum isl_dim_type c4
, enum isl_dim_type c5
)
11937 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11938 struct isl_mat
*mat
;
11944 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11945 isl_basic_map_total_dim(bmap
) + 1);
11948 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11949 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11950 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11951 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11952 isl_int_set(mat
->row
[i
][pos
],
11953 bmap
->eq
[i
][off
+ k
]);
11961 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11962 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11963 enum isl_dim_type c2
, enum isl_dim_type c3
,
11964 enum isl_dim_type c4
, enum isl_dim_type c5
)
11966 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11967 struct isl_mat
*mat
;
11973 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11974 isl_basic_map_total_dim(bmap
) + 1);
11977 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11978 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11979 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11980 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11981 isl_int_set(mat
->row
[i
][pos
],
11982 bmap
->ineq
[i
][off
+ k
]);
11990 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11991 __isl_take isl_space
*dim
,
11992 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11993 enum isl_dim_type c2
, enum isl_dim_type c3
,
11994 enum isl_dim_type c4
, enum isl_dim_type c5
)
11996 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11997 isl_basic_map
*bmap
;
12003 if (!dim
|| !eq
|| !ineq
)
12006 if (eq
->n_col
!= ineq
->n_col
)
12007 isl_die(dim
->ctx
, isl_error_invalid
,
12008 "equalities and inequalities matrices should have "
12009 "same number of columns", goto error
);
12011 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
12013 if (eq
->n_col
< total
)
12014 isl_die(dim
->ctx
, isl_error_invalid
,
12015 "number of columns too small", goto error
);
12017 extra
= eq
->n_col
- total
;
12019 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
12020 eq
->n_row
, ineq
->n_row
);
12023 for (i
= 0; i
< extra
; ++i
) {
12024 k
= isl_basic_map_alloc_div(bmap
);
12027 isl_int_set_si(bmap
->div
[k
][0], 0);
12029 for (i
= 0; i
< eq
->n_row
; ++i
) {
12030 l
= isl_basic_map_alloc_equality(bmap
);
12033 for (j
= 0, pos
= 0; j
< 5; ++j
) {
12034 int off
= isl_basic_map_offset(bmap
, c
[j
]);
12035 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
12036 isl_int_set(bmap
->eq
[l
][off
+ k
],
12042 for (i
= 0; i
< ineq
->n_row
; ++i
) {
12043 l
= isl_basic_map_alloc_inequality(bmap
);
12046 for (j
= 0, pos
= 0; j
< 5; ++j
) {
12047 int off
= isl_basic_map_offset(bmap
, c
[j
]);
12048 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
12049 isl_int_set(bmap
->ineq
[l
][off
+ k
],
12050 ineq
->row
[i
][pos
]);
12056 isl_space_free(dim
);
12058 isl_mat_free(ineq
);
12060 bmap
= isl_basic_map_simplify(bmap
);
12061 return isl_basic_map_finalize(bmap
);
12063 isl_space_free(dim
);
12065 isl_mat_free(ineq
);
12069 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
12070 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
12071 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
12073 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
12074 c1
, c2
, c3
, c4
, isl_dim_in
);
12077 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
12078 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
12079 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
12081 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
12082 c1
, c2
, c3
, c4
, isl_dim_in
);
12085 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
12086 __isl_take isl_space
*dim
,
12087 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
12088 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
12090 isl_basic_map
*bmap
;
12091 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
12092 c1
, c2
, c3
, c4
, isl_dim_in
);
12093 return bset_from_bmap(bmap
);
12096 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
12099 return isl_bool_error
;
12101 return isl_space_can_zip(bmap
->dim
);
12104 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
12107 return isl_bool_error
;
12109 return isl_space_can_zip(map
->dim
);
12112 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
12113 * (A -> C) -> (B -> D).
12115 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
12124 if (!isl_basic_map_can_zip(bmap
))
12125 isl_die(bmap
->ctx
, isl_error_invalid
,
12126 "basic map cannot be zipped", goto error
);
12127 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
12128 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
12129 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
12130 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
12131 bmap
= isl_basic_map_cow(bmap
);
12132 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
12135 bmap
->dim
= isl_space_zip(bmap
->dim
);
12138 bmap
= isl_basic_map_mark_final(bmap
);
12141 isl_basic_map_free(bmap
);
12145 /* Given a map (A -> B) -> (C -> D), return the corresponding map
12146 * (A -> C) -> (B -> D).
12148 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
12155 if (!isl_map_can_zip(map
))
12156 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
12159 map
= isl_map_cow(map
);
12163 for (i
= 0; i
< map
->n
; ++i
) {
12164 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
12169 map
->dim
= isl_space_zip(map
->dim
);
12179 /* Can we apply isl_basic_map_curry to "bmap"?
12180 * That is, does it have a nested relation in its domain?
12182 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
12185 return isl_bool_error
;
12187 return isl_space_can_curry(bmap
->dim
);
12190 /* Can we apply isl_map_curry to "map"?
12191 * That is, does it have a nested relation in its domain?
12193 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
12196 return isl_bool_error
;
12198 return isl_space_can_curry(map
->dim
);
12201 /* Given a basic map (A -> B) -> C, return the corresponding basic map
12204 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
12210 if (!isl_basic_map_can_curry(bmap
))
12211 isl_die(bmap
->ctx
, isl_error_invalid
,
12212 "basic map cannot be curried", goto error
);
12213 bmap
= isl_basic_map_cow(bmap
);
12216 bmap
->dim
= isl_space_curry(bmap
->dim
);
12219 bmap
= isl_basic_map_mark_final(bmap
);
12222 isl_basic_map_free(bmap
);
12226 /* Given a map (A -> B) -> C, return the corresponding map
12229 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
12231 return isl_map_change_space(map
, &isl_map_can_curry
,
12232 "map cannot be curried", &isl_space_curry
);
12235 /* Can isl_map_range_curry be applied to "map"?
12236 * That is, does it have a nested relation in its range,
12237 * the domain of which is itself a nested relation?
12239 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
12242 return isl_bool_error
;
12244 return isl_space_can_range_curry(map
->dim
);
12247 /* Given a map A -> ((B -> C) -> D), return the corresponding map
12248 * A -> (B -> (C -> D)).
12250 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
12252 return isl_map_change_space(map
, &isl_map_can_range_curry
,
12253 "map range cannot be curried",
12254 &isl_space_range_curry
);
12257 /* Can we apply isl_basic_map_uncurry to "bmap"?
12258 * That is, does it have a nested relation in its domain?
12260 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
12263 return isl_bool_error
;
12265 return isl_space_can_uncurry(bmap
->dim
);
12268 /* Can we apply isl_map_uncurry to "map"?
12269 * That is, does it have a nested relation in its domain?
12271 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
12274 return isl_bool_error
;
12276 return isl_space_can_uncurry(map
->dim
);
12279 /* Given a basic map A -> (B -> C), return the corresponding basic map
12282 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12288 if (!isl_basic_map_can_uncurry(bmap
))
12289 isl_die(bmap
->ctx
, isl_error_invalid
,
12290 "basic map cannot be uncurried",
12291 return isl_basic_map_free(bmap
));
12292 bmap
= isl_basic_map_cow(bmap
);
12295 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12297 return isl_basic_map_free(bmap
);
12298 bmap
= isl_basic_map_mark_final(bmap
);
12302 /* Given a map A -> (B -> C), return the corresponding map
12305 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12307 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12308 "map cannot be uncurried", &isl_space_uncurry
);
12311 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12312 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12314 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12317 /* Construct a basic map where the given dimensions are equal to each other.
12319 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12320 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12322 isl_basic_map
*bmap
= NULL
;
12328 if (pos1
>= isl_space_dim(space
, type1
))
12329 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12330 "index out of bounds", goto error
);
12331 if (pos2
>= isl_space_dim(space
, type2
))
12332 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12333 "index out of bounds", goto error
);
12335 if (type1
== type2
&& pos1
== pos2
)
12336 return isl_basic_map_universe(space
);
12338 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12339 i
= isl_basic_map_alloc_equality(bmap
);
12342 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12343 pos1
+= isl_basic_map_offset(bmap
, type1
);
12344 pos2
+= isl_basic_map_offset(bmap
, type2
);
12345 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12346 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12347 bmap
= isl_basic_map_finalize(bmap
);
12348 isl_space_free(space
);
12351 isl_space_free(space
);
12352 isl_basic_map_free(bmap
);
12356 /* Add a constraint imposing that the given two dimensions are equal.
12358 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12359 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12363 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12365 bmap
= isl_basic_map_intersect(bmap
, eq
);
12370 /* Add a constraint imposing that the given two dimensions are equal.
12372 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12373 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12375 isl_basic_map
*bmap
;
12377 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12379 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12384 /* Add a constraint imposing that the given two dimensions have opposite values.
12386 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12387 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12389 isl_basic_map
*bmap
= NULL
;
12395 if (pos1
>= isl_map_dim(map
, type1
))
12396 isl_die(map
->ctx
, isl_error_invalid
,
12397 "index out of bounds", goto error
);
12398 if (pos2
>= isl_map_dim(map
, type2
))
12399 isl_die(map
->ctx
, isl_error_invalid
,
12400 "index out of bounds", goto error
);
12402 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12403 i
= isl_basic_map_alloc_equality(bmap
);
12406 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12407 pos1
+= isl_basic_map_offset(bmap
, type1
);
12408 pos2
+= isl_basic_map_offset(bmap
, type2
);
12409 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12410 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12411 bmap
= isl_basic_map_finalize(bmap
);
12413 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12417 isl_basic_map_free(bmap
);
12422 /* Construct a constraint imposing that the value of the first dimension is
12423 * greater than or equal to that of the second.
12425 static __isl_give isl_constraint
*constraint_order_ge(
12426 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12427 enum isl_dim_type type2
, int pos2
)
12434 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12436 if (pos1
>= isl_constraint_dim(c
, type1
))
12437 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12438 "index out of bounds", return isl_constraint_free(c
));
12439 if (pos2
>= isl_constraint_dim(c
, type2
))
12440 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12441 "index out of bounds", return isl_constraint_free(c
));
12443 if (type1
== type2
&& pos1
== pos2
)
12446 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12447 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12452 /* Add a constraint imposing that the value of the first dimension is
12453 * greater than or equal to that of the second.
12455 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12456 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12461 if (type1
== type2
&& pos1
== pos2
)
12463 space
= isl_basic_map_get_space(bmap
);
12464 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12465 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12470 /* Add a constraint imposing that the value of the first dimension is
12471 * greater than or equal to that of the second.
12473 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12474 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12479 if (type1
== type2
&& pos1
== pos2
)
12481 space
= isl_map_get_space(map
);
12482 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12483 map
= isl_map_add_constraint(map
, c
);
12488 /* Add a constraint imposing that the value of the first dimension is
12489 * less than or equal to that of the second.
12491 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12492 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12494 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12497 /* Construct a basic map where the value of the first dimension is
12498 * greater than that of the second.
12500 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12501 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12503 isl_basic_map
*bmap
= NULL
;
12509 if (pos1
>= isl_space_dim(space
, type1
))
12510 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12511 "index out of bounds", goto error
);
12512 if (pos2
>= isl_space_dim(space
, type2
))
12513 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12514 "index out of bounds", goto error
);
12516 if (type1
== type2
&& pos1
== pos2
)
12517 return isl_basic_map_empty(space
);
12519 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12520 i
= isl_basic_map_alloc_inequality(bmap
);
12522 return isl_basic_map_free(bmap
);
12523 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12524 pos1
+= isl_basic_map_offset(bmap
, type1
);
12525 pos2
+= isl_basic_map_offset(bmap
, type2
);
12526 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12527 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12528 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12529 bmap
= isl_basic_map_finalize(bmap
);
12533 isl_space_free(space
);
12534 isl_basic_map_free(bmap
);
12538 /* Add a constraint imposing that the value of the first dimension is
12539 * greater than that of the second.
12541 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12542 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12546 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12548 bmap
= isl_basic_map_intersect(bmap
, gt
);
12553 /* Add a constraint imposing that the value of the first dimension is
12554 * greater than that of the second.
12556 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12557 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12559 isl_basic_map
*bmap
;
12561 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12563 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12568 /* Add a constraint imposing that the value of the first dimension is
12569 * smaller than that of the second.
12571 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12572 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12574 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12577 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12581 isl_local_space
*ls
;
12586 if (!isl_basic_map_divs_known(bmap
))
12587 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12588 "some divs are unknown", return NULL
);
12590 ls
= isl_basic_map_get_local_space(bmap
);
12591 div
= isl_local_space_get_div(ls
, pos
);
12592 isl_local_space_free(ls
);
12597 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12600 return isl_basic_map_get_div(bset
, pos
);
12603 /* Plug in "subs" for dimension "type", "pos" of "bset".
12605 * Let i be the dimension to replace and let "subs" be of the form
12609 * Any integer division with a non-zero coefficient for i,
12611 * floor((a i + g)/m)
12615 * floor((a f + d g)/(m d))
12617 * Constraints of the form
12625 * We currently require that "subs" is an integral expression.
12626 * Handling rational expressions may require us to add stride constraints
12627 * as we do in isl_basic_set_preimage_multi_aff.
12629 __isl_give isl_basic_set
*isl_basic_set_substitute(
12630 __isl_take isl_basic_set
*bset
,
12631 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12637 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12640 bset
= isl_basic_set_cow(bset
);
12641 if (!bset
|| !subs
)
12644 ctx
= isl_basic_set_get_ctx(bset
);
12645 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12646 isl_die(ctx
, isl_error_invalid
,
12647 "spaces don't match", goto error
);
12648 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12649 isl_die(ctx
, isl_error_unsupported
,
12650 "cannot handle divs yet", goto error
);
12651 if (!isl_int_is_one(subs
->v
->el
[0]))
12652 isl_die(ctx
, isl_error_invalid
,
12653 "can only substitute integer expressions", goto error
);
12655 pos
+= isl_basic_set_offset(bset
, type
);
12659 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12660 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12662 isl_int_set(v
, bset
->eq
[i
][pos
]);
12663 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12664 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12665 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12668 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12669 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12671 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12672 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12673 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12674 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12677 for (i
= 0; i
< bset
->n_div
; ++i
) {
12678 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12680 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12681 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12682 isl_seq_combine(bset
->div
[i
] + 1,
12683 subs
->v
->el
[0], bset
->div
[i
] + 1,
12684 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12685 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12690 bset
= isl_basic_set_simplify(bset
);
12691 return isl_basic_set_finalize(bset
);
12693 isl_basic_set_free(bset
);
12697 /* Plug in "subs" for dimension "type", "pos" of "set".
12699 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12700 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12704 if (set
&& isl_set_plain_is_empty(set
))
12707 set
= isl_set_cow(set
);
12711 for (i
= set
->n
- 1; i
>= 0; --i
) {
12712 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12713 set
= set_from_map(remove_if_empty(set_to_map(set
), i
));
12724 /* Check if the range of "ma" is compatible with the domain or range
12725 * (depending on "type") of "bmap".
12727 static isl_stat
check_basic_map_compatible_range_multi_aff(
12728 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12729 __isl_keep isl_multi_aff
*ma
)
12732 isl_space
*ma_space
;
12734 ma_space
= isl_multi_aff_get_space(ma
);
12736 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12740 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12741 "parameters don't match", goto error
);
12742 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12746 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12747 "spaces don't match", goto error
);
12749 isl_space_free(ma_space
);
12750 return isl_stat_ok
;
12752 isl_space_free(ma_space
);
12753 return isl_stat_error
;
12756 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12757 * coefficients before the transformed range of dimensions,
12758 * the "n_after" coefficients after the transformed range of dimensions
12759 * and the coefficients of the other divs in "bmap".
12761 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12762 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12767 isl_local_space
*ls
;
12772 ls
= isl_aff_get_domain_local_space(ma
->u
.p
[0]);
12776 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12777 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12778 for (i
= 0; i
< n_div
; ++i
) {
12779 int o_bmap
= 0, o_ls
= 0;
12781 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12782 o_bmap
+= 1 + 1 + n_param
;
12783 o_ls
+= 1 + 1 + n_param
;
12784 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12785 o_bmap
+= n_before
;
12786 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12787 ls
->div
->row
[i
] + o_ls
, n_set
);
12790 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12792 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12793 ls
->div
->row
[i
] + o_ls
, n_div
);
12796 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12797 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12801 isl_local_space_free(ls
);
12804 isl_local_space_free(ls
);
12808 /* How many stride constraints does "ma" enforce?
12809 * That is, how many of the affine expressions have a denominator
12810 * different from one?
12812 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12817 for (i
= 0; i
< ma
->n
; ++i
)
12818 if (!isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12824 /* For each affine expression in ma of the form
12826 * x_i = (f_i y + h_i)/m_i
12828 * with m_i different from one, add a constraint to "bmap"
12831 * f_i y + h_i = m_i alpha_i
12833 * with alpha_i an additional existentially quantified variable.
12835 * The input variables of "ma" correspond to a subset of the variables
12836 * of "bmap". There are "n_before" variables in "bmap" before this
12837 * subset and "n_after" variables after this subset.
12838 * The integer divisions of the affine expressions in "ma" are assumed
12839 * to have been aligned. There are "n_div_ma" of them and
12840 * they appear first in "bmap", straight after the "n_after" variables.
12842 static __isl_give isl_basic_map
*add_ma_strides(
12843 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12844 int n_before
, int n_after
, int n_div_ma
)
12852 total
= isl_basic_map_total_dim(bmap
);
12853 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12854 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12855 for (i
= 0; i
< ma
->n
; ++i
) {
12856 int o_bmap
= 0, o_ma
= 1;
12858 if (isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12860 div
= isl_basic_map_alloc_div(bmap
);
12861 k
= isl_basic_map_alloc_equality(bmap
);
12862 if (div
< 0 || k
< 0)
12864 isl_int_set_si(bmap
->div
[div
][0], 0);
12865 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12866 ma
->u
.p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12867 o_bmap
+= 1 + n_param
;
12868 o_ma
+= 1 + n_param
;
12869 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12870 o_bmap
+= n_before
;
12871 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12872 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_in
);
12875 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12877 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12878 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12879 o_bmap
+= n_div_ma
;
12881 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12882 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->u
.p
[i
]->v
->el
[0]);
12888 isl_basic_map_free(bmap
);
12892 /* Replace the domain or range space (depending on "type) of "space" by "set".
12894 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12895 enum isl_dim_type type
, __isl_take isl_space
*set
)
12897 if (type
== isl_dim_in
) {
12898 space
= isl_space_range(space
);
12899 space
= isl_space_map_from_domain_and_range(set
, space
);
12901 space
= isl_space_domain(space
);
12902 space
= isl_space_map_from_domain_and_range(space
, set
);
12908 /* Compute the preimage of the domain or range (depending on "type")
12909 * of "bmap" under the function represented by "ma".
12910 * In other words, plug in "ma" in the domain or range of "bmap".
12911 * The result is a basic map that lives in the same space as "bmap"
12912 * except that the domain or range has been replaced by
12913 * the domain space of "ma".
12915 * If bmap is represented by
12917 * A(p) + S u + B x + T v + C(divs) >= 0,
12919 * where u and x are input and output dimensions if type == isl_dim_out
12920 * while x and v are input and output dimensions if type == isl_dim_in,
12921 * and ma is represented by
12923 * x = D(p) + F(y) + G(divs')
12925 * then the result is
12927 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12929 * The divs in the input set are similarly adjusted.
12932 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12936 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12937 * B_i G(divs') + c_i(divs))/n_i)
12939 * If bmap is not a rational map and if F(y) involves any denominators
12941 * x_i = (f_i y + h_i)/m_i
12943 * then additional constraints are added to ensure that we only
12944 * map back integer points. That is we enforce
12946 * f_i y + h_i = m_i alpha_i
12948 * with alpha_i an additional existentially quantified variable.
12950 * We first copy over the divs from "ma".
12951 * Then we add the modified constraints and divs from "bmap".
12952 * Finally, we add the stride constraints, if needed.
12954 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12955 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12956 __isl_take isl_multi_aff
*ma
)
12960 isl_basic_map
*res
= NULL
;
12961 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12962 isl_int f
, c1
, c2
, g
;
12971 ma
= isl_multi_aff_align_divs(ma
);
12974 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12977 if (type
== isl_dim_in
) {
12979 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12981 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12984 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12985 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
12987 space
= isl_multi_aff_get_domain_space(ma
);
12988 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12989 rational
= isl_basic_map_is_rational(bmap
);
12990 strides
= rational
? 0 : multi_aff_strides(ma
);
12991 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12992 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12994 res
= isl_basic_map_set_rational(res
);
12996 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12997 if (isl_basic_map_alloc_div(res
) < 0)
13000 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
13003 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
13004 k
= isl_basic_map_alloc_equality(res
);
13007 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
13008 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13011 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
13012 k
= isl_basic_map_alloc_inequality(res
);
13015 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
13016 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13019 for (i
= 0; i
< bmap
->n_div
; ++i
) {
13020 if (isl_int_is_zero(bmap
->div
[i
][0])) {
13021 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
13024 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
13025 n_before
, n_after
, n_div_ma
, n_div_bmap
,
13030 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
13036 isl_basic_map_free(bmap
);
13037 isl_multi_aff_free(ma
);
13038 res
= isl_basic_map_simplify(res
);
13039 return isl_basic_map_finalize(res
);
13045 isl_basic_map_free(bmap
);
13046 isl_multi_aff_free(ma
);
13047 isl_basic_map_free(res
);
13051 /* Compute the preimage of "bset" under the function represented by "ma".
13052 * In other words, plug in "ma" in "bset". The result is a basic set
13053 * that lives in the domain space of "ma".
13055 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
13056 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
13058 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
13061 /* Compute the preimage of the domain of "bmap" under the function
13062 * represented by "ma".
13063 * In other words, plug in "ma" in the domain of "bmap".
13064 * The result is a basic map that lives in the same space as "bmap"
13065 * except that the domain has been replaced by the domain space of "ma".
13067 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
13068 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13070 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
13073 /* Compute the preimage of the range of "bmap" under the function
13074 * represented by "ma".
13075 * In other words, plug in "ma" in the range of "bmap".
13076 * The result is a basic map that lives in the same space as "bmap"
13077 * except that the range has been replaced by the domain space of "ma".
13079 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
13080 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13082 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
13085 /* Check if the range of "ma" is compatible with the domain or range
13086 * (depending on "type") of "map".
13087 * Return isl_stat_error if anything is wrong.
13089 static isl_stat
check_map_compatible_range_multi_aff(
13090 __isl_keep isl_map
*map
, enum isl_dim_type type
,
13091 __isl_keep isl_multi_aff
*ma
)
13094 isl_space
*ma_space
;
13096 ma_space
= isl_multi_aff_get_space(ma
);
13097 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
13098 isl_space_free(ma_space
);
13100 return isl_stat_error
;
13102 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
13103 "spaces don't match", return isl_stat_error
);
13104 return isl_stat_ok
;
13107 /* Compute the preimage of the domain or range (depending on "type")
13108 * of "map" under the function represented by "ma".
13109 * In other words, plug in "ma" in the domain or range of "map".
13110 * The result is a map that lives in the same space as "map"
13111 * except that the domain or range has been replaced by
13112 * the domain space of "ma".
13114 * The parameters are assumed to have been aligned.
13116 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13117 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13122 map
= isl_map_cow(map
);
13123 ma
= isl_multi_aff_align_divs(ma
);
13126 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13129 for (i
= 0; i
< map
->n
; ++i
) {
13130 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13131 isl_multi_aff_copy(ma
));
13136 space
= isl_multi_aff_get_domain_space(ma
);
13137 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13139 isl_space_free(map
->dim
);
13144 isl_multi_aff_free(ma
);
13146 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13147 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13150 isl_multi_aff_free(ma
);
13155 /* Compute the preimage of the domain or range (depending on "type")
13156 * of "map" under the function represented by "ma".
13157 * In other words, plug in "ma" in the domain or range of "map".
13158 * The result is a map that lives in the same space as "map"
13159 * except that the domain or range has been replaced by
13160 * the domain space of "ma".
13162 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13163 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13170 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13174 return map_preimage_multi_aff(map
, type
, ma
);
13176 if (isl_map_check_named_params(map
) < 0)
13178 if (!isl_space_has_named_params(ma
->space
))
13179 isl_die(map
->ctx
, isl_error_invalid
,
13180 "unaligned unnamed parameters", goto error
);
13181 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13182 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13184 return map_preimage_multi_aff(map
, type
, ma
);
13186 isl_multi_aff_free(ma
);
13187 return isl_map_free(map
);
13190 /* Compute the preimage of "set" under the function represented by "ma".
13191 * In other words, plug in "ma" in "set". The result is a set
13192 * that lives in the domain space of "ma".
13194 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13195 __isl_take isl_multi_aff
*ma
)
13197 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13200 /* Compute the preimage of the domain of "map" under the function
13201 * represented by "ma".
13202 * In other words, plug in "ma" in the domain of "map".
13203 * The result is a map that lives in the same space as "map"
13204 * except that the domain has been replaced by the domain space of "ma".
13206 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13207 __isl_take isl_multi_aff
*ma
)
13209 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13212 /* Compute the preimage of the range of "map" under the function
13213 * represented by "ma".
13214 * In other words, plug in "ma" in the range of "map".
13215 * The result is a map that lives in the same space as "map"
13216 * except that the range has been replaced by the domain space of "ma".
13218 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13219 __isl_take isl_multi_aff
*ma
)
13221 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13224 /* Compute the preimage of "map" under the function represented by "pma".
13225 * In other words, plug in "pma" in the domain or range of "map".
13226 * The result is a map that lives in the same space as "map",
13227 * except that the space of type "type" has been replaced by
13228 * the domain space of "pma".
13230 * The parameters of "map" and "pma" are assumed to have been aligned.
13232 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13233 __isl_take isl_map
*map
, enum isl_dim_type type
,
13234 __isl_take isl_pw_multi_aff
*pma
)
13243 isl_pw_multi_aff_free(pma
);
13244 res
= isl_map_empty(isl_map_get_space(map
));
13249 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13250 isl_multi_aff_copy(pma
->p
[0].maff
));
13251 if (type
== isl_dim_in
)
13252 res
= isl_map_intersect_domain(res
,
13253 isl_map_copy(pma
->p
[0].set
));
13255 res
= isl_map_intersect_range(res
,
13256 isl_map_copy(pma
->p
[0].set
));
13258 for (i
= 1; i
< pma
->n
; ++i
) {
13261 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13262 isl_multi_aff_copy(pma
->p
[i
].maff
));
13263 if (type
== isl_dim_in
)
13264 res_i
= isl_map_intersect_domain(res_i
,
13265 isl_map_copy(pma
->p
[i
].set
));
13267 res_i
= isl_map_intersect_range(res_i
,
13268 isl_map_copy(pma
->p
[i
].set
));
13269 res
= isl_map_union(res
, res_i
);
13272 isl_pw_multi_aff_free(pma
);
13276 isl_pw_multi_aff_free(pma
);
13281 /* Compute the preimage of "map" under the function represented by "pma".
13282 * In other words, plug in "pma" in the domain or range of "map".
13283 * The result is a map that lives in the same space as "map",
13284 * except that the space of type "type" has been replaced by
13285 * the domain space of "pma".
13287 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13288 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13295 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13299 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13301 if (isl_map_check_named_params(map
) < 0)
13303 if (isl_pw_multi_aff_check_named_params(pma
) < 0)
13305 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13306 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13308 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13310 isl_pw_multi_aff_free(pma
);
13311 return isl_map_free(map
);
13314 /* Compute the preimage of "set" under the function represented by "pma".
13315 * In other words, plug in "pma" in "set". The result is a set
13316 * that lives in the domain space of "pma".
13318 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13319 __isl_take isl_pw_multi_aff
*pma
)
13321 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13324 /* Compute the preimage of the domain of "map" under the function
13325 * represented by "pma".
13326 * In other words, plug in "pma" in the domain of "map".
13327 * The result is a map that lives in the same space as "map",
13328 * except that domain space has been replaced by the domain space of "pma".
13330 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13331 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13333 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13336 /* Compute the preimage of the range of "map" under the function
13337 * represented by "pma".
13338 * In other words, plug in "pma" in the range of "map".
13339 * The result is a map that lives in the same space as "map",
13340 * except that range space has been replaced by the domain space of "pma".
13342 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13343 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13345 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13348 /* Compute the preimage of "map" under the function represented by "mpa".
13349 * In other words, plug in "mpa" in the domain or range of "map".
13350 * The result is a map that lives in the same space as "map",
13351 * except that the space of type "type" has been replaced by
13352 * the domain space of "mpa".
13354 * If the map does not involve any constraints that refer to the
13355 * dimensions of the substituted space, then the only possible
13356 * effect of "mpa" on the map is to map the space to a different space.
13357 * We create a separate isl_multi_aff to effectuate this change
13358 * in order to avoid spurious splitting of the map along the pieces
13360 * If "mpa" has a non-trivial explicit domain, however,
13361 * then the full substitution should be performed.
13363 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13364 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13368 isl_pw_multi_aff
*pma
;
13373 n
= isl_map_dim(map
, type
);
13374 full
= isl_map_involves_dims(map
, type
, 0, n
);
13375 if (full
>= 0 && !full
)
13376 full
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
13383 space
= isl_multi_pw_aff_get_space(mpa
);
13384 isl_multi_pw_aff_free(mpa
);
13385 ma
= isl_multi_aff_zero(space
);
13386 return isl_map_preimage_multi_aff(map
, type
, ma
);
13389 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13390 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13393 isl_multi_pw_aff_free(mpa
);
13397 /* Compute the preimage of "map" under the function represented by "mpa".
13398 * In other words, plug in "mpa" in the domain "map".
13399 * The result is a map that lives in the same space as "map",
13400 * except that domain space has been replaced by the domain space of "mpa".
13402 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13403 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13405 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13408 /* Compute the preimage of "set" by the function represented by "mpa".
13409 * In other words, plug in "mpa" in "set".
13411 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13412 __isl_take isl_multi_pw_aff
*mpa
)
13414 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13417 /* Return a copy of the equality constraints of "bset" as a matrix.
13419 __isl_give isl_mat
*isl_basic_set_extract_equalities(
13420 __isl_keep isl_basic_set
*bset
)
13428 ctx
= isl_basic_set_get_ctx(bset
);
13429 total
= 1 + isl_basic_set_dim(bset
, isl_dim_all
);
13430 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, total
);
13433 /* Are the "n" "coefficients" starting at "first" of the integer division
13434 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13436 * The "coefficient" at position 0 is the denominator.
13437 * The "coefficient" at position 1 is the constant term.
13439 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13440 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13441 unsigned first
, unsigned n
)
13443 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13444 return isl_bool_error
;
13445 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13446 return isl_bool_error
;
13447 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13448 bmap2
->div
[pos2
] + first
, n
);
13451 /* Are the integer division expressions at position "pos1" in "bmap1" and
13452 * "pos2" in "bmap2" equal to each other, except that the constant terms
13455 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13456 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13457 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13462 if (!bmap1
|| !bmap2
)
13463 return isl_bool_error
;
13464 total
= isl_basic_map_total_dim(bmap1
);
13465 if (total
!= isl_basic_map_total_dim(bmap2
))
13466 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13467 "incomparable div expressions", return isl_bool_error
);
13468 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13470 if (equal
< 0 || !equal
)
13472 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13474 if (equal
< 0 || equal
)
13475 return isl_bool_not(equal
);
13476 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13480 /* Replace the numerator of the constant term of the integer division
13481 * expression at position "div" in "bmap" by "value".
13482 * The caller guarantees that this does not change the meaning
13485 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13486 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13488 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13489 return isl_basic_map_free(bmap
);
13491 isl_int_set_si(bmap
->div
[div
][1], value
);
13496 /* Is the point "inner" internal to inequality constraint "ineq"
13498 * The point is considered to be internal to the inequality constraint,
13499 * if it strictly lies on the positive side of the inequality constraint,
13500 * or if it lies on the constraint and the constraint is lexico-positive.
13502 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13503 __isl_keep isl_basic_set
*bset
, int ineq
)
13509 if (!inner
|| !bset
)
13510 return isl_bool_error
;
13512 ctx
= isl_basic_set_get_ctx(bset
);
13513 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13514 &ctx
->normalize_gcd
);
13515 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13516 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13518 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13519 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13520 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13523 /* Tighten the inequality constraints of "bset" that are outward with respect
13524 * to the point "vec".
13525 * That is, tighten the constraints that are not satisfied by "vec".
13527 * "vec" is a point internal to some superset S of "bset" that is used
13528 * to make the subsets of S disjoint, by tightening one half of the constraints
13529 * that separate two subsets. In particular, the constraints of S
13530 * are all satisfied by "vec" and should not be tightened.
13531 * Of the internal constraints, those that have "vec" on the outside
13532 * are tightened. The shared facet is included in the adjacent subset
13533 * with the opposite constraint.
13534 * For constraints that saturate "vec", this criterion cannot be used
13535 * to determine which of the two sides should be tightened.
13536 * Instead, the sign of the first non-zero coefficient is used
13537 * to make this choice. Note that this second criterion is never used
13538 * on the constraints of S since "vec" is interior to "S".
13540 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13541 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13545 bset
= isl_basic_set_cow(bset
);
13548 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13551 internal
= is_internal(vec
, bset
, j
);
13553 return isl_basic_set_free(bset
);
13556 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13562 /* Replace the variables x of type "type" starting at "first" in "bmap"
13563 * by x' with x = M x' with M the matrix trans.
13564 * That is, replace the corresponding coefficients c by c M.
13566 * The transformation matrix should be a square matrix.
13568 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13569 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13570 __isl_take isl_mat
*trans
)
13574 bmap
= isl_basic_map_cow(bmap
);
13575 if (!bmap
|| !trans
)
13578 if (trans
->n_row
!= trans
->n_col
)
13579 isl_die(trans
->ctx
, isl_error_invalid
,
13580 "expecting square transformation matrix", goto error
);
13581 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13582 isl_die(trans
->ctx
, isl_error_invalid
,
13583 "oversized transformation matrix", goto error
);
13585 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13587 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13588 isl_mat_copy(trans
)) < 0)
13590 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13591 isl_mat_copy(trans
)) < 0)
13593 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13594 isl_mat_copy(trans
)) < 0)
13597 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
13598 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13600 isl_mat_free(trans
);
13603 isl_mat_free(trans
);
13604 isl_basic_map_free(bmap
);
13608 /* Replace the variables x of type "type" starting at "first" in "bset"
13609 * by x' with x = M x' with M the matrix trans.
13610 * That is, replace the corresponding coefficients c by c M.
13612 * The transformation matrix should be a square matrix.
13614 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13615 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13616 __isl_take isl_mat
*trans
)
13618 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);