2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 INRIA Paris
7 * Copyright 2016 Sven Verdoolaege
9 * Use of this software is governed by the MIT license
11 * Written by Sven Verdoolaege, K.U.Leuven, Departement
12 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
14 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
17 * B.P. 105 - 78153 Le Chesnay, France
18 * and Centre de Recherche Inria de Paris, 2 rue Simone Iff - Voie DQ12,
19 * CS 42112, 75589 Paris Cedex 12, France
23 #include <isl_ctx_private.h>
24 #include <isl_map_private.h>
27 #include <isl/constraint.h>
28 #include "isl_space_private.h"
29 #include "isl_equalities.h"
30 #include <isl_lp_private.h>
34 #include <isl_reordering.h>
35 #include "isl_sample.h"
39 #include <isl_mat_private.h>
40 #include <isl_vec_private.h>
41 #include <isl_dim_map.h>
42 #include <isl_local_space_private.h>
43 #include <isl_aff_private.h>
44 #include <isl_options_private.h>
45 #include <isl_morph.h>
46 #include <isl_val_private.h>
47 #include <isl_printer_private.h>
49 #include <bset_to_bmap.c>
50 #include <bset_from_bmap.c>
51 #include <set_to_map.c>
52 #include <set_from_map.c>
54 /* Treat "bset" as a basic map.
55 * Internally, isl_basic_set is defined to isl_basic_map, so in practice,
56 * this function performs a redundant cast.
58 static __isl_keep
const isl_basic_map
*const_bset_to_bmap(
59 __isl_keep
const isl_basic_set
*bset
)
61 return (const isl_basic_map
*) bset
;
64 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
67 case isl_dim_param
: return dim
->nparam
;
68 case isl_dim_in
: return dim
->n_in
;
69 case isl_dim_out
: return dim
->n_out
;
70 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
75 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
78 case isl_dim_param
: return 1;
79 case isl_dim_in
: return 1 + dim
->nparam
;
80 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
85 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
86 enum isl_dim_type type
)
91 case isl_dim_cst
: return 1;
94 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
95 case isl_dim_div
: return bmap
->n_div
;
96 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
101 /* Return the space of "map".
103 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
105 return map
? map
->dim
: NULL
;
108 /* Return the space of "set".
110 __isl_keep isl_space
*isl_set_peek_space(__isl_keep isl_set
*set
)
112 return isl_map_peek_space(set_to_map(set
));
115 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
117 return map
? n(map
->dim
, type
) : 0;
120 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
122 return set
? n(set
->dim
, type
) : 0;
125 /* Return the position of the variables of the given type
126 * within the sequence of variables of "bmap".
128 int isl_basic_map_var_offset(__isl_keep isl_basic_map
*bmap
,
129 enum isl_dim_type type
)
133 space
= isl_basic_map_peek_space(bmap
);
140 case isl_dim_out
: return isl_space_offset(space
, type
);
141 case isl_dim_div
: return isl_space_dim(space
, isl_dim_all
);
144 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
145 "invalid dimension type", return -1);
149 /* Return the position of the variables of the given type
150 * within the sequence of variables of "bset".
152 int isl_basic_set_var_offset(__isl_keep isl_basic_set
*bset
,
153 enum isl_dim_type type
)
155 return isl_basic_map_var_offset(bset_to_bmap(bset
), type
);
158 /* Return the position of the coefficients of the variables of the given type
159 * within the sequence of coefficients of "bmap".
161 unsigned isl_basic_map_offset(__isl_keep isl_basic_map
*bmap
,
162 enum isl_dim_type type
)
165 case isl_dim_cst
: return 0;
169 case isl_dim_div
: return 1 + isl_basic_map_var_offset(bmap
, type
);
174 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
175 enum isl_dim_type type
)
177 return isl_basic_map_offset(bset
, type
);
180 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
182 return pos(map
->dim
, type
);
185 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
186 enum isl_dim_type type
)
188 return isl_basic_map_dim(bset
, type
);
191 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
193 return isl_basic_set_dim(bset
, isl_dim_set
);
196 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
198 return isl_basic_set_dim(bset
, isl_dim_param
);
201 unsigned isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
203 return isl_basic_map_total_dim(const_bset_to_bmap(bset
));
206 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
208 return isl_set_dim(set
, isl_dim_set
);
211 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
213 return isl_set_dim(set
, isl_dim_param
);
216 unsigned isl_basic_map_n_in(__isl_keep
const isl_basic_map
*bmap
)
218 return bmap
? bmap
->dim
->n_in
: 0;
221 unsigned isl_basic_map_n_out(__isl_keep
const isl_basic_map
*bmap
)
223 return bmap
? bmap
->dim
->n_out
: 0;
226 unsigned isl_basic_map_n_param(__isl_keep
const isl_basic_map
*bmap
)
228 return bmap
? bmap
->dim
->nparam
: 0;
231 unsigned isl_basic_map_n_div(__isl_keep
const isl_basic_map
*bmap
)
233 return bmap
? bmap
->n_div
: 0;
236 unsigned isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
238 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
241 unsigned isl_map_n_in(__isl_keep
const isl_map
*map
)
243 return map
? map
->dim
->n_in
: 0;
246 unsigned isl_map_n_out(__isl_keep
const isl_map
*map
)
248 return map
? map
->dim
->n_out
: 0;
251 unsigned isl_map_n_param(__isl_keep
const isl_map
*map
)
253 return map
? map
->dim
->nparam
: 0;
256 /* Return the number of equality constraints in the description of "bmap".
257 * Return -1 on error.
259 int isl_basic_map_n_equality(__isl_keep isl_basic_map
*bmap
)
266 /* Return the number of equality constraints in the description of "bset".
267 * Return -1 on error.
269 int isl_basic_set_n_equality(__isl_keep isl_basic_set
*bset
)
271 return isl_basic_map_n_equality(bset_to_bmap(bset
));
274 /* Return the number of inequality constraints in the description of "bmap".
275 * Return -1 on error.
277 int isl_basic_map_n_inequality(__isl_keep isl_basic_map
*bmap
)
284 /* Return the number of inequality constraints in the description of "bset".
285 * Return -1 on error.
287 int isl_basic_set_n_inequality(__isl_keep isl_basic_set
*bset
)
289 return isl_basic_map_n_inequality(bset_to_bmap(bset
));
292 /* Do "bmap1" and "bmap2" have the same parameters?
294 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
295 __isl_keep isl_basic_map
*bmap2
)
297 isl_space
*space1
, *space2
;
299 space1
= isl_basic_map_peek_space(bmap1
);
300 space2
= isl_basic_map_peek_space(bmap2
);
301 return isl_space_has_equal_params(space1
, space2
);
304 /* Do "map1" and "map2" have the same parameters?
306 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
307 __isl_keep isl_map
*map2
)
309 isl_space
*space1
, *space2
;
311 space1
= isl_map_peek_space(map1
);
312 space2
= isl_map_peek_space(map2
);
313 return isl_space_has_equal_params(space1
, space2
);
316 /* Do "map" and "set" have the same parameters?
318 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
319 __isl_keep isl_set
*set
)
321 return isl_map_has_equal_params(map
, set_to_map(set
));
324 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
325 __isl_keep isl_set
*set
)
329 return isl_bool_error
;
330 m
= isl_map_has_equal_params(map
, set_to_map(set
));
333 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
334 set
->dim
, isl_dim_set
);
337 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
338 __isl_keep isl_basic_set
*bset
)
342 return isl_bool_error
;
343 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
346 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
347 bset
->dim
, isl_dim_set
);
350 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
351 __isl_keep isl_set
*set
)
355 return isl_bool_error
;
356 m
= isl_map_has_equal_params(map
, set_to_map(set
));
359 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
360 set
->dim
, isl_dim_set
);
363 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
364 __isl_keep isl_basic_set
*bset
)
368 return isl_bool_error
;
369 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
372 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
373 bset
->dim
, isl_dim_set
);
376 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
378 return bmap
? bmap
->ctx
: NULL
;
381 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
383 return bset
? bset
->ctx
: NULL
;
386 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
388 return map
? map
->ctx
: NULL
;
391 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
393 return set
? set
->ctx
: NULL
;
396 /* Return the space of "bmap".
398 __isl_keep isl_space
*isl_basic_map_peek_space(
399 __isl_keep
const isl_basic_map
*bmap
)
401 return bmap
? bmap
->dim
: NULL
;
404 /* Return the space of "bset".
406 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
408 return isl_basic_map_peek_space(bset_to_bmap(bset
));
411 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
413 return isl_space_copy(isl_basic_map_peek_space(bmap
));
416 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
418 return isl_basic_map_get_space(bset_to_bmap(bset
));
421 /* Extract the divs in "bmap" as a matrix.
423 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
431 v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
435 ctx
= isl_basic_map_get_ctx(bmap
);
436 cols
= 1 + 1 + v_div
+ bmap
->n_div
;
437 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
441 for (i
= 0; i
< bmap
->n_div
; ++i
)
442 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
447 /* Extract the divs in "bset" as a matrix.
449 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
451 return isl_basic_map_get_divs(bset
);
454 __isl_give isl_local_space
*isl_basic_map_get_local_space(
455 __isl_keep isl_basic_map
*bmap
)
462 div
= isl_basic_map_get_divs(bmap
);
463 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
466 __isl_give isl_local_space
*isl_basic_set_get_local_space(
467 __isl_keep isl_basic_set
*bset
)
469 return isl_basic_map_get_local_space(bset
);
472 /* For each known div d = floor(f/m), add the constraints
475 * -(f-(m-1)) + m d >= 0
477 * Do not finalize the result.
479 static __isl_give isl_basic_map
*add_known_div_constraints(
480 __isl_take isl_basic_map
*bmap
)
487 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
490 bmap
= isl_basic_map_cow(bmap
);
491 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
494 for (i
= 0; i
< n_div
; ++i
) {
495 if (isl_int_is_zero(bmap
->div
[i
][0]))
497 bmap
= isl_basic_map_add_div_constraints(bmap
, i
);
503 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
504 __isl_take isl_local_space
*ls
)
513 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
514 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
515 n_div
, 0, 2 * n_div
);
517 for (i
= 0; i
< n_div
; ++i
)
518 if (isl_basic_map_alloc_div(bmap
) < 0)
521 for (i
= 0; i
< n_div
; ++i
)
522 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
523 bmap
= add_known_div_constraints(bmap
);
525 isl_local_space_free(ls
);
528 isl_local_space_free(ls
);
529 isl_basic_map_free(bmap
);
533 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
534 __isl_take isl_local_space
*ls
)
536 return isl_basic_map_from_local_space(ls
);
539 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
541 return isl_space_copy(isl_map_peek_space(map
));
544 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
548 return isl_space_copy(set
->dim
);
551 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
552 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
554 bmap
= isl_basic_map_cow(bmap
);
557 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
560 bmap
= isl_basic_map_finalize(bmap
);
563 isl_basic_map_free(bmap
);
567 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
568 __isl_take isl_basic_set
*bset
, const char *s
)
570 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
573 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
574 enum isl_dim_type type
)
576 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
579 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
580 enum isl_dim_type type
, const char *s
)
584 map
= isl_map_cow(map
);
588 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
592 for (i
= 0; i
< map
->n
; ++i
) {
593 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
604 /* Replace the identifier of the tuple of type "type" by "id".
606 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
607 __isl_take isl_basic_map
*bmap
,
608 enum isl_dim_type type
, __isl_take isl_id
*id
)
610 bmap
= isl_basic_map_cow(bmap
);
613 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
615 return isl_basic_map_free(bmap
);
616 bmap
= isl_basic_map_finalize(bmap
);
623 /* Replace the identifier of the tuple by "id".
625 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
626 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
628 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
631 /* Does the input or output tuple have a name?
633 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
635 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
638 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
639 enum isl_dim_type type
)
641 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
644 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
647 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
651 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
652 enum isl_dim_type type
, __isl_take isl_id
*id
)
654 map
= isl_map_cow(map
);
658 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
660 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
666 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
667 __isl_take isl_id
*id
)
669 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
672 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
673 enum isl_dim_type type
)
675 map
= isl_map_cow(map
);
679 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
681 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
684 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
686 return isl_map_reset_tuple_id(set
, isl_dim_set
);
689 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
691 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
694 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
695 enum isl_dim_type type
)
697 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
700 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
702 return isl_map_has_tuple_id(set
, isl_dim_set
);
705 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
707 return isl_map_get_tuple_id(set
, isl_dim_set
);
710 /* Does the set tuple have a name?
712 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
715 return isl_bool_error
;
716 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
720 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
722 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
725 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
727 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
730 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
731 enum isl_dim_type type
, unsigned pos
)
733 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
736 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
737 enum isl_dim_type type
, unsigned pos
)
739 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
742 /* Does the given dimension have a name?
744 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
745 enum isl_dim_type type
, unsigned pos
)
748 return isl_bool_error
;
749 return isl_space_has_dim_name(map
->dim
, type
, pos
);
752 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
753 enum isl_dim_type type
, unsigned pos
)
755 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
758 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
759 enum isl_dim_type type
, unsigned pos
)
761 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
764 /* Does the given dimension have a name?
766 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
767 enum isl_dim_type type
, unsigned pos
)
770 return isl_bool_error
;
771 return isl_space_has_dim_name(set
->dim
, type
, pos
);
774 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
775 __isl_take isl_basic_map
*bmap
,
776 enum isl_dim_type type
, unsigned pos
, const char *s
)
778 bmap
= isl_basic_map_cow(bmap
);
781 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
784 return isl_basic_map_finalize(bmap
);
786 isl_basic_map_free(bmap
);
790 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
791 enum isl_dim_type type
, unsigned pos
, const char *s
)
795 map
= isl_map_cow(map
);
799 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
803 for (i
= 0; i
< map
->n
; ++i
) {
804 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
815 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
816 __isl_take isl_basic_set
*bset
,
817 enum isl_dim_type type
, unsigned pos
, const char *s
)
819 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
823 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
824 enum isl_dim_type type
, unsigned pos
, const char *s
)
826 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
830 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
831 enum isl_dim_type type
, unsigned pos
)
834 return isl_bool_error
;
835 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
838 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
839 enum isl_dim_type type
, unsigned pos
)
841 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
844 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
845 enum isl_dim_type type
, unsigned pos
)
847 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
850 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
851 enum isl_dim_type type
, unsigned pos
)
853 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
856 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
857 enum isl_dim_type type
, unsigned pos
)
859 return isl_map_has_dim_id(set
, type
, pos
);
862 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
863 enum isl_dim_type type
, unsigned pos
)
865 return isl_map_get_dim_id(set
, type
, pos
);
868 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
869 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
871 map
= isl_map_cow(map
);
875 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
877 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
883 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
884 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
886 return isl_map_set_dim_id(set
, type
, pos
, id
);
889 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
890 __isl_keep isl_id
*id
)
894 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
897 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
898 __isl_keep isl_id
*id
)
900 return isl_map_find_dim_by_id(set
, type
, id
);
903 /* Return the position of the dimension of the given type and name
905 * Return -1 if no such dimension can be found.
907 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
908 enum isl_dim_type type
, const char *name
)
912 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
915 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
920 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
923 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
926 return isl_map_find_dim_by_name(set
, type
, name
);
929 /* Check whether equality i of bset is a pure stride constraint
930 * on a single dimension, i.e., of the form
934 * with k a constant and e an existentially quantified variable.
936 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
945 return isl_bool_error
;
947 if (!isl_int_is_zero(bset
->eq
[i
][0]))
948 return isl_bool_false
;
950 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
951 d
= isl_basic_set_dim(bset
, isl_dim_set
);
952 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
954 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
955 return isl_bool_false
;
956 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
958 return isl_bool_false
;
959 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
961 return isl_bool_false
;
963 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
965 return isl_bool_false
;
966 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
967 n_div
- pos2
- 1) != -1)
968 return isl_bool_false
;
969 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
970 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
971 return isl_bool_false
;
973 return isl_bool_true
;
976 /* Reset the user pointer on all identifiers of parameters and tuples
977 * of the space of "map".
979 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
983 space
= isl_map_get_space(map
);
984 space
= isl_space_reset_user(space
);
985 map
= isl_map_reset_space(map
, space
);
990 /* Reset the user pointer on all identifiers of parameters and tuples
991 * of the space of "set".
993 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
995 return isl_map_reset_user(set
);
998 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
1001 return isl_bool_error
;
1002 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
1005 /* Has "map" been marked as a rational map?
1006 * In particular, have all basic maps in "map" been marked this way?
1007 * An empty map is not considered to be rational.
1008 * Maps where only some of the basic maps are marked rational
1011 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
1017 return isl_bool_error
;
1019 return isl_bool_false
;
1020 rational
= isl_basic_map_is_rational(map
->p
[0]);
1023 for (i
= 1; i
< map
->n
; ++i
) {
1024 isl_bool rational_i
;
1026 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
1029 if (rational
!= rational_i
)
1030 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
1031 "mixed rational and integer basic maps "
1032 "not supported", return isl_bool_error
);
1038 /* Has "set" been marked as a rational set?
1039 * In particular, have all basic set in "set" been marked this way?
1040 * An empty set is not considered to be rational.
1041 * Sets where only some of the basic sets are marked rational
1044 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
1046 return isl_map_is_rational(set
);
1049 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
1051 return isl_basic_map_is_rational(bset
);
1054 /* Does "bmap" contain any rational points?
1056 * If "bmap" has an equality for each dimension, equating the dimension
1057 * to an integer constant, then it has no rational points, even if it
1058 * is marked as rational.
1060 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
1062 isl_bool has_rational
= isl_bool_true
;
1066 return isl_bool_error
;
1067 if (isl_basic_map_plain_is_empty(bmap
))
1068 return isl_bool_false
;
1069 if (!isl_basic_map_is_rational(bmap
))
1070 return isl_bool_false
;
1071 bmap
= isl_basic_map_copy(bmap
);
1072 bmap
= isl_basic_map_implicit_equalities(bmap
);
1074 return isl_bool_error
;
1075 total
= isl_basic_map_total_dim(bmap
);
1076 if (bmap
->n_eq
== total
) {
1078 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1079 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1082 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1083 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1085 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1090 if (i
== bmap
->n_eq
)
1091 has_rational
= isl_bool_false
;
1093 isl_basic_map_free(bmap
);
1095 return has_rational
;
1098 /* Does "map" contain any rational points?
1100 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1103 isl_bool has_rational
;
1106 return isl_bool_error
;
1107 for (i
= 0; i
< map
->n
; ++i
) {
1108 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1109 if (has_rational
< 0 || has_rational
)
1110 return has_rational
;
1112 return isl_bool_false
;
1115 /* Does "set" contain any rational points?
1117 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1119 return isl_map_has_rational(set
);
1122 /* Is this basic set a parameter domain?
1124 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1127 return isl_bool_error
;
1128 return isl_space_is_params(bset
->dim
);
1131 /* Is this set a parameter domain?
1133 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1136 return isl_bool_error
;
1137 return isl_space_is_params(set
->dim
);
1140 /* Is this map actually a parameter domain?
1141 * Users should never call this function. Outside of isl,
1142 * a map can never be a parameter domain.
1144 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1147 return isl_bool_error
;
1148 return isl_space_is_params(map
->dim
);
1151 static __isl_give isl_basic_map
*basic_map_init(isl_ctx
*ctx
,
1152 __isl_take isl_basic_map
*bmap
, unsigned extra
,
1153 unsigned n_eq
, unsigned n_ineq
)
1156 isl_space
*space
= isl_basic_map_peek_space(bmap
);
1157 unsigned n_var
= isl_space_dim(space
, isl_dim_all
);
1158 size_t row_size
= 1 + n_var
+ extra
;
1164 return isl_basic_map_free(bmap
);
1166 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1167 if (isl_blk_is_error(bmap
->block
))
1170 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1171 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1175 bmap
->block2
= isl_blk_empty();
1178 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1179 if (isl_blk_is_error(bmap
->block2
))
1182 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1187 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1188 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1190 for (i
= 0; i
< extra
; ++i
)
1191 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1195 bmap
->c_size
= n_eq
+ n_ineq
;
1196 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1197 bmap
->extra
= extra
;
1201 bmap
->sample
= NULL
;
1205 isl_basic_map_free(bmap
);
1209 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1210 unsigned nparam
, unsigned dim
, unsigned extra
,
1211 unsigned n_eq
, unsigned n_ineq
)
1213 struct isl_basic_map
*bmap
;
1216 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1220 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1221 return bset_from_bmap(bmap
);
1224 __isl_give isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1225 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1227 struct isl_basic_map
*bmap
;
1230 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1231 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1232 return bset_from_bmap(bmap
);
1234 isl_space_free(dim
);
1238 __isl_give isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*space
,
1239 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1241 struct isl_basic_map
*bmap
;
1245 bmap
= isl_calloc_type(space
->ctx
, struct isl_basic_map
);
1250 return basic_map_init(space
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1252 isl_space_free(space
);
1256 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1257 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1258 unsigned n_eq
, unsigned n_ineq
)
1260 struct isl_basic_map
*bmap
;
1263 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1267 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1271 static __isl_give isl_basic_map
*dup_constraints(__isl_take isl_basic_map
*dst
,
1272 __isl_keep isl_basic_map
*src
)
1275 unsigned total
= isl_basic_map_total_dim(src
);
1280 for (i
= 0; i
< src
->n_eq
; ++i
) {
1281 int j
= isl_basic_map_alloc_equality(dst
);
1283 return isl_basic_map_free(dst
);
1284 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1287 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1288 int j
= isl_basic_map_alloc_inequality(dst
);
1290 return isl_basic_map_free(dst
);
1291 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1294 for (i
= 0; i
< src
->n_div
; ++i
) {
1295 int j
= isl_basic_map_alloc_div(dst
);
1297 return isl_basic_map_free(dst
);
1298 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1300 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1304 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1306 struct isl_basic_map
*dup
;
1310 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1311 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1312 dup
= dup_constraints(dup
, bmap
);
1315 dup
->flags
= bmap
->flags
;
1316 dup
->sample
= isl_vec_copy(bmap
->sample
);
1320 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1322 struct isl_basic_map
*dup
;
1324 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1325 return bset_from_bmap(dup
);
1328 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1333 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1337 return isl_basic_set_dup(bset
);
1340 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1349 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1354 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1358 bmap
= isl_basic_map_dup(bmap
);
1360 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1364 __isl_give isl_map
*isl_map_copy(__isl_keep isl_map
*map
)
1373 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1378 if (--bmap
->ref
> 0)
1381 isl_ctx_deref(bmap
->ctx
);
1383 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1385 isl_blk_free(bmap
->ctx
, bmap
->block
);
1386 isl_vec_free(bmap
->sample
);
1387 isl_space_free(bmap
->dim
);
1393 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1395 return isl_basic_map_free(bset_to_bmap(bset
));
1398 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1400 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1403 /* Check that "bset" does not involve any parameters.
1405 isl_stat
isl_basic_set_check_no_params(__isl_keep isl_basic_set
*bset
)
1408 return isl_stat_error
;
1409 if (isl_basic_set_dim(bset
, isl_dim_param
) != 0)
1410 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
1411 "basic set should not have any parameters",
1412 return isl_stat_error
);
1416 /* Check that "bset" does not involve any local variables.
1418 isl_stat
isl_basic_set_check_no_locals(__isl_keep isl_basic_set
*bset
)
1421 return isl_stat_error
;
1422 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
1423 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
1424 "basic set should not have any local variables",
1425 return isl_stat_error
);
1429 /* Check that "map" has only named parameters, reporting an error
1432 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1434 return isl_space_check_named_params(isl_map_peek_space(map
));
1437 /* Check that "bmap" has only named parameters, reporting an error
1440 static isl_stat
isl_basic_map_check_named_params(__isl_keep isl_basic_map
*bmap
)
1442 return isl_space_check_named_params(isl_basic_map_peek_space(bmap
));
1445 /* Check that "bmap1" and "bmap2" have the same parameters,
1446 * reporting an error if they do not.
1448 static isl_stat
isl_basic_map_check_equal_params(
1449 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1453 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1455 return isl_stat_error
;
1457 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1458 "parameters don't match", return isl_stat_error
);
1462 __isl_give isl_map
*isl_map_align_params_map_map_and(
1463 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1464 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1465 __isl_take isl_map
*map2
))
1469 if (isl_map_has_equal_params(map1
, map2
))
1470 return fn(map1
, map2
);
1471 if (isl_map_check_named_params(map1
) < 0)
1473 if (isl_map_check_named_params(map2
) < 0)
1475 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1476 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1477 return fn(map1
, map2
);
1484 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1485 __isl_keep isl_map
*map2
,
1486 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1491 return isl_bool_error
;
1492 if (isl_map_has_equal_params(map1
, map2
))
1493 return fn(map1
, map2
);
1494 if (isl_map_check_named_params(map1
) < 0)
1495 return isl_bool_error
;
1496 if (isl_map_check_named_params(map2
) < 0)
1497 return isl_bool_error
;
1498 map1
= isl_map_copy(map1
);
1499 map2
= isl_map_copy(map2
);
1500 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1501 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1508 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1510 struct isl_ctx
*ctx
;
1514 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1515 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1517 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1518 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1519 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1520 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1521 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1523 int j
= isl_basic_map_alloc_inequality(bmap
);
1527 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1528 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1535 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1536 bmap
->extra
- bmap
->n_div
);
1537 return bmap
->n_eq
++;
1540 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1542 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1545 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1549 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1554 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1556 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1559 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1564 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1566 if (pos
!= bmap
->n_eq
- 1) {
1568 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1569 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1575 /* Turn inequality "pos" of "bmap" into an equality.
1577 * In particular, we move the inequality in front of the equalities
1578 * and move the last inequality in the position of the moved inequality.
1579 * Note that isl_tab_make_equalities_explicit depends on this particular
1580 * change in the ordering of the constraints.
1582 void isl_basic_map_inequality_to_equality(
1583 struct isl_basic_map
*bmap
, unsigned pos
)
1587 t
= bmap
->ineq
[pos
];
1588 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1589 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1594 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1595 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1596 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1597 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1600 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1602 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1605 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1607 struct isl_ctx
*ctx
;
1611 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1612 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1613 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1614 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1615 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1616 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1617 1 + isl_basic_map_total_dim(bmap
),
1618 bmap
->extra
- bmap
->n_div
);
1619 return bmap
->n_ineq
++;
1622 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1624 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1627 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1631 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1636 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1638 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1641 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1646 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1648 if (pos
!= bmap
->n_ineq
- 1) {
1649 t
= bmap
->ineq
[pos
];
1650 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1651 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1652 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1658 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1660 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1663 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1669 empty
= isl_basic_map_plain_is_empty(bmap
);
1671 return isl_basic_map_free(bmap
);
1675 bmap
= isl_basic_map_cow(bmap
);
1676 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1679 k
= isl_basic_map_alloc_equality(bmap
);
1682 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1685 isl_basic_map_free(bmap
);
1689 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1692 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1695 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1700 bmap
= isl_basic_map_cow(bmap
);
1701 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1704 k
= isl_basic_map_alloc_inequality(bmap
);
1707 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1710 isl_basic_map_free(bmap
);
1714 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1717 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1720 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1724 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1725 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1726 1 + 1 + isl_basic_map_total_dim(bmap
),
1727 bmap
->extra
- bmap
->n_div
);
1728 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1729 return bmap
->n_div
++;
1732 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1734 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1738 #define TYPE isl_basic_map
1739 #include "check_type_range_templ.c"
1741 /* Check that there are "n" dimensions of type "type" starting at "first"
1744 isl_stat
isl_basic_set_check_range(__isl_keep isl_basic_set
*bset
,
1745 enum isl_dim_type type
, unsigned first
, unsigned n
)
1747 return isl_basic_map_check_range(bset_to_bmap(bset
),
1751 /* Insert an extra integer division, prescribed by "div", to "bmap"
1752 * at (integer division) position "pos".
1754 * The integer division is first added at the end and then moved
1755 * into the right position.
1757 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1758 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1762 bmap
= isl_basic_map_cow(bmap
);
1764 return isl_basic_map_free(bmap
);
1766 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1767 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1768 "unexpected size", return isl_basic_map_free(bmap
));
1769 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1770 return isl_basic_map_free(bmap
);
1772 bmap
= isl_basic_map_extend_space(bmap
,
1773 isl_basic_map_get_space(bmap
), 1, 0, 2);
1774 k
= isl_basic_map_alloc_div(bmap
);
1776 return isl_basic_map_free(bmap
);
1777 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1778 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1780 for (i
= k
; i
> pos
; --i
)
1781 bmap
= isl_basic_map_swap_div(bmap
, i
, i
- 1);
1786 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1789 return isl_stat_error
;
1790 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1795 static __isl_give isl_basic_map
*add_constraints(
1796 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1797 unsigned i_pos
, unsigned o_pos
)
1799 unsigned total
, n_param
, n_in
, o_in
, n_out
, o_out
, n_div
;
1802 struct isl_dim_map
*dim_map
;
1804 space
= isl_basic_map_peek_space(bmap2
);
1805 if (!bmap1
|| !space
)
1808 total
= isl_basic_map_dim(bmap1
, isl_dim_all
);
1809 n_param
= isl_basic_map_dim(bmap2
, isl_dim_param
);
1810 n_in
= isl_basic_map_dim(bmap2
, isl_dim_in
);
1811 o_in
= isl_basic_map_offset(bmap1
, isl_dim_in
) - 1 + i_pos
;
1812 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
1813 o_out
= isl_basic_map_offset(bmap1
, isl_dim_out
) - 1 + o_pos
;
1814 n_div
= isl_basic_map_dim(bmap2
, isl_dim_div
);
1815 ctx
= isl_basic_map_get_ctx(bmap1
);
1816 dim_map
= isl_dim_map_alloc(ctx
, total
+ n_div
);
1817 isl_dim_map_dim_range(dim_map
, space
, isl_dim_param
, 0, n_param
, 0);
1818 isl_dim_map_dim_range(dim_map
, space
, isl_dim_in
, 0, n_in
, o_in
);
1819 isl_dim_map_dim_range(dim_map
, space
, isl_dim_out
, 0, n_out
, o_out
);
1820 isl_dim_map_div(dim_map
, bmap2
, total
);
1822 return isl_basic_map_add_constraints_dim_map(bmap1
, bmap2
, dim_map
);
1824 isl_basic_map_free(bmap1
);
1825 isl_basic_map_free(bmap2
);
1829 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1830 struct isl_basic_set
*bset2
, unsigned pos
)
1832 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1833 bset_to_bmap(bset2
), 0, pos
));
1836 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1837 __isl_take isl_basic_map
*base
, __isl_take isl_space
*space
,
1838 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1840 struct isl_basic_map
*ext
;
1850 dims_ok
= isl_space_is_equal(base
->dim
, space
) &&
1851 base
->extra
>= base
->n_div
+ extra
;
1853 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1854 room_for_ineq(base
, n_ineq
)) {
1855 isl_space_free(space
);
1859 isl_assert(base
->ctx
, base
->dim
->nparam
<= space
->nparam
, goto error
);
1860 isl_assert(base
->ctx
, base
->dim
->n_in
<= space
->n_in
, goto error
);
1861 isl_assert(base
->ctx
, base
->dim
->n_out
<= space
->n_out
, goto error
);
1862 extra
+= base
->extra
;
1864 n_ineq
+= base
->n_ineq
;
1866 ext
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1872 ext
->sample
= isl_vec_copy(base
->sample
);
1873 flags
= base
->flags
;
1874 ext
= add_constraints(ext
, base
, 0, 0);
1877 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1883 isl_space_free(space
);
1884 isl_basic_map_free(base
);
1888 __isl_give isl_basic_set
*isl_basic_set_extend_space(
1889 __isl_take isl_basic_set
*base
,
1890 __isl_take isl_space
*dim
, unsigned extra
,
1891 unsigned n_eq
, unsigned n_ineq
)
1893 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1894 dim
, extra
, n_eq
, n_ineq
));
1897 struct isl_basic_map
*isl_basic_map_extend_constraints(
1898 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1902 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1906 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1907 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1908 unsigned n_eq
, unsigned n_ineq
)
1910 struct isl_basic_map
*bmap
;
1915 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1919 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1922 isl_basic_map_free(base
);
1926 struct isl_basic_set
*isl_basic_set_extend_constraints(
1927 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1929 isl_basic_map
*bmap
= bset_to_bmap(base
);
1930 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1931 return bset_from_bmap(bmap
);
1934 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1936 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1939 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1944 if (bmap
->ref
> 1) {
1946 bmap
= isl_basic_map_dup(bmap
);
1949 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1950 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1955 /* Clear all cached information in "map", either because it is about
1956 * to be modified or because it is being freed.
1957 * Always return the same pointer that is passed in.
1958 * This is needed for the use in isl_map_free.
1960 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1962 isl_basic_map_free(map
->cached_simple_hull
[0]);
1963 isl_basic_map_free(map
->cached_simple_hull
[1]);
1964 map
->cached_simple_hull
[0] = NULL
;
1965 map
->cached_simple_hull
[1] = NULL
;
1969 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1971 return isl_map_cow(set
);
1974 /* Return an isl_map that is equal to "map" and that has only
1975 * a single reference.
1977 * If the original input already has only one reference, then
1978 * simply return it, but clear all cached information, since
1979 * it may be rendered invalid by the operations that will be
1980 * performed on the result.
1982 * Otherwise, create a duplicate (without any cached information).
1984 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
1990 return clear_caches(map
);
1992 return isl_map_dup(map
);
1995 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1996 unsigned a_len
, unsigned b_len
)
1998 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1999 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
2000 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
2003 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
2004 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
2009 if (isl_basic_map_check_range(bmap
, isl_dim_all
, pos
- 1, n1
+ n2
) < 0)
2012 if (n1
== 0 || n2
== 0)
2015 bmap
= isl_basic_map_cow(bmap
);
2019 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
2020 if (isl_blk_is_error(blk
))
2023 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2025 bmap
->eq
[i
] + pos
, n1
, n2
);
2027 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2029 bmap
->ineq
[i
] + pos
, n1
, n2
);
2031 for (i
= 0; i
< bmap
->n_div
; ++i
)
2033 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2035 isl_blk_free(bmap
->ctx
, blk
);
2037 ISL_F_CLR(bmap
, ISL_BASIC_SET_SORTED
);
2038 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2039 return isl_basic_map_finalize(bmap
);
2041 isl_basic_map_free(bmap
);
2045 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2046 __isl_take isl_basic_map
*bmap
)
2052 total
= isl_basic_map_total_dim(bmap
);
2053 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2054 return isl_basic_map_free(bmap
);
2055 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2057 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2059 i
= isl_basic_map_alloc_equality(bmap
);
2063 isl_int_set_si(bmap
->eq
[i
][0], 1);
2064 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2065 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2066 isl_vec_free(bmap
->sample
);
2067 bmap
->sample
= NULL
;
2068 return isl_basic_map_finalize(bmap
);
2070 isl_basic_map_free(bmap
);
2074 __isl_give isl_basic_set
*isl_basic_set_set_to_empty(
2075 __isl_take isl_basic_set
*bset
)
2077 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2080 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2081 __isl_take isl_basic_map
*bmap
)
2086 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2089 bmap
= isl_basic_map_cow(bmap
);
2093 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2095 return isl_basic_map_finalize(bmap
);
2098 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2099 __isl_take isl_basic_set
*bset
)
2101 return isl_basic_map_set_rational(bset
);
2104 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2105 __isl_take isl_basic_set
*bset
)
2110 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2113 bset
= isl_basic_set_cow(bset
);
2117 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2119 return isl_basic_set_finalize(bset
);
2122 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2126 map
= isl_map_cow(map
);
2129 for (i
= 0; i
< map
->n
; ++i
) {
2130 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2140 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2142 return isl_map_set_rational(set
);
2145 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2148 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2150 isl_int
*t
= bmap
->div
[a
];
2151 bmap
->div
[a
] = bmap
->div
[b
];
2155 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2156 * div definitions accordingly.
2158 __isl_give isl_basic_map
*isl_basic_map_swap_div(__isl_take isl_basic_map
*bmap
,
2164 off
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
2166 return isl_basic_map_free(bmap
);
2168 swap_div(bmap
, a
, b
);
2170 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2171 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2173 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2174 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2176 for (i
= 0; i
< bmap
->n_div
; ++i
)
2177 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2178 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2183 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2185 isl_seq_cpy(c
, c
+ n
, rem
);
2186 isl_seq_clr(c
+ rem
, n
);
2189 /* Drop n dimensions starting at first.
2191 * In principle, this frees up some extra variables as the number
2192 * of columns remains constant, but we would have to extend
2193 * the div array too as the number of rows in this array is assumed
2194 * to be equal to extra.
2196 __isl_give isl_basic_set
*isl_basic_set_drop_dims(
2197 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2199 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2202 /* Move "n" divs starting at "first" to the end of the list of divs.
2204 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2205 unsigned first
, unsigned n
)
2210 if (first
+ n
== bmap
->n_div
)
2213 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2216 for (i
= 0; i
< n
; ++i
)
2217 div
[i
] = bmap
->div
[first
+ i
];
2218 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2219 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2220 for (i
= 0; i
< n
; ++i
)
2221 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2225 isl_basic_map_free(bmap
);
2230 #define TYPE isl_map
2232 #include "check_type_range_templ.c"
2234 /* Check that there are "n" dimensions of type "type" starting at "first"
2237 static isl_stat
isl_set_check_range(__isl_keep isl_set
*set
,
2238 enum isl_dim_type type
, unsigned first
, unsigned n
)
2240 return isl_map_check_range(set_to_map(set
), type
, first
, n
);
2243 /* Drop "n" dimensions of type "type" starting at "first".
2244 * Perform the core computation, without cowing or
2245 * simplifying and finalizing the result.
2247 * In principle, this frees up some extra variables as the number
2248 * of columns remains constant, but we would have to extend
2249 * the div array too as the number of rows in this array is assumed
2250 * to be equal to extra.
2252 __isl_give isl_basic_map
*isl_basic_map_drop_core(
2253 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2254 unsigned first
, unsigned n
)
2260 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2261 return isl_basic_map_free(bmap
);
2263 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2264 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2265 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2266 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2268 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2269 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2271 for (i
= 0; i
< bmap
->n_div
; ++i
)
2272 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2274 if (type
== isl_dim_div
) {
2275 bmap
= move_divs_last(bmap
, first
, n
);
2278 if (isl_basic_map_free_div(bmap
, n
) < 0)
2279 return isl_basic_map_free(bmap
);
2281 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2283 return isl_basic_map_free(bmap
);
2285 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
2286 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2290 /* Drop "n" dimensions of type "type" starting at "first".
2292 * In principle, this frees up some extra variables as the number
2293 * of columns remains constant, but we would have to extend
2294 * the div array too as the number of rows in this array is assumed
2295 * to be equal to extra.
2297 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2298 enum isl_dim_type type
, unsigned first
, unsigned n
)
2302 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2305 bmap
= isl_basic_map_cow(bmap
);
2309 bmap
= isl_basic_map_drop_core(bmap
, type
, first
, n
);
2311 bmap
= isl_basic_map_simplify(bmap
);
2312 return isl_basic_map_finalize(bmap
);
2315 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2316 enum isl_dim_type type
, unsigned first
, unsigned n
)
2318 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2322 /* No longer consider "map" to be normalized.
2324 static __isl_give isl_map
*isl_map_unmark_normalized(__isl_take isl_map
*map
)
2328 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2332 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2333 enum isl_dim_type type
, unsigned first
, unsigned n
)
2337 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2338 return isl_map_free(map
);
2340 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2342 map
= isl_map_cow(map
);
2345 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2349 for (i
= 0; i
< map
->n
; ++i
) {
2350 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2354 map
= isl_map_unmark_normalized(map
);
2362 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2363 enum isl_dim_type type
, unsigned first
, unsigned n
)
2365 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2368 /* Drop the integer division at position "div", which is assumed
2369 * not to appear in any of the constraints or
2370 * in any of the other integer divisions.
2372 * Since the integer division is redundant, there is no need to cow.
2374 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2375 __isl_take isl_basic_map
*bmap
, unsigned div
)
2377 return isl_basic_map_drop_core(bmap
, isl_dim_div
, div
, 1);
2380 /* Eliminate the specified n dimensions starting at first from the
2381 * constraints, without removing the dimensions from the space.
2382 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2384 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2385 enum isl_dim_type type
, unsigned first
, unsigned n
)
2392 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2393 return isl_map_free(map
);
2395 map
= isl_map_cow(map
);
2399 for (i
= 0; i
< map
->n
; ++i
) {
2400 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2410 /* Eliminate the specified n dimensions starting at first from the
2411 * constraints, without removing the dimensions from the space.
2412 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2414 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2415 enum isl_dim_type type
, unsigned first
, unsigned n
)
2417 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2420 /* Eliminate the specified n dimensions starting at first from the
2421 * constraints, without removing the dimensions from the space.
2422 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2424 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2425 unsigned first
, unsigned n
)
2427 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2430 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2431 __isl_take isl_basic_map
*bmap
)
2435 v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
2437 return isl_basic_map_free(bmap
);
2438 bmap
= isl_basic_map_eliminate_vars(bmap
, v_div
, bmap
->n_div
);
2442 return isl_basic_map_finalize(bmap
);
2445 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2446 __isl_take isl_basic_set
*bset
)
2448 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2451 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2460 map
= isl_map_cow(map
);
2464 for (i
= 0; i
< map
->n
; ++i
) {
2465 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2475 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2477 return isl_map_remove_divs(set
);
2480 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2481 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2482 unsigned first
, unsigned n
)
2484 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2485 return isl_basic_map_free(bmap
);
2486 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2488 bmap
= isl_basic_map_eliminate_vars(bmap
,
2489 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2492 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2494 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2498 /* Return true if the definition of the given div (recursively) involves
2499 * any of the given variables.
2501 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2502 unsigned first
, unsigned n
)
2505 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2507 if (isl_int_is_zero(bmap
->div
[div
][0]))
2508 return isl_bool_false
;
2509 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2510 return isl_bool_true
;
2512 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2515 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2517 involves
= div_involves_vars(bmap
, i
, first
, n
);
2518 if (involves
< 0 || involves
)
2522 return isl_bool_false
;
2525 /* Try and add a lower and/or upper bound on "div" to "bmap"
2526 * based on inequality "i".
2527 * "total" is the total number of variables (excluding the divs).
2528 * "v" is a temporary object that can be used during the calculations.
2529 * If "lb" is set, then a lower bound should be constructed.
2530 * If "ub" is set, then an upper bound should be constructed.
2532 * The calling function has already checked that the inequality does not
2533 * reference "div", but we still need to check that the inequality is
2534 * of the right form. We'll consider the case where we want to construct
2535 * a lower bound. The construction of upper bounds is similar.
2537 * Let "div" be of the form
2539 * q = floor((a + f(x))/d)
2541 * We essentially check if constraint "i" is of the form
2545 * so that we can use it to derive a lower bound on "div".
2546 * However, we allow a slightly more general form
2550 * with the condition that the coefficients of g(x) - f(x) are all
2552 * Rewriting this constraint as
2556 * adding a + f(x) to both sides and dividing by d, we obtain
2558 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2560 * Taking the floor on both sides, we obtain
2562 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2566 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2568 * In the case of an upper bound, we construct the constraint
2570 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2573 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2574 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2575 unsigned total
, isl_int v
, int lb
, int ub
)
2579 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2581 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2582 bmap
->div
[div
][1 + 1 + j
]);
2583 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2586 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2587 bmap
->div
[div
][1 + 1 + j
]);
2588 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2594 bmap
= isl_basic_map_cow(bmap
);
2595 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2597 int k
= isl_basic_map_alloc_inequality(bmap
);
2600 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2601 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2602 bmap
->div
[div
][1 + j
]);
2603 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2604 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2606 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2609 int k
= isl_basic_map_alloc_inequality(bmap
);
2612 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2613 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2614 bmap
->div
[div
][1 + j
]);
2615 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2616 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2618 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2623 isl_basic_map_free(bmap
);
2627 /* This function is called right before "div" is eliminated from "bmap"
2628 * using Fourier-Motzkin.
2629 * Look through the constraints of "bmap" for constraints on the argument
2630 * of the integer division and use them to construct constraints on the
2631 * integer division itself. These constraints can then be combined
2632 * during the Fourier-Motzkin elimination.
2633 * Note that it is only useful to introduce lower bounds on "div"
2634 * if "bmap" already contains upper bounds on "div" as the newly
2635 * introduce lower bounds can then be combined with the pre-existing
2636 * upper bounds. Similarly for upper bounds.
2637 * We therefore first check if "bmap" contains any lower and/or upper bounds
2640 * It is interesting to note that the introduction of these constraints
2641 * can indeed lead to more accurate results, even when compared to
2642 * deriving constraints on the argument of "div" from constraints on "div".
2643 * Consider, for example, the set
2645 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2647 * The second constraint can be rewritten as
2649 * 2 * [(-i-2j+3)/4] + k >= 0
2651 * from which we can derive
2653 * -i - 2j + 3 >= -2k
2659 * Combined with the first constraint, we obtain
2661 * -3 <= 3 + 2k or k >= -3
2663 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2664 * the first constraint, we obtain
2666 * [(i + 2j)/4] >= [-3/4] = -1
2668 * Combining this constraint with the second constraint, we obtain
2672 static __isl_give isl_basic_map
*insert_bounds_on_div(
2673 __isl_take isl_basic_map
*bmap
, int div
)
2676 int check_lb
, check_ub
;
2683 if (isl_int_is_zero(bmap
->div
[div
][0]))
2686 v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
2688 return isl_basic_map_free(bmap
);
2692 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2693 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + v_div
+ div
]);
2700 if (!check_lb
&& !check_ub
)
2705 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2706 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + v_div
+ div
]))
2709 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, v_div
, v
,
2710 check_lb
, check_ub
);
2718 /* Remove all divs (recursively) involving any of the given dimensions
2719 * in their definitions.
2721 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2722 __isl_take isl_basic_map
*bmap
,
2723 enum isl_dim_type type
, unsigned first
, unsigned n
)
2727 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2728 return isl_basic_map_free(bmap
);
2729 first
+= isl_basic_map_offset(bmap
, type
);
2731 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2734 involves
= div_involves_vars(bmap
, i
, first
, n
);
2736 return isl_basic_map_free(bmap
);
2739 bmap
= insert_bounds_on_div(bmap
, i
);
2740 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2749 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2750 __isl_take isl_basic_set
*bset
,
2751 enum isl_dim_type type
, unsigned first
, unsigned n
)
2753 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2756 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2757 enum isl_dim_type type
, unsigned first
, unsigned n
)
2766 map
= isl_map_cow(map
);
2770 for (i
= 0; i
< map
->n
; ++i
) {
2771 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2782 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2783 enum isl_dim_type type
, unsigned first
, unsigned n
)
2785 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2789 /* Does the description of "bmap" depend on the specified dimensions?
2790 * We also check whether the dimensions appear in any of the div definitions.
2791 * In principle there is no need for this check. If the dimensions appear
2792 * in a div definition, they also appear in the defining constraints of that
2795 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2796 enum isl_dim_type type
, unsigned first
, unsigned n
)
2800 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2801 return isl_bool_error
;
2803 first
+= isl_basic_map_offset(bmap
, type
);
2804 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2805 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2806 return isl_bool_true
;
2807 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2808 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2809 return isl_bool_true
;
2810 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2811 if (isl_int_is_zero(bmap
->div
[i
][0]))
2813 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2814 return isl_bool_true
;
2817 return isl_bool_false
;
2820 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2821 enum isl_dim_type type
, unsigned first
, unsigned n
)
2825 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2826 return isl_bool_error
;
2828 for (i
= 0; i
< map
->n
; ++i
) {
2829 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2831 if (involves
< 0 || involves
)
2835 return isl_bool_false
;
2838 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2839 enum isl_dim_type type
, unsigned first
, unsigned n
)
2841 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2844 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2845 enum isl_dim_type type
, unsigned first
, unsigned n
)
2847 return isl_map_involves_dims(set
, type
, first
, n
);
2850 /* Drop all constraints in bmap that involve any of the dimensions
2851 * first to first+n-1.
2852 * This function only performs the actual removal of constraints.
2854 * This function should not call finalize since it is used by
2855 * remove_redundant_divs, which in turn is called by isl_basic_map_finalize.
2857 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2858 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2865 bmap
= isl_basic_map_cow(bmap
);
2870 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2871 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2873 isl_basic_map_drop_equality(bmap
, i
);
2876 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2877 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2879 isl_basic_map_drop_inequality(bmap
, i
);
2885 /* Drop all constraints in bset that involve any of the dimensions
2886 * first to first+n-1.
2887 * This function only performs the actual removal of constraints.
2889 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2890 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2892 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2895 /* Drop all constraints in bmap that do not involve any of the dimensions
2896 * first to first + n - 1 of the given type.
2898 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2899 __isl_take isl_basic_map
*bmap
,
2900 enum isl_dim_type type
, unsigned first
, unsigned n
)
2905 isl_space
*space
= isl_basic_map_get_space(bmap
);
2906 isl_basic_map_free(bmap
);
2907 return isl_basic_map_universe(space
);
2909 bmap
= isl_basic_map_cow(bmap
);
2913 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2914 return isl_basic_map_free(bmap
);
2916 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2918 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2919 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2921 isl_basic_map_drop_equality(bmap
, i
);
2924 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2925 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2927 isl_basic_map_drop_inequality(bmap
, i
);
2930 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2934 /* Drop all constraints in bset that do not involve any of the dimensions
2935 * first to first + n - 1 of the given type.
2937 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2938 __isl_take isl_basic_set
*bset
,
2939 enum isl_dim_type type
, unsigned first
, unsigned n
)
2941 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2945 /* Drop all constraints in bmap that involve any of the dimensions
2946 * first to first + n - 1 of the given type.
2948 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2949 __isl_take isl_basic_map
*bmap
,
2950 enum isl_dim_type type
, unsigned first
, unsigned n
)
2957 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2958 return isl_basic_map_free(bmap
);
2960 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2961 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2962 bmap
= isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2963 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2967 /* Drop all constraints in bset that involve any of the dimensions
2968 * first to first + n - 1 of the given type.
2970 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2971 __isl_take isl_basic_set
*bset
,
2972 enum isl_dim_type type
, unsigned first
, unsigned n
)
2974 return isl_basic_map_drop_constraints_involving_dims(bset
,
2978 /* Drop constraints from "map" by applying "drop" to each basic map.
2980 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2981 enum isl_dim_type type
, unsigned first
, unsigned n
,
2982 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2983 enum isl_dim_type type
, unsigned first
, unsigned n
))
2987 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2988 return isl_map_free(map
);
2990 map
= isl_map_cow(map
);
2994 for (i
= 0; i
< map
->n
; ++i
) {
2995 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
2997 return isl_map_free(map
);
3001 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3006 /* Drop all constraints in map that involve any of the dimensions
3007 * first to first + n - 1 of the given type.
3009 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
3010 __isl_take isl_map
*map
,
3011 enum isl_dim_type type
, unsigned first
, unsigned n
)
3015 return drop_constraints(map
, type
, first
, n
,
3016 &isl_basic_map_drop_constraints_involving_dims
);
3019 /* Drop all constraints in "map" that do not involve any of the dimensions
3020 * first to first + n - 1 of the given type.
3022 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
3023 __isl_take isl_map
*map
,
3024 enum isl_dim_type type
, unsigned first
, unsigned n
)
3027 isl_space
*space
= isl_map_get_space(map
);
3029 return isl_map_universe(space
);
3031 return drop_constraints(map
, type
, first
, n
,
3032 &isl_basic_map_drop_constraints_not_involving_dims
);
3035 /* Drop all constraints in set that involve any of the dimensions
3036 * first to first + n - 1 of the given type.
3038 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
3039 __isl_take isl_set
*set
,
3040 enum isl_dim_type type
, unsigned first
, unsigned n
)
3042 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
3045 /* Drop all constraints in "set" that do not involve any of the dimensions
3046 * first to first + n - 1 of the given type.
3048 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
3049 __isl_take isl_set
*set
,
3050 enum isl_dim_type type
, unsigned first
, unsigned n
)
3052 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3055 /* Does local variable "div" of "bmap" have a complete explicit representation?
3056 * Having a complete explicit representation requires not only
3057 * an explicit representation, but also that all local variables
3058 * that appear in this explicit representation in turn have
3059 * a complete explicit representation.
3061 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3064 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3067 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3068 if (marked
< 0 || marked
)
3069 return isl_bool_not(marked
);
3071 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3074 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3076 known
= isl_basic_map_div_is_known(bmap
, i
);
3077 if (known
< 0 || !known
)
3081 return isl_bool_true
;
3084 /* Remove all divs that are unknown or defined in terms of unknown divs.
3086 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3087 __isl_take isl_basic_map
*bmap
)
3094 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3095 if (isl_basic_map_div_is_known(bmap
, i
))
3097 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3106 /* Remove all divs that are unknown or defined in terms of unknown divs.
3108 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3109 __isl_take isl_basic_set
*bset
)
3111 return isl_basic_map_remove_unknown_divs(bset
);
3114 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3123 map
= isl_map_cow(map
);
3127 for (i
= 0; i
< map
->n
; ++i
) {
3128 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3138 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3140 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3143 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3144 __isl_take isl_basic_set
*bset
,
3145 enum isl_dim_type type
, unsigned first
, unsigned n
)
3147 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3148 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3149 return bset_from_bmap(bmap
);
3152 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3153 enum isl_dim_type type
, unsigned first
, unsigned n
)
3160 map
= isl_map_cow(map
);
3161 if (isl_map_check_range(map
, type
, first
, n
) < 0)
3162 return isl_map_free(map
);
3164 for (i
= 0; i
< map
->n
; ++i
) {
3165 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3166 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3170 map
= isl_map_drop(map
, type
, first
, n
);
3177 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3178 enum isl_dim_type type
, unsigned first
, unsigned n
)
3180 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3184 /* Project out n inputs starting at first using Fourier-Motzkin */
3185 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3186 unsigned first
, unsigned n
)
3188 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3191 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3192 FILE *out
, int indent
)
3197 fprintf(out
, "null basic set\n");
3201 fprintf(out
, "%*s", indent
, "");
3202 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3203 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3204 bset
->extra
, bset
->flags
);
3206 p
= isl_printer_to_file(isl_basic_set_get_ctx(bset
), out
);
3207 p
= isl_printer_set_dump(p
, 1);
3208 p
= isl_printer_set_indent(p
, indent
);
3209 p
= isl_printer_start_line(p
);
3210 p
= isl_printer_print_basic_set(p
, bset
);
3211 p
= isl_printer_end_line(p
);
3212 isl_printer_free(p
);
3215 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3216 FILE *out
, int indent
)
3221 fprintf(out
, "null basic map\n");
3225 fprintf(out
, "%*s", indent
, "");
3226 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3227 "flags: %x, n_name: %d\n",
3229 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3230 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3232 p
= isl_printer_to_file(isl_basic_map_get_ctx(bmap
), out
);
3233 p
= isl_printer_set_dump(p
, 1);
3234 p
= isl_printer_set_indent(p
, indent
);
3235 p
= isl_printer_start_line(p
);
3236 p
= isl_printer_print_basic_map(p
, bmap
);
3237 p
= isl_printer_end_line(p
);
3238 isl_printer_free(p
);
3241 __isl_give isl_basic_map
*isl_inequality_negate(__isl_take isl_basic_map
*bmap
,
3248 total
= isl_basic_map_total_dim(bmap
);
3249 if (pos
>= bmap
->n_ineq
)
3250 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
3251 "invalid position", return isl_basic_map_free(bmap
));
3252 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3253 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3254 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
3255 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
3259 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3262 if (isl_space_check_is_set(space
) < 0)
3264 return isl_map_alloc_space(space
, n
, flags
);
3266 isl_space_free(space
);
3270 /* Make sure "map" has room for at least "n" more basic maps.
3272 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3275 struct isl_map
*grown
= NULL
;
3279 isl_assert(map
->ctx
, n
>= 0, goto error
);
3280 if (map
->n
+ n
<= map
->size
)
3282 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3285 for (i
= 0; i
< map
->n
; ++i
) {
3286 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3294 isl_map_free(grown
);
3299 /* Make sure "set" has room for at least "n" more basic sets.
3301 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3303 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3306 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3308 return isl_map_from_basic_map(bset
);
3311 __isl_give isl_map
*isl_map_from_basic_map(__isl_take isl_basic_map
*bmap
)
3313 struct isl_map
*map
;
3318 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3319 return isl_map_add_basic_map(map
, bmap
);
3322 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3323 __isl_take isl_basic_set
*bset
)
3325 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3326 bset_to_bmap(bset
)));
3329 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3331 return isl_map_free(set
);
3334 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3339 fprintf(out
, "null set\n");
3343 fprintf(out
, "%*s", indent
, "");
3344 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3345 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3347 for (i
= 0; i
< set
->n
; ++i
) {
3348 fprintf(out
, "%*s", indent
, "");
3349 fprintf(out
, "basic set %d:\n", i
);
3350 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3354 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3359 fprintf(out
, "null map\n");
3363 fprintf(out
, "%*s", indent
, "");
3364 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3365 "flags: %x, n_name: %d\n",
3366 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3367 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3368 for (i
= 0; i
< map
->n
; ++i
) {
3369 fprintf(out
, "%*s", indent
, "");
3370 fprintf(out
, "basic map %d:\n", i
);
3371 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3375 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3376 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3378 struct isl_basic_map
*bmap_domain
;
3380 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3383 if (isl_basic_set_dim(bset
, isl_dim_set
) != 0)
3384 isl_assert(bset
->ctx
,
3385 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3387 bmap
= isl_basic_map_cow(bmap
);
3390 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3391 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3392 bmap_domain
= isl_basic_map_from_domain(bset
);
3393 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3395 bmap
= isl_basic_map_simplify(bmap
);
3396 return isl_basic_map_finalize(bmap
);
3398 isl_basic_map_free(bmap
);
3399 isl_basic_set_free(bset
);
3403 /* Check that the space of "bset" is the same as that of the range of "bmap".
3405 static isl_stat
isl_basic_map_check_compatible_range(
3406 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3410 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3412 return isl_stat_error
;
3414 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3415 "incompatible spaces", return isl_stat_error
);
3420 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3421 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3423 struct isl_basic_map
*bmap_range
;
3425 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3428 if (isl_basic_set_dim(bset
, isl_dim_set
) != 0 &&
3429 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3432 if (isl_basic_set_plain_is_universe(bset
)) {
3433 isl_basic_set_free(bset
);
3437 bmap
= isl_basic_map_cow(bmap
);
3440 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3441 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3442 bmap_range
= bset_to_bmap(bset
);
3443 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3445 bmap
= isl_basic_map_simplify(bmap
);
3446 return isl_basic_map_finalize(bmap
);
3448 isl_basic_map_free(bmap
);
3449 isl_basic_set_free(bset
);
3453 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3454 __isl_keep isl_vec
*vec
)
3461 return isl_bool_error
;
3463 total
= 1 + isl_basic_map_total_dim(bmap
);
3464 if (total
!= vec
->size
)
3465 return isl_bool_false
;
3469 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3470 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3471 if (!isl_int_is_zero(s
)) {
3473 return isl_bool_false
;
3477 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3478 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3479 if (isl_int_is_neg(s
)) {
3481 return isl_bool_false
;
3487 return isl_bool_true
;
3490 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3491 __isl_keep isl_vec
*vec
)
3493 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3496 __isl_give isl_basic_map
*isl_basic_map_intersect(
3497 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3499 struct isl_vec
*sample
= NULL
;
3500 isl_space
*space1
, *space2
;
3502 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3504 space1
= isl_basic_map_peek_space(bmap1
);
3505 space2
= isl_basic_map_peek_space(bmap2
);
3506 if (isl_space_dim(space1
, isl_dim_all
) ==
3507 isl_space_dim(space1
, isl_dim_param
) &&
3508 isl_space_dim(space2
, isl_dim_all
) !=
3509 isl_space_dim(space2
, isl_dim_param
))
3510 return isl_basic_map_intersect(bmap2
, bmap1
);
3512 if (isl_space_dim(space2
, isl_dim_all
) !=
3513 isl_space_dim(space2
, isl_dim_param
))
3514 isl_assert(bmap1
->ctx
,
3515 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3517 if (isl_basic_map_plain_is_empty(bmap1
)) {
3518 isl_basic_map_free(bmap2
);
3521 if (isl_basic_map_plain_is_empty(bmap2
)) {
3522 isl_basic_map_free(bmap1
);
3526 if (bmap1
->sample
&&
3527 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3528 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3529 sample
= isl_vec_copy(bmap1
->sample
);
3530 else if (bmap2
->sample
&&
3531 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3532 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3533 sample
= isl_vec_copy(bmap2
->sample
);
3535 bmap1
= isl_basic_map_cow(bmap1
);
3538 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3539 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3540 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3543 isl_vec_free(sample
);
3545 isl_vec_free(bmap1
->sample
);
3546 bmap1
->sample
= sample
;
3549 bmap1
= isl_basic_map_simplify(bmap1
);
3550 return isl_basic_map_finalize(bmap1
);
3553 isl_vec_free(sample
);
3554 isl_basic_map_free(bmap1
);
3555 isl_basic_map_free(bmap2
);
3559 struct isl_basic_set
*isl_basic_set_intersect(
3560 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3562 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3563 bset_to_bmap(bset2
)));
3566 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3567 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3569 return isl_basic_set_intersect(bset1
, bset2
);
3572 /* Special case of isl_map_intersect, where both map1 and map2
3573 * are convex, without any divs and such that either map1 or map2
3574 * contains a single constraint. This constraint is then simply
3575 * added to the other map.
3577 static __isl_give isl_map
*map_intersect_add_constraint(
3578 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3580 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3581 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3582 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3583 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3585 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3586 return isl_map_intersect(map2
, map1
);
3588 map1
= isl_map_cow(map1
);
3591 if (isl_map_plain_is_empty(map1
)) {
3595 if (map2
->p
[0]->n_eq
== 1)
3596 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3598 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3599 map2
->p
[0]->ineq
[0]);
3601 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3602 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3606 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3607 isl_basic_map_free(map1
->p
[0]);
3613 map1
= isl_map_unmark_normalized(map1
);
3621 /* map2 may be either a parameter domain or a map living in the same
3624 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3625 __isl_take isl_map
*map2
)
3635 if ((isl_map_plain_is_empty(map1
) ||
3636 isl_map_plain_is_universe(map2
)) &&
3637 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3641 if ((isl_map_plain_is_empty(map2
) ||
3642 isl_map_plain_is_universe(map1
)) &&
3643 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3648 if (map1
->n
== 1 && map2
->n
== 1 &&
3649 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3650 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3651 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3652 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3653 return map_intersect_add_constraint(map1
, map2
);
3655 equal
= isl_map_plain_is_equal(map1
, map2
);
3663 if (isl_map_dim(map2
, isl_dim_all
) != isl_map_dim(map2
, isl_dim_param
))
3664 isl_assert(map1
->ctx
,
3665 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3667 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3668 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3669 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3671 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3672 map1
->n
* map2
->n
, flags
);
3675 for (i
= 0; i
< map1
->n
; ++i
)
3676 for (j
= 0; j
< map2
->n
; ++j
) {
3677 struct isl_basic_map
*part
;
3678 part
= isl_basic_map_intersect(
3679 isl_basic_map_copy(map1
->p
[i
]),
3680 isl_basic_map_copy(map2
->p
[j
]));
3681 if (isl_basic_map_is_empty(part
) < 0)
3682 part
= isl_basic_map_free(part
);
3683 result
= isl_map_add_basic_map(result
, part
);
3696 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3697 __isl_take isl_map
*map2
)
3701 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3702 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3703 "spaces don't match", goto error
);
3704 return map_intersect_internal(map1
, map2
);
3711 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3712 __isl_take isl_map
*map2
)
3714 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3717 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3719 return set_from_map(isl_map_intersect(set_to_map(set1
),
3723 /* map_intersect_internal accepts intersections
3724 * with parameter domains, so we can just call that function.
3726 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3727 __isl_take isl_set
*params
)
3729 return map_intersect_internal(map
, params
);
3732 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3733 __isl_take isl_map
*map2
)
3735 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3738 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3739 __isl_take isl_set
*params
)
3741 return isl_map_intersect_params(set
, params
);
3744 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3747 unsigned pos
, n1
, n2
;
3751 bmap
= isl_basic_map_cow(bmap
);
3754 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3755 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3756 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3757 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3758 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3759 return isl_basic_map_reset_space(bmap
, space
);
3762 static __isl_give isl_basic_map
*basic_map_space_reset(
3763 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3769 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3772 space
= isl_basic_map_get_space(bmap
);
3773 space
= isl_space_reset(space
, type
);
3774 bmap
= isl_basic_map_reset_space(bmap
, space
);
3778 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3779 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3780 unsigned pos
, unsigned n
)
3782 isl_bool rational
, is_empty
;
3783 isl_space
*res_space
;
3784 struct isl_basic_map
*res
;
3785 struct isl_dim_map
*dim_map
;
3786 unsigned total
, off
;
3787 enum isl_dim_type t
;
3790 return basic_map_space_reset(bmap
, type
);
3792 is_empty
= isl_basic_map_plain_is_empty(bmap
);
3794 return isl_basic_map_free(bmap
);
3795 res_space
= isl_space_insert_dims(isl_basic_map_get_space(bmap
),
3798 return isl_basic_map_free(bmap
);
3800 isl_basic_map_free(bmap
);
3801 return isl_basic_map_empty(res_space
);
3804 total
= isl_basic_map_total_dim(bmap
) + n
;
3805 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3807 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3809 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3811 unsigned size
= isl_basic_map_dim(bmap
, t
);
3812 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3814 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3815 pos
, size
- pos
, off
+ pos
+ n
);
3817 off
+= isl_space_dim(res_space
, t
);
3819 isl_dim_map_div(dim_map
, bmap
, off
);
3821 res
= isl_basic_map_alloc_space(res_space
,
3822 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3823 rational
= isl_basic_map_is_rational(bmap
);
3825 res
= isl_basic_map_free(res
);
3827 res
= isl_basic_map_set_rational(res
);
3828 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3829 return isl_basic_map_finalize(res
);
3832 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3833 __isl_take isl_basic_set
*bset
,
3834 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3836 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3839 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3840 enum isl_dim_type type
, unsigned n
)
3844 return isl_basic_map_insert_dims(bmap
, type
,
3845 isl_basic_map_dim(bmap
, type
), n
);
3848 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3849 enum isl_dim_type type
, unsigned n
)
3853 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3854 return isl_basic_map_add_dims(bset
, type
, n
);
3856 isl_basic_set_free(bset
);
3860 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3861 enum isl_dim_type type
)
3865 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3868 space
= isl_map_get_space(map
);
3869 space
= isl_space_reset(space
, type
);
3870 map
= isl_map_reset_space(map
, space
);
3874 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3875 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3880 return map_space_reset(map
, type
);
3882 map
= isl_map_cow(map
);
3886 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3890 for (i
= 0; i
< map
->n
; ++i
) {
3891 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3902 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3903 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3905 return isl_map_insert_dims(set
, type
, pos
, n
);
3908 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3909 enum isl_dim_type type
, unsigned n
)
3913 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3916 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3917 enum isl_dim_type type
, unsigned n
)
3921 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3922 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
3928 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3929 __isl_take isl_basic_map
*bmap
,
3930 enum isl_dim_type dst_type
, unsigned dst_pos
,
3931 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3934 struct isl_dim_map
*dim_map
;
3935 struct isl_basic_map
*res
;
3936 enum isl_dim_type t
;
3937 unsigned total
, off
;
3942 bmap
= isl_basic_map_reset(bmap
, src_type
);
3943 bmap
= isl_basic_map_reset(bmap
, dst_type
);
3947 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
3948 return isl_basic_map_free(bmap
);
3950 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3953 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3955 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3956 pos(bmap
->dim
, src_type
) + src_pos
+
3957 ((src_type
< dst_type
) ? n
: 0)) {
3958 bmap
= isl_basic_map_cow(bmap
);
3962 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3963 src_type
, src_pos
, n
);
3967 bmap
= isl_basic_map_finalize(bmap
);
3972 total
= isl_basic_map_total_dim(bmap
);
3973 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3976 space
= isl_basic_map_peek_space(bmap
);
3977 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3978 unsigned size
= isl_space_dim(space
, t
);
3979 if (t
== dst_type
) {
3980 isl_dim_map_dim_range(dim_map
, space
, t
,
3983 isl_dim_map_dim_range(dim_map
, space
, src_type
,
3986 isl_dim_map_dim_range(dim_map
, space
, t
,
3987 dst_pos
, size
- dst_pos
, off
);
3988 off
+= size
- dst_pos
;
3989 } else if (t
== src_type
) {
3990 isl_dim_map_dim_range(dim_map
, space
, t
,
3993 isl_dim_map_dim_range(dim_map
, space
, t
,
3994 src_pos
+ n
, size
- src_pos
- n
, off
);
3995 off
+= size
- src_pos
- n
;
3997 isl_dim_map_dim(dim_map
, space
, t
, off
);
4001 isl_dim_map_div(dim_map
, bmap
, off
);
4003 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4004 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4005 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4009 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4010 src_type
, src_pos
, n
);
4014 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
4015 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4016 bmap
= isl_basic_map_finalize(bmap
);
4020 isl_basic_map_free(bmap
);
4024 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4025 enum isl_dim_type dst_type
, unsigned dst_pos
,
4026 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4028 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4029 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4030 src_type
, src_pos
, n
);
4031 return bset_from_bmap(bmap
);
4034 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4035 enum isl_dim_type dst_type
, unsigned dst_pos
,
4036 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4040 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4041 return set_from_map(isl_map_move_dims(set_to_map(set
),
4042 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4048 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4049 enum isl_dim_type dst_type
, unsigned dst_pos
,
4050 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4055 map
= isl_map_reset(map
, src_type
);
4056 map
= isl_map_reset(map
, dst_type
);
4060 if (isl_map_check_range(map
, src_type
, src_pos
, n
))
4061 return isl_map_free(map
);
4063 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4066 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4068 map
= isl_map_cow(map
);
4072 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4076 for (i
= 0; i
< map
->n
; ++i
) {
4077 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4079 src_type
, src_pos
, n
);
4090 /* Move the specified dimensions to the last columns right before
4091 * the divs. Don't change the dimension specification of bmap.
4092 * That's the responsibility of the caller.
4094 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4095 enum isl_dim_type type
, unsigned first
, unsigned n
)
4098 struct isl_dim_map
*dim_map
;
4099 struct isl_basic_map
*res
;
4100 enum isl_dim_type t
;
4101 unsigned total
, off
;
4105 if (isl_basic_map_offset(bmap
, type
) + first
+ n
==
4106 isl_basic_map_offset(bmap
, isl_dim_div
))
4109 total
= isl_basic_map_total_dim(bmap
);
4110 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4113 space
= isl_basic_map_peek_space(bmap
);
4114 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4115 unsigned size
= isl_space_dim(space
, t
);
4117 isl_dim_map_dim_range(dim_map
, space
, t
,
4120 isl_dim_map_dim_range(dim_map
, space
, t
,
4121 first
, n
, total
- bmap
->n_div
- n
);
4122 isl_dim_map_dim_range(dim_map
, space
, t
,
4123 first
+ n
, size
- (first
+ n
), off
);
4124 off
+= size
- (first
+ n
);
4126 isl_dim_map_dim(dim_map
, space
, t
, off
);
4130 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4132 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4133 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4134 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4138 /* Insert "n" rows in the divs of "bmap".
4140 * The number of columns is not changed, which means that the last
4141 * dimensions of "bmap" are being reintepreted as the new divs.
4142 * The space of "bmap" is not adjusted, however, which means
4143 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4144 * from the space of "bmap" is the responsibility of the caller.
4146 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4154 bmap
= isl_basic_map_cow(bmap
);
4158 row_size
= isl_basic_map_offset(bmap
, isl_dim_div
) + bmap
->extra
;
4159 old
= bmap
->block2
.data
;
4160 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4161 (bmap
->extra
+ n
) * (1 + row_size
));
4162 if (!bmap
->block2
.data
)
4163 return isl_basic_map_free(bmap
);
4164 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4166 return isl_basic_map_free(bmap
);
4167 for (i
= 0; i
< n
; ++i
) {
4168 new_div
[i
] = bmap
->block2
.data
+
4169 (bmap
->extra
+ i
) * (1 + row_size
);
4170 isl_seq_clr(new_div
[i
], 1 + row_size
);
4172 for (i
= 0; i
< bmap
->extra
; ++i
)
4173 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4175 bmap
->div
= new_div
;
4182 /* Drop constraints from "bmap" that only involve the variables
4183 * of "type" in the range [first, first + n] that are not related
4184 * to any of the variables outside that interval.
4185 * These constraints cannot influence the values for the variables
4186 * outside the interval, except in case they cause "bmap" to be empty.
4187 * Only drop the constraints if "bmap" is known to be non-empty.
4189 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4190 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4191 unsigned first
, unsigned n
)
4195 unsigned dim
, n_div
;
4198 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4200 return isl_basic_map_free(bmap
);
4204 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4205 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4206 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4208 return isl_basic_map_free(bmap
);
4209 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4210 for (i
= 0; i
< first
; ++i
)
4212 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4215 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4220 /* Turn the n dimensions of type type, starting at first
4221 * into existentially quantified variables.
4223 * If a subset of the projected out variables are unrelated
4224 * to any of the variables that remain, then the constraints
4225 * involving this subset are simply dropped first.
4227 __isl_give isl_basic_map
*isl_basic_map_project_out(
4228 __isl_take isl_basic_map
*bmap
,
4229 enum isl_dim_type type
, unsigned first
, unsigned n
)
4234 return basic_map_space_reset(bmap
, type
);
4235 if (type
== isl_dim_div
)
4236 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4237 "cannot project out existentially quantified variables",
4238 return isl_basic_map_free(bmap
));
4240 empty
= isl_basic_map_plain_is_empty(bmap
);
4242 return isl_basic_map_free(bmap
);
4244 bmap
= isl_basic_map_set_to_empty(bmap
);
4246 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4250 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4251 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4253 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4254 return isl_basic_map_free(bmap
);
4256 bmap
= move_last(bmap
, type
, first
, n
);
4257 bmap
= isl_basic_map_cow(bmap
);
4258 bmap
= insert_div_rows(bmap
, n
);
4262 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4265 bmap
= isl_basic_map_simplify(bmap
);
4266 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4267 return isl_basic_map_finalize(bmap
);
4269 isl_basic_map_free(bmap
);
4273 /* Turn the n dimensions of type type, starting at first
4274 * into existentially quantified variables.
4276 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4277 enum isl_dim_type type
, unsigned first
, unsigned n
)
4279 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4283 /* Turn the n dimensions of type type, starting at first
4284 * into existentially quantified variables.
4286 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4287 enum isl_dim_type type
, unsigned first
, unsigned n
)
4292 return map_space_reset(map
, type
);
4294 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4295 return isl_map_free(map
);
4297 map
= isl_map_cow(map
);
4301 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4305 for (i
= 0; i
< map
->n
; ++i
) {
4306 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4317 /* Turn all the dimensions of type "type", except the "n" starting at "first"
4318 * into existentially quantified variables.
4320 __isl_give isl_map
*isl_map_project_onto(__isl_take isl_map
*map
,
4321 enum isl_dim_type type
, unsigned first
, unsigned n
)
4325 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4326 return isl_map_free(map
);
4327 dim
= isl_map_dim(map
, type
);
4328 map
= isl_map_project_out(map
, type
, first
+ n
, dim
- (first
+ n
));
4329 map
= isl_map_project_out(map
, type
, 0, first
);
4333 /* Turn the n dimensions of type type, starting at first
4334 * into existentially quantified variables.
4336 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4337 enum isl_dim_type type
, unsigned first
, unsigned n
)
4339 return set_from_map(isl_map_project_out(set_to_map(set
),
4343 /* Return a map that projects the elements in "set" onto their
4344 * "n" set dimensions starting at "first".
4345 * "type" should be equal to isl_dim_set.
4347 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4348 enum isl_dim_type type
, unsigned first
, unsigned n
)
4353 if (type
!= isl_dim_set
)
4354 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4355 "only set dimensions can be projected out", goto error
);
4356 if (isl_set_check_range(set
, type
, first
, n
) < 0)
4357 return isl_set_free(set
);
4359 map
= isl_map_from_domain(set
);
4360 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4361 for (i
= 0; i
< n
; ++i
)
4362 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4370 static __isl_give isl_basic_map
*add_divs(__isl_take isl_basic_map
*bmap
,
4375 for (i
= 0; i
< n
; ++i
) {
4376 j
= isl_basic_map_alloc_div(bmap
);
4379 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4383 isl_basic_map_free(bmap
);
4387 struct isl_basic_map
*isl_basic_map_apply_range(
4388 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4390 isl_space
*space_result
= NULL
;
4391 struct isl_basic_map
*bmap
;
4392 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4393 struct isl_dim_map
*dim_map1
, *dim_map2
;
4395 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4397 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4398 bmap2
->dim
, isl_dim_in
))
4399 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4400 "spaces don't match", goto error
);
4402 space_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4403 isl_space_copy(bmap2
->dim
));
4405 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4406 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4407 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4408 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4410 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4411 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4412 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4413 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4414 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4415 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4416 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4417 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4418 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4419 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4420 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4422 bmap
= isl_basic_map_alloc_space(space_result
,
4423 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4424 bmap1
->n_eq
+ bmap2
->n_eq
,
4425 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4426 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4427 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4428 bmap
= add_divs(bmap
, n
);
4429 bmap
= isl_basic_map_simplify(bmap
);
4430 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4431 return isl_basic_map_finalize(bmap
);
4433 isl_basic_map_free(bmap1
);
4434 isl_basic_map_free(bmap2
);
4438 struct isl_basic_set
*isl_basic_set_apply(
4439 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4444 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4447 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4450 isl_basic_set_free(bset
);
4451 isl_basic_map_free(bmap
);
4455 struct isl_basic_map
*isl_basic_map_apply_domain(
4456 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4458 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4460 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4461 bmap2
->dim
, isl_dim_in
))
4462 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4463 "spaces don't match", goto error
);
4465 bmap1
= isl_basic_map_reverse(bmap1
);
4466 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4467 return isl_basic_map_reverse(bmap1
);
4469 isl_basic_map_free(bmap1
);
4470 isl_basic_map_free(bmap2
);
4474 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4475 * A \cap B -> f(A) + f(B)
4477 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4478 __isl_take isl_basic_map
*bmap2
)
4480 unsigned n_in
, n_out
, nparam
, total
, pos
;
4481 struct isl_basic_map
*bmap
= NULL
;
4482 struct isl_dim_map
*dim_map1
, *dim_map2
;
4485 if (!bmap1
|| !bmap2
)
4488 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4491 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4492 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4493 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4495 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4496 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4497 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4498 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4499 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4500 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4501 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4502 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4503 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4504 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4505 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4507 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4508 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4509 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4510 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4511 for (i
= 0; i
< n_out
; ++i
) {
4512 int j
= isl_basic_map_alloc_equality(bmap
);
4515 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4516 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4517 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4518 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4520 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4521 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4522 bmap
= add_divs(bmap
, 2 * n_out
);
4524 bmap
= isl_basic_map_simplify(bmap
);
4525 return isl_basic_map_finalize(bmap
);
4527 isl_basic_map_free(bmap
);
4528 isl_basic_map_free(bmap1
);
4529 isl_basic_map_free(bmap2
);
4533 /* Given two maps A -> f(A) and B -> g(B), construct a map
4534 * A \cap B -> f(A) + f(B)
4536 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4537 __isl_take isl_map
*map2
)
4539 struct isl_map
*result
;
4545 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4547 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4548 map1
->n
* map2
->n
, 0);
4551 for (i
= 0; i
< map1
->n
; ++i
)
4552 for (j
= 0; j
< map2
->n
; ++j
) {
4553 struct isl_basic_map
*part
;
4554 part
= isl_basic_map_sum(
4555 isl_basic_map_copy(map1
->p
[i
]),
4556 isl_basic_map_copy(map2
->p
[j
]));
4557 if (isl_basic_map_is_empty(part
))
4558 isl_basic_map_free(part
);
4560 result
= isl_map_add_basic_map(result
, part
);
4573 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4574 __isl_take isl_set
*set2
)
4576 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4579 /* Given a basic map A -> f(A), construct A -> -f(A).
4581 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4586 bmap
= isl_basic_map_cow(bmap
);
4590 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4591 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4592 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4593 for (j
= 0; j
< n
; ++j
)
4594 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4595 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4596 for (j
= 0; j
< n
; ++j
)
4597 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4598 for (i
= 0; i
< bmap
->n_div
; ++i
)
4599 for (j
= 0; j
< n
; ++j
)
4600 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4601 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4602 return isl_basic_map_finalize(bmap
);
4605 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4607 return isl_basic_map_neg(bset
);
4610 /* Given a map A -> f(A), construct A -> -f(A).
4612 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4616 map
= isl_map_cow(map
);
4620 for (i
= 0; i
< map
->n
; ++i
) {
4621 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4632 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4634 return set_from_map(isl_map_neg(set_to_map(set
)));
4637 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4638 * A -> floor(f(A)/d).
4640 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4643 unsigned n_in
, n_out
, nparam
, total
, pos
;
4644 struct isl_basic_map
*result
= NULL
;
4645 struct isl_dim_map
*dim_map
;
4651 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4652 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4653 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4655 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4656 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4657 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4658 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4659 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4660 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4662 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4663 bmap
->n_div
+ n_out
,
4664 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4665 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4666 result
= add_divs(result
, n_out
);
4667 for (i
= 0; i
< n_out
; ++i
) {
4669 j
= isl_basic_map_alloc_inequality(result
);
4672 isl_seq_clr(result
->ineq
[j
], 1+total
);
4673 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4674 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4675 j
= isl_basic_map_alloc_inequality(result
);
4678 isl_seq_clr(result
->ineq
[j
], 1+total
);
4679 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4680 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4681 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4684 result
= isl_basic_map_simplify(result
);
4685 return isl_basic_map_finalize(result
);
4687 isl_basic_map_free(result
);
4691 /* Given a map A -> f(A) and an integer d, construct a map
4692 * A -> floor(f(A)/d).
4694 __isl_give isl_map
*isl_map_floordiv(__isl_take isl_map
*map
, isl_int d
)
4698 map
= isl_map_cow(map
);
4702 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4703 for (i
= 0; i
< map
->n
; ++i
) {
4704 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4708 map
= isl_map_unmark_normalized(map
);
4716 /* Given a map A -> f(A) and an integer d, construct a map
4717 * A -> floor(f(A)/d).
4719 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4720 __isl_take isl_val
*d
)
4724 if (!isl_val_is_int(d
))
4725 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4726 "expecting integer denominator", goto error
);
4727 map
= isl_map_floordiv(map
, d
->n
);
4736 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4743 i
= isl_basic_map_alloc_equality(bmap
);
4746 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4747 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4748 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4749 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4750 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4751 return isl_basic_map_finalize(bmap
);
4753 isl_basic_map_free(bmap
);
4757 /* Add a constraint to "bmap" expressing i_pos < o_pos
4759 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4766 i
= isl_basic_map_alloc_inequality(bmap
);
4769 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4770 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4771 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4772 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4773 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4774 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4775 return isl_basic_map_finalize(bmap
);
4777 isl_basic_map_free(bmap
);
4781 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4783 static __isl_give isl_basic_map
*var_less_or_equal(
4784 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4790 i
= isl_basic_map_alloc_inequality(bmap
);
4793 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4794 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4795 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4796 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4797 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4798 return isl_basic_map_finalize(bmap
);
4800 isl_basic_map_free(bmap
);
4804 /* Add a constraint to "bmap" expressing i_pos > o_pos
4806 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4813 i
= isl_basic_map_alloc_inequality(bmap
);
4816 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4817 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4818 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4819 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4820 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4821 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4822 return isl_basic_map_finalize(bmap
);
4824 isl_basic_map_free(bmap
);
4828 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4830 static __isl_give isl_basic_map
*var_more_or_equal(
4831 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4837 i
= isl_basic_map_alloc_inequality(bmap
);
4840 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4841 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4842 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4843 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4844 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4845 return isl_basic_map_finalize(bmap
);
4847 isl_basic_map_free(bmap
);
4851 __isl_give isl_basic_map
*isl_basic_map_equal(
4852 __isl_take isl_space
*space
, unsigned n_equal
)
4855 struct isl_basic_map
*bmap
;
4856 bmap
= isl_basic_map_alloc_space(space
, 0, n_equal
, 0);
4859 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4860 bmap
= var_equal(bmap
, i
);
4861 return isl_basic_map_finalize(bmap
);
4864 /* Return a relation on of dimension "space" expressing i_[0..pos] << o_[0..pos]
4866 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*space
,
4870 struct isl_basic_map
*bmap
;
4871 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
4874 for (i
= 0; i
< pos
&& bmap
; ++i
)
4875 bmap
= var_equal(bmap
, i
);
4877 bmap
= var_less(bmap
, pos
);
4878 return isl_basic_map_finalize(bmap
);
4881 /* Return a relation on "space" expressing i_[0..pos] <<= o_[0..pos]
4883 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4884 __isl_take isl_space
*space
, unsigned pos
)
4887 isl_basic_map
*bmap
;
4889 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
4890 for (i
= 0; i
< pos
; ++i
)
4891 bmap
= var_equal(bmap
, i
);
4892 bmap
= var_less_or_equal(bmap
, pos
);
4893 return isl_basic_map_finalize(bmap
);
4896 /* Return a relation on "space" expressing i_pos > o_pos
4898 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*space
,
4902 struct isl_basic_map
*bmap
;
4903 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
4906 for (i
= 0; i
< pos
&& bmap
; ++i
)
4907 bmap
= var_equal(bmap
, i
);
4909 bmap
= var_more(bmap
, pos
);
4910 return isl_basic_map_finalize(bmap
);
4913 /* Return a relation on "space" expressing i_[0..pos] >>= o_[0..pos]
4915 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4916 __isl_take isl_space
*space
, unsigned pos
)
4919 isl_basic_map
*bmap
;
4921 bmap
= isl_basic_map_alloc_space(space
, 0, pos
, 1);
4922 for (i
= 0; i
< pos
; ++i
)
4923 bmap
= var_equal(bmap
, i
);
4924 bmap
= var_more_or_equal(bmap
, pos
);
4925 return isl_basic_map_finalize(bmap
);
4928 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*space
,
4929 unsigned n
, int equal
)
4931 struct isl_map
*map
;
4934 if (n
== 0 && equal
)
4935 return isl_map_universe(space
);
4937 map
= isl_map_alloc_space(isl_space_copy(space
), n
, ISL_MAP_DISJOINT
);
4939 for (i
= 0; i
+ 1 < n
; ++i
)
4940 map
= isl_map_add_basic_map(map
,
4941 isl_basic_map_less_at(isl_space_copy(space
), i
));
4944 map
= isl_map_add_basic_map(map
,
4945 isl_basic_map_less_or_equal_at(space
, n
- 1));
4947 map
= isl_map_add_basic_map(map
,
4948 isl_basic_map_less_at(space
, n
- 1));
4950 isl_space_free(space
);
4955 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*space
, int equal
)
4959 return map_lex_lte_first(space
, space
->n_out
, equal
);
4962 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4964 return map_lex_lte_first(dim
, n
, 0);
4967 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4969 return map_lex_lte_first(dim
, n
, 1);
4972 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4974 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4977 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4979 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4982 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*space
,
4983 unsigned n
, int equal
)
4985 struct isl_map
*map
;
4988 if (n
== 0 && equal
)
4989 return isl_map_universe(space
);
4991 map
= isl_map_alloc_space(isl_space_copy(space
), n
, ISL_MAP_DISJOINT
);
4993 for (i
= 0; i
+ 1 < n
; ++i
)
4994 map
= isl_map_add_basic_map(map
,
4995 isl_basic_map_more_at(isl_space_copy(space
), i
));
4998 map
= isl_map_add_basic_map(map
,
4999 isl_basic_map_more_or_equal_at(space
, n
- 1));
5001 map
= isl_map_add_basic_map(map
,
5002 isl_basic_map_more_at(space
, n
- 1));
5004 isl_space_free(space
);
5009 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*space
, int equal
)
5013 return map_lex_gte_first(space
, space
->n_out
, equal
);
5016 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5018 return map_lex_gte_first(dim
, n
, 0);
5021 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5023 return map_lex_gte_first(dim
, n
, 1);
5026 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5028 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5031 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5033 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5036 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5037 __isl_take isl_set
*set2
)
5040 map
= isl_map_lex_le(isl_set_get_space(set1
));
5041 map
= isl_map_intersect_domain(map
, set1
);
5042 map
= isl_map_intersect_range(map
, set2
);
5046 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5047 __isl_take isl_set
*set2
)
5050 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5051 map
= isl_map_intersect_domain(map
, set1
);
5052 map
= isl_map_intersect_range(map
, set2
);
5056 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5057 __isl_take isl_set
*set2
)
5060 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5061 map
= isl_map_intersect_domain(map
, set1
);
5062 map
= isl_map_intersect_range(map
, set2
);
5066 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5067 __isl_take isl_set
*set2
)
5070 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5071 map
= isl_map_intersect_domain(map
, set1
);
5072 map
= isl_map_intersect_range(map
, set2
);
5076 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5077 __isl_take isl_map
*map2
)
5080 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5081 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5082 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5086 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5087 __isl_take isl_map
*map2
)
5090 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5091 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5092 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5096 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5097 __isl_take isl_map
*map2
)
5100 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5101 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5102 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5106 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5107 __isl_take isl_map
*map2
)
5110 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5111 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5112 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5116 /* For the div d = floor(f/m) at position "div", add the constraint
5120 static __isl_give isl_basic_map
*add_upper_div_constraint(
5121 __isl_take isl_basic_map
*bmap
, unsigned div
)
5124 int v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
5125 unsigned n_div
, pos
;
5127 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5129 return isl_basic_map_free(bmap
);
5131 i
= isl_basic_map_alloc_inequality(bmap
);
5133 return isl_basic_map_free(bmap
);
5134 isl_seq_cpy(bmap
->ineq
[i
], bmap
->div
[div
] + 1, 1 + v_div
+ n_div
);
5135 isl_int_neg(bmap
->ineq
[i
][1 + pos
], bmap
->div
[div
][0]);
5140 /* For the div d = floor(f/m) at position "div", add the constraint
5142 * -(f-(m-1)) + m d >= 0
5144 static __isl_give isl_basic_map
*add_lower_div_constraint(
5145 __isl_take isl_basic_map
*bmap
, unsigned div
)
5148 int v_div
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
5149 unsigned n_div
, pos
;
5151 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5153 return isl_basic_map_free(bmap
);
5155 i
= isl_basic_map_alloc_inequality(bmap
);
5157 return isl_basic_map_free(bmap
);
5158 isl_seq_neg(bmap
->ineq
[i
], bmap
->div
[div
] + 1, 1 + v_div
+ n_div
);
5159 isl_int_set(bmap
->ineq
[i
][1 + pos
], bmap
->div
[div
][0]);
5160 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5161 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5166 /* For the div d = floor(f/m) at position "pos", add the constraints
5169 * -(f-(m-1)) + m d >= 0
5171 * Note that the second constraint is the negation of
5175 __isl_give isl_basic_map
*isl_basic_map_add_div_constraints(
5176 __isl_take isl_basic_map
*bmap
, unsigned pos
)
5178 bmap
= add_upper_div_constraint(bmap
, pos
);
5179 bmap
= add_lower_div_constraint(bmap
, pos
);
5183 /* For each known div d = floor(f/m), add the constraints
5186 * -(f-(m-1)) + m d >= 0
5188 * Remove duplicate constraints in case of some these div constraints
5189 * already appear in "bmap".
5191 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5192 __isl_take isl_basic_map
*bmap
)
5198 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5202 bmap
= add_known_div_constraints(bmap
);
5203 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5204 bmap
= isl_basic_map_finalize(bmap
);
5208 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5210 * In particular, if this div is of the form d = floor(f/m),
5211 * then add the constraint
5215 * if sign < 0 or the constraint
5217 * -(f-(m-1)) + m d >= 0
5221 __isl_give isl_basic_map
*isl_basic_map_add_div_constraint(
5222 __isl_take isl_basic_map
*bmap
, unsigned div
, int sign
)
5225 return add_upper_div_constraint(bmap
, div
);
5227 return add_lower_div_constraint(bmap
, div
);
5230 __isl_give isl_basic_set
*isl_basic_map_underlying_set(
5231 __isl_take isl_basic_map
*bmap
)
5235 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5237 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5238 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5239 return bset_from_bmap(bmap
);
5240 bmap
= isl_basic_map_cow(bmap
);
5243 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5246 bmap
->extra
-= bmap
->n_div
;
5248 bmap
= isl_basic_map_finalize(bmap
);
5249 return bset_from_bmap(bmap
);
5251 isl_basic_map_free(bmap
);
5255 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5256 __isl_take isl_basic_set
*bset
)
5258 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5261 /* Replace each element in "list" by the result of applying
5262 * isl_basic_map_underlying_set to the element.
5264 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5265 __isl_take isl_basic_map_list
*list
)
5272 n
= isl_basic_map_list_n_basic_map(list
);
5273 for (i
= 0; i
< n
; ++i
) {
5274 isl_basic_map
*bmap
;
5275 isl_basic_set
*bset
;
5277 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5278 bset
= isl_basic_set_underlying_set(bmap
);
5279 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5285 __isl_give isl_basic_map
*isl_basic_map_overlying_set(
5286 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_map
*like
)
5288 struct isl_basic_map
*bmap
;
5289 struct isl_ctx
*ctx
;
5296 if (isl_basic_set_check_no_params(bset
) < 0 ||
5297 isl_basic_set_check_no_locals(bset
) < 0)
5299 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5301 if (like
->n_div
== 0) {
5302 isl_space
*space
= isl_basic_map_get_space(like
);
5303 isl_basic_map_free(like
);
5304 return isl_basic_map_reset_space(bset
, space
);
5306 bset
= isl_basic_set_cow(bset
);
5309 total
= bset
->dim
->n_out
+ bset
->extra
;
5310 bmap
= bset_to_bmap(bset
);
5311 isl_space_free(bmap
->dim
);
5312 bmap
->dim
= isl_space_copy(like
->dim
);
5315 bmap
->n_div
= like
->n_div
;
5316 bmap
->extra
+= like
->n_div
;
5320 ltotal
= total
- bmap
->extra
+ like
->extra
;
5323 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5324 bmap
->extra
* (1 + 1 + total
));
5325 if (isl_blk_is_error(bmap
->block2
))
5327 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5331 for (i
= 0; i
< bmap
->extra
; ++i
)
5332 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5333 for (i
= 0; i
< like
->n_div
; ++i
) {
5334 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5335 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5337 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5339 isl_basic_map_free(like
);
5340 bmap
= isl_basic_map_simplify(bmap
);
5341 bmap
= isl_basic_map_finalize(bmap
);
5344 isl_basic_map_free(like
);
5345 isl_basic_set_free(bset
);
5349 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5350 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5352 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5353 bset_to_bmap(like
)));
5356 __isl_give isl_set
*isl_map_underlying_set(__isl_take isl_map
*map
)
5360 map
= isl_map_cow(map
);
5363 map
->dim
= isl_space_cow(map
->dim
);
5367 for (i
= 1; i
< map
->n
; ++i
)
5368 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5370 for (i
= 0; i
< map
->n
; ++i
) {
5371 map
->p
[i
] = bset_to_bmap(
5372 isl_basic_map_underlying_set(map
->p
[i
]));
5377 map
->dim
= isl_space_underlying(map
->dim
, 0);
5379 isl_space_free(map
->dim
);
5380 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5384 return set_from_map(map
);
5390 /* Replace the space of "bmap" by "space".
5392 * If the space of "bmap" is identical to "space" (including the identifiers
5393 * of the input and output dimensions), then simply return the original input.
5395 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5396 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5399 isl_space
*bmap_space
;
5401 bmap_space
= isl_basic_map_peek_space(bmap
);
5402 equal
= isl_space_is_equal(bmap_space
, space
);
5403 if (equal
>= 0 && equal
)
5404 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5408 isl_space_free(space
);
5411 bmap
= isl_basic_map_cow(bmap
);
5412 if (!bmap
|| !space
)
5415 isl_space_free(bmap
->dim
);
5418 bmap
= isl_basic_map_finalize(bmap
);
5422 isl_basic_map_free(bmap
);
5423 isl_space_free(space
);
5427 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5428 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5430 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5434 /* Check that the total dimensions of "map" and "space" are the same.
5436 static isl_stat
check_map_space_equal_total_dim(__isl_keep isl_map
*map
,
5437 __isl_keep isl_space
*space
)
5439 unsigned dim1
, dim2
;
5442 return isl_stat_error
;
5443 dim1
= isl_map_dim(map
, isl_dim_all
);
5444 dim2
= isl_space_dim(space
, isl_dim_all
);
5447 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5448 "total dimensions do not match", return isl_stat_error
);
5451 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5452 __isl_take isl_space
*space
)
5456 map
= isl_map_cow(map
);
5460 for (i
= 0; i
< map
->n
; ++i
) {
5461 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5462 isl_space_copy(space
));
5466 isl_space_free(map
->dim
);
5472 isl_space_free(space
);
5476 /* Replace the space of "map" by "space", without modifying
5477 * the dimension of "map".
5479 * If the space of "map" is identical to "space" (including the identifiers
5480 * of the input and output dimensions), then simply return the original input.
5482 __isl_give isl_map
*isl_map_reset_equal_dim_space(__isl_take isl_map
*map
,
5483 __isl_take isl_space
*space
)
5486 isl_space
*map_space
;
5488 map_space
= isl_map_peek_space(map
);
5489 equal
= isl_space_is_equal(map_space
, space
);
5490 if (equal
>= 0 && equal
)
5491 equal
= isl_space_has_equal_ids(map_space
, space
);
5495 isl_space_free(space
);
5498 if (check_map_space_equal_total_dim(map
, space
) < 0)
5500 return isl_map_reset_space(map
, space
);
5503 isl_space_free(space
);
5507 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5508 __isl_take isl_space
*dim
)
5510 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5513 /* Compute the parameter domain of the given basic set.
5515 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5521 is_params
= isl_basic_set_is_params(bset
);
5523 return isl_basic_set_free(bset
);
5527 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5528 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5529 space
= isl_basic_set_get_space(bset
);
5530 space
= isl_space_params(space
);
5531 bset
= isl_basic_set_reset_space(bset
, space
);
5535 /* Construct a zero-dimensional basic set with the given parameter domain.
5537 __isl_give isl_basic_set
*isl_basic_set_from_params(
5538 __isl_take isl_basic_set
*bset
)
5541 space
= isl_basic_set_get_space(bset
);
5542 space
= isl_space_set_from_params(space
);
5543 bset
= isl_basic_set_reset_space(bset
, space
);
5547 /* Compute the parameter domain of the given set.
5549 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5554 if (isl_set_is_params(set
))
5557 n
= isl_set_dim(set
, isl_dim_set
);
5558 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5559 space
= isl_set_get_space(set
);
5560 space
= isl_space_params(space
);
5561 set
= isl_set_reset_space(set
, space
);
5565 /* Construct a zero-dimensional set with the given parameter domain.
5567 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5570 space
= isl_set_get_space(set
);
5571 space
= isl_space_set_from_params(space
);
5572 set
= isl_set_reset_space(set
, space
);
5576 /* Compute the parameter domain of the given map.
5578 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5583 n
= isl_map_dim(map
, isl_dim_in
);
5584 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5585 n
= isl_map_dim(map
, isl_dim_out
);
5586 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5587 space
= isl_map_get_space(map
);
5588 space
= isl_space_params(space
);
5589 map
= isl_map_reset_space(map
, space
);
5593 __isl_give isl_basic_set
*isl_basic_map_domain(__isl_take isl_basic_map
*bmap
)
5600 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5602 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5603 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5605 return isl_basic_map_reset_space(bmap
, space
);
5608 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5611 return isl_bool_error
;
5612 return isl_space_may_be_set(bmap
->dim
);
5615 /* Is this basic map actually a set?
5616 * Users should never call this function. Outside of isl,
5617 * the type should indicate whether something is a set or a map.
5619 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5622 return isl_bool_error
;
5623 return isl_space_is_set(bmap
->dim
);
5626 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5630 is_set
= isl_basic_map_is_set(bmap
);
5635 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5637 isl_basic_map_free(bmap
);
5641 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5642 __isl_take isl_basic_map
*bmap
)
5646 isl_basic_map
*domain
;
5647 int nparam
, n_in
, n_out
;
5649 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5650 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5651 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5653 space
= isl_basic_map_get_space(bmap
);
5654 space
= isl_space_from_range(isl_space_domain(space
));
5655 domain
= isl_basic_map_universe(space
);
5657 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5658 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5659 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5661 for (i
= 0; i
< n_in
; ++i
)
5662 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5665 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5666 return isl_basic_map_finalize(bmap
);
5669 __isl_give isl_basic_map
*isl_basic_map_range_map(
5670 __isl_take isl_basic_map
*bmap
)
5674 isl_basic_map
*range
;
5675 int nparam
, n_in
, n_out
;
5677 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5678 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5679 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5681 space
= isl_basic_map_get_space(bmap
);
5682 space
= isl_space_from_range(isl_space_range(space
));
5683 range
= isl_basic_map_universe(space
);
5685 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5686 bmap
= isl_basic_map_apply_range(bmap
, range
);
5687 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5689 for (i
= 0; i
< n_out
; ++i
)
5690 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5693 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5694 return isl_basic_map_finalize(bmap
);
5697 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5701 return isl_space_may_be_set(map
->dim
);
5704 /* Is this map actually a set?
5705 * Users should never call this function. Outside of isl,
5706 * the type should indicate whether something is a set or a map.
5708 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5711 return isl_bool_error
;
5712 return isl_space_is_set(map
->dim
);
5715 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
5719 struct isl_set
*set
;
5721 is_set
= isl_map_is_set(map
);
5725 return set_from_map(map
);
5727 map
= isl_map_cow(map
);
5731 set
= set_from_map(map
);
5732 set
->dim
= isl_space_range(set
->dim
);
5735 for (i
= 0; i
< map
->n
; ++i
) {
5736 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5740 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5741 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5748 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5752 map
= isl_map_cow(map
);
5756 map
->dim
= isl_space_domain_map(map
->dim
);
5759 for (i
= 0; i
< map
->n
; ++i
) {
5760 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5764 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5765 map
= isl_map_unmark_normalized(map
);
5772 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5775 isl_space
*range_dim
;
5777 map
= isl_map_cow(map
);
5781 range_dim
= isl_space_range(isl_map_get_space(map
));
5782 range_dim
= isl_space_from_range(range_dim
);
5783 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5784 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5787 for (i
= 0; i
< map
->n
; ++i
) {
5788 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5792 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5793 map
= isl_map_unmark_normalized(map
);
5800 /* Given a wrapped map of the form A[B -> C],
5801 * return the map A[B -> C] -> B.
5803 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5810 if (!isl_set_has_tuple_id(set
))
5811 return isl_map_domain_map(isl_set_unwrap(set
));
5813 id
= isl_set_get_tuple_id(set
);
5814 map
= isl_map_domain_map(isl_set_unwrap(set
));
5815 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5820 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5821 __isl_take isl_basic_set
*bset
)
5823 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5826 __isl_give isl_basic_map
*isl_basic_map_from_range(
5827 __isl_take isl_basic_set
*bset
)
5830 space
= isl_basic_set_get_space(bset
);
5831 space
= isl_space_from_range(space
);
5832 bset
= isl_basic_set_reset_space(bset
, space
);
5833 return bset_to_bmap(bset
);
5836 /* Create a relation with the given set as range.
5837 * The domain of the created relation is a zero-dimensional
5838 * flat anonymous space.
5840 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5843 space
= isl_set_get_space(set
);
5844 space
= isl_space_from_range(space
);
5845 set
= isl_set_reset_space(set
, space
);
5846 return set_to_map(set
);
5849 /* Create a relation with the given set as domain.
5850 * The range of the created relation is a zero-dimensional
5851 * flat anonymous space.
5853 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5855 return isl_map_reverse(isl_map_from_range(set
));
5858 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5859 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5861 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5864 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5865 __isl_take isl_set
*range
)
5867 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5870 /* Return a newly allocated isl_map with given space and flags and
5871 * room for "n" basic maps.
5872 * Make sure that all cached information is cleared.
5874 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5877 struct isl_map
*map
;
5882 isl_die(space
->ctx
, isl_error_internal
,
5883 "negative number of basic maps", goto error
);
5884 map
= isl_calloc(space
->ctx
, struct isl_map
,
5885 sizeof(struct isl_map
) +
5886 (n
- 1) * sizeof(struct isl_basic_map
*));
5890 map
->ctx
= space
->ctx
;
5891 isl_ctx_ref(map
->ctx
);
5899 isl_space_free(space
);
5903 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*space
)
5905 struct isl_basic_map
*bmap
;
5906 bmap
= isl_basic_map_alloc_space(space
, 0, 1, 0);
5907 bmap
= isl_basic_map_set_to_empty(bmap
);
5911 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*space
)
5913 struct isl_basic_set
*bset
;
5914 bset
= isl_basic_set_alloc_space(space
, 0, 1, 0);
5915 bset
= isl_basic_set_set_to_empty(bset
);
5919 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*space
)
5921 struct isl_basic_map
*bmap
;
5922 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 0);
5923 bmap
= isl_basic_map_finalize(bmap
);
5927 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*space
)
5929 struct isl_basic_set
*bset
;
5930 bset
= isl_basic_set_alloc_space(space
, 0, 0, 0);
5931 bset
= isl_basic_set_finalize(bset
);
5935 __isl_give isl_basic_map
*isl_basic_map_nat_universe(
5936 __isl_take isl_space
*space
)
5939 unsigned total
= isl_space_dim(space
, isl_dim_all
);
5940 isl_basic_map
*bmap
;
5942 bmap
= isl_basic_map_alloc_space(space
, 0, 0, total
);
5943 for (i
= 0; i
< total
; ++i
) {
5944 int k
= isl_basic_map_alloc_inequality(bmap
);
5947 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5948 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5952 isl_basic_map_free(bmap
);
5956 __isl_give isl_basic_set
*isl_basic_set_nat_universe(
5957 __isl_take isl_space
*space
)
5959 return isl_basic_map_nat_universe(space
);
5962 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5964 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5967 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5969 return isl_map_nat_universe(dim
);
5972 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*space
)
5974 return isl_map_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
5977 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*space
)
5979 return isl_set_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
5982 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*space
)
5984 struct isl_map
*map
;
5987 map
= isl_map_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
5988 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(space
));
5992 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*space
)
5994 struct isl_set
*set
;
5997 set
= isl_set_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
5998 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(space
));
6002 struct isl_map
*isl_map_dup(struct isl_map
*map
)
6005 struct isl_map
*dup
;
6009 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6010 for (i
= 0; i
< map
->n
; ++i
)
6011 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6015 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6016 __isl_take isl_basic_map
*bmap
)
6020 if (isl_basic_map_plain_is_empty(bmap
)) {
6021 isl_basic_map_free(bmap
);
6024 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6025 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6026 map
->p
[map
->n
] = bmap
;
6028 map
= isl_map_unmark_normalized(map
);
6034 isl_basic_map_free(bmap
);
6038 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6049 isl_ctx_deref(map
->ctx
);
6050 for (i
= 0; i
< map
->n
; ++i
)
6051 isl_basic_map_free(map
->p
[i
]);
6052 isl_space_free(map
->dim
);
6058 static __isl_give isl_basic_map
*isl_basic_map_fix_pos_si(
6059 __isl_take isl_basic_map
*bmap
, unsigned pos
, int value
)
6063 bmap
= isl_basic_map_cow(bmap
);
6064 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6065 j
= isl_basic_map_alloc_equality(bmap
);
6068 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6069 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6070 isl_int_set_si(bmap
->eq
[j
][0], value
);
6071 bmap
= isl_basic_map_simplify(bmap
);
6072 return isl_basic_map_finalize(bmap
);
6074 isl_basic_map_free(bmap
);
6078 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6079 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6083 bmap
= isl_basic_map_cow(bmap
);
6084 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6085 j
= isl_basic_map_alloc_equality(bmap
);
6088 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6089 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6090 isl_int_set(bmap
->eq
[j
][0], value
);
6091 bmap
= isl_basic_map_simplify(bmap
);
6092 return isl_basic_map_finalize(bmap
);
6094 isl_basic_map_free(bmap
);
6098 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6099 enum isl_dim_type type
, unsigned pos
, int value
)
6101 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6102 return isl_basic_map_free(bmap
);
6103 return isl_basic_map_fix_pos_si(bmap
,
6104 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6107 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6108 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6110 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6111 return isl_basic_map_free(bmap
);
6112 return isl_basic_map_fix_pos(bmap
,
6113 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6116 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6117 * to be equal to "v".
6119 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6120 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6124 if (!isl_val_is_int(v
))
6125 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6126 "expecting integer value", goto error
);
6127 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6129 pos
+= isl_basic_map_offset(bmap
, type
);
6130 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6134 isl_basic_map_free(bmap
);
6139 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6140 * to be equal to "v".
6142 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6143 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6145 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6148 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6149 enum isl_dim_type type
, unsigned pos
, int value
)
6151 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6155 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6156 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6158 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6162 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6163 unsigned input
, int value
)
6165 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6168 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6169 unsigned dim
, int value
)
6171 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6172 isl_dim_set
, dim
, value
));
6175 /* Remove the basic map at position "i" from "map" if this basic map
6176 * is (obviously) empty.
6178 static __isl_give isl_map
*remove_if_empty(__isl_take isl_map
*map
, int i
)
6185 empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6187 return isl_map_free(map
);
6191 isl_basic_map_free(map
->p
[i
]);
6194 map
->p
[i
] = map
->p
[map
->n
];
6195 map
= isl_map_unmark_normalized(map
);
6202 /* Perform "fn" on each basic map of "map", where we may not be holding
6203 * the only reference to "map".
6204 * In particular, "fn" should be a semantics preserving operation
6205 * that we want to apply to all copies of "map". We therefore need
6206 * to be careful not to modify "map" in a way that breaks "map"
6207 * in case anything goes wrong.
6209 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6210 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6212 struct isl_basic_map
*bmap
;
6218 for (i
= map
->n
- 1; i
>= 0; --i
) {
6219 bmap
= isl_basic_map_copy(map
->p
[i
]);
6223 isl_basic_map_free(map
->p
[i
]);
6225 map
= remove_if_empty(map
, i
);
6236 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6237 enum isl_dim_type type
, unsigned pos
, int value
)
6241 map
= isl_map_cow(map
);
6242 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6243 return isl_map_free(map
);
6244 for (i
= map
->n
- 1; i
>= 0; --i
) {
6245 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6246 map
= remove_if_empty(map
, i
);
6250 map
= isl_map_unmark_normalized(map
);
6254 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6255 enum isl_dim_type type
, unsigned pos
, int value
)
6257 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6260 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6261 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6265 map
= isl_map_cow(map
);
6266 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6267 return isl_map_free(map
);
6268 for (i
= 0; i
< map
->n
; ++i
) {
6269 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6273 map
= isl_map_unmark_normalized(map
);
6280 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6281 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6283 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6286 /* Fix the value of the variable at position "pos" of type "type" of "map"
6287 * to be equal to "v".
6289 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6290 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6294 map
= isl_map_cow(map
);
6298 if (!isl_val_is_int(v
))
6299 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6300 "expecting integer value", goto error
);
6301 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6303 for (i
= map
->n
- 1; i
>= 0; --i
) {
6304 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6306 map
= remove_if_empty(map
, i
);
6310 map
= isl_map_unmark_normalized(map
);
6319 /* Fix the value of the variable at position "pos" of type "type" of "set"
6320 * to be equal to "v".
6322 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6323 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6325 return isl_map_fix_val(set
, type
, pos
, v
);
6328 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6329 unsigned input
, int value
)
6331 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6334 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6336 return set_from_map(isl_map_fix_si(set_to_map(set
),
6337 isl_dim_set
, dim
, value
));
6340 static __isl_give isl_basic_map
*basic_map_bound_si(
6341 __isl_take isl_basic_map
*bmap
,
6342 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6346 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6347 return isl_basic_map_free(bmap
);
6348 pos
+= isl_basic_map_offset(bmap
, type
);
6349 bmap
= isl_basic_map_cow(bmap
);
6350 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6351 j
= isl_basic_map_alloc_inequality(bmap
);
6354 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6356 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6357 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6359 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6360 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6362 bmap
= isl_basic_map_simplify(bmap
);
6363 return isl_basic_map_finalize(bmap
);
6365 isl_basic_map_free(bmap
);
6369 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6370 __isl_take isl_basic_map
*bmap
,
6371 enum isl_dim_type type
, unsigned pos
, int value
)
6373 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6376 /* Constrain the values of the given dimension to be no greater than "value".
6378 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6379 __isl_take isl_basic_map
*bmap
,
6380 enum isl_dim_type type
, unsigned pos
, int value
)
6382 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6385 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6386 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6390 map
= isl_map_cow(map
);
6391 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6392 return isl_map_free(map
);
6393 for (i
= 0; i
< map
->n
; ++i
) {
6394 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6395 type
, pos
, value
, upper
);
6399 map
= isl_map_unmark_normalized(map
);
6406 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6407 enum isl_dim_type type
, unsigned pos
, int value
)
6409 return map_bound_si(map
, type
, pos
, value
, 0);
6412 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6413 enum isl_dim_type type
, unsigned pos
, int value
)
6415 return map_bound_si(map
, type
, pos
, value
, 1);
6418 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6419 enum isl_dim_type type
, unsigned pos
, int value
)
6421 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6425 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6426 enum isl_dim_type type
, unsigned pos
, int value
)
6428 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6431 /* Bound the given variable of "bmap" from below (or above is "upper"
6432 * is set) to "value".
6434 static __isl_give isl_basic_map
*basic_map_bound(
6435 __isl_take isl_basic_map
*bmap
,
6436 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6440 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6441 return isl_basic_map_free(bmap
);
6442 pos
+= isl_basic_map_offset(bmap
, type
);
6443 bmap
= isl_basic_map_cow(bmap
);
6444 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6445 j
= isl_basic_map_alloc_inequality(bmap
);
6448 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6450 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6451 isl_int_set(bmap
->ineq
[j
][0], value
);
6453 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6454 isl_int_neg(bmap
->ineq
[j
][0], value
);
6456 bmap
= isl_basic_map_simplify(bmap
);
6457 return isl_basic_map_finalize(bmap
);
6459 isl_basic_map_free(bmap
);
6463 /* Bound the given variable of "map" from below (or above is "upper"
6464 * is set) to "value".
6466 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6467 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6471 map
= isl_map_cow(map
);
6472 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
6473 return isl_map_free(map
);
6474 for (i
= map
->n
- 1; i
>= 0; --i
) {
6475 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6476 map
= remove_if_empty(map
, i
);
6480 map
= isl_map_unmark_normalized(map
);
6484 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6485 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6487 return map_bound(map
, type
, pos
, value
, 0);
6490 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6491 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6493 return map_bound(map
, type
, pos
, value
, 1);
6496 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6497 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6499 return isl_map_lower_bound(set
, type
, pos
, value
);
6502 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6503 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6505 return isl_map_upper_bound(set
, type
, pos
, value
);
6508 /* Force the values of the variable at position "pos" of type "type" of "set"
6509 * to be no smaller than "value".
6511 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6512 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6516 if (!isl_val_is_int(value
))
6517 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6518 "expecting integer value", goto error
);
6519 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6520 isl_val_free(value
);
6523 isl_val_free(value
);
6528 /* Force the values of the variable at position "pos" of type "type" of "set"
6529 * to be no greater than "value".
6531 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6532 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6536 if (!isl_val_is_int(value
))
6537 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6538 "expecting integer value", goto error
);
6539 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6540 isl_val_free(value
);
6543 isl_val_free(value
);
6548 /* Bound the given variable of "bset" from below (or above is "upper"
6549 * is set) to "value".
6551 static __isl_give isl_basic_set
*isl_basic_set_bound(
6552 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6553 isl_int value
, int upper
)
6555 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
6556 type
, pos
, value
, upper
));
6559 /* Bound the given variable of "bset" from below (or above is "upper"
6560 * is set) to "value".
6562 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
6563 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6564 __isl_take isl_val
*value
, int upper
)
6568 if (!isl_val_is_int(value
))
6569 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
6570 "expecting integer value", goto error
);
6571 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
6572 isl_val_free(value
);
6575 isl_val_free(value
);
6576 isl_basic_set_free(bset
);
6580 /* Bound the given variable of "bset" from below to "value".
6582 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
6583 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6584 __isl_take isl_val
*value
)
6586 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
6589 /* Bound the given variable of "bset" from above to "value".
6591 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
6592 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6593 __isl_take isl_val
*value
)
6595 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
6598 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6602 map
= isl_map_cow(map
);
6606 map
->dim
= isl_space_reverse(map
->dim
);
6609 for (i
= 0; i
< map
->n
; ++i
) {
6610 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6614 map
= isl_map_unmark_normalized(map
);
6622 #define TYPE isl_pw_multi_aff
6624 #define SUFFIX _pw_multi_aff
6626 #define EMPTY isl_pw_multi_aff_empty
6628 #define ADD isl_pw_multi_aff_union_add
6629 #include "isl_map_lexopt_templ.c"
6631 /* Given a map "map", compute the lexicographically minimal
6632 * (or maximal) image element for each domain element in dom,
6633 * in the form of an isl_pw_multi_aff.
6634 * If "empty" is not NULL, then set *empty to those elements in dom that
6635 * do not have an image element.
6636 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6637 * should be computed over the domain of "map". "empty" is also NULL
6640 * We first compute the lexicographically minimal or maximal element
6641 * in the first basic map. This results in a partial solution "res"
6642 * and a subset "todo" of dom that still need to be handled.
6643 * We then consider each of the remaining maps in "map" and successively
6644 * update both "res" and "todo".
6645 * If "empty" is NULL, then the todo sets are not needed and therefore
6646 * also not computed.
6648 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6649 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6650 __isl_give isl_set
**empty
, unsigned flags
)
6654 isl_pw_multi_aff
*res
;
6657 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6658 if (!map
|| (!full
&& !dom
))
6661 if (isl_map_plain_is_empty(map
)) {
6666 return isl_pw_multi_aff_from_map(map
);
6669 res
= basic_map_partial_lexopt_pw_multi_aff(
6670 isl_basic_map_copy(map
->p
[0]),
6671 isl_set_copy(dom
), empty
, flags
);
6675 for (i
= 1; i
< map
->n
; ++i
) {
6676 isl_pw_multi_aff
*res_i
;
6678 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6679 isl_basic_map_copy(map
->p
[i
]),
6680 isl_set_copy(dom
), empty
, flags
);
6682 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6683 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6685 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6688 todo
= isl_set_intersect(todo
, *empty
);
6707 #define TYPE isl_map
6711 #define EMPTY isl_map_empty
6713 #define ADD isl_map_union_disjoint
6714 #include "isl_map_lexopt_templ.c"
6716 /* Given a map "map", compute the lexicographically minimal
6717 * (or maximal) image element for each domain element in "dom",
6718 * in the form of an isl_map.
6719 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6720 * do not have an image element.
6721 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6722 * should be computed over the domain of "map". "empty" is also NULL
6725 * If the input consists of more than one disjunct, then first
6726 * compute the desired result in the form of an isl_pw_multi_aff and
6727 * then convert that into an isl_map.
6729 * This function used to have an explicit implementation in terms
6730 * of isl_maps, but it would continually intersect the domains of
6731 * partial results with the complement of the domain of the next
6732 * partial solution, potentially leading to an explosion in the number
6733 * of disjuncts if there are several disjuncts in the input.
6734 * An even earlier implementation of this function would look for
6735 * better results in the domain of the partial result and for extra
6736 * results in the complement of this domain, which would lead to
6737 * even more splintering.
6739 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6740 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6741 __isl_give isl_set
**empty
, unsigned flags
)
6744 struct isl_map
*res
;
6745 isl_pw_multi_aff
*pma
;
6747 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6748 if (!map
|| (!full
&& !dom
))
6751 if (isl_map_plain_is_empty(map
)) {
6760 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6766 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6768 return isl_map_from_pw_multi_aff(pma
);
6777 __isl_give isl_map
*isl_map_partial_lexmax(
6778 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6779 __isl_give isl_set
**empty
)
6781 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6784 __isl_give isl_map
*isl_map_partial_lexmin(
6785 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6786 __isl_give isl_set
**empty
)
6788 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6791 __isl_give isl_set
*isl_set_partial_lexmin(
6792 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6793 __isl_give isl_set
**empty
)
6795 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6799 __isl_give isl_set
*isl_set_partial_lexmax(
6800 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6801 __isl_give isl_set
**empty
)
6803 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6807 /* Compute the lexicographic minimum (or maximum if "flags" includes
6808 * ISL_OPT_MAX) of "bset" over its parametric domain.
6810 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6813 return isl_basic_map_lexopt(bset
, flags
);
6816 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6818 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6821 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6823 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6826 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6828 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6831 /* Compute the lexicographic minimum of "bset" over its parametric domain
6832 * for the purpose of quantifier elimination.
6833 * That is, find an explicit representation for all the existentially
6834 * quantified variables in "bset" by computing their lexicographic
6837 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6838 __isl_take isl_basic_set
*bset
)
6840 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6843 /* Given a basic map with one output dimension, compute the minimum or
6844 * maximum of that dimension as an isl_pw_aff.
6846 * Compute the optimum as a lexicographic optimum over the single
6847 * output dimension and extract the single isl_pw_aff from the result.
6849 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6852 isl_pw_multi_aff
*pma
;
6855 bmap
= isl_basic_map_copy(bmap
);
6856 pma
= isl_basic_map_lexopt_pw_multi_aff(bmap
, max
? ISL_OPT_MAX
: 0);
6857 pwaff
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
6858 isl_pw_multi_aff_free(pma
);
6863 /* Compute the minimum or maximum of the given output dimension
6864 * as a function of the parameters and the input dimensions,
6865 * but independently of the other output dimensions.
6867 * We first project out the other output dimension and then compute
6868 * the "lexicographic" maximum in each basic map, combining the results
6869 * using isl_pw_aff_union_max.
6871 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6878 n_out
= isl_map_dim(map
, isl_dim_out
);
6879 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6880 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6885 isl_space
*space
= isl_map_get_space(map
);
6887 return isl_pw_aff_empty(space
);
6890 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6891 for (i
= 1; i
< map
->n
; ++i
) {
6892 isl_pw_aff
*pwaff_i
;
6894 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6895 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6903 /* Compute the minimum of the given output dimension as a function of the
6904 * parameters and input dimensions, but independently of
6905 * the other output dimensions.
6907 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6909 return map_dim_opt(map
, pos
, 0);
6912 /* Compute the maximum of the given output dimension as a function of the
6913 * parameters and input dimensions, but independently of
6914 * the other output dimensions.
6916 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6918 return map_dim_opt(map
, pos
, 1);
6921 /* Compute the minimum or maximum of the given set dimension
6922 * as a function of the parameters,
6923 * but independently of the other set dimensions.
6925 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6928 return map_dim_opt(set
, pos
, max
);
6931 /* Compute the maximum of the given set dimension as a function of the
6932 * parameters, but independently of the other set dimensions.
6934 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6936 return set_dim_opt(set
, pos
, 1);
6939 /* Compute the minimum of the given set dimension as a function of the
6940 * parameters, but independently of the other set dimensions.
6942 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6944 return set_dim_opt(set
, pos
, 0);
6947 /* Apply a preimage specified by "mat" on the parameters of "bset".
6948 * bset is assumed to have only parameters and divs.
6950 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
6951 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
6958 bset
->dim
= isl_space_cow(bset
->dim
);
6962 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6964 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6966 bset
->dim
->nparam
= 0;
6967 bset
->dim
->n_out
= nparam
;
6968 bset
= isl_basic_set_preimage(bset
, mat
);
6970 bset
->dim
->nparam
= bset
->dim
->n_out
;
6971 bset
->dim
->n_out
= 0;
6976 isl_basic_set_free(bset
);
6980 /* Apply a preimage specified by "mat" on the parameters of "set".
6981 * set is assumed to have only parameters and divs.
6983 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
6984 __isl_take isl_mat
*mat
)
6992 nparam
= isl_set_dim(set
, isl_dim_param
);
6994 if (mat
->n_row
!= 1 + nparam
)
6995 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
6996 "unexpected number of rows", goto error
);
6998 space
= isl_set_get_space(set
);
6999 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7000 isl_dim_param
, 0, nparam
);
7001 set
= isl_set_reset_space(set
, space
);
7002 set
= isl_set_preimage(set
, mat
);
7003 nparam
= isl_set_dim(set
, isl_dim_out
);
7004 space
= isl_set_get_space(set
);
7005 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7006 isl_dim_out
, 0, nparam
);
7007 set
= isl_set_reset_space(set
, space
);
7015 /* Intersect the basic set "bset" with the affine space specified by the
7016 * equalities in "eq".
7018 static __isl_give isl_basic_set
*basic_set_append_equalities(
7019 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7027 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7032 len
= isl_basic_set_offset(bset
, isl_dim_div
) + bset
->extra
;
7033 for (i
= 0; i
< eq
->n_row
; ++i
) {
7034 k
= isl_basic_set_alloc_equality(bset
);
7037 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7038 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7042 bset
= isl_basic_set_gauss(bset
, NULL
);
7043 bset
= isl_basic_set_finalize(bset
);
7048 isl_basic_set_free(bset
);
7052 /* Intersect the set "set" with the affine space specified by the
7053 * equalities in "eq".
7055 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7063 for (i
= 0; i
< set
->n
; ++i
) {
7064 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7077 /* Given a basic set "bset" that only involves parameters and existentially
7078 * quantified variables, return the index of the first equality
7079 * that only involves parameters. If there is no such equality then
7080 * return bset->n_eq.
7082 * This function assumes that isl_basic_set_gauss has been called on "bset".
7084 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7087 unsigned nparam
, n_div
;
7092 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7093 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7095 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7096 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7103 /* Compute an explicit representation for the existentially quantified
7104 * variables in "bset" by computing the "minimal value" of the set
7105 * variables. Since there are no set variables, the computation of
7106 * the minimal value essentially computes an explicit representation
7107 * of the non-empty part(s) of "bset".
7109 * The input only involves parameters and existentially quantified variables.
7110 * All equalities among parameters have been removed.
7112 * Since the existentially quantified variables in the result are in general
7113 * going to be different from those in the input, we first replace
7114 * them by the minimal number of variables based on their equalities.
7115 * This should simplify the parametric integer programming.
7117 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7119 isl_morph
*morph1
, *morph2
;
7125 if (bset
->n_eq
== 0)
7126 return isl_basic_set_lexmin_compute_divs(bset
);
7128 morph1
= isl_basic_set_parameter_compression(bset
);
7129 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7130 bset
= isl_basic_set_lift(bset
);
7131 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7132 bset
= isl_morph_basic_set(morph2
, bset
);
7133 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7134 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7136 set
= isl_basic_set_lexmin_compute_divs(bset
);
7138 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7143 /* Project the given basic set onto its parameter domain, possibly introducing
7144 * new, explicit, existential variables in the constraints.
7145 * The input has parameters and (possibly implicit) existential variables.
7146 * The output has the same parameters, but only
7147 * explicit existentially quantified variables.
7149 * The actual projection is performed by pip, but pip doesn't seem
7150 * to like equalities very much, so we first remove the equalities
7151 * among the parameters by performing a variable compression on
7152 * the parameters. Afterward, an inverse transformation is performed
7153 * and the equalities among the parameters are inserted back in.
7155 * The variable compression on the parameters may uncover additional
7156 * equalities that were only implicit before. We therefore check
7157 * if there are any new parameter equalities in the result and
7158 * if so recurse. The removal of parameter equalities is required
7159 * for the parameter compression performed by base_compute_divs.
7161 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7165 struct isl_mat
*T
, *T2
;
7166 struct isl_set
*set
;
7169 bset
= isl_basic_set_cow(bset
);
7173 if (bset
->n_eq
== 0)
7174 return base_compute_divs(bset
);
7176 bset
= isl_basic_set_gauss(bset
, NULL
);
7179 if (isl_basic_set_plain_is_empty(bset
))
7180 return isl_set_from_basic_set(bset
);
7182 i
= first_parameter_equality(bset
);
7183 if (i
== bset
->n_eq
)
7184 return base_compute_divs(bset
);
7186 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7187 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7189 eq
= isl_mat_cow(eq
);
7190 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7191 if (T
&& T
->n_col
== 0) {
7195 bset
= isl_basic_set_set_to_empty(bset
);
7196 return isl_set_from_basic_set(bset
);
7198 bset
= basic_set_parameter_preimage(bset
, T
);
7200 i
= first_parameter_equality(bset
);
7203 else if (i
== bset
->n_eq
)
7204 set
= base_compute_divs(bset
);
7206 set
= parameter_compute_divs(bset
);
7207 set
= set_parameter_preimage(set
, T2
);
7208 set
= set_append_equalities(set
, eq
);
7212 /* Insert the divs from "ls" before those of "bmap".
7214 * The number of columns is not changed, which means that the last
7215 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7216 * The caller is responsible for removing the same number of dimensions
7217 * from the space of "bmap".
7219 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7220 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7226 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7230 old_n_div
= bmap
->n_div
;
7231 bmap
= insert_div_rows(bmap
, n_div
);
7235 for (i
= 0; i
< n_div
; ++i
) {
7236 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7237 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7243 /* Replace the space of "bmap" by the space and divs of "ls".
7245 * If "ls" has any divs, then we simplify the result since we may
7246 * have discovered some additional equalities that could simplify
7247 * the div expressions.
7249 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7250 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7254 bmap
= isl_basic_map_cow(bmap
);
7258 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7259 bmap
= insert_divs_from_local_space(bmap
, ls
);
7263 isl_space_free(bmap
->dim
);
7264 bmap
->dim
= isl_local_space_get_space(ls
);
7268 isl_local_space_free(ls
);
7270 bmap
= isl_basic_map_simplify(bmap
);
7271 bmap
= isl_basic_map_finalize(bmap
);
7274 isl_basic_map_free(bmap
);
7275 isl_local_space_free(ls
);
7279 /* Replace the space of "map" by the space and divs of "ls".
7281 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7282 __isl_take isl_local_space
*ls
)
7286 map
= isl_map_cow(map
);
7290 for (i
= 0; i
< map
->n
; ++i
) {
7291 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7292 isl_local_space_copy(ls
));
7296 isl_space_free(map
->dim
);
7297 map
->dim
= isl_local_space_get_space(ls
);
7301 isl_local_space_free(ls
);
7304 isl_local_space_free(ls
);
7309 /* Compute an explicit representation for the existentially
7310 * quantified variables for which do not know any explicit representation yet.
7312 * We first sort the existentially quantified variables so that the
7313 * existentially quantified variables for which we already have an explicit
7314 * representation are placed before those for which we do not.
7315 * The input dimensions, the output dimensions and the existentially
7316 * quantified variables for which we already have an explicit
7317 * representation are then turned into parameters.
7318 * compute_divs returns a map with the same parameters and
7319 * no input or output dimensions and the dimension specification
7320 * is reset to that of the input, including the existentially quantified
7321 * variables for which we already had an explicit representation.
7323 static __isl_give isl_map
*compute_divs(__isl_take isl_basic_map
*bmap
)
7325 struct isl_basic_set
*bset
;
7326 struct isl_set
*set
;
7327 struct isl_map
*map
;
7329 isl_local_space
*ls
;
7336 bmap
= isl_basic_map_sort_divs(bmap
);
7337 bmap
= isl_basic_map_cow(bmap
);
7341 n_known
= isl_basic_map_first_unknown_div(bmap
);
7343 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7345 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7346 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7347 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7348 space
= isl_space_set_alloc(bmap
->ctx
,
7349 nparam
+ n_in
+ n_out
+ n_known
, 0);
7353 ls
= isl_basic_map_get_local_space(bmap
);
7354 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7355 n_known
, bmap
->n_div
- n_known
);
7357 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7358 swap_div(bmap
, i
- n_known
, i
);
7359 bmap
->n_div
-= n_known
;
7360 bmap
->extra
-= n_known
;
7362 bmap
= isl_basic_map_reset_space(bmap
, space
);
7363 bset
= bset_from_bmap(bmap
);
7365 set
= parameter_compute_divs(bset
);
7366 map
= set_to_map(set
);
7367 map
= replace_space_by_local_space(map
, ls
);
7371 isl_basic_map_free(bmap
);
7375 /* Remove the explicit representation of local variable "div",
7378 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7379 __isl_take isl_basic_map
*bmap
, int div
)
7383 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7385 return isl_basic_map_free(bmap
);
7389 bmap
= isl_basic_map_cow(bmap
);
7392 isl_int_set_si(bmap
->div
[div
][0], 0);
7396 /* Is local variable "div" of "bmap" marked as not having an explicit
7398 * Note that even if "div" is not marked in this way and therefore
7399 * has an explicit representation, this representation may still
7400 * depend (indirectly) on other local variables that do not
7401 * have an explicit representation.
7403 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7406 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7407 return isl_bool_error
;
7408 return isl_int_is_zero(bmap
->div
[div
][0]);
7411 /* Return the position of the first local variable that does not
7412 * have an explicit representation.
7413 * Return the total number of local variables if they all have
7414 * an explicit representation.
7415 * Return -1 on error.
7417 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7424 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7425 if (!isl_basic_map_div_is_known(bmap
, i
))
7431 /* Return the position of the first local variable that does not
7432 * have an explicit representation.
7433 * Return the total number of local variables if they all have
7434 * an explicit representation.
7435 * Return -1 on error.
7437 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7439 return isl_basic_map_first_unknown_div(bset
);
7442 /* Does "bmap" have an explicit representation for all local variables?
7444 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7448 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7449 first
= isl_basic_map_first_unknown_div(bmap
);
7451 return isl_bool_error
;
7455 /* Do all basic maps in "map" have an explicit representation
7456 * for all local variables?
7458 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7463 return isl_bool_error
;
7465 for (i
= 0; i
< map
->n
; ++i
) {
7466 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7471 return isl_bool_true
;
7474 /* If bmap contains any unknown divs, then compute explicit
7475 * expressions for them. However, this computation may be
7476 * quite expensive, so first try to remove divs that aren't
7479 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7482 struct isl_map
*map
;
7484 known
= isl_basic_map_divs_known(bmap
);
7488 return isl_map_from_basic_map(bmap
);
7490 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7492 known
= isl_basic_map_divs_known(bmap
);
7496 return isl_map_from_basic_map(bmap
);
7498 map
= compute_divs(bmap
);
7501 isl_basic_map_free(bmap
);
7505 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
7509 struct isl_map
*res
;
7516 known
= isl_map_divs_known(map
);
7524 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7525 for (i
= 1 ; i
< map
->n
; ++i
) {
7527 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7528 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7529 res
= isl_map_union_disjoint(res
, r2
);
7531 res
= isl_map_union(res
, r2
);
7538 __isl_give isl_set
*isl_basic_set_compute_divs(__isl_take isl_basic_set
*bset
)
7540 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7543 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7545 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7548 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
7551 struct isl_set
*set
;
7556 map
= isl_map_cow(map
);
7560 set
= set_from_map(map
);
7561 set
->dim
= isl_space_domain(set
->dim
);
7564 for (i
= 0; i
< map
->n
; ++i
) {
7565 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7569 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7570 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7577 /* Return the union of "map1" and "map2", where we assume for now that
7578 * "map1" and "map2" are disjoint. Note that the basic maps inside
7579 * "map1" or "map2" may not be disjoint from each other.
7580 * Also note that this function is also called from isl_map_union,
7581 * which takes care of handling the situation where "map1" and "map2"
7582 * may not be disjoint.
7584 * If one of the inputs is empty, we can simply return the other input.
7585 * Similarly, if one of the inputs is universal, then it is equal to the union.
7587 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7588 __isl_take isl_map
*map2
)
7592 struct isl_map
*map
= NULL
;
7598 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7599 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7600 "spaces don't match", goto error
);
7611 is_universe
= isl_map_plain_is_universe(map1
);
7612 if (is_universe
< 0)
7619 is_universe
= isl_map_plain_is_universe(map2
);
7620 if (is_universe
< 0)
7627 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7628 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7629 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7631 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7632 map1
->n
+ map2
->n
, flags
);
7635 for (i
= 0; i
< map1
->n
; ++i
) {
7636 map
= isl_map_add_basic_map(map
,
7637 isl_basic_map_copy(map1
->p
[i
]));
7641 for (i
= 0; i
< map2
->n
; ++i
) {
7642 map
= isl_map_add_basic_map(map
,
7643 isl_basic_map_copy(map2
->p
[i
]));
7657 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7658 * guaranteed to be disjoint by the caller.
7660 * Note that this functions is called from within isl_map_make_disjoint,
7661 * so we have to be careful not to touch the constraints of the inputs
7664 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7665 __isl_take isl_map
*map2
)
7667 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7670 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7671 * not be disjoint. The parameters are assumed to have been aligned.
7673 * We currently simply call map_union_disjoint, the internal operation
7674 * of which does not really depend on the inputs being disjoint.
7675 * If the result contains more than one basic map, then we clear
7676 * the disjoint flag since the result may contain basic maps from
7677 * both inputs and these are not guaranteed to be disjoint.
7679 * As a special case, if "map1" and "map2" are obviously equal,
7680 * then we simply return "map1".
7682 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7683 __isl_take isl_map
*map2
)
7690 equal
= isl_map_plain_is_equal(map1
, map2
);
7698 map1
= map_union_disjoint(map1
, map2
);
7702 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7710 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7713 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7714 __isl_take isl_map
*map2
)
7716 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7719 __isl_give isl_set
*isl_set_union_disjoint(
7720 __isl_take isl_set
*set1
, __isl_take isl_set
*set2
)
7722 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7726 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7728 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7731 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7734 * "map" and "set" are assumed to be compatible and non-NULL.
7736 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7737 __isl_take isl_set
*set
,
7738 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7739 __isl_take isl_basic_set
*bset
))
7742 struct isl_map
*result
;
7745 if (isl_set_plain_is_universe(set
)) {
7750 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7751 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7752 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7754 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7755 map
->n
* set
->n
, flags
);
7756 for (i
= 0; result
&& i
< map
->n
; ++i
)
7757 for (j
= 0; j
< set
->n
; ++j
) {
7758 result
= isl_map_add_basic_map(result
,
7759 fn(isl_basic_map_copy(map
->p
[i
]),
7760 isl_basic_set_copy(set
->p
[j
])));
7770 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7771 __isl_take isl_set
*set
)
7775 ok
= isl_map_compatible_range(map
, set
);
7779 isl_die(set
->ctx
, isl_error_invalid
,
7780 "incompatible spaces", goto error
);
7782 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7789 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7790 __isl_take isl_set
*set
)
7792 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7795 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7796 __isl_take isl_set
*set
)
7800 ok
= isl_map_compatible_domain(map
, set
);
7804 isl_die(set
->ctx
, isl_error_invalid
,
7805 "incompatible spaces", goto error
);
7807 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7814 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7815 __isl_take isl_set
*set
)
7817 return isl_map_align_params_map_map_and(map
, set
,
7818 &map_intersect_domain
);
7821 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7822 * in the space B -> C, return the intersection.
7823 * The parameters are assumed to have been aligned.
7825 * The map "factor" is first extended to a map living in the space
7826 * [A -> B] -> C and then a regular intersection is computed.
7828 static __isl_give isl_map
*map_intersect_domain_factor_range(
7829 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7832 isl_map
*ext_factor
;
7834 space
= isl_space_domain_factor_domain(isl_map_get_space(map
));
7835 ext_factor
= isl_map_universe(space
);
7836 ext_factor
= isl_map_domain_product(ext_factor
, factor
);
7837 return map_intersect(map
, ext_factor
);
7840 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7841 * in the space B -> C, return the intersection.
7843 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
7844 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7846 return isl_map_align_params_map_map_and(map
, factor
,
7847 &map_intersect_domain_factor_range
);
7850 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7851 * in the space A -> C, return the intersection.
7853 * The map "factor" is first extended to a map living in the space
7854 * A -> [B -> C] and then a regular intersection is computed.
7856 static __isl_give isl_map
*map_intersect_range_factor_range(
7857 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7860 isl_map
*ext_factor
;
7862 space
= isl_space_range_factor_domain(isl_map_get_space(map
));
7863 ext_factor
= isl_map_universe(space
);
7864 ext_factor
= isl_map_range_product(ext_factor
, factor
);
7865 return isl_map_intersect(map
, ext_factor
);
7868 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7869 * in the space A -> C, return the intersection.
7871 __isl_give isl_map
*isl_map_intersect_range_factor_range(
7872 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7874 return isl_map_align_params_map_map_and(map
, factor
,
7875 &map_intersect_range_factor_range
);
7878 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7879 __isl_take isl_map
*map2
)
7883 map1
= isl_map_reverse(map1
);
7884 map1
= isl_map_apply_range(map1
, map2
);
7885 return isl_map_reverse(map1
);
7892 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7893 __isl_take isl_map
*map2
)
7895 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7898 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7899 __isl_take isl_map
*map2
)
7902 struct isl_map
*result
;
7908 space
= isl_space_join(isl_space_copy(map1
->dim
),
7909 isl_space_copy(map2
->dim
));
7911 result
= isl_map_alloc_space(space
, map1
->n
* map2
->n
, 0);
7914 for (i
= 0; i
< map1
->n
; ++i
)
7915 for (j
= 0; j
< map2
->n
; ++j
) {
7916 result
= isl_map_add_basic_map(result
,
7917 isl_basic_map_apply_range(
7918 isl_basic_map_copy(map1
->p
[i
]),
7919 isl_basic_map_copy(map2
->p
[j
])));
7925 if (result
&& result
->n
<= 1)
7926 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7934 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7935 __isl_take isl_map
*map2
)
7937 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7941 * returns range - domain
7943 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
7945 isl_space
*target_space
;
7946 struct isl_basic_set
*bset
;
7953 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7954 bmap
->dim
, isl_dim_out
),
7956 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
7957 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
7958 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7959 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
7960 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
7961 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
7962 for (i
= 0; i
< dim
; ++i
) {
7963 int j
= isl_basic_map_alloc_equality(bmap
);
7965 bmap
= isl_basic_map_free(bmap
);
7968 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7969 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7970 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
7971 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7973 bset
= isl_basic_map_domain(bmap
);
7974 bset
= isl_basic_set_reset_space(bset
, target_space
);
7977 isl_basic_map_free(bmap
);
7981 /* Check that domain and range of "map" are the same.
7983 isl_stat
isl_map_check_equal_tuples(__isl_keep isl_map
*map
)
7988 space
= isl_map_peek_space(map
);
7989 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
7991 return isl_stat_error
;
7993 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
7994 "domain and range don't match", return isl_stat_error
);
7999 * returns range - domain
8001 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8005 struct isl_set
*result
;
8010 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8011 map
->dim
, isl_dim_out
),
8013 dim
= isl_map_get_space(map
);
8014 dim
= isl_space_domain(dim
);
8015 result
= isl_set_alloc_space(dim
, map
->n
, 0);
8018 for (i
= 0; i
< map
->n
; ++i
)
8019 result
= isl_set_add_basic_set(result
,
8020 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8029 * returns [domain -> range] -> range - domain
8031 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8032 __isl_take isl_basic_map
*bmap
)
8036 isl_basic_map
*domain
;
8040 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8041 bmap
->dim
, isl_dim_out
))
8042 isl_die(bmap
->ctx
, isl_error_invalid
,
8043 "domain and range don't match", goto error
);
8045 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8046 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8048 space
= isl_basic_map_get_space(bmap
);
8049 space
= isl_space_from_range(isl_space_domain(space
));
8050 domain
= isl_basic_map_universe(space
);
8052 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8053 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8054 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8056 total
= isl_basic_map_total_dim(bmap
);
8058 for (i
= 0; i
< n
; ++i
) {
8059 k
= isl_basic_map_alloc_equality(bmap
);
8062 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8063 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8064 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8065 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8068 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8069 return isl_basic_map_finalize(bmap
);
8071 isl_basic_map_free(bmap
);
8076 * returns [domain -> range] -> range - domain
8078 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8081 isl_space
*domain_space
;
8083 if (isl_map_check_equal_tuples(map
) < 0)
8084 return isl_map_free(map
);
8086 map
= isl_map_cow(map
);
8090 domain_space
= isl_space_domain(isl_map_get_space(map
));
8091 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
8092 map
->dim
= isl_space_join(map
->dim
, isl_space_from_range(domain_space
));
8095 for (i
= 0; i
< map
->n
; ++i
) {
8096 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8100 map
= isl_map_unmark_normalized(map
);
8107 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*space
)
8109 unsigned n_in
, n_out
;
8113 n_in
= isl_space_dim(space
, isl_dim_in
);
8114 n_out
= isl_space_dim(space
, isl_dim_out
);
8116 isl_die(space
->ctx
, isl_error_invalid
,
8117 "number of input and output dimensions needs to be "
8118 "the same", goto error
);
8119 return isl_basic_map_equal(space
, n_in
);
8121 isl_space_free(space
);
8125 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8127 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8130 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8132 isl_space
*dim
= isl_set_get_space(set
);
8134 id
= isl_map_identity(isl_space_map_from_set(dim
));
8135 return isl_map_intersect_range(id
, set
);
8138 /* Construct a basic set with all set dimensions having only non-negative
8141 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8142 __isl_take isl_space
*space
)
8147 struct isl_basic_set
*bset
;
8151 nparam
= isl_space_dim(space
, isl_dim_param
);
8152 dim
= isl_space_dim(space
, isl_dim_set
);
8153 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8156 for (i
= 0; i
< dim
; ++i
) {
8157 int k
= isl_basic_set_alloc_inequality(bset
);
8160 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8161 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8165 isl_basic_set_free(bset
);
8169 /* Construct the half-space x_pos >= 0.
8171 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*space
,
8175 isl_basic_set
*nonneg
;
8177 nonneg
= isl_basic_set_alloc_space(space
, 0, 0, 1);
8178 k
= isl_basic_set_alloc_inequality(nonneg
);
8181 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8182 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8184 return isl_basic_set_finalize(nonneg
);
8186 isl_basic_set_free(nonneg
);
8190 /* Construct the half-space x_pos <= -1.
8192 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*space
,
8198 neg
= isl_basic_set_alloc_space(space
, 0, 0, 1);
8199 k
= isl_basic_set_alloc_inequality(neg
);
8202 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8203 isl_int_set_si(neg
->ineq
[k
][0], -1);
8204 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8206 return isl_basic_set_finalize(neg
);
8208 isl_basic_set_free(neg
);
8212 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8213 enum isl_dim_type type
, unsigned first
, unsigned n
)
8217 isl_basic_set
*nonneg
;
8223 if (isl_set_check_range(set
, type
, first
, n
) < 0)
8224 return isl_set_free(set
);
8226 offset
= pos(set
->dim
, type
);
8227 for (i
= 0; i
< n
; ++i
) {
8228 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8229 offset
+ first
+ i
);
8230 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8232 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8238 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8240 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8246 return isl_stat_error
;
8247 if (isl_set_plain_is_empty(set
)) {
8252 return fn(set
, signs
, user
);
8255 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8257 half
= isl_set_intersect(half
, isl_set_copy(set
));
8258 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8262 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8264 half
= isl_set_intersect(half
, set
);
8265 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8268 return isl_stat_error
;
8271 /* Call "fn" on the intersections of "set" with each of the orthants
8272 * (except for obviously empty intersections). The orthant is identified
8273 * by the signs array, with each entry having value 1 or -1 according
8274 * to the sign of the corresponding variable.
8276 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8277 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8286 return isl_stat_error
;
8287 if (isl_set_plain_is_empty(set
))
8290 nparam
= isl_set_dim(set
, isl_dim_param
);
8291 nvar
= isl_set_dim(set
, isl_dim_set
);
8293 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8295 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8303 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8305 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8308 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8309 __isl_keep isl_basic_map
*bmap2
)
8312 struct isl_map
*map1
;
8313 struct isl_map
*map2
;
8315 if (!bmap1
|| !bmap2
)
8316 return isl_bool_error
;
8318 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8319 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8321 is_subset
= isl_map_is_subset(map1
, map2
);
8329 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8330 __isl_keep isl_basic_set
*bset2
)
8332 return isl_basic_map_is_subset(bset1
, bset2
);
8335 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8336 __isl_keep isl_basic_map
*bmap2
)
8340 if (!bmap1
|| !bmap2
)
8341 return isl_bool_error
;
8342 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8343 if (is_subset
!= isl_bool_true
)
8345 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8349 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8350 __isl_keep isl_basic_set
*bset2
)
8352 return isl_basic_map_is_equal(
8353 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8356 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8362 return isl_bool_error
;
8363 for (i
= 0; i
< map
->n
; ++i
) {
8364 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8366 return isl_bool_error
;
8368 return isl_bool_false
;
8370 return isl_bool_true
;
8373 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8375 return map
? map
->n
== 0 : isl_bool_error
;
8378 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8380 return set
? set
->n
== 0 : isl_bool_error
;
8383 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8385 return isl_map_is_empty(set_to_map(set
));
8388 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8389 __isl_keep isl_map
*map2
)
8392 return isl_bool_error
;
8394 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8397 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8398 __isl_keep isl_set
*set2
)
8401 return isl_bool_error
;
8403 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8406 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8411 return isl_bool_error
;
8412 is_subset
= isl_map_is_subset(map1
, map2
);
8413 if (is_subset
!= isl_bool_true
)
8415 is_subset
= isl_map_is_subset(map2
, map1
);
8419 /* Is "map1" equal to "map2"?
8421 * First check if they are obviously equal.
8422 * If not, then perform a more detailed analysis.
8424 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8428 equal
= isl_map_plain_is_equal(map1
, map2
);
8429 if (equal
< 0 || equal
)
8431 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8434 isl_bool
isl_basic_map_is_strict_subset(
8435 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8439 if (!bmap1
|| !bmap2
)
8440 return isl_bool_error
;
8441 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8442 if (is_subset
!= isl_bool_true
)
8444 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8445 return isl_bool_not(is_subset
);
8448 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8449 __isl_keep isl_map
*map2
)
8454 return isl_bool_error
;
8455 is_subset
= isl_map_is_subset(map1
, map2
);
8456 if (is_subset
!= isl_bool_true
)
8458 is_subset
= isl_map_is_subset(map2
, map1
);
8459 return isl_bool_not(is_subset
);
8462 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8463 __isl_keep isl_set
*set2
)
8465 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8468 /* Is "bmap" obviously equal to the universe with the same space?
8470 * That is, does it not have any constraints?
8472 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8475 return isl_bool_error
;
8476 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8479 /* Is "bset" obviously equal to the universe with the same space?
8481 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8483 return isl_basic_map_plain_is_universe(bset
);
8486 /* If "c" does not involve any existentially quantified variables,
8487 * then set *univ to false and abort
8489 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8491 isl_bool
*univ
= user
;
8494 n
= isl_constraint_dim(c
, isl_dim_div
);
8495 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8496 isl_constraint_free(c
);
8497 if (*univ
< 0 || !*univ
)
8498 return isl_stat_error
;
8502 /* Is "bmap" equal to the universe with the same space?
8504 * First check if it is obviously equal to the universe.
8505 * If not and if there are any constraints not involving
8506 * existentially quantified variables, then it is certainly
8507 * not equal to the universe.
8508 * Otherwise, check if the universe is a subset of "bmap".
8510 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8513 isl_basic_map
*test
;
8515 univ
= isl_basic_map_plain_is_universe(bmap
);
8516 if (univ
< 0 || univ
)
8518 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8519 return isl_bool_false
;
8520 univ
= isl_bool_true
;
8521 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8523 return isl_bool_error
;
8524 if (univ
< 0 || !univ
)
8526 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8527 univ
= isl_basic_map_is_subset(test
, bmap
);
8528 isl_basic_map_free(test
);
8532 /* Is "bset" equal to the universe with the same space?
8534 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8536 return isl_basic_map_is_universe(bset
);
8539 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8544 return isl_bool_error
;
8546 for (i
= 0; i
< map
->n
; ++i
) {
8547 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8552 return isl_bool_false
;
8555 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8557 return isl_map_plain_is_universe(set_to_map(set
));
8560 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8562 struct isl_basic_set
*bset
= NULL
;
8563 struct isl_vec
*sample
= NULL
;
8564 isl_bool empty
, non_empty
;
8567 return isl_bool_error
;
8569 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8570 return isl_bool_true
;
8572 if (isl_basic_map_plain_is_universe(bmap
))
8573 return isl_bool_false
;
8575 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8576 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8577 copy
= isl_basic_map_remove_redundancies(copy
);
8578 empty
= isl_basic_map_plain_is_empty(copy
);
8579 isl_basic_map_free(copy
);
8583 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8585 return isl_bool_error
;
8587 return isl_bool_false
;
8588 isl_vec_free(bmap
->sample
);
8589 bmap
->sample
= NULL
;
8590 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8592 return isl_bool_error
;
8593 sample
= isl_basic_set_sample_vec(bset
);
8595 return isl_bool_error
;
8596 empty
= sample
->size
== 0;
8597 isl_vec_free(bmap
->sample
);
8598 bmap
->sample
= sample
;
8600 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8605 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8608 return isl_bool_error
;
8609 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8612 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8615 return isl_bool_error
;
8616 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8619 /* Is "bmap" known to be non-empty?
8621 * That is, is the cached sample still valid?
8623 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8628 return isl_bool_error
;
8630 return isl_bool_false
;
8631 total
= 1 + isl_basic_map_total_dim(bmap
);
8632 if (bmap
->sample
->size
!= total
)
8633 return isl_bool_false
;
8634 return isl_basic_map_contains(bmap
, bmap
->sample
);
8637 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8639 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8642 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8643 __isl_take isl_basic_map
*bmap2
)
8645 struct isl_map
*map
;
8646 if (!bmap1
|| !bmap2
)
8649 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8651 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8654 map
= isl_map_add_basic_map(map
, bmap1
);
8655 map
= isl_map_add_basic_map(map
, bmap2
);
8658 isl_basic_map_free(bmap1
);
8659 isl_basic_map_free(bmap2
);
8663 struct isl_set
*isl_basic_set_union(
8664 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8666 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8667 bset_to_bmap(bset2
)));
8670 /* Order divs such that any div only depends on previous divs */
8671 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8672 __isl_take isl_basic_map
*bmap
)
8677 off
= isl_basic_map_var_offset(bmap
, isl_dim_div
);
8679 return isl_basic_map_free(bmap
);
8681 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8683 if (isl_int_is_zero(bmap
->div
[i
][0]))
8685 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8690 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8691 "integer division depends on itself",
8692 return isl_basic_map_free(bmap
));
8693 bmap
= isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8701 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8703 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8706 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8713 for (i
= 0; i
< map
->n
; ++i
) {
8714 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8725 /* Sort the local variables of "bset".
8727 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8728 __isl_take isl_basic_set
*bset
)
8730 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8733 /* Apply the expansion computed by isl_merge_divs.
8734 * The expansion itself is given by "exp" while the resulting
8735 * list of divs is given by "div".
8737 * Move the integer divisions of "bmap" into the right position
8738 * according to "exp" and then introduce the additional integer
8739 * divisions, adding div constraints.
8740 * The moving should be done first to avoid moving coefficients
8741 * in the definitions of the extra integer divisions.
8743 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8744 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8749 bmap
= isl_basic_map_cow(bmap
);
8753 if (div
->n_row
< bmap
->n_div
)
8754 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8755 "not an expansion", goto error
);
8757 n_div
= bmap
->n_div
;
8758 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8759 div
->n_row
- n_div
, 0,
8760 2 * (div
->n_row
- n_div
));
8762 for (i
= n_div
; i
< div
->n_row
; ++i
)
8763 if (isl_basic_map_alloc_div(bmap
) < 0)
8766 for (j
= n_div
- 1; j
>= 0; --j
) {
8769 bmap
= isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8774 for (i
= 0; i
< div
->n_row
; ++i
) {
8775 if (j
< n_div
&& exp
[j
] == i
) {
8778 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8779 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8781 bmap
= isl_basic_map_add_div_constraints(bmap
, i
);
8790 isl_basic_map_free(bmap
);
8795 /* Apply the expansion computed by isl_merge_divs.
8796 * The expansion itself is given by "exp" while the resulting
8797 * list of divs is given by "div".
8799 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8800 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8802 return isl_basic_map_expand_divs(bset
, div
, exp
);
8805 /* Look for a div in dst that corresponds to the div "div" in src.
8806 * The divs before "div" in src and dst are assumed to be the same.
8808 * Return the position of the corresponding div in dst
8809 * if there is one. Otherwise, return a position beyond the integer divisions.
8810 * Return -1 on error.
8812 static int find_div(__isl_keep isl_basic_map
*dst
,
8813 __isl_keep isl_basic_map
*src
, unsigned div
)
8819 v_div
= isl_basic_map_var_offset(src
, isl_dim_div
);
8820 if (!dst
|| v_div
< 0)
8823 n_div
= isl_basic_map_dim(dst
, isl_dim_div
);
8824 isl_assert(dst
->ctx
, div
<= n_div
, return -1);
8825 for (i
= div
; i
< n_div
; ++i
)
8826 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+v_div
+div
) &&
8827 isl_seq_first_non_zero(dst
->div
[i
] + 1 + 1 + v_div
+ div
,
8833 /* Align the divs of "dst" to those of "src", adding divs from "src"
8834 * if needed. That is, make sure that the first src->n_div divs
8835 * of the result are equal to those of src.
8837 * The result is not finalized as by design it will have redundant
8838 * divs if any divs from "src" were copied.
8840 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8841 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8850 return isl_basic_map_free(dst
);
8852 if (src
->n_div
== 0)
8855 known
= isl_basic_map_divs_known(src
);
8857 return isl_basic_map_free(dst
);
8859 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8860 "some src divs are unknown",
8861 return isl_basic_map_free(dst
));
8863 v_div
= isl_basic_map_var_offset(src
, isl_dim_div
);
8865 return isl_basic_map_free(dst
);
8867 src
= isl_basic_map_order_divs(isl_basic_map_copy(src
));
8869 return isl_basic_map_free(dst
);
8872 dst_n_div
= isl_basic_map_dim(dst
, isl_dim_div
);
8873 for (i
= 0; i
< src
->n_div
; ++i
) {
8874 int j
= find_div(dst
, src
, i
);
8876 dst
= isl_basic_map_free(dst
);
8877 if (j
== dst_n_div
) {
8879 int extra
= src
->n_div
- i
;
8880 dst
= isl_basic_map_cow(dst
);
8883 dst
= isl_basic_map_extend_space(dst
,
8884 isl_space_copy(dst
->dim
),
8885 extra
, 0, 2 * extra
);
8888 j
= isl_basic_map_alloc_div(dst
);
8891 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+v_div
+i
);
8892 isl_seq_clr(dst
->div
[j
]+1+1+v_div
+i
, dst
->n_div
- i
);
8894 dst
= isl_basic_map_add_div_constraints(dst
, j
);
8899 dst
= isl_basic_map_swap_div(dst
, i
, j
);
8903 isl_basic_map_free(src
);
8906 isl_basic_map_free(src
);
8907 isl_basic_map_free(dst
);
8911 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
8919 map
= isl_map_compute_divs(map
);
8920 map
= isl_map_cow(map
);
8924 for (i
= 1; i
< map
->n
; ++i
)
8925 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8926 for (i
= 1; i
< map
->n
; ++i
) {
8927 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8929 return isl_map_free(map
);
8932 map
= isl_map_unmark_normalized(map
);
8936 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
8938 return isl_map_align_divs_internal(map
);
8941 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8943 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
8946 /* Align the divs of the basic maps in "map" to those
8947 * of the basic maps in "list", as well as to the other basic maps in "map".
8948 * The elements in "list" are assumed to have known divs.
8950 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8951 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8955 map
= isl_map_compute_divs(map
);
8956 map
= isl_map_cow(map
);
8958 return isl_map_free(map
);
8962 n
= isl_basic_map_list_n_basic_map(list
);
8963 for (i
= 0; i
< n
; ++i
) {
8964 isl_basic_map
*bmap
;
8966 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8967 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8968 isl_basic_map_free(bmap
);
8971 return isl_map_free(map
);
8973 return isl_map_align_divs_internal(map
);
8976 /* Align the divs of each element of "list" to those of "bmap".
8977 * Both "bmap" and the elements of "list" are assumed to have known divs.
8979 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
8980 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
8985 return isl_basic_map_list_free(list
);
8987 n
= isl_basic_map_list_n_basic_map(list
);
8988 for (i
= 0; i
< n
; ++i
) {
8989 isl_basic_map
*bmap_i
;
8991 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
8992 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
8993 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
8999 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
9000 __isl_take isl_map
*map
)
9004 ok
= isl_map_compatible_domain(map
, set
);
9008 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9009 "incompatible spaces", goto error
);
9010 map
= isl_map_intersect_domain(map
, set
);
9011 set
= isl_map_range(map
);
9019 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9020 __isl_take isl_map
*map
)
9022 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
9025 /* There is no need to cow as removing empty parts doesn't change
9026 * the meaning of the set.
9028 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9035 for (i
= map
->n
- 1; i
>= 0; --i
)
9036 map
= remove_if_empty(map
, i
);
9041 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
9043 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9046 /* Create a binary relation that maps the shared initial "pos" dimensions
9047 * of "bset1" and "bset2" to the remaining dimensions of "bset1" and "bset2".
9049 static __isl_give isl_basic_map
*join_initial(__isl_keep isl_basic_set
*bset1
,
9050 __isl_keep isl_basic_set
*bset2
, int pos
)
9052 isl_basic_map
*bmap1
;
9053 isl_basic_map
*bmap2
;
9055 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9056 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9057 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9058 isl_dim_out
, 0, pos
);
9059 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9060 isl_dim_out
, 0, pos
);
9061 return isl_basic_map_range_product(bmap1
, bmap2
);
9064 /* Given two basic sets bset1 and bset2, compute the maximal difference
9065 * between the values of dimension pos in bset1 and those in bset2
9066 * for any common value of the parameters and dimensions preceding pos.
9068 static enum isl_lp_result
basic_set_maximal_difference_at(
9069 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9070 int pos
, isl_int
*opt
)
9072 isl_basic_map
*bmap1
;
9073 struct isl_ctx
*ctx
;
9074 struct isl_vec
*obj
;
9078 enum isl_lp_result res
;
9080 if (!bset1
|| !bset2
)
9081 return isl_lp_error
;
9083 nparam
= isl_basic_set_n_param(bset1
);
9084 dim1
= isl_basic_set_n_dim(bset1
);
9086 bmap1
= join_initial(bset1
, bset2
, pos
);
9088 return isl_lp_error
;
9090 total
= isl_basic_map_total_dim(bmap1
);
9092 obj
= isl_vec_alloc(ctx
, 1 + total
);
9095 isl_seq_clr(obj
->block
.data
, 1 + total
);
9096 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9097 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9098 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9100 isl_basic_map_free(bmap1
);
9104 isl_basic_map_free(bmap1
);
9105 return isl_lp_error
;
9108 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9109 * for any common value of the parameters and dimensions preceding pos
9110 * in both basic sets, the values of dimension pos in bset1 are
9111 * smaller or larger than those in bset2.
9114 * 1 if bset1 follows bset2
9115 * -1 if bset1 precedes bset2
9116 * 0 if bset1 and bset2 are incomparable
9117 * -2 if some error occurred.
9119 int isl_basic_set_compare_at(__isl_keep isl_basic_set
*bset1
,
9120 __isl_keep isl_basic_set
*bset2
, int pos
)
9123 enum isl_lp_result res
;
9128 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9130 if (res
== isl_lp_empty
)
9132 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9133 res
== isl_lp_unbounded
)
9135 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9144 /* Given two basic sets bset1 and bset2, check whether
9145 * for any common value of the parameters and dimensions preceding pos
9146 * there is a value of dimension pos in bset1 that is larger
9147 * than a value of the same dimension in bset2.
9150 * 1 if there exists such a pair
9151 * 0 if there is no such pair, but there is a pair of equal values
9153 * -2 if some error occurred.
9155 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9156 __isl_keep isl_basic_set
*bset2
, int pos
)
9159 isl_basic_map
*bmap
;
9162 dim1
= isl_basic_set_dim(bset1
, isl_dim_set
);
9163 bmap
= join_initial(bset1
, bset2
, pos
);
9164 bmap
= isl_basic_map_order_ge(bmap
, isl_dim_out
, 0,
9165 isl_dim_out
, dim1
- pos
);
9166 empty
= isl_basic_map_is_empty(bmap
);
9170 isl_basic_map_free(bmap
);
9173 bmap
= isl_basic_map_order_gt(bmap
, isl_dim_out
, 0,
9174 isl_dim_out
, dim1
- pos
);
9175 empty
= isl_basic_map_is_empty(bmap
);
9178 isl_basic_map_free(bmap
);
9183 isl_basic_map_free(bmap
);
9187 /* Given two sets set1 and set2, check whether
9188 * for any common value of the parameters and dimensions preceding pos
9189 * there is a value of dimension pos in set1 that is larger
9190 * than a value of the same dimension in set2.
9193 * 1 if there exists such a pair
9194 * 0 if there is no such pair, but there is a pair of equal values
9196 * -2 if some error occurred.
9198 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9199 __isl_keep isl_set
*set2
, int pos
)
9207 for (i
= 0; i
< set1
->n
; ++i
)
9208 for (j
= 0; j
< set2
->n
; ++j
) {
9210 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9211 if (f
== 1 || f
== -2)
9220 static isl_bool
isl_basic_map_plain_has_fixed_var(
9221 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9228 return isl_bool_error
;
9229 total
= isl_basic_map_total_dim(bmap
);
9230 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9231 for (; d
+1 > pos
; --d
)
9232 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9236 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9237 return isl_bool_false
;
9238 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9239 return isl_bool_false
;
9240 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9241 return isl_bool_false
;
9243 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9244 return isl_bool_true
;
9246 return isl_bool_false
;
9249 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9250 unsigned pos
, isl_int
*val
)
9258 return isl_bool_error
;
9260 return isl_bool_false
;
9262 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9265 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9266 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9267 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9268 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9269 fixed
= isl_bool_false
;
9272 isl_int_set(*val
, v
);
9278 static isl_bool
isl_basic_set_plain_has_fixed_var(
9279 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9281 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9285 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9286 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9288 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9289 return isl_bool_error
;
9290 return isl_basic_map_plain_has_fixed_var(bmap
,
9291 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9294 /* If "bmap" obviously lies on a hyperplane where the given dimension
9295 * has a fixed value, then return that value.
9296 * Otherwise return NaN.
9298 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9299 __isl_keep isl_basic_map
*bmap
,
9300 enum isl_dim_type type
, unsigned pos
)
9308 ctx
= isl_basic_map_get_ctx(bmap
);
9309 v
= isl_val_alloc(ctx
);
9312 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9314 return isl_val_free(v
);
9316 isl_int_set_si(v
->d
, 1);
9320 return isl_val_nan(ctx
);
9323 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9324 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9326 if (isl_map_check_range(map
, type
, pos
, 1) < 0)
9327 return isl_bool_error
;
9328 return isl_map_plain_has_fixed_var(map
,
9329 map_offset(map
, type
) - 1 + pos
, val
);
9332 /* If "map" obviously lies on a hyperplane where the given dimension
9333 * has a fixed value, then return that value.
9334 * Otherwise return NaN.
9336 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9337 enum isl_dim_type type
, unsigned pos
)
9345 ctx
= isl_map_get_ctx(map
);
9346 v
= isl_val_alloc(ctx
);
9349 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9351 return isl_val_free(v
);
9353 isl_int_set_si(v
->d
, 1);
9357 return isl_val_nan(ctx
);
9360 /* If "set" obviously lies on a hyperplane where the given dimension
9361 * has a fixed value, then return that value.
9362 * Otherwise return NaN.
9364 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9365 enum isl_dim_type type
, unsigned pos
)
9367 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9370 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9371 * then return this fixed value in *val.
9373 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9374 unsigned dim
, isl_int
*val
)
9376 return isl_basic_set_plain_has_fixed_var(bset
,
9377 isl_basic_set_n_param(bset
) + dim
, val
);
9380 /* Return -1 if the constraint "c1" should be sorted before "c2"
9381 * and 1 if it should be sorted after "c2".
9382 * Return 0 if the two constraints are the same (up to the constant term).
9384 * In particular, if a constraint involves later variables than another
9385 * then it is sorted after this other constraint.
9386 * uset_gist depends on constraints without existentially quantified
9387 * variables sorting first.
9389 * For constraints that have the same latest variable, those
9390 * with the same coefficient for this latest variable (first in absolute value
9391 * and then in actual value) are grouped together.
9392 * This is useful for detecting pairs of constraints that can
9393 * be chained in their printed representation.
9395 * Finally, within a group, constraints are sorted according to
9396 * their coefficients (excluding the constant term).
9398 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9400 isl_int
**c1
= (isl_int
**) p1
;
9401 isl_int
**c2
= (isl_int
**) p2
;
9403 unsigned size
= *(unsigned *) arg
;
9406 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9407 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9412 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9415 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9419 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9422 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9423 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9424 * and 0 if the two constraints are the same (up to the constant term).
9426 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9427 isl_int
*c1
, isl_int
*c2
)
9433 total
= isl_basic_map_total_dim(bmap
);
9434 return sort_constraint_cmp(&c1
, &c2
, &total
);
9437 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9438 __isl_take isl_basic_map
*bmap
)
9444 if (bmap
->n_ineq
== 0)
9446 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_SORTED
))
9448 total
= isl_basic_map_total_dim(bmap
);
9449 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9450 &sort_constraint_cmp
, &total
) < 0)
9451 return isl_basic_map_free(bmap
);
9452 ISL_F_SET(bmap
, ISL_BASIC_MAP_SORTED
);
9456 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9457 __isl_take isl_basic_set
*bset
)
9459 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9460 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9463 __isl_give isl_basic_map
*isl_basic_map_normalize(
9464 __isl_take isl_basic_map
*bmap
)
9466 bmap
= isl_basic_map_remove_redundancies(bmap
);
9467 bmap
= isl_basic_map_sort_constraints(bmap
);
9470 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9471 __isl_keep isl_basic_map
*bmap2
)
9475 isl_space
*space1
, *space2
;
9477 if (!bmap1
|| !bmap2
)
9482 space1
= isl_basic_map_peek_space(bmap1
);
9483 space2
= isl_basic_map_peek_space(bmap2
);
9484 cmp
= isl_space_cmp(space1
, space2
);
9487 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9488 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9489 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9490 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9491 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9493 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9495 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9497 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9498 return bmap1
->n_eq
- bmap2
->n_eq
;
9499 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9500 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9501 if (bmap1
->n_div
!= bmap2
->n_div
)
9502 return bmap1
->n_div
- bmap2
->n_div
;
9503 total
= isl_basic_map_total_dim(bmap1
);
9504 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9505 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9509 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9510 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9514 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9515 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9522 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9523 __isl_keep isl_basic_set
*bset2
)
9525 return isl_basic_map_plain_cmp(bset1
, bset2
);
9528 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9534 if (set1
->n
!= set2
->n
)
9535 return set1
->n
- set2
->n
;
9537 for (i
= 0; i
< set1
->n
; ++i
) {
9538 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9546 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9547 __isl_keep isl_basic_map
*bmap2
)
9549 if (!bmap1
|| !bmap2
)
9550 return isl_bool_error
;
9551 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9554 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9555 __isl_keep isl_basic_set
*bset2
)
9557 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9558 bset_to_bmap(bset2
));
9561 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9563 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9564 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9566 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9569 /* Sort the basic maps of "map" and remove duplicate basic maps.
9571 * While removing basic maps, we make sure that the basic maps remain
9572 * sorted because isl_map_normalize expects the basic maps of the result
9575 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9579 map
= isl_map_remove_empty_parts(map
);
9582 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9583 for (i
= map
->n
- 1; i
>= 1; --i
) {
9584 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9586 isl_basic_map_free(map
->p
[i
-1]);
9587 for (j
= i
; j
< map
->n
; ++j
)
9588 map
->p
[j
- 1] = map
->p
[j
];
9595 /* Remove obvious duplicates among the basic maps of "map".
9597 * Unlike isl_map_normalize, this function does not remove redundant
9598 * constraints and only removes duplicates that have exactly the same
9599 * constraints in the input. It does sort the constraints and
9600 * the basic maps to ease the detection of duplicates.
9602 * If "map" has already been normalized or if the basic maps are
9603 * disjoint, then there can be no duplicates.
9605 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9608 isl_basic_map
*bmap
;
9614 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9616 for (i
= 0; i
< map
->n
; ++i
) {
9617 bmap
= isl_basic_map_copy(map
->p
[i
]);
9618 bmap
= isl_basic_map_sort_constraints(bmap
);
9620 return isl_map_free(map
);
9621 isl_basic_map_free(map
->p
[i
]);
9625 map
= sort_and_remove_duplicates(map
);
9629 /* We normalize in place, but if anything goes wrong we need
9630 * to return NULL, so we need to make sure we don't change the
9631 * meaning of any possible other copies of map.
9633 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9636 struct isl_basic_map
*bmap
;
9640 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9642 for (i
= 0; i
< map
->n
; ++i
) {
9643 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9646 isl_basic_map_free(map
->p
[i
]);
9650 map
= sort_and_remove_duplicates(map
);
9652 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9659 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9661 return set_from_map(isl_map_normalize(set_to_map(set
)));
9664 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9665 __isl_keep isl_map
*map2
)
9671 return isl_bool_error
;
9674 return isl_bool_true
;
9675 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9676 return isl_bool_false
;
9678 map1
= isl_map_copy(map1
);
9679 map2
= isl_map_copy(map2
);
9680 map1
= isl_map_normalize(map1
);
9681 map2
= isl_map_normalize(map2
);
9684 equal
= map1
->n
== map2
->n
;
9685 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9686 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9696 return isl_bool_error
;
9699 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9700 __isl_keep isl_set
*set2
)
9702 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9705 /* Return the basic maps in "map" as a list.
9707 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9708 __isl_keep isl_map
*map
)
9712 isl_basic_map_list
*list
;
9716 ctx
= isl_map_get_ctx(map
);
9717 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9719 for (i
= 0; i
< map
->n
; ++i
) {
9720 isl_basic_map
*bmap
;
9722 bmap
= isl_basic_map_copy(map
->p
[i
]);
9723 list
= isl_basic_map_list_add(list
, bmap
);
9729 /* Return the intersection of the elements in the non-empty list "list".
9730 * All elements are assumed to live in the same space.
9732 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9733 __isl_take isl_basic_map_list
*list
)
9736 isl_basic_map
*bmap
;
9740 n
= isl_basic_map_list_n_basic_map(list
);
9742 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9743 "expecting non-empty list", goto error
);
9745 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9746 for (i
= 1; i
< n
; ++i
) {
9747 isl_basic_map
*bmap_i
;
9749 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9750 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9753 isl_basic_map_list_free(list
);
9756 isl_basic_map_list_free(list
);
9760 /* Return the intersection of the elements in the non-empty list "list".
9761 * All elements are assumed to live in the same space.
9763 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9764 __isl_take isl_basic_set_list
*list
)
9766 return isl_basic_map_list_intersect(list
);
9769 /* Return the union of the elements of "list".
9770 * The list is required to have at least one element.
9772 __isl_give isl_set
*isl_basic_set_list_union(
9773 __isl_take isl_basic_set_list
*list
)
9777 isl_basic_set
*bset
;
9782 n
= isl_basic_set_list_n_basic_set(list
);
9784 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9785 "expecting non-empty list", goto error
);
9787 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9788 space
= isl_basic_set_get_space(bset
);
9789 isl_basic_set_free(bset
);
9791 set
= isl_set_alloc_space(space
, n
, 0);
9792 for (i
= 0; i
< n
; ++i
) {
9793 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9794 set
= isl_set_add_basic_set(set
, bset
);
9797 isl_basic_set_list_free(list
);
9800 isl_basic_set_list_free(list
);
9804 /* Return the union of the elements in the non-empty list "list".
9805 * All elements are assumed to live in the same space.
9807 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9814 n
= isl_set_list_n_set(list
);
9816 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9817 "expecting non-empty list", goto error
);
9819 set
= isl_set_list_get_set(list
, 0);
9820 for (i
= 1; i
< n
; ++i
) {
9823 set_i
= isl_set_list_get_set(list
, i
);
9824 set
= isl_set_union(set
, set_i
);
9827 isl_set_list_free(list
);
9830 isl_set_list_free(list
);
9834 __isl_give isl_basic_map
*isl_basic_map_product(
9835 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9837 isl_space
*space_result
= NULL
;
9838 struct isl_basic_map
*bmap
;
9839 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9840 struct isl_dim_map
*dim_map1
, *dim_map2
;
9842 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9844 space_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9845 isl_space_copy(bmap2
->dim
));
9847 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9848 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9849 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9850 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9851 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9853 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9854 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9855 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9856 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9857 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9858 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9859 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9860 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9861 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9862 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9863 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9865 bmap
= isl_basic_map_alloc_space(space_result
,
9866 bmap1
->n_div
+ bmap2
->n_div
,
9867 bmap1
->n_eq
+ bmap2
->n_eq
,
9868 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9869 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9870 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9871 bmap
= isl_basic_map_simplify(bmap
);
9872 return isl_basic_map_finalize(bmap
);
9874 isl_basic_map_free(bmap1
);
9875 isl_basic_map_free(bmap2
);
9879 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9880 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9882 isl_basic_map
*prod
;
9884 prod
= isl_basic_map_product(bmap1
, bmap2
);
9885 prod
= isl_basic_map_flatten(prod
);
9889 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9890 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9892 return isl_basic_map_flat_range_product(bset1
, bset2
);
9895 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9896 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9898 isl_space
*space_result
= NULL
;
9899 isl_basic_map
*bmap
;
9900 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9901 struct isl_dim_map
*dim_map1
, *dim_map2
;
9903 if (!bmap1
|| !bmap2
)
9906 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9907 isl_space_copy(bmap2
->dim
));
9909 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9910 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9911 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9912 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9914 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9915 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9916 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9917 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9918 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9919 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9920 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9921 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9922 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9923 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9924 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9926 bmap
= isl_basic_map_alloc_space(space_result
,
9927 bmap1
->n_div
+ bmap2
->n_div
,
9928 bmap1
->n_eq
+ bmap2
->n_eq
,
9929 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9930 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9931 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9932 bmap
= isl_basic_map_simplify(bmap
);
9933 return isl_basic_map_finalize(bmap
);
9935 isl_basic_map_free(bmap1
);
9936 isl_basic_map_free(bmap2
);
9940 __isl_give isl_basic_map
*isl_basic_map_range_product(
9941 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9944 isl_space
*space_result
= NULL
;
9945 isl_basic_map
*bmap
;
9946 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9947 struct isl_dim_map
*dim_map1
, *dim_map2
;
9949 rational
= isl_basic_map_is_rational(bmap1
);
9950 if (rational
>= 0 && rational
)
9951 rational
= isl_basic_map_is_rational(bmap2
);
9952 if (!bmap1
|| !bmap2
|| rational
< 0)
9955 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9958 space_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9959 isl_space_copy(bmap2
->dim
));
9961 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9962 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9963 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9964 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9966 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9967 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9968 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9969 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9970 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9971 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9972 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9973 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9974 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9975 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9976 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9978 bmap
= isl_basic_map_alloc_space(space_result
,
9979 bmap1
->n_div
+ bmap2
->n_div
,
9980 bmap1
->n_eq
+ bmap2
->n_eq
,
9981 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9982 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9983 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9985 bmap
= isl_basic_map_set_rational(bmap
);
9986 bmap
= isl_basic_map_simplify(bmap
);
9987 return isl_basic_map_finalize(bmap
);
9989 isl_basic_map_free(bmap1
);
9990 isl_basic_map_free(bmap2
);
9994 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9995 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9997 isl_basic_map
*prod
;
9999 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10000 prod
= isl_basic_map_flatten_range(prod
);
10004 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10005 * and collect the results.
10006 * The result live in the space obtained by calling "space_product"
10007 * on the spaces of "map1" and "map2".
10008 * If "remove_duplicates" is set then the result may contain duplicates
10009 * (even if the inputs do not) and so we try and remove the obvious
10012 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10013 __isl_take isl_map
*map2
,
10014 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10015 __isl_take isl_space
*right
),
10016 __isl_give isl_basic_map
*(*basic_map_product
)(
10017 __isl_take isl_basic_map
*left
,
10018 __isl_take isl_basic_map
*right
),
10019 int remove_duplicates
)
10021 unsigned flags
= 0;
10022 struct isl_map
*result
;
10026 m
= isl_map_has_equal_params(map1
, map2
);
10030 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10031 "parameters don't match", goto error
);
10033 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10034 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10035 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10037 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10038 isl_space_copy(map2
->dim
)),
10039 map1
->n
* map2
->n
, flags
);
10042 for (i
= 0; i
< map1
->n
; ++i
)
10043 for (j
= 0; j
< map2
->n
; ++j
) {
10044 struct isl_basic_map
*part
;
10045 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
10046 isl_basic_map_copy(map2
->p
[j
]));
10047 if (isl_basic_map_is_empty(part
))
10048 isl_basic_map_free(part
);
10050 result
= isl_map_add_basic_map(result
, part
);
10054 if (remove_duplicates
)
10055 result
= isl_map_remove_obvious_duplicates(result
);
10056 isl_map_free(map1
);
10057 isl_map_free(map2
);
10060 isl_map_free(map1
);
10061 isl_map_free(map2
);
10065 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
10067 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
10068 __isl_take isl_map
*map2
)
10070 return map_product(map1
, map2
, &isl_space_product
,
10071 &isl_basic_map_product
, 0);
10074 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
10075 __isl_take isl_map
*map2
)
10077 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
10080 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
10082 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
10083 __isl_take isl_map
*map2
)
10087 prod
= isl_map_product(map1
, map2
);
10088 prod
= isl_map_flatten(prod
);
10092 /* Given two set A and B, construct its Cartesian product A x B.
10094 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10096 return isl_map_range_product(set1
, set2
);
10099 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10100 __isl_take isl_set
*set2
)
10102 return isl_map_flat_range_product(set1
, set2
);
10105 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10107 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10108 __isl_take isl_map
*map2
)
10110 return map_product(map1
, map2
, &isl_space_domain_product
,
10111 &isl_basic_map_domain_product
, 1);
10114 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10116 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10117 __isl_take isl_map
*map2
)
10119 return map_product(map1
, map2
, &isl_space_range_product
,
10120 &isl_basic_map_range_product
, 1);
10123 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10124 __isl_take isl_map
*map2
)
10126 return isl_map_align_params_map_map_and(map1
, map2
,
10127 &map_domain_product_aligned
);
10130 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10131 __isl_take isl_map
*map2
)
10133 return isl_map_align_params_map_map_and(map1
, map2
,
10134 &map_range_product_aligned
);
10137 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10139 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10142 int total1
, keep1
, total2
, keep2
;
10146 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10147 !isl_space_range_is_wrapping(map
->dim
))
10148 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10149 "not a product", return isl_map_free(map
));
10151 space
= isl_map_get_space(map
);
10152 total1
= isl_space_dim(space
, isl_dim_in
);
10153 total2
= isl_space_dim(space
, isl_dim_out
);
10154 space
= isl_space_factor_domain(space
);
10155 keep1
= isl_space_dim(space
, isl_dim_in
);
10156 keep2
= isl_space_dim(space
, isl_dim_out
);
10157 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10158 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10159 map
= isl_map_reset_space(map
, space
);
10164 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10166 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10169 int total1
, keep1
, total2
, keep2
;
10173 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10174 !isl_space_range_is_wrapping(map
->dim
))
10175 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10176 "not a product", return isl_map_free(map
));
10178 space
= isl_map_get_space(map
);
10179 total1
= isl_space_dim(space
, isl_dim_in
);
10180 total2
= isl_space_dim(space
, isl_dim_out
);
10181 space
= isl_space_factor_range(space
);
10182 keep1
= isl_space_dim(space
, isl_dim_in
);
10183 keep2
= isl_space_dim(space
, isl_dim_out
);
10184 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10185 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10186 map
= isl_map_reset_space(map
, space
);
10191 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10193 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10200 if (!isl_space_domain_is_wrapping(map
->dim
))
10201 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10202 "domain is not a product", return isl_map_free(map
));
10204 space
= isl_map_get_space(map
);
10205 total
= isl_space_dim(space
, isl_dim_in
);
10206 space
= isl_space_domain_factor_domain(space
);
10207 keep
= isl_space_dim(space
, isl_dim_in
);
10208 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10209 map
= isl_map_reset_space(map
, space
);
10214 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10216 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10223 if (!isl_space_domain_is_wrapping(map
->dim
))
10224 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10225 "domain is not a product", return isl_map_free(map
));
10227 space
= isl_map_get_space(map
);
10228 total
= isl_space_dim(space
, isl_dim_in
);
10229 space
= isl_space_domain_factor_range(space
);
10230 keep
= isl_space_dim(space
, isl_dim_in
);
10231 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10232 map
= isl_map_reset_space(map
, space
);
10237 /* Given a map A -> [B -> C], extract the map A -> B.
10239 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10246 if (!isl_space_range_is_wrapping(map
->dim
))
10247 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10248 "range is not a product", return isl_map_free(map
));
10250 space
= isl_map_get_space(map
);
10251 total
= isl_space_dim(space
, isl_dim_out
);
10252 space
= isl_space_range_factor_domain(space
);
10253 keep
= isl_space_dim(space
, isl_dim_out
);
10254 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10255 map
= isl_map_reset_space(map
, space
);
10260 /* Given a map A -> [B -> C], extract the map A -> C.
10262 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10269 if (!isl_space_range_is_wrapping(map
->dim
))
10270 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10271 "range is not a product", return isl_map_free(map
));
10273 space
= isl_map_get_space(map
);
10274 total
= isl_space_dim(space
, isl_dim_out
);
10275 space
= isl_space_range_factor_range(space
);
10276 keep
= isl_space_dim(space
, isl_dim_out
);
10277 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10278 map
= isl_map_reset_space(map
, space
);
10283 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10285 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10286 __isl_take isl_map
*map2
)
10290 prod
= isl_map_domain_product(map1
, map2
);
10291 prod
= isl_map_flatten_domain(prod
);
10295 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10297 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10298 __isl_take isl_map
*map2
)
10302 prod
= isl_map_range_product(map1
, map2
);
10303 prod
= isl_map_flatten_range(prod
);
10307 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10310 uint32_t hash
= isl_hash_init();
10315 bmap
= isl_basic_map_copy(bmap
);
10316 bmap
= isl_basic_map_normalize(bmap
);
10319 total
= isl_basic_map_total_dim(bmap
);
10320 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10321 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10323 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10324 isl_hash_hash(hash
, c_hash
);
10326 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10327 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10329 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10330 isl_hash_hash(hash
, c_hash
);
10332 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10333 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10335 if (isl_int_is_zero(bmap
->div
[i
][0]))
10337 isl_hash_byte(hash
, i
& 0xFF);
10338 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10339 isl_hash_hash(hash
, c_hash
);
10341 isl_basic_map_free(bmap
);
10345 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10347 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10350 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10357 map
= isl_map_copy(map
);
10358 map
= isl_map_normalize(map
);
10362 hash
= isl_hash_init();
10363 for (i
= 0; i
< map
->n
; ++i
) {
10364 uint32_t bmap_hash
;
10365 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10366 isl_hash_hash(hash
, bmap_hash
);
10374 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10376 return isl_map_get_hash(set_to_map(set
));
10379 /* Return the number of basic maps in the (current) representation of "map".
10381 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10383 return map
? map
->n
: 0;
10386 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10388 return set
? set
->n
: 0;
10391 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10392 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10397 return isl_stat_error
;
10399 for (i
= 0; i
< map
->n
; ++i
)
10400 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10401 return isl_stat_error
;
10403 return isl_stat_ok
;
10406 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10407 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10412 return isl_stat_error
;
10414 for (i
= 0; i
< set
->n
; ++i
)
10415 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10416 return isl_stat_error
;
10418 return isl_stat_ok
;
10421 /* Return a list of basic sets, the union of which is equal to "set".
10423 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10424 __isl_keep isl_set
*set
)
10427 isl_basic_set_list
*list
;
10432 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10433 for (i
= 0; i
< set
->n
; ++i
) {
10434 isl_basic_set
*bset
;
10436 bset
= isl_basic_set_copy(set
->p
[i
]);
10437 list
= isl_basic_set_list_add(list
, bset
);
10443 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10450 bset
= isl_basic_set_cow(bset
);
10454 space
= isl_basic_set_get_space(bset
);
10455 space
= isl_space_lift(space
, bset
->n_div
);
10458 isl_space_free(bset
->dim
);
10460 bset
->extra
-= bset
->n_div
;
10463 bset
= isl_basic_set_finalize(bset
);
10467 isl_basic_set_free(bset
);
10471 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10477 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10482 set
= isl_set_cow(set
);
10486 n_div
= set
->p
[0]->n_div
;
10487 space
= isl_set_get_space(set
);
10488 space
= isl_space_lift(space
, n_div
);
10491 isl_space_free(set
->dim
);
10494 for (i
= 0; i
< set
->n
; ++i
) {
10495 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10506 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10514 dim
= isl_basic_set_total_dim(bset
);
10515 size
+= bset
->n_eq
* (1 + dim
);
10516 size
+= bset
->n_ineq
* (1 + dim
);
10517 size
+= bset
->n_div
* (2 + dim
);
10522 int isl_set_size(__isl_keep isl_set
*set
)
10530 for (i
= 0; i
< set
->n
; ++i
)
10531 size
+= isl_basic_set_size(set
->p
[i
]);
10536 /* Check if there is any lower bound (if lower == 0) and/or upper
10537 * bound (if upper == 0) on the specified dim.
10539 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10540 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10544 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10545 return isl_bool_error
;
10547 pos
+= isl_basic_map_offset(bmap
, type
);
10549 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10550 if (isl_int_is_zero(bmap
->div
[i
][0]))
10552 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10553 return isl_bool_true
;
10556 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10557 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10558 return isl_bool_true
;
10560 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10561 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10568 return lower
&& upper
;
10571 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10572 enum isl_dim_type type
, unsigned pos
)
10574 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10577 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10578 enum isl_dim_type type
, unsigned pos
)
10580 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10583 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10584 enum isl_dim_type type
, unsigned pos
)
10586 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10589 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10590 enum isl_dim_type type
, unsigned pos
)
10595 return isl_bool_error
;
10597 for (i
= 0; i
< map
->n
; ++i
) {
10599 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10600 if (bounded
< 0 || !bounded
)
10604 return isl_bool_true
;
10607 /* Return true if the specified dim is involved in both an upper bound
10608 * and a lower bound.
10610 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10611 enum isl_dim_type type
, unsigned pos
)
10613 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10616 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10618 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10619 enum isl_dim_type type
, unsigned pos
,
10620 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10621 enum isl_dim_type type
, unsigned pos
))
10626 return isl_bool_error
;
10628 for (i
= 0; i
< map
->n
; ++i
) {
10630 bounded
= fn(map
->p
[i
], type
, pos
);
10631 if (bounded
< 0 || bounded
)
10635 return isl_bool_false
;
10638 /* Return 1 if the specified dim is involved in any lower bound.
10640 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10641 enum isl_dim_type type
, unsigned pos
)
10643 return has_any_bound(set
, type
, pos
,
10644 &isl_basic_map_dim_has_lower_bound
);
10647 /* Return 1 if the specified dim is involved in any upper bound.
10649 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10650 enum isl_dim_type type
, unsigned pos
)
10652 return has_any_bound(set
, type
, pos
,
10653 &isl_basic_map_dim_has_upper_bound
);
10656 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10658 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10659 enum isl_dim_type type
, unsigned pos
,
10660 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10661 enum isl_dim_type type
, unsigned pos
))
10666 return isl_bool_error
;
10668 for (i
= 0; i
< map
->n
; ++i
) {
10670 bounded
= fn(map
->p
[i
], type
, pos
);
10671 if (bounded
< 0 || !bounded
)
10675 return isl_bool_true
;
10678 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10680 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10681 enum isl_dim_type type
, unsigned pos
)
10683 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10686 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10688 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10689 enum isl_dim_type type
, unsigned pos
)
10691 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10694 /* For each of the "n" variables starting at "first", determine
10695 * the sign of the variable and put the results in the first "n"
10696 * elements of the array "signs".
10698 * 1 means that the variable is non-negative
10699 * -1 means that the variable is non-positive
10700 * 0 means the variable attains both positive and negative values.
10702 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10703 unsigned first
, unsigned n
, int *signs
)
10705 isl_vec
*bound
= NULL
;
10706 struct isl_tab
*tab
= NULL
;
10707 struct isl_tab_undo
*snap
;
10710 if (!bset
|| !signs
)
10711 return isl_stat_error
;
10713 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10714 tab
= isl_tab_from_basic_set(bset
, 0);
10715 if (!bound
|| !tab
)
10718 isl_seq_clr(bound
->el
, bound
->size
);
10719 isl_int_set_si(bound
->el
[0], -1);
10721 snap
= isl_tab_snap(tab
);
10722 for (i
= 0; i
< n
; ++i
) {
10725 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10726 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10728 empty
= tab
->empty
;
10729 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10730 if (isl_tab_rollback(tab
, snap
) < 0)
10738 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10739 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10741 empty
= tab
->empty
;
10742 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10743 if (isl_tab_rollback(tab
, snap
) < 0)
10746 signs
[i
] = empty
? -1 : 0;
10750 isl_vec_free(bound
);
10751 return isl_stat_ok
;
10754 isl_vec_free(bound
);
10755 return isl_stat_error
;
10758 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10759 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10761 if (!bset
|| !signs
)
10762 return isl_stat_error
;
10763 if (isl_basic_set_check_range(bset
, type
, first
, n
) < 0)
10764 return isl_stat_error
;
10766 first
+= pos(bset
->dim
, type
) - 1;
10767 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10770 /* Is it possible for the integer division "div" to depend (possibly
10771 * indirectly) on any output dimensions?
10773 * If the div is undefined, then we conservatively assume that it
10774 * may depend on them.
10775 * Otherwise, we check if it actually depends on them or on any integer
10776 * divisions that may depend on them.
10778 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10781 unsigned n_out
, o_out
;
10782 unsigned n_div
, o_div
;
10784 if (isl_int_is_zero(bmap
->div
[div
][0]))
10785 return isl_bool_true
;
10787 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10788 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10790 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10791 return isl_bool_true
;
10793 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10794 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10796 for (i
= 0; i
< n_div
; ++i
) {
10797 isl_bool may_involve
;
10799 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10801 may_involve
= div_may_involve_output(bmap
, i
);
10802 if (may_involve
< 0 || may_involve
)
10803 return may_involve
;
10806 return isl_bool_false
;
10809 /* Return the first integer division of "bmap" in the range
10810 * [first, first + n[ that may depend on any output dimensions and
10811 * that has a non-zero coefficient in "c" (where the first coefficient
10812 * in "c" corresponds to integer division "first").
10814 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10815 isl_int
*c
, int first
, int n
)
10822 for (k
= first
; k
< first
+ n
; ++k
) {
10823 isl_bool may_involve
;
10825 if (isl_int_is_zero(c
[k
]))
10827 may_involve
= div_may_involve_output(bmap
, k
);
10828 if (may_involve
< 0)
10837 /* Look for a pair of inequality constraints in "bmap" of the form
10839 * -l + i >= 0 or i >= l
10841 * n + l - i >= 0 or i <= l + n
10843 * with n < "m" and i the output dimension at position "pos".
10844 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10845 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10846 * and earlier output dimensions, as well as integer divisions that do
10847 * not involve any of the output dimensions.
10849 * Return the index of the first inequality constraint or bmap->n_ineq
10850 * if no such pair can be found.
10852 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10853 int pos
, isl_int m
)
10858 unsigned n_div
, o_div
;
10859 unsigned n_out
, o_out
;
10865 ctx
= isl_basic_map_get_ctx(bmap
);
10866 total
= isl_basic_map_total_dim(bmap
);
10867 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10868 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10869 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10870 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10871 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10872 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10874 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10875 n_out
- (pos
+ 1)) != -1)
10877 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10880 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10881 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10884 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10885 bmap
->ineq
[j
] + 1, total
))
10889 if (j
>= bmap
->n_ineq
)
10891 isl_int_add(bmap
->ineq
[i
][0],
10892 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10893 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10894 isl_int_sub(bmap
->ineq
[i
][0],
10895 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10898 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10904 return bmap
->n_ineq
;
10907 /* Return the index of the equality of "bmap" that defines
10908 * the output dimension "pos" in terms of earlier dimensions.
10909 * The equality may also involve integer divisions, as long
10910 * as those integer divisions are defined in terms of
10911 * parameters or input dimensions.
10912 * In this case, *div is set to the number of integer divisions and
10913 * *ineq is set to the number of inequality constraints (provided
10914 * div and ineq are not NULL).
10916 * The equality may also involve a single integer division involving
10917 * the output dimensions (typically only output dimension "pos") as
10918 * long as the coefficient of output dimension "pos" is 1 or -1 and
10919 * there is a pair of constraints i >= l and i <= l + n, with i referring
10920 * to output dimension "pos", l an expression involving only earlier
10921 * dimensions and n smaller than the coefficient of the integer division
10922 * in the equality. In this case, the output dimension can be defined
10923 * in terms of a modulo expression that does not involve the integer division.
10924 * *div is then set to this single integer division and
10925 * *ineq is set to the index of constraint i >= l.
10927 * Return bmap->n_eq if there is no such equality.
10928 * Return -1 on error.
10930 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10931 int pos
, int *div
, int *ineq
)
10934 unsigned n_out
, o_out
;
10935 unsigned n_div
, o_div
;
10940 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10941 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10942 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10943 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10946 *ineq
= bmap
->n_ineq
;
10949 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10950 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10952 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10953 n_out
- (pos
+ 1)) != -1)
10955 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10959 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
10960 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
10962 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10963 k
+ 1, n_div
- (k
+1)) < n_div
)
10965 l
= find_modulo_constraint_pair(bmap
, pos
,
10966 bmap
->eq
[j
][o_div
+ k
]);
10969 if (l
>= bmap
->n_ineq
)
10981 /* Check if the given basic map is obviously single-valued.
10982 * In particular, for each output dimension, check that there is
10983 * an equality that defines the output dimension in terms of
10984 * earlier dimensions.
10986 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10992 return isl_bool_error
;
10994 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10996 for (i
= 0; i
< n_out
; ++i
) {
10999 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11002 return isl_bool_error
;
11003 if (eq
>= bmap
->n_eq
)
11004 return isl_bool_false
;
11007 return isl_bool_true
;
11010 /* Check if the given basic map is single-valued.
11011 * We simply compute
11015 * and check if the result is a subset of the identity mapping.
11017 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11020 isl_basic_map
*test
;
11024 sv
= isl_basic_map_plain_is_single_valued(bmap
);
11028 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
11029 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
11031 space
= isl_basic_map_get_space(bmap
);
11032 space
= isl_space_map_from_set(isl_space_range(space
));
11033 id
= isl_basic_map_identity(space
);
11035 sv
= isl_basic_map_is_subset(test
, id
);
11037 isl_basic_map_free(test
);
11038 isl_basic_map_free(id
);
11043 /* Check if the given map is obviously single-valued.
11045 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
11048 return isl_bool_error
;
11050 return isl_bool_true
;
11052 return isl_bool_false
;
11054 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
11057 /* Check if the given map is single-valued.
11058 * We simply compute
11062 * and check if the result is a subset of the identity mapping.
11064 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
11071 sv
= isl_map_plain_is_single_valued(map
);
11075 test
= isl_map_reverse(isl_map_copy(map
));
11076 test
= isl_map_apply_range(test
, isl_map_copy(map
));
11078 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
11079 id
= isl_map_identity(dim
);
11081 sv
= isl_map_is_subset(test
, id
);
11083 isl_map_free(test
);
11089 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
11093 map
= isl_map_copy(map
);
11094 map
= isl_map_reverse(map
);
11095 in
= isl_map_is_single_valued(map
);
11101 /* Check if the given map is obviously injective.
11103 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11107 map
= isl_map_copy(map
);
11108 map
= isl_map_reverse(map
);
11109 in
= isl_map_plain_is_single_valued(map
);
11115 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11119 sv
= isl_map_is_single_valued(map
);
11123 return isl_map_is_injective(map
);
11126 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11128 return isl_map_is_single_valued(set_to_map(set
));
11131 /* Does "map" only map elements to themselves?
11133 * If the domain and range spaces are different, then "map"
11134 * is considered not to be an identity relation, even if it is empty.
11135 * Otherwise, construct the maximal identity relation and
11136 * check whether "map" is a subset of this relation.
11138 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11142 isl_bool equal
, is_identity
;
11144 space
= isl_map_get_space(map
);
11145 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11146 isl_space_free(space
);
11147 if (equal
< 0 || !equal
)
11150 id
= isl_map_identity(isl_map_get_space(map
));
11151 is_identity
= isl_map_is_subset(map
, id
);
11154 return is_identity
;
11157 int isl_map_is_translation(__isl_keep isl_map
*map
)
11162 delta
= isl_map_deltas(isl_map_copy(map
));
11163 ok
= isl_set_is_singleton(delta
);
11164 isl_set_free(delta
);
11169 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11171 if (isl_seq_first_non_zero(p
, pos
) != -1)
11173 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11178 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11185 return isl_bool_error
;
11187 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11188 return isl_bool_false
;
11190 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11191 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11192 for (j
= 0; j
< nvar
; ++j
) {
11193 int lower
= 0, upper
= 0;
11194 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11195 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11197 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11198 return isl_bool_false
;
11201 if (i
< bset
->n_eq
)
11203 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11204 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11206 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11207 return isl_bool_false
;
11208 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11213 if (!lower
|| !upper
)
11214 return isl_bool_false
;
11217 return isl_bool_true
;
11220 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11223 return isl_bool_error
;
11225 return isl_bool_false
;
11227 return isl_basic_set_is_box(set
->p
[0]);
11230 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11233 return isl_bool_error
;
11235 return isl_space_is_wrapping(bset
->dim
);
11238 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11241 return isl_bool_error
;
11243 return isl_space_is_wrapping(set
->dim
);
11246 /* Modify the space of "map" through a call to "change".
11247 * If "can_change" is set (not NULL), then first call it to check
11248 * if the modification is allowed, printing the error message "cannot_change"
11251 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11252 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11253 const char *cannot_change
,
11254 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11262 ok
= can_change
? can_change(map
) : isl_bool_true
;
11264 return isl_map_free(map
);
11266 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11267 return isl_map_free(map
));
11269 space
= change(isl_map_get_space(map
));
11270 map
= isl_map_reset_space(map
, space
);
11275 /* Is the domain of "map" a wrapped relation?
11277 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11280 return isl_bool_error
;
11282 return isl_space_domain_is_wrapping(map
->dim
);
11285 /* Does "map" have a wrapped relation in both domain and range?
11287 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
11289 return isl_space_is_product(isl_map_peek_space(map
));
11292 /* Is the range of "map" a wrapped relation?
11294 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11297 return isl_bool_error
;
11299 return isl_space_range_is_wrapping(map
->dim
);
11302 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11304 bmap
= isl_basic_map_cow(bmap
);
11308 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11312 bmap
= isl_basic_map_finalize(bmap
);
11314 return bset_from_bmap(bmap
);
11316 isl_basic_map_free(bmap
);
11320 /* Given a map A -> B, return the set (A -> B).
11322 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11324 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11327 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11329 bset
= isl_basic_set_cow(bset
);
11333 bset
->dim
= isl_space_unwrap(bset
->dim
);
11337 bset
= isl_basic_set_finalize(bset
);
11339 return bset_to_bmap(bset
);
11341 isl_basic_set_free(bset
);
11345 /* Given a set (A -> B), return the map A -> B.
11346 * Error out if "set" is not of the form (A -> B).
11348 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11350 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11351 "not a wrapping set", &isl_space_unwrap
);
11354 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11355 enum isl_dim_type type
)
11360 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11363 bmap
= isl_basic_map_cow(bmap
);
11367 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11371 bmap
= isl_basic_map_finalize(bmap
);
11375 isl_basic_map_free(bmap
);
11379 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11380 enum isl_dim_type type
)
11387 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11390 map
= isl_map_cow(map
);
11394 for (i
= 0; i
< map
->n
; ++i
) {
11395 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11399 map
->dim
= isl_space_reset(map
->dim
, type
);
11409 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11414 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11417 bmap
= isl_basic_map_cow(bmap
);
11421 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11425 bmap
= isl_basic_map_finalize(bmap
);
11429 isl_basic_map_free(bmap
);
11433 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11435 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11438 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11439 __isl_take isl_basic_map
*bmap
)
11444 if (!bmap
->dim
->nested
[0])
11447 bmap
= isl_basic_map_cow(bmap
);
11451 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11455 bmap
= isl_basic_map_finalize(bmap
);
11459 isl_basic_map_free(bmap
);
11463 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11464 __isl_take isl_basic_map
*bmap
)
11469 if (!bmap
->dim
->nested
[1])
11472 bmap
= isl_basic_map_cow(bmap
);
11476 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11480 bmap
= isl_basic_map_finalize(bmap
);
11484 isl_basic_map_free(bmap
);
11488 /* Remove any internal structure from the spaces of domain and range of "map".
11490 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11495 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11498 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11501 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11503 return set_from_map(isl_map_flatten(set_to_map(set
)));
11506 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11508 isl_space
*space
, *flat_space
;
11511 space
= isl_set_get_space(set
);
11512 flat_space
= isl_space_flatten(isl_space_copy(space
));
11513 map
= isl_map_identity(isl_space_join(isl_space_reverse(space
),
11515 map
= isl_map_intersect_domain(map
, set
);
11520 /* Remove any internal structure from the space of the domain of "map".
11522 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11527 if (!map
->dim
->nested
[0])
11530 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11533 /* Remove any internal structure from the space of the range of "map".
11535 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11540 if (!map
->dim
->nested
[1])
11543 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11546 /* Reorder the dimensions of "bmap" according to the given dim_map
11547 * and set the dimension specification to "space" and
11548 * perform Gaussian elimination on the result.
11550 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11551 __isl_take isl_space
*space
, __isl_take
struct isl_dim_map
*dim_map
)
11553 isl_basic_map
*res
;
11557 if (!bmap
|| !space
|| !dim_map
)
11560 flags
= bmap
->flags
;
11561 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11562 ISL_FL_CLR(flags
, ISL_BASIC_MAP_SORTED
);
11563 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11564 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11565 res
= isl_basic_map_alloc_space(space
, n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11566 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11568 res
->flags
= flags
;
11569 res
= isl_basic_map_gauss(res
, NULL
);
11570 res
= isl_basic_map_finalize(res
);
11573 isl_dim_map_free(dim_map
);
11574 isl_basic_map_free(bmap
);
11575 isl_space_free(space
);
11579 /* Reorder the dimensions of "map" according to given reordering.
11581 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11582 __isl_take isl_reordering
*r
)
11585 struct isl_dim_map
*dim_map
;
11587 map
= isl_map_cow(map
);
11588 dim_map
= isl_dim_map_from_reordering(r
);
11589 if (!map
|| !r
|| !dim_map
)
11592 for (i
= 0; i
< map
->n
; ++i
) {
11593 struct isl_dim_map
*dim_map_i
;
11596 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11598 space
= isl_reordering_get_space(r
);
11599 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
], space
, dim_map_i
);
11605 map
= isl_map_reset_space(map
, isl_reordering_get_space(r
));
11606 map
= isl_map_unmark_normalized(map
);
11608 isl_reordering_free(r
);
11609 isl_dim_map_free(dim_map
);
11612 isl_dim_map_free(dim_map
);
11614 isl_reordering_free(r
);
11618 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11619 __isl_take isl_reordering
*r
)
11621 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11624 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11625 __isl_take isl_space
*model
)
11630 if (!map
|| !model
)
11633 ctx
= isl_space_get_ctx(model
);
11634 if (!isl_space_has_named_params(model
))
11635 isl_die(ctx
, isl_error_invalid
,
11636 "model has unnamed parameters", goto error
);
11637 if (isl_map_check_named_params(map
) < 0)
11639 aligned
= isl_map_space_has_equal_params(map
, model
);
11643 isl_reordering
*exp
;
11645 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11646 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11647 map
= isl_map_realign(map
, exp
);
11650 isl_space_free(model
);
11653 isl_space_free(model
);
11658 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11659 __isl_take isl_space
*model
)
11661 return isl_map_align_params(set
, model
);
11664 /* Align the parameters of "bmap" to those of "model", introducing
11665 * additional parameters if needed.
11667 __isl_give isl_basic_map
*isl_basic_map_align_params(
11668 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11671 isl_bool equal_params
;
11673 if (!bmap
|| !model
)
11676 ctx
= isl_space_get_ctx(model
);
11677 if (!isl_space_has_named_params(model
))
11678 isl_die(ctx
, isl_error_invalid
,
11679 "model has unnamed parameters", goto error
);
11680 if (isl_basic_map_check_named_params(bmap
) < 0)
11682 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11683 if (equal_params
< 0)
11685 if (!equal_params
) {
11686 isl_reordering
*exp
;
11687 struct isl_dim_map
*dim_map
;
11689 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11690 exp
= isl_reordering_extend_space(exp
,
11691 isl_basic_map_get_space(bmap
));
11692 dim_map
= isl_dim_map_from_reordering(exp
);
11693 bmap
= isl_basic_map_realign(bmap
,
11694 isl_reordering_get_space(exp
),
11695 isl_dim_map_extend(dim_map
, bmap
));
11696 isl_reordering_free(exp
);
11697 isl_dim_map_free(dim_map
);
11700 isl_space_free(model
);
11703 isl_space_free(model
);
11704 isl_basic_map_free(bmap
);
11708 /* Do "bset" and "space" have the same parameters?
11710 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11711 __isl_keep isl_space
*space
)
11713 isl_space
*bset_space
;
11715 bset_space
= isl_basic_set_peek_space(bset
);
11716 return isl_space_has_equal_params(bset_space
, space
);
11719 /* Do "map" and "space" have the same parameters?
11721 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11722 __isl_keep isl_space
*space
)
11724 isl_space
*map_space
;
11726 map_space
= isl_map_peek_space(map
);
11727 return isl_space_has_equal_params(map_space
, space
);
11730 /* Do "set" and "space" have the same parameters?
11732 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11733 __isl_keep isl_space
*space
)
11735 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11738 /* Align the parameters of "bset" to those of "model", introducing
11739 * additional parameters if needed.
11741 __isl_give isl_basic_set
*isl_basic_set_align_params(
11742 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11744 return isl_basic_map_align_params(bset
, model
);
11747 /* Drop all parameters not referenced by "map".
11749 __isl_give isl_map
*isl_map_drop_unused_params(__isl_take isl_map
*map
)
11753 if (isl_map_check_named_params(map
) < 0)
11754 return isl_map_free(map
);
11756 for (i
= isl_map_dim(map
, isl_dim_param
) - 1; i
>= 0; i
--) {
11759 involves
= isl_map_involves_dims(map
, isl_dim_param
, i
, 1);
11761 return isl_map_free(map
);
11763 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
11769 /* Drop all parameters not referenced by "set".
11771 __isl_give isl_set
*isl_set_drop_unused_params(
11772 __isl_take isl_set
*set
)
11774 return set_from_map(isl_map_drop_unused_params(set_to_map(set
)));
11777 /* Drop all parameters not referenced by "bmap".
11779 __isl_give isl_basic_map
*isl_basic_map_drop_unused_params(
11780 __isl_take isl_basic_map
*bmap
)
11784 if (isl_basic_map_check_named_params(bmap
) < 0)
11785 return isl_basic_map_free(bmap
);
11787 for (i
= isl_basic_map_dim(bmap
, isl_dim_param
) - 1; i
>= 0; i
--) {
11790 involves
= isl_basic_map_involves_dims(bmap
,
11791 isl_dim_param
, i
, 1);
11793 return isl_basic_map_free(bmap
);
11795 bmap
= isl_basic_map_drop(bmap
, isl_dim_param
, i
, 1);
11801 /* Drop all parameters not referenced by "bset".
11803 __isl_give isl_basic_set
*isl_basic_set_drop_unused_params(
11804 __isl_take isl_basic_set
*bset
)
11806 return bset_from_bmap(isl_basic_map_drop_unused_params(
11807 bset_to_bmap(bset
)));
11810 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11811 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11812 enum isl_dim_type c2
, enum isl_dim_type c3
,
11813 enum isl_dim_type c4
, enum isl_dim_type c5
)
11815 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11816 struct isl_mat
*mat
;
11822 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11823 isl_basic_map_total_dim(bmap
) + 1);
11826 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11827 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11828 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11829 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11830 isl_int_set(mat
->row
[i
][pos
],
11831 bmap
->eq
[i
][off
+ k
]);
11839 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11840 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11841 enum isl_dim_type c2
, enum isl_dim_type c3
,
11842 enum isl_dim_type c4
, enum isl_dim_type c5
)
11844 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11845 struct isl_mat
*mat
;
11851 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11852 isl_basic_map_total_dim(bmap
) + 1);
11855 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11856 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11857 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11858 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11859 isl_int_set(mat
->row
[i
][pos
],
11860 bmap
->ineq
[i
][off
+ k
]);
11868 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11869 __isl_take isl_space
*space
,
11870 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11871 enum isl_dim_type c2
, enum isl_dim_type c3
,
11872 enum isl_dim_type c4
, enum isl_dim_type c5
)
11874 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11875 isl_basic_map
*bmap
= NULL
;
11881 if (!space
|| !eq
|| !ineq
)
11884 if (eq
->n_col
!= ineq
->n_col
)
11885 isl_die(space
->ctx
, isl_error_invalid
,
11886 "equalities and inequalities matrices should have "
11887 "same number of columns", goto error
);
11889 total
= 1 + isl_space_dim(space
, isl_dim_all
);
11891 if (eq
->n_col
< total
)
11892 isl_die(space
->ctx
, isl_error_invalid
,
11893 "number of columns too small", goto error
);
11895 extra
= eq
->n_col
- total
;
11897 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), extra
,
11898 eq
->n_row
, ineq
->n_row
);
11901 for (i
= 0; i
< extra
; ++i
) {
11902 k
= isl_basic_map_alloc_div(bmap
);
11905 isl_int_set_si(bmap
->div
[k
][0], 0);
11907 for (i
= 0; i
< eq
->n_row
; ++i
) {
11908 l
= isl_basic_map_alloc_equality(bmap
);
11911 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11912 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11913 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11914 isl_int_set(bmap
->eq
[l
][off
+ k
],
11920 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11921 l
= isl_basic_map_alloc_inequality(bmap
);
11924 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11925 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11926 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11927 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11928 ineq
->row
[i
][pos
]);
11934 isl_space_free(space
);
11936 isl_mat_free(ineq
);
11938 bmap
= isl_basic_map_simplify(bmap
);
11939 return isl_basic_map_finalize(bmap
);
11941 isl_space_free(space
);
11943 isl_mat_free(ineq
);
11944 isl_basic_map_free(bmap
);
11948 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11949 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11950 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11952 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11953 c1
, c2
, c3
, c4
, isl_dim_in
);
11956 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11957 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11958 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11960 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11961 c1
, c2
, c3
, c4
, isl_dim_in
);
11964 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11965 __isl_take isl_space
*dim
,
11966 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11967 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11969 isl_basic_map
*bmap
;
11970 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11971 c1
, c2
, c3
, c4
, isl_dim_in
);
11972 return bset_from_bmap(bmap
);
11975 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11978 return isl_bool_error
;
11980 return isl_space_can_zip(bmap
->dim
);
11983 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11986 return isl_bool_error
;
11988 return isl_space_can_zip(map
->dim
);
11991 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11992 * (A -> C) -> (B -> D).
11994 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
12003 if (!isl_basic_map_can_zip(bmap
))
12004 isl_die(bmap
->ctx
, isl_error_invalid
,
12005 "basic map cannot be zipped", goto error
);
12006 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
12007 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
12008 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
12009 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
12010 bmap
= isl_basic_map_cow(bmap
);
12011 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
12014 bmap
->dim
= isl_space_zip(bmap
->dim
);
12017 bmap
= isl_basic_map_mark_final(bmap
);
12020 isl_basic_map_free(bmap
);
12024 /* Given a map (A -> B) -> (C -> D), return the corresponding map
12025 * (A -> C) -> (B -> D).
12027 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
12034 if (!isl_map_can_zip(map
))
12035 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
12038 map
= isl_map_cow(map
);
12042 for (i
= 0; i
< map
->n
; ++i
) {
12043 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
12048 map
->dim
= isl_space_zip(map
->dim
);
12058 /* Can we apply isl_basic_map_curry to "bmap"?
12059 * That is, does it have a nested relation in its domain?
12061 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
12064 return isl_bool_error
;
12066 return isl_space_can_curry(bmap
->dim
);
12069 /* Can we apply isl_map_curry to "map"?
12070 * That is, does it have a nested relation in its domain?
12072 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
12075 return isl_bool_error
;
12077 return isl_space_can_curry(map
->dim
);
12080 /* Given a basic map (A -> B) -> C, return the corresponding basic map
12083 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
12089 if (!isl_basic_map_can_curry(bmap
))
12090 isl_die(bmap
->ctx
, isl_error_invalid
,
12091 "basic map cannot be curried", goto error
);
12092 bmap
= isl_basic_map_cow(bmap
);
12095 bmap
->dim
= isl_space_curry(bmap
->dim
);
12098 bmap
= isl_basic_map_mark_final(bmap
);
12101 isl_basic_map_free(bmap
);
12105 /* Given a map (A -> B) -> C, return the corresponding map
12108 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
12110 return isl_map_change_space(map
, &isl_map_can_curry
,
12111 "map cannot be curried", &isl_space_curry
);
12114 /* Can isl_map_range_curry be applied to "map"?
12115 * That is, does it have a nested relation in its range,
12116 * the domain of which is itself a nested relation?
12118 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
12121 return isl_bool_error
;
12123 return isl_space_can_range_curry(map
->dim
);
12126 /* Given a map A -> ((B -> C) -> D), return the corresponding map
12127 * A -> (B -> (C -> D)).
12129 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
12131 return isl_map_change_space(map
, &isl_map_can_range_curry
,
12132 "map range cannot be curried",
12133 &isl_space_range_curry
);
12136 /* Can we apply isl_basic_map_uncurry to "bmap"?
12137 * That is, does it have a nested relation in its domain?
12139 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
12142 return isl_bool_error
;
12144 return isl_space_can_uncurry(bmap
->dim
);
12147 /* Can we apply isl_map_uncurry to "map"?
12148 * That is, does it have a nested relation in its domain?
12150 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
12153 return isl_bool_error
;
12155 return isl_space_can_uncurry(map
->dim
);
12158 /* Given a basic map A -> (B -> C), return the corresponding basic map
12161 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12167 if (!isl_basic_map_can_uncurry(bmap
))
12168 isl_die(bmap
->ctx
, isl_error_invalid
,
12169 "basic map cannot be uncurried",
12170 return isl_basic_map_free(bmap
));
12171 bmap
= isl_basic_map_cow(bmap
);
12174 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12176 return isl_basic_map_free(bmap
);
12177 bmap
= isl_basic_map_mark_final(bmap
);
12181 /* Given a map A -> (B -> C), return the corresponding map
12184 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12186 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12187 "map cannot be uncurried", &isl_space_uncurry
);
12190 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12191 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12193 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12196 /* Construct a basic map where the given dimensions are equal to each other.
12198 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12199 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12201 isl_basic_map
*bmap
= NULL
;
12204 if (isl_space_check_range(space
, type1
, pos1
, 1) < 0 ||
12205 isl_space_check_range(space
, type2
, pos2
, 1) < 0)
12208 if (type1
== type2
&& pos1
== pos2
)
12209 return isl_basic_map_universe(space
);
12211 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12212 i
= isl_basic_map_alloc_equality(bmap
);
12215 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12216 pos1
+= isl_basic_map_offset(bmap
, type1
);
12217 pos2
+= isl_basic_map_offset(bmap
, type2
);
12218 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12219 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12220 bmap
= isl_basic_map_finalize(bmap
);
12221 isl_space_free(space
);
12224 isl_space_free(space
);
12225 isl_basic_map_free(bmap
);
12229 /* Add a constraint imposing that the given two dimensions are equal.
12231 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12232 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12236 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12238 bmap
= isl_basic_map_intersect(bmap
, eq
);
12243 /* Add a constraint imposing that the given two dimensions are equal.
12245 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12246 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12248 isl_basic_map
*bmap
;
12250 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12252 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12257 /* Add a constraint imposing that the given two dimensions have opposite values.
12259 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12260 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12262 isl_basic_map
*bmap
= NULL
;
12265 if (isl_map_check_range(map
, type1
, pos1
, 1) < 0)
12266 return isl_map_free(map
);
12267 if (isl_map_check_range(map
, type2
, pos2
, 1) < 0)
12268 return isl_map_free(map
);
12270 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12271 i
= isl_basic_map_alloc_equality(bmap
);
12274 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12275 pos1
+= isl_basic_map_offset(bmap
, type1
);
12276 pos2
+= isl_basic_map_offset(bmap
, type2
);
12277 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12278 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12279 bmap
= isl_basic_map_finalize(bmap
);
12281 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12285 isl_basic_map_free(bmap
);
12290 /* Construct a constraint imposing that the value of the first dimension is
12291 * greater than or equal to that of the second.
12293 static __isl_give isl_constraint
*constraint_order_ge(
12294 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12295 enum isl_dim_type type2
, int pos2
)
12299 if (isl_space_check_range(space
, type1
, pos1
, 1) < 0 ||
12300 isl_space_check_range(space
, type2
, pos2
, 1) < 0)
12301 space
= isl_space_free(space
);
12305 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12307 if (type1
== type2
&& pos1
== pos2
)
12310 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12311 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12316 /* Add a constraint imposing that the value of the first dimension is
12317 * greater than or equal to that of the second.
12319 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12320 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12325 if (type1
== type2
&& pos1
== pos2
)
12327 space
= isl_basic_map_get_space(bmap
);
12328 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12329 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12334 /* Add a constraint imposing that the value of the first dimension is
12335 * greater than or equal to that of the second.
12337 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12338 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12343 if (type1
== type2
&& pos1
== pos2
)
12345 space
= isl_map_get_space(map
);
12346 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12347 map
= isl_map_add_constraint(map
, c
);
12352 /* Add a constraint imposing that the value of the first dimension is
12353 * less than or equal to that of the second.
12355 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12356 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12358 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12361 /* Construct a basic map where the value of the first dimension is
12362 * greater than that of the second.
12364 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12365 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12367 isl_basic_map
*bmap
= NULL
;
12370 if (isl_space_check_range(space
, type1
, pos1
, 1) < 0 ||
12371 isl_space_check_range(space
, type2
, pos2
, 1) < 0)
12374 if (type1
== type2
&& pos1
== pos2
)
12375 return isl_basic_map_empty(space
);
12377 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12378 i
= isl_basic_map_alloc_inequality(bmap
);
12380 return isl_basic_map_free(bmap
);
12381 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12382 pos1
+= isl_basic_map_offset(bmap
, type1
);
12383 pos2
+= isl_basic_map_offset(bmap
, type2
);
12384 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12385 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12386 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12387 bmap
= isl_basic_map_finalize(bmap
);
12391 isl_space_free(space
);
12392 isl_basic_map_free(bmap
);
12396 /* Add a constraint imposing that the value of the first dimension is
12397 * greater than that of the second.
12399 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12400 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12404 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12406 bmap
= isl_basic_map_intersect(bmap
, gt
);
12411 /* Add a constraint imposing that the value of the first dimension is
12412 * greater than that of the second.
12414 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12415 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12417 isl_basic_map
*bmap
;
12419 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12421 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12426 /* Add a constraint imposing that the value of the first dimension is
12427 * smaller than that of the second.
12429 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12430 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12432 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12435 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12439 isl_local_space
*ls
;
12444 if (!isl_basic_map_divs_known(bmap
))
12445 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12446 "some divs are unknown", return NULL
);
12448 ls
= isl_basic_map_get_local_space(bmap
);
12449 div
= isl_local_space_get_div(ls
, pos
);
12450 isl_local_space_free(ls
);
12455 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12458 return isl_basic_map_get_div(bset
, pos
);
12461 /* Plug in "subs" for dimension "type", "pos" of "bset".
12463 * Let i be the dimension to replace and let "subs" be of the form
12467 * Any integer division with a non-zero coefficient for i,
12469 * floor((a i + g)/m)
12473 * floor((a f + d g)/(m d))
12475 * Constraints of the form
12483 * We currently require that "subs" is an integral expression.
12484 * Handling rational expressions may require us to add stride constraints
12485 * as we do in isl_basic_set_preimage_multi_aff.
12487 __isl_give isl_basic_set
*isl_basic_set_substitute(
12488 __isl_take isl_basic_set
*bset
,
12489 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12495 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12498 bset
= isl_basic_set_cow(bset
);
12499 if (!bset
|| !subs
)
12502 ctx
= isl_basic_set_get_ctx(bset
);
12503 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12504 isl_die(ctx
, isl_error_invalid
,
12505 "spaces don't match", goto error
);
12506 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12507 isl_die(ctx
, isl_error_unsupported
,
12508 "cannot handle divs yet", goto error
);
12509 if (!isl_int_is_one(subs
->v
->el
[0]))
12510 isl_die(ctx
, isl_error_invalid
,
12511 "can only substitute integer expressions", goto error
);
12513 pos
+= isl_basic_set_offset(bset
, type
);
12517 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12518 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12520 isl_int_set(v
, bset
->eq
[i
][pos
]);
12521 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12522 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12523 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12526 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12527 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12529 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12530 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12531 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12532 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12535 for (i
= 0; i
< bset
->n_div
; ++i
) {
12536 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12538 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12539 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12540 isl_seq_combine(bset
->div
[i
] + 1,
12541 subs
->v
->el
[0], bset
->div
[i
] + 1,
12542 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12543 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12548 bset
= isl_basic_set_simplify(bset
);
12549 return isl_basic_set_finalize(bset
);
12551 isl_basic_set_free(bset
);
12555 /* Plug in "subs" for dimension "type", "pos" of "set".
12557 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12558 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12562 if (set
&& isl_set_plain_is_empty(set
))
12565 set
= isl_set_cow(set
);
12569 for (i
= set
->n
- 1; i
>= 0; --i
) {
12570 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12571 set
= set_from_map(remove_if_empty(set_to_map(set
), i
));
12582 /* Check if the range of "ma" is compatible with the domain or range
12583 * (depending on "type") of "bmap".
12585 static isl_stat
check_basic_map_compatible_range_multi_aff(
12586 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12587 __isl_keep isl_multi_aff
*ma
)
12590 isl_space
*ma_space
;
12592 ma_space
= isl_multi_aff_get_space(ma
);
12594 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12598 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12599 "parameters don't match", goto error
);
12600 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12604 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12605 "spaces don't match", goto error
);
12607 isl_space_free(ma_space
);
12608 return isl_stat_ok
;
12610 isl_space_free(ma_space
);
12611 return isl_stat_error
;
12614 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12615 * coefficients before the transformed range of dimensions,
12616 * the "n_after" coefficients after the transformed range of dimensions
12617 * and the coefficients of the other divs in "bmap".
12619 static __isl_give isl_basic_map
*set_ma_divs(__isl_take isl_basic_map
*bmap
,
12620 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12625 isl_local_space
*ls
;
12630 ls
= isl_aff_get_domain_local_space(ma
->u
.p
[0]);
12632 return isl_basic_map_free(bmap
);
12634 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12635 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12636 for (i
= 0; i
< n_div
; ++i
) {
12637 int o_bmap
= 0, o_ls
= 0;
12639 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12640 o_bmap
+= 1 + 1 + n_param
;
12641 o_ls
+= 1 + 1 + n_param
;
12642 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12643 o_bmap
+= n_before
;
12644 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12645 ls
->div
->row
[i
] + o_ls
, n_set
);
12648 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12650 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12651 ls
->div
->row
[i
] + o_ls
, n_div
);
12654 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12655 bmap
= isl_basic_map_add_div_constraints(bmap
, i
);
12660 isl_local_space_free(ls
);
12663 isl_local_space_free(ls
);
12664 return isl_basic_map_free(bmap
);
12667 /* How many stride constraints does "ma" enforce?
12668 * That is, how many of the affine expressions have a denominator
12669 * different from one?
12671 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12676 for (i
= 0; i
< ma
->n
; ++i
)
12677 if (!isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12683 /* For each affine expression in ma of the form
12685 * x_i = (f_i y + h_i)/m_i
12687 * with m_i different from one, add a constraint to "bmap"
12690 * f_i y + h_i = m_i alpha_i
12692 * with alpha_i an additional existentially quantified variable.
12694 * The input variables of "ma" correspond to a subset of the variables
12695 * of "bmap". There are "n_before" variables in "bmap" before this
12696 * subset and "n_after" variables after this subset.
12697 * The integer divisions of the affine expressions in "ma" are assumed
12698 * to have been aligned. There are "n_div_ma" of them and
12699 * they appear first in "bmap", straight after the "n_after" variables.
12701 static __isl_give isl_basic_map
*add_ma_strides(
12702 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12703 int n_before
, int n_after
, int n_div_ma
)
12711 total
= isl_basic_map_total_dim(bmap
);
12712 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12713 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12714 for (i
= 0; i
< ma
->n
; ++i
) {
12715 int o_bmap
= 0, o_ma
= 1;
12717 if (isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12719 div
= isl_basic_map_alloc_div(bmap
);
12720 k
= isl_basic_map_alloc_equality(bmap
);
12721 if (div
< 0 || k
< 0)
12723 isl_int_set_si(bmap
->div
[div
][0], 0);
12724 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12725 ma
->u
.p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12726 o_bmap
+= 1 + n_param
;
12727 o_ma
+= 1 + n_param
;
12728 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12729 o_bmap
+= n_before
;
12730 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12731 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_in
);
12734 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12736 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12737 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12738 o_bmap
+= n_div_ma
;
12740 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12741 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->u
.p
[i
]->v
->el
[0]);
12747 isl_basic_map_free(bmap
);
12751 /* Replace the domain or range space (depending on "type) of "space" by "set".
12753 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12754 enum isl_dim_type type
, __isl_take isl_space
*set
)
12756 if (type
== isl_dim_in
) {
12757 space
= isl_space_range(space
);
12758 space
= isl_space_map_from_domain_and_range(set
, space
);
12760 space
= isl_space_domain(space
);
12761 space
= isl_space_map_from_domain_and_range(space
, set
);
12767 /* Compute the preimage of the domain or range (depending on "type")
12768 * of "bmap" under the function represented by "ma".
12769 * In other words, plug in "ma" in the domain or range of "bmap".
12770 * The result is a basic map that lives in the same space as "bmap"
12771 * except that the domain or range has been replaced by
12772 * the domain space of "ma".
12774 * If bmap is represented by
12776 * A(p) + S u + B x + T v + C(divs) >= 0,
12778 * where u and x are input and output dimensions if type == isl_dim_out
12779 * while x and v are input and output dimensions if type == isl_dim_in,
12780 * and ma is represented by
12782 * x = D(p) + F(y) + G(divs')
12784 * then the result is
12786 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12788 * The divs in the input set are similarly adjusted.
12791 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12795 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12796 * B_i G(divs') + c_i(divs))/n_i)
12798 * If bmap is not a rational map and if F(y) involves any denominators
12800 * x_i = (f_i y + h_i)/m_i
12802 * then additional constraints are added to ensure that we only
12803 * map back integer points. That is we enforce
12805 * f_i y + h_i = m_i alpha_i
12807 * with alpha_i an additional existentially quantified variable.
12809 * We first copy over the divs from "ma".
12810 * Then we add the modified constraints and divs from "bmap".
12811 * Finally, we add the stride constraints, if needed.
12813 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12814 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12815 __isl_take isl_multi_aff
*ma
)
12819 isl_basic_map
*res
= NULL
;
12820 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12821 isl_int f
, c1
, c2
, g
;
12830 ma
= isl_multi_aff_align_divs(ma
);
12833 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12836 if (type
== isl_dim_in
) {
12838 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12840 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12843 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12844 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
12846 space
= isl_multi_aff_get_domain_space(ma
);
12847 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12848 rational
= isl_basic_map_is_rational(bmap
);
12849 strides
= rational
? 0 : multi_aff_strides(ma
);
12850 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12851 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12853 res
= isl_basic_map_set_rational(res
);
12855 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12856 if (isl_basic_map_alloc_div(res
) < 0)
12859 res
= set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
);
12863 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12864 k
= isl_basic_map_alloc_equality(res
);
12867 if (isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12868 n_after
, n_div_ma
, n_div_bmap
,
12869 f
, c1
, c2
, g
, 0) < 0)
12873 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12874 k
= isl_basic_map_alloc_inequality(res
);
12877 if (isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12878 n_after
, n_div_ma
, n_div_bmap
,
12879 f
, c1
, c2
, g
, 0) < 0)
12883 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12884 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12885 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12888 if (isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12889 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12890 f
, c1
, c2
, g
, 1) < 0)
12895 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
12901 isl_basic_map_free(bmap
);
12902 isl_multi_aff_free(ma
);
12903 res
= isl_basic_map_simplify(res
);
12904 return isl_basic_map_finalize(res
);
12910 isl_basic_map_free(bmap
);
12911 isl_multi_aff_free(ma
);
12912 isl_basic_map_free(res
);
12916 /* Compute the preimage of "bset" under the function represented by "ma".
12917 * In other words, plug in "ma" in "bset". The result is a basic set
12918 * that lives in the domain space of "ma".
12920 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12921 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12923 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12926 /* Compute the preimage of the domain of "bmap" under the function
12927 * represented by "ma".
12928 * In other words, plug in "ma" in the domain of "bmap".
12929 * The result is a basic map that lives in the same space as "bmap"
12930 * except that the domain has been replaced by the domain space of "ma".
12932 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12933 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12935 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12938 /* Compute the preimage of the range of "bmap" under the function
12939 * represented by "ma".
12940 * In other words, plug in "ma" in the range of "bmap".
12941 * The result is a basic map that lives in the same space as "bmap"
12942 * except that the range has been replaced by the domain space of "ma".
12944 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12945 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12947 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12950 /* Check if the range of "ma" is compatible with the domain or range
12951 * (depending on "type") of "map".
12952 * Return isl_stat_error if anything is wrong.
12954 static isl_stat
check_map_compatible_range_multi_aff(
12955 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12956 __isl_keep isl_multi_aff
*ma
)
12959 isl_space
*ma_space
;
12961 ma_space
= isl_multi_aff_get_space(ma
);
12962 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
12963 isl_space_free(ma_space
);
12965 return isl_stat_error
;
12967 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12968 "spaces don't match", return isl_stat_error
);
12969 return isl_stat_ok
;
12972 /* Compute the preimage of the domain or range (depending on "type")
12973 * of "map" under the function represented by "ma".
12974 * In other words, plug in "ma" in the domain or range of "map".
12975 * The result is a map that lives in the same space as "map"
12976 * except that the domain or range has been replaced by
12977 * the domain space of "ma".
12979 * The parameters are assumed to have been aligned.
12981 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
12982 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12987 map
= isl_map_cow(map
);
12988 ma
= isl_multi_aff_align_divs(ma
);
12991 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
12994 for (i
= 0; i
< map
->n
; ++i
) {
12995 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
12996 isl_multi_aff_copy(ma
));
13001 space
= isl_multi_aff_get_domain_space(ma
);
13002 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13004 isl_space_free(map
->dim
);
13009 isl_multi_aff_free(ma
);
13011 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13012 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13015 isl_multi_aff_free(ma
);
13020 /* Compute the preimage of the domain or range (depending on "type")
13021 * of "map" under the function represented by "ma".
13022 * In other words, plug in "ma" in the domain or range of "map".
13023 * The result is a map that lives in the same space as "map"
13024 * except that the domain or range has been replaced by
13025 * the domain space of "ma".
13027 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13028 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13035 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13039 return map_preimage_multi_aff(map
, type
, ma
);
13041 if (isl_map_check_named_params(map
) < 0)
13043 if (!isl_space_has_named_params(ma
->space
))
13044 isl_die(map
->ctx
, isl_error_invalid
,
13045 "unaligned unnamed parameters", goto error
);
13046 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13047 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13049 return map_preimage_multi_aff(map
, type
, ma
);
13051 isl_multi_aff_free(ma
);
13052 return isl_map_free(map
);
13055 /* Compute the preimage of "set" under the function represented by "ma".
13056 * In other words, plug in "ma" in "set". The result is a set
13057 * that lives in the domain space of "ma".
13059 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13060 __isl_take isl_multi_aff
*ma
)
13062 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13065 /* Compute the preimage of the domain of "map" under the function
13066 * represented by "ma".
13067 * In other words, plug in "ma" in the domain of "map".
13068 * The result is a map that lives in the same space as "map"
13069 * except that the domain has been replaced by the domain space of "ma".
13071 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13072 __isl_take isl_multi_aff
*ma
)
13074 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13077 /* Compute the preimage of the range of "map" under the function
13078 * represented by "ma".
13079 * In other words, plug in "ma" in the range of "map".
13080 * The result is a map that lives in the same space as "map"
13081 * except that the range has been replaced by the domain space of "ma".
13083 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13084 __isl_take isl_multi_aff
*ma
)
13086 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13089 /* Compute the preimage of "map" under the function represented by "pma".
13090 * In other words, plug in "pma" in the domain or range of "map".
13091 * The result is a map that lives in the same space as "map",
13092 * except that the space of type "type" has been replaced by
13093 * the domain space of "pma".
13095 * The parameters of "map" and "pma" are assumed to have been aligned.
13097 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13098 __isl_take isl_map
*map
, enum isl_dim_type type
,
13099 __isl_take isl_pw_multi_aff
*pma
)
13108 isl_pw_multi_aff_free(pma
);
13109 res
= isl_map_empty(isl_map_get_space(map
));
13114 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13115 isl_multi_aff_copy(pma
->p
[0].maff
));
13116 if (type
== isl_dim_in
)
13117 res
= isl_map_intersect_domain(res
,
13118 isl_map_copy(pma
->p
[0].set
));
13120 res
= isl_map_intersect_range(res
,
13121 isl_map_copy(pma
->p
[0].set
));
13123 for (i
= 1; i
< pma
->n
; ++i
) {
13126 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13127 isl_multi_aff_copy(pma
->p
[i
].maff
));
13128 if (type
== isl_dim_in
)
13129 res_i
= isl_map_intersect_domain(res_i
,
13130 isl_map_copy(pma
->p
[i
].set
));
13132 res_i
= isl_map_intersect_range(res_i
,
13133 isl_map_copy(pma
->p
[i
].set
));
13134 res
= isl_map_union(res
, res_i
);
13137 isl_pw_multi_aff_free(pma
);
13141 isl_pw_multi_aff_free(pma
);
13146 /* Compute the preimage of "map" under the function represented by "pma".
13147 * In other words, plug in "pma" in the domain or range of "map".
13148 * The result is a map that lives in the same space as "map",
13149 * except that the space of type "type" has been replaced by
13150 * the domain space of "pma".
13152 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13153 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13160 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13164 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13166 if (isl_map_check_named_params(map
) < 0)
13168 if (isl_pw_multi_aff_check_named_params(pma
) < 0)
13170 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13171 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13173 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13175 isl_pw_multi_aff_free(pma
);
13176 return isl_map_free(map
);
13179 /* Compute the preimage of "set" under the function represented by "pma".
13180 * In other words, plug in "pma" in "set". The result is a set
13181 * that lives in the domain space of "pma".
13183 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13184 __isl_take isl_pw_multi_aff
*pma
)
13186 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13189 /* Compute the preimage of the domain of "map" under the function
13190 * represented by "pma".
13191 * In other words, plug in "pma" in the domain of "map".
13192 * The result is a map that lives in the same space as "map",
13193 * except that domain space has been replaced by the domain space of "pma".
13195 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13196 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13198 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13201 /* Compute the preimage of the range of "map" under the function
13202 * represented by "pma".
13203 * In other words, plug in "pma" in the range of "map".
13204 * The result is a map that lives in the same space as "map",
13205 * except that range space has been replaced by the domain space of "pma".
13207 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13208 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13210 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13213 /* Compute the preimage of "map" under the function represented by "mpa".
13214 * In other words, plug in "mpa" in the domain or range of "map".
13215 * The result is a map that lives in the same space as "map",
13216 * except that the space of type "type" has been replaced by
13217 * the domain space of "mpa".
13219 * If the map does not involve any constraints that refer to the
13220 * dimensions of the substituted space, then the only possible
13221 * effect of "mpa" on the map is to map the space to a different space.
13222 * We create a separate isl_multi_aff to effectuate this change
13223 * in order to avoid spurious splitting of the map along the pieces
13225 * If "mpa" has a non-trivial explicit domain, however,
13226 * then the full substitution should be performed.
13228 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13229 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13233 isl_pw_multi_aff
*pma
;
13238 n
= isl_map_dim(map
, type
);
13239 full
= isl_map_involves_dims(map
, type
, 0, n
);
13240 if (full
>= 0 && !full
)
13241 full
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
13248 space
= isl_multi_pw_aff_get_space(mpa
);
13249 isl_multi_pw_aff_free(mpa
);
13250 ma
= isl_multi_aff_zero(space
);
13251 return isl_map_preimage_multi_aff(map
, type
, ma
);
13254 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13255 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13258 isl_multi_pw_aff_free(mpa
);
13262 /* Compute the preimage of "map" under the function represented by "mpa".
13263 * In other words, plug in "mpa" in the domain "map".
13264 * The result is a map that lives in the same space as "map",
13265 * except that domain space has been replaced by the domain space of "mpa".
13267 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13268 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13270 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13273 /* Compute the preimage of "set" by the function represented by "mpa".
13274 * In other words, plug in "mpa" in "set".
13276 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13277 __isl_take isl_multi_pw_aff
*mpa
)
13279 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13282 /* Return a copy of the equality constraints of "bset" as a matrix.
13284 __isl_give isl_mat
*isl_basic_set_extract_equalities(
13285 __isl_keep isl_basic_set
*bset
)
13293 ctx
= isl_basic_set_get_ctx(bset
);
13294 total
= 1 + isl_basic_set_dim(bset
, isl_dim_all
);
13295 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, total
);
13298 /* Are the "n" "coefficients" starting at "first" of the integer division
13299 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13301 * The "coefficient" at position 0 is the denominator.
13302 * The "coefficient" at position 1 is the constant term.
13304 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13305 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13306 unsigned first
, unsigned n
)
13308 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13309 return isl_bool_error
;
13310 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13311 return isl_bool_error
;
13312 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13313 bmap2
->div
[pos2
] + first
, n
);
13316 /* Are the integer division expressions at position "pos1" in "bmap1" and
13317 * "pos2" in "bmap2" equal to each other, except that the constant terms
13320 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13321 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13322 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13327 if (!bmap1
|| !bmap2
)
13328 return isl_bool_error
;
13329 total
= isl_basic_map_total_dim(bmap1
);
13330 if (total
!= isl_basic_map_total_dim(bmap2
))
13331 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13332 "incomparable div expressions", return isl_bool_error
);
13333 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13335 if (equal
< 0 || !equal
)
13337 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13339 if (equal
< 0 || equal
)
13340 return isl_bool_not(equal
);
13341 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13345 /* Replace the numerator of the constant term of the integer division
13346 * expression at position "div" in "bmap" by "value".
13347 * The caller guarantees that this does not change the meaning
13350 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13351 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13353 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13354 return isl_basic_map_free(bmap
);
13356 isl_int_set_si(bmap
->div
[div
][1], value
);
13361 /* Is the point "inner" internal to inequality constraint "ineq"
13363 * The point is considered to be internal to the inequality constraint,
13364 * if it strictly lies on the positive side of the inequality constraint,
13365 * or if it lies on the constraint and the constraint is lexico-positive.
13367 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13368 __isl_keep isl_basic_set
*bset
, int ineq
)
13374 if (!inner
|| !bset
)
13375 return isl_bool_error
;
13377 ctx
= isl_basic_set_get_ctx(bset
);
13378 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13379 &ctx
->normalize_gcd
);
13380 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13381 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13383 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13384 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13385 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13388 /* Tighten the inequality constraints of "bset" that are outward with respect
13389 * to the point "vec".
13390 * That is, tighten the constraints that are not satisfied by "vec".
13392 * "vec" is a point internal to some superset S of "bset" that is used
13393 * to make the subsets of S disjoint, by tightening one half of the constraints
13394 * that separate two subsets. In particular, the constraints of S
13395 * are all satisfied by "vec" and should not be tightened.
13396 * Of the internal constraints, those that have "vec" on the outside
13397 * are tightened. The shared facet is included in the adjacent subset
13398 * with the opposite constraint.
13399 * For constraints that saturate "vec", this criterion cannot be used
13400 * to determine which of the two sides should be tightened.
13401 * Instead, the sign of the first non-zero coefficient is used
13402 * to make this choice. Note that this second criterion is never used
13403 * on the constraints of S since "vec" is interior to "S".
13405 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13406 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13410 bset
= isl_basic_set_cow(bset
);
13413 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13416 internal
= is_internal(vec
, bset
, j
);
13418 return isl_basic_set_free(bset
);
13421 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13427 /* Replace the variables x of type "type" starting at "first" in "bmap"
13428 * by x' with x = M x' with M the matrix trans.
13429 * That is, replace the corresponding coefficients c by c M.
13431 * The transformation matrix should be a square matrix.
13433 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13434 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13435 __isl_take isl_mat
*trans
)
13439 bmap
= isl_basic_map_cow(bmap
);
13440 if (!bmap
|| !trans
)
13443 if (trans
->n_row
!= trans
->n_col
)
13444 isl_die(trans
->ctx
, isl_error_invalid
,
13445 "expecting square transformation matrix", goto error
);
13446 if (isl_basic_map_check_range(bmap
, type
, first
, trans
->n_row
) < 0)
13449 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13451 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13452 isl_mat_copy(trans
)) < 0)
13454 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13455 isl_mat_copy(trans
)) < 0)
13457 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13458 isl_mat_copy(trans
)) < 0)
13461 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
13462 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13464 isl_mat_free(trans
);
13467 isl_mat_free(trans
);
13468 isl_basic_map_free(bmap
);
13472 /* Replace the variables x of type "type" starting at "first" in "bset"
13473 * by x' with x = M x' with M the matrix trans.
13474 * That is, replace the corresponding coefficients c by c M.
13476 * The transformation matrix should be a square matrix.
13478 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13479 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13480 __isl_take isl_mat
*trans
)
13482 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);