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
8 * Copyright 2018-2019 Cerebras Systems
9 * Copyright 2022 Cerebras Systems
11 * Use of this software is governed by the MIT license
13 * Written by Sven Verdoolaege, K.U.Leuven, Departement
14 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
15 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
16 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
17 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
18 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
19 * B.P. 105 - 78153 Le Chesnay, France
20 * and Centre de Recherche Inria de Paris, 2 rue Simone Iff - Voie DQ12,
21 * CS 42112, 75589 Paris Cedex 12, France
22 * and Cerebras Systems, 175 S San Antonio Rd, Los Altos, CA, USA
26 #include <isl_ctx_private.h>
27 #include <isl_map_private.h>
29 #include <isl_id_private.h>
30 #include <isl/constraint.h>
31 #include "isl_space_private.h"
32 #include "isl_equalities.h"
33 #include <isl_lp_private.h>
37 #include <isl_reordering.h>
38 #include "isl_sample.h"
42 #include <isl_mat_private.h>
43 #include <isl_vec_private.h>
44 #include <isl_dim_map.h>
45 #include <isl_local_space_private.h>
46 #include <isl_aff_private.h>
47 #include <isl_options_private.h>
48 #include <isl_morph.h>
49 #include <isl_val_private.h>
50 #include <isl_printer_private.h>
52 #include <bset_to_bmap.c>
53 #include <bset_from_bmap.c>
54 #include <set_to_map.c>
55 #include <set_from_map.c>
57 /* Treat "bset" as a basic map.
58 * Internally, isl_basic_set is defined to isl_basic_map, so in practice,
59 * this function performs a redundant cast.
61 static __isl_keep
const isl_basic_map
*const_bset_to_bmap(
62 __isl_keep
const isl_basic_set
*bset
)
64 return (const isl_basic_map
*) bset
;
68 #define TYPE isl_basic_map
69 #include "has_single_reference_templ.c"
71 static unsigned pos(__isl_keep isl_space
*space
, enum isl_dim_type type
)
74 case isl_dim_param
: return 1;
75 case isl_dim_in
: return 1 + space
->nparam
;
76 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
81 isl_size
isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
82 enum isl_dim_type type
)
85 return isl_size_error
;
87 case isl_dim_cst
: return 1;
90 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
91 case isl_dim_div
: return bmap
->n_div
;
92 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
97 /* Return the space of "map".
99 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
101 return map
? map
->dim
: NULL
;
104 /* Return the space of "set".
106 __isl_keep isl_space
*isl_set_peek_space(__isl_keep isl_set
*set
)
108 return isl_map_peek_space(set_to_map(set
));
111 isl_size
isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
113 return isl_space_dim(isl_map_peek_space(map
), type
);
116 /* Return the dimensionality of the domain (tuple) of the map.
118 isl_size
isl_map_domain_tuple_dim(__isl_keep isl_map
*map
)
120 return isl_map_dim(map
, isl_dim_in
);
123 /* Return the dimensionality of the range (tuple) of the map.
125 isl_size
isl_map_range_tuple_dim(__isl_keep isl_map
*map
)
127 return isl_map_dim(map
, isl_dim_out
);
130 isl_size
isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
132 return isl_map_dim(set_to_map(set
), type
);
135 /* Return the dimensionality of the (tuple of the) set.
137 isl_size
isl_set_tuple_dim(__isl_keep isl_set
*set
)
139 return isl_set_dim(set
, isl_dim_set
);
142 /* Return the position of the variables of the given type
143 * within the sequence of variables of "bmap".
145 isl_size
isl_basic_map_var_offset(__isl_keep isl_basic_map
*bmap
,
146 enum isl_dim_type type
)
150 space
= isl_basic_map_peek_space(bmap
);
155 case isl_dim_out
: return isl_space_offset(space
, type
);
156 case isl_dim_div
: return isl_space_dim(space
, isl_dim_all
);
159 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
160 "invalid dimension type", return isl_size_error
);
164 /* Return the position of the variables of the given type
165 * within the sequence of variables of "bset".
167 isl_size
isl_basic_set_var_offset(__isl_keep isl_basic_set
*bset
,
168 enum isl_dim_type type
)
170 return isl_basic_map_var_offset(bset_to_bmap(bset
), type
);
173 /* Return the position of the coefficients of the variables of the given type
174 * within the sequence of coefficients of "bmap".
176 unsigned isl_basic_map_offset(__isl_keep isl_basic_map
*bmap
,
177 enum isl_dim_type type
)
180 case isl_dim_cst
: return 0;
184 case isl_dim_div
: return 1 + isl_basic_map_var_offset(bmap
, type
);
189 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
190 enum isl_dim_type type
)
192 return isl_basic_map_offset(bset
, type
);
195 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
197 return pos(map
->dim
, type
);
200 isl_size
isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
201 enum isl_dim_type type
)
203 return isl_basic_map_dim(bset
, type
);
206 isl_size
isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
208 return isl_basic_set_dim(bset
, isl_dim_set
);
211 isl_size
isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
213 return isl_basic_set_dim(bset
, isl_dim_param
);
216 isl_size
isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
218 return isl_basic_map_total_dim(const_bset_to_bmap(bset
));
221 isl_size
isl_set_n_dim(__isl_keep isl_set
*set
)
223 return isl_set_dim(set
, isl_dim_set
);
226 isl_size
isl_set_n_param(__isl_keep isl_set
*set
)
228 return isl_set_dim(set
, isl_dim_param
);
231 isl_size
isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
236 return isl_size_error
;
237 dim
= isl_space_dim(bmap
->dim
, isl_dim_all
);
239 return isl_size_error
;
240 return dim
+ bmap
->n_div
;
243 /* Return the number of equality constraints in the description of "bmap".
244 * Return isl_size_error on error.
246 isl_size
isl_basic_map_n_equality(__isl_keep isl_basic_map
*bmap
)
249 return isl_size_error
;
253 /* Return the number of equality constraints in the description of "bset".
254 * Return isl_size_error on error.
256 isl_size
isl_basic_set_n_equality(__isl_keep isl_basic_set
*bset
)
258 return isl_basic_map_n_equality(bset_to_bmap(bset
));
261 /* Return the number of inequality constraints in the description of "bmap".
262 * Return isl_size_error on error.
264 isl_size
isl_basic_map_n_inequality(__isl_keep isl_basic_map
*bmap
)
267 return isl_size_error
;
271 /* Return the number of inequality constraints in the description of "bset".
272 * Return isl_size_error on error.
274 isl_size
isl_basic_set_n_inequality(__isl_keep isl_basic_set
*bset
)
276 return isl_basic_map_n_inequality(bset_to_bmap(bset
));
279 /* Do "bmap1" and "bmap2" have the same parameters?
281 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
282 __isl_keep isl_basic_map
*bmap2
)
284 isl_space
*space1
, *space2
;
286 space1
= isl_basic_map_peek_space(bmap1
);
287 space2
= isl_basic_map_peek_space(bmap2
);
288 return isl_space_has_equal_params(space1
, space2
);
291 /* Do "map1" and "map2" have the same parameters?
293 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
294 __isl_keep isl_map
*map2
)
296 isl_space
*space1
, *space2
;
298 space1
= isl_map_peek_space(map1
);
299 space2
= isl_map_peek_space(map2
);
300 return isl_space_has_equal_params(space1
, space2
);
303 /* Do "map" and "set" have the same parameters?
305 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
306 __isl_keep isl_set
*set
)
308 return isl_map_has_equal_params(map
, set_to_map(set
));
311 /* Is the tuple of type "type" of "bmap" the same as the single tuple of "bset"?
313 static isl_bool
isl_basic_map_set_tuple_is_equal(__isl_keep isl_basic_map
*bmap
,
314 enum isl_dim_type type
, __isl_keep isl_basic_set
*bset
)
316 isl_space
*bmap_space
, *bset_space
;
318 bmap_space
= isl_basic_map_peek_space(bmap
);
319 bset_space
= isl_basic_set_peek_space(bset
);
320 return isl_space_tuple_is_equal(bmap_space
, type
,
321 bset_space
, isl_dim_set
);
324 /* Is the tuple of type "type" of "map" the same as the single tuple of "set"?
326 static isl_bool
isl_map_set_tuple_is_equal(__isl_keep isl_map
*map
,
327 enum isl_dim_type type
, __isl_keep isl_set
*set
)
329 return isl_map_tuple_is_equal(map
, type
, set_to_map(set
), isl_dim_set
);
332 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
333 __isl_keep isl_set
*set
)
337 return isl_bool_error
;
338 m
= isl_map_has_equal_params(map
, set_to_map(set
));
341 return isl_map_set_tuple_is_equal(map
, isl_dim_in
, set
);
344 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
345 __isl_keep isl_basic_set
*bset
)
349 return isl_bool_error
;
350 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
353 return isl_basic_map_set_tuple_is_equal(bmap
, isl_dim_in
, bset
);
356 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
357 __isl_keep isl_set
*set
)
361 return isl_bool_error
;
362 m
= isl_map_has_equal_params(map
, set_to_map(set
));
365 return isl_map_set_tuple_is_equal(map
, isl_dim_out
, set
);
368 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
369 __isl_keep isl_basic_set
*bset
)
373 return isl_bool_error
;
374 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
377 return isl_basic_map_set_tuple_is_equal(bmap
, isl_dim_out
, bset
);
380 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
382 return bmap
? bmap
->ctx
: NULL
;
385 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
387 return bset
? bset
->ctx
: NULL
;
390 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
392 return map
? map
->ctx
: NULL
;
395 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
397 return set
? set
->ctx
: NULL
;
400 /* Return the space of "bmap".
402 __isl_keep isl_space
*isl_basic_map_peek_space(
403 __isl_keep
const isl_basic_map
*bmap
)
405 return bmap
? bmap
->dim
: NULL
;
408 /* Return the space of "bset".
410 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
412 return isl_basic_map_peek_space(bset_to_bmap(bset
));
415 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
417 return isl_space_copy(isl_basic_map_peek_space(bmap
));
420 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
422 return isl_basic_map_get_space(bset_to_bmap(bset
));
425 /* Return the space of "bmap".
426 * This may be either a copy or the space itself
427 * if there is only one reference to "bmap".
428 * This allows the space to be modified inplace
429 * if both the basic map and its space have only a single reference.
430 * The caller is not allowed to modify "bmap" between this call and
431 * a subsequent call to isl_basic_map_restore_space.
432 * The only exception is that isl_basic_map_free can be called instead.
434 static __isl_give isl_space
*isl_basic_map_take_space(
435 __isl_keep isl_basic_map
*bmap
)
442 return isl_basic_map_get_space(bmap
);
448 /* Set the space of "bmap" to "space", where the space of "bmap" may be missing
449 * due to a preceding call to isl_basic_map_take_space.
450 * However, in this case, "bmap" only has a single reference and
451 * then the call to isl_basic_map_cow has no effect.
453 static __isl_give isl_basic_map
*isl_basic_map_restore_space(
454 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
459 if (bmap
->dim
== space
) {
460 isl_space_free(space
);
464 bmap
= isl_basic_map_cow(bmap
);
467 isl_space_free(bmap
->dim
);
472 isl_basic_map_free(bmap
);
473 isl_space_free(space
);
477 /* Extract the divs in "bmap" as a matrix.
479 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
487 v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
491 ctx
= isl_basic_map_get_ctx(bmap
);
492 cols
= 1 + 1 + v_div
+ bmap
->n_div
;
493 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
497 for (i
= 0; i
< bmap
->n_div
; ++i
)
498 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
503 /* Extract the divs in "bset" as a matrix.
505 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
507 return isl_basic_map_get_divs(bset
);
510 __isl_give isl_local_space
*isl_basic_map_get_local_space(
511 __isl_keep isl_basic_map
*bmap
)
518 div
= isl_basic_map_get_divs(bmap
);
519 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
522 __isl_give isl_local_space
*isl_basic_set_get_local_space(
523 __isl_keep isl_basic_set
*bset
)
525 return isl_basic_map_get_local_space(bset
);
528 /* For each known div d = floor(f/m), add the constraints
531 * -(f-(m-1)) + m d >= 0
533 * Do not finalize the result.
535 static __isl_give isl_basic_map
*add_known_div_constraints(
536 __isl_take isl_basic_map
*bmap
)
541 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
543 return isl_basic_map_free(bmap
);
546 bmap
= isl_basic_map_cow(bmap
);
547 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
550 for (i
= 0; i
< n_div
; ++i
) {
551 if (isl_int_is_zero(bmap
->div
[i
][0]))
553 bmap
= isl_basic_map_add_div_constraints(bmap
, i
);
559 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
560 __isl_take isl_local_space
*ls
)
566 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
568 ls
= isl_local_space_free(ls
);
572 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
573 n_div
, 0, 2 * n_div
);
575 for (i
= 0; i
< n_div
; ++i
)
576 if (isl_basic_map_alloc_div(bmap
) < 0)
579 for (i
= 0; i
< n_div
; ++i
)
580 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
581 bmap
= add_known_div_constraints(bmap
);
583 isl_local_space_free(ls
);
586 isl_local_space_free(ls
);
587 isl_basic_map_free(bmap
);
591 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
592 __isl_take isl_local_space
*ls
)
594 return isl_basic_map_from_local_space(ls
);
597 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
599 return isl_space_copy(isl_map_peek_space(map
));
602 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
606 return isl_space_copy(set
->dim
);
609 /* Return the space of "map".
610 * This may be either a copy or the space itself
611 * if there is only one reference to "map".
612 * This allows the space to be modified inplace
613 * if both the map and its space have only a single reference.
614 * The caller is not allowed to modify "map" between this call and
615 * a subsequent call to isl_map_restore_space.
616 * The only exception is that isl_map_free can be called instead.
618 static __isl_give isl_space
*isl_map_take_space(__isl_keep isl_map
*map
)
625 return isl_map_get_space(map
);
631 /* Set the space of "map" to "space", where the space of "map" may be missing
632 * due to a preceding call to isl_map_take_space.
633 * However, in this case, "map" only has a single reference and
634 * then the call to isl_map_cow has no effect.
636 static __isl_give isl_map
*isl_map_restore_space(__isl_take isl_map
*map
,
637 __isl_take isl_space
*space
)
642 if (map
->dim
== space
) {
643 isl_space_free(space
);
647 map
= isl_map_cow(map
);
650 isl_space_free(map
->dim
);
656 isl_space_free(space
);
660 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
661 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
665 space
= isl_basic_map_take_space(bmap
);
666 space
= isl_space_set_tuple_name(space
, type
, s
);
667 bmap
= isl_basic_map_restore_space(bmap
, space
);
668 bmap
= isl_basic_map_finalize(bmap
);
672 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
673 __isl_take isl_basic_set
*bset
, const char *s
)
675 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
678 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
679 enum isl_dim_type type
)
681 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
684 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
685 enum isl_dim_type type
, const char *s
)
690 map
= isl_map_cow(map
);
694 for (i
= 0; i
< map
->n
; ++i
) {
695 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
700 space
= isl_map_take_space(map
);
701 space
= isl_space_set_tuple_name(space
, type
, s
);
702 map
= isl_map_restore_space(map
, space
);
710 /* Replace the identifier of the tuple of type "type" by "id".
712 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
713 __isl_take isl_basic_map
*bmap
,
714 enum isl_dim_type type
, __isl_take isl_id
*id
)
718 space
= isl_basic_map_take_space(bmap
);
719 space
= isl_space_set_tuple_id(space
, type
, id
);
720 bmap
= isl_basic_map_restore_space(bmap
, space
);
721 bmap
= isl_basic_map_finalize(bmap
);
725 /* Replace the identifier of the tuple by "id".
727 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
728 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
730 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
733 /* Does the input or output tuple have a name?
735 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
737 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
740 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
741 enum isl_dim_type type
)
743 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
746 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
749 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
753 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
754 enum isl_dim_type type
, __isl_take isl_id
*id
)
758 space
= isl_map_take_space(map
);
759 space
= isl_space_set_tuple_id(space
, type
, id
);
760 map
= isl_map_restore_space(map
, space
);
762 return isl_map_reset_space(map
, isl_map_get_space(map
));
765 /* Replace the identifier of the domain tuple of "map" by "id".
767 __isl_give isl_map
*isl_map_set_domain_tuple_id(__isl_take isl_map
*map
,
768 __isl_take isl_id
*id
)
770 return isl_map_set_tuple_id(map
, isl_dim_in
, id
);
773 /* Replace the identifier of the range tuple of "map" by "id".
775 __isl_give isl_map
*isl_map_set_range_tuple_id(__isl_take isl_map
*map
,
776 __isl_take isl_id
*id
)
778 return isl_map_set_tuple_id(map
, isl_dim_out
, id
);
781 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
782 __isl_take isl_id
*id
)
784 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
787 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
788 enum isl_dim_type type
)
792 space
= isl_map_take_space(map
);
793 space
= isl_space_reset_tuple_id(space
, type
);
794 map
= isl_map_restore_space(map
, space
);
796 return isl_map_reset_space(map
, isl_map_get_space(map
));
799 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
801 return isl_map_reset_tuple_id(set
, isl_dim_set
);
804 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
806 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
809 /* Does the domain tuple of "map" have an identifier?
811 isl_bool
isl_map_has_domain_tuple_id(__isl_keep isl_map
*map
)
813 return isl_map_has_tuple_id(map
, isl_dim_in
);
816 /* Does the range tuple of "map" have an identifier?
818 isl_bool
isl_map_has_range_tuple_id(__isl_keep isl_map
*map
)
820 return isl_map_has_tuple_id(map
, isl_dim_out
);
823 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
824 enum isl_dim_type type
)
826 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
829 /* Return the identifier of the domain tuple of "map", assuming it has one.
831 __isl_give isl_id
*isl_map_get_domain_tuple_id(__isl_keep isl_map
*map
)
833 return isl_map_get_tuple_id(map
, isl_dim_in
);
836 /* Return the identifier of the range tuple of "map", assuming it has one.
838 __isl_give isl_id
*isl_map_get_range_tuple_id(__isl_keep isl_map
*map
)
840 return isl_map_get_tuple_id(map
, isl_dim_out
);
843 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
845 return isl_map_has_tuple_id(set
, isl_dim_set
);
848 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
850 return isl_map_get_tuple_id(set
, isl_dim_set
);
853 /* Does the set tuple have a name?
855 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
858 return isl_bool_error
;
859 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
863 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
865 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
868 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
870 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
873 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
874 enum isl_dim_type type
, unsigned pos
)
876 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
879 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
880 enum isl_dim_type type
, unsigned pos
)
882 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
885 /* Does the given dimension have a name?
887 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
888 enum isl_dim_type type
, unsigned pos
)
891 return isl_bool_error
;
892 return isl_space_has_dim_name(map
->dim
, type
, pos
);
895 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
896 enum isl_dim_type type
, unsigned pos
)
898 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
901 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
902 enum isl_dim_type type
, unsigned pos
)
904 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
907 /* Does the given dimension have a name?
909 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
910 enum isl_dim_type type
, unsigned pos
)
913 return isl_bool_error
;
914 return isl_space_has_dim_name(set
->dim
, type
, pos
);
917 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
918 __isl_take isl_basic_map
*bmap
,
919 enum isl_dim_type type
, unsigned pos
, const char *s
)
923 space
= isl_basic_map_take_space(bmap
);
924 space
= isl_space_set_dim_name(space
, type
, pos
, s
);
925 bmap
= isl_basic_map_restore_space(bmap
, space
);
926 return isl_basic_map_finalize(bmap
);
929 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
930 enum isl_dim_type type
, unsigned pos
, const char *s
)
935 map
= isl_map_cow(map
);
939 for (i
= 0; i
< map
->n
; ++i
) {
940 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
945 space
= isl_map_take_space(map
);
946 space
= isl_space_set_dim_name(space
, type
, pos
, s
);
947 map
= isl_map_restore_space(map
, space
);
955 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
956 __isl_take isl_basic_set
*bset
,
957 enum isl_dim_type type
, unsigned pos
, const char *s
)
959 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
963 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
964 enum isl_dim_type type
, unsigned pos
, const char *s
)
966 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
970 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
971 enum isl_dim_type type
, unsigned pos
)
974 return isl_bool_error
;
975 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
978 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
979 enum isl_dim_type type
, unsigned pos
)
981 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
984 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
985 enum isl_dim_type type
, unsigned pos
)
987 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
990 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
991 enum isl_dim_type type
, unsigned pos
)
993 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
996 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
997 enum isl_dim_type type
, unsigned pos
)
999 return isl_map_has_dim_id(set
, type
, pos
);
1002 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
1003 enum isl_dim_type type
, unsigned pos
)
1005 return isl_map_get_dim_id(set
, type
, pos
);
1008 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
1009 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
1013 space
= isl_map_take_space(map
);
1014 space
= isl_space_set_dim_id(space
, type
, pos
, id
);
1015 map
= isl_map_restore_space(map
, space
);
1017 return isl_map_reset_space(map
, isl_map_get_space(map
));
1020 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
1021 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
1023 return isl_map_set_dim_id(set
, type
, pos
, id
);
1026 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
1027 __isl_keep isl_id
*id
)
1031 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
1034 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
1035 __isl_keep isl_id
*id
)
1037 return isl_map_find_dim_by_id(set
, type
, id
);
1040 /* Return the position of the dimension of the given type and name
1042 * Return -1 if no such dimension can be found.
1044 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
1045 enum isl_dim_type type
, const char *name
)
1049 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
1052 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
1057 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
1060 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
1063 return isl_map_find_dim_by_name(set
, type
, name
);
1066 /* Check whether equality i of bset is a pure stride constraint
1067 * on a single dimension, i.e., of the form
1071 * with k a constant and e an existentially quantified variable.
1073 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
1081 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
1082 d
= isl_basic_set_dim(bset
, isl_dim_set
);
1083 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
1084 if (nparam
< 0 || d
< 0 || n_div
< 0)
1085 return isl_bool_error
;
1087 if (!isl_int_is_zero(bset
->eq
[i
][0]))
1088 return isl_bool_false
;
1090 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
1091 return isl_bool_false
;
1092 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
1094 return isl_bool_false
;
1095 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
1096 d
- pos1
- 1) != -1)
1097 return isl_bool_false
;
1099 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
1101 return isl_bool_false
;
1102 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
1103 n_div
- pos2
- 1) != -1)
1104 return isl_bool_false
;
1105 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
1106 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
1107 return isl_bool_false
;
1109 return isl_bool_true
;
1112 /* Reset the user pointer on all identifiers of parameters and tuples
1113 * of the space of "map".
1115 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
1119 space
= isl_map_get_space(map
);
1120 space
= isl_space_reset_user(space
);
1121 map
= isl_map_reset_space(map
, space
);
1126 /* Reset the user pointer on all identifiers of parameters and tuples
1127 * of the space of "set".
1129 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
1131 return isl_map_reset_user(set
);
1134 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
1137 return isl_bool_error
;
1138 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
1141 /* Has "map" been marked as a rational map?
1142 * In particular, have all basic maps in "map" been marked this way?
1143 * An empty map is not considered to be rational.
1144 * Maps where only some of the basic maps are marked rational
1147 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
1153 return isl_bool_error
;
1155 return isl_bool_false
;
1156 rational
= isl_basic_map_is_rational(map
->p
[0]);
1159 for (i
= 1; i
< map
->n
; ++i
) {
1160 isl_bool rational_i
;
1162 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
1165 if (rational
!= rational_i
)
1166 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
1167 "mixed rational and integer basic maps "
1168 "not supported", return isl_bool_error
);
1174 /* Has "set" been marked as a rational set?
1175 * In particular, have all basic set in "set" been marked this way?
1176 * An empty set is not considered to be rational.
1177 * Sets where only some of the basic sets are marked rational
1180 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
1182 return isl_map_is_rational(set
);
1185 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
1187 return isl_basic_map_is_rational(bset
);
1190 /* Does "bmap" contain any rational points?
1192 * If "bmap" has an equality for each dimension, equating the dimension
1193 * to an integer constant, then it has no rational points, even if it
1194 * is marked as rational.
1196 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
1198 isl_bool has_rational
= isl_bool_true
;
1202 return isl_bool_error
;
1203 if (isl_basic_map_plain_is_empty(bmap
))
1204 return isl_bool_false
;
1205 if (!isl_basic_map_is_rational(bmap
))
1206 return isl_bool_false
;
1207 bmap
= isl_basic_map_copy(bmap
);
1208 bmap
= isl_basic_map_implicit_equalities(bmap
);
1209 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1211 return isl_bool_error
;
1212 if (bmap
->n_eq
== total
) {
1214 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1215 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1218 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1219 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1221 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1226 if (i
== bmap
->n_eq
)
1227 has_rational
= isl_bool_false
;
1229 isl_basic_map_free(bmap
);
1231 return has_rational
;
1234 /* Does "map" contain any rational points?
1236 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1239 isl_bool has_rational
;
1242 return isl_bool_error
;
1243 for (i
= 0; i
< map
->n
; ++i
) {
1244 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1245 if (has_rational
< 0 || has_rational
)
1246 return has_rational
;
1248 return isl_bool_false
;
1251 /* Does "set" contain any rational points?
1253 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1255 return isl_map_has_rational(set
);
1258 /* Is this basic set a parameter domain?
1260 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1263 return isl_bool_error
;
1264 return isl_space_is_params(bset
->dim
);
1267 /* Is this set a parameter domain?
1269 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1272 return isl_bool_error
;
1273 return isl_space_is_params(set
->dim
);
1276 /* Is this map actually a parameter domain?
1277 * Users should never call this function. Outside of isl,
1278 * a map can never be a parameter domain.
1280 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1283 return isl_bool_error
;
1284 return isl_space_is_params(map
->dim
);
1287 static __isl_give isl_basic_map
*basic_map_init(isl_ctx
*ctx
,
1288 __isl_take isl_basic_map
*bmap
, unsigned extra
,
1289 unsigned n_eq
, unsigned n_ineq
)
1292 isl_space
*space
= isl_basic_map_peek_space(bmap
);
1293 isl_size n_var
= isl_space_dim(space
, isl_dim_all
);
1294 size_t row_size
= 1 + n_var
+ extra
;
1300 return isl_basic_map_free(bmap
);
1302 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1303 if (isl_blk_is_error(bmap
->block
))
1306 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1307 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1311 bmap
->block2
= isl_blk_empty();
1314 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1315 if (isl_blk_is_error(bmap
->block2
))
1318 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1323 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1324 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1326 for (i
= 0; i
< extra
; ++i
)
1327 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1331 bmap
->c_size
= n_eq
+ n_ineq
;
1332 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1333 bmap
->extra
= extra
;
1337 bmap
->sample
= NULL
;
1341 isl_basic_map_free(bmap
);
1345 __isl_give isl_basic_set
*isl_basic_set_alloc(isl_ctx
*ctx
,
1346 unsigned nparam
, unsigned dim
, unsigned extra
,
1347 unsigned n_eq
, unsigned n_ineq
)
1349 struct isl_basic_map
*bmap
;
1352 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1356 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1357 return bset_from_bmap(bmap
);
1360 __isl_give isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*space
,
1361 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1363 struct isl_basic_map
*bmap
;
1366 isl_assert(space
->ctx
, space
->n_in
== 0, goto error
);
1367 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1368 return bset_from_bmap(bmap
);
1370 isl_space_free(space
);
1374 __isl_give isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*space
,
1375 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1377 struct isl_basic_map
*bmap
;
1381 bmap
= isl_calloc_type(space
->ctx
, struct isl_basic_map
);
1386 return basic_map_init(space
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1388 isl_space_free(space
);
1392 __isl_give isl_basic_map
*isl_basic_map_alloc(isl_ctx
*ctx
,
1393 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1394 unsigned n_eq
, unsigned n_ineq
)
1396 struct isl_basic_map
*bmap
;
1399 space
= isl_space_alloc(ctx
, nparam
, in
, out
);
1403 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1407 static __isl_give isl_basic_map
*dup_constraints(__isl_take isl_basic_map
*dst
,
1408 __isl_keep isl_basic_map
*src
)
1411 isl_size total
= isl_basic_map_dim(src
, isl_dim_all
);
1413 if (!dst
|| total
< 0)
1414 return isl_basic_map_free(dst
);
1416 for (i
= 0; i
< src
->n_eq
; ++i
) {
1417 int j
= isl_basic_map_alloc_equality(dst
);
1419 return isl_basic_map_free(dst
);
1420 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1423 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1424 int j
= isl_basic_map_alloc_inequality(dst
);
1426 return isl_basic_map_free(dst
);
1427 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1430 for (i
= 0; i
< src
->n_div
; ++i
) {
1431 int j
= isl_basic_map_alloc_div(dst
);
1433 return isl_basic_map_free(dst
);
1434 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1436 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1440 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1442 struct isl_basic_map
*dup
;
1446 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1447 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1448 dup
= dup_constraints(dup
, bmap
);
1451 dup
->flags
= bmap
->flags
;
1452 dup
->sample
= isl_vec_copy(bmap
->sample
);
1456 __isl_give isl_basic_set
*isl_basic_set_dup(__isl_keep isl_basic_set
*bset
)
1458 struct isl_basic_map
*dup
;
1460 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1461 return bset_from_bmap(dup
);
1464 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1466 return bset_from_bmap(isl_basic_map_copy(bset_to_bmap(bset
)));
1469 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1478 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1483 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1487 bmap
= isl_basic_map_dup(bmap
);
1489 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1493 __isl_give isl_map
*isl_map_copy(__isl_keep isl_map
*map
)
1502 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1507 if (--bmap
->ref
> 0)
1510 isl_ctx_deref(bmap
->ctx
);
1512 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1514 isl_blk_free(bmap
->ctx
, bmap
->block
);
1515 isl_vec_free(bmap
->sample
);
1516 isl_space_free(bmap
->dim
);
1522 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1524 return isl_basic_map_free(bset_to_bmap(bset
));
1527 static int room_for_con(__isl_keep isl_basic_map
*bmap
, unsigned n
)
1529 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1532 /* Check that "bset" does not involve any parameters.
1534 isl_stat
isl_basic_set_check_no_params(__isl_keep isl_basic_set
*bset
)
1538 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
1540 return isl_stat_error
;
1542 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
1543 "basic set should not have any parameters",
1544 return isl_stat_error
);
1548 /* Check that "bset" does not involve any local variables.
1550 isl_stat
isl_basic_set_check_no_locals(__isl_keep isl_basic_set
*bset
)
1554 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
1556 return isl_stat_error
;
1558 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
1559 "basic set should not have any local variables",
1560 return isl_stat_error
);
1565 #define TYPE isl_map
1567 #include "isl_check_named_params_templ.c"
1570 #define TYPE isl_basic_map
1573 #include "isl_check_named_params_templ.c"
1575 /* Check that "bmap1" and "bmap2" have the same parameters,
1576 * reporting an error if they do not.
1578 static isl_stat
isl_basic_map_check_equal_params(
1579 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1583 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1585 return isl_stat_error
;
1587 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1588 "parameters don't match", return isl_stat_error
);
1593 #define TYPE isl_map
1595 #include "isl_align_params_bin_templ.c"
1600 #define ARG1 isl_map
1602 #define ARG2 isl_set
1604 #include "isl_align_params_templ.c"
1606 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1607 __isl_keep isl_map
*map2
,
1608 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1613 return isl_bool_error
;
1614 if (isl_map_has_equal_params(map1
, map2
))
1615 return fn(map1
, map2
);
1616 if (isl_map_check_named_params(map1
) < 0)
1617 return isl_bool_error
;
1618 if (isl_map_check_named_params(map2
) < 0)
1619 return isl_bool_error
;
1620 map1
= isl_map_copy(map1
);
1621 map2
= isl_map_copy(map2
);
1622 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1623 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1630 int isl_basic_map_alloc_equality(__isl_keep isl_basic_map
*bmap
)
1633 struct isl_ctx
*ctx
;
1635 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1639 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1640 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1642 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1643 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1644 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1645 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1646 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1648 int j
= isl_basic_map_alloc_inequality(bmap
);
1652 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1653 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1660 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + total
,
1661 bmap
->extra
- bmap
->n_div
);
1662 return bmap
->n_eq
++;
1665 int isl_basic_set_alloc_equality(__isl_keep isl_basic_set
*bset
)
1667 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1670 __isl_give isl_basic_map
*isl_basic_map_free_equality(
1671 __isl_take isl_basic_map
*bmap
, unsigned n
)
1676 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1677 "invalid number of equalities",
1678 isl_basic_map_free(bmap
));
1683 __isl_give isl_basic_set
*isl_basic_set_free_equality(
1684 __isl_take isl_basic_set
*bset
, unsigned n
)
1686 return bset_from_bmap(isl_basic_map_free_equality(bset_to_bmap(bset
),
1690 /* Drop the equality constraint at position "pos",
1691 * preserving the order of the other equality constraints.
1693 int isl_basic_map_drop_equality(__isl_keep isl_basic_map
*bmap
, unsigned pos
)
1700 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1704 for (r
= pos
; r
< bmap
->n_eq
; ++r
)
1705 bmap
->eq
[r
] = bmap
->eq
[r
+ 1];
1706 bmap
->eq
[bmap
->n_eq
] = t
;
1711 /* Turn inequality "pos" of "bmap" into an equality.
1713 * In particular, we move the inequality in front of the equalities
1714 * and move the last inequality in the position of the moved inequality.
1715 * Note that isl_tab_make_equalities_explicit depends on this particular
1716 * change in the ordering of the constraints.
1718 void isl_basic_map_inequality_to_equality(
1719 __isl_keep isl_basic_map
*bmap
, unsigned pos
)
1723 t
= bmap
->ineq
[pos
];
1724 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1725 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1730 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1731 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1732 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1733 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1736 static int room_for_ineq(__isl_keep isl_basic_map
*bmap
, unsigned n
)
1738 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1741 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1744 struct isl_ctx
*ctx
;
1746 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1750 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1751 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1752 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1753 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1754 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1755 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] + 1 + total
,
1756 bmap
->extra
- bmap
->n_div
);
1757 return bmap
->n_ineq
++;
1760 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1762 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1765 __isl_give isl_basic_map
*isl_basic_map_free_inequality(
1766 __isl_take isl_basic_map
*bmap
, unsigned n
)
1770 if (n
> bmap
->n_ineq
)
1771 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1772 "invalid number of inequalities",
1773 return isl_basic_map_free(bmap
));
1778 __isl_give isl_basic_set
*isl_basic_set_free_inequality(
1779 __isl_take isl_basic_set
*bset
, unsigned n
)
1781 return bset_from_bmap(isl_basic_map_free_inequality(bset_to_bmap(bset
),
1785 int isl_basic_map_drop_inequality(__isl_keep isl_basic_map
*bmap
, unsigned pos
)
1790 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1792 if (pos
!= bmap
->n_ineq
- 1) {
1793 t
= bmap
->ineq
[pos
];
1794 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1795 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1796 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1802 int isl_basic_set_drop_inequality(__isl_keep isl_basic_set
*bset
, unsigned pos
)
1804 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1807 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1814 empty
= isl_basic_map_plain_is_empty(bmap
);
1816 return isl_basic_map_free(bmap
);
1820 bmap
= isl_basic_map_cow(bmap
);
1821 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1822 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1824 return isl_basic_map_free(bmap
);
1825 k
= isl_basic_map_alloc_equality(bmap
);
1828 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + total
);
1831 isl_basic_map_free(bmap
);
1835 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1838 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1841 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1847 bmap
= isl_basic_map_cow(bmap
);
1848 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1849 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1851 return isl_basic_map_free(bmap
);
1852 k
= isl_basic_map_alloc_inequality(bmap
);
1855 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + total
);
1858 isl_basic_map_free(bmap
);
1862 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1865 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1868 int isl_basic_map_alloc_div(__isl_keep isl_basic_map
*bmap
)
1872 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1875 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1876 isl_seq_clr(bmap
->div
[bmap
->n_div
] + 1 + 1 + total
,
1877 bmap
->extra
- bmap
->n_div
);
1878 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1879 return bmap
->n_div
++;
1882 int isl_basic_set_alloc_div(__isl_keep isl_basic_set
*bset
)
1884 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1888 #define TYPE isl_basic_map
1889 #include "check_type_range_templ.c"
1891 /* Check that there are "n" dimensions of type "type" starting at "first"
1894 isl_stat
isl_basic_set_check_range(__isl_keep isl_basic_set
*bset
,
1895 enum isl_dim_type type
, unsigned first
, unsigned n
)
1897 return isl_basic_map_check_range(bset_to_bmap(bset
),
1901 /* Insert an extra integer division, prescribed by "div", to "bmap"
1902 * at (integer division) position "pos".
1904 * The integer division is first added at the end and then moved
1905 * into the right position.
1907 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1908 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1913 bmap
= isl_basic_map_cow(bmap
);
1914 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1915 if (total
< 0 || !div
)
1916 return isl_basic_map_free(bmap
);
1918 if (div
->size
!= 1 + 1 + total
)
1919 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1920 "unexpected size", return isl_basic_map_free(bmap
));
1921 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1922 return isl_basic_map_free(bmap
);
1924 bmap
= isl_basic_map_extend(bmap
, 1, 0, 2);
1925 k
= isl_basic_map_alloc_div(bmap
);
1927 return isl_basic_map_free(bmap
);
1928 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1929 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1931 for (i
= k
; i
> pos
; --i
)
1932 bmap
= isl_basic_map_swap_div(bmap
, i
, i
- 1);
1937 isl_stat
isl_basic_map_free_div(__isl_keep isl_basic_map
*bmap
, unsigned n
)
1940 return isl_stat_error
;
1941 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1946 static __isl_give isl_basic_map
*add_constraints(
1947 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1948 unsigned i_pos
, unsigned o_pos
)
1950 isl_size total
, n_param
, n_in
, n_out
, n_div
;
1951 unsigned o_in
, o_out
;
1954 struct isl_dim_map
*dim_map
;
1956 space
= isl_basic_map_peek_space(bmap2
);
1957 if (!bmap1
|| !space
)
1960 total
= isl_basic_map_dim(bmap1
, isl_dim_all
);
1961 n_param
= isl_basic_map_dim(bmap2
, isl_dim_param
);
1962 n_in
= isl_basic_map_dim(bmap2
, isl_dim_in
);
1963 o_in
= isl_basic_map_offset(bmap1
, isl_dim_in
) - 1 + i_pos
;
1964 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
1965 o_out
= isl_basic_map_offset(bmap1
, isl_dim_out
) - 1 + o_pos
;
1966 n_div
= isl_basic_map_dim(bmap2
, isl_dim_div
);
1967 if (total
< 0 || n_param
< 0 || n_in
< 0 || n_out
< 0 || n_div
< 0)
1969 ctx
= isl_basic_map_get_ctx(bmap1
);
1970 dim_map
= isl_dim_map_alloc(ctx
, total
+ n_div
);
1971 isl_dim_map_dim_range(dim_map
, space
, isl_dim_param
, 0, n_param
, 0);
1972 isl_dim_map_dim_range(dim_map
, space
, isl_dim_in
, 0, n_in
, o_in
);
1973 isl_dim_map_dim_range(dim_map
, space
, isl_dim_out
, 0, n_out
, o_out
);
1974 isl_dim_map_div(dim_map
, bmap2
, total
);
1976 return isl_basic_map_add_constraints_dim_map(bmap1
, bmap2
, dim_map
);
1978 isl_basic_map_free(bmap1
);
1979 isl_basic_map_free(bmap2
);
1983 __isl_give isl_basic_map
*isl_basic_map_extend(__isl_take isl_basic_map
*base
,
1984 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1987 struct isl_basic_map
*ext
;
1994 dims_ok
= base
->extra
>= base
->n_div
+ extra
;
1996 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1997 room_for_ineq(base
, n_ineq
))
2000 extra
+= base
->extra
;
2002 n_ineq
+= base
->n_ineq
;
2004 space
= isl_basic_map_get_space(base
);
2005 ext
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
2010 ext
->sample
= isl_vec_copy(base
->sample
);
2011 flags
= base
->flags
;
2012 ext
= add_constraints(ext
, base
, 0, 0);
2015 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
2021 isl_basic_map_free(base
);
2025 __isl_give isl_basic_set
*isl_basic_set_extend(__isl_take isl_basic_set
*base
,
2026 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
2028 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
2029 extra
, n_eq
, n_ineq
));
2032 __isl_give isl_basic_map
*isl_basic_map_extend_constraints(
2033 __isl_take isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
2035 return isl_basic_map_extend(base
, 0, n_eq
, n_ineq
);
2038 __isl_give isl_basic_set
*isl_basic_set_extend_constraints(
2039 __isl_take isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
2041 isl_basic_map
*bmap
= bset_to_bmap(base
);
2042 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
2043 return bset_from_bmap(bmap
);
2046 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
2048 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
2051 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
2056 if (bmap
->ref
> 1) {
2058 bmap
= isl_basic_map_dup(bmap
);
2061 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
2062 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
2067 /* Clear all cached information in "map", either because it is about
2068 * to be modified or because it is being freed.
2069 * Always return the same pointer that is passed in.
2070 * This is needed for the use in isl_map_free.
2072 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
2074 isl_basic_map_free(map
->cached_simple_hull
[0]);
2075 isl_basic_map_free(map
->cached_simple_hull
[1]);
2076 map
->cached_simple_hull
[0] = NULL
;
2077 map
->cached_simple_hull
[1] = NULL
;
2081 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
2083 return isl_map_cow(set
);
2086 /* Return an isl_map that is equal to "map" and that has only
2087 * a single reference.
2089 * If the original input already has only one reference, then
2090 * simply return it, but clear all cached information, since
2091 * it may be rendered invalid by the operations that will be
2092 * performed on the result.
2094 * Otherwise, create a duplicate (without any cached information).
2096 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
2102 return clear_caches(map
);
2104 return isl_map_dup(map
);
2107 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
2108 unsigned a_len
, unsigned b_len
)
2110 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
2111 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
2112 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
2115 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
2116 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
2121 if (isl_basic_map_check_range(bmap
, isl_dim_all
, pos
- 1, n1
+ n2
) < 0)
2124 if (n1
== 0 || n2
== 0)
2127 bmap
= isl_basic_map_cow(bmap
);
2131 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
2132 if (isl_blk_is_error(blk
))
2135 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2137 bmap
->eq
[i
] + pos
, n1
, n2
);
2139 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2141 bmap
->ineq
[i
] + pos
, n1
, n2
);
2143 for (i
= 0; i
< bmap
->n_div
; ++i
)
2145 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2147 isl_blk_free(bmap
->ctx
, blk
);
2149 ISL_F_CLR(bmap
, ISL_BASIC_SET_SORTED
);
2150 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2151 return isl_basic_map_finalize(bmap
);
2153 isl_basic_map_free(bmap
);
2157 /* The given basic map has turned out to be empty.
2158 * Explicitly mark it as such and change the representation
2159 * to a canonical representation of the empty basic map.
2160 * Since the basic map has conflicting constraints,
2161 * it must have at least one constraint, except perhaps
2162 * if it was already explicitly marked as being empty.
2163 * Do nothing in the latter case, i.e., if it has been marked empty and
2164 * has no constraints.
2166 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2167 __isl_take isl_basic_map
*bmap
)
2174 n
= isl_basic_map_n_constraint(bmap
);
2175 empty
= isl_basic_map_plain_is_empty(bmap
);
2176 if (n
< 0 || empty
< 0)
2177 return isl_basic_map_free(bmap
);
2178 if (n
== 0 && empty
)
2180 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
2182 return isl_basic_map_free(bmap
);
2183 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2184 return isl_basic_map_free(bmap
);
2185 bmap
= isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2188 if (bmap
->n_eq
> 0) {
2189 bmap
= isl_basic_map_free_equality(bmap
, bmap
->n_eq
- 1);
2193 i
= isl_basic_map_alloc_equality(bmap
);
2197 isl_int_set_si(bmap
->eq
[i
][0], 1);
2198 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2199 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2200 isl_vec_free(bmap
->sample
);
2201 bmap
->sample
= NULL
;
2202 return isl_basic_map_finalize(bmap
);
2204 isl_basic_map_free(bmap
);
2208 __isl_give isl_basic_set
*isl_basic_set_set_to_empty(
2209 __isl_take isl_basic_set
*bset
)
2211 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2214 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2215 __isl_take isl_basic_map
*bmap
)
2220 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2223 bmap
= isl_basic_map_cow(bmap
);
2227 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2229 return isl_basic_map_finalize(bmap
);
2232 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2233 __isl_take isl_basic_set
*bset
)
2235 return isl_basic_map_set_rational(bset
);
2238 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2239 __isl_take isl_basic_set
*bset
)
2244 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2247 bset
= isl_basic_set_cow(bset
);
2251 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2253 return isl_basic_set_finalize(bset
);
2256 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2260 map
= isl_map_cow(map
);
2263 for (i
= 0; i
< map
->n
; ++i
) {
2264 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2274 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2276 return isl_map_set_rational(set
);
2279 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2282 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2284 isl_int
*t
= bmap
->div
[a
];
2285 bmap
->div
[a
] = bmap
->div
[b
];
2289 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2290 * div definitions accordingly.
2292 __isl_give isl_basic_map
*isl_basic_map_swap_div(__isl_take isl_basic_map
*bmap
,
2298 off
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
2300 return isl_basic_map_free(bmap
);
2302 swap_div(bmap
, a
, b
);
2304 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2305 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2307 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2308 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2310 for (i
= 0; i
< bmap
->n_div
; ++i
)
2311 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2312 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2317 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2319 isl_seq_cpy(c
, c
+ n
, rem
);
2320 isl_seq_clr(c
+ rem
, n
);
2323 /* Drop n dimensions starting at first.
2325 * In principle, this frees up some extra variables as the number
2326 * of columns remains constant, but we would have to extend
2327 * the div array too as the number of rows in this array is assumed
2328 * to be equal to extra.
2330 __isl_give isl_basic_set
*isl_basic_set_drop_dims(
2331 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2333 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2336 /* Move "n" divs starting at "first" to the end of the list of divs.
2338 static __isl_give isl_basic_map
*move_divs_last(__isl_take isl_basic_map
*bmap
,
2339 unsigned first
, unsigned n
)
2344 if (first
+ n
== bmap
->n_div
)
2347 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2350 for (i
= 0; i
< n
; ++i
)
2351 div
[i
] = bmap
->div
[first
+ i
];
2352 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2353 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2354 for (i
= 0; i
< n
; ++i
)
2355 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2359 isl_basic_map_free(bmap
);
2364 #define TYPE isl_map
2366 #include "check_type_range_templ.c"
2368 /* Check that there are "n" dimensions of type "type" starting at "first"
2371 isl_stat
isl_set_check_range(__isl_keep isl_set
*set
,
2372 enum isl_dim_type type
, unsigned first
, unsigned n
)
2374 return isl_map_check_range(set_to_map(set
), type
, first
, n
);
2377 /* Drop "n" dimensions of type "type" starting at "first".
2378 * Perform the core computation, without cowing or
2379 * simplifying and finalizing the result.
2381 * In principle, this frees up some extra variables as the number
2382 * of columns remains constant, but we would have to extend
2383 * the div array too as the number of rows in this array is assumed
2384 * to be equal to extra.
2386 __isl_give isl_basic_map
*isl_basic_map_drop_core(
2387 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2388 unsigned first
, unsigned n
)
2395 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2396 return isl_basic_map_free(bmap
);
2398 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
2400 return isl_basic_map_free(bmap
);
2402 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2403 left
= total
- (offset
- 1) - n
;
2404 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2405 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2407 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2408 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2410 for (i
= 0; i
< bmap
->n_div
; ++i
)
2411 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2413 if (type
== isl_dim_div
) {
2414 bmap
= move_divs_last(bmap
, first
, n
);
2417 if (isl_basic_map_free_div(bmap
, n
) < 0)
2418 return isl_basic_map_free(bmap
);
2420 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2422 return isl_basic_map_free(bmap
);
2424 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
2425 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2429 /* Drop "n" dimensions of type "type" starting at "first".
2431 * In principle, this frees up some extra variables as the number
2432 * of columns remains constant, but we would have to extend
2433 * the div array too as the number of rows in this array is assumed
2434 * to be equal to extra.
2436 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2437 enum isl_dim_type type
, unsigned first
, unsigned n
)
2441 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2444 bmap
= isl_basic_map_cow(bmap
);
2448 bmap
= isl_basic_map_drop_core(bmap
, type
, first
, n
);
2450 bmap
= isl_basic_map_simplify(bmap
);
2451 return isl_basic_map_finalize(bmap
);
2454 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2455 enum isl_dim_type type
, unsigned first
, unsigned n
)
2457 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2461 /* No longer consider "map" to be normalized.
2463 static __isl_give isl_map
*isl_map_unmark_normalized(__isl_take isl_map
*map
)
2467 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2471 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2472 enum isl_dim_type type
, unsigned first
, unsigned n
)
2477 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2478 return isl_map_free(map
);
2480 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2482 map
= isl_map_cow(map
);
2486 for (i
= 0; i
< map
->n
; ++i
) {
2487 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2491 map
= isl_map_unmark_normalized(map
);
2493 space
= isl_map_take_space(map
);
2494 space
= isl_space_drop_dims(space
, type
, first
, n
);
2495 map
= isl_map_restore_space(map
, space
);
2503 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2504 enum isl_dim_type type
, unsigned first
, unsigned n
)
2506 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2509 /* Drop the integer division at position "div", which is assumed
2510 * not to appear in any of the constraints or
2511 * in any of the other integer divisions.
2513 * Since the integer division is redundant, there is no need to cow.
2515 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2516 __isl_take isl_basic_map
*bmap
, unsigned div
)
2518 return isl_basic_map_drop_core(bmap
, isl_dim_div
, div
, 1);
2521 /* Eliminate the specified n dimensions starting at first from the
2522 * constraints, without removing the dimensions from the space.
2523 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2525 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2526 enum isl_dim_type type
, unsigned first
, unsigned n
)
2533 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2534 return isl_map_free(map
);
2536 map
= isl_map_cow(map
);
2540 for (i
= 0; i
< map
->n
; ++i
) {
2541 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2551 /* Eliminate the specified n dimensions starting at first from the
2552 * constraints, without removing the dimensions from the space.
2553 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2555 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2556 enum isl_dim_type type
, unsigned first
, unsigned n
)
2558 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2561 /* Eliminate the specified n dimensions starting at first from the
2562 * constraints, without removing the dimensions from the space.
2563 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2565 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2566 unsigned first
, unsigned n
)
2568 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2571 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2572 __isl_take isl_basic_map
*bmap
)
2576 v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
2578 return isl_basic_map_free(bmap
);
2579 bmap
= isl_basic_map_eliminate_vars(bmap
, v_div
, bmap
->n_div
);
2583 return isl_basic_map_finalize(bmap
);
2586 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2587 __isl_take isl_basic_set
*bset
)
2589 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2592 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2601 map
= isl_map_cow(map
);
2605 for (i
= 0; i
< map
->n
; ++i
) {
2606 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2616 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2618 return isl_map_remove_divs(set
);
2621 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2622 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2623 unsigned first
, unsigned n
)
2625 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2626 return isl_basic_map_free(bmap
);
2627 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2629 bmap
= isl_basic_map_eliminate_vars(bmap
,
2630 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2633 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2635 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2639 /* Return true if the definition of the given div (recursively) involves
2640 * any of the given variables.
2642 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2643 unsigned first
, unsigned n
)
2646 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2648 if (isl_int_is_zero(bmap
->div
[div
][0]))
2649 return isl_bool_false
;
2650 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + 1 + first
, n
) >= 0)
2651 return isl_bool_true
;
2653 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2656 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2658 involves
= div_involves_vars(bmap
, i
, first
, n
);
2659 if (involves
< 0 || involves
)
2663 return isl_bool_false
;
2666 /* Try and add a lower and/or upper bound on "div" to "bmap"
2667 * based on inequality "i".
2668 * "total" is the total number of variables (excluding the divs).
2669 * "v" is a temporary object that can be used during the calculations.
2670 * If "lb" is set, then a lower bound should be constructed.
2671 * If "ub" is set, then an upper bound should be constructed.
2673 * The calling function has already checked that the inequality does not
2674 * reference "div", but we still need to check that the inequality is
2675 * of the right form. We'll consider the case where we want to construct
2676 * a lower bound. The construction of upper bounds is similar.
2678 * Let "div" be of the form
2680 * q = floor((a + f(x))/d)
2682 * We essentially check if constraint "i" is of the form
2686 * so that we can use it to derive a lower bound on "div".
2687 * However, we allow a slightly more general form
2691 * with the condition that the coefficients of g(x) - f(x) are all
2693 * Rewriting this constraint as
2697 * adding a + f(x) to both sides and dividing by d, we obtain
2699 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2701 * Taking the floor on both sides, we obtain
2703 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2707 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2709 * In the case of an upper bound, we construct the constraint
2711 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2714 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2715 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2716 unsigned total
, isl_int v
, int lb
, int ub
)
2720 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2722 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2723 bmap
->div
[div
][1 + 1 + j
]);
2724 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2727 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2728 bmap
->div
[div
][1 + 1 + j
]);
2729 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2735 bmap
= isl_basic_map_cow(bmap
);
2736 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2738 int k
= isl_basic_map_alloc_inequality(bmap
);
2741 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2742 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2743 bmap
->div
[div
][1 + j
]);
2744 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2745 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2747 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2750 int k
= isl_basic_map_alloc_inequality(bmap
);
2753 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2754 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2755 bmap
->div
[div
][1 + j
]);
2756 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2757 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2759 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2764 isl_basic_map_free(bmap
);
2768 /* This function is called right before "div" is eliminated from "bmap"
2769 * using Fourier-Motzkin.
2770 * Look through the constraints of "bmap" for constraints on the argument
2771 * of the integer division and use them to construct constraints on the
2772 * integer division itself. These constraints can then be combined
2773 * during the Fourier-Motzkin elimination.
2774 * Note that it is only useful to introduce lower bounds on "div"
2775 * if "bmap" already contains upper bounds on "div" as the newly
2776 * introduce lower bounds can then be combined with the pre-existing
2777 * upper bounds. Similarly for upper bounds.
2778 * We therefore first check if "bmap" contains any lower and/or upper bounds
2781 * It is interesting to note that the introduction of these constraints
2782 * can indeed lead to more accurate results, even when compared to
2783 * deriving constraints on the argument of "div" from constraints on "div".
2784 * Consider, for example, the set
2786 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2788 * The second constraint can be rewritten as
2790 * 2 * [(-i-2j+3)/4] + k >= 0
2792 * from which we can derive
2794 * -i - 2j + 3 >= -2k
2800 * Combined with the first constraint, we obtain
2802 * -3 <= 3 + 2k or k >= -3
2804 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2805 * the first constraint, we obtain
2807 * [(i + 2j)/4] >= [-3/4] = -1
2809 * Combining this constraint with the second constraint, we obtain
2813 static __isl_give isl_basic_map
*insert_bounds_on_div(
2814 __isl_take isl_basic_map
*bmap
, int div
)
2817 int check_lb
, check_ub
;
2824 if (isl_int_is_zero(bmap
->div
[div
][0]))
2827 v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
2829 return isl_basic_map_free(bmap
);
2833 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2834 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + v_div
+ div
]);
2841 if (!check_lb
&& !check_ub
)
2846 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2847 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + v_div
+ div
]))
2850 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, v_div
, v
,
2851 check_lb
, check_ub
);
2859 /* Remove all divs (recursively) involving any of the given dimensions
2860 * in their definitions.
2862 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2863 __isl_take isl_basic_map
*bmap
,
2864 enum isl_dim_type type
, unsigned first
, unsigned n
)
2869 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2870 return isl_basic_map_free(bmap
);
2871 off
= isl_basic_map_var_offset(bmap
, type
);
2873 return isl_basic_map_free(bmap
);
2876 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2879 involves
= div_involves_vars(bmap
, i
, first
, n
);
2881 return isl_basic_map_free(bmap
);
2884 bmap
= insert_bounds_on_div(bmap
, i
);
2885 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2894 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2895 __isl_take isl_basic_set
*bset
,
2896 enum isl_dim_type type
, unsigned first
, unsigned n
)
2898 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2901 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2902 enum isl_dim_type type
, unsigned first
, unsigned n
)
2911 map
= isl_map_cow(map
);
2915 for (i
= 0; i
< map
->n
; ++i
) {
2916 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2927 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2928 enum isl_dim_type type
, unsigned first
, unsigned n
)
2930 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2934 /* Does the description of "bmap" depend on the specified dimensions?
2935 * We also check whether the dimensions appear in any of the div definitions.
2936 * In principle there is no need for this check. If the dimensions appear
2937 * in a div definition, they also appear in the defining constraints of that
2940 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2941 enum isl_dim_type type
, unsigned first
, unsigned n
)
2945 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2946 return isl_bool_error
;
2948 first
+= isl_basic_map_offset(bmap
, type
);
2949 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2950 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2951 return isl_bool_true
;
2952 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2953 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2954 return isl_bool_true
;
2955 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2956 if (isl_int_is_zero(bmap
->div
[i
][0]))
2958 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2959 return isl_bool_true
;
2962 return isl_bool_false
;
2965 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2966 enum isl_dim_type type
, unsigned first
, unsigned n
)
2970 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2971 return isl_bool_error
;
2973 for (i
= 0; i
< map
->n
; ++i
) {
2974 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2976 if (involves
< 0 || involves
)
2980 return isl_bool_false
;
2983 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2984 enum isl_dim_type type
, unsigned first
, unsigned n
)
2986 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2989 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2990 enum isl_dim_type type
, unsigned first
, unsigned n
)
2992 return isl_map_involves_dims(set
, type
, first
, n
);
2995 /* Does "bset" involve any local variables, i.e., integer divisions?
2997 static isl_bool
isl_basic_set_involves_locals(__isl_keep isl_basic_set
*bset
)
3001 n
= isl_basic_set_dim(bset
, isl_dim_div
);
3003 return isl_bool_error
;
3004 return isl_bool_ok(n
> 0);
3007 /* isl_set_every_basic_set callback that checks whether "bset"
3008 * is free of local variables.
3010 static isl_bool
basic_set_no_locals(__isl_keep isl_basic_set
*bset
, void *user
)
3012 return isl_bool_not(isl_basic_set_involves_locals(bset
));
3015 /* Does "set" involve any local variables, i.e., integer divisions?
3017 isl_bool
isl_set_involves_locals(__isl_keep isl_set
*set
)
3021 no_locals
= isl_set_every_basic_set(set
, &basic_set_no_locals
, NULL
);
3022 return isl_bool_not(no_locals
);
3025 /* Drop all constraints in bmap that involve any of the dimensions
3026 * first to first+n-1.
3027 * This function only performs the actual removal of constraints.
3029 * This function should not call finalize since it is used by
3030 * remove_redundant_divs, which in turn is called by isl_basic_map_finalize.
3032 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
3033 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
3040 bmap
= isl_basic_map_cow(bmap
);
3045 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
3046 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
3048 if (isl_basic_map_drop_equality(bmap
, i
) < 0)
3049 return isl_basic_map_free(bmap
);
3052 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
3053 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
3055 if (isl_basic_map_drop_inequality(bmap
, i
) < 0)
3056 return isl_basic_map_free(bmap
);
3062 /* Drop all constraints in bset that involve any of the dimensions
3063 * first to first+n-1.
3064 * This function only performs the actual removal of constraints.
3066 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
3067 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
3069 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
3072 /* Drop all constraints in bmap that do not involve any of the dimensions
3073 * first to first + n - 1 of the given type.
3075 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
3076 __isl_take isl_basic_map
*bmap
,
3077 enum isl_dim_type type
, unsigned first
, unsigned n
)
3082 isl_space
*space
= isl_basic_map_get_space(bmap
);
3083 isl_basic_map_free(bmap
);
3084 return isl_basic_map_universe(space
);
3086 bmap
= isl_basic_map_cow(bmap
);
3090 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
3091 return isl_basic_map_free(bmap
);
3093 first
+= isl_basic_map_offset(bmap
, type
) - 1;
3095 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
3096 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
3098 if (isl_basic_map_drop_equality(bmap
, i
) < 0)
3099 return isl_basic_map_free(bmap
);
3102 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
3103 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
3105 if (isl_basic_map_drop_inequality(bmap
, i
) < 0)
3106 return isl_basic_map_free(bmap
);
3109 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
3113 /* Drop all constraints in bset that do not involve any of the dimensions
3114 * first to first + n - 1 of the given type.
3116 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
3117 __isl_take isl_basic_set
*bset
,
3118 enum isl_dim_type type
, unsigned first
, unsigned n
)
3120 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
3124 /* Drop all constraints in bmap that involve any of the dimensions
3125 * first to first + n - 1 of the given type.
3127 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
3128 __isl_take isl_basic_map
*bmap
,
3129 enum isl_dim_type type
, unsigned first
, unsigned n
)
3136 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
3137 return isl_basic_map_free(bmap
);
3139 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
3140 first
+= isl_basic_map_offset(bmap
, type
) - 1;
3141 bmap
= isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
3142 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
3146 /* Drop all constraints in bset that involve any of the dimensions
3147 * first to first + n - 1 of the given type.
3149 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
3150 __isl_take isl_basic_set
*bset
,
3151 enum isl_dim_type type
, unsigned first
, unsigned n
)
3153 return isl_basic_map_drop_constraints_involving_dims(bset
,
3157 /* Drop constraints from "map" by applying "drop" to each basic map.
3159 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
3160 enum isl_dim_type type
, unsigned first
, unsigned n
,
3161 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
3162 enum isl_dim_type type
, unsigned first
, unsigned n
))
3166 if (isl_map_check_range(map
, type
, first
, n
) < 0)
3167 return isl_map_free(map
);
3169 map
= isl_map_cow(map
);
3173 for (i
= 0; i
< map
->n
; ++i
) {
3174 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
3176 return isl_map_free(map
);
3180 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3185 /* Drop all constraints in map that involve any of the dimensions
3186 * first to first + n - 1 of the given type.
3188 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
3189 __isl_take isl_map
*map
,
3190 enum isl_dim_type type
, unsigned first
, unsigned n
)
3194 return drop_constraints(map
, type
, first
, n
,
3195 &isl_basic_map_drop_constraints_involving_dims
);
3198 /* Drop all constraints in "map" that do not involve any of the dimensions
3199 * first to first + n - 1 of the given type.
3201 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
3202 __isl_take isl_map
*map
,
3203 enum isl_dim_type type
, unsigned first
, unsigned n
)
3206 isl_space
*space
= isl_map_get_space(map
);
3208 return isl_map_universe(space
);
3210 return drop_constraints(map
, type
, first
, n
,
3211 &isl_basic_map_drop_constraints_not_involving_dims
);
3214 /* Drop all constraints in set that involve any of the dimensions
3215 * first to first + n - 1 of the given type.
3217 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
3218 __isl_take isl_set
*set
,
3219 enum isl_dim_type type
, unsigned first
, unsigned n
)
3221 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
3224 /* Drop all constraints in "set" that do not involve any of the dimensions
3225 * first to first + n - 1 of the given type.
3227 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
3228 __isl_take isl_set
*set
,
3229 enum isl_dim_type type
, unsigned first
, unsigned n
)
3231 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3234 /* Does local variable "div" of "bmap" have a complete explicit representation?
3235 * Having a complete explicit representation requires not only
3236 * an explicit representation, but also that all local variables
3237 * that appear in this explicit representation in turn have
3238 * a complete explicit representation.
3240 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3243 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3246 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3247 if (marked
< 0 || marked
)
3248 return isl_bool_not(marked
);
3250 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3253 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3255 known
= isl_basic_map_div_is_known(bmap
, i
);
3256 if (known
< 0 || !known
)
3260 return isl_bool_true
;
3263 /* Remove all divs that are unknown or defined in terms of unknown divs.
3265 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3266 __isl_take isl_basic_map
*bmap
)
3273 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3274 if (isl_basic_map_div_is_known(bmap
, i
))
3276 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3285 /* Remove all divs that are unknown or defined in terms of unknown divs.
3287 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3288 __isl_take isl_basic_set
*bset
)
3290 return isl_basic_map_remove_unknown_divs(bset
);
3293 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3302 map
= isl_map_cow(map
);
3306 for (i
= 0; i
< map
->n
; ++i
) {
3307 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3317 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3319 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3322 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3323 __isl_take isl_basic_set
*bset
,
3324 enum isl_dim_type type
, unsigned first
, unsigned n
)
3326 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3327 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3328 return bset_from_bmap(bmap
);
3331 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3332 enum isl_dim_type type
, unsigned first
, unsigned n
)
3339 map
= isl_map_cow(map
);
3340 if (isl_map_check_range(map
, type
, first
, n
) < 0)
3341 return isl_map_free(map
);
3343 for (i
= 0; i
< map
->n
; ++i
) {
3344 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3345 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3349 map
= isl_map_drop(map
, type
, first
, n
);
3356 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3357 enum isl_dim_type type
, unsigned first
, unsigned n
)
3359 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3363 /* Project out n inputs starting at first using Fourier-Motzkin */
3364 __isl_give isl_map
*isl_map_remove_inputs(__isl_take isl_map
*map
,
3365 unsigned first
, unsigned n
)
3367 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3370 void isl_basic_set_print_internal(__isl_keep isl_basic_set
*bset
,
3371 FILE *out
, int indent
)
3376 fprintf(out
, "null basic set\n");
3380 fprintf(out
, "%*s", indent
, "");
3381 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3382 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3383 bset
->extra
, bset
->flags
);
3385 p
= isl_printer_to_file(isl_basic_set_get_ctx(bset
), out
);
3386 p
= isl_printer_set_dump(p
, 1);
3387 p
= isl_printer_set_indent(p
, indent
);
3388 p
= isl_printer_start_line(p
);
3389 p
= isl_printer_print_basic_set(p
, bset
);
3390 p
= isl_printer_end_line(p
);
3391 isl_printer_free(p
);
3394 void isl_basic_map_print_internal(__isl_keep isl_basic_map
*bmap
,
3395 FILE *out
, int indent
)
3400 fprintf(out
, "null basic map\n");
3404 fprintf(out
, "%*s", indent
, "");
3405 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3406 "flags: %x, n_name: %d\n",
3408 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3409 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3411 p
= isl_printer_to_file(isl_basic_map_get_ctx(bmap
), out
);
3412 p
= isl_printer_set_dump(p
, 1);
3413 p
= isl_printer_set_indent(p
, indent
);
3414 p
= isl_printer_start_line(p
);
3415 p
= isl_printer_print_basic_map(p
, bmap
);
3416 p
= isl_printer_end_line(p
);
3417 isl_printer_free(p
);
3420 __isl_give isl_basic_map
*isl_inequality_negate(__isl_take isl_basic_map
*bmap
,
3425 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
3427 return isl_basic_map_free(bmap
);
3428 if (pos
>= bmap
->n_ineq
)
3429 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
3430 "invalid position", return isl_basic_map_free(bmap
));
3431 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3432 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3433 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
3434 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
3438 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3441 if (isl_space_check_is_set(space
) < 0)
3443 return isl_map_alloc_space(space
, n
, flags
);
3445 isl_space_free(space
);
3449 /* Make sure "map" has room for at least "n" more basic maps.
3451 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3454 struct isl_map
*grown
= NULL
;
3458 isl_assert(map
->ctx
, n
>= 0, goto error
);
3459 if (map
->n
+ n
<= map
->size
)
3461 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3464 for (i
= 0; i
< map
->n
; ++i
) {
3465 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3473 isl_map_free(grown
);
3478 /* Make sure "set" has room for at least "n" more basic sets.
3480 __isl_give isl_set
*isl_set_grow(__isl_take isl_set
*set
, int n
)
3482 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3485 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3487 return isl_map_from_basic_map(bset
);
3490 /* This function performs the same operation as isl_set_from_basic_set,
3491 * but is considered as a function on an isl_basic_set when exported.
3493 __isl_give isl_set
*isl_basic_set_to_set(__isl_take isl_basic_set
*bset
)
3495 return isl_set_from_basic_set(bset
);
3498 __isl_give isl_map
*isl_map_from_basic_map(__isl_take isl_basic_map
*bmap
)
3500 struct isl_map
*map
;
3505 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3506 return isl_map_add_basic_map(map
, bmap
);
3509 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3510 __isl_take isl_basic_set
*bset
)
3512 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3513 bset_to_bmap(bset
)));
3516 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3518 return isl_map_free(set
);
3521 void isl_set_print_internal(__isl_keep isl_set
*set
, FILE *out
, int indent
)
3526 fprintf(out
, "null set\n");
3530 fprintf(out
, "%*s", indent
, "");
3531 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3532 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3534 for (i
= 0; i
< set
->n
; ++i
) {
3535 fprintf(out
, "%*s", indent
, "");
3536 fprintf(out
, "basic set %d:\n", i
);
3537 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3541 void isl_map_print_internal(__isl_keep isl_map
*map
, FILE *out
, int indent
)
3546 fprintf(out
, "null map\n");
3550 fprintf(out
, "%*s", indent
, "");
3551 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3552 "flags: %x, n_name: %d\n",
3553 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3554 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3555 for (i
= 0; i
< map
->n
; ++i
) {
3556 fprintf(out
, "%*s", indent
, "");
3557 fprintf(out
, "basic map %d:\n", i
);
3558 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3562 /* Check that the space of "bset" is the same as that of the domain of "bmap".
3564 static isl_stat
isl_basic_map_check_compatible_domain(
3565 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3569 ok
= isl_basic_map_compatible_domain(bmap
, bset
);
3571 return isl_stat_error
;
3573 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3574 "incompatible spaces", return isl_stat_error
);
3579 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3580 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3582 struct isl_basic_map
*bmap_domain
;
3585 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3588 dim
= isl_basic_set_dim(bset
, isl_dim_set
);
3592 isl_basic_map_check_compatible_domain(bmap
, bset
) < 0)
3595 bmap
= isl_basic_map_cow(bmap
);
3598 bmap
= isl_basic_map_extend(bmap
,
3599 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3600 bmap_domain
= isl_basic_map_from_domain(bset
);
3601 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3603 bmap
= isl_basic_map_simplify(bmap
);
3604 return isl_basic_map_finalize(bmap
);
3606 isl_basic_map_free(bmap
);
3607 isl_basic_set_free(bset
);
3611 /* Check that the space of "bset" is the same as that of the range of "bmap".
3613 static isl_stat
isl_basic_map_check_compatible_range(
3614 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3618 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3620 return isl_stat_error
;
3622 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3623 "incompatible spaces", return isl_stat_error
);
3628 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3629 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3631 struct isl_basic_map
*bmap_range
;
3634 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3637 dim
= isl_basic_set_dim(bset
, isl_dim_set
);
3640 if (dim
!= 0 && isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3643 if (isl_basic_set_plain_is_universe(bset
)) {
3644 isl_basic_set_free(bset
);
3648 bmap
= isl_basic_map_cow(bmap
);
3651 bmap
= isl_basic_map_extend(bmap
,
3652 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3653 bmap_range
= bset_to_bmap(bset
);
3654 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3656 bmap
= isl_basic_map_simplify(bmap
);
3657 return isl_basic_map_finalize(bmap
);
3659 isl_basic_map_free(bmap
);
3660 isl_basic_set_free(bset
);
3664 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3665 __isl_keep isl_vec
*vec
)
3671 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
3672 if (total
< 0 || !vec
)
3673 return isl_bool_error
;
3675 if (1 + total
!= vec
->size
)
3676 return isl_bool_false
;
3680 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3681 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], 1 + total
, &s
);
3682 if (!isl_int_is_zero(s
)) {
3684 return isl_bool_false
;
3688 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3689 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], 1 + total
, &s
);
3690 if (isl_int_is_neg(s
)) {
3692 return isl_bool_false
;
3698 return isl_bool_true
;
3701 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3702 __isl_keep isl_vec
*vec
)
3704 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3707 __isl_give isl_basic_map
*isl_basic_map_intersect(
3708 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3710 struct isl_vec
*sample
= NULL
;
3711 isl_space
*space1
, *space2
;
3712 isl_size dim1
, dim2
, nparam1
, nparam2
;
3714 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3716 space1
= isl_basic_map_peek_space(bmap1
);
3717 space2
= isl_basic_map_peek_space(bmap2
);
3718 dim1
= isl_space_dim(space1
, isl_dim_all
);
3719 dim2
= isl_space_dim(space2
, isl_dim_all
);
3720 nparam1
= isl_space_dim(space1
, isl_dim_param
);
3721 nparam2
= isl_space_dim(space2
, isl_dim_param
);
3722 if (dim1
< 0 || dim2
< 0 || nparam1
< 0 || nparam2
< 0)
3724 if (dim1
== nparam1
&& dim2
!= nparam2
)
3725 return isl_basic_map_intersect(bmap2
, bmap1
);
3727 if (dim2
!= nparam2
&&
3728 isl_basic_map_check_equal_space(bmap1
, bmap2
) < 0)
3731 if (isl_basic_map_plain_is_empty(bmap1
)) {
3732 isl_basic_map_free(bmap2
);
3735 if (isl_basic_map_plain_is_empty(bmap2
)) {
3736 isl_basic_map_free(bmap1
);
3740 if (bmap1
->sample
&&
3741 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3742 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3743 sample
= isl_vec_copy(bmap1
->sample
);
3744 else if (bmap2
->sample
&&
3745 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3746 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3747 sample
= isl_vec_copy(bmap2
->sample
);
3749 bmap1
= isl_basic_map_cow(bmap1
);
3752 bmap1
= isl_basic_map_extend(bmap1
,
3753 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3754 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3757 isl_vec_free(sample
);
3759 isl_vec_free(bmap1
->sample
);
3760 bmap1
->sample
= sample
;
3763 bmap1
= isl_basic_map_simplify(bmap1
);
3764 return isl_basic_map_finalize(bmap1
);
3767 isl_vec_free(sample
);
3768 isl_basic_map_free(bmap1
);
3769 isl_basic_map_free(bmap2
);
3773 __isl_give isl_basic_set
*isl_basic_set_intersect(
3774 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3776 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3777 bset_to_bmap(bset2
)));
3780 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3781 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3783 return isl_basic_set_intersect(bset1
, bset2
);
3786 /* Does "map" consist of a single disjunct, without any local variables?
3788 static isl_bool
is_convex_no_locals(__isl_keep isl_map
*map
)
3793 return isl_bool_error
;
3795 return isl_bool_false
;
3796 n_div
= isl_basic_map_dim(map
->p
[0], isl_dim_div
);
3798 return isl_bool_error
;
3800 return isl_bool_false
;
3801 return isl_bool_true
;
3804 /* Check that "map" consists of a single disjunct, without any local variables.
3806 static isl_stat
check_convex_no_locals(__isl_keep isl_map
*map
)
3810 ok
= is_convex_no_locals(map
);
3812 return isl_stat_error
;
3816 isl_die(isl_map_get_ctx(map
), isl_error_internal
,
3817 "unexpectedly not convex or involving local variables",
3818 return isl_stat_error
);
3821 /* Special case of isl_map_intersect, where both map1 and map2
3822 * are convex, without any divs and such that either map1 or map2
3823 * contains a single constraint. This constraint is then simply
3824 * added to the other map.
3826 static __isl_give isl_map
*map_intersect_add_constraint(
3827 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3829 if (check_convex_no_locals(map1
) < 0 ||
3830 check_convex_no_locals(map2
) < 0)
3833 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3834 return isl_map_intersect(map2
, map1
);
3836 map1
= isl_map_cow(map1
);
3839 if (isl_map_plain_is_empty(map1
)) {
3843 if (map2
->p
[0]->n_eq
== 1)
3844 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3846 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3847 map2
->p
[0]->ineq
[0]);
3849 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3850 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3854 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3855 isl_basic_map_free(map1
->p
[0]);
3861 map1
= isl_map_unmark_normalized(map1
);
3869 /* map2 may be either a parameter domain or a map living in the same
3872 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3873 __isl_take isl_map
*map2
)
3879 isl_size dim2
, nparam2
;
3884 if ((isl_map_plain_is_empty(map1
) ||
3885 isl_map_plain_is_universe(map2
)) &&
3886 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3890 if ((isl_map_plain_is_empty(map2
) ||
3891 isl_map_plain_is_universe(map1
)) &&
3892 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3897 if (is_convex_no_locals(map1
) == isl_bool_true
&&
3898 is_convex_no_locals(map2
) == isl_bool_true
&&
3899 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3900 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3901 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3902 return map_intersect_add_constraint(map1
, map2
);
3904 equal
= isl_map_plain_is_equal(map1
, map2
);
3912 dim2
= isl_map_dim(map2
, isl_dim_all
);
3913 nparam2
= isl_map_dim(map2
, isl_dim_param
);
3914 if (dim2
< 0 || nparam2
< 0)
3916 if (dim2
!= nparam2
)
3917 isl_assert(map1
->ctx
,
3918 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3920 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3921 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3922 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3924 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3925 map1
->n
* map2
->n
, flags
);
3928 for (i
= 0; i
< map1
->n
; ++i
)
3929 for (j
= 0; j
< map2
->n
; ++j
) {
3930 struct isl_basic_map
*part
;
3931 part
= isl_basic_map_intersect(
3932 isl_basic_map_copy(map1
->p
[i
]),
3933 isl_basic_map_copy(map2
->p
[j
]));
3934 if (isl_basic_map_is_empty(part
) < 0)
3935 part
= isl_basic_map_free(part
);
3936 result
= isl_map_add_basic_map(result
, part
);
3949 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3950 __isl_take isl_map
*map2
)
3952 if (isl_map_check_equal_space(map1
, map2
) < 0)
3954 return map_intersect_internal(map1
, map2
);
3961 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3962 __isl_take isl_map
*map2
)
3964 isl_map_align_params_bin(&map1
, &map2
);
3965 return map_intersect(map1
, map2
);
3968 __isl_give isl_set
*isl_set_intersect(__isl_take isl_set
*set1
,
3969 __isl_take isl_set
*set2
)
3971 return set_from_map(isl_map_intersect(set_to_map(set1
),
3975 /* map_intersect_internal accepts intersections
3976 * with parameter domains, so we can just call that function.
3978 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map
,
3979 __isl_take isl_set
*params
)
3981 isl_map_align_params_set(&map
, ¶ms
);
3982 return map_intersect_internal(map
, params
);
3985 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3986 __isl_take isl_set
*params
)
3988 return isl_map_intersect_params(set
, params
);
3991 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3999 bmap
= isl_basic_map_cow(bmap
);
4002 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
4003 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
4004 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
4005 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
4006 if (n1
< 0 || n2
< 0)
4007 bmap
= isl_basic_map_free(bmap
);
4008 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
4009 return isl_basic_map_reset_space(bmap
, space
);
4012 /* Given a basic map where the tuple of type "type" is a wrapped map,
4013 * swap domain and range of that wrapped map.
4015 static __isl_give isl_basic_map
*isl_basic_map_reverse_wrapped(
4016 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
4019 isl_size offset
, n1
, n2
;
4021 space
= isl_basic_map_peek_space(bmap
);
4022 offset
= isl_basic_map_var_offset(bmap
, type
);
4023 n1
= isl_space_wrapped_dim(space
, type
, isl_dim_in
);
4024 n2
= isl_space_wrapped_dim(space
, type
, isl_dim_out
);
4025 if (offset
< 0 || n1
< 0 || n2
< 0)
4026 return isl_basic_map_free(bmap
);
4028 bmap
= isl_basic_map_swap_vars(bmap
, 1 + offset
, n1
, n2
);
4030 space
= isl_basic_map_take_space(bmap
);
4031 space
= isl_space_reverse_wrapped(space
, type
);
4032 bmap
= isl_basic_map_restore_space(bmap
, space
);
4037 /* Given a basic map (A -> B) -> C, return the corresponding basic map
4040 static __isl_give isl_basic_map
*isl_basic_map_domain_reverse(
4041 __isl_take isl_basic_map
*bmap
)
4045 space
= isl_basic_map_peek_space(bmap
);
4046 if (isl_space_check_domain_is_wrapping(space
) < 0)
4047 return isl_basic_map_free(bmap
);
4048 bmap
= isl_basic_map_reverse_wrapped(bmap
, isl_dim_in
);
4053 /* Given a basic map A -> (B -> C), return the corresponding basic map
4056 static __isl_give isl_basic_map
*isl_basic_map_range_reverse(
4057 __isl_take isl_basic_map
*bmap
)
4061 space
= isl_basic_map_peek_space(bmap
);
4062 if (isl_space_check_range_is_wrapping(space
) < 0)
4063 return isl_basic_map_free(bmap
);
4064 bmap
= isl_basic_map_reverse_wrapped(bmap
, isl_dim_out
);
4069 /* Given a basic map that is actually a basic set (A -> B),
4070 * return the corresponding basic set (B -> A) as a basic map.
4072 static __isl_give isl_basic_map
*isl_basic_map_set_reverse(
4073 __isl_take isl_basic_map
*bmap
)
4077 space
= isl_basic_map_peek_space(bmap
);
4078 if (isl_space_check_is_wrapping(space
) < 0)
4079 return isl_basic_map_free(bmap
);
4080 bmap
= isl_basic_map_reverse_wrapped(bmap
, isl_dim_set
);
4085 static __isl_give isl_basic_map
*basic_map_space_reset(
4086 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
4092 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
4095 space
= isl_basic_map_get_space(bmap
);
4096 space
= isl_space_reset(space
, type
);
4097 bmap
= isl_basic_map_reset_space(bmap
, space
);
4101 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
4102 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4103 unsigned pos
, unsigned n
)
4105 isl_bool rational
, is_empty
;
4106 isl_space
*res_space
;
4107 struct isl_basic_map
*res
;
4108 struct isl_dim_map
*dim_map
;
4111 enum isl_dim_type t
;
4114 return basic_map_space_reset(bmap
, type
);
4116 is_empty
= isl_basic_map_plain_is_empty(bmap
);
4117 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
4118 if (is_empty
< 0 || total
< 0)
4119 return isl_basic_map_free(bmap
);
4120 res_space
= isl_space_insert_dims(isl_basic_map_get_space(bmap
),
4123 return isl_basic_map_free(bmap
);
4125 isl_basic_map_free(bmap
);
4126 return isl_basic_map_empty(res_space
);
4129 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
+ n
);
4131 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4135 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4137 isl_size size
= isl_basic_map_dim(bmap
, t
);
4139 dim_map
= isl_dim_map_free(dim_map
);
4140 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4142 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4143 pos
, size
- pos
, off
+ pos
+ n
);
4145 dim
= isl_space_dim(res_space
, t
);
4147 dim_map
= isl_dim_map_free(dim_map
);
4150 isl_dim_map_div(dim_map
, bmap
, off
);
4152 res
= isl_basic_map_alloc_space(res_space
,
4153 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4154 rational
= isl_basic_map_is_rational(bmap
);
4156 res
= isl_basic_map_free(res
);
4158 res
= isl_basic_map_set_rational(res
);
4159 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4160 return isl_basic_map_finalize(res
);
4163 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
4164 __isl_take isl_basic_set
*bset
,
4165 enum isl_dim_type type
, unsigned pos
, unsigned n
)
4167 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
4170 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
4171 enum isl_dim_type type
, unsigned n
)
4175 dim
= isl_basic_map_dim(bmap
, type
);
4177 return isl_basic_map_free(bmap
);
4178 return isl_basic_map_insert_dims(bmap
, type
, dim
, n
);
4181 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
4182 enum isl_dim_type type
, unsigned n
)
4186 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
4187 return isl_basic_map_add_dims(bset
, type
, n
);
4189 isl_basic_set_free(bset
);
4193 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
4194 enum isl_dim_type type
)
4198 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
4201 space
= isl_map_get_space(map
);
4202 space
= isl_space_reset(space
, type
);
4203 map
= isl_map_reset_space(map
, space
);
4207 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
4208 enum isl_dim_type type
, unsigned pos
, unsigned n
)
4214 return map_space_reset(map
, type
);
4216 map
= isl_map_cow(map
);
4220 for (i
= 0; i
< map
->n
; ++i
) {
4221 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
4226 space
= isl_map_take_space(map
);
4227 space
= isl_space_insert_dims(space
, type
, pos
, n
);
4228 map
= isl_map_restore_space(map
, space
);
4236 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
4237 enum isl_dim_type type
, unsigned pos
, unsigned n
)
4239 return isl_map_insert_dims(set
, type
, pos
, n
);
4242 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
4243 enum isl_dim_type type
, unsigned n
)
4247 dim
= isl_map_dim(map
, type
);
4249 return isl_map_free(map
);
4250 return isl_map_insert_dims(map
, type
, dim
, n
);
4253 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
4254 enum isl_dim_type type
, unsigned n
)
4258 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
4259 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
4265 __isl_give isl_basic_map
*isl_basic_map_move_dims(
4266 __isl_take isl_basic_map
*bmap
,
4267 enum isl_dim_type dst_type
, unsigned dst_pos
,
4268 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4271 struct isl_dim_map
*dim_map
;
4272 struct isl_basic_map
*res
;
4273 enum isl_dim_type t
;
4280 bmap
= isl_basic_map_reset(bmap
, src_type
);
4281 bmap
= isl_basic_map_reset(bmap
, dst_type
);
4285 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
4286 return isl_basic_map_free(bmap
);
4288 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4291 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
4293 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
4294 pos(bmap
->dim
, src_type
) + src_pos
+
4295 ((src_type
< dst_type
) ? n
: 0)) {
4296 space
= isl_basic_map_take_space(bmap
);
4297 space
= isl_space_move_dims(space
, dst_type
, dst_pos
,
4298 src_type
, src_pos
, n
);
4299 bmap
= isl_basic_map_restore_space(bmap
, space
);
4300 bmap
= isl_basic_map_finalize(bmap
);
4305 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
4307 return isl_basic_map_free(bmap
);
4308 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4311 space
= isl_basic_map_peek_space(bmap
);
4312 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4313 isl_size size
= isl_space_dim(space
, t
);
4315 dim_map
= isl_dim_map_free(dim_map
);
4316 if (t
== dst_type
) {
4317 isl_dim_map_dim_range(dim_map
, space
, t
,
4320 isl_dim_map_dim_range(dim_map
, space
, src_type
,
4323 isl_dim_map_dim_range(dim_map
, space
, t
,
4324 dst_pos
, size
- dst_pos
, off
);
4325 off
+= size
- dst_pos
;
4326 } else if (t
== src_type
) {
4327 isl_dim_map_dim_range(dim_map
, space
, t
,
4330 isl_dim_map_dim_range(dim_map
, space
, t
,
4331 src_pos
+ n
, size
- src_pos
- n
, off
);
4332 off
+= size
- src_pos
- n
;
4334 isl_dim_map_dim(dim_map
, space
, t
, off
);
4338 isl_dim_map_div(dim_map
, bmap
, off
);
4340 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4341 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4342 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4343 space
= isl_basic_map_take_space(bmap
);
4344 space
= isl_space_move_dims(space
, dst_type
, dst_pos
,
4345 src_type
, src_pos
, n
);
4346 bmap
= isl_basic_map_restore_space(bmap
, space
);
4350 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
4351 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4352 bmap
= isl_basic_map_finalize(bmap
);
4356 isl_basic_map_free(bmap
);
4360 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4361 enum isl_dim_type dst_type
, unsigned dst_pos
,
4362 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4364 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4365 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4366 src_type
, src_pos
, n
);
4367 return bset_from_bmap(bmap
);
4370 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4371 enum isl_dim_type dst_type
, unsigned dst_pos
,
4372 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4376 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4377 return set_from_map(isl_map_move_dims(set_to_map(set
),
4378 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4384 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4385 enum isl_dim_type dst_type
, unsigned dst_pos
,
4386 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4392 map
= isl_map_reset(map
, src_type
);
4393 map
= isl_map_reset(map
, dst_type
);
4397 if (isl_map_check_range(map
, src_type
, src_pos
, n
))
4398 return isl_map_free(map
);
4400 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4403 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4405 map
= isl_map_cow(map
);
4409 for (i
= 0; i
< map
->n
; ++i
) {
4410 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4412 src_type
, src_pos
, n
);
4417 space
= isl_map_take_space(map
);
4418 space
= isl_space_move_dims(space
, dst_type
, dst_pos
,
4419 src_type
, src_pos
, n
);
4420 map
= isl_map_restore_space(map
, space
);
4428 /* Move the specified dimensions to the last columns right before
4429 * the divs. Don't change the dimension specification of bmap.
4430 * That's the responsibility of the caller.
4432 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4433 enum isl_dim_type type
, unsigned first
, unsigned n
)
4436 struct isl_dim_map
*dim_map
;
4437 struct isl_basic_map
*res
;
4438 enum isl_dim_type t
;
4444 if (isl_basic_map_offset(bmap
, type
) + first
+ n
==
4445 isl_basic_map_offset(bmap
, isl_dim_div
))
4448 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
4450 return isl_basic_map_free(bmap
);
4451 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4454 space
= isl_basic_map_peek_space(bmap
);
4455 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4456 isl_size size
= isl_space_dim(space
, t
);
4458 dim_map
= isl_dim_map_free(dim_map
);
4460 isl_dim_map_dim_range(dim_map
, space
, t
,
4463 isl_dim_map_dim_range(dim_map
, space
, t
,
4464 first
, n
, total
- bmap
->n_div
- n
);
4465 isl_dim_map_dim_range(dim_map
, space
, t
,
4466 first
+ n
, size
- (first
+ n
), off
);
4467 off
+= size
- (first
+ n
);
4469 isl_dim_map_dim(dim_map
, space
, t
, off
);
4473 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4475 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4476 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4477 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4481 /* Insert "n" rows in the divs of "bmap".
4483 * The number of columns is not changed, which means that the last
4484 * dimensions of "bmap" are being reintepreted as the new divs.
4485 * The space of "bmap" is not adjusted, however, which means
4486 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4487 * from the space of "bmap" is the responsibility of the caller.
4489 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4497 bmap
= isl_basic_map_cow(bmap
);
4501 row_size
= isl_basic_map_offset(bmap
, isl_dim_div
) + bmap
->extra
;
4502 old
= bmap
->block2
.data
;
4503 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4504 (bmap
->extra
+ n
) * (1 + row_size
));
4505 if (!bmap
->block2
.data
)
4506 return isl_basic_map_free(bmap
);
4507 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4509 return isl_basic_map_free(bmap
);
4510 for (i
= 0; i
< n
; ++i
) {
4511 new_div
[i
] = bmap
->block2
.data
+
4512 (bmap
->extra
+ i
) * (1 + row_size
);
4513 isl_seq_clr(new_div
[i
], 1 + row_size
);
4515 for (i
= 0; i
< bmap
->extra
; ++i
)
4516 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4518 bmap
->div
= new_div
;
4525 /* Drop constraints from "bmap" that only involve the variables
4526 * of "type" in the range [first, first + n] that are not related
4527 * to any of the variables outside that interval.
4528 * These constraints cannot influence the values for the variables
4529 * outside the interval, except in case they cause "bmap" to be empty.
4530 * Only drop the constraints if "bmap" is known to be non-empty.
4532 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4533 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4534 unsigned first
, unsigned n
)
4538 isl_size dim
, n_div
;
4541 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4543 return isl_basic_map_free(bmap
);
4547 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4548 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4549 if (dim
< 0 || n_div
< 0)
4550 return isl_basic_map_free(bmap
);
4551 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4553 return isl_basic_map_free(bmap
);
4554 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4555 for (i
= 0; i
< first
; ++i
)
4557 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4560 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4565 /* Turn the n dimensions of type type, starting at first
4566 * into existentially quantified variables.
4568 * If a subset of the projected out variables are unrelated
4569 * to any of the variables that remain, then the constraints
4570 * involving this subset are simply dropped first.
4572 __isl_give isl_basic_map
*isl_basic_map_project_out(
4573 __isl_take isl_basic_map
*bmap
,
4574 enum isl_dim_type type
, unsigned first
, unsigned n
)
4580 return basic_map_space_reset(bmap
, type
);
4581 if (type
== isl_dim_div
)
4582 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4583 "cannot project out existentially quantified variables",
4584 return isl_basic_map_free(bmap
));
4586 empty
= isl_basic_map_plain_is_empty(bmap
);
4588 return isl_basic_map_free(bmap
);
4590 bmap
= isl_basic_map_set_to_empty(bmap
);
4592 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4596 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4597 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4599 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4600 return isl_basic_map_free(bmap
);
4602 bmap
= move_last(bmap
, type
, first
, n
);
4603 bmap
= isl_basic_map_cow(bmap
);
4604 bmap
= insert_div_rows(bmap
, n
);
4606 space
= isl_basic_map_take_space(bmap
);
4607 space
= isl_space_drop_dims(space
, type
, first
, n
);
4608 bmap
= isl_basic_map_restore_space(bmap
, space
);
4609 bmap
= isl_basic_map_simplify(bmap
);
4610 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4611 return isl_basic_map_finalize(bmap
);
4614 /* Turn the n dimensions of type type, starting at first
4615 * into existentially quantified variables.
4617 __isl_give isl_basic_set
*isl_basic_set_project_out(
4618 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
,
4619 unsigned first
, unsigned n
)
4621 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4625 /* Turn the n dimensions of type type, starting at first
4626 * into existentially quantified variables.
4628 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4629 enum isl_dim_type type
, unsigned first
, unsigned n
)
4635 return map_space_reset(map
, type
);
4637 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4638 return isl_map_free(map
);
4640 map
= isl_map_cow(map
);
4644 for (i
= 0; i
< map
->n
; ++i
) {
4645 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4651 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4652 map
= isl_map_unmark_normalized(map
);
4654 space
= isl_map_take_space(map
);
4655 space
= isl_space_drop_dims(space
, type
, first
, n
);
4656 map
= isl_map_restore_space(map
, space
);
4665 #define TYPE isl_map
4666 #include "isl_project_out_all_params_templ.c"
4667 #include "isl_project_out_param_templ.c"
4669 /* Turn all the dimensions of type "type", except the "n" starting at "first"
4670 * into existentially quantified variables.
4672 __isl_give isl_map
*isl_map_project_onto(__isl_take isl_map
*map
,
4673 enum isl_dim_type type
, unsigned first
, unsigned n
)
4677 dim
= isl_map_dim(map
, type
);
4678 if (isl_map_check_range(map
, type
, first
, n
) < 0 || dim
< 0)
4679 return isl_map_free(map
);
4680 map
= isl_map_project_out(map
, type
, first
+ n
, dim
- (first
+ n
));
4681 map
= isl_map_project_out(map
, type
, 0, first
);
4685 /* Turn the n dimensions of type type, starting at first
4686 * into existentially quantified variables.
4688 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4689 enum isl_dim_type type
, unsigned first
, unsigned n
)
4691 return set_from_map(isl_map_project_out(set_to_map(set
),
4695 /* If "set" involves a parameter with identifier "id",
4696 * then turn it into an existentially quantified variable.
4698 __isl_give isl_set
*isl_set_project_out_param_id(__isl_take isl_set
*set
,
4699 __isl_take isl_id
*id
)
4701 return set_from_map(isl_map_project_out_param_id(set_to_map(set
), id
));
4704 /* If "set" involves any of the parameters with identifiers in "list",
4705 * then turn them into existentially quantified variables.
4707 __isl_give isl_set
*isl_set_project_out_param_id_list(__isl_take isl_set
*set
,
4708 __isl_take isl_id_list
*list
)
4712 map
= set_to_map(set
);
4713 map
= isl_map_project_out_param_id_list(map
, list
);
4714 return set_from_map(map
);
4717 /* Project out all parameters from "set" by existentially quantifying
4720 __isl_give isl_set
*isl_set_project_out_all_params(__isl_take isl_set
*set
)
4722 return set_from_map(isl_map_project_out_all_params(set_to_map(set
)));
4725 /* Return a map that projects the elements in "set" onto their
4726 * "n" set dimensions starting at "first".
4727 * "type" should be equal to isl_dim_set.
4729 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4730 enum isl_dim_type type
, unsigned first
, unsigned n
)
4735 if (type
!= isl_dim_set
)
4736 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4737 "only set dimensions can be projected out", goto error
);
4738 if (isl_set_check_range(set
, type
, first
, n
) < 0)
4739 return isl_set_free(set
);
4741 map
= isl_map_from_domain(set
);
4742 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4743 for (i
= 0; i
< n
; ++i
)
4744 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4752 static __isl_give isl_basic_map
*add_divs(__isl_take isl_basic_map
*bmap
,
4758 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
4760 return isl_basic_map_free(bmap
);
4761 for (i
= 0; i
< n
; ++i
) {
4762 j
= isl_basic_map_alloc_div(bmap
);
4765 isl_seq_clr(bmap
->div
[j
], 1 + 1 + total
);
4769 isl_basic_map_free(bmap
);
4773 /* Does "bmap2" apply to the range of "bmap1" (ignoring parameters)?
4775 isl_bool
isl_basic_map_applies_range(__isl_keep isl_basic_map
*bmap1
,
4776 __isl_keep isl_basic_map
*bmap2
)
4778 isl_space
*space1
, *space2
;
4780 space1
= isl_basic_map_peek_space(bmap1
);
4781 space2
= isl_basic_map_peek_space(bmap2
);
4782 return isl_space_tuple_is_equal(space1
, isl_dim_out
,
4783 space2
, isl_dim_in
);
4786 /* Check that "bmap2" applies to the range of "bmap1" (ignoring parameters).
4788 static isl_stat
isl_basic_map_check_applies_range(
4789 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
4793 equal
= isl_basic_map_applies_range(bmap1
, bmap2
);
4795 return isl_stat_error
;
4797 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4798 "spaces don't match", return isl_stat_error
);
4802 __isl_give isl_basic_map
*isl_basic_map_apply_range(
4803 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
4805 isl_space
*space_result
= NULL
;
4806 struct isl_basic_map
*bmap
;
4807 isl_size n_in
, n_out
, n
, nparam
;
4808 unsigned total
, pos
;
4809 struct isl_dim_map
*dim_map1
, *dim_map2
;
4811 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4813 if (isl_basic_map_check_applies_range(bmap1
, bmap2
) < 0)
4816 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4817 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4818 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4819 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4820 if (n_in
< 0 || n_out
< 0 || n
< 0 || nparam
< 0)
4823 space_result
= isl_space_join(isl_basic_map_get_space(bmap1
),
4824 isl_basic_map_get_space(bmap2
));
4826 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4827 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4828 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4829 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4830 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4831 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4832 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4833 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4834 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4835 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4836 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4838 bmap
= isl_basic_map_alloc_space(space_result
,
4839 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4840 bmap1
->n_eq
+ bmap2
->n_eq
,
4841 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4842 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4843 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4844 bmap
= add_divs(bmap
, n
);
4845 bmap
= isl_basic_map_simplify(bmap
);
4846 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4847 return isl_basic_map_finalize(bmap
);
4849 isl_basic_map_free(bmap1
);
4850 isl_basic_map_free(bmap2
);
4854 __isl_give isl_basic_set
*isl_basic_set_apply(__isl_take isl_basic_set
*bset
,
4855 __isl_take isl_basic_map
*bmap
)
4857 if (isl_basic_map_check_compatible_domain(bmap
, bset
) < 0)
4860 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4863 isl_basic_set_free(bset
);
4864 isl_basic_map_free(bmap
);
4868 __isl_give isl_basic_map
*isl_basic_map_apply_domain(
4869 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
4871 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4873 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4874 bmap2
->dim
, isl_dim_in
))
4875 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4876 "spaces don't match", goto error
);
4878 bmap1
= isl_basic_map_reverse(bmap1
);
4879 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4880 return isl_basic_map_reverse(bmap1
);
4882 isl_basic_map_free(bmap1
);
4883 isl_basic_map_free(bmap2
);
4887 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4888 * A \cap B -> f(A) + f(B)
4890 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4891 __isl_take isl_basic_map
*bmap2
)
4893 isl_size n_in
, n_out
, nparam
;
4894 unsigned total
, pos
;
4895 struct isl_basic_map
*bmap
= NULL
;
4896 struct isl_dim_map
*dim_map1
, *dim_map2
;
4899 if (isl_basic_map_check_equal_space(bmap1
, bmap2
) < 0)
4902 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4903 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4904 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4905 if (nparam
< 0 || n_in
< 0 || n_out
< 0)
4908 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4909 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4910 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4911 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4912 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4913 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4914 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4915 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4916 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4917 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4918 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4920 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4921 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4922 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4923 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4924 for (i
= 0; i
< n_out
; ++i
) {
4925 int j
= isl_basic_map_alloc_equality(bmap
);
4928 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4929 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4930 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4931 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4933 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4934 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4935 bmap
= add_divs(bmap
, 2 * n_out
);
4937 bmap
= isl_basic_map_simplify(bmap
);
4938 return isl_basic_map_finalize(bmap
);
4940 isl_basic_map_free(bmap
);
4941 isl_basic_map_free(bmap1
);
4942 isl_basic_map_free(bmap2
);
4946 /* Given two maps A -> f(A) and B -> g(B), construct a map
4947 * A \cap B -> f(A) + f(B)
4949 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4950 __isl_take isl_map
*map2
)
4952 struct isl_map
*result
;
4955 if (isl_map_check_equal_space(map1
, map2
) < 0)
4958 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4959 map1
->n
* map2
->n
, 0);
4962 for (i
= 0; i
< map1
->n
; ++i
)
4963 for (j
= 0; j
< map2
->n
; ++j
) {
4964 struct isl_basic_map
*part
;
4965 part
= isl_basic_map_sum(
4966 isl_basic_map_copy(map1
->p
[i
]),
4967 isl_basic_map_copy(map2
->p
[j
]));
4968 if (isl_basic_map_is_empty(part
))
4969 isl_basic_map_free(part
);
4971 result
= isl_map_add_basic_map(result
, part
);
4984 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4985 __isl_take isl_set
*set2
)
4987 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4990 /* Given a basic map A -> f(A), construct A -> -f(A).
4992 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4998 bmap
= isl_basic_map_cow(bmap
);
4999 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
5001 return isl_basic_map_free(bmap
);
5003 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
5004 for (i
= 0; i
< bmap
->n_eq
; ++i
)
5005 for (j
= 0; j
< n
; ++j
)
5006 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
5007 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
5008 for (j
= 0; j
< n
; ++j
)
5009 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
5010 for (i
= 0; i
< bmap
->n_div
; ++i
)
5011 for (j
= 0; j
< n
; ++j
)
5012 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
5013 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5014 return isl_basic_map_finalize(bmap
);
5017 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
5019 return isl_basic_map_neg(bset
);
5022 /* Given a map A -> f(A), construct A -> -f(A).
5024 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
5028 map
= isl_map_cow(map
);
5032 for (i
= 0; i
< map
->n
; ++i
) {
5033 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
5044 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
5046 return set_from_map(isl_map_neg(set_to_map(set
)));
5049 /* Given a basic map A -> f(A) and an integer d, construct a basic map
5050 * A -> floor(f(A)/d).
5052 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
5055 isl_size n_in
, n_out
, nparam
;
5056 unsigned total
, pos
;
5057 struct isl_basic_map
*result
= NULL
;
5058 struct isl_dim_map
*dim_map
;
5061 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5062 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5063 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5064 if (nparam
< 0 || n_in
< 0 || n_out
< 0)
5065 return isl_basic_map_free(bmap
);
5067 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
5068 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
5069 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
5070 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
5071 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
5072 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
5074 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
5075 bmap
->n_div
+ n_out
,
5076 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
5077 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
5078 result
= add_divs(result
, n_out
);
5079 for (i
= 0; i
< n_out
; ++i
) {
5081 j
= isl_basic_map_alloc_inequality(result
);
5084 isl_seq_clr(result
->ineq
[j
], 1+total
);
5085 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
5086 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
5087 j
= isl_basic_map_alloc_inequality(result
);
5090 isl_seq_clr(result
->ineq
[j
], 1+total
);
5091 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
5092 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
5093 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
5096 result
= isl_basic_map_simplify(result
);
5097 return isl_basic_map_finalize(result
);
5099 isl_basic_map_free(result
);
5103 /* Given a map A -> f(A) and an integer d, construct a map
5104 * A -> floor(f(A)/d).
5106 __isl_give isl_map
*isl_map_floordiv(__isl_take isl_map
*map
, isl_int d
)
5110 map
= isl_map_cow(map
);
5114 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5115 for (i
= 0; i
< map
->n
; ++i
) {
5116 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
5120 map
= isl_map_unmark_normalized(map
);
5128 /* Given a map A -> f(A) and an integer d, construct a map
5129 * A -> floor(f(A)/d).
5131 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
5132 __isl_take isl_val
*d
)
5136 if (!isl_val_is_int(d
))
5137 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
5138 "expecting integer denominator", goto error
);
5139 map
= isl_map_floordiv(map
, d
->n
);
5148 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
5156 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
5157 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5158 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5159 if (total
< 0 || nparam
< 0 || n_in
< 0)
5160 return isl_basic_map_free(bmap
);
5161 i
= isl_basic_map_alloc_equality(bmap
);
5164 isl_seq_clr(bmap
->eq
[i
], 1 + total
);
5165 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
5166 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
5167 return isl_basic_map_finalize(bmap
);
5169 isl_basic_map_free(bmap
);
5173 /* Add a constraint to "bmap" expressing i_pos < o_pos
5175 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
5183 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
5184 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5185 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5186 if (total
< 0 || nparam
< 0 || n_in
< 0)
5187 return isl_basic_map_free(bmap
);
5188 i
= isl_basic_map_alloc_inequality(bmap
);
5191 isl_seq_clr(bmap
->ineq
[i
], 1 + total
);
5192 isl_int_set_si(bmap
->ineq
[i
][0], -1);
5193 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
5194 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
5195 return isl_basic_map_finalize(bmap
);
5197 isl_basic_map_free(bmap
);
5201 /* Add a constraint to "bmap" expressing i_pos <= o_pos
5203 static __isl_give isl_basic_map
*var_less_or_equal(
5204 __isl_take isl_basic_map
*bmap
, unsigned pos
)
5211 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
5212 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5213 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5214 if (total
< 0 || nparam
< 0 || n_in
< 0)
5215 return isl_basic_map_free(bmap
);
5216 i
= isl_basic_map_alloc_inequality(bmap
);
5219 isl_seq_clr(bmap
->ineq
[i
], 1 + total
);
5220 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
5221 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
5222 return isl_basic_map_finalize(bmap
);
5224 isl_basic_map_free(bmap
);
5228 /* Add a constraint to "bmap" expressing i_pos > o_pos
5230 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
5238 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
5239 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5240 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5241 if (total
< 0 || nparam
< 0 || n_in
< 0)
5242 return isl_basic_map_free(bmap
);
5243 i
= isl_basic_map_alloc_inequality(bmap
);
5246 isl_seq_clr(bmap
->ineq
[i
], 1 + total
);
5247 isl_int_set_si(bmap
->ineq
[i
][0], -1);
5248 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
5249 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
5250 return isl_basic_map_finalize(bmap
);
5252 isl_basic_map_free(bmap
);
5256 /* Add a constraint to "bmap" expressing i_pos >= o_pos
5258 static __isl_give isl_basic_map
*var_more_or_equal(
5259 __isl_take isl_basic_map
*bmap
, unsigned pos
)
5266 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
5267 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5268 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5269 if (total
< 0 || nparam
< 0 || n_in
< 0)
5270 return isl_basic_map_free(bmap
);
5271 i
= isl_basic_map_alloc_inequality(bmap
);
5274 isl_seq_clr(bmap
->ineq
[i
], 1 + total
);
5275 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
5276 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
5277 return isl_basic_map_finalize(bmap
);
5279 isl_basic_map_free(bmap
);
5283 __isl_give isl_basic_map
*isl_basic_map_equal(
5284 __isl_take isl_space
*space
, unsigned n_equal
)
5287 struct isl_basic_map
*bmap
;
5288 bmap
= isl_basic_map_alloc_space(space
, 0, n_equal
, 0);
5291 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
5292 bmap
= var_equal(bmap
, i
);
5293 return isl_basic_map_finalize(bmap
);
5296 /* Return a relation on of dimension "space" expressing i_[0..pos] << o_[0..pos]
5298 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*space
,
5302 struct isl_basic_map
*bmap
;
5303 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
5306 for (i
= 0; i
< pos
&& bmap
; ++i
)
5307 bmap
= var_equal(bmap
, i
);
5309 bmap
= var_less(bmap
, pos
);
5310 return isl_basic_map_finalize(bmap
);
5313 /* Return a relation on "space" expressing i_[0..pos] <<= o_[0..pos]
5315 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
5316 __isl_take isl_space
*space
, unsigned pos
)
5319 isl_basic_map
*bmap
;
5321 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
5322 for (i
= 0; i
< pos
; ++i
)
5323 bmap
= var_equal(bmap
, i
);
5324 bmap
= var_less_or_equal(bmap
, pos
);
5325 return isl_basic_map_finalize(bmap
);
5328 /* Return a relation on "space" expressing i_pos > o_pos
5330 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*space
,
5334 struct isl_basic_map
*bmap
;
5335 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
5338 for (i
= 0; i
< pos
&& bmap
; ++i
)
5339 bmap
= var_equal(bmap
, i
);
5341 bmap
= var_more(bmap
, pos
);
5342 return isl_basic_map_finalize(bmap
);
5345 /* Return a relation on "space" expressing i_[0..pos] >>= o_[0..pos]
5347 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
5348 __isl_take isl_space
*space
, unsigned pos
)
5351 isl_basic_map
*bmap
;
5353 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
5354 for (i
= 0; i
< pos
; ++i
)
5355 bmap
= var_equal(bmap
, i
);
5356 bmap
= var_more_or_equal(bmap
, pos
);
5357 return isl_basic_map_finalize(bmap
);
5360 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*space
,
5361 unsigned n
, int equal
)
5363 struct isl_map
*map
;
5366 if (n
== 0 && equal
)
5367 return isl_map_universe(space
);
5369 map
= isl_map_alloc_space(isl_space_copy(space
), n
, ISL_MAP_DISJOINT
);
5371 for (i
= 0; i
+ 1 < n
; ++i
)
5372 map
= isl_map_add_basic_map(map
,
5373 isl_basic_map_less_at(isl_space_copy(space
), i
));
5376 map
= isl_map_add_basic_map(map
,
5377 isl_basic_map_less_or_equal_at(space
, n
- 1));
5379 map
= isl_map_add_basic_map(map
,
5380 isl_basic_map_less_at(space
, n
- 1));
5382 isl_space_free(space
);
5387 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*space
, int equal
)
5391 return map_lex_lte_first(space
, space
->n_out
, equal
);
5394 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*space
,
5397 return map_lex_lte_first(space
, n
, 0);
5400 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*space
,
5403 return map_lex_lte_first(space
, n
, 1);
5406 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_space
)
5408 return map_lex_lte(isl_space_map_from_set(set_space
), 0);
5411 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_space
)
5413 return map_lex_lte(isl_space_map_from_set(set_space
), 1);
5416 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*space
,
5417 unsigned n
, int equal
)
5419 struct isl_map
*map
;
5422 if (n
== 0 && equal
)
5423 return isl_map_universe(space
);
5425 map
= isl_map_alloc_space(isl_space_copy(space
), n
, ISL_MAP_DISJOINT
);
5427 for (i
= 0; i
+ 1 < n
; ++i
)
5428 map
= isl_map_add_basic_map(map
,
5429 isl_basic_map_more_at(isl_space_copy(space
), i
));
5432 map
= isl_map_add_basic_map(map
,
5433 isl_basic_map_more_or_equal_at(space
, n
- 1));
5435 map
= isl_map_add_basic_map(map
,
5436 isl_basic_map_more_at(space
, n
- 1));
5438 isl_space_free(space
);
5443 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*space
, int equal
)
5447 return map_lex_gte_first(space
, space
->n_out
, equal
);
5450 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*space
,
5453 return map_lex_gte_first(space
, n
, 0);
5456 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*space
,
5459 return map_lex_gte_first(space
, n
, 1);
5462 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_space
)
5464 return map_lex_gte(isl_space_map_from_set(set_space
), 0);
5467 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_space
)
5469 return map_lex_gte(isl_space_map_from_set(set_space
), 1);
5472 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5473 __isl_take isl_set
*set2
)
5476 map
= isl_map_lex_le(isl_set_get_space(set1
));
5477 map
= isl_map_intersect_domain(map
, set1
);
5478 map
= isl_map_intersect_range(map
, set2
);
5482 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5483 __isl_take isl_set
*set2
)
5486 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5487 map
= isl_map_intersect_domain(map
, set1
);
5488 map
= isl_map_intersect_range(map
, set2
);
5492 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5493 __isl_take isl_set
*set2
)
5496 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5497 map
= isl_map_intersect_domain(map
, set1
);
5498 map
= isl_map_intersect_range(map
, set2
);
5502 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5503 __isl_take isl_set
*set2
)
5506 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5507 map
= isl_map_intersect_domain(map
, set1
);
5508 map
= isl_map_intersect_range(map
, set2
);
5512 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5513 __isl_take isl_map
*map2
)
5516 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5517 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5518 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5522 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5523 __isl_take isl_map
*map2
)
5526 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5527 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5528 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5532 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5533 __isl_take isl_map
*map2
)
5536 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5537 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5538 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5542 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5543 __isl_take isl_map
*map2
)
5546 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5547 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5548 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5552 /* For the div d = floor(f/m) at position "div", add the constraint
5556 static __isl_give isl_basic_map
*add_upper_div_constraint(
5557 __isl_take isl_basic_map
*bmap
, unsigned div
)
5560 isl_size v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
5564 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5565 if (v_div
< 0 || n_div
< 0)
5566 return isl_basic_map_free(bmap
);
5568 i
= isl_basic_map_alloc_inequality(bmap
);
5570 return isl_basic_map_free(bmap
);
5571 isl_seq_cpy(bmap
->ineq
[i
], bmap
->div
[div
] + 1, 1 + v_div
+ n_div
);
5572 isl_int_neg(bmap
->ineq
[i
][1 + pos
], bmap
->div
[div
][0]);
5577 /* For the div d = floor(f/m) at position "div", add the constraint
5579 * -(f-(m-1)) + m d >= 0
5581 static __isl_give isl_basic_map
*add_lower_div_constraint(
5582 __isl_take isl_basic_map
*bmap
, unsigned div
)
5585 isl_size v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
5589 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5590 if (v_div
< 0 || n_div
< 0)
5591 return isl_basic_map_free(bmap
);
5593 i
= isl_basic_map_alloc_inequality(bmap
);
5595 return isl_basic_map_free(bmap
);
5596 isl_seq_neg(bmap
->ineq
[i
], bmap
->div
[div
] + 1, 1 + v_div
+ n_div
);
5597 isl_int_set(bmap
->ineq
[i
][1 + pos
], bmap
->div
[div
][0]);
5598 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5599 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5604 /* For the div d = floor(f/m) at position "pos", add the constraints
5607 * -(f-(m-1)) + m d >= 0
5609 * Note that the second constraint is the negation of
5613 __isl_give isl_basic_map
*isl_basic_map_add_div_constraints(
5614 __isl_take isl_basic_map
*bmap
, unsigned pos
)
5616 bmap
= add_upper_div_constraint(bmap
, pos
);
5617 bmap
= add_lower_div_constraint(bmap
, pos
);
5621 /* For each known div d = floor(f/m), add the constraints
5624 * -(f-(m-1)) + m d >= 0
5626 * Remove duplicate constraints in case of some these div constraints
5627 * already appear in "bmap".
5629 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5630 __isl_take isl_basic_map
*bmap
)
5634 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5636 return isl_basic_map_free(bmap
);
5640 bmap
= add_known_div_constraints(bmap
);
5641 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5642 bmap
= isl_basic_map_finalize(bmap
);
5646 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5648 * In particular, if this div is of the form d = floor(f/m),
5649 * then add the constraint
5653 * if sign < 0 or the constraint
5655 * -(f-(m-1)) + m d >= 0
5659 __isl_give isl_basic_map
*isl_basic_map_add_div_constraint(
5660 __isl_take isl_basic_map
*bmap
, unsigned div
, int sign
)
5663 return add_upper_div_constraint(bmap
, div
);
5665 return add_lower_div_constraint(bmap
, div
);
5668 __isl_give isl_basic_set
*isl_basic_map_underlying_set(
5669 __isl_take isl_basic_map
*bmap
)
5675 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5677 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5678 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5679 return bset_from_bmap(bmap
);
5680 bmap
= isl_basic_map_cow(bmap
);
5683 space
= isl_basic_map_take_space(bmap
);
5684 space
= isl_space_underlying(space
, bmap
->n_div
);
5685 bmap
= isl_basic_map_restore_space(bmap
, space
);
5688 bmap
->extra
-= bmap
->n_div
;
5690 bmap
= isl_basic_map_finalize(bmap
);
5691 return bset_from_bmap(bmap
);
5693 isl_basic_map_free(bmap
);
5697 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5698 __isl_take isl_basic_set
*bset
)
5700 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5703 /* Replace each element in "list" by the result of applying
5704 * isl_basic_map_underlying_set to the element.
5706 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5707 __isl_take isl_basic_map_list
*list
)
5712 n
= isl_basic_map_list_n_basic_map(list
);
5716 for (i
= 0; i
< n
; ++i
) {
5717 isl_basic_map
*bmap
;
5718 isl_basic_set
*bset
;
5720 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5721 bset
= isl_basic_set_underlying_set(bmap
);
5722 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5727 isl_basic_map_list_free(list
);
5731 __isl_give isl_basic_map
*isl_basic_map_overlying_set(
5732 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_map
*like
)
5734 struct isl_basic_map
*bmap
;
5735 struct isl_ctx
*ctx
;
5736 isl_size dim
, bmap_total
;
5743 if (isl_basic_set_check_no_params(bset
) < 0 ||
5744 isl_basic_set_check_no_locals(bset
) < 0)
5746 dim
= isl_basic_set_dim(bset
, isl_dim_set
);
5747 bmap_total
= isl_basic_map_dim(like
, isl_dim_all
);
5748 if (dim
< 0 || bmap_total
< 0)
5750 isl_assert(ctx
, dim
== bmap_total
, goto error
);
5751 if (like
->n_div
== 0) {
5752 isl_space
*space
= isl_basic_map_get_space(like
);
5753 isl_basic_map_free(like
);
5754 return isl_basic_map_reset_space(bset
, space
);
5756 bset
= isl_basic_set_cow(bset
);
5759 total
= dim
+ bset
->extra
;
5760 bmap
= bset_to_bmap(bset
);
5761 isl_space_free(isl_basic_map_take_space(bmap
));
5762 bmap
= isl_basic_map_restore_space(bmap
, isl_basic_map_get_space(like
));
5765 bmap
->n_div
= like
->n_div
;
5766 bmap
->extra
+= like
->n_div
;
5770 ltotal
= total
- bmap
->extra
+ like
->extra
;
5773 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5774 bmap
->extra
* (1 + 1 + total
));
5775 if (isl_blk_is_error(bmap
->block2
))
5777 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5781 for (i
= 0; i
< bmap
->extra
; ++i
)
5782 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5783 for (i
= 0; i
< like
->n_div
; ++i
) {
5784 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5785 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5787 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5789 isl_basic_map_free(like
);
5790 bmap
= isl_basic_map_simplify(bmap
);
5791 bmap
= isl_basic_map_finalize(bmap
);
5794 isl_basic_map_free(like
);
5795 isl_basic_set_free(bset
);
5799 __isl_give isl_basic_set
*isl_basic_set_from_underlying_set(
5800 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*like
)
5802 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5803 bset_to_bmap(like
)));
5806 __isl_give isl_set
*isl_map_underlying_set(__isl_take isl_map
*map
)
5810 map
= isl_map_cow(map
);
5813 map
->dim
= isl_space_cow(map
->dim
);
5817 for (i
= 1; i
< map
->n
; ++i
)
5818 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5820 for (i
= 0; i
< map
->n
; ++i
) {
5821 map
->p
[i
] = bset_to_bmap(
5822 isl_basic_map_underlying_set(map
->p
[i
]));
5827 map
->dim
= isl_space_underlying(map
->dim
, 0);
5829 isl_space_free(map
->dim
);
5830 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5834 return set_from_map(map
);
5840 /* Replace the space of "bmap" by "space".
5842 * If the space of "bmap" is identical to "space" (including the identifiers
5843 * of the input and output dimensions), then simply return the original input.
5845 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5846 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5849 isl_space
*bmap_space
;
5851 bmap_space
= isl_basic_map_peek_space(bmap
);
5852 equal
= isl_space_is_equal(bmap_space
, space
);
5853 if (equal
>= 0 && equal
)
5854 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5858 isl_space_free(space
);
5861 isl_space_free(isl_basic_map_take_space(bmap
));
5862 bmap
= isl_basic_map_restore_space(bmap
, space
);
5864 bmap
= isl_basic_map_finalize(bmap
);
5868 isl_basic_map_free(bmap
);
5869 isl_space_free(space
);
5873 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5874 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*space
)
5876 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5880 /* Check that the total dimensions of "map" and "space" are the same.
5882 static isl_stat
check_map_space_equal_total_dim(__isl_keep isl_map
*map
,
5883 __isl_keep isl_space
*space
)
5885 isl_size dim1
, dim2
;
5887 dim1
= isl_map_dim(map
, isl_dim_all
);
5888 dim2
= isl_space_dim(space
, isl_dim_all
);
5889 if (dim1
< 0 || dim2
< 0)
5890 return isl_stat_error
;
5893 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5894 "total dimensions do not match", return isl_stat_error
);
5897 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5898 __isl_take isl_space
*space
)
5902 map
= isl_map_cow(map
);
5906 for (i
= 0; i
< map
->n
; ++i
) {
5907 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5908 isl_space_copy(space
));
5912 isl_space_free(isl_map_take_space(map
));
5913 map
= isl_map_restore_space(map
, space
);
5918 isl_space_free(space
);
5922 /* Replace the space of "map" by "space", without modifying
5923 * the dimension of "map".
5925 * If the space of "map" is identical to "space" (including the identifiers
5926 * of the input and output dimensions), then simply return the original input.
5928 __isl_give isl_map
*isl_map_reset_equal_dim_space(__isl_take isl_map
*map
,
5929 __isl_take isl_space
*space
)
5932 isl_space
*map_space
;
5934 map_space
= isl_map_peek_space(map
);
5935 equal
= isl_space_is_equal(map_space
, space
);
5936 if (equal
>= 0 && equal
)
5937 equal
= isl_space_has_equal_ids(map_space
, space
);
5941 isl_space_free(space
);
5944 if (check_map_space_equal_total_dim(map
, space
) < 0)
5946 return isl_map_reset_space(map
, space
);
5949 isl_space_free(space
);
5953 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5954 __isl_take isl_space
*space
)
5956 return set_from_map(isl_map_reset_space(set_to_map(set
), space
));
5959 /* Compute the parameter domain of the given basic set.
5961 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5967 is_params
= isl_basic_set_is_params(bset
);
5969 return isl_basic_set_free(bset
);
5973 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5975 return isl_basic_set_free(bset
);
5976 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5977 space
= isl_basic_set_get_space(bset
);
5978 space
= isl_space_params(space
);
5979 bset
= isl_basic_set_reset_space(bset
, space
);
5983 /* Construct a zero-dimensional basic set with the given parameter domain.
5985 __isl_give isl_basic_set
*isl_basic_set_from_params(
5986 __isl_take isl_basic_set
*bset
)
5989 space
= isl_basic_set_get_space(bset
);
5990 space
= isl_space_set_from_params(space
);
5991 bset
= isl_basic_set_reset_space(bset
, space
);
5995 /* Compute the parameter domain of the given set.
5997 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5999 return isl_map_params(set_to_map(set
));
6002 /* Construct a zero-dimensional set with the given parameter domain.
6004 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
6007 space
= isl_set_get_space(set
);
6008 space
= isl_space_set_from_params(space
);
6009 set
= isl_set_reset_space(set
, space
);
6013 /* Compute the parameter domain of the given map.
6015 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
6018 isl_size n_in
, n_out
;
6020 n_in
= isl_map_dim(map
, isl_dim_in
);
6021 n_out
= isl_map_dim(map
, isl_dim_out
);
6022 if (n_in
< 0 || n_out
< 0)
6023 return isl_map_free(map
);
6024 map
= isl_map_project_out(map
, isl_dim_in
, 0, n_in
);
6025 map
= isl_map_project_out(map
, isl_dim_out
, 0, n_out
);
6026 space
= isl_map_get_space(map
);
6027 space
= isl_space_params(space
);
6028 map
= isl_map_reset_space(map
, space
);
6032 __isl_give isl_basic_set
*isl_basic_map_domain(__isl_take isl_basic_map
*bmap
)
6037 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6039 return isl_basic_map_free(bmap
);
6040 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
6042 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
6044 return isl_basic_map_reset_space(bmap
, space
);
6047 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
6050 return isl_bool_error
;
6051 return isl_space_may_be_set(bmap
->dim
);
6054 /* Is this basic map actually a set?
6055 * Users should never call this function. Outside of isl,
6056 * the type should indicate whether something is a set or a map.
6058 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
6061 return isl_bool_error
;
6062 return isl_space_is_set(bmap
->dim
);
6065 __isl_give isl_basic_set
*isl_basic_map_range(__isl_take isl_basic_map
*bmap
)
6069 is_set
= isl_basic_map_is_set(bmap
);
6074 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
6076 isl_basic_map_free(bmap
);
6080 __isl_give isl_basic_map
*isl_basic_map_domain_map(
6081 __isl_take isl_basic_map
*bmap
)
6085 isl_basic_map
*domain
;
6086 isl_size nparam
, n_in
, n_out
;
6088 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6089 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6090 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6091 if (nparam
< 0 || n_in
< 0 || n_out
< 0)
6092 return isl_basic_map_free(bmap
);
6094 space
= isl_basic_map_get_space(bmap
);
6095 space
= isl_space_from_range(isl_space_domain(space
));
6096 domain
= isl_basic_map_universe(space
);
6098 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6099 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6100 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
6102 for (i
= 0; i
< n_in
; ++i
)
6103 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
6106 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6107 return isl_basic_map_finalize(bmap
);
6110 __isl_give isl_basic_map
*isl_basic_map_range_map(
6111 __isl_take isl_basic_map
*bmap
)
6115 isl_basic_map
*range
;
6116 isl_size nparam
, n_in
, n_out
;
6118 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6119 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6120 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6121 if (nparam
< 0 || n_in
< 0 || n_out
< 0)
6122 return isl_basic_map_free(bmap
);
6124 space
= isl_basic_map_get_space(bmap
);
6125 space
= isl_space_from_range(isl_space_range(space
));
6126 range
= isl_basic_map_universe(space
);
6128 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6129 bmap
= isl_basic_map_apply_range(bmap
, range
);
6130 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
6132 for (i
= 0; i
< n_out
; ++i
)
6133 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
6136 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6137 return isl_basic_map_finalize(bmap
);
6140 int isl_map_may_be_set(__isl_keep isl_map
*map
)
6144 return isl_space_may_be_set(map
->dim
);
6147 /* Is this map actually a set?
6148 * Users should never call this function. Outside of isl,
6149 * the type should indicate whether something is a set or a map.
6151 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
6154 return isl_bool_error
;
6155 return isl_space_is_set(map
->dim
);
6158 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
6163 n_in
= isl_map_dim(map
, isl_dim_in
);
6165 return set_from_map(isl_map_free(map
));
6166 space
= isl_space_range(isl_map_get_space(map
));
6168 map
= isl_map_project_out(map
, isl_dim_in
, 0, n_in
);
6170 return set_from_map(isl_map_reset_space(map
, space
));
6173 /* Transform "map" by applying "fn_space" to its space and "fn_bmap"
6174 * to each of its basic maps.
6176 static __isl_give isl_map
*isl_map_transform(__isl_take isl_map
*map
,
6177 __isl_give isl_space
*(*fn_space
)(__isl_take isl_space
*space
),
6178 __isl_give isl_basic_map
*(*fn_bmap
)(__isl_take isl_basic_map
*bmap
))
6183 map
= isl_map_cow(map
);
6187 for (i
= 0; i
< map
->n
; ++i
) {
6188 map
->p
[i
] = fn_bmap(map
->p
[i
]);
6190 return isl_map_free(map
);
6192 map
= isl_map_unmark_normalized(map
);
6194 space
= isl_map_take_space(map
);
6195 space
= fn_space(space
);
6196 map
= isl_map_restore_space(map
, space
);
6201 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
6203 return isl_map_transform(map
, &isl_space_domain_map
,
6204 &isl_basic_map_domain_map
);
6207 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
6209 return isl_map_transform(map
, &isl_space_range_map
,
6210 &isl_basic_map_range_map
);
6213 /* Given a wrapped map of the form A[B -> C],
6214 * return the map A[B -> C] -> B.
6216 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
6223 if (!isl_set_has_tuple_id(set
))
6224 return isl_map_domain_map(isl_set_unwrap(set
));
6226 id
= isl_set_get_tuple_id(set
);
6227 map
= isl_map_domain_map(isl_set_unwrap(set
));
6228 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
6233 __isl_give isl_basic_map
*isl_basic_map_from_domain(
6234 __isl_take isl_basic_set
*bset
)
6236 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
6239 __isl_give isl_basic_map
*isl_basic_map_from_range(
6240 __isl_take isl_basic_set
*bset
)
6243 space
= isl_basic_set_get_space(bset
);
6244 space
= isl_space_from_range(space
);
6245 bset
= isl_basic_set_reset_space(bset
, space
);
6246 return bset_to_bmap(bset
);
6249 /* Create a relation with the given set as range.
6250 * The domain of the created relation is a zero-dimensional
6251 * flat anonymous space.
6253 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
6256 space
= isl_set_get_space(set
);
6257 space
= isl_space_from_range(space
);
6258 set
= isl_set_reset_space(set
, space
);
6259 return set_to_map(set
);
6262 /* Create a relation with the given set as domain.
6263 * The range of the created relation is a zero-dimensional
6264 * flat anonymous space.
6266 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
6268 return isl_map_reverse(isl_map_from_range(set
));
6271 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
6272 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
6274 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
6277 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
6278 __isl_take isl_set
*range
)
6280 return isl_map_apply_range(isl_map_reverse(domain
), range
);
6283 /* Return a newly allocated isl_map with given space and flags and
6284 * room for "n" basic maps.
6285 * Make sure that all cached information is cleared.
6287 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
6290 struct isl_map
*map
;
6295 isl_die(space
->ctx
, isl_error_internal
,
6296 "negative number of basic maps", goto error
);
6297 map
= isl_calloc(space
->ctx
, struct isl_map
,
6298 sizeof(struct isl_map
) +
6299 (n
- 1) * sizeof(struct isl_basic_map
*));
6303 map
->ctx
= space
->ctx
;
6304 isl_ctx_ref(map
->ctx
);
6312 isl_space_free(space
);
6316 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*space
)
6318 struct isl_basic_map
*bmap
;
6319 bmap
= isl_basic_map_alloc_space(space
, 0, 1, 0);
6320 bmap
= isl_basic_map_set_to_empty(bmap
);
6324 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*space
)
6326 struct isl_basic_set
*bset
;
6327 bset
= isl_basic_set_alloc_space(space
, 0, 1, 0);
6328 bset
= isl_basic_set_set_to_empty(bset
);
6332 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*space
)
6334 struct isl_basic_map
*bmap
;
6335 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 0);
6336 bmap
= isl_basic_map_finalize(bmap
);
6340 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*space
)
6342 struct isl_basic_set
*bset
;
6343 bset
= isl_basic_set_alloc_space(space
, 0, 0, 0);
6344 bset
= isl_basic_set_finalize(bset
);
6348 __isl_give isl_basic_map
*isl_basic_map_nat_universe(
6349 __isl_take isl_space
*space
)
6352 isl_size total
= isl_space_dim(space
, isl_dim_all
);
6353 isl_basic_map
*bmap
;
6356 space
= isl_space_free(space
);
6357 bmap
= isl_basic_map_alloc_space(space
, 0, 0, total
);
6358 for (i
= 0; i
< total
; ++i
) {
6359 int k
= isl_basic_map_alloc_inequality(bmap
);
6362 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
6363 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
6367 isl_basic_map_free(bmap
);
6371 __isl_give isl_basic_set
*isl_basic_set_nat_universe(
6372 __isl_take isl_space
*space
)
6374 return isl_basic_map_nat_universe(space
);
6377 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*space
)
6379 return isl_map_from_basic_map(isl_basic_map_nat_universe(space
));
6382 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*space
)
6384 return isl_map_nat_universe(space
);
6387 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*space
)
6389 return isl_map_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6392 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*space
)
6394 return isl_set_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6397 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*space
)
6399 struct isl_map
*map
;
6402 map
= isl_map_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6403 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(space
));
6407 /* This function performs the same operation as isl_map_universe,
6408 * but is considered as a function on an isl_space when exported.
6410 __isl_give isl_map
*isl_space_universe_map(__isl_take isl_space
*space
)
6412 return isl_map_universe(space
);
6415 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*space
)
6417 struct isl_set
*set
;
6420 set
= isl_set_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6421 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(space
));
6425 /* This function performs the same operation as isl_set_universe,
6426 * but is considered as a function on an isl_space when exported.
6428 __isl_give isl_set
*isl_space_universe_set(__isl_take isl_space
*space
)
6430 return isl_set_universe(space
);
6433 __isl_give isl_map
*isl_map_dup(__isl_keep isl_map
*map
)
6436 struct isl_map
*dup
;
6440 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6441 for (i
= 0; i
< map
->n
; ++i
)
6442 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6446 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6447 __isl_take isl_basic_map
*bmap
)
6451 if (isl_basic_map_plain_is_empty(bmap
)) {
6452 isl_basic_map_free(bmap
);
6455 if (isl_map_basic_map_check_equal_space(map
, bmap
) < 0)
6457 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6458 map
->p
[map
->n
] = bmap
;
6460 map
= isl_map_unmark_normalized(map
);
6466 isl_basic_map_free(bmap
);
6470 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6481 isl_ctx_deref(map
->ctx
);
6482 for (i
= 0; i
< map
->n
; ++i
)
6483 isl_basic_map_free(map
->p
[i
]);
6484 isl_space_free(map
->dim
);
6490 static __isl_give isl_basic_map
*isl_basic_map_fix_pos_si(
6491 __isl_take isl_basic_map
*bmap
, unsigned pos
, int value
)
6496 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
6498 return isl_basic_map_free(bmap
);
6500 bmap
= isl_basic_map_cow(bmap
);
6501 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6502 j
= isl_basic_map_alloc_equality(bmap
);
6505 isl_seq_clr(bmap
->eq
[j
] + 1, total
);
6506 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6507 isl_int_set_si(bmap
->eq
[j
][0], value
);
6508 bmap
= isl_basic_map_simplify(bmap
);
6509 return isl_basic_map_finalize(bmap
);
6511 isl_basic_map_free(bmap
);
6515 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6516 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6521 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
6523 return isl_basic_map_free(bmap
);
6525 bmap
= isl_basic_map_cow(bmap
);
6526 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6527 j
= isl_basic_map_alloc_equality(bmap
);
6530 isl_seq_clr(bmap
->eq
[j
] + 1, total
);
6531 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6532 isl_int_set(bmap
->eq
[j
][0], value
);
6533 bmap
= isl_basic_map_simplify(bmap
);
6534 return isl_basic_map_finalize(bmap
);
6536 isl_basic_map_free(bmap
);
6540 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6541 enum isl_dim_type type
, unsigned pos
, int value
)
6543 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6544 return isl_basic_map_free(bmap
);
6545 return isl_basic_map_fix_pos_si(bmap
,
6546 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6549 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6550 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6552 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6553 return isl_basic_map_free(bmap
);
6554 return isl_basic_map_fix_pos(bmap
,
6555 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6558 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6559 * to be equal to "v".
6561 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6562 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6566 if (!isl_val_is_int(v
))
6567 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6568 "expecting integer value", goto error
);
6569 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6571 pos
+= isl_basic_map_offset(bmap
, type
);
6572 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6576 isl_basic_map_free(bmap
);
6581 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6582 * to be equal to "v".
6584 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6585 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6587 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6590 __isl_give isl_basic_set
*isl_basic_set_fix_si(__isl_take isl_basic_set
*bset
,
6591 enum isl_dim_type type
, unsigned pos
, int value
)
6593 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6597 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6598 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6600 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6604 /* Remove the basic map at position "i" from "map" if this basic map
6605 * is (obviously) empty.
6607 static __isl_give isl_map
*remove_if_empty(__isl_take isl_map
*map
, int i
)
6614 empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6616 return isl_map_free(map
);
6620 isl_basic_map_free(map
->p
[i
]);
6623 map
->p
[i
] = map
->p
[map
->n
];
6624 map
= isl_map_unmark_normalized(map
);
6631 /* Perform "fn" on each basic map of "map", where we may not be holding
6632 * the only reference to "map".
6633 * In particular, "fn" should be a semantics preserving operation
6634 * that we want to apply to all copies of "map". We therefore need
6635 * to be careful not to modify "map" in a way that breaks "map"
6636 * in case anything goes wrong.
6638 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6639 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6641 struct isl_basic_map
*bmap
;
6647 for (i
= map
->n
- 1; i
>= 0; --i
) {
6648 bmap
= isl_basic_map_copy(map
->p
[i
]);
6652 isl_basic_map_free(map
->p
[i
]);
6654 map
= remove_if_empty(map
, i
);
6665 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6666 enum isl_dim_type type
, unsigned pos
, int value
)
6670 map
= isl_map_cow(map
);
6671 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6672 return isl_map_free(map
);
6673 for (i
= map
->n
- 1; i
>= 0; --i
) {
6674 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6675 map
= remove_if_empty(map
, i
);
6679 map
= isl_map_unmark_normalized(map
);
6683 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6684 enum isl_dim_type type
, unsigned pos
, int value
)
6686 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6689 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6690 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6694 map
= isl_map_cow(map
);
6695 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6696 return isl_map_free(map
);
6697 for (i
= 0; i
< map
->n
; ++i
) {
6698 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6702 map
= isl_map_unmark_normalized(map
);
6709 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6710 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6712 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6715 /* Fix the value of the variable at position "pos" of type "type" of "map"
6716 * to be equal to "v".
6718 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6719 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6723 map
= isl_map_cow(map
);
6727 if (!isl_val_is_int(v
))
6728 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6729 "expecting integer value", goto error
);
6730 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6732 for (i
= map
->n
- 1; i
>= 0; --i
) {
6733 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6735 map
= remove_if_empty(map
, i
);
6739 map
= isl_map_unmark_normalized(map
);
6748 /* Fix the value of the variable at position "pos" of type "type" of "set"
6749 * to be equal to "v".
6751 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6752 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6754 return isl_map_fix_val(set
, type
, pos
, v
);
6757 __isl_give isl_map
*isl_map_fix_input_si(__isl_take isl_map
*map
,
6758 unsigned input
, int value
)
6760 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6763 __isl_give isl_set
*isl_set_fix_dim_si(__isl_take isl_set
*set
, unsigned dim
,
6766 return set_from_map(isl_map_fix_si(set_to_map(set
),
6767 isl_dim_set
, dim
, value
));
6770 static __isl_give isl_basic_map
*basic_map_bound_si(
6771 __isl_take isl_basic_map
*bmap
,
6772 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6777 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6778 return isl_basic_map_free(bmap
);
6779 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
6781 return isl_basic_map_free(bmap
);
6782 pos
+= isl_basic_map_offset(bmap
, type
);
6783 bmap
= isl_basic_map_cow(bmap
);
6784 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6785 j
= isl_basic_map_alloc_inequality(bmap
);
6788 isl_seq_clr(bmap
->ineq
[j
], 1 + total
);
6790 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6791 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6793 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6794 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6796 bmap
= isl_basic_map_simplify(bmap
);
6797 return isl_basic_map_finalize(bmap
);
6799 isl_basic_map_free(bmap
);
6803 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6804 __isl_take isl_basic_map
*bmap
,
6805 enum isl_dim_type type
, unsigned pos
, int value
)
6807 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6810 /* Constrain the values of the given dimension to be no greater than "value".
6812 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6813 __isl_take isl_basic_map
*bmap
,
6814 enum isl_dim_type type
, unsigned pos
, int value
)
6816 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6819 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6820 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6824 map
= isl_map_cow(map
);
6825 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6826 return isl_map_free(map
);
6827 for (i
= 0; i
< map
->n
; ++i
) {
6828 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6829 type
, pos
, value
, upper
);
6833 map
= isl_map_unmark_normalized(map
);
6840 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6841 enum isl_dim_type type
, unsigned pos
, int value
)
6843 return map_bound_si(map
, type
, pos
, value
, 0);
6846 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6847 enum isl_dim_type type
, unsigned pos
, int value
)
6849 return map_bound_si(map
, type
, pos
, value
, 1);
6852 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6853 enum isl_dim_type type
, unsigned pos
, int value
)
6855 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6859 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6860 enum isl_dim_type type
, unsigned pos
, int value
)
6862 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6865 /* Bound the given variable of "bmap" from below (or above is "upper"
6866 * is set) to "value".
6868 static __isl_give isl_basic_map
*basic_map_bound(
6869 __isl_take isl_basic_map
*bmap
,
6870 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6875 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6876 return isl_basic_map_free(bmap
);
6877 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
6879 return isl_basic_map_free(bmap
);
6880 pos
+= isl_basic_map_offset(bmap
, type
);
6881 bmap
= isl_basic_map_cow(bmap
);
6882 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6883 j
= isl_basic_map_alloc_inequality(bmap
);
6886 isl_seq_clr(bmap
->ineq
[j
], 1 + total
);
6888 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6889 isl_int_set(bmap
->ineq
[j
][0], value
);
6891 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6892 isl_int_neg(bmap
->ineq
[j
][0], value
);
6894 bmap
= isl_basic_map_simplify(bmap
);
6895 return isl_basic_map_finalize(bmap
);
6897 isl_basic_map_free(bmap
);
6901 /* Bound the given variable of "map" from below (or above is "upper"
6902 * is set) to "value".
6904 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6905 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6909 map
= isl_map_cow(map
);
6910 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6911 return isl_map_free(map
);
6912 for (i
= map
->n
- 1; i
>= 0; --i
) {
6913 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6914 map
= remove_if_empty(map
, i
);
6918 map
= isl_map_unmark_normalized(map
);
6922 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6923 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6925 return map_bound(map
, type
, pos
, value
, 0);
6928 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6929 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6931 return map_bound(map
, type
, pos
, value
, 1);
6934 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6935 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6937 return isl_map_lower_bound(set
, type
, pos
, value
);
6940 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6941 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6943 return isl_map_upper_bound(set
, type
, pos
, value
);
6946 /* Force the values of the variable at position "pos" of type "type" of "map"
6947 * to be no smaller than "value".
6949 __isl_give isl_map
*isl_map_lower_bound_val(__isl_take isl_map
*map
,
6950 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6954 if (!isl_val_is_int(value
))
6955 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6956 "expecting integer value", goto error
);
6957 map
= isl_map_lower_bound(map
, type
, pos
, value
->n
);
6958 isl_val_free(value
);
6961 isl_val_free(value
);
6966 /* Force the values of the variable at position "pos" of type "type" of "set"
6967 * to be no smaller than "value".
6969 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6970 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6974 map
= set_to_map(set
);
6975 return set_from_map(isl_map_lower_bound_val(map
, type
, pos
, value
));
6978 /* Force the values of the variable at position "pos" of type "type" of "map"
6979 * to be no greater than "value".
6981 __isl_give isl_map
*isl_map_upper_bound_val(__isl_take isl_map
*map
,
6982 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6986 if (!isl_val_is_int(value
))
6987 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6988 "expecting integer value", goto error
);
6989 map
= isl_map_upper_bound(map
, type
, pos
, value
->n
);
6990 isl_val_free(value
);
6993 isl_val_free(value
);
6998 /* Force the values of the variable at position "pos" of type "type" of "set"
6999 * to be no greater than "value".
7001 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
7002 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
7006 map
= set_to_map(set
);
7007 return set_from_map(isl_map_upper_bound_val(map
, type
, pos
, value
));
7010 /* If "mv" has an explicit domain, then intersect the domain of "map"
7011 * with this explicit domain.
7013 * An isl_multi_val object never has an explicit domain,
7014 * so simply return "map".
7016 static __isl_give isl_map
*isl_map_intersect_multi_val_explicit_domain(
7017 __isl_take isl_map
*map
, __isl_keep isl_multi_val
*mv
)
7024 #include "isl_map_bound_templ.c"
7026 /* Apply "map_bound" to "set" with the corresponding value in "bound"
7027 * for each set dimension, by treating the set as a map.
7029 static __isl_give isl_set
*set_bound_multi_val(__isl_take isl_set
*set
,
7030 __isl_take isl_multi_val
*bound
,
7031 __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
7032 unsigned pos
, __isl_take isl_val
*value
))
7036 map
= set_to_map(set
);
7037 return set_from_map(map_bound_multi_val(map
, bound
, map_bound
));
7042 #include "isl_map_bound_templ.c"
7044 /* Apply "map_bound" to "set" with the corresponding value in "bound"
7045 * for each set dimension, by converting the set and the bound
7046 * to objects living in a map space.
7048 static __isl_give isl_set
*set_bound_multi_pw_aff(__isl_take isl_set
*set
,
7049 __isl_take isl_multi_pw_aff
*bound
,
7050 __isl_give isl_map
*set_bound(__isl_take isl_map
*map
,
7051 unsigned pos
, __isl_take TYPE
*value
))
7055 map
= isl_map_from_range(set
);
7056 bound
= isl_multi_pw_aff_from_range(bound
);
7057 map
= map_bound_multi_pw_aff(map
, bound
, set_bound
);
7058 return isl_map_range(map
);
7061 /* Wrapper around isl_map_lower_bound_val for use in map_bound_multi_val,
7062 * setting a bound on the given output dimension.
7064 static __isl_give isl_map
*map_lower_bound_val(__isl_take isl_map
*map
,
7065 unsigned pos
, __isl_take isl_val
*v
)
7067 return isl_map_lower_bound_val(map
, isl_dim_out
, pos
, v
);
7070 /* Force the values of the set dimensions of "set"
7071 * to be no smaller than the corresponding values in "lower".
7073 __isl_give isl_set
*isl_set_lower_bound_multi_val(__isl_take isl_set
*set
,
7074 __isl_take isl_multi_val
*lower
)
7076 return set_bound_multi_val(set
, lower
, &map_lower_bound_val
);
7079 /* Wrapper around isl_map_upper_bound_val for use in map_bound_multi_val,
7080 * setting a bound on the given output dimension.
7082 static __isl_give isl_map
*map_upper_bound_val(__isl_take isl_map
*map
,
7083 unsigned pos
, __isl_take isl_val
*v
)
7085 return isl_map_upper_bound_val(map
, isl_dim_out
, pos
, v
);
7088 /* Force the values of the set dimensions of "set"
7089 * to be no greater than the corresponding values in "upper".
7091 __isl_give isl_set
*isl_set_upper_bound_multi_val(__isl_take isl_set
*set
,
7092 __isl_take isl_multi_val
*upper
)
7094 return set_bound_multi_val(set
, upper
, &map_upper_bound_val
);
7097 /* Force the symbolic constant expression "bound"
7098 * to satisfy the relation "order" with respect to
7099 * the output variable at position "pos" of "map".
7101 * Create an affine expression representing the output variable
7102 * in terms of the range and
7103 * compare it using "order" to "bound" (defined on the domain).
7104 * The result is a relation between elements in domain and range that
7105 * can be intersected with "map".
7107 static __isl_give isl_map
*map_bound_pw_aff(__isl_take isl_map
*map
,
7108 unsigned pos
, __isl_take isl_pw_aff
*bound
,
7109 __isl_give isl_map
*(*order
)(__isl_take isl_pw_aff
*pa1
,
7110 __isl_take isl_pw_aff
*pa2
))
7113 isl_local_space
*ls
;
7116 space
= isl_space_range(isl_map_get_space(map
));
7117 ls
= isl_local_space_from_space(space
);
7118 var
= isl_pw_aff_var_on_domain(ls
, isl_dim_set
, pos
);
7119 map
= isl_map_intersect(map
, order(bound
, var
));
7123 /* Force the values of the output variable at position "pos" of "map"
7124 * to be no smaller than the symbolic constant expression "lower".
7126 static __isl_give isl_map
*map_lower_bound_pw_aff(__isl_take isl_map
*map
,
7127 unsigned pos
, __isl_take isl_pw_aff
*lower
)
7129 return map_bound_pw_aff(map
, pos
, lower
, &isl_pw_aff_le_map
);
7132 /* Force the values of the output variable at position "pos" of "map"
7133 * to be no greater than the symbolic constant expression "upper".
7135 static __isl_give isl_map
*map_upper_bound_pw_aff(__isl_take isl_map
*map
,
7136 unsigned pos
, __isl_take isl_pw_aff
*upper
)
7138 return map_bound_pw_aff(map
, pos
, upper
, &isl_pw_aff_ge_map
);
7141 /* Force the values of the set dimensions of "set"
7142 * to be no smaller than the corresponding constant symbolic expressions
7145 __isl_give isl_set
*isl_set_lower_bound_multi_pw_aff(__isl_take isl_set
*set
,
7146 __isl_take isl_multi_pw_aff
*lower
)
7148 return set_bound_multi_pw_aff(set
, lower
, &map_lower_bound_pw_aff
);
7151 /* Force the values of the set dimensions of "set"
7152 * to be no greater than the corresponding constant symbolic expressions
7155 __isl_give isl_set
*isl_set_upper_bound_multi_pw_aff(__isl_take isl_set
*set
,
7156 __isl_take isl_multi_pw_aff
*upper
)
7158 return set_bound_multi_pw_aff(set
, upper
, &map_upper_bound_pw_aff
);
7161 /* Force the values of the output dimensions of "map"
7162 * to be no smaller than the corresponding constant symbolic expressions
7165 __isl_give isl_map
*isl_map_lower_bound_multi_pw_aff(__isl_take isl_map
*map
,
7166 __isl_take isl_multi_pw_aff
*lower
)
7168 return map_bound_multi_pw_aff(map
, lower
, &map_lower_bound_pw_aff
);
7171 /* Force the values of the output dimensions of "map"
7172 * to be no greater than the corresponding constant symbolic expressions
7175 __isl_give isl_map
*isl_map_upper_bound_multi_pw_aff(__isl_take isl_map
*map
,
7176 __isl_take isl_multi_pw_aff
*upper
)
7178 return map_bound_multi_pw_aff(map
, upper
, &map_upper_bound_pw_aff
);
7181 /* Bound the given variable of "bset" from below (or above is "upper"
7182 * is set) to "value".
7184 static __isl_give isl_basic_set
*isl_basic_set_bound(
7185 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
7186 isl_int value
, int upper
)
7188 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
7189 type
, pos
, value
, upper
));
7192 /* Bound the given variable of "bset" from below (or above is "upper"
7193 * is set) to "value".
7195 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
7196 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
7197 __isl_take isl_val
*value
, int upper
)
7201 if (!isl_val_is_int(value
))
7202 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
7203 "expecting integer value", goto error
);
7204 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
7205 isl_val_free(value
);
7208 isl_val_free(value
);
7209 isl_basic_set_free(bset
);
7213 /* Bound the given variable of "bset" from below to "value".
7215 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
7216 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
7217 __isl_take isl_val
*value
)
7219 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
7222 /* Bound the given variable of "bset" from above to "value".
7224 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
7225 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
7226 __isl_take isl_val
*value
)
7228 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
7231 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
7233 return isl_map_transform(map
, &isl_space_reverse
,
7234 &isl_basic_map_reverse
);
7237 /* Given a map (A -> B) -> C, return the corresponding map (B -> A) -> C.
7239 __isl_give isl_map
*isl_map_domain_reverse(__isl_take isl_map
*map
)
7241 return isl_map_transform(map
, &isl_space_domain_reverse
,
7242 &isl_basic_map_domain_reverse
);
7245 /* Given a map A -> (B -> C), return the corresponding map A -> (C -> B).
7247 __isl_give isl_map
*isl_map_range_reverse(__isl_take isl_map
*map
)
7249 return isl_map_transform(map
, &isl_space_range_reverse
,
7250 &isl_basic_map_range_reverse
);
7253 /* Given a set (A -> B), return the corresponding set (B -> A).
7255 __isl_give isl_set
*isl_set_wrapped_reverse(__isl_take isl_set
*set
)
7257 isl_map
*map
= set_to_map(set
);
7259 map
= isl_map_transform(map
, &isl_space_wrapped_reverse
,
7260 &isl_basic_map_set_reverse
);
7261 return set_from_map(map
);
7265 #define TYPE isl_pw_multi_aff
7267 #define SUFFIX _pw_multi_aff
7269 #define EMPTY isl_pw_multi_aff_empty
7271 #define ADD isl_pw_multi_aff_union_add
7272 #include "isl_map_lexopt_templ.c"
7274 /* Given a map "map", compute the lexicographically minimal
7275 * (or maximal) image element for each domain element in dom,
7276 * in the form of an isl_pw_multi_aff.
7277 * If "empty" is not NULL, then set *empty to those elements in dom that
7278 * do not have an image element.
7279 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
7280 * should be computed over the domain of "map". "empty" is also NULL
7283 * We first compute the lexicographically minimal or maximal element
7284 * in the first basic map. This results in a partial solution "res"
7285 * and a subset "todo" of dom that still need to be handled.
7286 * We then consider each of the remaining maps in "map" and successively
7287 * update both "res" and "todo".
7288 * If "empty" is NULL, then the todo sets are not needed and therefore
7289 * also not computed.
7291 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
7292 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
7293 __isl_give isl_set
**empty
, unsigned flags
)
7297 isl_pw_multi_aff
*res
;
7300 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
7301 if (!map
|| (!full
&& !dom
))
7304 if (isl_map_plain_is_empty(map
)) {
7309 return isl_pw_multi_aff_from_map(map
);
7312 res
= basic_map_partial_lexopt_pw_multi_aff(
7313 isl_basic_map_copy(map
->p
[0]),
7314 isl_set_copy(dom
), empty
, flags
);
7318 for (i
= 1; i
< map
->n
; ++i
) {
7319 isl_pw_multi_aff
*res_i
;
7321 res_i
= basic_map_partial_lexopt_pw_multi_aff(
7322 isl_basic_map_copy(map
->p
[i
]),
7323 isl_set_copy(dom
), empty
, flags
);
7325 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
7326 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
7328 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
7331 todo
= isl_set_intersect(todo
, *empty
);
7350 #define TYPE isl_map
7354 #define EMPTY isl_map_empty
7356 #define ADD isl_map_union_disjoint
7357 #include "isl_map_lexopt_templ.c"
7359 /* Given a map "map", compute the lexicographically minimal
7360 * (or maximal) image element for each domain element in "dom",
7361 * in the form of an isl_map.
7362 * If "empty" is not NULL, then set *empty to those elements in "dom" that
7363 * do not have an image element.
7364 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
7365 * should be computed over the domain of "map". "empty" is also NULL
7368 * If the input consists of more than one disjunct, then first
7369 * compute the desired result in the form of an isl_pw_multi_aff and
7370 * then convert that into an isl_map.
7372 * This function used to have an explicit implementation in terms
7373 * of isl_maps, but it would continually intersect the domains of
7374 * partial results with the complement of the domain of the next
7375 * partial solution, potentially leading to an explosion in the number
7376 * of disjuncts if there are several disjuncts in the input.
7377 * An even earlier implementation of this function would look for
7378 * better results in the domain of the partial result and for extra
7379 * results in the complement of this domain, which would lead to
7380 * even more splintering.
7382 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
7383 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
7384 __isl_give isl_set
**empty
, unsigned flags
)
7387 struct isl_map
*res
;
7388 isl_pw_multi_aff
*pma
;
7390 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
7391 if (!map
|| (!full
&& !dom
))
7394 if (isl_map_plain_is_empty(map
)) {
7403 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
7409 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
7411 return isl_map_from_pw_multi_aff_internal(pma
);
7420 __isl_give isl_map
*isl_map_partial_lexmax(
7421 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
7422 __isl_give isl_set
**empty
)
7424 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
7427 __isl_give isl_map
*isl_map_partial_lexmin(
7428 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
7429 __isl_give isl_set
**empty
)
7431 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
7434 __isl_give isl_set
*isl_set_partial_lexmin(
7435 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
7436 __isl_give isl_set
**empty
)
7438 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
7442 __isl_give isl_set
*isl_set_partial_lexmax(
7443 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
7444 __isl_give isl_set
**empty
)
7446 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
7450 /* Compute the lexicographic minimum (or maximum if "flags" includes
7451 * ISL_OPT_MAX) of "bset" over its parametric domain.
7453 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
7456 return isl_basic_map_lexopt(bset
, flags
);
7459 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
7461 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
7464 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
7466 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
7469 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
7471 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
7474 /* Compute the lexicographic minimum of "bset" over its parametric domain
7475 * for the purpose of quantifier elimination.
7476 * That is, find an explicit representation for all the existentially
7477 * quantified variables in "bset" by computing their lexicographic
7480 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
7481 __isl_take isl_basic_set
*bset
)
7483 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
7486 /* Given a basic map with one output dimension, compute the minimum or
7487 * maximum of that dimension as an isl_pw_aff.
7489 * Compute the optimum as a lexicographic optimum over the single
7490 * output dimension and extract the single isl_pw_aff from the result.
7492 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
7495 isl_pw_multi_aff
*pma
;
7498 bmap
= isl_basic_map_copy(bmap
);
7499 pma
= isl_basic_map_lexopt_pw_multi_aff(bmap
, max
? ISL_OPT_MAX
: 0);
7500 pwaff
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
7501 isl_pw_multi_aff_free(pma
);
7506 /* Compute the minimum or maximum of the given output dimension
7507 * as a function of the parameters and the input dimensions,
7508 * but independently of the other output dimensions.
7510 * We first project out the other output dimension and then compute
7511 * the "lexicographic" maximum in each basic map, combining the results
7512 * using isl_pw_aff_union_max.
7514 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
7521 n_out
= isl_map_dim(map
, isl_dim_out
);
7523 map
= isl_map_free(map
);
7524 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
7525 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
7530 isl_space
*space
= isl_map_get_space(map
);
7532 return isl_pw_aff_empty(space
);
7535 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
7536 for (i
= 1; i
< map
->n
; ++i
) {
7537 isl_pw_aff
*pwaff_i
;
7539 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
7540 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
7548 /* Compute the minimum of the given output dimension as a function of the
7549 * parameters and input dimensions, but independently of
7550 * the other output dimensions.
7552 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
7554 return map_dim_opt(map
, pos
, 0);
7557 /* Compute the maximum of the given output dimension as a function of the
7558 * parameters and input dimensions, but independently of
7559 * the other output dimensions.
7561 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
7563 return map_dim_opt(map
, pos
, 1);
7566 /* Compute the minimum or maximum of the given set dimension
7567 * as a function of the parameters,
7568 * but independently of the other set dimensions.
7570 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
7573 return map_dim_opt(set
, pos
, max
);
7576 /* Compute the maximum of the given set dimension as a function of the
7577 * parameters, but independently of the other set dimensions.
7579 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
7581 return set_dim_opt(set
, pos
, 1);
7584 /* Compute the minimum of the given set dimension as a function of the
7585 * parameters, but independently of the other set dimensions.
7587 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
7589 return set_dim_opt(set
, pos
, 0);
7592 /* Apply a preimage specified by "mat" on the parameters of "bset".
7593 * bset is assumed to have only parameters and divs.
7595 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
7596 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
7600 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7601 if (nparam
< 0 || !mat
)
7604 bset
->dim
= isl_space_cow(bset
->dim
);
7608 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
7610 bset
->dim
->nparam
= 0;
7611 bset
->dim
->n_out
= nparam
;
7612 bset
= isl_basic_set_preimage(bset
, mat
);
7614 bset
->dim
->nparam
= bset
->dim
->n_out
;
7615 bset
->dim
->n_out
= 0;
7620 isl_basic_set_free(bset
);
7624 /* Apply a preimage specified by "mat" on the parameters of "set".
7625 * set is assumed to have only parameters and divs.
7627 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
7628 __isl_take isl_mat
*mat
)
7633 nparam
= isl_set_dim(set
, isl_dim_param
);
7634 if (nparam
< 0 || !mat
)
7637 if (mat
->n_row
!= 1 + nparam
)
7638 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
7639 "unexpected number of rows", goto error
);
7641 space
= isl_set_get_space(set
);
7642 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7643 isl_dim_param
, 0, nparam
);
7644 set
= isl_set_reset_space(set
, space
);
7645 set
= isl_set_preimage(set
, mat
);
7646 nparam
= isl_set_dim(set
, isl_dim_out
);
7648 set
= isl_set_free(set
);
7649 space
= isl_set_get_space(set
);
7650 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7651 isl_dim_out
, 0, nparam
);
7652 set
= isl_set_reset_space(set
, space
);
7660 /* Intersect the basic set "bset" with the affine space specified by the
7661 * equalities in "eq".
7663 static __isl_give isl_basic_set
*basic_set_append_equalities(
7664 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7672 bset
= isl_basic_set_extend(bset
, 0, eq
->n_row
, 0);
7676 len
= isl_basic_set_offset(bset
, isl_dim_div
) + bset
->extra
;
7677 for (i
= 0; i
< eq
->n_row
; ++i
) {
7678 k
= isl_basic_set_alloc_equality(bset
);
7681 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7682 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7686 bset
= isl_basic_set_gauss(bset
, NULL
);
7687 bset
= isl_basic_set_finalize(bset
);
7692 isl_basic_set_free(bset
);
7696 /* Intersect the set "set" with the affine space specified by the
7697 * equalities in "eq".
7699 static __isl_give isl_set
*set_append_equalities(__isl_take isl_set
*set
,
7700 __isl_take isl_mat
*eq
)
7707 for (i
= 0; i
< set
->n
; ++i
) {
7708 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7721 /* Given a basic set "bset" that only involves parameters and existentially
7722 * quantified variables, return the index of the first equality
7723 * that only involves parameters. If there is no such equality then
7724 * return bset->n_eq.
7726 * This function assumes that isl_basic_set_gauss has been called on "bset".
7728 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7731 isl_size nparam
, n_div
;
7733 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7734 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7735 if (nparam
< 0 || n_div
< 0)
7738 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7739 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7746 /* Compute an explicit representation for the existentially quantified
7747 * variables in "bset" by computing the "minimal value" of the set
7748 * variables. Since there are no set variables, the computation of
7749 * the minimal value essentially computes an explicit representation
7750 * of the non-empty part(s) of "bset".
7752 * The input only involves parameters and existentially quantified variables.
7753 * All equalities among parameters have been removed.
7755 * Since the existentially quantified variables in the result are in general
7756 * going to be different from those in the input, we first replace
7757 * them by the minimal number of variables based on their equalities.
7758 * This should simplify the parametric integer programming.
7760 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7762 isl_morph
*morph1
, *morph2
;
7768 if (bset
->n_eq
== 0)
7769 return isl_basic_set_lexmin_compute_divs(bset
);
7771 morph1
= isl_basic_set_parameter_compression(bset
);
7772 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7773 bset
= isl_basic_set_lift(bset
);
7774 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7775 bset
= isl_morph_basic_set(morph2
, bset
);
7776 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7778 bset
= isl_basic_set_free(bset
);
7779 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7781 set
= isl_basic_set_lexmin_compute_divs(bset
);
7783 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7788 /* Project the given basic set onto its parameter domain, possibly introducing
7789 * new, explicit, existential variables in the constraints.
7790 * The input has parameters and (possibly implicit) existential variables.
7791 * The output has the same parameters, but only
7792 * explicit existentially quantified variables.
7794 * The actual projection is performed by pip, but pip doesn't seem
7795 * to like equalities very much, so we first remove the equalities
7796 * among the parameters by performing a variable compression on
7797 * the parameters. Afterward, an inverse transformation is performed
7798 * and the equalities among the parameters are inserted back in.
7800 * The variable compression on the parameters may uncover additional
7801 * equalities that were only implicit before. We therefore check
7802 * if there are any new parameter equalities in the result and
7803 * if so recurse. The removal of parameter equalities is required
7804 * for the parameter compression performed by base_compute_divs.
7806 static __isl_give isl_set
*parameter_compute_divs(
7807 __isl_take isl_basic_set
*bset
)
7811 struct isl_mat
*T
, *T2
;
7812 struct isl_set
*set
;
7815 bset
= isl_basic_set_cow(bset
);
7819 if (bset
->n_eq
== 0)
7820 return base_compute_divs(bset
);
7822 bset
= isl_basic_set_gauss(bset
, NULL
);
7825 if (isl_basic_set_plain_is_empty(bset
))
7826 return isl_set_from_basic_set(bset
);
7828 i
= first_parameter_equality(bset
);
7829 if (i
== bset
->n_eq
)
7830 return base_compute_divs(bset
);
7832 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7834 return isl_set_from_basic_set(isl_basic_set_free(bset
));
7835 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7837 eq
= isl_mat_cow(eq
);
7838 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7839 if (T
&& T
->n_col
== 0) {
7843 bset
= isl_basic_set_set_to_empty(bset
);
7844 return isl_set_from_basic_set(bset
);
7846 bset
= basic_set_parameter_preimage(bset
, T
);
7848 i
= first_parameter_equality(bset
);
7851 else if (i
== bset
->n_eq
)
7852 set
= base_compute_divs(bset
);
7854 set
= parameter_compute_divs(bset
);
7855 set
= set_parameter_preimage(set
, T2
);
7856 set
= set_append_equalities(set
, eq
);
7860 /* Insert the divs from "ls" before those of "bmap".
7862 * The number of columns is not changed, which means that the last
7863 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7864 * The caller is responsible for removing the same number of dimensions
7865 * from the space of "bmap".
7867 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7868 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7874 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7876 return isl_basic_map_free(bmap
);
7880 old_n_div
= bmap
->n_div
;
7881 bmap
= insert_div_rows(bmap
, n_div
);
7885 for (i
= 0; i
< n_div
; ++i
) {
7886 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7887 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7893 /* Replace the space of "bmap" by the space and divs of "ls".
7895 * If "ls" has any divs, then we simplify the result since we may
7896 * have discovered some additional equalities that could simplify
7897 * the div expressions.
7899 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7900 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7904 bmap
= isl_basic_map_cow(bmap
);
7905 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7906 if (!bmap
|| n_div
< 0)
7909 bmap
= insert_divs_from_local_space(bmap
, ls
);
7913 isl_space_free(bmap
->dim
);
7914 bmap
->dim
= isl_local_space_get_space(ls
);
7918 isl_local_space_free(ls
);
7920 bmap
= isl_basic_map_simplify(bmap
);
7921 bmap
= isl_basic_map_finalize(bmap
);
7924 isl_basic_map_free(bmap
);
7925 isl_local_space_free(ls
);
7929 /* Replace the space of "map" by the space and divs of "ls".
7931 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7932 __isl_take isl_local_space
*ls
)
7936 map
= isl_map_cow(map
);
7940 for (i
= 0; i
< map
->n
; ++i
) {
7941 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7942 isl_local_space_copy(ls
));
7946 isl_space_free(isl_map_take_space(map
));
7947 map
= isl_map_restore_space(map
, isl_local_space_get_space(ls
));
7949 isl_local_space_free(ls
);
7952 isl_local_space_free(ls
);
7957 /* Compute an explicit representation for the existentially
7958 * quantified variables for which do not know any explicit representation yet.
7960 * We first sort the existentially quantified variables so that the
7961 * existentially quantified variables for which we already have an explicit
7962 * representation are placed before those for which we do not.
7963 * The input dimensions, the output dimensions and the existentially
7964 * quantified variables for which we already have an explicit
7965 * representation are then turned into parameters.
7966 * compute_divs returns a map with the same parameters and
7967 * no input or output dimensions and the dimension specification
7968 * is reset to that of the input, including the existentially quantified
7969 * variables for which we already had an explicit representation.
7971 static __isl_give isl_map
*compute_divs(__isl_take isl_basic_map
*bmap
)
7973 struct isl_basic_set
*bset
;
7974 struct isl_set
*set
;
7975 struct isl_map
*map
;
7977 isl_local_space
*ls
;
7984 bmap
= isl_basic_map_sort_divs(bmap
);
7985 bmap
= isl_basic_map_cow(bmap
);
7989 n_known
= isl_basic_map_first_unknown_div(bmap
);
7990 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7991 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7992 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7993 if (n_known
< 0 || nparam
< 0 || n_in
< 0 || n_out
< 0)
7994 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7996 space
= isl_space_set_alloc(bmap
->ctx
,
7997 nparam
+ n_in
+ n_out
+ n_known
, 0);
8001 ls
= isl_basic_map_get_local_space(bmap
);
8002 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
8003 n_known
, bmap
->n_div
- n_known
);
8005 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
8006 swap_div(bmap
, i
- n_known
, i
);
8007 bmap
->n_div
-= n_known
;
8008 bmap
->extra
-= n_known
;
8010 bmap
= isl_basic_map_reset_space(bmap
, space
);
8011 bset
= bset_from_bmap(bmap
);
8013 set
= parameter_compute_divs(bset
);
8014 map
= set_to_map(set
);
8015 map
= replace_space_by_local_space(map
, ls
);
8019 isl_basic_map_free(bmap
);
8023 /* Remove the explicit representation of local variable "div",
8026 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
8027 __isl_take isl_basic_map
*bmap
, int div
)
8031 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
8033 return isl_basic_map_free(bmap
);
8037 bmap
= isl_basic_map_cow(bmap
);
8040 isl_int_set_si(bmap
->div
[div
][0], 0);
8044 /* Is local variable "div" of "bmap" marked as not having an explicit
8046 * Note that even if "div" is not marked in this way and therefore
8047 * has an explicit representation, this representation may still
8048 * depend (indirectly) on other local variables that do not
8049 * have an explicit representation.
8051 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
8054 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
8055 return isl_bool_error
;
8056 return isl_int_is_zero(bmap
->div
[div
][0]);
8059 /* Return the position of the first local variable that does not
8060 * have an explicit representation.
8061 * Return the total number of local variables if they all have
8062 * an explicit representation.
8063 * Return -1 on error.
8065 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
8072 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8073 if (!isl_basic_map_div_is_known(bmap
, i
))
8079 /* Return the position of the first local variable that does not
8080 * have an explicit representation.
8081 * Return the total number of local variables if they all have
8082 * an explicit representation.
8083 * Return -1 on error.
8085 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
8087 return isl_basic_map_first_unknown_div(bset
);
8090 /* Does "bmap" have an explicit representation for all local variables?
8092 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
8097 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
8098 first
= isl_basic_map_first_unknown_div(bmap
);
8099 if (n
< 0 || first
< 0)
8100 return isl_bool_error
;
8104 /* Do all basic maps in "map" have an explicit representation
8105 * for all local variables?
8107 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
8112 return isl_bool_error
;
8114 for (i
= 0; i
< map
->n
; ++i
) {
8115 int known
= isl_basic_map_divs_known(map
->p
[i
]);
8120 return isl_bool_true
;
8123 /* If bmap contains any unknown divs, then compute explicit
8124 * expressions for them. However, this computation may be
8125 * quite expensive, so first try to remove divs that aren't
8128 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
8131 struct isl_map
*map
;
8133 known
= isl_basic_map_divs_known(bmap
);
8137 return isl_map_from_basic_map(bmap
);
8139 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
8141 known
= isl_basic_map_divs_known(bmap
);
8145 return isl_map_from_basic_map(bmap
);
8147 map
= compute_divs(bmap
);
8150 isl_basic_map_free(bmap
);
8154 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
8158 struct isl_map
*res
;
8165 known
= isl_map_divs_known(map
);
8173 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
8174 for (i
= 1 ; i
< map
->n
; ++i
) {
8176 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
8177 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
8178 res
= isl_map_union_disjoint(res
, r2
);
8180 res
= isl_map_union(res
, r2
);
8187 __isl_give isl_set
*isl_basic_set_compute_divs(__isl_take isl_basic_set
*bset
)
8189 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
8192 __isl_give isl_set
*isl_set_compute_divs(__isl_take isl_set
*set
)
8194 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
8197 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
8202 n_out
= isl_map_dim(map
, isl_dim_out
);
8204 return set_from_map(isl_map_free(map
));
8205 space
= isl_space_domain(isl_map_get_space(map
));
8207 map
= isl_map_project_out(map
, isl_dim_out
, 0, n_out
);
8209 return set_from_map(isl_map_reset_space(map
, space
));
8212 /* Return the union of "map1" and "map2", where we assume for now that
8213 * "map1" and "map2" are disjoint. Note that the basic maps inside
8214 * "map1" or "map2" may not be disjoint from each other.
8215 * Also note that this function is also called from isl_map_union,
8216 * which takes care of handling the situation where "map1" and "map2"
8217 * may not be disjoint.
8219 * If one of the inputs is empty, we can simply return the other input.
8220 * Similarly, if one of the inputs is universal, then it is equal to the union.
8222 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
8223 __isl_take isl_map
*map2
)
8227 struct isl_map
*map
= NULL
;
8230 if (isl_map_check_equal_space(map1
, map2
) < 0)
8242 is_universe
= isl_map_plain_is_universe(map1
);
8243 if (is_universe
< 0)
8250 is_universe
= isl_map_plain_is_universe(map2
);
8251 if (is_universe
< 0)
8258 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8259 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8260 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8262 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
8263 map1
->n
+ map2
->n
, flags
);
8266 for (i
= 0; i
< map1
->n
; ++i
) {
8267 map
= isl_map_add_basic_map(map
,
8268 isl_basic_map_copy(map1
->p
[i
]));
8272 for (i
= 0; i
< map2
->n
; ++i
) {
8273 map
= isl_map_add_basic_map(map
,
8274 isl_basic_map_copy(map2
->p
[i
]));
8288 /* Return the union of "map1" and "map2", where "map1" and "map2" are
8289 * guaranteed to be disjoint by the caller.
8291 * Note that this functions is called from within isl_map_make_disjoint,
8292 * so we have to be careful not to touch the constraints of the inputs
8295 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
8296 __isl_take isl_map
*map2
)
8298 isl_map_align_params_bin(&map1
, &map2
);
8299 return map_union_disjoint(map1
, map2
);
8302 /* Return the union of "map1" and "map2", where "map1" and "map2" may
8305 * We currently simply call map_union_disjoint, the internal operation
8306 * of which does not really depend on the inputs being disjoint.
8307 * If the result contains more than one basic map, then we clear
8308 * the disjoint flag since the result may contain basic maps from
8309 * both inputs and these are not guaranteed to be disjoint.
8311 * As a special case, if "map1" and "map2" are obviously equal,
8312 * then we simply return "map1".
8314 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
8315 __isl_take isl_map
*map2
)
8319 if (isl_map_align_params_bin(&map1
, &map2
) < 0)
8322 equal
= isl_map_plain_is_equal(map1
, map2
);
8330 map1
= map_union_disjoint(map1
, map2
);
8334 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
8342 __isl_give isl_set
*isl_set_union_disjoint(
8343 __isl_take isl_set
*set1
, __isl_take isl_set
*set2
)
8345 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
8349 __isl_give isl_set
*isl_set_union(__isl_take isl_set
*set1
,
8350 __isl_take isl_set
*set2
)
8352 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
8355 /* Apply "fn" to pairs of elements from "map" and "set" and collect
8356 * the results in a map living in "space".
8358 * "map" and "set" are assumed to be compatible and non-NULL.
8360 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
8361 __isl_take isl_space
*space
, __isl_take isl_set
*set
,
8362 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
8363 __isl_take isl_basic_set
*bset
))
8366 struct isl_map
*result
;
8369 if (isl_set_plain_is_universe(set
)) {
8371 return isl_map_reset_equal_dim_space(map
, space
);
8374 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
8375 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
8376 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8378 result
= isl_map_alloc_space(space
, map
->n
* set
->n
, flags
);
8379 for (i
= 0; result
&& i
< map
->n
; ++i
)
8380 for (j
= 0; j
< set
->n
; ++j
) {
8381 result
= isl_map_add_basic_map(result
,
8382 fn(isl_basic_map_copy(map
->p
[i
]),
8383 isl_basic_set_copy(set
->p
[j
])));
8393 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
8394 __isl_take isl_set
*set
)
8399 isl_map_align_params_set(&map
, &set
);
8400 ok
= isl_map_compatible_range(map
, set
);
8404 isl_die(set
->ctx
, isl_error_invalid
,
8405 "incompatible spaces", goto error
);
8407 space
= isl_map_get_space(map
);
8408 return map_intersect_set(map
, space
, set
,
8409 &isl_basic_map_intersect_range
);
8416 /* Intersect the domain of "map" with "set".
8418 * If the domain dimensions of "map" do not have any identifiers,
8419 * then copy them over from "set".
8421 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
8422 __isl_take isl_set
*set
)
8427 isl_map_align_params_set(&map
, &set
);
8428 ok
= isl_map_compatible_domain(map
, set
);
8432 isl_die(set
->ctx
, isl_error_invalid
,
8433 "incompatible spaces", goto error
);
8435 space
= isl_map_get_space(map
);
8436 space
= isl_space_copy_ids_if_unset(space
, isl_dim_in
,
8437 isl_set_peek_space(set
), isl_dim_set
);
8438 return map_intersect_set(map
, space
, set
,
8439 &isl_basic_map_intersect_domain
);
8449 #include "isl_copy_tuple_id_templ.c"
8451 /* Data structure that specifies how isl_map_intersect_factor
8454 * "preserve_type" is the tuple where the factor differs from
8455 * the input map and of which the identifiers needs
8456 * to be preserved explicitly.
8457 * "other_factor" is used to extract the space of the other factor
8458 * from the space of the product ("map").
8459 * "product" is used to combine the given factor and a universe map
8460 * in the space returned by "other_factor" to produce a map
8461 * that lives in the same space as the input map.
8463 struct isl_intersect_factor_control
{
8464 enum isl_dim_type preserve_type
;
8465 __isl_give isl_space
*(*other_factor
)(__isl_take isl_space
*space
);
8466 __isl_give isl_map
*(*product
)(__isl_take isl_map
*factor
,
8467 __isl_take isl_map
*other
);
8470 /* Given a map "map" in some product space and a map "factor"
8471 * living in some factor space, return the intersection.
8473 * After aligning the parameters,
8474 * the map "factor" is first extended to a map living in the same space
8475 * as "map" and then a regular intersection is computed.
8477 * Note that the extension is computed as a product, which is anonymous
8478 * by default. If "map" has an identifier on the corresponding tuple,
8479 * then this identifier needs to be set on the product
8480 * before the intersection is computed.
8482 static __isl_give isl_map
*isl_map_intersect_factor(
8483 __isl_take isl_map
*map
, __isl_take isl_map
*factor
,
8484 struct isl_intersect_factor_control
*control
)
8488 isl_map
*other
, *product
;
8490 equal
= isl_map_has_equal_params(map
, factor
);
8494 map
= isl_map_align_params(map
, isl_map_get_space(factor
));
8495 factor
= isl_map_align_params(factor
, isl_map_get_space(map
));
8498 space
= isl_map_get_space(map
);
8499 other
= isl_map_universe(control
->other_factor(space
));
8500 product
= control
->product(factor
, other
);
8502 space
= isl_map_peek_space(map
);
8503 product
= isl_map_copy_tuple_id(product
, control
->preserve_type
,
8504 space
, control
->preserve_type
);
8505 return map_intersect(map
, product
);
8508 isl_map_free(factor
);
8512 /* Return the domain product of "map2" and "map1".
8514 static __isl_give isl_map
*isl_map_reverse_domain_product(
8515 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
8517 return isl_map_domain_product(map2
, map1
);
8520 /* Return the range product of "map2" and "map1".
8522 static __isl_give isl_map
*isl_map_reverse_range_product(
8523 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
8525 return isl_map_range_product(map2
, map1
);
8528 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
8529 * in the space A -> C, return the intersection.
8531 __isl_give isl_map
*isl_map_intersect_domain_factor_domain(
8532 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
8534 struct isl_intersect_factor_control control
= {
8535 .preserve_type
= isl_dim_in
,
8536 .other_factor
= isl_space_domain_factor_range
,
8537 .product
= isl_map_domain_product
,
8540 return isl_map_intersect_factor(map
, factor
, &control
);
8543 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
8544 * in the space B -> C, return the intersection.
8546 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
8547 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
8549 struct isl_intersect_factor_control control
= {
8550 .preserve_type
= isl_dim_in
,
8551 .other_factor
= isl_space_domain_factor_domain
,
8552 .product
= isl_map_reverse_domain_product
,
8555 return isl_map_intersect_factor(map
, factor
, &control
);
8558 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
8559 * in the space A -> B, return the intersection.
8561 __isl_give isl_map
*isl_map_intersect_range_factor_domain(
8562 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
8564 struct isl_intersect_factor_control control
= {
8565 .preserve_type
= isl_dim_out
,
8566 .other_factor
= isl_space_range_factor_range
,
8567 .product
= isl_map_range_product
,
8570 return isl_map_intersect_factor(map
, factor
, &control
);
8573 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
8574 * in the space A -> C, return the intersection.
8576 __isl_give isl_map
*isl_map_intersect_range_factor_range(
8577 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
8579 struct isl_intersect_factor_control control
= {
8580 .preserve_type
= isl_dim_out
,
8581 .other_factor
= isl_space_range_factor_domain
,
8582 .product
= isl_map_reverse_range_product
,
8585 return isl_map_intersect_factor(map
, factor
, &control
);
8588 /* Given a set "set" in a space [A -> B] and a set "domain"
8589 * in the space A, return the intersection.
8591 * The set "domain" is first extended to a set living in the space
8592 * [A -> B] and then a regular intersection is computed.
8594 __isl_give isl_set
*isl_set_intersect_factor_domain(__isl_take isl_set
*set
,
8595 __isl_take isl_set
*domain
)
8597 struct isl_intersect_factor_control control
= {
8598 .preserve_type
= isl_dim_set
,
8599 .other_factor
= isl_space_factor_range
,
8600 .product
= isl_map_range_product
,
8603 return set_from_map(isl_map_intersect_factor(set_to_map(set
),
8604 set_to_map(domain
), &control
));
8607 /* Given a set "set" in a space [A -> B] and a set "range"
8608 * in the space B, return the intersection.
8610 * The set "range" is first extended to a set living in the space
8611 * [A -> B] and then a regular intersection is computed.
8613 __isl_give isl_set
*isl_set_intersect_factor_range(__isl_take isl_set
*set
,
8614 __isl_take isl_set
*range
)
8616 struct isl_intersect_factor_control control
= {
8617 .preserve_type
= isl_dim_set
,
8618 .other_factor
= isl_space_factor_domain
,
8619 .product
= isl_map_reverse_range_product
,
8622 return set_from_map(isl_map_intersect_factor(set_to_map(set
),
8623 set_to_map(range
), &control
));
8629 #include "isl_copy_tuple_id_templ.c"
8631 /* Given a map "map" in a space [A -> B] -> C and a set "domain"
8632 * in the space A, return the intersection.
8634 * The set "domain" is extended to a set living in the space [A -> B] and
8635 * the domain of "map" is intersected with this set.
8637 * If "map" has an identifier on the domain tuple,
8638 * then this identifier needs to be set on this product
8639 * before the intersection is computed.
8641 __isl_give isl_map
*isl_map_intersect_domain_wrapped_domain(
8642 __isl_take isl_map
*map
, __isl_take isl_set
*domain
)
8647 isl_map_align_params_set(&map
, &domain
);
8648 space
= isl_map_get_space(map
);
8649 space
= isl_space_domain_wrapped_range(space
);
8650 factor
= isl_set_universe(space
);
8651 domain
= isl_set_product(domain
, factor
);
8652 space
= isl_map_peek_space(map
);
8653 domain
= isl_set_copy_tuple_id(domain
, isl_dim_set
, space
, isl_dim_in
);
8654 return isl_map_intersect_domain(map
, domain
);
8657 /* Given a map "map" in a space A -> [B -> C] and a set "domain"
8658 * in the space B, return the intersection.
8660 * The set "domain" is extended to a set living in the space [B -> C] and
8661 * the range of "map" is intersected with this set.
8663 * If "map" has an identifier on the range tuple,
8664 * then this identifier needs to be set on this product
8665 * before the intersection is computed.
8667 __isl_give isl_map
*isl_map_intersect_range_wrapped_domain(
8668 __isl_take isl_map
*map
, __isl_take isl_set
*domain
)
8673 isl_map_align_params_set(&map
, &domain
);
8674 space
= isl_map_get_space(map
);
8675 space
= isl_space_range_wrapped_range(space
);
8676 factor
= isl_set_universe(space
);
8677 domain
= isl_set_product(domain
, factor
);
8678 space
= isl_map_peek_space(map
);
8679 domain
= isl_set_copy_tuple_id(domain
, isl_dim_set
, space
, isl_dim_out
);
8680 return isl_map_intersect_range(map
, domain
);
8683 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
8684 __isl_take isl_map
*map2
)
8686 if (isl_map_align_params_bin(&map1
, &map2
) < 0)
8688 map1
= isl_map_reverse(map1
);
8689 map1
= isl_map_apply_range(map1
, map2
);
8690 return isl_map_reverse(map1
);
8697 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
8698 __isl_take isl_map
*map2
)
8701 struct isl_map
*result
;
8704 if (isl_map_align_params_bin(&map1
, &map2
) < 0)
8707 space
= isl_space_join(isl_space_copy(map1
->dim
),
8708 isl_space_copy(map2
->dim
));
8710 result
= isl_map_alloc_space(space
, map1
->n
* map2
->n
, 0);
8713 for (i
= 0; i
< map1
->n
; ++i
)
8714 for (j
= 0; j
< map2
->n
; ++j
) {
8715 result
= isl_map_add_basic_map(result
,
8716 isl_basic_map_apply_range(
8717 isl_basic_map_copy(map1
->p
[i
]),
8718 isl_basic_map_copy(map2
->p
[j
])));
8724 if (result
&& result
->n
<= 1)
8725 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
8733 /* Is "bmap" a transformation, i.e.,
8734 * does it relate elements from the same space.
8736 isl_bool
isl_basic_map_is_transformation(__isl_keep isl_basic_map
*bmap
)
8740 space
= isl_basic_map_peek_space(bmap
);
8741 return isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
8744 /* Check that "bmap" is a transformation, i.e.,
8745 * that it relates elements from the same space.
8747 static isl_stat
isl_basic_map_check_transformation(
8748 __isl_keep isl_basic_map
*bmap
)
8752 equal
= isl_basic_map_is_transformation(bmap
);
8754 return isl_stat_error
;
8756 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
8757 "domain and range don't match", return isl_stat_error
);
8762 * returns range - domain
8764 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
8766 isl_space
*target_space
;
8767 struct isl_basic_set
*bset
;
8773 if (isl_basic_map_check_transformation(bmap
) < 0)
8774 return isl_basic_map_free(bmap
);
8775 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
8776 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8777 if (dim
< 0 || nparam
< 0)
8779 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
8780 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
8781 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
8782 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
8784 bmap
= isl_basic_map_free(bmap
);
8785 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
8786 for (i
= 0; i
< dim
; ++i
) {
8787 int j
= isl_basic_map_alloc_equality(bmap
);
8789 bmap
= isl_basic_map_free(bmap
);
8792 isl_seq_clr(bmap
->eq
[j
], 1 + total
);
8793 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8794 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
8795 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
8797 bset
= isl_basic_map_domain(bmap
);
8798 bset
= isl_basic_set_reset_space(bset
, target_space
);
8801 isl_basic_map_free(bmap
);
8805 /* Is the tuple of type "type1" of "map" the same as
8806 * the tuple of type "type2" of "space"?
8808 isl_bool
isl_map_space_tuple_is_equal(__isl_keep isl_map
*map
,
8809 enum isl_dim_type type1
, __isl_keep isl_space
*space
,
8810 enum isl_dim_type type2
)
8812 isl_space
*map_space
;
8814 map_space
= isl_map_peek_space(map
);
8815 return isl_space_tuple_is_equal(map_space
, type1
, space
, type2
);
8818 /* Is the tuple of type "type1" of "map1" the same as
8819 * the tuple of type "type2" of "map2"?
8821 isl_bool
isl_map_tuple_is_equal(__isl_keep isl_map
*map1
,
8822 enum isl_dim_type type1
, __isl_keep isl_map
*map2
,
8823 enum isl_dim_type type2
)
8825 isl_space
*space1
, *space2
;
8827 space1
= isl_map_peek_space(map1
);
8828 space2
= isl_map_peek_space(map2
);
8829 return isl_space_tuple_is_equal(space1
, type1
, space2
, type2
);
8832 /* Is the space of "obj" equal to "space", ignoring parameters?
8834 isl_bool
isl_map_has_space_tuples(__isl_keep isl_map
*map
,
8835 __isl_keep isl_space
*space
)
8837 isl_space
*map_space
;
8839 map_space
= isl_map_peek_space(map
);
8840 return isl_space_has_equal_tuples(map_space
, space
);
8843 /* Check that "map" is a transformation, i.e.,
8844 * that it relates elements from the same space.
8846 isl_stat
isl_map_check_transformation(__isl_keep isl_map
*map
)
8850 equal
= isl_map_tuple_is_equal(map
, isl_dim_in
, map
, isl_dim_out
);
8852 return isl_stat_error
;
8854 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
8855 "domain and range don't match", return isl_stat_error
);
8860 * returns range - domain
8862 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8866 struct isl_set
*result
;
8868 if (isl_map_check_transformation(map
) < 0)
8870 space
= isl_map_get_space(map
);
8871 space
= isl_space_domain(space
);
8872 result
= isl_set_alloc_space(space
, map
->n
, 0);
8875 for (i
= 0; i
< map
->n
; ++i
)
8876 result
= isl_set_add_basic_set(result
,
8877 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8886 * returns [domain -> range] -> range - domain
8888 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8889 __isl_take isl_basic_map
*bmap
)
8893 isl_basic_map
*domain
;
8897 if (isl_basic_map_check_transformation(bmap
) < 0)
8898 return isl_basic_map_free(bmap
);
8900 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8901 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8902 if (nparam
< 0 || n
< 0)
8903 return isl_basic_map_free(bmap
);
8905 space
= isl_basic_map_get_space(bmap
);
8906 space
= isl_space_from_range(isl_space_domain(space
));
8907 domain
= isl_basic_map_universe(space
);
8909 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8910 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8911 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8913 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
8915 return isl_basic_map_free(bmap
);
8917 for (i
= 0; i
< n
; ++i
) {
8918 k
= isl_basic_map_alloc_equality(bmap
);
8921 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8922 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8923 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8924 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8927 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8928 return isl_basic_map_finalize(bmap
);
8930 isl_basic_map_free(bmap
);
8935 * returns [domain -> range] -> range - domain
8937 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8939 if (isl_map_check_transformation(map
) < 0)
8940 return isl_map_free(map
);
8942 return isl_map_transform(map
, &isl_space_range_map
,
8943 &isl_basic_map_deltas_map
);
8946 /* Return pairs of elements { x -> y } such that y - x is in "deltas".
8948 __isl_give isl_map
*isl_set_translation(__isl_take isl_set
*deltas
)
8953 space
= isl_space_map_from_set(isl_set_get_space(deltas
));
8954 map
= isl_map_deltas_map(isl_map_universe(space
));
8955 map
= isl_map_intersect_range(map
, deltas
);
8957 return isl_set_unwrap(isl_map_domain(map
));
8960 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*space
)
8962 isl_size n_in
, n_out
;
8964 n_in
= isl_space_dim(space
, isl_dim_in
);
8965 n_out
= isl_space_dim(space
, isl_dim_out
);
8966 if (n_in
< 0 || n_out
< 0)
8969 isl_die(space
->ctx
, isl_error_invalid
,
8970 "number of input and output dimensions needs to be "
8971 "the same", goto error
);
8972 return isl_basic_map_equal(space
, n_in
);
8974 isl_space_free(space
);
8978 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*space
)
8980 return isl_map_from_basic_map(isl_basic_map_identity(space
));
8983 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8985 isl_space
*space
= isl_set_get_space(set
);
8987 id
= isl_map_identity(isl_space_map_from_set(space
));
8988 return isl_map_intersect_range(id
, set
);
8991 /* Construct a basic set with all set dimensions having only non-negative
8994 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8995 __isl_take isl_space
*space
)
9001 struct isl_basic_set
*bset
;
9003 nparam
= isl_space_dim(space
, isl_dim_param
);
9004 dim
= isl_space_dim(space
, isl_dim_set
);
9005 total
= isl_space_dim(space
, isl_dim_all
);
9006 if (nparam
< 0 || dim
< 0 || total
< 0)
9007 space
= isl_space_free(space
);
9008 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
9011 for (i
= 0; i
< dim
; ++i
) {
9012 int k
= isl_basic_set_alloc_inequality(bset
);
9015 isl_seq_clr(bset
->ineq
[k
], 1 + total
);
9016 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
9020 isl_basic_set_free(bset
);
9024 /* Construct the half-space x_pos >= 0.
9026 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*space
,
9031 isl_basic_set
*nonneg
;
9033 total
= isl_space_dim(space
, isl_dim_all
);
9035 space
= isl_space_free(space
);
9036 nonneg
= isl_basic_set_alloc_space(space
, 0, 0, 1);
9037 k
= isl_basic_set_alloc_inequality(nonneg
);
9040 isl_seq_clr(nonneg
->ineq
[k
], 1 + total
);
9041 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
9043 return isl_basic_set_finalize(nonneg
);
9045 isl_basic_set_free(nonneg
);
9049 /* Construct the half-space x_pos <= -1.
9051 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*space
,
9058 total
= isl_space_dim(space
, isl_dim_all
);
9060 space
= isl_space_free(space
);
9061 neg
= isl_basic_set_alloc_space(space
, 0, 0, 1);
9062 k
= isl_basic_set_alloc_inequality(neg
);
9065 isl_seq_clr(neg
->ineq
[k
], 1 + total
);
9066 isl_int_set_si(neg
->ineq
[k
][0], -1);
9067 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
9069 return isl_basic_set_finalize(neg
);
9071 isl_basic_set_free(neg
);
9075 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
9076 enum isl_dim_type type
, unsigned first
, unsigned n
)
9080 isl_basic_set
*nonneg
;
9086 if (isl_set_check_range(set
, type
, first
, n
) < 0)
9087 return isl_set_free(set
);
9089 offset
= pos(set
->dim
, type
);
9090 for (i
= 0; i
< n
; ++i
) {
9091 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
9092 offset
+ first
+ i
);
9093 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
9095 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
9101 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
9103 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
9109 return isl_stat_error
;
9110 if (isl_set_plain_is_empty(set
)) {
9115 return fn(set
, signs
, user
);
9118 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
9120 half
= isl_set_intersect(half
, isl_set_copy(set
));
9121 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
9125 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
9127 half
= isl_set_intersect(half
, set
);
9128 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
9131 return isl_stat_error
;
9134 /* Call "fn" on the intersections of "set" with each of the orthants
9135 * (except for obviously empty intersections). The orthant is identified
9136 * by the signs array, with each entry having value 1 or -1 according
9137 * to the sign of the corresponding variable.
9139 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
9140 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
9149 return isl_stat_error
;
9150 if (isl_set_plain_is_empty(set
))
9153 nparam
= isl_set_dim(set
, isl_dim_param
);
9154 nvar
= isl_set_dim(set
, isl_dim_set
);
9155 if (nparam
< 0 || nvar
< 0)
9156 return isl_stat_error
;
9158 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
9160 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
9168 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9170 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
9173 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
9174 __isl_keep isl_basic_map
*bmap2
)
9177 struct isl_map
*map1
;
9178 struct isl_map
*map2
;
9180 if (!bmap1
|| !bmap2
)
9181 return isl_bool_error
;
9183 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
9184 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
9186 is_subset
= isl_map_is_subset(map1
, map2
);
9194 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
9195 __isl_keep isl_basic_set
*bset2
)
9197 return isl_basic_map_is_subset(bset1
, bset2
);
9200 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
9201 __isl_keep isl_basic_map
*bmap2
)
9205 if (!bmap1
|| !bmap2
)
9206 return isl_bool_error
;
9207 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
9208 if (is_subset
!= isl_bool_true
)
9210 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
9214 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
9215 __isl_keep isl_basic_set
*bset2
)
9217 return isl_basic_map_is_equal(
9218 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
9221 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
9227 return isl_bool_error
;
9228 for (i
= 0; i
< map
->n
; ++i
) {
9229 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
9231 return isl_bool_error
;
9233 return isl_bool_false
;
9235 return isl_bool_true
;
9238 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
9240 return map
? map
->n
== 0 : isl_bool_error
;
9243 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
9245 return set
? set
->n
== 0 : isl_bool_error
;
9248 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
9250 return isl_map_is_empty(set_to_map(set
));
9254 #define TYPE isl_basic_map
9257 #include "isl_type_has_equal_space_bin_templ.c"
9258 #include "isl_type_check_equal_space_templ.c"
9260 /* Check that "bset1" and "bset2" live in the same space,
9261 * reporting an error if they do not.
9263 isl_stat
isl_basic_set_check_equal_space(__isl_keep isl_basic_set
*bset1
,
9264 __isl_keep isl_basic_set
*bset2
)
9266 return isl_basic_map_check_equal_space(bset_to_bmap(bset1
),
9267 bset_to_bmap(bset1
));
9271 #define TYPE isl_map
9273 #include "isl_type_has_equal_space_bin_templ.c"
9274 #include "isl_type_check_equal_space_templ.c"
9275 #include "isl_type_has_space_templ.c"
9277 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
9278 __isl_keep isl_set
*set2
)
9280 return isl_map_has_equal_space(set_to_map(set1
), set_to_map(set2
));
9284 #define TYPE1 isl_map
9286 #define TYPE2 isl_basic_map
9288 #define TYPE_PAIR isl_map_basic_map
9291 #include "isl_type_has_equal_space_templ.c"
9292 #include "isl_type_check_equal_space_templ.c"
9294 /* Check that "set" and "bset" live in the same space,
9295 * reporting an error if they do not.
9297 isl_stat
isl_set_basic_set_check_equal_space(__isl_keep isl_set
*set
,
9298 __isl_keep isl_basic_set
*bset
)
9300 return isl_map_basic_map_check_equal_space(set_to_map(set
),
9301 bset_to_bmap(bset
));
9304 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
9309 return isl_bool_error
;
9310 is_subset
= isl_map_is_subset(map1
, map2
);
9311 if (is_subset
!= isl_bool_true
)
9313 is_subset
= isl_map_is_subset(map2
, map1
);
9317 /* Is "map1" equal to "map2"?
9319 * First check if they are obviously equal.
9320 * If not, then perform a more detailed analysis.
9322 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
9326 equal
= isl_map_plain_is_equal(map1
, map2
);
9327 if (equal
< 0 || equal
)
9329 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
9332 isl_bool
isl_basic_map_is_strict_subset(__isl_keep isl_basic_map
*bmap1
,
9333 __isl_keep isl_basic_map
*bmap2
)
9337 if (!bmap1
|| !bmap2
)
9338 return isl_bool_error
;
9339 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
9340 if (is_subset
!= isl_bool_true
)
9342 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
9343 return isl_bool_not(is_subset
);
9346 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
9347 __isl_keep isl_map
*map2
)
9352 return isl_bool_error
;
9353 is_subset
= isl_map_is_subset(map1
, map2
);
9354 if (is_subset
!= isl_bool_true
)
9356 is_subset
= isl_map_is_subset(map2
, map1
);
9357 return isl_bool_not(is_subset
);
9360 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
9361 __isl_keep isl_set
*set2
)
9363 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
9366 /* Is "bmap" obviously equal to the universe with the same space?
9368 * That is, does it not have any constraints?
9370 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
9373 return isl_bool_error
;
9374 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
9377 /* Is "bset" obviously equal to the universe with the same space?
9379 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
9381 return isl_basic_map_plain_is_universe(bset
);
9384 /* If "c" does not involve any existentially quantified variables,
9385 * then set *univ to false and abort
9387 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
9389 isl_bool
*univ
= user
;
9392 n
= isl_constraint_dim(c
, isl_dim_div
);
9394 c
= isl_constraint_free(c
);
9395 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
9396 isl_constraint_free(c
);
9397 if (*univ
< 0 || !*univ
)
9398 return isl_stat_error
;
9402 /* Is "bmap" equal to the universe with the same space?
9404 * First check if it is obviously equal to the universe.
9405 * If not and if there are any constraints not involving
9406 * existentially quantified variables, then it is certainly
9407 * not equal to the universe.
9408 * Otherwise, check if the universe is a subset of "bmap".
9410 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
9414 isl_basic_map
*test
;
9416 univ
= isl_basic_map_plain_is_universe(bmap
);
9417 if (univ
< 0 || univ
)
9419 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
9421 return isl_bool_error
;
9423 return isl_bool_false
;
9424 univ
= isl_bool_true
;
9425 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
9427 return isl_bool_error
;
9428 if (univ
< 0 || !univ
)
9430 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
9431 univ
= isl_basic_map_is_subset(test
, bmap
);
9432 isl_basic_map_free(test
);
9436 /* Is "bset" equal to the universe with the same space?
9438 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
9440 return isl_basic_map_is_universe(bset
);
9443 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
9448 return isl_bool_error
;
9450 for (i
= 0; i
< map
->n
; ++i
) {
9451 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
9456 return isl_bool_false
;
9459 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
9461 return isl_map_plain_is_universe(set_to_map(set
));
9464 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
9466 struct isl_basic_set
*bset
= NULL
;
9467 struct isl_vec
*sample
= NULL
;
9468 isl_bool empty
, non_empty
;
9471 return isl_bool_error
;
9473 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
9474 return isl_bool_true
;
9476 if (isl_basic_map_plain_is_universe(bmap
))
9477 return isl_bool_false
;
9479 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
9480 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
9481 copy
= isl_basic_map_remove_redundancies(copy
);
9482 empty
= isl_basic_map_plain_is_empty(copy
);
9483 isl_basic_map_free(copy
);
9487 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
9489 return isl_bool_error
;
9491 return isl_bool_false
;
9492 isl_vec_free(bmap
->sample
);
9493 bmap
->sample
= NULL
;
9494 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
9496 return isl_bool_error
;
9497 sample
= isl_basic_set_sample_vec(bset
);
9499 return isl_bool_error
;
9500 empty
= sample
->size
== 0;
9501 isl_vec_free(bmap
->sample
);
9502 bmap
->sample
= sample
;
9504 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
9509 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
9512 return isl_bool_error
;
9513 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
9516 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
9519 return isl_bool_error
;
9520 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
9523 /* Is "bmap" known to be non-empty?
9525 * That is, is the cached sample still valid?
9527 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
9532 return isl_bool_error
;
9534 return isl_bool_false
;
9535 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
9537 return isl_bool_error
;
9538 if (bmap
->sample
->size
!= 1 + total
)
9539 return isl_bool_false
;
9540 return isl_basic_map_contains(bmap
, bmap
->sample
);
9543 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
9545 return isl_basic_map_is_empty(bset_to_bmap(bset
));
9548 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
9549 __isl_take isl_basic_map
*bmap2
)
9551 struct isl_map
*map
;
9553 if (isl_basic_map_check_equal_space(bmap1
, bmap2
) < 0)
9556 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
9559 map
= isl_map_add_basic_map(map
, bmap1
);
9560 map
= isl_map_add_basic_map(map
, bmap2
);
9563 isl_basic_map_free(bmap1
);
9564 isl_basic_map_free(bmap2
);
9568 __isl_give isl_set
*isl_basic_set_union(__isl_take isl_basic_set
*bset1
,
9569 __isl_take isl_basic_set
*bset2
)
9571 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
9572 bset_to_bmap(bset2
)));
9575 /* Order divs such that any div only depends on previous divs */
9576 __isl_give isl_basic_map
*isl_basic_map_order_divs(
9577 __isl_take isl_basic_map
*bmap
)
9582 off
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
9584 return isl_basic_map_free(bmap
);
9586 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9588 if (isl_int_is_zero(bmap
->div
[i
][0]))
9590 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
9595 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
9596 "integer division depends on itself",
9597 return isl_basic_map_free(bmap
));
9598 bmap
= isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
9606 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
9613 for (i
= 0; i
< map
->n
; ++i
) {
9614 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
9625 /* Sort the local variables of "bset".
9627 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
9628 __isl_take isl_basic_set
*bset
)
9630 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
9633 /* Apply the expansion computed by isl_merge_divs.
9634 * The expansion itself is given by "exp" while the resulting
9635 * list of divs is given by "div".
9637 * Move the integer divisions of "bmap" into the right position
9638 * according to "exp" and then introduce the additional integer
9639 * divisions, adding div constraints.
9640 * The moving should be done first to avoid moving coefficients
9641 * in the definitions of the extra integer divisions.
9643 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
9644 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
9649 bmap
= isl_basic_map_cow(bmap
);
9653 if (div
->n_row
< bmap
->n_div
)
9654 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
9655 "not an expansion", goto error
);
9657 n_div
= bmap
->n_div
;
9658 bmap
= isl_basic_map_extend(bmap
, div
->n_row
- n_div
, 0,
9659 2 * (div
->n_row
- n_div
));
9661 for (i
= n_div
; i
< div
->n_row
; ++i
)
9662 if (isl_basic_map_alloc_div(bmap
) < 0)
9665 for (j
= n_div
- 1; j
>= 0; --j
) {
9668 bmap
= isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
9673 for (i
= 0; i
< div
->n_row
; ++i
) {
9674 if (j
< n_div
&& exp
[j
] == i
) {
9677 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
9678 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
9680 bmap
= isl_basic_map_add_div_constraints(bmap
, i
);
9689 isl_basic_map_free(bmap
);
9694 /* Apply the expansion computed by isl_merge_divs.
9695 * The expansion itself is given by "exp" while the resulting
9696 * list of divs is given by "div".
9698 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
9699 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
9701 return isl_basic_map_expand_divs(bset
, div
, exp
);
9704 /* Look for a div in dst that corresponds to the div "div" in src.
9705 * The divs before "div" in src and dst are assumed to be the same.
9707 * Return the position of the corresponding div in dst
9708 * if there is one. Otherwise, return a position beyond the integer divisions.
9709 * Return -1 on error.
9711 static int find_div(__isl_keep isl_basic_map
*dst
,
9712 __isl_keep isl_basic_map
*src
, unsigned div
)
9718 v_div
= isl_basic_map_var_offset(src
, isl_dim_div
);
9719 n_div
= isl_basic_map_dim(dst
, isl_dim_div
);
9720 if (n_div
< 0 || v_div
< 0)
9722 isl_assert(dst
->ctx
, div
<= n_div
, return -1);
9723 for (i
= div
; i
< n_div
; ++i
)
9724 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+v_div
+div
) &&
9725 isl_seq_first_non_zero(dst
->div
[i
] + 1 + 1 + v_div
+ div
,
9731 /* Align the divs of "dst" to those of "src", adding divs from "src"
9732 * if needed. That is, make sure that the first src->n_div divs
9733 * of the result are equal to those of src.
9734 * The integer division of "src" are assumed to be ordered.
9736 * The integer divisions are swapped into the right position
9737 * (possibly after adding them first). This may result
9738 * in the remaining integer divisions appearing in the wrong order,
9739 * i.e., with some integer division appearing before
9740 * some other integer division on which it depends.
9741 * The integer divisions therefore need to be ordered.
9742 * This will not affect the integer divisions aligned to those of "src",
9743 * since "src" is assumed to have ordered integer divisions.
9745 * The result is not finalized as by design it will have redundant
9746 * divs if any divs from "src" were copied.
9748 __isl_give isl_basic_map
*isl_basic_map_align_divs(
9749 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
9758 return isl_basic_map_free(dst
);
9760 if (src
->n_div
== 0)
9763 known
= isl_basic_map_divs_known(src
);
9765 return isl_basic_map_free(dst
);
9767 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
9768 "some src divs are unknown",
9769 return isl_basic_map_free(dst
));
9771 v_div
= isl_basic_map_var_offset(src
, isl_dim_div
);
9773 return isl_basic_map_free(dst
);
9776 dst_n_div
= isl_basic_map_dim(dst
, isl_dim_div
);
9778 dst
= isl_basic_map_free(dst
);
9779 for (i
= 0; i
< src
->n_div
; ++i
) {
9780 int j
= find_div(dst
, src
, i
);
9782 dst
= isl_basic_map_free(dst
);
9783 if (j
== dst_n_div
) {
9785 int extra
= src
->n_div
- i
;
9786 dst
= isl_basic_map_cow(dst
);
9788 return isl_basic_map_free(dst
);
9789 dst
= isl_basic_map_extend(dst
,
9790 extra
, 0, 2 * extra
);
9793 j
= isl_basic_map_alloc_div(dst
);
9795 return isl_basic_map_free(dst
);
9796 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+v_div
+i
);
9797 isl_seq_clr(dst
->div
[j
]+1+1+v_div
+i
, dst
->n_div
- i
);
9799 dst
= isl_basic_map_add_div_constraints(dst
, j
);
9801 return isl_basic_map_free(dst
);
9804 dst
= isl_basic_map_swap_div(dst
, i
, j
);
9806 return isl_basic_map_free(dst
);
9808 return isl_basic_map_order_divs(dst
);
9811 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
9819 map
= isl_map_compute_divs(map
);
9820 map
= isl_map_order_divs(map
);
9821 map
= isl_map_cow(map
);
9825 for (i
= 1; i
< map
->n
; ++i
)
9826 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
9827 for (i
= 1; i
< map
->n
; ++i
) {
9828 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
9830 return isl_map_free(map
);
9833 map
= isl_map_unmark_normalized(map
);
9837 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
9839 return isl_map_align_divs_internal(map
);
9842 __isl_give isl_set
*isl_set_align_divs(__isl_take isl_set
*set
)
9844 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
9847 /* Align the divs of the basic maps in "map" to those
9848 * of the basic maps in "list", as well as to the other basic maps in "map".
9849 * The elements in "list" are assumed to have known divs.
9851 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
9852 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
9857 n
= isl_basic_map_list_n_basic_map(list
);
9858 map
= isl_map_compute_divs(map
);
9859 map
= isl_map_cow(map
);
9861 return isl_map_free(map
);
9865 for (i
= 0; i
< n
; ++i
) {
9866 isl_basic_map
*bmap
;
9868 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
9869 bmap
= isl_basic_map_order_divs(bmap
);
9870 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
9871 isl_basic_map_free(bmap
);
9874 return isl_map_free(map
);
9876 return isl_map_align_divs_internal(map
);
9879 /* Align the divs of each element of "list" to those of "bmap".
9880 * Both "bmap" and the elements of "list" are assumed to have known divs.
9882 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
9883 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
9888 n
= isl_basic_map_list_n_basic_map(list
);
9890 return isl_basic_map_list_free(list
);
9892 for (i
= 0; i
< n
; ++i
) {
9893 isl_basic_map
*bmap_i
;
9895 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9896 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
9897 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
9903 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9904 __isl_take isl_map
*map
)
9908 isl_map_align_params_set(&map
, &set
);
9909 ok
= isl_map_compatible_domain(map
, set
);
9913 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9914 "incompatible spaces", goto error
);
9915 map
= isl_map_intersect_domain(map
, set
);
9916 set
= isl_map_range(map
);
9924 /* There is no need to cow as removing empty parts doesn't change
9925 * the meaning of the set.
9927 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9934 for (i
= map
->n
- 1; i
>= 0; --i
)
9935 map
= remove_if_empty(map
, i
);
9940 __isl_give isl_set
*isl_set_remove_empty_parts(__isl_take isl_set
*set
)
9942 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9945 /* Create a binary relation that maps the shared initial "pos" dimensions
9946 * of "bset1" and "bset2" to the remaining dimensions of "bset1" and "bset2".
9948 static __isl_give isl_basic_map
*join_initial(__isl_keep isl_basic_set
*bset1
,
9949 __isl_keep isl_basic_set
*bset2
, int pos
)
9951 isl_basic_map
*bmap1
;
9952 isl_basic_map
*bmap2
;
9954 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9955 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9956 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9957 isl_dim_out
, 0, pos
);
9958 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9959 isl_dim_out
, 0, pos
);
9960 return isl_basic_map_range_product(bmap1
, bmap2
);
9963 /* Given two basic sets bset1 and bset2, compute the maximal difference
9964 * between the values of dimension pos in bset1 and those in bset2
9965 * for any common value of the parameters and dimensions preceding pos.
9967 static enum isl_lp_result
basic_set_maximal_difference_at(
9968 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9969 int pos
, isl_int
*opt
)
9971 isl_basic_map
*bmap1
;
9972 struct isl_ctx
*ctx
;
9973 struct isl_vec
*obj
;
9977 enum isl_lp_result res
;
9979 nparam
= isl_basic_set_dim(bset1
, isl_dim_param
);
9980 dim1
= isl_basic_set_dim(bset1
, isl_dim_set
);
9981 if (nparam
< 0 || dim1
< 0 || !bset2
)
9982 return isl_lp_error
;
9984 bmap1
= join_initial(bset1
, bset2
, pos
);
9985 total
= isl_basic_map_dim(bmap1
, isl_dim_all
);
9987 return isl_lp_error
;
9990 obj
= isl_vec_alloc(ctx
, 1 + total
);
9993 isl_seq_clr(obj
->block
.data
, 1 + total
);
9994 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9995 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9996 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9998 isl_basic_map_free(bmap1
);
10002 isl_basic_map_free(bmap1
);
10003 return isl_lp_error
;
10006 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
10007 * for any common value of the parameters and dimensions preceding pos
10008 * in both basic sets, the values of dimension pos in bset1 are
10009 * smaller or larger than those in bset2.
10012 * 1 if bset1 follows bset2
10013 * -1 if bset1 precedes bset2
10014 * 0 if bset1 and bset2 are incomparable
10015 * -2 if some error occurred.
10017 int isl_basic_set_compare_at(__isl_keep isl_basic_set
*bset1
,
10018 __isl_keep isl_basic_set
*bset2
, int pos
)
10021 enum isl_lp_result res
;
10026 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
10028 if (res
== isl_lp_empty
)
10030 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
10031 res
== isl_lp_unbounded
)
10033 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
10038 isl_int_clear(opt
);
10042 /* Given two basic sets bset1 and bset2, check whether
10043 * for any common value of the parameters and dimensions preceding pos
10044 * there is a value of dimension pos in bset1 that is larger
10045 * than a value of the same dimension in bset2.
10048 * 1 if there exists such a pair
10049 * 0 if there is no such pair, but there is a pair of equal values
10051 * -2 if some error occurred.
10053 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
10054 __isl_keep isl_basic_set
*bset2
, int pos
)
10057 isl_basic_map
*bmap
;
10060 dim1
= isl_basic_set_dim(bset1
, isl_dim_set
);
10063 bmap
= join_initial(bset1
, bset2
, pos
);
10064 bmap
= isl_basic_map_order_ge(bmap
, isl_dim_out
, 0,
10065 isl_dim_out
, dim1
- pos
);
10066 empty
= isl_basic_map_is_empty(bmap
);
10070 isl_basic_map_free(bmap
);
10073 bmap
= isl_basic_map_order_gt(bmap
, isl_dim_out
, 0,
10074 isl_dim_out
, dim1
- pos
);
10075 empty
= isl_basic_map_is_empty(bmap
);
10078 isl_basic_map_free(bmap
);
10083 isl_basic_map_free(bmap
);
10087 /* Given two sets set1 and set2, check whether
10088 * for any common value of the parameters and dimensions preceding pos
10089 * there is a value of dimension pos in set1 that is larger
10090 * than a value of the same dimension in set2.
10093 * 1 if there exists such a pair
10094 * 0 if there is no such pair, but there is a pair of equal values
10096 * -2 if some error occurred.
10098 int isl_set_follows_at(__isl_keep isl_set
*set1
,
10099 __isl_keep isl_set
*set2
, int pos
)
10104 if (!set1
|| !set2
)
10107 for (i
= 0; i
< set1
->n
; ++i
)
10108 for (j
= 0; j
< set2
->n
; ++j
) {
10110 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
10111 if (f
== 1 || f
== -2)
10120 static isl_bool
isl_basic_map_plain_has_fixed_var(
10121 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
10127 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
10129 return isl_bool_error
;
10130 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
10131 for (; d
+1 > pos
; --d
)
10132 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
10136 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
10137 return isl_bool_false
;
10138 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
10139 return isl_bool_false
;
10140 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
10141 return isl_bool_false
;
10143 isl_int_neg(*val
, bmap
->eq
[i
][0]);
10144 return isl_bool_true
;
10146 return isl_bool_false
;
10149 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
10150 unsigned pos
, isl_int
*val
)
10158 return isl_bool_error
;
10160 return isl_bool_false
;
10162 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
10165 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
10166 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
10167 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
10168 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
10169 fixed
= isl_bool_false
;
10172 isl_int_set(*val
, v
);
10173 isl_int_clear(tmp
);
10178 static isl_bool
isl_basic_set_plain_has_fixed_var(
10179 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
10181 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
10185 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
10186 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
10188 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10189 return isl_bool_error
;
10190 return isl_basic_map_plain_has_fixed_var(bmap
,
10191 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
10194 /* If "bmap" obviously lies on a hyperplane where the given dimension
10195 * has a fixed value, then return that value.
10196 * Otherwise return NaN.
10198 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
10199 __isl_keep isl_basic_map
*bmap
,
10200 enum isl_dim_type type
, unsigned pos
)
10208 ctx
= isl_basic_map_get_ctx(bmap
);
10209 v
= isl_val_alloc(ctx
);
10212 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
10214 return isl_val_free(v
);
10216 isl_int_set_si(v
->d
, 1);
10220 return isl_val_nan(ctx
);
10223 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
10224 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
10226 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
10227 return isl_bool_error
;
10228 return isl_map_plain_has_fixed_var(map
,
10229 map_offset(map
, type
) - 1 + pos
, val
);
10232 /* If "map" obviously lies on a hyperplane where the given dimension
10233 * has a fixed value, then return that value.
10234 * Otherwise return NaN.
10236 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
10237 enum isl_dim_type type
, unsigned pos
)
10245 ctx
= isl_map_get_ctx(map
);
10246 v
= isl_val_alloc(ctx
);
10249 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
10251 return isl_val_free(v
);
10253 isl_int_set_si(v
->d
, 1);
10257 return isl_val_nan(ctx
);
10260 /* If "set" obviously lies on a hyperplane where the given dimension
10261 * has a fixed value, then return that value.
10262 * Otherwise return NaN.
10264 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
10265 enum isl_dim_type type
, unsigned pos
)
10267 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
10270 /* Return a sequence of values in the same space as "set"
10271 * that are equal to the corresponding set dimensions of "set"
10272 * for those set dimensions that obviously lie on a hyperplane
10273 * where the dimension has a fixed value.
10274 * The other elements are set to NaN.
10276 __isl_give isl_multi_val
*isl_set_get_plain_multi_val_if_fixed(
10277 __isl_keep isl_set
*set
)
10284 space
= isl_space_drop_all_params(isl_set_get_space(set
));
10285 mv
= isl_multi_val_alloc(space
);
10286 n
= isl_multi_val_size(mv
);
10288 return isl_multi_val_free(mv
);
10290 for (i
= 0; i
< n
; ++i
) {
10293 v
= isl_set_plain_get_val_if_fixed(set
, isl_dim_set
, i
);
10294 mv
= isl_multi_val_set_val(mv
, i
, v
);
10300 /* Check if dimension dim has fixed value and if so and if val is not NULL,
10301 * then return this fixed value in *val.
10303 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
10304 unsigned dim
, isl_int
*val
)
10308 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
10310 return isl_bool_error
;
10311 return isl_basic_set_plain_has_fixed_var(bset
, nparam
+ dim
, val
);
10314 /* Return -1 if the constraint "c1" should be sorted before "c2"
10315 * and 1 if it should be sorted after "c2".
10316 * Return 0 if the two constraints are the same (up to the constant term).
10318 * In particular, if a constraint involves later variables than another
10319 * then it is sorted after this other constraint.
10320 * uset_gist depends on constraints without existentially quantified
10321 * variables sorting first.
10323 * For constraints that have the same latest variable, those
10324 * with the same coefficient for this latest variable (first in absolute value
10325 * and then in actual value) are grouped together.
10326 * This is useful for detecting pairs of constraints that can
10327 * be chained in their printed representation.
10329 * Finally, within a group, constraints are sorted according to
10330 * their coefficients (excluding the constant term).
10332 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
10334 isl_int
**c1
= (isl_int
**) p1
;
10335 isl_int
**c2
= (isl_int
**) p2
;
10337 unsigned size
= *(unsigned *) arg
;
10340 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
10341 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
10346 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
10349 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
10353 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
10356 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
10357 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
10358 * and 0 if the two constraints are the same (up to the constant term).
10360 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
10361 isl_int
*c1
, isl_int
*c2
)
10366 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
10370 return sort_constraint_cmp(&c1
, &c2
, &size
);
10373 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
10374 __isl_take isl_basic_map
*bmap
)
10381 if (bmap
->n_ineq
== 0)
10383 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_SORTED
))
10385 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
10387 return isl_basic_map_free(bmap
);
10389 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
10390 &sort_constraint_cmp
, &size
) < 0)
10391 return isl_basic_map_free(bmap
);
10392 ISL_F_SET(bmap
, ISL_BASIC_MAP_SORTED
);
10396 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
10397 __isl_take isl_basic_set
*bset
)
10399 isl_basic_map
*bmap
= bset_to_bmap(bset
);
10400 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
10403 __isl_give isl_basic_map
*isl_basic_map_normalize(
10404 __isl_take isl_basic_map
*bmap
)
10406 bmap
= isl_basic_map_remove_redundancies(bmap
);
10407 bmap
= isl_basic_map_sort_constraints(bmap
);
10410 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
10411 __isl_keep isl_basic_map
*bmap2
)
10415 isl_space
*space1
, *space2
;
10417 if (!bmap1
|| !bmap2
)
10420 if (bmap1
== bmap2
)
10422 space1
= isl_basic_map_peek_space(bmap1
);
10423 space2
= isl_basic_map_peek_space(bmap2
);
10424 cmp
= isl_space_cmp(space1
, space2
);
10427 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
10428 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
10429 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
10430 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
10431 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
10433 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
10435 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
10437 if (bmap1
->n_eq
!= bmap2
->n_eq
)
10438 return bmap1
->n_eq
- bmap2
->n_eq
;
10439 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
10440 return bmap1
->n_ineq
- bmap2
->n_ineq
;
10441 if (bmap1
->n_div
!= bmap2
->n_div
)
10442 return bmap1
->n_div
- bmap2
->n_div
;
10443 total
= isl_basic_map_dim(bmap1
, isl_dim_all
);
10446 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
10447 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
10451 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
10452 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
10456 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
10457 isl_bool unknown1
, unknown2
;
10459 unknown1
= isl_basic_map_div_is_marked_unknown(bmap1
, i
);
10460 unknown2
= isl_basic_map_div_is_marked_unknown(bmap2
, i
);
10461 if (unknown1
< 0 || unknown2
< 0)
10463 if (unknown1
&& unknown2
)
10469 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
10476 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
10477 __isl_keep isl_basic_set
*bset2
)
10479 return isl_basic_map_plain_cmp(bset1
, bset2
);
10482 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
10488 if (set1
->n
!= set2
->n
)
10489 return set1
->n
- set2
->n
;
10491 for (i
= 0; i
< set1
->n
; ++i
) {
10492 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
10500 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
10501 __isl_keep isl_basic_map
*bmap2
)
10503 if (!bmap1
|| !bmap2
)
10504 return isl_bool_error
;
10505 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
10508 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
10509 __isl_keep isl_basic_set
*bset2
)
10511 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
10512 bset_to_bmap(bset2
));
10515 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
10517 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
10518 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
10520 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
10523 /* Sort the basic maps of "map" and remove duplicate basic maps.
10525 * While removing basic maps, we make sure that the basic maps remain
10526 * sorted because isl_map_normalize expects the basic maps of the result
10529 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
10533 map
= isl_map_remove_empty_parts(map
);
10536 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
10537 for (i
= map
->n
- 1; i
>= 1; --i
) {
10538 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
10540 isl_basic_map_free(map
->p
[i
-1]);
10541 for (j
= i
; j
< map
->n
; ++j
)
10542 map
->p
[j
- 1] = map
->p
[j
];
10549 /* Remove obvious duplicates among the basic maps of "map".
10551 * Unlike isl_map_normalize, this function does not remove redundant
10552 * constraints and only removes duplicates that have exactly the same
10553 * constraints in the input. It does sort the constraints and
10554 * the basic maps to ease the detection of duplicates.
10556 * If "map" has already been normalized or if the basic maps are
10557 * disjoint, then there can be no duplicates.
10559 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
10562 isl_basic_map
*bmap
;
10568 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
10570 for (i
= 0; i
< map
->n
; ++i
) {
10571 bmap
= isl_basic_map_copy(map
->p
[i
]);
10572 bmap
= isl_basic_map_sort_constraints(bmap
);
10574 return isl_map_free(map
);
10575 isl_basic_map_free(map
->p
[i
]);
10579 map
= sort_and_remove_duplicates(map
);
10583 /* We normalize in place, but if anything goes wrong we need
10584 * to return NULL, so we need to make sure we don't change the
10585 * meaning of any possible other copies of map.
10587 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
10590 struct isl_basic_map
*bmap
;
10594 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
10596 for (i
= 0; i
< map
->n
; ++i
) {
10597 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
10600 isl_basic_map_free(map
->p
[i
]);
10604 map
= sort_and_remove_duplicates(map
);
10606 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
10613 __isl_give isl_set
*isl_set_normalize(__isl_take isl_set
*set
)
10615 return set_from_map(isl_map_normalize(set_to_map(set
)));
10618 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
10619 __isl_keep isl_map
*map2
)
10624 if (!map1
|| !map2
)
10625 return isl_bool_error
;
10628 return isl_bool_true
;
10629 equal
= isl_map_has_equal_space(map1
, map2
);
10630 if (equal
< 0 || !equal
)
10633 map1
= isl_map_copy(map1
);
10634 map2
= isl_map_copy(map2
);
10635 map1
= isl_map_normalize(map1
);
10636 map2
= isl_map_normalize(map2
);
10637 if (!map1
|| !map2
)
10639 equal
= map1
->n
== map2
->n
;
10640 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
10641 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
10645 isl_map_free(map1
);
10646 isl_map_free(map2
);
10649 isl_map_free(map1
);
10650 isl_map_free(map2
);
10651 return isl_bool_error
;
10654 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
10655 __isl_keep isl_set
*set2
)
10657 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
10660 /* Return the basic maps in "map" as a list.
10662 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
10663 __isl_keep isl_map
*map
)
10667 isl_basic_map_list
*list
;
10671 ctx
= isl_map_get_ctx(map
);
10672 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
10674 for (i
= 0; i
< map
->n
; ++i
) {
10675 isl_basic_map
*bmap
;
10677 bmap
= isl_basic_map_copy(map
->p
[i
]);
10678 list
= isl_basic_map_list_add(list
, bmap
);
10684 /* Return the intersection of the elements in the non-empty list "list".
10685 * All elements are assumed to live in the same space.
10687 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
10688 __isl_take isl_basic_map_list
*list
)
10692 isl_basic_map
*bmap
;
10694 n
= isl_basic_map_list_n_basic_map(list
);
10698 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
10699 "expecting non-empty list", goto error
);
10701 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
10702 for (i
= 1; i
< n
; ++i
) {
10703 isl_basic_map
*bmap_i
;
10705 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
10706 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
10709 isl_basic_map_list_free(list
);
10712 isl_basic_map_list_free(list
);
10716 /* Return the intersection of the elements in the non-empty list "list".
10717 * All elements are assumed to live in the same space.
10719 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
10720 __isl_take isl_basic_set_list
*list
)
10722 return isl_basic_map_list_intersect(list
);
10725 /* Return the union of the elements of "list".
10726 * The list is required to have at least one element.
10728 __isl_give isl_set
*isl_basic_set_list_union(
10729 __isl_take isl_basic_set_list
*list
)
10734 isl_basic_set
*bset
;
10737 n
= isl_basic_set_list_n_basic_set(list
);
10741 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
10742 "expecting non-empty list", goto error
);
10744 bset
= isl_basic_set_list_get_basic_set(list
, 0);
10745 space
= isl_basic_set_get_space(bset
);
10746 isl_basic_set_free(bset
);
10748 set
= isl_set_alloc_space(space
, n
, 0);
10749 for (i
= 0; i
< n
; ++i
) {
10750 bset
= isl_basic_set_list_get_basic_set(list
, i
);
10751 set
= isl_set_add_basic_set(set
, bset
);
10754 isl_basic_set_list_free(list
);
10757 isl_basic_set_list_free(list
);
10761 /* Return the union of the elements in the non-empty list "list".
10762 * All elements are assumed to live in the same space.
10764 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
10770 n
= isl_set_list_n_set(list
);
10774 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
10775 "expecting non-empty list", goto error
);
10777 set
= isl_set_list_get_set(list
, 0);
10778 for (i
= 1; i
< n
; ++i
) {
10781 set_i
= isl_set_list_get_set(list
, i
);
10782 set
= isl_set_union(set
, set_i
);
10785 isl_set_list_free(list
);
10788 isl_set_list_free(list
);
10792 __isl_give isl_basic_map
*isl_basic_map_product(
10793 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10795 isl_space
*space_result
= NULL
;
10796 struct isl_basic_map
*bmap
;
10797 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
10798 struct isl_dim_map
*dim_map1
, *dim_map2
;
10800 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
10802 space_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
10803 isl_space_copy(bmap2
->dim
));
10805 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10806 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
10807 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10808 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
10809 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10811 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
10812 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10813 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10814 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10815 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10816 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10817 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
10818 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
10819 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10820 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10821 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10823 bmap
= isl_basic_map_alloc_space(space_result
,
10824 bmap1
->n_div
+ bmap2
->n_div
,
10825 bmap1
->n_eq
+ bmap2
->n_eq
,
10826 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10827 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10828 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10829 bmap
= isl_basic_map_simplify(bmap
);
10830 return isl_basic_map_finalize(bmap
);
10832 isl_basic_map_free(bmap1
);
10833 isl_basic_map_free(bmap2
);
10837 __isl_give isl_basic_map
*isl_basic_map_flat_product(
10838 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10840 isl_basic_map
*prod
;
10842 prod
= isl_basic_map_product(bmap1
, bmap2
);
10843 prod
= isl_basic_map_flatten(prod
);
10847 __isl_give isl_basic_set
*isl_basic_set_flat_product(
10848 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
10850 return isl_basic_map_flat_range_product(bset1
, bset2
);
10853 __isl_give isl_basic_map
*isl_basic_map_domain_product(
10854 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10856 isl_space
*space1
, *space2
;
10857 isl_space
*space_result
= NULL
;
10858 isl_basic_map
*bmap
;
10859 isl_size in1
, in2
, out
, nparam
;
10860 unsigned total
, pos
;
10861 struct isl_dim_map
*dim_map1
, *dim_map2
;
10863 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10864 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
10865 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10866 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10867 if (in1
< 0 || in2
< 0 || out
< 0 || nparam
< 0)
10870 space1
= isl_basic_map_get_space(bmap1
);
10871 space2
= isl_basic_map_get_space(bmap2
);
10872 space_result
= isl_space_domain_product(space1
, space2
);
10874 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
10875 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10876 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10877 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10878 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10879 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10880 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
10881 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
10882 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
10883 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
10884 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10886 bmap
= isl_basic_map_alloc_space(space_result
,
10887 bmap1
->n_div
+ bmap2
->n_div
,
10888 bmap1
->n_eq
+ bmap2
->n_eq
,
10889 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10890 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10891 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10892 bmap
= isl_basic_map_simplify(bmap
);
10893 return isl_basic_map_finalize(bmap
);
10895 isl_basic_map_free(bmap1
);
10896 isl_basic_map_free(bmap2
);
10900 __isl_give isl_basic_map
*isl_basic_map_range_product(
10901 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10904 isl_space
*space_result
= NULL
;
10905 isl_basic_map
*bmap
;
10906 isl_size in
, out1
, out2
, nparam
;
10907 unsigned total
, pos
;
10908 struct isl_dim_map
*dim_map1
, *dim_map2
;
10910 rational
= isl_basic_map_is_rational(bmap1
);
10911 if (rational
>= 0 && rational
)
10912 rational
= isl_basic_map_is_rational(bmap2
);
10913 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10914 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10915 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
10916 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10917 if (in
< 0 || out1
< 0 || out2
< 0 || nparam
< 0 || rational
< 0)
10920 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
10923 space_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
10924 isl_space_copy(bmap2
->dim
));
10926 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
10927 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10928 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10929 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10930 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10931 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10932 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
10933 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
10934 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10935 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10936 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10938 bmap
= isl_basic_map_alloc_space(space_result
,
10939 bmap1
->n_div
+ bmap2
->n_div
,
10940 bmap1
->n_eq
+ bmap2
->n_eq
,
10941 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10942 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10943 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10945 bmap
= isl_basic_map_set_rational(bmap
);
10946 bmap
= isl_basic_map_simplify(bmap
);
10947 return isl_basic_map_finalize(bmap
);
10949 isl_basic_map_free(bmap1
);
10950 isl_basic_map_free(bmap2
);
10954 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
10955 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10957 isl_basic_map
*prod
;
10959 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10960 prod
= isl_basic_map_flatten_range(prod
);
10964 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10965 * and collect the results.
10966 * The result live in the space obtained by calling "space_product"
10967 * on the spaces of "map1" and "map2".
10968 * If "remove_duplicates" is set then the result may contain duplicates
10969 * (even if the inputs do not) and so we try and remove the obvious
10972 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10973 __isl_take isl_map
*map2
,
10974 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10975 __isl_take isl_space
*right
),
10976 __isl_give isl_basic_map
*(*basic_map_product
)(
10977 __isl_take isl_basic_map
*left
,
10978 __isl_take isl_basic_map
*right
),
10979 int remove_duplicates
)
10981 unsigned flags
= 0;
10982 struct isl_map
*result
;
10986 m
= isl_map_has_equal_params(map1
, map2
);
10990 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10991 "parameters don't match", goto error
);
10993 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10994 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10995 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10997 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10998 isl_space_copy(map2
->dim
)),
10999 map1
->n
* map2
->n
, flags
);
11002 for (i
= 0; i
< map1
->n
; ++i
)
11003 for (j
= 0; j
< map2
->n
; ++j
) {
11004 struct isl_basic_map
*part
;
11005 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
11006 isl_basic_map_copy(map2
->p
[j
]));
11007 if (isl_basic_map_is_empty(part
))
11008 isl_basic_map_free(part
);
11010 result
= isl_map_add_basic_map(result
, part
);
11014 if (remove_duplicates
)
11015 result
= isl_map_remove_obvious_duplicates(result
);
11016 isl_map_free(map1
);
11017 isl_map_free(map2
);
11020 isl_map_free(map1
);
11021 isl_map_free(map2
);
11025 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
11027 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
11028 __isl_take isl_map
*map2
)
11030 isl_map_align_params_bin(&map1
, &map2
);
11031 return map_product(map1
, map2
, &isl_space_product
,
11032 &isl_basic_map_product
, 0);
11035 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
11037 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
11038 __isl_take isl_map
*map2
)
11042 prod
= isl_map_product(map1
, map2
);
11043 prod
= isl_map_flatten(prod
);
11047 /* Given two set A and B, construct its Cartesian product A x B.
11049 __isl_give isl_set
*isl_set_product(__isl_take isl_set
*set1
,
11050 __isl_take isl_set
*set2
)
11052 return isl_map_range_product(set1
, set2
);
11055 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
11056 __isl_take isl_set
*set2
)
11058 return isl_map_flat_range_product(set1
, set2
);
11061 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
11063 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
11064 __isl_take isl_map
*map2
)
11066 isl_map_align_params_bin(&map1
, &map2
);
11067 return map_product(map1
, map2
, &isl_space_domain_product
,
11068 &isl_basic_map_domain_product
, 1);
11071 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
11073 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
11074 __isl_take isl_map
*map2
)
11076 isl_map_align_params_bin(&map1
, &map2
);
11077 return map_product(map1
, map2
, &isl_space_range_product
,
11078 &isl_basic_map_range_product
, 1);
11081 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
11083 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
11086 isl_size total1
, keep1
, total2
, keep2
;
11088 total1
= isl_map_dim(map
, isl_dim_in
);
11089 total2
= isl_map_dim(map
, isl_dim_out
);
11090 if (total1
< 0 || total2
< 0)
11091 return isl_map_free(map
);
11092 if (!isl_space_domain_is_wrapping(map
->dim
) ||
11093 !isl_space_range_is_wrapping(map
->dim
))
11094 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11095 "not a product", return isl_map_free(map
));
11097 space
= isl_map_get_space(map
);
11098 space
= isl_space_factor_domain(space
);
11099 keep1
= isl_space_dim(space
, isl_dim_in
);
11100 keep2
= isl_space_dim(space
, isl_dim_out
);
11101 if (keep1
< 0 || keep2
< 0)
11102 map
= isl_map_free(map
);
11103 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
11104 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
11105 map
= isl_map_reset_space(map
, space
);
11110 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
11112 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
11115 isl_size total1
, keep1
, total2
, keep2
;
11117 total1
= isl_map_dim(map
, isl_dim_in
);
11118 total2
= isl_map_dim(map
, isl_dim_out
);
11119 if (total1
< 0 || total2
< 0)
11120 return isl_map_free(map
);
11121 if (!isl_space_domain_is_wrapping(map
->dim
) ||
11122 !isl_space_range_is_wrapping(map
->dim
))
11123 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11124 "not a product", return isl_map_free(map
));
11126 space
= isl_map_get_space(map
);
11127 space
= isl_space_factor_range(space
);
11128 keep1
= isl_space_dim(space
, isl_dim_in
);
11129 keep2
= isl_space_dim(space
, isl_dim_out
);
11130 if (keep1
< 0 || keep2
< 0)
11131 map
= isl_map_free(map
);
11132 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
11133 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
11134 map
= isl_map_reset_space(map
, space
);
11139 /* Given a map of the form [A -> B] -> C, return the map A -> C.
11141 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
11144 isl_size total
, keep
;
11146 total
= isl_map_dim(map
, isl_dim_in
);
11148 return isl_map_free(map
);
11149 if (!isl_space_domain_is_wrapping(map
->dim
))
11150 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11151 "domain is not a product", return isl_map_free(map
));
11153 space
= isl_map_get_space(map
);
11154 space
= isl_space_domain_factor_domain(space
);
11155 keep
= isl_space_dim(space
, isl_dim_in
);
11157 map
= isl_map_free(map
);
11158 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
11159 map
= isl_map_reset_space(map
, space
);
11164 /* Given a map of the form [A -> B] -> C, return the map B -> C.
11166 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
11169 isl_size total
, keep
;
11171 total
= isl_map_dim(map
, isl_dim_in
);
11173 return isl_map_free(map
);
11174 if (!isl_space_domain_is_wrapping(map
->dim
))
11175 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11176 "domain is not a product", return isl_map_free(map
));
11178 space
= isl_map_get_space(map
);
11179 space
= isl_space_domain_factor_range(space
);
11180 keep
= isl_space_dim(space
, isl_dim_in
);
11182 map
= isl_map_free(map
);
11183 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
11184 map
= isl_map_reset_space(map
, space
);
11189 /* Given a map A -> [B -> C], extract the map A -> B.
11191 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
11194 isl_size total
, keep
;
11196 total
= isl_map_dim(map
, isl_dim_out
);
11198 return isl_map_free(map
);
11199 if (!isl_space_range_is_wrapping(map
->dim
))
11200 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11201 "range is not a product", return isl_map_free(map
));
11203 space
= isl_map_get_space(map
);
11204 space
= isl_space_range_factor_domain(space
);
11205 keep
= isl_space_dim(space
, isl_dim_out
);
11207 map
= isl_map_free(map
);
11208 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
11209 map
= isl_map_reset_space(map
, space
);
11214 /* Given a map A -> [B -> C], extract the map A -> C.
11216 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
11219 isl_size total
, keep
;
11221 total
= isl_map_dim(map
, isl_dim_out
);
11223 return isl_map_free(map
);
11224 if (!isl_space_range_is_wrapping(map
->dim
))
11225 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11226 "range is not a product", return isl_map_free(map
));
11228 space
= isl_map_get_space(map
);
11229 space
= isl_space_range_factor_range(space
);
11230 keep
= isl_space_dim(space
, isl_dim_out
);
11232 map
= isl_map_free(map
);
11233 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
11234 map
= isl_map_reset_space(map
, space
);
11239 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
11241 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
11242 __isl_take isl_map
*map2
)
11246 prod
= isl_map_domain_product(map1
, map2
);
11247 prod
= isl_map_flatten_domain(prod
);
11251 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
11253 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
11254 __isl_take isl_map
*map2
)
11258 prod
= isl_map_range_product(map1
, map2
);
11259 prod
= isl_map_flatten_range(prod
);
11263 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
11266 uint32_t hash
= isl_hash_init();
11271 bmap
= isl_basic_map_copy(bmap
);
11272 bmap
= isl_basic_map_normalize(bmap
);
11273 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
11276 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
11277 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
11279 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
11280 isl_hash_hash(hash
, c_hash
);
11282 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
11283 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
11285 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
11286 isl_hash_hash(hash
, c_hash
);
11288 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
11289 for (i
= 0; i
< bmap
->n_div
; ++i
) {
11291 if (isl_int_is_zero(bmap
->div
[i
][0]))
11293 isl_hash_byte(hash
, i
& 0xFF);
11294 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
11295 isl_hash_hash(hash
, c_hash
);
11297 isl_basic_map_free(bmap
);
11301 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
11303 return isl_basic_map_get_hash(bset_to_bmap(bset
));
11306 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
11313 map
= isl_map_copy(map
);
11314 map
= isl_map_normalize(map
);
11318 hash
= isl_hash_init();
11319 for (i
= 0; i
< map
->n
; ++i
) {
11320 uint32_t bmap_hash
;
11321 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
11322 isl_hash_hash(hash
, bmap_hash
);
11330 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
11332 return isl_map_get_hash(set_to_map(set
));
11335 /* Return the number of basic maps in the (current) representation of "map".
11337 isl_size
isl_map_n_basic_map(__isl_keep isl_map
*map
)
11339 return map
? map
->n
: isl_size_error
;
11342 isl_size
isl_set_n_basic_set(__isl_keep isl_set
*set
)
11344 return set
? set
->n
: isl_size_error
;
11347 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
11348 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
11353 return isl_stat_error
;
11355 for (i
= 0; i
< map
->n
; ++i
)
11356 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
11357 return isl_stat_error
;
11359 return isl_stat_ok
;
11362 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
11363 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
11368 return isl_stat_error
;
11370 for (i
= 0; i
< set
->n
; ++i
)
11371 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
11372 return isl_stat_error
;
11374 return isl_stat_ok
;
11377 /* Does "test" succeed on every basic set in "set"?
11379 isl_bool
isl_set_every_basic_set(__isl_keep isl_set
*set
,
11380 isl_bool (*test
)(__isl_keep isl_basic_set
*bset
, void *user
),
11386 return isl_bool_error
;
11388 for (i
= 0; i
< set
->n
; ++i
) {
11391 r
= test(set
->p
[i
], user
);
11396 return isl_bool_true
;
11399 /* Return a list of basic sets, the union of which is equal to "set".
11401 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
11402 __isl_keep isl_set
*set
)
11405 isl_basic_set_list
*list
;
11410 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
11411 for (i
= 0; i
< set
->n
; ++i
) {
11412 isl_basic_set
*bset
;
11414 bset
= isl_basic_set_copy(set
->p
[i
]);
11415 list
= isl_basic_set_list_add(list
, bset
);
11421 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
11428 bset
= isl_basic_set_cow(bset
);
11432 space
= isl_basic_set_get_space(bset
);
11433 space
= isl_space_lift(space
, bset
->n_div
);
11436 isl_space_free(bset
->dim
);
11438 bset
->extra
-= bset
->n_div
;
11441 bset
= isl_basic_set_finalize(bset
);
11445 isl_basic_set_free(bset
);
11449 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
11455 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
11460 set
= isl_set_cow(set
);
11464 n_div
= set
->p
[0]->n_div
;
11465 space
= isl_set_get_space(set
);
11466 space
= isl_space_lift(space
, n_div
);
11469 isl_space_free(set
->dim
);
11472 for (i
= 0; i
< set
->n
; ++i
) {
11473 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
11484 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
11489 dim
= isl_basic_set_dim(bset
, isl_dim_all
);
11492 size
+= bset
->n_eq
* (1 + dim
);
11493 size
+= bset
->n_ineq
* (1 + dim
);
11494 size
+= bset
->n_div
* (2 + dim
);
11499 int isl_set_size(__isl_keep isl_set
*set
)
11507 for (i
= 0; i
< set
->n
; ++i
)
11508 size
+= isl_basic_set_size(set
->p
[i
]);
11513 /* Check if there is any lower bound (if lower == 0) and/or upper
11514 * bound (if upper == 0) on the specified dim.
11516 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
11517 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
11521 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
11522 return isl_bool_error
;
11524 pos
+= isl_basic_map_offset(bmap
, type
);
11526 for (i
= 0; i
< bmap
->n_div
; ++i
) {
11527 if (isl_int_is_zero(bmap
->div
[i
][0]))
11529 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
11530 return isl_bool_true
;
11533 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11534 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
11535 return isl_bool_true
;
11537 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
11538 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
11545 return lower
&& upper
;
11548 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
11549 enum isl_dim_type type
, unsigned pos
)
11551 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
11554 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
11555 enum isl_dim_type type
, unsigned pos
)
11557 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
11560 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
11561 enum isl_dim_type type
, unsigned pos
)
11563 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
11566 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
11567 enum isl_dim_type type
, unsigned pos
)
11572 return isl_bool_error
;
11574 for (i
= 0; i
< map
->n
; ++i
) {
11576 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
11577 if (bounded
< 0 || !bounded
)
11581 return isl_bool_true
;
11584 /* Return true if the specified dim is involved in both an upper bound
11585 * and a lower bound.
11587 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
11588 enum isl_dim_type type
, unsigned pos
)
11590 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
11593 /* Does "map" have a bound (according to "fn") for any of its basic maps?
11595 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
11596 enum isl_dim_type type
, unsigned pos
,
11597 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
11598 enum isl_dim_type type
, unsigned pos
))
11603 return isl_bool_error
;
11605 for (i
= 0; i
< map
->n
; ++i
) {
11607 bounded
= fn(map
->p
[i
], type
, pos
);
11608 if (bounded
< 0 || bounded
)
11612 return isl_bool_false
;
11615 /* Return 1 if the specified dim is involved in any lower bound.
11617 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
11618 enum isl_dim_type type
, unsigned pos
)
11620 return has_any_bound(set
, type
, pos
,
11621 &isl_basic_map_dim_has_lower_bound
);
11624 /* Return 1 if the specified dim is involved in any upper bound.
11626 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
11627 enum isl_dim_type type
, unsigned pos
)
11629 return has_any_bound(set
, type
, pos
,
11630 &isl_basic_map_dim_has_upper_bound
);
11633 /* Does "map" have a bound (according to "fn") for all of its basic maps?
11635 static isl_bool
has_bound(__isl_keep isl_map
*map
,
11636 enum isl_dim_type type
, unsigned pos
,
11637 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
11638 enum isl_dim_type type
, unsigned pos
))
11643 return isl_bool_error
;
11645 for (i
= 0; i
< map
->n
; ++i
) {
11647 bounded
= fn(map
->p
[i
], type
, pos
);
11648 if (bounded
< 0 || !bounded
)
11652 return isl_bool_true
;
11655 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
11657 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
11658 enum isl_dim_type type
, unsigned pos
)
11660 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
11663 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
11665 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
11666 enum isl_dim_type type
, unsigned pos
)
11668 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
11671 /* For each of the "n" variables starting at "first", determine
11672 * the sign of the variable and put the results in the first "n"
11673 * elements of the array "signs".
11675 * 1 means that the variable is non-negative
11676 * -1 means that the variable is non-positive
11677 * 0 means the variable attains both positive and negative values.
11679 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
11680 unsigned first
, unsigned n
, int *signs
)
11682 isl_vec
*bound
= NULL
;
11683 struct isl_tab
*tab
= NULL
;
11684 struct isl_tab_undo
*snap
;
11688 total
= isl_basic_set_dim(bset
, isl_dim_all
);
11689 if (total
< 0 || !signs
)
11690 return isl_stat_error
;
11692 bound
= isl_vec_alloc(bset
->ctx
, 1 + total
);
11693 tab
= isl_tab_from_basic_set(bset
, 0);
11694 if (!bound
|| !tab
)
11697 isl_seq_clr(bound
->el
, bound
->size
);
11698 isl_int_set_si(bound
->el
[0], -1);
11700 snap
= isl_tab_snap(tab
);
11701 for (i
= 0; i
< n
; ++i
) {
11704 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
11705 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
11707 empty
= tab
->empty
;
11708 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
11709 if (isl_tab_rollback(tab
, snap
) < 0)
11717 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
11718 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
11720 empty
= tab
->empty
;
11721 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
11722 if (isl_tab_rollback(tab
, snap
) < 0)
11725 signs
[i
] = empty
? -1 : 0;
11729 isl_vec_free(bound
);
11730 return isl_stat_ok
;
11733 isl_vec_free(bound
);
11734 return isl_stat_error
;
11737 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
11738 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
11740 if (!bset
|| !signs
)
11741 return isl_stat_error
;
11742 if (isl_basic_set_check_range(bset
, type
, first
, n
) < 0)
11743 return isl_stat_error
;
11745 first
+= pos(bset
->dim
, type
) - 1;
11746 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
11749 /* Is it possible for the integer division "div" to depend (possibly
11750 * indirectly) on any output dimensions?
11752 * If the div is undefined, then we conservatively assume that it
11753 * may depend on them.
11754 * Otherwise, we check if it actually depends on them or on any integer
11755 * divisions that may depend on them.
11757 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
11760 isl_size n_out
, n_div
;
11761 unsigned o_out
, o_div
;
11763 if (isl_int_is_zero(bmap
->div
[div
][0]))
11764 return isl_bool_true
;
11766 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11768 return isl_bool_error
;
11769 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
11771 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
11772 return isl_bool_true
;
11774 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11776 return isl_bool_error
;
11777 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11779 for (i
= 0; i
< n_div
; ++i
) {
11780 isl_bool may_involve
;
11782 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
11784 may_involve
= div_may_involve_output(bmap
, i
);
11785 if (may_involve
< 0 || may_involve
)
11786 return may_involve
;
11789 return isl_bool_false
;
11792 /* Return the first integer division of "bmap" in the range
11793 * [first, first + n[ that may depend on any output dimensions and
11794 * that has a non-zero coefficient in "c" (where the first coefficient
11795 * in "c" corresponds to integer division "first").
11797 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
11798 isl_int
*c
, int first
, int n
)
11805 for (k
= first
; k
< first
+ n
; ++k
) {
11806 isl_bool may_involve
;
11808 if (isl_int_is_zero(c
[k
]))
11810 may_involve
= div_may_involve_output(bmap
, k
);
11811 if (may_involve
< 0)
11820 /* Look for a pair of inequality constraints in "bmap" of the form
11822 * -l + i >= 0 or i >= l
11824 * n + l - i >= 0 or i <= l + n
11826 * with n < "m" and i the output dimension at position "pos".
11827 * (Note that n >= 0 as otherwise the two constraints would conflict.)
11828 * Furthermore, "l" is only allowed to involve parameters, input dimensions
11829 * and earlier output dimensions, as well as integer divisions that do
11830 * not involve any of the output dimensions.
11832 * Return the index of the first inequality constraint or bmap->n_ineq
11833 * if no such pair can be found.
11835 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
11836 int pos
, isl_int m
)
11841 isl_size n_div
, n_out
;
11842 unsigned o_div
, o_out
;
11845 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
11846 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11847 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11848 if (total
< 0 || n_out
< 0 || n_div
< 0)
11851 ctx
= isl_basic_map_get_ctx(bmap
);
11852 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
11853 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11854 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
11855 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
11857 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
11858 n_out
- (pos
+ 1)) != -1)
11860 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
11863 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
11864 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
11867 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
11868 bmap
->ineq
[j
] + 1, total
))
11872 if (j
>= bmap
->n_ineq
)
11874 isl_int_add(bmap
->ineq
[i
][0],
11875 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
11876 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
11877 isl_int_sub(bmap
->ineq
[i
][0],
11878 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
11881 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
11887 return bmap
->n_ineq
;
11890 /* Return the index of the equality of "bmap" that defines
11891 * the output dimension "pos" in terms of earlier dimensions.
11892 * The equality may also involve integer divisions, as long
11893 * as those integer divisions are defined in terms of
11894 * parameters or input dimensions.
11895 * In this case, *div is set to the number of integer divisions and
11896 * *ineq is set to the number of inequality constraints (provided
11897 * div and ineq are not NULL).
11899 * The equality may also involve a single integer division involving
11900 * the output dimensions (typically only output dimension "pos") as
11901 * long as the coefficient of output dimension "pos" is 1 or -1 and
11902 * there is a pair of constraints i >= l and i <= l + n, with i referring
11903 * to output dimension "pos", l an expression involving only earlier
11904 * dimensions and n smaller than the coefficient of the integer division
11905 * in the equality. In this case, the output dimension can be defined
11906 * in terms of a modulo expression that does not involve the integer division.
11907 * *div is then set to this single integer division and
11908 * *ineq is set to the index of constraint i >= l.
11910 * Return bmap->n_eq if there is no such equality.
11911 * Return -1 on error.
11913 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
11914 int pos
, int *div
, int *ineq
)
11917 isl_size n_div
, n_out
;
11918 unsigned o_div
, o_out
;
11920 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11921 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11922 if (n_out
< 0 || n_div
< 0)
11925 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
11926 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11929 *ineq
= bmap
->n_ineq
;
11932 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
11933 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
11935 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
11936 n_out
- (pos
+ 1)) != -1)
11938 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11942 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
11943 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
11945 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11946 k
+ 1, n_div
- (k
+1)) < n_div
)
11948 l
= find_modulo_constraint_pair(bmap
, pos
,
11949 bmap
->eq
[j
][o_div
+ k
]);
11952 if (l
>= bmap
->n_ineq
)
11964 /* Check if the given basic map is obviously single-valued.
11965 * In particular, for each output dimension, check that there is
11966 * an equality that defines the output dimension in terms of
11967 * earlier dimensions.
11969 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11974 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11976 return isl_bool_error
;
11978 for (i
= 0; i
< n_out
; ++i
) {
11981 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11984 return isl_bool_error
;
11985 if (eq
>= bmap
->n_eq
)
11986 return isl_bool_false
;
11989 return isl_bool_true
;
11992 /* Check if the given basic map is single-valued.
11993 * We simply compute
11997 * and check if the result is a subset of the identity mapping.
11999 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
12002 isl_basic_map
*test
;
12006 sv
= isl_basic_map_plain_is_single_valued(bmap
);
12010 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
12011 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
12013 space
= isl_basic_map_get_space(bmap
);
12014 space
= isl_space_map_from_set(isl_space_range(space
));
12015 id
= isl_basic_map_identity(space
);
12017 sv
= isl_basic_map_is_subset(test
, id
);
12019 isl_basic_map_free(test
);
12020 isl_basic_map_free(id
);
12025 /* Check if the given map is obviously single-valued.
12027 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
12030 return isl_bool_error
;
12032 return isl_bool_true
;
12034 return isl_bool_false
;
12036 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
12039 /* Check if the given map is single-valued.
12040 * We simply compute
12044 * and check if the result is a subset of the identity mapping.
12046 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
12053 sv
= isl_map_plain_is_single_valued(map
);
12057 test
= isl_map_reverse(isl_map_copy(map
));
12058 test
= isl_map_apply_range(test
, isl_map_copy(map
));
12060 space
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
12061 id
= isl_map_identity(space
);
12063 sv
= isl_map_is_subset(test
, id
);
12065 isl_map_free(test
);
12071 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
12075 map
= isl_map_copy(map
);
12076 map
= isl_map_reverse(map
);
12077 in
= isl_map_is_single_valued(map
);
12083 /* Check if the given map is obviously injective.
12085 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
12089 map
= isl_map_copy(map
);
12090 map
= isl_map_reverse(map
);
12091 in
= isl_map_plain_is_single_valued(map
);
12097 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
12101 sv
= isl_map_is_single_valued(map
);
12105 return isl_map_is_injective(map
);
12108 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
12110 return isl_map_is_single_valued(set_to_map(set
));
12113 /* Does "map" only map elements to themselves?
12115 * If the domain and range spaces are different, then "map"
12116 * is considered not to be an identity relation, even if it is empty.
12117 * Otherwise, construct the maximal identity relation and
12118 * check whether "map" is a subset of this relation.
12120 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
12123 isl_bool equal
, is_identity
;
12125 equal
= isl_map_tuple_is_equal(map
, isl_dim_in
, map
, isl_dim_out
);
12126 if (equal
< 0 || !equal
)
12129 id
= isl_map_identity(isl_map_get_space(map
));
12130 is_identity
= isl_map_is_subset(map
, id
);
12133 return is_identity
;
12136 int isl_map_is_translation(__isl_keep isl_map
*map
)
12141 delta
= isl_map_deltas(isl_map_copy(map
));
12142 ok
= isl_set_is_singleton(delta
);
12143 isl_set_free(delta
);
12148 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
12150 if (isl_seq_first_non_zero(p
, pos
) != -1)
12152 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
12157 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
12160 isl_size nvar
, ovar
, n_div
;
12162 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
12164 return isl_bool_error
;
12166 return isl_bool_false
;
12168 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
12169 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
12170 if (nvar
< 0 || ovar
< 0)
12171 return isl_bool_error
;
12172 for (j
= 0; j
< nvar
; ++j
) {
12173 int lower
= 0, upper
= 0;
12174 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12175 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
12177 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
12178 return isl_bool_false
;
12181 if (i
< bset
->n_eq
)
12183 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12184 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
12186 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
12187 return isl_bool_false
;
12188 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
12193 if (!lower
|| !upper
)
12194 return isl_bool_false
;
12197 return isl_bool_true
;
12200 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
12203 return isl_bool_error
;
12205 return isl_bool_false
;
12207 return isl_basic_set_is_box(set
->p
[0]);
12210 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
12213 return isl_bool_error
;
12215 return isl_space_is_wrapping(bset
->dim
);
12218 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
12221 return isl_bool_error
;
12223 return isl_space_is_wrapping(set
->dim
);
12226 /* Modify the space of "map" through a call to "change".
12227 * If "can_change" is set (not NULL), then first call it to check
12228 * if the modification is allowed, printing the error message "cannot_change"
12231 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
12232 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
12233 const char *cannot_change
,
12234 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
12242 ok
= can_change
? can_change(map
) : isl_bool_true
;
12244 return isl_map_free(map
);
12246 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
12247 return isl_map_free(map
));
12249 space
= change(isl_map_get_space(map
));
12250 map
= isl_map_reset_space(map
, space
);
12255 /* Is the domain of "map" a wrapped relation?
12257 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
12260 return isl_bool_error
;
12262 return isl_space_domain_is_wrapping(map
->dim
);
12265 /* Does "map" have a wrapped relation in both domain and range?
12267 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
12269 return isl_space_is_product(isl_map_peek_space(map
));
12272 /* Is the range of "map" a wrapped relation?
12274 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
12277 return isl_bool_error
;
12279 return isl_space_range_is_wrapping(map
->dim
);
12282 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
12286 space
= isl_basic_map_take_space(bmap
);
12287 space
= isl_space_wrap(space
);
12288 bmap
= isl_basic_map_restore_space(bmap
, space
);
12290 bmap
= isl_basic_map_finalize(bmap
);
12292 return bset_from_bmap(bmap
);
12295 /* Given a map A -> B, return the set (A -> B).
12297 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
12299 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
12302 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
12304 bset
= isl_basic_set_cow(bset
);
12308 bset
->dim
= isl_space_unwrap(bset
->dim
);
12312 bset
= isl_basic_set_finalize(bset
);
12314 return bset_to_bmap(bset
);
12316 isl_basic_set_free(bset
);
12320 /* Given a set (A -> B), return the map A -> B.
12321 * Error out if "set" is not of the form (A -> B).
12323 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
12325 return isl_map_change_space(set
, &isl_set_is_wrapping
,
12326 "not a wrapping set", &isl_space_unwrap
);
12329 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
12330 enum isl_dim_type type
)
12334 space
= isl_basic_map_take_space(bmap
);
12335 space
= isl_space_reset(space
, type
);
12336 bmap
= isl_basic_map_restore_space(bmap
, space
);
12338 bmap
= isl_basic_map_mark_final(bmap
);
12343 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
12344 enum isl_dim_type type
)
12352 if (!isl_space_is_named_or_nested(map
->dim
, type
))
12355 map
= isl_map_cow(map
);
12359 for (i
= 0; i
< map
->n
; ++i
) {
12360 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
12365 space
= isl_map_take_space(map
);
12366 space
= isl_space_reset(space
, type
);
12367 map
= isl_map_restore_space(map
, space
);
12375 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
12379 space
= isl_basic_map_take_space(bmap
);
12380 space
= isl_space_flatten(space
);
12381 bmap
= isl_basic_map_restore_space(bmap
, space
);
12383 bmap
= isl_basic_map_mark_final(bmap
);
12388 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
12390 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
12393 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
12394 __isl_take isl_basic_map
*bmap
)
12398 space
= isl_basic_map_take_space(bmap
);
12399 space
= isl_space_flatten_domain(space
);
12400 bmap
= isl_basic_map_restore_space(bmap
, space
);
12402 bmap
= isl_basic_map_mark_final(bmap
);
12407 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
12408 __isl_take isl_basic_map
*bmap
)
12412 space
= isl_basic_map_take_space(bmap
);
12413 space
= isl_space_flatten_range(space
);
12414 bmap
= isl_basic_map_restore_space(bmap
, space
);
12416 bmap
= isl_basic_map_mark_final(bmap
);
12421 /* Remove any internal structure from the spaces of domain and range of "map".
12423 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
12428 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
12431 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
12434 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
12436 return set_from_map(isl_map_flatten(set_to_map(set
)));
12439 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
12441 isl_space
*space
, *flat_space
;
12444 space
= isl_set_get_space(set
);
12445 flat_space
= isl_space_flatten(isl_space_copy(space
));
12446 map
= isl_map_identity(isl_space_join(isl_space_reverse(space
),
12448 map
= isl_map_intersect_domain(map
, set
);
12453 /* Remove any internal structure from the space of the domain of "map".
12455 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
12460 if (!map
->dim
->nested
[0])
12463 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
12466 /* Remove any internal structure from the space of the range of "map".
12468 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
12473 if (!map
->dim
->nested
[1])
12476 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
12479 /* Reorder the dimensions of "bmap" according to the given dim_map
12480 * and set the dimension specification to "space" and
12481 * perform Gaussian elimination on the result.
12483 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
12484 __isl_take isl_space
*space
, __isl_take
struct isl_dim_map
*dim_map
)
12486 isl_basic_map
*res
;
12490 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
12491 if (n_div
< 0 || !space
|| !dim_map
)
12494 flags
= bmap
->flags
;
12495 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
12496 ISL_FL_CLR(flags
, ISL_BASIC_MAP_SORTED
);
12497 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
12498 res
= isl_basic_map_alloc_space(space
, n_div
, bmap
->n_eq
, bmap
->n_ineq
);
12499 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
12501 res
->flags
= flags
;
12502 res
= isl_basic_map_gauss(res
, NULL
);
12503 res
= isl_basic_map_finalize(res
);
12506 isl_dim_map_free(dim_map
);
12507 isl_basic_map_free(bmap
);
12508 isl_space_free(space
);
12512 /* Reorder the dimensions of "map" according to given reordering.
12514 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
12515 __isl_take isl_reordering
*r
)
12518 struct isl_dim_map
*dim_map
;
12520 map
= isl_map_cow(map
);
12521 dim_map
= isl_dim_map_from_reordering(r
);
12522 if (!map
|| !r
|| !dim_map
)
12525 for (i
= 0; i
< map
->n
; ++i
) {
12526 struct isl_dim_map
*dim_map_i
;
12529 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
12531 space
= isl_reordering_get_space(r
);
12532 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
], space
, dim_map_i
);
12538 map
= isl_map_reset_space(map
, isl_reordering_get_space(r
));
12539 map
= isl_map_unmark_normalized(map
);
12541 isl_reordering_free(r
);
12542 isl_dim_map_free(dim_map
);
12545 isl_dim_map_free(dim_map
);
12547 isl_reordering_free(r
);
12551 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
12552 __isl_take isl_reordering
*r
)
12554 return set_from_map(isl_map_realign(set_to_map(set
), r
));
12557 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
12558 __isl_take isl_space
*model
)
12563 if (!map
|| !model
)
12566 ctx
= isl_space_get_ctx(model
);
12567 if (!isl_space_has_named_params(model
))
12568 isl_die(ctx
, isl_error_invalid
,
12569 "model has unnamed parameters", goto error
);
12570 if (isl_map_check_named_params(map
) < 0)
12572 aligned
= isl_map_space_has_equal_params(map
, model
);
12577 isl_reordering
*exp
;
12579 space
= isl_map_peek_space(map
);
12580 exp
= isl_parameter_alignment_reordering(space
, model
);
12581 map
= isl_map_realign(map
, exp
);
12584 isl_space_free(model
);
12587 isl_space_free(model
);
12592 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
12593 __isl_take isl_space
*model
)
12595 return isl_map_align_params(set
, model
);
12598 /* Align the parameters of "bmap" to those of "model", introducing
12599 * additional parameters if needed.
12601 __isl_give isl_basic_map
*isl_basic_map_align_params(
12602 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
12605 isl_bool equal_params
;
12606 isl_space
*bmap_space
;
12608 if (!bmap
|| !model
)
12611 ctx
= isl_space_get_ctx(model
);
12612 if (!isl_space_has_named_params(model
))
12613 isl_die(ctx
, isl_error_invalid
,
12614 "model has unnamed parameters", goto error
);
12615 if (isl_basic_map_check_named_params(bmap
) < 0)
12617 bmap_space
= isl_basic_map_peek_space(bmap
);
12618 equal_params
= isl_space_has_equal_params(bmap_space
, model
);
12619 if (equal_params
< 0)
12621 if (!equal_params
) {
12622 isl_reordering
*exp
;
12623 struct isl_dim_map
*dim_map
;
12625 exp
= isl_parameter_alignment_reordering(bmap_space
, model
);
12626 dim_map
= isl_dim_map_from_reordering(exp
);
12627 bmap
= isl_basic_map_realign(bmap
,
12628 isl_reordering_get_space(exp
),
12629 isl_dim_map_extend(dim_map
, bmap
));
12630 isl_reordering_free(exp
);
12631 isl_dim_map_free(dim_map
);
12634 isl_space_free(model
);
12637 isl_space_free(model
);
12638 isl_basic_map_free(bmap
);
12642 /* Do "bset" and "space" have the same parameters?
12644 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
12645 __isl_keep isl_space
*space
)
12647 isl_space
*bset_space
;
12649 bset_space
= isl_basic_set_peek_space(bset
);
12650 return isl_space_has_equal_params(bset_space
, space
);
12653 /* Do "map" and "space" have the same parameters?
12655 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
12656 __isl_keep isl_space
*space
)
12658 isl_space
*map_space
;
12660 map_space
= isl_map_peek_space(map
);
12661 return isl_space_has_equal_params(map_space
, space
);
12664 /* Do "set" and "space" have the same parameters?
12666 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
12667 __isl_keep isl_space
*space
)
12669 return isl_map_space_has_equal_params(set_to_map(set
), space
);
12672 /* Align the parameters of "bset" to those of "model", introducing
12673 * additional parameters if needed.
12675 __isl_give isl_basic_set
*isl_basic_set_align_params(
12676 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
12678 return isl_basic_map_align_params(bset
, model
);
12682 #define TYPE isl_map
12683 #define isl_map_drop_dims isl_map_drop
12684 #include "isl_drop_unused_params_templ.c"
12686 /* Drop all parameters not referenced by "set".
12688 __isl_give isl_set
*isl_set_drop_unused_params(
12689 __isl_take isl_set
*set
)
12691 return set_from_map(isl_map_drop_unused_params(set_to_map(set
)));
12695 #define TYPE isl_basic_map
12696 #define isl_basic_map_drop_dims isl_basic_map_drop
12697 #include "isl_drop_unused_params_templ.c"
12699 /* Drop all parameters not referenced by "bset".
12701 __isl_give isl_basic_set
*isl_basic_set_drop_unused_params(
12702 __isl_take isl_basic_set
*bset
)
12704 return bset_from_bmap(isl_basic_map_drop_unused_params(
12705 bset_to_bmap(bset
)));
12708 /* Given a tuple of identifiers "tuple" in a space that corresponds
12709 * to that of "set", if any of those identifiers appear as parameters
12710 * in "set", then equate those parameters with the corresponding
12711 * set dimensions and project out the parameters.
12712 * The result therefore has no such parameters.
12714 static __isl_give isl_set
*equate_params(__isl_take isl_set
*set
,
12715 __isl_keep isl_multi_id
*tuple
)
12719 isl_space
*set_space
, *tuple_space
;
12721 set_space
= isl_set_peek_space(set
);
12722 tuple_space
= isl_multi_id_peek_space(tuple
);
12723 if (isl_space_check_equal_tuples(tuple_space
, set_space
) < 0)
12724 return isl_set_free(set
);
12725 n
= isl_multi_id_size(tuple
);
12727 return isl_set_free(set
);
12728 for (i
= 0; i
< n
; ++i
) {
12732 id
= isl_multi_id_get_at(tuple
, i
);
12734 return isl_set_free(set
);
12735 pos
= isl_set_find_dim_by_id(set
, isl_dim_param
, id
);
12739 set
= isl_set_equate(set
, isl_dim_param
, pos
, isl_dim_set
, i
);
12740 set
= isl_set_project_out(set
, isl_dim_param
, pos
, 1);
12745 /* Bind the set dimensions of "set" to parameters with identifiers
12746 * specified by "tuple", living in the same space as "set".
12748 * If no parameters with these identifiers appear in "set" already,
12749 * then the set dimensions are simply reinterpreted as parameters.
12750 * Otherwise, the parameters are first equated to the corresponding
12753 __isl_give isl_set
*isl_set_bind(__isl_take isl_set
*set
,
12754 __isl_take isl_multi_id
*tuple
)
12758 set
= equate_params(set
, tuple
);
12759 space
= isl_set_get_space(set
);
12760 space
= isl_space_bind_set(space
, tuple
);
12761 isl_multi_id_free(tuple
);
12762 set
= isl_set_reset_space(set
, space
);
12767 /* Given a tuple of identifiers "tuple" in a space that corresponds
12768 * to the domain of "map", if any of those identifiers appear as parameters
12769 * in "map", then equate those parameters with the corresponding
12770 * input dimensions and project out the parameters.
12771 * The result therefore has no such parameters.
12773 static __isl_give isl_map
*map_equate_params(__isl_take isl_map
*map
,
12774 __isl_keep isl_multi_id
*tuple
)
12778 isl_space
*map_space
, *tuple_space
;
12780 map_space
= isl_map_peek_space(map
);
12781 tuple_space
= isl_multi_id_peek_space(tuple
);
12782 if (isl_space_check_domain_tuples(tuple_space
, map_space
) < 0)
12783 return isl_map_free(map
);
12784 n
= isl_multi_id_size(tuple
);
12786 return isl_map_free(map
);
12787 for (i
= 0; i
< n
; ++i
) {
12791 id
= isl_multi_id_get_at(tuple
, i
);
12793 return isl_map_free(map
);
12794 pos
= isl_map_find_dim_by_id(map
, isl_dim_param
, id
);
12798 map
= isl_map_equate(map
, isl_dim_param
, pos
, isl_dim_in
, i
);
12799 map
= isl_map_project_out(map
, isl_dim_param
, pos
, 1);
12804 /* Bind the input dimensions of "map" to parameters with identifiers
12805 * specified by "tuple", living in the domain space of "map".
12807 * If no parameters with these identifiers appear in "map" already,
12808 * then the input dimensions are simply reinterpreted as parameters.
12809 * Otherwise, the parameters are first equated to the corresponding
12810 * input dimensions.
12812 __isl_give isl_set
*isl_map_bind_domain(__isl_take isl_map
*map
,
12813 __isl_take isl_multi_id
*tuple
)
12818 map
= map_equate_params(map
, tuple
);
12819 space
= isl_map_get_space(map
);
12820 space
= isl_space_bind_map_domain(space
, tuple
);
12821 isl_multi_id_free(tuple
);
12822 set
= set_from_map(isl_map_reset_space(map
, space
));
12827 /* Bind the output dimensions of "map" to parameters with identifiers
12828 * specified by "tuple", living in the range space of "map".
12830 * Since binding is more easily implemented on the domain,
12831 * bind the input dimensions of the inverse of "map".
12833 __isl_give isl_set
*isl_map_bind_range(__isl_take isl_map
*map
,
12834 __isl_take isl_multi_id
*tuple
)
12836 return isl_map_bind_domain(isl_map_reverse(map
), tuple
);
12839 /* Insert a domain corresponding to "tuple"
12840 * into the nullary or unary relation "set".
12841 * The result has an extra initial tuple and is therefore
12842 * either a unary or binary relation.
12843 * Any parameters with identifiers in "tuple" are reinterpreted
12844 * as the corresponding domain dimensions.
12846 static __isl_give isl_map
*unbind_params_insert_domain(
12847 __isl_take isl_set
*set
, __isl_take isl_multi_id
*tuple
)
12852 space
= isl_set_peek_space(set
);
12853 r
= isl_reordering_unbind_params_insert_domain(space
, tuple
);
12854 isl_multi_id_free(tuple
);
12856 return isl_map_realign(set_to_map(set
), r
);
12859 /* Construct a set with "tuple" as domain from the parameter domain "set".
12860 * Any parameters with identifiers in "tuple" are reinterpreted
12861 * as the corresponding set dimensions.
12863 __isl_give isl_set
*isl_set_unbind_params(__isl_take isl_set
*set
,
12864 __isl_take isl_multi_id
*tuple
)
12866 isl_bool is_params
;
12868 is_params
= isl_set_is_params(set
);
12870 set
= isl_set_free(set
);
12871 else if (!is_params
)
12872 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
12873 "expecting parameter domain", set
= isl_set_free(set
));
12874 return set_from_map(unbind_params_insert_domain(set
, tuple
));
12877 /* Check that "set" is a proper set, i.e., that it is not a parameter domain.
12879 static isl_stat
isl_set_check_is_set(__isl_keep isl_set
*set
)
12881 isl_bool is_params
;
12883 is_params
= isl_set_is_params(set
);
12885 return isl_stat_error
;
12886 else if (is_params
)
12887 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
12888 "expecting proper set", return isl_stat_error
);
12890 return isl_stat_ok
;
12893 /* Construct a map with "domain" as domain and "set" as range.
12894 * Any parameters with identifiers in "domain" are reinterpreted
12895 * as the corresponding domain dimensions.
12897 __isl_give isl_map
*isl_set_unbind_params_insert_domain(
12898 __isl_take isl_set
*set
, __isl_take isl_multi_id
*domain
)
12900 if (isl_set_check_is_set(set
) < 0)
12901 set
= isl_set_free(set
);
12902 return unbind_params_insert_domain(set
, domain
);
12905 /* Construct a map with "domain" as domain and "set" as range.
12907 __isl_give isl_map
*isl_set_insert_domain(__isl_take isl_set
*set
,
12908 __isl_take isl_space
*domain
)
12914 if (isl_set_check_is_set(set
) < 0 || isl_space_check_is_set(domain
) < 0)
12915 domain
= isl_space_free(domain
);
12916 dim
= isl_space_dim(domain
, isl_dim_set
);
12918 domain
= isl_space_free(domain
);
12919 space
= isl_set_get_space(set
);
12920 domain
= isl_space_replace_params(domain
, space
);
12921 space
= isl_space_map_from_domain_and_range(domain
, space
);
12923 map
= isl_map_from_range(set
);
12924 map
= isl_map_add_dims(map
, isl_dim_in
, dim
);
12925 map
= isl_map_reset_space(map
, space
);
12930 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
12931 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
12932 enum isl_dim_type c2
, enum isl_dim_type c3
,
12933 enum isl_dim_type c4
, enum isl_dim_type c5
)
12935 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
12936 struct isl_mat
*mat
;
12941 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
12944 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
, total
+ 1);
12947 for (i
= 0; i
< bmap
->n_eq
; ++i
)
12948 for (j
= 0, pos
= 0; j
< 5; ++j
) {
12949 int off
= isl_basic_map_offset(bmap
, c
[j
]);
12950 isl_size dim
= isl_basic_map_dim(bmap
, c
[j
]);
12952 return isl_mat_free(mat
);
12953 for (k
= 0; k
< dim
; ++k
) {
12954 isl_int_set(mat
->row
[i
][pos
],
12955 bmap
->eq
[i
][off
+ k
]);
12963 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
12964 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
12965 enum isl_dim_type c2
, enum isl_dim_type c3
,
12966 enum isl_dim_type c4
, enum isl_dim_type c5
)
12968 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
12969 struct isl_mat
*mat
;
12974 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
12977 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
, total
+ 1);
12980 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
12981 for (j
= 0, pos
= 0; j
< 5; ++j
) {
12982 int off
= isl_basic_map_offset(bmap
, c
[j
]);
12983 isl_size dim
= isl_basic_map_dim(bmap
, c
[j
]);
12985 return isl_mat_free(mat
);
12986 for (k
= 0; k
< dim
; ++k
) {
12987 isl_int_set(mat
->row
[i
][pos
],
12988 bmap
->ineq
[i
][off
+ k
]);
12996 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
12997 __isl_take isl_space
*space
,
12998 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
12999 enum isl_dim_type c2
, enum isl_dim_type c3
,
13000 enum isl_dim_type c4
, enum isl_dim_type c5
)
13002 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
13003 isl_basic_map
*bmap
= NULL
;
13010 dim
= isl_space_dim(space
, isl_dim_all
);
13011 if (dim
< 0 || !eq
|| !ineq
)
13014 if (eq
->n_col
!= ineq
->n_col
)
13015 isl_die(space
->ctx
, isl_error_invalid
,
13016 "equalities and inequalities matrices should have "
13017 "same number of columns", goto error
);
13021 if (eq
->n_col
< total
)
13022 isl_die(space
->ctx
, isl_error_invalid
,
13023 "number of columns too small", goto error
);
13025 extra
= eq
->n_col
- total
;
13027 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), extra
,
13028 eq
->n_row
, ineq
->n_row
);
13031 for (i
= 0; i
< extra
; ++i
) {
13032 k
= isl_basic_map_alloc_div(bmap
);
13035 isl_int_set_si(bmap
->div
[k
][0], 0);
13037 for (i
= 0; i
< eq
->n_row
; ++i
) {
13038 l
= isl_basic_map_alloc_equality(bmap
);
13041 for (j
= 0, pos
= 0; j
< 5; ++j
) {
13042 int off
= isl_basic_map_offset(bmap
, c
[j
]);
13043 isl_size dim
= isl_basic_map_dim(bmap
, c
[j
]);
13046 for (k
= 0; k
< dim
; ++k
) {
13047 isl_int_set(bmap
->eq
[l
][off
+ k
],
13053 for (i
= 0; i
< ineq
->n_row
; ++i
) {
13054 l
= isl_basic_map_alloc_inequality(bmap
);
13057 for (j
= 0, pos
= 0; j
< 5; ++j
) {
13058 int off
= isl_basic_map_offset(bmap
, c
[j
]);
13059 isl_size dim
= isl_basic_map_dim(bmap
, c
[j
]);
13062 for (k
= 0; k
< dim
; ++k
) {
13063 isl_int_set(bmap
->ineq
[l
][off
+ k
],
13064 ineq
->row
[i
][pos
]);
13070 isl_space_free(space
);
13072 isl_mat_free(ineq
);
13074 bmap
= isl_basic_map_simplify(bmap
);
13075 return isl_basic_map_finalize(bmap
);
13077 isl_space_free(space
);
13079 isl_mat_free(ineq
);
13080 isl_basic_map_free(bmap
);
13084 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
13085 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
13086 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
13088 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
13089 c1
, c2
, c3
, c4
, isl_dim_in
);
13092 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
13093 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
13094 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
13096 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
13097 c1
, c2
, c3
, c4
, isl_dim_in
);
13100 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
13101 __isl_take isl_space
*space
,
13102 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
13103 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
13105 isl_basic_map
*bmap
;
13106 bmap
= isl_basic_map_from_constraint_matrices(space
, eq
, ineq
,
13107 c1
, c2
, c3
, c4
, isl_dim_in
);
13108 return bset_from_bmap(bmap
);
13111 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
13114 return isl_bool_error
;
13116 return isl_space_can_zip(bmap
->dim
);
13119 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
13122 return isl_bool_error
;
13124 return isl_space_can_zip(map
->dim
);
13127 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
13128 * (A -> C) -> (B -> D).
13130 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
13140 if (!isl_basic_map_can_zip(bmap
))
13141 isl_die(bmap
->ctx
, isl_error_invalid
,
13142 "basic map cannot be zipped", goto error
);
13143 n_in
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
13144 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
13145 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
13146 if (n_in
< 0 || n1
< 0 || n2
< 0)
13147 return isl_basic_map_free(bmap
);
13148 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) + n_in
;
13149 bmap
= isl_basic_map_cow(bmap
);
13150 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
13153 bmap
->dim
= isl_space_zip(bmap
->dim
);
13156 bmap
= isl_basic_map_mark_final(bmap
);
13159 isl_basic_map_free(bmap
);
13163 /* Given a map (A -> B) -> (C -> D), return the corresponding map
13164 * (A -> C) -> (B -> D).
13166 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
13171 if (!isl_map_can_zip(map
))
13172 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
13175 return isl_map_transform(map
, &isl_space_zip
, &isl_basic_map_zip
);
13181 /* Can we apply isl_basic_map_curry to "bmap"?
13182 * That is, does it have a nested relation in its domain?
13184 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
13187 return isl_bool_error
;
13189 return isl_space_can_curry(bmap
->dim
);
13192 /* Can we apply isl_map_curry to "map"?
13193 * That is, does it have a nested relation in its domain?
13195 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
13198 return isl_bool_error
;
13200 return isl_space_can_curry(map
->dim
);
13203 /* Given a basic map (A -> B) -> C, return the corresponding basic map
13206 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
13212 if (!isl_basic_map_can_curry(bmap
))
13213 isl_die(bmap
->ctx
, isl_error_invalid
,
13214 "basic map cannot be curried", goto error
);
13215 bmap
= isl_basic_map_cow(bmap
);
13218 bmap
->dim
= isl_space_curry(bmap
->dim
);
13221 bmap
= isl_basic_map_mark_final(bmap
);
13224 isl_basic_map_free(bmap
);
13228 /* Given a map (A -> B) -> C, return the corresponding map
13231 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
13233 return isl_map_change_space(map
, &isl_map_can_curry
,
13234 "map cannot be curried", &isl_space_curry
);
13237 /* Can isl_map_range_curry be applied to "map"?
13238 * That is, does it have a nested relation in its range,
13239 * the domain of which is itself a nested relation?
13241 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
13244 return isl_bool_error
;
13246 return isl_space_can_range_curry(map
->dim
);
13249 /* Given a map A -> ((B -> C) -> D), return the corresponding map
13250 * A -> (B -> (C -> D)).
13252 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
13254 return isl_map_change_space(map
, &isl_map_can_range_curry
,
13255 "map range cannot be curried",
13256 &isl_space_range_curry
);
13259 /* Can we apply isl_basic_map_uncurry to "bmap"?
13260 * That is, does it have a nested relation in its domain?
13262 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
13265 return isl_bool_error
;
13267 return isl_space_can_uncurry(bmap
->dim
);
13270 /* Can we apply isl_map_uncurry to "map"?
13271 * That is, does it have a nested relation in its domain?
13273 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
13276 return isl_bool_error
;
13278 return isl_space_can_uncurry(map
->dim
);
13281 /* Given a basic map A -> (B -> C), return the corresponding basic map
13284 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
13290 if (!isl_basic_map_can_uncurry(bmap
))
13291 isl_die(bmap
->ctx
, isl_error_invalid
,
13292 "basic map cannot be uncurried",
13293 return isl_basic_map_free(bmap
));
13294 bmap
= isl_basic_map_cow(bmap
);
13297 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
13299 return isl_basic_map_free(bmap
);
13300 bmap
= isl_basic_map_mark_final(bmap
);
13304 /* Given a map A -> (B -> C), return the corresponding map
13307 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
13309 return isl_map_change_space(map
, &isl_map_can_uncurry
,
13310 "map cannot be uncurried", &isl_space_uncurry
);
13313 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
13314 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13316 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
13319 /* Construct a basic map where the given dimensions are equal to each other.
13321 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
13322 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13324 isl_basic_map
*bmap
= NULL
;
13328 total
= isl_space_dim(space
, isl_dim_all
);
13330 isl_space_check_range(space
, type1
, pos1
, 1) < 0 ||
13331 isl_space_check_range(space
, type2
, pos2
, 1) < 0)
13334 if (type1
== type2
&& pos1
== pos2
)
13335 return isl_basic_map_universe(space
);
13337 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
13338 i
= isl_basic_map_alloc_equality(bmap
);
13341 isl_seq_clr(bmap
->eq
[i
], 1 + total
);
13342 pos1
+= isl_basic_map_offset(bmap
, type1
);
13343 pos2
+= isl_basic_map_offset(bmap
, type2
);
13344 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
13345 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
13346 bmap
= isl_basic_map_finalize(bmap
);
13347 isl_space_free(space
);
13350 isl_space_free(space
);
13351 isl_basic_map_free(bmap
);
13355 /* Add a constraint imposing that the given two dimensions are equal.
13357 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
13358 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13362 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
13364 bmap
= isl_basic_map_intersect(bmap
, eq
);
13369 /* Add a constraint imposing that the given two dimensions are equal.
13371 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
13372 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13374 isl_basic_map
*bmap
;
13376 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
13378 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
13383 /* Add a constraint imposing that the given two dimensions have opposite values.
13385 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
13386 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13388 isl_basic_map
*bmap
= NULL
;
13392 if (isl_map_check_range(map
, type1
, pos1
, 1) < 0)
13393 return isl_map_free(map
);
13394 if (isl_map_check_range(map
, type2
, pos2
, 1) < 0)
13395 return isl_map_free(map
);
13397 total
= isl_map_dim(map
, isl_dim_all
);
13399 return isl_map_free(map
);
13400 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
13401 i
= isl_basic_map_alloc_equality(bmap
);
13404 isl_seq_clr(bmap
->eq
[i
], 1 + total
);
13405 pos1
+= isl_basic_map_offset(bmap
, type1
);
13406 pos2
+= isl_basic_map_offset(bmap
, type2
);
13407 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
13408 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
13409 bmap
= isl_basic_map_finalize(bmap
);
13411 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
13415 isl_basic_map_free(bmap
);
13420 /* Construct a constraint imposing that the value of the first dimension is
13421 * greater than or equal to that of the second.
13423 static __isl_give isl_constraint
*constraint_order_ge(
13424 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
13425 enum isl_dim_type type2
, int pos2
)
13429 if (isl_space_check_range(space
, type1
, pos1
, 1) < 0 ||
13430 isl_space_check_range(space
, type2
, pos2
, 1) < 0)
13431 space
= isl_space_free(space
);
13435 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
13437 if (type1
== type2
&& pos1
== pos2
)
13440 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
13441 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
13446 /* Add a constraint imposing that the value of the first dimension is
13447 * greater than or equal to that of the second.
13449 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
13450 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13455 if (type1
== type2
&& pos1
== pos2
)
13457 space
= isl_basic_map_get_space(bmap
);
13458 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
13459 bmap
= isl_basic_map_add_constraint(bmap
, c
);
13464 /* Add a constraint imposing that the value of the first dimension is
13465 * greater than or equal to that of the second.
13467 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
13468 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13473 if (type1
== type2
&& pos1
== pos2
)
13475 space
= isl_map_get_space(map
);
13476 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
13477 map
= isl_map_add_constraint(map
, c
);
13482 /* Add a constraint imposing that the value of the first dimension is
13483 * less than or equal to that of the second.
13485 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
13486 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13488 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
13491 /* Construct a basic map where the value of the first dimension is
13492 * greater than that of the second.
13494 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
13495 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13497 isl_basic_map
*bmap
= NULL
;
13501 if (isl_space_check_range(space
, type1
, pos1
, 1) < 0 ||
13502 isl_space_check_range(space
, type2
, pos2
, 1) < 0)
13505 if (type1
== type2
&& pos1
== pos2
)
13506 return isl_basic_map_empty(space
);
13508 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
13509 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
13510 i
= isl_basic_map_alloc_inequality(bmap
);
13511 if (total
< 0 || i
< 0)
13512 return isl_basic_map_free(bmap
);
13513 isl_seq_clr(bmap
->ineq
[i
], 1 + total
);
13514 pos1
+= isl_basic_map_offset(bmap
, type1
);
13515 pos2
+= isl_basic_map_offset(bmap
, type2
);
13516 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
13517 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
13518 isl_int_set_si(bmap
->ineq
[i
][0], -1);
13519 bmap
= isl_basic_map_finalize(bmap
);
13523 isl_space_free(space
);
13524 isl_basic_map_free(bmap
);
13528 /* Add a constraint imposing that the value of the first dimension is
13529 * greater than that of the second.
13531 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
13532 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13536 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
13538 bmap
= isl_basic_map_intersect(bmap
, gt
);
13543 /* Add a constraint imposing that the value of the first dimension is
13544 * greater than that of the second.
13546 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
13547 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13549 isl_basic_map
*bmap
;
13551 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
13553 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
13558 /* Add a constraint imposing that the value of the first dimension is
13559 * smaller than that of the second.
13561 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
13562 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
13564 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
13567 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
13571 isl_local_space
*ls
;
13576 if (!isl_basic_map_divs_known(bmap
))
13577 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
13578 "some divs are unknown", return NULL
);
13580 ls
= isl_basic_map_get_local_space(bmap
);
13581 div
= isl_local_space_get_div(ls
, pos
);
13582 isl_local_space_free(ls
);
13587 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
13590 return isl_basic_map_get_div(bset
, pos
);
13593 /* Plug in "subs" for set dimension "pos" of "set".
13595 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
13596 unsigned pos
, __isl_keep isl_aff
*subs
)
13600 if (set
&& isl_set_plain_is_empty(set
))
13603 ma
= isl_multi_aff_identity_on_domain_space(isl_set_get_space(set
));
13604 ma
= isl_multi_aff_set_aff(ma
, pos
, isl_aff_copy(subs
));
13605 return isl_set_preimage_multi_aff(set
, ma
);
13608 /* Check if the range of "ma" is compatible with the domain or range
13609 * (depending on "type") of "bmap".
13611 static isl_stat
check_basic_map_compatible_range_multi_aff(
13612 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
13613 __isl_keep isl_multi_aff
*ma
)
13616 isl_space
*ma_space
;
13618 ma_space
= isl_multi_aff_get_space(ma
);
13620 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
13624 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
13625 "parameters don't match", goto error
);
13626 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
13630 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
13631 "spaces don't match", goto error
);
13633 isl_space_free(ma_space
);
13634 return isl_stat_ok
;
13636 isl_space_free(ma_space
);
13637 return isl_stat_error
;
13640 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
13641 * coefficients before the transformed range of dimensions,
13642 * the "n_after" coefficients after the transformed range of dimensions
13643 * and the coefficients of the other divs in "bmap".
13645 static __isl_give isl_basic_map
*set_ma_divs(__isl_take isl_basic_map
*bmap
,
13646 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
13651 isl_local_space
*ls
;
13656 ls
= isl_aff_get_domain_local_space(ma
->u
.p
[0]);
13657 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
13658 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
13659 if (n_param
< 0 || n_set
< 0)
13660 return isl_basic_map_free(bmap
);
13662 for (i
= 0; i
< n_div
; ++i
) {
13663 int o_bmap
= 0, o_ls
= 0;
13665 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
13666 o_bmap
+= 1 + 1 + n_param
;
13667 o_ls
+= 1 + 1 + n_param
;
13668 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
13669 o_bmap
+= n_before
;
13670 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
13671 ls
->div
->row
[i
] + o_ls
, n_set
);
13674 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
13676 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
13677 ls
->div
->row
[i
] + o_ls
, n_div
);
13680 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
13681 bmap
= isl_basic_map_add_div_constraints(bmap
, i
);
13686 isl_local_space_free(ls
);
13689 isl_local_space_free(ls
);
13690 return isl_basic_map_free(bmap
);
13693 /* How many stride constraints does "ma" enforce?
13694 * That is, how many of the affine expressions have a denominator
13695 * different from one?
13697 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
13702 for (i
= 0; i
< ma
->n
; ++i
)
13703 if (!isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
13709 /* For each affine expression in ma of the form
13711 * x_i = (f_i y + h_i)/m_i
13713 * with m_i different from one, add a constraint to "bmap"
13716 * f_i y + h_i = m_i alpha_i
13718 * with alpha_i an additional existentially quantified variable.
13720 * The input variables of "ma" correspond to a subset of the variables
13721 * of "bmap". There are "n_before" variables in "bmap" before this
13722 * subset and "n_after" variables after this subset.
13723 * The integer divisions of the affine expressions in "ma" are assumed
13724 * to have been aligned. There are "n_div_ma" of them and
13725 * they appear first in "bmap", straight after the "n_after" variables.
13727 static __isl_give isl_basic_map
*add_ma_strides(
13728 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
13729 int n_before
, int n_after
, int n_div_ma
)
13737 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
13738 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
13739 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
13740 if (total
< 0 || n_param
< 0 || n_in
< 0)
13741 return isl_basic_map_free(bmap
);
13742 for (i
= 0; i
< ma
->n
; ++i
) {
13743 int o_bmap
= 0, o_ma
= 1;
13745 if (isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
13747 div
= isl_basic_map_alloc_div(bmap
);
13748 k
= isl_basic_map_alloc_equality(bmap
);
13749 if (div
< 0 || k
< 0)
13751 isl_int_set_si(bmap
->div
[div
][0], 0);
13752 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
13753 ma
->u
.p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
13754 o_bmap
+= 1 + n_param
;
13755 o_ma
+= 1 + n_param
;
13756 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
13757 o_bmap
+= n_before
;
13758 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
13759 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_in
);
13762 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
13764 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
13765 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_div_ma
);
13766 o_bmap
+= n_div_ma
;
13768 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
13769 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->u
.p
[i
]->v
->el
[0]);
13775 isl_basic_map_free(bmap
);
13779 /* Replace the domain or range space (depending on "type) of "space" by "set".
13781 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
13782 enum isl_dim_type type
, __isl_take isl_space
*set
)
13784 if (type
== isl_dim_in
) {
13785 space
= isl_space_range(space
);
13786 space
= isl_space_map_from_domain_and_range(set
, space
);
13788 space
= isl_space_domain(space
);
13789 space
= isl_space_map_from_domain_and_range(space
, set
);
13795 /* Compute the preimage of the domain or range (depending on "type")
13796 * of "bmap" under the function represented by "ma".
13797 * In other words, plug in "ma" in the domain or range of "bmap".
13798 * The result is a basic map that lives in the same space as "bmap"
13799 * except that the domain or range has been replaced by
13800 * the domain space of "ma".
13802 * If bmap is represented by
13804 * A(p) + S u + B x + T v + C(divs) >= 0,
13806 * where u and x are input and output dimensions if type == isl_dim_out
13807 * while x and v are input and output dimensions if type == isl_dim_in,
13808 * and ma is represented by
13810 * x = D(p) + F(y) + G(divs')
13812 * then the result is
13814 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
13816 * The divs in the input set are similarly adjusted.
13819 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
13823 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
13824 * B_i G(divs') + c_i(divs))/n_i)
13826 * If bmap is not a rational map and if F(y) involves any denominators
13828 * x_i = (f_i y + h_i)/m_i
13830 * then additional constraints are added to ensure that we only
13831 * map back integer points. That is we enforce
13833 * f_i y + h_i = m_i alpha_i
13835 * with alpha_i an additional existentially quantified variable.
13837 * We first copy over the divs from "ma".
13838 * Then we add the modified constraints and divs from "bmap".
13839 * Finally, we add the stride constraints, if needed.
13841 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
13842 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
13843 __isl_take isl_multi_aff
*ma
)
13847 isl_basic_map
*res
= NULL
;
13848 isl_size n_before
, n_after
, n_div_bmap
, n_div_ma
;
13849 isl_int f
, c1
, c2
, g
;
13858 ma
= isl_multi_aff_align_divs(ma
);
13861 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
13864 if (type
== isl_dim_in
) {
13866 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
13868 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
13871 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
13872 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
13873 if (n_before
< 0 || n_after
< 0 || n_div_bmap
< 0 || n_div_ma
< 0)
13876 space
= isl_multi_aff_get_domain_space(ma
);
13877 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
13878 rational
= isl_basic_map_is_rational(bmap
);
13879 strides
= rational
? 0 : multi_aff_strides(ma
);
13880 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
13881 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
13883 res
= isl_basic_map_set_rational(res
);
13885 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
13886 if (isl_basic_map_alloc_div(res
) < 0)
13889 res
= set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
);
13893 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
13894 k
= isl_basic_map_alloc_equality(res
);
13897 if (isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
13898 n_after
, n_div_ma
, n_div_bmap
,
13899 f
, c1
, c2
, g
, 0) < 0)
13903 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
13904 k
= isl_basic_map_alloc_inequality(res
);
13907 if (isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
13908 n_after
, n_div_ma
, n_div_bmap
,
13909 f
, c1
, c2
, g
, 0) < 0)
13913 for (i
= 0; i
< bmap
->n_div
; ++i
) {
13914 if (isl_int_is_zero(bmap
->div
[i
][0])) {
13915 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
13918 if (isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
13919 n_before
, n_after
, n_div_ma
, n_div_bmap
,
13920 f
, c1
, c2
, g
, 1) < 0)
13925 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
13931 isl_basic_map_free(bmap
);
13932 isl_multi_aff_free(ma
);
13933 res
= isl_basic_map_simplify(res
);
13934 return isl_basic_map_finalize(res
);
13940 isl_basic_map_free(bmap
);
13941 isl_multi_aff_free(ma
);
13942 isl_basic_map_free(res
);
13946 /* Compute the preimage of "bset" under the function represented by "ma".
13947 * In other words, plug in "ma" in "bset". The result is a basic set
13948 * that lives in the domain space of "ma".
13950 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
13951 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
13953 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
13956 /* Compute the preimage of the domain of "bmap" under the function
13957 * represented by "ma".
13958 * In other words, plug in "ma" in the domain of "bmap".
13959 * The result is a basic map that lives in the same space as "bmap"
13960 * except that the domain has been replaced by the domain space of "ma".
13962 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
13963 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13965 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
13968 /* Compute the preimage of the range of "bmap" under the function
13969 * represented by "ma".
13970 * In other words, plug in "ma" in the range of "bmap".
13971 * The result is a basic map that lives in the same space as "bmap"
13972 * except that the range has been replaced by the domain space of "ma".
13974 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
13975 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13977 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
13980 /* Check if the range of "ma" is compatible with the domain or range
13981 * (depending on "type") of "map".
13982 * Return isl_stat_error if anything is wrong.
13984 static isl_stat
check_map_compatible_range_multi_aff(
13985 __isl_keep isl_map
*map
, enum isl_dim_type type
,
13986 __isl_keep isl_multi_aff
*ma
)
13989 isl_space
*ma_space
;
13991 ma_space
= isl_multi_aff_get_space(ma
);
13992 m
= isl_map_space_tuple_is_equal(map
, type
, ma_space
, isl_dim_out
);
13993 isl_space_free(ma_space
);
13995 return isl_stat_error
;
13997 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
13998 "spaces don't match", return isl_stat_error
);
13999 return isl_stat_ok
;
14002 /* Compute the preimage of the domain or range (depending on "type")
14003 * of "map" under the function represented by "ma".
14004 * In other words, plug in "ma" in the domain or range of "map".
14005 * The result is a map that lives in the same space as "map"
14006 * except that the domain or range has been replaced by
14007 * the domain space of "ma".
14009 * The parameters are assumed to have been aligned.
14011 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
14012 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
14017 map
= isl_map_cow(map
);
14018 ma
= isl_multi_aff_align_divs(ma
);
14021 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
14024 for (i
= 0; i
< map
->n
; ++i
) {
14025 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
14026 isl_multi_aff_copy(ma
));
14031 space
= isl_multi_aff_get_domain_space(ma
);
14032 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
14034 isl_space_free(isl_map_take_space(map
));
14035 map
= isl_map_restore_space(map
, space
);
14039 isl_multi_aff_free(ma
);
14041 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
14042 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
14045 isl_multi_aff_free(ma
);
14050 /* Compute the preimage of the domain or range (depending on "type")
14051 * of "map" under the function represented by "ma".
14052 * In other words, plug in "ma" in the domain or range of "map".
14053 * The result is a map that lives in the same space as "map"
14054 * except that the domain or range has been replaced by
14055 * the domain space of "ma".
14057 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
14058 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
14065 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
14069 return map_preimage_multi_aff(map
, type
, ma
);
14071 if (isl_map_check_named_params(map
) < 0)
14073 if (!isl_space_has_named_params(ma
->space
))
14074 isl_die(map
->ctx
, isl_error_invalid
,
14075 "unaligned unnamed parameters", goto error
);
14076 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
14077 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
14079 return map_preimage_multi_aff(map
, type
, ma
);
14081 isl_multi_aff_free(ma
);
14082 return isl_map_free(map
);
14085 /* Compute the preimage of "set" under the function represented by "ma".
14086 * In other words, plug in "ma" in "set". The result is a set
14087 * that lives in the domain space of "ma".
14089 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
14090 __isl_take isl_multi_aff
*ma
)
14092 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
14095 /* Compute the preimage of the domain of "map" under the function
14096 * represented by "ma".
14097 * In other words, plug in "ma" in the domain of "map".
14098 * The result is a map that lives in the same space as "map"
14099 * except that the domain has been replaced by the domain space of "ma".
14101 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
14102 __isl_take isl_multi_aff
*ma
)
14104 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
14107 /* Compute the preimage of the range of "map" under the function
14108 * represented by "ma".
14109 * In other words, plug in "ma" in the range of "map".
14110 * The result is a map that lives in the same space as "map"
14111 * except that the range has been replaced by the domain space of "ma".
14113 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
14114 __isl_take isl_multi_aff
*ma
)
14116 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
14119 /* Compute the preimage of "map" under the function represented by "pma".
14120 * In other words, plug in "pma" in the domain or range of "map".
14121 * The result is a map that lives in the same space as "map",
14122 * except that the space of type "type" has been replaced by
14123 * the domain space of "pma".
14125 * The parameters of "map" and "pma" are assumed to have been aligned.
14127 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
14128 __isl_take isl_map
*map
, enum isl_dim_type type
,
14129 __isl_take isl_pw_multi_aff
*pma
)
14140 space
= isl_pw_multi_aff_get_domain_space(pma
);
14141 isl_pw_multi_aff_free(pma
);
14142 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
14144 return isl_map_empty(space
);
14147 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
14148 isl_multi_aff_copy(pma
->p
[0].maff
));
14149 if (type
== isl_dim_in
)
14150 res
= isl_map_intersect_domain(res
,
14151 isl_map_copy(pma
->p
[0].set
));
14153 res
= isl_map_intersect_range(res
,
14154 isl_map_copy(pma
->p
[0].set
));
14156 for (i
= 1; i
< pma
->n
; ++i
) {
14159 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
14160 isl_multi_aff_copy(pma
->p
[i
].maff
));
14161 if (type
== isl_dim_in
)
14162 res_i
= isl_map_intersect_domain(res_i
,
14163 isl_map_copy(pma
->p
[i
].set
));
14165 res_i
= isl_map_intersect_range(res_i
,
14166 isl_map_copy(pma
->p
[i
].set
));
14167 res
= isl_map_union(res
, res_i
);
14170 isl_pw_multi_aff_free(pma
);
14174 isl_pw_multi_aff_free(pma
);
14179 /* Compute the preimage of "map" under the function represented by "pma".
14180 * In other words, plug in "pma" in the domain or range of "map".
14181 * The result is a map that lives in the same space as "map",
14182 * except that the space of type "type" has been replaced by
14183 * the domain space of "pma".
14185 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
14186 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
14193 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
14197 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
14199 if (isl_map_check_named_params(map
) < 0)
14201 if (isl_pw_multi_aff_check_named_params(pma
) < 0)
14203 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
14204 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
14206 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
14208 isl_pw_multi_aff_free(pma
);
14209 return isl_map_free(map
);
14212 /* Compute the preimage of "set" under the function represented by "pma".
14213 * In other words, plug in "pma" in "set". The result is a set
14214 * that lives in the domain space of "pma".
14216 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
14217 __isl_take isl_pw_multi_aff
*pma
)
14219 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
14222 /* Compute the preimage of the domain of "map" under the function
14223 * represented by "pma".
14224 * In other words, plug in "pma" in the domain of "map".
14225 * The result is a map that lives in the same space as "map",
14226 * except that domain space has been replaced by the domain space of "pma".
14228 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
14229 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
14231 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
14234 /* Compute the preimage of the range of "map" under the function
14235 * represented by "pma".
14236 * In other words, plug in "pma" in the range of "map".
14237 * The result is a map that lives in the same space as "map",
14238 * except that range space has been replaced by the domain space of "pma".
14240 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
14241 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
14243 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
14246 /* Compute the preimage of "map" under the function represented by "mpa".
14247 * In other words, plug in "mpa" in the domain or range of "map".
14248 * The result is a map that lives in the same space as "map",
14249 * except that the space of type "type" has been replaced by
14250 * the domain space of "mpa".
14252 * If the map does not involve any constraints that refer to the
14253 * dimensions of the substituted space, then the only possible
14254 * effect of "mpa" on the map is to map the space to a different space.
14255 * We create a separate isl_multi_aff to effectuate this change
14256 * in order to avoid spurious splitting of the map along the pieces
14258 * If "mpa" has a non-trivial explicit domain, however,
14259 * then the full substitution should be performed.
14261 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
14262 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
14266 isl_pw_multi_aff
*pma
;
14268 n
= isl_map_dim(map
, type
);
14272 full
= isl_map_involves_dims(map
, type
, 0, n
);
14273 if (full
>= 0 && !full
)
14274 full
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
14281 space
= isl_multi_pw_aff_get_space(mpa
);
14282 isl_multi_pw_aff_free(mpa
);
14283 ma
= isl_multi_aff_zero(space
);
14284 return isl_map_preimage_multi_aff(map
, type
, ma
);
14287 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
14288 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
14291 isl_multi_pw_aff_free(mpa
);
14295 /* Compute the preimage of "map" under the function represented by "mpa".
14296 * In other words, plug in "mpa" in the domain "map".
14297 * The result is a map that lives in the same space as "map",
14298 * except that domain space has been replaced by the domain space of "mpa".
14300 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
14301 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
14303 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
14306 /* Compute the preimage of "set" by the function represented by "mpa".
14307 * In other words, plug in "mpa" in "set".
14309 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
14310 __isl_take isl_multi_pw_aff
*mpa
)
14312 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
14315 /* Given that inequality "ineq" of "bmap" expresses an upper bound
14316 * on the output dimension "pos" in terms of the parameters,
14317 * the input dimensions and possibly some integer divisions,
14318 * but not any other output dimensions, extract this upper bound
14319 * as a function of all dimensions (with zero coefficients
14320 * for the output dimensions).
14322 * That is, the inequality is of the form
14324 * e(...) + c - m x >= 0
14326 * where e does not depend on any other output dimensions.
14327 * Return (e(...) + c) / m, with the denominator m in the first position.
14329 __isl_give isl_vec
*isl_basic_map_inequality_extract_output_upper_bound(
14330 __isl_keep isl_basic_map
*bmap
, int ineq
, int pos
)
14334 isl_size v_out
, total
;
14336 v_out
= isl_basic_map_var_offset(bmap
, isl_dim_out
);
14337 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
14338 if (v_out
< 0 || total
< 0)
14340 ctx
= isl_basic_map_get_ctx(bmap
);
14341 v
= isl_vec_alloc(ctx
, 1 + 1 + total
);
14344 isl_int_neg(v
->el
[0], bmap
->ineq
[ineq
][1 + v_out
+ pos
]);
14345 isl_seq_cpy(v
->el
+ 1, bmap
->ineq
[ineq
], 1 + total
);
14346 isl_int_set_si(v
->el
[1 + 1 + v_out
+ pos
], 0);
14351 /* Is constraint "c" of "bmap" of the form
14353 * e(...) + c1 - m x >= 0
14357 * -e(...) + c2 + m x >= 0
14359 * where m > 1 and e does not involve any other output variables?
14361 * "v_out" is the offset to the output variables.
14362 * "d" is the position of x among the output variables.
14363 * "v_div" is the offset to the local variables.
14364 * "total" is the total number of variables.
14366 * Since the purpose of this function is to use the constraint
14367 * to express the output variable as an integer division,
14368 * do not allow the constraint to involve any local variables
14369 * that do not have an explicit representation.
14371 static isl_bool
is_potential_div_constraint(__isl_keep isl_basic_map
*bmap
,
14372 isl_int
*c
, int v_out
, int d
, int v_div
, int total
)
14376 if (isl_int_is_zero(c
[1 + v_out
+ d
]))
14377 return isl_bool_false
;
14378 if (isl_int_is_one(c
[1 + v_out
+ d
]))
14379 return isl_bool_false
;
14380 if (isl_int_is_negone(c
[1 + v_out
+ d
]))
14381 return isl_bool_false
;
14382 if (isl_seq_first_non_zero(c
+ 1 + v_out
, d
) != -1)
14383 return isl_bool_false
;
14384 if (isl_seq_first_non_zero(c
+ 1 + v_out
+ d
+ 1,
14385 v_div
- (v_out
+ d
+ 1)) != -1)
14386 return isl_bool_false
;
14387 for (i
= 0; v_div
+ i
< total
; ++i
) {
14388 isl_bool known
, involves
;
14390 if (isl_int_is_zero(c
[1 + v_div
+ i
]))
14392 known
= isl_basic_map_div_is_known(bmap
, i
);
14393 if (known
< 0 || !known
)
14395 involves
= div_involves_vars(bmap
, i
, v_out
, v_div
- v_out
);
14396 if (involves
< 0 || involves
)
14397 return isl_bool_not(involves
);
14399 return isl_bool_true
;
14402 /* Look for a pair of constraints
14404 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
14408 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
14410 * that express that the output dimension x at position "pos"
14411 * is some integer division of an expression in terms of the parameters,
14412 * input dimensions and integer divisions.
14413 * If such a pair can be found, then return the index
14414 * of the upper bound constraint, m x <= e(...) + c1.
14415 * Otherwise, return an index beyond the number of constraints.
14417 * In order for the constraints above to express an integer division,
14418 * m needs to be greater than 1 and such that
14420 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
14422 * In particular, this ensures that
14424 * x = floor((e(...) + c1) / m)
14426 isl_size
isl_basic_map_find_output_upper_div_constraint(
14427 __isl_keep isl_basic_map
*bmap
, int pos
)
14431 isl_size v_out
, v_div
;
14435 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
14436 v_out
= isl_basic_map_var_offset(bmap
, isl_dim_out
);
14437 v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
14438 n_ineq
= isl_basic_map_n_inequality(bmap
);
14439 if (total
< 0 || v_out
< 0 || v_div
< 0 || n_ineq
< 0)
14440 return isl_size_error
;
14443 for (i
= 0; i
< n_ineq
; ++i
) {
14444 isl_bool potential
;
14446 potential
= is_potential_div_constraint(bmap
, bmap
->ineq
[i
],
14447 v_out
, pos
, v_div
, total
);
14452 for (j
= i
+ 1; j
< n_ineq
; ++j
) {
14453 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
14454 bmap
->ineq
[j
] + 1, total
))
14456 isl_int_add(sum
, bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
14457 if (isl_int_abs_lt(sum
, bmap
->ineq
[i
][1 + v_out
+ pos
]))
14463 isl_int_clear(sum
);
14467 if (isl_int_is_pos(bmap
->ineq
[j
][1 + v_out
+ pos
]))
14472 isl_int_clear(sum
);
14473 return isl_size_error
;
14476 /* Return a copy of the equality constraints of "bset" as a matrix.
14478 __isl_give isl_mat
*isl_basic_set_extract_equalities(
14479 __isl_keep isl_basic_set
*bset
)
14484 total
= isl_basic_set_dim(bset
, isl_dim_all
);
14488 ctx
= isl_basic_set_get_ctx(bset
);
14489 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, 1 + total
);
14492 /* Are the "n" "coefficients" starting at "first" of the integer division
14493 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
14495 * The "coefficient" at position 0 is the denominator.
14496 * The "coefficient" at position 1 is the constant term.
14498 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
14499 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
14500 unsigned first
, unsigned n
)
14502 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
14503 return isl_bool_error
;
14504 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
14505 return isl_bool_error
;
14506 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
14507 bmap2
->div
[pos2
] + first
, n
);
14510 /* Are the integer division expressions at position "pos1" in "bmap1" and
14511 * "pos2" in "bmap2" equal to each other, except that the constant terms
14514 isl_bool
isl_basic_map_equal_div_expr_except_constant(
14515 __isl_keep isl_basic_map
*bmap1
, int pos1
,
14516 __isl_keep isl_basic_map
*bmap2
, int pos2
)
14519 isl_size total
, total2
;
14521 total
= isl_basic_map_dim(bmap1
, isl_dim_all
);
14522 total2
= isl_basic_map_dim(bmap2
, isl_dim_all
);
14523 if (total
< 0 || total2
< 0)
14524 return isl_bool_error
;
14525 if (total
!= total2
)
14526 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
14527 "incomparable div expressions", return isl_bool_error
);
14528 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
14530 if (equal
< 0 || !equal
)
14532 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
14534 if (equal
< 0 || equal
)
14535 return isl_bool_not(equal
);
14536 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
14540 /* Replace the numerator of the constant term of the integer division
14541 * expression at position "div" in "bmap" by "value".
14542 * The caller guarantees that this does not change the meaning
14545 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
14546 __isl_take isl_basic_map
*bmap
, int div
, int value
)
14548 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
14549 return isl_basic_map_free(bmap
);
14551 isl_int_set_si(bmap
->div
[div
][1], value
);
14556 /* Is the point "inner" internal to inequality constraint "ineq"
14558 * The point is considered to be internal to the inequality constraint,
14559 * if it strictly lies on the positive side of the inequality constraint,
14560 * or if it lies on the constraint and the constraint is lexico-positive.
14562 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
14563 __isl_keep isl_basic_set
*bset
, int ineq
)
14569 if (!inner
|| !bset
)
14570 return isl_bool_error
;
14572 ctx
= isl_basic_set_get_ctx(bset
);
14573 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
14574 &ctx
->normalize_gcd
);
14575 if (!isl_int_is_zero(ctx
->normalize_gcd
))
14576 return isl_int_is_nonneg(ctx
->normalize_gcd
);
14578 total
= isl_basic_set_dim(bset
, isl_dim_all
);
14580 return isl_bool_error
;
14581 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
14582 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
14585 /* Tighten the inequality constraints of "bset" that are outward with respect
14586 * to the point "vec".
14587 * That is, tighten the constraints that are not satisfied by "vec".
14589 * "vec" is a point internal to some superset S of "bset" that is used
14590 * to make the subsets of S disjoint, by tightening one half of the constraints
14591 * that separate two subsets. In particular, the constraints of S
14592 * are all satisfied by "vec" and should not be tightened.
14593 * Of the internal constraints, those that have "vec" on the outside
14594 * are tightened. The shared facet is included in the adjacent subset
14595 * with the opposite constraint.
14596 * For constraints that saturate "vec", this criterion cannot be used
14597 * to determine which of the two sides should be tightened.
14598 * Instead, the sign of the first non-zero coefficient is used
14599 * to make this choice. Note that this second criterion is never used
14600 * on the constraints of S since "vec" is interior to "S".
14602 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
14603 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
14607 bset
= isl_basic_set_cow(bset
);
14610 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
14613 internal
= is_internal(vec
, bset
, j
);
14615 return isl_basic_set_free(bset
);
14618 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
14624 /* Replace the variables x of type "type" starting at "first" in "bmap"
14625 * by x' with x = M x' with M the matrix trans.
14626 * That is, replace the corresponding coefficients c by c M.
14628 * The transformation matrix should be a square matrix.
14630 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
14631 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
14632 __isl_take isl_mat
*trans
)
14636 bmap
= isl_basic_map_cow(bmap
);
14637 if (!bmap
|| !trans
)
14640 if (trans
->n_row
!= trans
->n_col
)
14641 isl_die(trans
->ctx
, isl_error_invalid
,
14642 "expecting square transformation matrix", goto error
);
14643 if (isl_basic_map_check_range(bmap
, type
, first
, trans
->n_row
) < 0)
14646 pos
= isl_basic_map_offset(bmap
, type
) + first
;
14648 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
14649 isl_mat_copy(trans
)) < 0)
14651 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
14652 isl_mat_copy(trans
)) < 0)
14654 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
14655 isl_mat_copy(trans
)) < 0)
14658 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
14659 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
14661 isl_mat_free(trans
);
14664 isl_mat_free(trans
);
14665 isl_basic_map_free(bmap
);
14669 /* Replace the variables x of type "type" starting at "first" in "bset"
14670 * by x' with x = M x' with M the matrix trans.
14671 * That is, replace the corresponding coefficients c by c M.
14673 * The transformation matrix should be a square matrix.
14675 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
14676 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
14677 __isl_take isl_mat
*trans
)
14679 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);