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>
26 #include <isl/constraint.h>
27 #include "isl_space_private.h"
28 #include "isl_equalities.h"
29 #include <isl_lp_private.h>
33 #include <isl_reordering.h>
34 #include "isl_sample.h"
38 #include <isl_mat_private.h>
39 #include <isl_vec_private.h>
40 #include <isl_dim_map.h>
41 #include <isl_local_space_private.h>
42 #include <isl_aff_private.h>
43 #include <isl_options_private.h>
44 #include <isl_morph.h>
45 #include <isl_val_private.h>
46 #include <isl/deprecated/map_int.h>
47 #include <isl/deprecated/set_int.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 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
57 case isl_dim_param
: return dim
->nparam
;
58 case isl_dim_in
: return dim
->n_in
;
59 case isl_dim_out
: return dim
->n_out
;
60 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
65 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
68 case isl_dim_param
: return 1;
69 case isl_dim_in
: return 1 + dim
->nparam
;
70 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
75 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
76 enum isl_dim_type type
)
81 case isl_dim_cst
: return 1;
84 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
85 case isl_dim_div
: return bmap
->n_div
;
86 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
91 /* Return the space of "map".
93 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
95 return map
? map
->dim
: NULL
;
98 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
100 return map
? n(map
->dim
, type
) : 0;
103 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
105 return set
? n(set
->dim
, type
) : 0;
108 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
109 enum isl_dim_type type
)
118 case isl_dim_cst
: return 0;
119 case isl_dim_param
: return 1;
120 case isl_dim_in
: return 1 + space
->nparam
;
121 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
122 case isl_dim_div
: return 1 + space
->nparam
+ space
->n_in
+
128 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
129 enum isl_dim_type type
)
131 return isl_basic_map_offset(bset
, type
);
134 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
136 return pos(map
->dim
, type
);
139 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
140 enum isl_dim_type type
)
142 return isl_basic_map_dim(bset
, type
);
145 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
147 return isl_basic_set_dim(bset
, isl_dim_set
);
150 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
152 return isl_basic_set_dim(bset
, isl_dim_param
);
155 unsigned isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
159 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
162 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
164 return isl_set_dim(set
, isl_dim_set
);
167 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
169 return isl_set_dim(set
, isl_dim_param
);
172 unsigned isl_basic_map_n_in(__isl_keep
const isl_basic_map
*bmap
)
174 return bmap
? bmap
->dim
->n_in
: 0;
177 unsigned isl_basic_map_n_out(__isl_keep
const isl_basic_map
*bmap
)
179 return bmap
? bmap
->dim
->n_out
: 0;
182 unsigned isl_basic_map_n_param(__isl_keep
const isl_basic_map
*bmap
)
184 return bmap
? bmap
->dim
->nparam
: 0;
187 unsigned isl_basic_map_n_div(__isl_keep
const isl_basic_map
*bmap
)
189 return bmap
? bmap
->n_div
: 0;
192 unsigned isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
194 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
197 unsigned isl_map_n_in(const struct isl_map
*map
)
199 return map
? map
->dim
->n_in
: 0;
202 unsigned isl_map_n_out(const struct isl_map
*map
)
204 return map
? map
->dim
->n_out
: 0;
207 unsigned isl_map_n_param(const struct isl_map
*map
)
209 return map
? map
->dim
->nparam
: 0;
212 /* Do "bmap1" and "bmap2" have the same parameters?
214 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
215 __isl_keep isl_basic_map
*bmap2
)
217 isl_space
*space1
, *space2
;
219 space1
= isl_basic_map_peek_space(bmap1
);
220 space2
= isl_basic_map_peek_space(bmap2
);
221 return isl_space_has_equal_params(space1
, space2
);
224 /* Do "map1" and "map2" have the same parameters?
226 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
227 __isl_keep isl_map
*map2
)
229 isl_space
*space1
, *space2
;
231 space1
= isl_map_peek_space(map1
);
232 space2
= isl_map_peek_space(map2
);
233 return isl_space_has_equal_params(space1
, space2
);
236 /* Do "map" and "set" have the same parameters?
238 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
239 __isl_keep isl_set
*set
)
241 return isl_map_has_equal_params(map
, set_to_map(set
));
244 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
245 __isl_keep isl_set
*set
)
249 return isl_bool_error
;
250 m
= isl_map_has_equal_params(map
, set_to_map(set
));
253 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
254 set
->dim
, isl_dim_set
);
257 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
258 __isl_keep isl_basic_set
*bset
)
262 return isl_bool_error
;
263 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
266 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
267 bset
->dim
, isl_dim_set
);
270 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
271 __isl_keep isl_set
*set
)
275 return isl_bool_error
;
276 m
= isl_map_has_equal_params(map
, set_to_map(set
));
279 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
280 set
->dim
, isl_dim_set
);
283 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
284 __isl_keep isl_basic_set
*bset
)
288 return isl_bool_error
;
289 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
292 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
293 bset
->dim
, isl_dim_set
);
296 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
298 return bmap
? bmap
->ctx
: NULL
;
301 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
303 return bset
? bset
->ctx
: NULL
;
306 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
308 return map
? map
->ctx
: NULL
;
311 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
313 return set
? set
->ctx
: NULL
;
316 /* Return the space of "bmap".
318 __isl_keep isl_space
*isl_basic_map_peek_space(
319 __isl_keep
const isl_basic_map
*bmap
)
321 return bmap
? bmap
->dim
: NULL
;
324 /* Return the space of "bset".
326 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
328 return isl_basic_map_peek_space(bset_to_bmap(bset
));
331 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
333 return isl_space_copy(isl_basic_map_peek_space(bmap
));
336 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
338 return isl_basic_map_get_space(bset_to_bmap(bset
));
341 /* Extract the divs in "bmap" as a matrix.
343 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
354 ctx
= isl_basic_map_get_ctx(bmap
);
355 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
356 cols
= 1 + 1 + total
+ bmap
->n_div
;
357 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
361 for (i
= 0; i
< bmap
->n_div
; ++i
)
362 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
367 /* Extract the divs in "bset" as a matrix.
369 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
371 return isl_basic_map_get_divs(bset
);
374 __isl_give isl_local_space
*isl_basic_map_get_local_space(
375 __isl_keep isl_basic_map
*bmap
)
382 div
= isl_basic_map_get_divs(bmap
);
383 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
386 __isl_give isl_local_space
*isl_basic_set_get_local_space(
387 __isl_keep isl_basic_set
*bset
)
389 return isl_basic_map_get_local_space(bset
);
392 /* For each known div d = floor(f/m), add the constraints
395 * -(f-(m-1)) + m d >= 0
397 * Do not finalize the result.
399 static __isl_give isl_basic_map
*add_known_div_constraints(
400 __isl_take isl_basic_map
*bmap
)
407 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
410 bmap
= isl_basic_map_cow(bmap
);
411 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
414 for (i
= 0; i
< n_div
; ++i
) {
415 if (isl_int_is_zero(bmap
->div
[i
][0]))
417 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
418 return isl_basic_map_free(bmap
);
424 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
425 __isl_take isl_local_space
*ls
)
434 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
435 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
436 n_div
, 0, 2 * n_div
);
438 for (i
= 0; i
< n_div
; ++i
)
439 if (isl_basic_map_alloc_div(bmap
) < 0)
442 for (i
= 0; i
< n_div
; ++i
)
443 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
444 bmap
= add_known_div_constraints(bmap
);
446 isl_local_space_free(ls
);
449 isl_local_space_free(ls
);
450 isl_basic_map_free(bmap
);
454 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
455 __isl_take isl_local_space
*ls
)
457 return isl_basic_map_from_local_space(ls
);
460 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
462 return isl_space_copy(isl_map_peek_space(map
));
465 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
469 return isl_space_copy(set
->dim
);
472 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
473 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
475 bmap
= isl_basic_map_cow(bmap
);
478 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
481 bmap
= isl_basic_map_finalize(bmap
);
484 isl_basic_map_free(bmap
);
488 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
489 __isl_take isl_basic_set
*bset
, const char *s
)
491 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
494 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
495 enum isl_dim_type type
)
497 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
500 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
501 enum isl_dim_type type
, const char *s
)
505 map
= isl_map_cow(map
);
509 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
513 for (i
= 0; i
< map
->n
; ++i
) {
514 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
525 /* Replace the identifier of the tuple of type "type" by "id".
527 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
528 __isl_take isl_basic_map
*bmap
,
529 enum isl_dim_type type
, __isl_take isl_id
*id
)
531 bmap
= isl_basic_map_cow(bmap
);
534 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
536 return isl_basic_map_free(bmap
);
537 bmap
= isl_basic_map_finalize(bmap
);
544 /* Replace the identifier of the tuple by "id".
546 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
547 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
549 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
552 /* Does the input or output tuple have a name?
554 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
556 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
559 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
560 enum isl_dim_type type
)
562 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
565 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
568 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
572 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
573 enum isl_dim_type type
, __isl_take isl_id
*id
)
575 map
= isl_map_cow(map
);
579 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
581 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
587 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
588 __isl_take isl_id
*id
)
590 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
593 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
594 enum isl_dim_type type
)
596 map
= isl_map_cow(map
);
600 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
602 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
605 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
607 return isl_map_reset_tuple_id(set
, isl_dim_set
);
610 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
612 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
615 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
616 enum isl_dim_type type
)
618 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
621 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
623 return isl_map_has_tuple_id(set
, isl_dim_set
);
626 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
628 return isl_map_get_tuple_id(set
, isl_dim_set
);
631 /* Does the set tuple have a name?
633 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
636 return isl_bool_error
;
637 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
641 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
643 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
646 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
648 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
651 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
652 enum isl_dim_type type
, unsigned pos
)
654 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
657 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
658 enum isl_dim_type type
, unsigned pos
)
660 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
663 /* Does the given dimension have a name?
665 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
666 enum isl_dim_type type
, unsigned pos
)
669 return isl_bool_error
;
670 return isl_space_has_dim_name(map
->dim
, type
, pos
);
673 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
674 enum isl_dim_type type
, unsigned pos
)
676 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
679 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
680 enum isl_dim_type type
, unsigned pos
)
682 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
685 /* Does the given dimension have a name?
687 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
688 enum isl_dim_type type
, unsigned pos
)
691 return isl_bool_error
;
692 return isl_space_has_dim_name(set
->dim
, type
, pos
);
695 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
696 __isl_take isl_basic_map
*bmap
,
697 enum isl_dim_type type
, unsigned pos
, const char *s
)
699 bmap
= isl_basic_map_cow(bmap
);
702 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
705 return isl_basic_map_finalize(bmap
);
707 isl_basic_map_free(bmap
);
711 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
712 enum isl_dim_type type
, unsigned pos
, const char *s
)
716 map
= isl_map_cow(map
);
720 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
724 for (i
= 0; i
< map
->n
; ++i
) {
725 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
736 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
737 __isl_take isl_basic_set
*bset
,
738 enum isl_dim_type type
, unsigned pos
, const char *s
)
740 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
744 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
745 enum isl_dim_type type
, unsigned pos
, const char *s
)
747 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
751 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
752 enum isl_dim_type type
, unsigned pos
)
755 return isl_bool_error
;
756 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
759 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
760 enum isl_dim_type type
, unsigned pos
)
762 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
765 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
766 enum isl_dim_type type
, unsigned pos
)
768 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
771 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
772 enum isl_dim_type type
, unsigned pos
)
774 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
777 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
778 enum isl_dim_type type
, unsigned pos
)
780 return isl_map_has_dim_id(set
, type
, pos
);
783 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
784 enum isl_dim_type type
, unsigned pos
)
786 return isl_map_get_dim_id(set
, type
, pos
);
789 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
790 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
792 map
= isl_map_cow(map
);
796 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
798 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
804 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
805 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
807 return isl_map_set_dim_id(set
, type
, pos
, id
);
810 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
811 __isl_keep isl_id
*id
)
815 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
818 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
819 __isl_keep isl_id
*id
)
821 return isl_map_find_dim_by_id(set
, type
, id
);
824 /* Return the position of the dimension of the given type and name
826 * Return -1 if no such dimension can be found.
828 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
829 enum isl_dim_type type
, const char *name
)
833 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
836 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
841 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
844 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
847 return isl_map_find_dim_by_name(set
, type
, name
);
850 /* Check whether equality i of bset is a pure stride constraint
851 * on a single dimension, i.e., of the form
855 * with k a constant and e an existentially quantified variable.
857 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
866 return isl_bool_error
;
868 if (!isl_int_is_zero(bset
->eq
[i
][0]))
869 return isl_bool_false
;
871 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
872 d
= isl_basic_set_dim(bset
, isl_dim_set
);
873 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
875 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
876 return isl_bool_false
;
877 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
879 return isl_bool_false
;
880 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
882 return isl_bool_false
;
884 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
886 return isl_bool_false
;
887 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
888 n_div
- pos2
- 1) != -1)
889 return isl_bool_false
;
890 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
891 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
892 return isl_bool_false
;
894 return isl_bool_true
;
897 /* Reset the user pointer on all identifiers of parameters and tuples
898 * of the space of "map".
900 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
904 space
= isl_map_get_space(map
);
905 space
= isl_space_reset_user(space
);
906 map
= isl_map_reset_space(map
, space
);
911 /* Reset the user pointer on all identifiers of parameters and tuples
912 * of the space of "set".
914 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
916 return isl_map_reset_user(set
);
919 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
922 return isl_bool_error
;
923 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
926 /* Has "map" been marked as a rational map?
927 * In particular, have all basic maps in "map" been marked this way?
928 * An empty map is not considered to be rational.
929 * Maps where only some of the basic maps are marked rational
932 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
938 return isl_bool_error
;
940 return isl_bool_false
;
941 rational
= isl_basic_map_is_rational(map
->p
[0]);
944 for (i
= 1; i
< map
->n
; ++i
) {
947 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
950 if (rational
!= rational_i
)
951 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
952 "mixed rational and integer basic maps "
953 "not supported", return isl_bool_error
);
959 /* Has "set" been marked as a rational set?
960 * In particular, have all basic set in "set" been marked this way?
961 * An empty set is not considered to be rational.
962 * Sets where only some of the basic sets are marked rational
965 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
967 return isl_map_is_rational(set
);
970 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
972 return isl_basic_map_is_rational(bset
);
975 /* Does "bmap" contain any rational points?
977 * If "bmap" has an equality for each dimension, equating the dimension
978 * to an integer constant, then it has no rational points, even if it
979 * is marked as rational.
981 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
983 isl_bool has_rational
= isl_bool_true
;
987 return isl_bool_error
;
988 if (isl_basic_map_plain_is_empty(bmap
))
989 return isl_bool_false
;
990 if (!isl_basic_map_is_rational(bmap
))
991 return isl_bool_false
;
992 bmap
= isl_basic_map_copy(bmap
);
993 bmap
= isl_basic_map_implicit_equalities(bmap
);
995 return isl_bool_error
;
996 total
= isl_basic_map_total_dim(bmap
);
997 if (bmap
->n_eq
== total
) {
999 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1000 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1003 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1004 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1006 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1011 if (i
== bmap
->n_eq
)
1012 has_rational
= isl_bool_false
;
1014 isl_basic_map_free(bmap
);
1016 return has_rational
;
1019 /* Does "map" contain any rational points?
1021 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1024 isl_bool has_rational
;
1027 return isl_bool_error
;
1028 for (i
= 0; i
< map
->n
; ++i
) {
1029 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1030 if (has_rational
< 0 || has_rational
)
1031 return has_rational
;
1033 return isl_bool_false
;
1036 /* Does "set" contain any rational points?
1038 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1040 return isl_map_has_rational(set
);
1043 /* Is this basic set a parameter domain?
1045 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1048 return isl_bool_error
;
1049 return isl_space_is_params(bset
->dim
);
1052 /* Is this set a parameter domain?
1054 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1057 return isl_bool_error
;
1058 return isl_space_is_params(set
->dim
);
1061 /* Is this map actually a parameter domain?
1062 * Users should never call this function. Outside of isl,
1063 * a map can never be a parameter domain.
1065 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1068 return isl_bool_error
;
1069 return isl_space_is_params(map
->dim
);
1072 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
1073 struct isl_basic_map
*bmap
, unsigned extra
,
1074 unsigned n_eq
, unsigned n_ineq
)
1077 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
1082 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1083 if (isl_blk_is_error(bmap
->block
))
1086 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1087 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1091 bmap
->block2
= isl_blk_empty();
1094 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1095 if (isl_blk_is_error(bmap
->block2
))
1098 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1103 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1104 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1106 for (i
= 0; i
< extra
; ++i
)
1107 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1111 bmap
->c_size
= n_eq
+ n_ineq
;
1112 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1113 bmap
->extra
= extra
;
1117 bmap
->sample
= NULL
;
1121 isl_basic_map_free(bmap
);
1125 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1126 unsigned nparam
, unsigned dim
, unsigned extra
,
1127 unsigned n_eq
, unsigned n_ineq
)
1129 struct isl_basic_map
*bmap
;
1132 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1136 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1137 return bset_from_bmap(bmap
);
1140 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1141 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1143 struct isl_basic_map
*bmap
;
1146 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1147 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1148 return bset_from_bmap(bmap
);
1150 isl_space_free(dim
);
1154 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1155 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1157 struct isl_basic_map
*bmap
;
1161 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1166 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1168 isl_space_free(dim
);
1172 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1173 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1174 unsigned n_eq
, unsigned n_ineq
)
1176 struct isl_basic_map
*bmap
;
1179 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1183 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1187 static void dup_constraints(
1188 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1191 unsigned total
= isl_basic_map_total_dim(src
);
1193 for (i
= 0; i
< src
->n_eq
; ++i
) {
1194 int j
= isl_basic_map_alloc_equality(dst
);
1195 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1198 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1199 int j
= isl_basic_map_alloc_inequality(dst
);
1200 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1203 for (i
= 0; i
< src
->n_div
; ++i
) {
1204 int j
= isl_basic_map_alloc_div(dst
);
1205 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1207 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1210 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1212 struct isl_basic_map
*dup
;
1216 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1217 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1220 dup_constraints(dup
, bmap
);
1221 dup
->flags
= bmap
->flags
;
1222 dup
->sample
= isl_vec_copy(bmap
->sample
);
1226 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1228 struct isl_basic_map
*dup
;
1230 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1231 return bset_from_bmap(dup
);
1234 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1239 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1243 return isl_basic_set_dup(bset
);
1246 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1255 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1260 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1264 bmap
= isl_basic_map_dup(bmap
);
1266 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1270 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1279 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1284 if (--bmap
->ref
> 0)
1287 isl_ctx_deref(bmap
->ctx
);
1289 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1291 isl_blk_free(bmap
->ctx
, bmap
->block
);
1292 isl_vec_free(bmap
->sample
);
1293 isl_space_free(bmap
->dim
);
1299 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1301 return isl_basic_map_free(bset_to_bmap(bset
));
1304 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1306 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1309 /* Check that "map" has only named parameters, reporting an error
1312 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1314 return isl_space_check_named_params(isl_map_peek_space(map
));
1317 /* Check that "bmap1" and "bmap2" have the same parameters,
1318 * reporting an error if they do not.
1320 static isl_stat
isl_basic_map_check_equal_params(
1321 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1325 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1327 return isl_stat_error
;
1329 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1330 "parameters don't match", return isl_stat_error
);
1334 __isl_give isl_map
*isl_map_align_params_map_map_and(
1335 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1336 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1337 __isl_take isl_map
*map2
))
1341 if (isl_map_has_equal_params(map1
, map2
))
1342 return fn(map1
, map2
);
1343 if (isl_map_check_named_params(map1
) < 0)
1345 if (isl_map_check_named_params(map2
) < 0)
1347 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1348 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1349 return fn(map1
, map2
);
1356 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1357 __isl_keep isl_map
*map2
,
1358 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1363 return isl_bool_error
;
1364 if (isl_map_has_equal_params(map1
, map2
))
1365 return fn(map1
, map2
);
1366 if (isl_map_check_named_params(map1
) < 0)
1367 return isl_bool_error
;
1368 if (isl_map_check_named_params(map2
) < 0)
1369 return isl_bool_error
;
1370 map1
= isl_map_copy(map1
);
1371 map2
= isl_map_copy(map2
);
1372 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1373 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1380 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1382 struct isl_ctx
*ctx
;
1386 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1387 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1389 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1390 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1391 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1392 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1393 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1394 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1396 int j
= isl_basic_map_alloc_inequality(bmap
);
1400 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1401 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1408 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1409 bmap
->extra
- bmap
->n_div
);
1410 return bmap
->n_eq
++;
1413 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1415 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1418 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1422 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1427 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1429 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1432 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1437 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1439 if (pos
!= bmap
->n_eq
- 1) {
1441 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1442 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1448 /* Turn inequality "pos" of "bmap" into an equality.
1450 * In particular, we move the inequality in front of the equalities
1451 * and move the last inequality in the position of the moved inequality.
1452 * Note that isl_tab_make_equalities_explicit depends on this particular
1453 * change in the ordering of the constraints.
1455 void isl_basic_map_inequality_to_equality(
1456 struct isl_basic_map
*bmap
, unsigned pos
)
1460 t
= bmap
->ineq
[pos
];
1461 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1462 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1467 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1468 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1469 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1470 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1473 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1475 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1478 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1480 struct isl_ctx
*ctx
;
1484 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1485 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1486 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1487 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1488 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1489 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1490 1 + isl_basic_map_total_dim(bmap
),
1491 bmap
->extra
- bmap
->n_div
);
1492 return bmap
->n_ineq
++;
1495 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1497 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1500 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1504 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1509 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1511 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1514 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1519 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1521 if (pos
!= bmap
->n_ineq
- 1) {
1522 t
= bmap
->ineq
[pos
];
1523 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1524 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1525 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1531 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1533 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1536 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1541 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1544 k
= isl_basic_map_alloc_equality(bmap
);
1547 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1550 isl_basic_map_free(bmap
);
1554 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1557 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1560 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1565 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1568 k
= isl_basic_map_alloc_inequality(bmap
);
1571 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1574 isl_basic_map_free(bmap
);
1578 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1581 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1584 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1588 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1589 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1590 1 + 1 + isl_basic_map_total_dim(bmap
),
1591 bmap
->extra
- bmap
->n_div
);
1592 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1593 return bmap
->n_div
++;
1596 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1598 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1601 /* Check that there are "n" dimensions of type "type" starting at "first"
1604 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1605 enum isl_dim_type type
, unsigned first
, unsigned n
)
1610 return isl_stat_error
;
1611 dim
= isl_basic_map_dim(bmap
, type
);
1612 if (first
+ n
> dim
|| first
+ n
< first
)
1613 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1614 "position or range out of bounds",
1615 return isl_stat_error
);
1619 /* Insert an extra integer division, prescribed by "div", to "bmap"
1620 * at (integer division) position "pos".
1622 * The integer division is first added at the end and then moved
1623 * into the right position.
1625 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1626 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1630 bmap
= isl_basic_map_cow(bmap
);
1632 return isl_basic_map_free(bmap
);
1634 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1635 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1636 "unexpected size", return isl_basic_map_free(bmap
));
1637 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1638 return isl_basic_map_free(bmap
);
1640 bmap
= isl_basic_map_extend_space(bmap
,
1641 isl_basic_map_get_space(bmap
), 1, 0, 2);
1642 k
= isl_basic_map_alloc_div(bmap
);
1644 return isl_basic_map_free(bmap
);
1645 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1646 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1648 for (i
= k
; i
> pos
; --i
)
1649 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1654 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1657 return isl_stat_error
;
1658 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1663 /* Copy constraint from src to dst, putting the vars of src at offset
1664 * dim_off in dst and the divs of src at offset div_off in dst.
1665 * If both sets are actually map, then dim_off applies to the input
1668 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1669 struct isl_basic_map
*src_map
, isl_int
*src
,
1670 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1672 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1673 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1674 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1675 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1676 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1677 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1678 isl_int_set(dst
[0], src
[0]);
1679 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1680 if (dst_nparam
> src_nparam
)
1681 isl_seq_clr(dst
+1+src_nparam
,
1682 dst_nparam
- src_nparam
);
1683 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1684 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1686 isl_min(dst_in
-in_off
, src_in
));
1687 if (dst_in
-in_off
> src_in
)
1688 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1689 dst_in
- in_off
- src_in
);
1690 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1691 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1692 src
+1+src_nparam
+src_in
,
1693 isl_min(dst_out
-out_off
, src_out
));
1694 if (dst_out
-out_off
> src_out
)
1695 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1696 dst_out
- out_off
- src_out
);
1697 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1698 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1699 src
+1+src_nparam
+src_in
+src_out
,
1700 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1701 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1702 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1703 div_off
+src_map
->n_div
,
1704 dst_map
->n_div
- div_off
- src_map
->n_div
);
1707 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1708 struct isl_basic_map
*src_map
, isl_int
*src
,
1709 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1711 isl_int_set(dst
[0], src
[0]);
1712 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1715 static __isl_give isl_basic_map
*add_constraints(
1716 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1717 unsigned i_pos
, unsigned o_pos
)
1722 if (!bmap1
|| !bmap2
)
1725 div_off
= bmap1
->n_div
;
1727 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1728 int i1
= isl_basic_map_alloc_equality(bmap1
);
1731 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1732 i_pos
, o_pos
, div_off
);
1735 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1736 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1739 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1740 i_pos
, o_pos
, div_off
);
1743 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1744 int i1
= isl_basic_map_alloc_div(bmap1
);
1747 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1748 i_pos
, o_pos
, div_off
);
1751 isl_basic_map_free(bmap2
);
1756 isl_basic_map_free(bmap1
);
1757 isl_basic_map_free(bmap2
);
1761 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1762 struct isl_basic_set
*bset2
, unsigned pos
)
1764 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1765 bset_to_bmap(bset2
), 0, pos
));
1768 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1769 __isl_take isl_basic_map
*base
, __isl_take isl_space
*dim
,
1770 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1772 struct isl_basic_map
*ext
;
1782 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1783 base
->extra
>= base
->n_div
+ extra
;
1785 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1786 room_for_ineq(base
, n_ineq
)) {
1787 isl_space_free(dim
);
1791 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1792 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1793 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1794 extra
+= base
->extra
;
1796 n_ineq
+= base
->n_ineq
;
1798 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1804 ext
->sample
= isl_vec_copy(base
->sample
);
1805 flags
= base
->flags
;
1806 ext
= add_constraints(ext
, base
, 0, 0);
1809 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1815 isl_space_free(dim
);
1816 isl_basic_map_free(base
);
1820 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1821 __isl_take isl_space
*dim
, unsigned extra
,
1822 unsigned n_eq
, unsigned n_ineq
)
1824 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1825 dim
, extra
, n_eq
, n_ineq
));
1828 struct isl_basic_map
*isl_basic_map_extend_constraints(
1829 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1833 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1837 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1838 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1839 unsigned n_eq
, unsigned n_ineq
)
1841 struct isl_basic_map
*bmap
;
1846 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1850 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1853 isl_basic_map_free(base
);
1857 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1858 unsigned nparam
, unsigned dim
, unsigned extra
,
1859 unsigned n_eq
, unsigned n_ineq
)
1861 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1862 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1865 struct isl_basic_set
*isl_basic_set_extend_constraints(
1866 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1868 isl_basic_map
*bmap
= bset_to_bmap(base
);
1869 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1870 return bset_from_bmap(bmap
);
1873 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1875 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1878 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1883 if (bmap
->ref
> 1) {
1885 bmap
= isl_basic_map_dup(bmap
);
1888 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1889 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1894 /* Clear all cached information in "map", either because it is about
1895 * to be modified or because it is being freed.
1896 * Always return the same pointer that is passed in.
1897 * This is needed for the use in isl_map_free.
1899 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1901 isl_basic_map_free(map
->cached_simple_hull
[0]);
1902 isl_basic_map_free(map
->cached_simple_hull
[1]);
1903 map
->cached_simple_hull
[0] = NULL
;
1904 map
->cached_simple_hull
[1] = NULL
;
1908 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1910 return isl_map_cow(set
);
1913 /* Return an isl_map that is equal to "map" and that has only
1914 * a single reference.
1916 * If the original input already has only one reference, then
1917 * simply return it, but clear all cached information, since
1918 * it may be rendered invalid by the operations that will be
1919 * performed on the result.
1921 * Otherwise, create a duplicate (without any cached information).
1923 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1929 return clear_caches(map
);
1931 return isl_map_dup(map
);
1934 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1935 unsigned a_len
, unsigned b_len
)
1937 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1938 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1939 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1942 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1943 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1951 isl_assert(bmap
->ctx
,
1952 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1954 if (n1
== 0 || n2
== 0)
1957 bmap
= isl_basic_map_cow(bmap
);
1961 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1962 if (isl_blk_is_error(blk
))
1965 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1967 bmap
->eq
[i
] + pos
, n1
, n2
);
1969 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1971 bmap
->ineq
[i
] + pos
, n1
, n2
);
1973 for (i
= 0; i
< bmap
->n_div
; ++i
)
1975 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1977 isl_blk_free(bmap
->ctx
, blk
);
1979 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1980 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1981 return isl_basic_map_finalize(bmap
);
1983 isl_basic_map_free(bmap
);
1987 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
1988 __isl_take isl_basic_map
*bmap
)
1994 total
= isl_basic_map_total_dim(bmap
);
1995 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
1996 return isl_basic_map_free(bmap
);
1997 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1999 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2001 i
= isl_basic_map_alloc_equality(bmap
);
2005 isl_int_set_si(bmap
->eq
[i
][0], 1);
2006 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2007 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2008 isl_vec_free(bmap
->sample
);
2009 bmap
->sample
= NULL
;
2010 return isl_basic_map_finalize(bmap
);
2012 isl_basic_map_free(bmap
);
2016 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
2018 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2021 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2022 __isl_take isl_basic_map
*bmap
)
2027 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2030 bmap
= isl_basic_map_cow(bmap
);
2034 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2036 return isl_basic_map_finalize(bmap
);
2039 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2040 __isl_take isl_basic_set
*bset
)
2042 return isl_basic_map_set_rational(bset
);
2045 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2046 __isl_take isl_basic_set
*bset
)
2051 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2054 bset
= isl_basic_set_cow(bset
);
2058 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2060 return isl_basic_set_finalize(bset
);
2063 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2067 map
= isl_map_cow(map
);
2070 for (i
= 0; i
< map
->n
; ++i
) {
2071 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2081 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2083 return isl_map_set_rational(set
);
2086 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2089 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2091 isl_int
*t
= bmap
->div
[a
];
2092 bmap
->div
[a
] = bmap
->div
[b
];
2096 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2097 * div definitions accordingly.
2099 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
2102 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2104 swap_div(bmap
, a
, b
);
2106 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2107 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2109 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2110 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2112 for (i
= 0; i
< bmap
->n_div
; ++i
)
2113 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2114 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2117 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
2118 * div definitions accordingly.
2120 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
2122 isl_basic_map_swap_div(bset
, a
, b
);
2125 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2127 isl_seq_cpy(c
, c
+ n
, rem
);
2128 isl_seq_clr(c
+ rem
, n
);
2131 /* Drop n dimensions starting at first.
2133 * In principle, this frees up some extra variables as the number
2134 * of columns remains constant, but we would have to extend
2135 * the div array too as the number of rows in this array is assumed
2136 * to be equal to extra.
2138 struct isl_basic_set
*isl_basic_set_drop_dims(
2139 struct isl_basic_set
*bset
, unsigned first
, unsigned n
)
2141 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2144 /* Move "n" divs starting at "first" to the end of the list of divs.
2146 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2147 unsigned first
, unsigned n
)
2152 if (first
+ n
== bmap
->n_div
)
2155 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2158 for (i
= 0; i
< n
; ++i
)
2159 div
[i
] = bmap
->div
[first
+ i
];
2160 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2161 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2162 for (i
= 0; i
< n
; ++i
)
2163 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2167 isl_basic_map_free(bmap
);
2171 /* Drop "n" dimensions of type "type" starting at "first".
2173 * In principle, this frees up some extra variables as the number
2174 * of columns remains constant, but we would have to extend
2175 * the div array too as the number of rows in this array is assumed
2176 * to be equal to extra.
2178 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2179 enum isl_dim_type type
, unsigned first
, unsigned n
)
2189 dim
= isl_basic_map_dim(bmap
, type
);
2190 isl_assert(bmap
->ctx
, first
+ n
<= dim
, goto error
);
2192 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2195 bmap
= isl_basic_map_cow(bmap
);
2199 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2200 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2201 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2202 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2204 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2205 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2207 for (i
= 0; i
< bmap
->n_div
; ++i
)
2208 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2210 if (type
== isl_dim_div
) {
2211 bmap
= move_divs_last(bmap
, first
, n
);
2214 if (isl_basic_map_free_div(bmap
, n
) < 0)
2215 return isl_basic_map_free(bmap
);
2217 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2221 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2222 bmap
= isl_basic_map_simplify(bmap
);
2223 return isl_basic_map_finalize(bmap
);
2225 isl_basic_map_free(bmap
);
2229 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2230 enum isl_dim_type type
, unsigned first
, unsigned n
)
2232 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2236 struct isl_map
*isl_map_drop(struct isl_map
*map
,
2237 enum isl_dim_type type
, unsigned first
, unsigned n
)
2244 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2246 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2248 map
= isl_map_cow(map
);
2251 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2255 for (i
= 0; i
< map
->n
; ++i
) {
2256 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2260 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2268 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2269 enum isl_dim_type type
, unsigned first
, unsigned n
)
2271 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2275 * We don't cow, as the div is assumed to be redundant.
2277 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2278 __isl_take isl_basic_map
*bmap
, unsigned div
)
2286 pos
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + div
;
2288 isl_assert(bmap
->ctx
, div
< bmap
->n_div
, goto error
);
2290 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2291 constraint_drop_vars(bmap
->eq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2293 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2294 if (!isl_int_is_zero(bmap
->ineq
[i
][pos
])) {
2295 isl_basic_map_drop_inequality(bmap
, i
);
2299 constraint_drop_vars(bmap
->ineq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2302 for (i
= 0; i
< bmap
->n_div
; ++i
)
2303 constraint_drop_vars(bmap
->div
[i
]+1+pos
, 1, bmap
->extra
-div
-1);
2305 if (div
!= bmap
->n_div
- 1) {
2307 isl_int
*t
= bmap
->div
[div
];
2309 for (j
= div
; j
< bmap
->n_div
- 1; ++j
)
2310 bmap
->div
[j
] = bmap
->div
[j
+1];
2312 bmap
->div
[bmap
->n_div
- 1] = t
;
2314 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2315 if (isl_basic_map_free_div(bmap
, 1) < 0)
2316 return isl_basic_map_free(bmap
);
2320 isl_basic_map_free(bmap
);
2324 /* Eliminate the specified n dimensions starting at first from the
2325 * constraints, without removing the dimensions from the space.
2326 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2328 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2329 enum isl_dim_type type
, unsigned first
, unsigned n
)
2338 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2339 isl_die(map
->ctx
, isl_error_invalid
,
2340 "index out of bounds", goto error
);
2342 map
= isl_map_cow(map
);
2346 for (i
= 0; i
< map
->n
; ++i
) {
2347 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2357 /* Eliminate the specified n dimensions starting at first from the
2358 * constraints, without removing the dimensions from the space.
2359 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2361 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2362 enum isl_dim_type type
, unsigned first
, unsigned n
)
2364 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2367 /* Eliminate the specified n dimensions starting at first from the
2368 * constraints, without removing the dimensions from the space.
2369 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2371 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2372 unsigned first
, unsigned n
)
2374 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2377 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2378 __isl_take isl_basic_map
*bmap
)
2382 bmap
= isl_basic_map_eliminate_vars(bmap
,
2383 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2387 return isl_basic_map_finalize(bmap
);
2390 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2391 __isl_take isl_basic_set
*bset
)
2393 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2396 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2405 map
= isl_map_cow(map
);
2409 for (i
= 0; i
< map
->n
; ++i
) {
2410 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2420 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2422 return isl_map_remove_divs(set
);
2425 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2426 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2427 unsigned first
, unsigned n
)
2429 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2430 return isl_basic_map_free(bmap
);
2431 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2433 bmap
= isl_basic_map_eliminate_vars(bmap
,
2434 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2437 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2439 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2443 /* Return true if the definition of the given div (recursively) involves
2444 * any of the given variables.
2446 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2447 unsigned first
, unsigned n
)
2450 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2452 if (isl_int_is_zero(bmap
->div
[div
][0]))
2453 return isl_bool_false
;
2454 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2455 return isl_bool_true
;
2457 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2460 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2462 involves
= div_involves_vars(bmap
, i
, first
, n
);
2463 if (involves
< 0 || involves
)
2467 return isl_bool_false
;
2470 /* Try and add a lower and/or upper bound on "div" to "bmap"
2471 * based on inequality "i".
2472 * "total" is the total number of variables (excluding the divs).
2473 * "v" is a temporary object that can be used during the calculations.
2474 * If "lb" is set, then a lower bound should be constructed.
2475 * If "ub" is set, then an upper bound should be constructed.
2477 * The calling function has already checked that the inequality does not
2478 * reference "div", but we still need to check that the inequality is
2479 * of the right form. We'll consider the case where we want to construct
2480 * a lower bound. The construction of upper bounds is similar.
2482 * Let "div" be of the form
2484 * q = floor((a + f(x))/d)
2486 * We essentially check if constraint "i" is of the form
2490 * so that we can use it to derive a lower bound on "div".
2491 * However, we allow a slightly more general form
2495 * with the condition that the coefficients of g(x) - f(x) are all
2497 * Rewriting this constraint as
2501 * adding a + f(x) to both sides and dividing by d, we obtain
2503 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2505 * Taking the floor on both sides, we obtain
2507 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2511 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2513 * In the case of an upper bound, we construct the constraint
2515 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2518 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2519 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2520 unsigned total
, isl_int v
, int lb
, int ub
)
2524 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2526 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2527 bmap
->div
[div
][1 + 1 + j
]);
2528 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2531 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2532 bmap
->div
[div
][1 + 1 + j
]);
2533 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2539 bmap
= isl_basic_map_cow(bmap
);
2540 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2542 int k
= isl_basic_map_alloc_inequality(bmap
);
2545 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2546 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2547 bmap
->div
[div
][1 + j
]);
2548 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2549 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2551 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2554 int k
= isl_basic_map_alloc_inequality(bmap
);
2557 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2558 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2559 bmap
->div
[div
][1 + j
]);
2560 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2561 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2563 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2566 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2569 isl_basic_map_free(bmap
);
2573 /* This function is called right before "div" is eliminated from "bmap"
2574 * using Fourier-Motzkin.
2575 * Look through the constraints of "bmap" for constraints on the argument
2576 * of the integer division and use them to construct constraints on the
2577 * integer division itself. These constraints can then be combined
2578 * during the Fourier-Motzkin elimination.
2579 * Note that it is only useful to introduce lower bounds on "div"
2580 * if "bmap" already contains upper bounds on "div" as the newly
2581 * introduce lower bounds can then be combined with the pre-existing
2582 * upper bounds. Similarly for upper bounds.
2583 * We therefore first check if "bmap" contains any lower and/or upper bounds
2586 * It is interesting to note that the introduction of these constraints
2587 * can indeed lead to more accurate results, even when compared to
2588 * deriving constraints on the argument of "div" from constraints on "div".
2589 * Consider, for example, the set
2591 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2593 * The second constraint can be rewritten as
2595 * 2 * [(-i-2j+3)/4] + k >= 0
2597 * from which we can derive
2599 * -i - 2j + 3 >= -2k
2605 * Combined with the first constraint, we obtain
2607 * -3 <= 3 + 2k or k >= -3
2609 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2610 * the first constraint, we obtain
2612 * [(i + 2j)/4] >= [-3/4] = -1
2614 * Combining this constraint with the second constraint, we obtain
2618 static __isl_give isl_basic_map
*insert_bounds_on_div(
2619 __isl_take isl_basic_map
*bmap
, int div
)
2622 int check_lb
, check_ub
;
2629 if (isl_int_is_zero(bmap
->div
[div
][0]))
2632 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2636 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2637 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2644 if (!check_lb
&& !check_ub
)
2649 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2650 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2653 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2654 check_lb
, check_ub
);
2662 /* Remove all divs (recursively) involving any of the given dimensions
2663 * in their definitions.
2665 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2666 __isl_take isl_basic_map
*bmap
,
2667 enum isl_dim_type type
, unsigned first
, unsigned n
)
2671 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2672 return isl_basic_map_free(bmap
);
2673 first
+= isl_basic_map_offset(bmap
, type
);
2675 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2678 involves
= div_involves_vars(bmap
, i
, first
, n
);
2680 return isl_basic_map_free(bmap
);
2683 bmap
= insert_bounds_on_div(bmap
, i
);
2684 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2693 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2694 __isl_take isl_basic_set
*bset
,
2695 enum isl_dim_type type
, unsigned first
, unsigned n
)
2697 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2700 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2701 enum isl_dim_type type
, unsigned first
, unsigned n
)
2710 map
= isl_map_cow(map
);
2714 for (i
= 0; i
< map
->n
; ++i
) {
2715 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2726 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2727 enum isl_dim_type type
, unsigned first
, unsigned n
)
2729 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2733 /* Does the description of "bmap" depend on the specified dimensions?
2734 * We also check whether the dimensions appear in any of the div definitions.
2735 * In principle there is no need for this check. If the dimensions appear
2736 * in a div definition, they also appear in the defining constraints of that
2739 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2740 enum isl_dim_type type
, unsigned first
, unsigned n
)
2744 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2745 return isl_bool_error
;
2747 first
+= isl_basic_map_offset(bmap
, type
);
2748 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2749 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2750 return isl_bool_true
;
2751 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2752 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2753 return isl_bool_true
;
2754 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2755 if (isl_int_is_zero(bmap
->div
[i
][0]))
2757 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2758 return isl_bool_true
;
2761 return isl_bool_false
;
2764 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2765 enum isl_dim_type type
, unsigned first
, unsigned n
)
2770 return isl_bool_error
;
2772 if (first
+ n
> isl_map_dim(map
, type
))
2773 isl_die(map
->ctx
, isl_error_invalid
,
2774 "index out of bounds", return isl_bool_error
);
2776 for (i
= 0; i
< map
->n
; ++i
) {
2777 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2779 if (involves
< 0 || involves
)
2783 return isl_bool_false
;
2786 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2787 enum isl_dim_type type
, unsigned first
, unsigned n
)
2789 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2792 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2793 enum isl_dim_type type
, unsigned first
, unsigned n
)
2795 return isl_map_involves_dims(set
, type
, first
, n
);
2798 /* Drop all constraints in bmap that involve any of the dimensions
2799 * first to first+n-1.
2801 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2802 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2809 bmap
= isl_basic_map_cow(bmap
);
2814 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2815 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2817 isl_basic_map_drop_equality(bmap
, i
);
2820 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2821 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2823 isl_basic_map_drop_inequality(bmap
, i
);
2826 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2830 /* Drop all constraints in bset that involve any of the dimensions
2831 * first to first+n-1.
2833 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2834 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2836 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2839 /* Drop all constraints in bmap that do not involve any of the dimensions
2840 * first to first + n - 1 of the given type.
2842 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2843 __isl_take isl_basic_map
*bmap
,
2844 enum isl_dim_type type
, unsigned first
, unsigned n
)
2849 isl_space
*space
= isl_basic_map_get_space(bmap
);
2850 isl_basic_map_free(bmap
);
2851 return isl_basic_map_universe(space
);
2853 bmap
= isl_basic_map_cow(bmap
);
2857 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2858 return isl_basic_map_free(bmap
);
2860 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2862 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2863 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2865 isl_basic_map_drop_equality(bmap
, i
);
2868 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2869 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2871 isl_basic_map_drop_inequality(bmap
, i
);
2874 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2878 /* Drop all constraints in bset that do not involve any of the dimensions
2879 * first to first + n - 1 of the given type.
2881 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2882 __isl_take isl_basic_set
*bset
,
2883 enum isl_dim_type type
, unsigned first
, unsigned n
)
2885 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2889 /* Drop all constraints in bmap that involve any of the dimensions
2890 * first to first + n - 1 of the given type.
2892 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2893 __isl_take isl_basic_map
*bmap
,
2894 enum isl_dim_type type
, unsigned first
, unsigned n
)
2901 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2902 return isl_basic_map_free(bmap
);
2904 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2905 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2906 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2909 /* Drop all constraints in bset that involve any of the dimensions
2910 * first to first + n - 1 of the given type.
2912 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2913 __isl_take isl_basic_set
*bset
,
2914 enum isl_dim_type type
, unsigned first
, unsigned n
)
2916 return isl_basic_map_drop_constraints_involving_dims(bset
,
2920 /* Drop constraints from "map" by applying "drop" to each basic map.
2922 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2923 enum isl_dim_type type
, unsigned first
, unsigned n
,
2924 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2925 enum isl_dim_type type
, unsigned first
, unsigned n
))
2933 dim
= isl_map_dim(map
, type
);
2934 if (first
+ n
> dim
|| first
+ n
< first
)
2935 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2936 "index out of bounds", return isl_map_free(map
));
2938 map
= isl_map_cow(map
);
2942 for (i
= 0; i
< map
->n
; ++i
) {
2943 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
2945 return isl_map_free(map
);
2949 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2954 /* Drop all constraints in map that involve any of the dimensions
2955 * first to first + n - 1 of the given type.
2957 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
2958 __isl_take isl_map
*map
,
2959 enum isl_dim_type type
, unsigned first
, unsigned n
)
2963 return drop_constraints(map
, type
, first
, n
,
2964 &isl_basic_map_drop_constraints_involving_dims
);
2967 /* Drop all constraints in "map" that do not involve any of the dimensions
2968 * first to first + n - 1 of the given type.
2970 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
2971 __isl_take isl_map
*map
,
2972 enum isl_dim_type type
, unsigned first
, unsigned n
)
2975 isl_space
*space
= isl_map_get_space(map
);
2977 return isl_map_universe(space
);
2979 return drop_constraints(map
, type
, first
, n
,
2980 &isl_basic_map_drop_constraints_not_involving_dims
);
2983 /* Drop all constraints in set that involve any of the dimensions
2984 * first to first + n - 1 of the given type.
2986 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
2987 __isl_take isl_set
*set
,
2988 enum isl_dim_type type
, unsigned first
, unsigned n
)
2990 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
2993 /* Drop all constraints in "set" that do not involve any of the dimensions
2994 * first to first + n - 1 of the given type.
2996 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
2997 __isl_take isl_set
*set
,
2998 enum isl_dim_type type
, unsigned first
, unsigned n
)
3000 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3003 /* Does local variable "div" of "bmap" have a complete explicit representation?
3004 * Having a complete explicit representation requires not only
3005 * an explicit representation, but also that all local variables
3006 * that appear in this explicit representation in turn have
3007 * a complete explicit representation.
3009 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3012 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3015 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3016 if (marked
< 0 || marked
)
3017 return isl_bool_not(marked
);
3019 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3022 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3024 known
= isl_basic_map_div_is_known(bmap
, i
);
3025 if (known
< 0 || !known
)
3029 return isl_bool_true
;
3032 /* Remove all divs that are unknown or defined in terms of unknown divs.
3034 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3035 __isl_take isl_basic_map
*bmap
)
3042 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3043 if (isl_basic_map_div_is_known(bmap
, i
))
3045 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3054 /* Remove all divs that are unknown or defined in terms of unknown divs.
3056 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3057 __isl_take isl_basic_set
*bset
)
3059 return isl_basic_map_remove_unknown_divs(bset
);
3062 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3071 map
= isl_map_cow(map
);
3075 for (i
= 0; i
< map
->n
; ++i
) {
3076 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3086 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3088 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3091 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3092 __isl_take isl_basic_set
*bset
,
3093 enum isl_dim_type type
, unsigned first
, unsigned n
)
3095 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3096 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3097 return bset_from_bmap(bmap
);
3100 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
3101 enum isl_dim_type type
, unsigned first
, unsigned n
)
3108 map
= isl_map_cow(map
);
3111 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3113 for (i
= 0; i
< map
->n
; ++i
) {
3114 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3115 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3119 map
= isl_map_drop(map
, type
, first
, n
);
3126 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3127 enum isl_dim_type type
, unsigned first
, unsigned n
)
3129 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3133 /* Project out n inputs starting at first using Fourier-Motzkin */
3134 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3135 unsigned first
, unsigned n
)
3137 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3140 static void dump_term(struct isl_basic_map
*bmap
,
3141 isl_int c
, int pos
, FILE *out
)
3144 unsigned in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3145 unsigned dim
= in
+ isl_basic_map_dim(bmap
, isl_dim_out
);
3146 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3148 isl_int_print(out
, c
, 0);
3150 if (!isl_int_is_one(c
))
3151 isl_int_print(out
, c
, 0);
3152 if (pos
< 1 + nparam
) {
3153 name
= isl_space_get_dim_name(bmap
->dim
,
3154 isl_dim_param
, pos
- 1);
3156 fprintf(out
, "%s", name
);
3158 fprintf(out
, "p%d", pos
- 1);
3159 } else if (pos
< 1 + nparam
+ in
)
3160 fprintf(out
, "i%d", pos
- 1 - nparam
);
3161 else if (pos
< 1 + nparam
+ dim
)
3162 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
3164 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
3168 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
3169 int sign
, FILE *out
)
3173 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
3177 for (i
= 0, first
= 1; i
< len
; ++i
) {
3178 if (isl_int_sgn(c
[i
]) * sign
<= 0)
3181 fprintf(out
, " + ");
3183 isl_int_abs(v
, c
[i
]);
3184 dump_term(bmap
, v
, i
, out
);
3191 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
3192 const char *op
, FILE *out
, int indent
)
3196 fprintf(out
, "%*s", indent
, "");
3198 dump_constraint_sign(bmap
, c
, 1, out
);
3199 fprintf(out
, " %s ", op
);
3200 dump_constraint_sign(bmap
, c
, -1, out
);
3204 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
3205 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
3207 fprintf(out
, "%*s", indent
, "");
3208 fprintf(out
, "ERROR: unused div coefficient not zero\n");
3213 static void dump_constraints(struct isl_basic_map
*bmap
,
3214 isl_int
**c
, unsigned n
,
3215 const char *op
, FILE *out
, int indent
)
3219 for (i
= 0; i
< n
; ++i
)
3220 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
3223 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
3227 unsigned total
= isl_basic_map_total_dim(bmap
);
3229 for (j
= 0; j
< 1 + total
; ++j
) {
3230 if (isl_int_is_zero(exp
[j
]))
3232 if (!first
&& isl_int_is_pos(exp
[j
]))
3234 dump_term(bmap
, exp
[j
], j
, out
);
3239 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
3243 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
3244 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
3246 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3247 fprintf(out
, "%*s", indent
, "");
3248 fprintf(out
, "e%d = [(", i
);
3249 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
3251 isl_int_print(out
, bmap
->div
[i
][0], 0);
3252 fprintf(out
, "]\n");
3256 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3257 FILE *out
, int indent
)
3260 fprintf(out
, "null basic set\n");
3264 fprintf(out
, "%*s", indent
, "");
3265 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3266 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3267 bset
->extra
, bset
->flags
);
3268 dump(bset_to_bmap(bset
), out
, indent
);
3271 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3272 FILE *out
, int indent
)
3275 fprintf(out
, "null basic map\n");
3279 fprintf(out
, "%*s", indent
, "");
3280 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3281 "flags: %x, n_name: %d\n",
3283 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3284 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3285 dump(bmap
, out
, indent
);
3288 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
3293 total
= isl_basic_map_total_dim(bmap
);
3294 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
3295 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3296 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3297 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3301 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3306 if (isl_space_dim(space
, isl_dim_in
) != 0)
3307 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3308 "set cannot have input dimensions", goto error
);
3309 return isl_map_alloc_space(space
, n
, flags
);
3311 isl_space_free(space
);
3315 /* Make sure "map" has room for at least "n" more basic maps.
3317 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
3320 struct isl_map
*grown
= NULL
;
3324 isl_assert(map
->ctx
, n
>= 0, goto error
);
3325 if (map
->n
+ n
<= map
->size
)
3327 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3330 for (i
= 0; i
< map
->n
; ++i
) {
3331 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3339 isl_map_free(grown
);
3344 /* Make sure "set" has room for at least "n" more basic sets.
3346 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3348 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3351 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3353 return isl_map_from_basic_map(bset
);
3356 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
3358 struct isl_map
*map
;
3363 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3364 return isl_map_add_basic_map(map
, bmap
);
3367 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3368 __isl_take isl_basic_set
*bset
)
3370 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3371 bset_to_bmap(bset
)));
3374 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3376 return isl_map_free(set
);
3379 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3384 fprintf(out
, "null set\n");
3388 fprintf(out
, "%*s", indent
, "");
3389 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3390 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3392 for (i
= 0; i
< set
->n
; ++i
) {
3393 fprintf(out
, "%*s", indent
, "");
3394 fprintf(out
, "basic set %d:\n", i
);
3395 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3399 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3404 fprintf(out
, "null map\n");
3408 fprintf(out
, "%*s", indent
, "");
3409 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3410 "flags: %x, n_name: %d\n",
3411 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3412 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3413 for (i
= 0; i
< map
->n
; ++i
) {
3414 fprintf(out
, "%*s", indent
, "");
3415 fprintf(out
, "basic map %d:\n", i
);
3416 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3420 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3421 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3423 struct isl_basic_map
*bmap_domain
;
3425 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3428 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3429 isl_assert(bset
->ctx
,
3430 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3432 bmap
= isl_basic_map_cow(bmap
);
3435 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3436 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3437 bmap_domain
= isl_basic_map_from_domain(bset
);
3438 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3440 bmap
= isl_basic_map_simplify(bmap
);
3441 return isl_basic_map_finalize(bmap
);
3443 isl_basic_map_free(bmap
);
3444 isl_basic_set_free(bset
);
3448 /* Check that the space of "bset" is the same as that of the range of "bmap".
3450 static isl_stat
isl_basic_map_check_compatible_range(
3451 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3455 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3457 return isl_stat_error
;
3459 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3460 "incompatible spaces", return isl_stat_error
);
3465 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3466 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3468 struct isl_basic_map
*bmap_range
;
3470 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3473 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3474 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3477 if (isl_basic_set_plain_is_universe(bset
)) {
3478 isl_basic_set_free(bset
);
3482 bmap
= isl_basic_map_cow(bmap
);
3485 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3486 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3487 bmap_range
= bset_to_bmap(bset
);
3488 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3490 bmap
= isl_basic_map_simplify(bmap
);
3491 return isl_basic_map_finalize(bmap
);
3493 isl_basic_map_free(bmap
);
3494 isl_basic_set_free(bset
);
3498 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3499 __isl_keep isl_vec
*vec
)
3506 return isl_bool_error
;
3508 total
= 1 + isl_basic_map_total_dim(bmap
);
3509 if (total
!= vec
->size
)
3510 return isl_bool_false
;
3514 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3515 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3516 if (!isl_int_is_zero(s
)) {
3518 return isl_bool_false
;
3522 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3523 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3524 if (isl_int_is_neg(s
)) {
3526 return isl_bool_false
;
3532 return isl_bool_true
;
3535 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3536 __isl_keep isl_vec
*vec
)
3538 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3541 __isl_give isl_basic_map
*isl_basic_map_intersect(
3542 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3544 struct isl_vec
*sample
= NULL
;
3546 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3548 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3549 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3550 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3551 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3552 return isl_basic_map_intersect(bmap2
, bmap1
);
3554 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3555 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3556 isl_assert(bmap1
->ctx
,
3557 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3559 if (isl_basic_map_plain_is_empty(bmap1
)) {
3560 isl_basic_map_free(bmap2
);
3563 if (isl_basic_map_plain_is_empty(bmap2
)) {
3564 isl_basic_map_free(bmap1
);
3568 if (bmap1
->sample
&&
3569 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3570 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3571 sample
= isl_vec_copy(bmap1
->sample
);
3572 else if (bmap2
->sample
&&
3573 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3574 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3575 sample
= isl_vec_copy(bmap2
->sample
);
3577 bmap1
= isl_basic_map_cow(bmap1
);
3580 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3581 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3582 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3585 isl_vec_free(sample
);
3587 isl_vec_free(bmap1
->sample
);
3588 bmap1
->sample
= sample
;
3591 bmap1
= isl_basic_map_simplify(bmap1
);
3592 return isl_basic_map_finalize(bmap1
);
3595 isl_vec_free(sample
);
3596 isl_basic_map_free(bmap1
);
3597 isl_basic_map_free(bmap2
);
3601 struct isl_basic_set
*isl_basic_set_intersect(
3602 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3604 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3605 bset_to_bmap(bset2
)));
3608 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3609 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3611 return isl_basic_set_intersect(bset1
, bset2
);
3614 /* Special case of isl_map_intersect, where both map1 and map2
3615 * are convex, without any divs and such that either map1 or map2
3616 * contains a single constraint. This constraint is then simply
3617 * added to the other map.
3619 static __isl_give isl_map
*map_intersect_add_constraint(
3620 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3622 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3623 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3624 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3625 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3627 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3628 return isl_map_intersect(map2
, map1
);
3630 map1
= isl_map_cow(map1
);
3633 if (isl_map_plain_is_empty(map1
)) {
3637 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3638 if (map2
->p
[0]->n_eq
== 1)
3639 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3641 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3642 map2
->p
[0]->ineq
[0]);
3644 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3645 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3649 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3650 isl_basic_map_free(map1
->p
[0]);
3663 /* map2 may be either a parameter domain or a map living in the same
3666 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3667 __isl_take isl_map
*map2
)
3676 if ((isl_map_plain_is_empty(map1
) ||
3677 isl_map_plain_is_universe(map2
)) &&
3678 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3682 if ((isl_map_plain_is_empty(map2
) ||
3683 isl_map_plain_is_universe(map1
)) &&
3684 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3689 if (map1
->n
== 1 && map2
->n
== 1 &&
3690 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3691 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3692 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3693 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3694 return map_intersect_add_constraint(map1
, map2
);
3696 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3697 isl_space_dim(map2
->dim
, isl_dim_param
))
3698 isl_assert(map1
->ctx
,
3699 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3701 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3702 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3703 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3705 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3706 map1
->n
* map2
->n
, flags
);
3709 for (i
= 0; i
< map1
->n
; ++i
)
3710 for (j
= 0; j
< map2
->n
; ++j
) {
3711 struct isl_basic_map
*part
;
3712 part
= isl_basic_map_intersect(
3713 isl_basic_map_copy(map1
->p
[i
]),
3714 isl_basic_map_copy(map2
->p
[j
]));
3715 if (isl_basic_map_is_empty(part
) < 0)
3716 part
= isl_basic_map_free(part
);
3717 result
= isl_map_add_basic_map(result
, part
);
3730 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3731 __isl_take isl_map
*map2
)
3735 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3736 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3737 "spaces don't match", goto error
);
3738 return map_intersect_internal(map1
, map2
);
3745 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3746 __isl_take isl_map
*map2
)
3748 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3751 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3753 return set_from_map(isl_map_intersect(set_to_map(set1
),
3757 /* map_intersect_internal accepts intersections
3758 * with parameter domains, so we can just call that function.
3760 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3761 __isl_take isl_set
*params
)
3763 return map_intersect_internal(map
, params
);
3766 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3767 __isl_take isl_map
*map2
)
3769 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3772 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3773 __isl_take isl_set
*params
)
3775 return isl_map_intersect_params(set
, params
);
3778 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3781 unsigned pos
, n1
, n2
;
3785 bmap
= isl_basic_map_cow(bmap
);
3788 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3789 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3790 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3791 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3792 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3793 return isl_basic_map_reset_space(bmap
, space
);
3796 static __isl_give isl_basic_map
*basic_map_space_reset(
3797 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3803 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3806 space
= isl_basic_map_get_space(bmap
);
3807 space
= isl_space_reset(space
, type
);
3808 bmap
= isl_basic_map_reset_space(bmap
, space
);
3812 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3813 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3814 unsigned pos
, unsigned n
)
3818 struct isl_basic_map
*res
;
3819 struct isl_dim_map
*dim_map
;
3820 unsigned total
, off
;
3821 enum isl_dim_type t
;
3824 return basic_map_space_reset(bmap
, type
);
3829 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3831 total
= isl_basic_map_total_dim(bmap
) + n
;
3832 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3834 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3836 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3838 unsigned size
= isl_basic_map_dim(bmap
, t
);
3839 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3841 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3842 pos
, size
- pos
, off
+ pos
+ n
);
3844 off
+= isl_space_dim(res_dim
, t
);
3846 isl_dim_map_div(dim_map
, bmap
, off
);
3848 res
= isl_basic_map_alloc_space(res_dim
,
3849 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3850 rational
= isl_basic_map_is_rational(bmap
);
3852 res
= isl_basic_map_free(res
);
3854 res
= isl_basic_map_set_rational(res
);
3855 if (isl_basic_map_plain_is_empty(bmap
)) {
3856 isl_basic_map_free(bmap
);
3858 return isl_basic_map_set_to_empty(res
);
3860 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3861 return isl_basic_map_finalize(res
);
3864 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3865 __isl_take isl_basic_set
*bset
,
3866 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3868 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3871 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3872 enum isl_dim_type type
, unsigned n
)
3876 return isl_basic_map_insert_dims(bmap
, type
,
3877 isl_basic_map_dim(bmap
, type
), n
);
3880 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3881 enum isl_dim_type type
, unsigned n
)
3885 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3886 return isl_basic_map_add_dims(bset
, type
, n
);
3888 isl_basic_set_free(bset
);
3892 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3893 enum isl_dim_type type
)
3897 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3900 space
= isl_map_get_space(map
);
3901 space
= isl_space_reset(space
, type
);
3902 map
= isl_map_reset_space(map
, space
);
3906 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3907 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3912 return map_space_reset(map
, type
);
3914 map
= isl_map_cow(map
);
3918 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3922 for (i
= 0; i
< map
->n
; ++i
) {
3923 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3934 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3935 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3937 return isl_map_insert_dims(set
, type
, pos
, n
);
3940 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3941 enum isl_dim_type type
, unsigned n
)
3945 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3948 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3949 enum isl_dim_type type
, unsigned n
)
3953 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3954 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
3960 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3961 __isl_take isl_basic_map
*bmap
,
3962 enum isl_dim_type dst_type
, unsigned dst_pos
,
3963 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3965 struct isl_dim_map
*dim_map
;
3966 struct isl_basic_map
*res
;
3967 enum isl_dim_type t
;
3968 unsigned total
, off
;
3973 bmap
= isl_basic_map_reset(bmap
, src_type
);
3974 bmap
= isl_basic_map_reset(bmap
, dst_type
);
3978 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
3979 return isl_basic_map_free(bmap
);
3981 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3984 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3986 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3987 pos(bmap
->dim
, src_type
) + src_pos
+
3988 ((src_type
< dst_type
) ? n
: 0)) {
3989 bmap
= isl_basic_map_cow(bmap
);
3993 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3994 src_type
, src_pos
, n
);
3998 bmap
= isl_basic_map_finalize(bmap
);
4003 total
= isl_basic_map_total_dim(bmap
);
4004 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4007 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4008 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4009 if (t
== dst_type
) {
4010 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4013 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
4016 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4017 dst_pos
, size
- dst_pos
, off
);
4018 off
+= size
- dst_pos
;
4019 } else if (t
== src_type
) {
4020 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4023 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4024 src_pos
+ n
, size
- src_pos
- n
, off
);
4025 off
+= size
- src_pos
- n
;
4027 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4031 isl_dim_map_div(dim_map
, bmap
, off
);
4033 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4034 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4035 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4039 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4040 src_type
, src_pos
, n
);
4044 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4045 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4046 bmap
= isl_basic_map_finalize(bmap
);
4050 isl_basic_map_free(bmap
);
4054 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4055 enum isl_dim_type dst_type
, unsigned dst_pos
,
4056 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4058 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4059 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4060 src_type
, src_pos
, n
);
4061 return bset_from_bmap(bmap
);
4064 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4065 enum isl_dim_type dst_type
, unsigned dst_pos
,
4066 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4070 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4071 return set_from_map(isl_map_move_dims(set_to_map(set
),
4072 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4078 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4079 enum isl_dim_type dst_type
, unsigned dst_pos
,
4080 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4087 map
= isl_map_reset(map
, src_type
);
4088 map
= isl_map_reset(map
, dst_type
);
4092 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
4095 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4098 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4100 map
= isl_map_cow(map
);
4104 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4108 for (i
= 0; i
< map
->n
; ++i
) {
4109 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4111 src_type
, src_pos
, n
);
4122 /* Move the specified dimensions to the last columns right before
4123 * the divs. Don't change the dimension specification of bmap.
4124 * That's the responsibility of the caller.
4126 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4127 enum isl_dim_type type
, unsigned first
, unsigned n
)
4129 struct isl_dim_map
*dim_map
;
4130 struct isl_basic_map
*res
;
4131 enum isl_dim_type t
;
4132 unsigned total
, off
;
4136 if (pos(bmap
->dim
, type
) + first
+ n
==
4137 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
4140 total
= isl_basic_map_total_dim(bmap
);
4141 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4144 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4145 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4147 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4150 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4151 first
, n
, total
- bmap
->n_div
- n
);
4152 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4153 first
+ n
, size
- (first
+ n
), off
);
4154 off
+= size
- (first
+ n
);
4156 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4160 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4162 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4163 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4164 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4168 /* Insert "n" rows in the divs of "bmap".
4170 * The number of columns is not changed, which means that the last
4171 * dimensions of "bmap" are being reintepreted as the new divs.
4172 * The space of "bmap" is not adjusted, however, which means
4173 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4174 * from the space of "bmap" is the responsibility of the caller.
4176 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4184 bmap
= isl_basic_map_cow(bmap
);
4188 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
4189 old
= bmap
->block2
.data
;
4190 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4191 (bmap
->extra
+ n
) * (1 + row_size
));
4192 if (!bmap
->block2
.data
)
4193 return isl_basic_map_free(bmap
);
4194 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4196 return isl_basic_map_free(bmap
);
4197 for (i
= 0; i
< n
; ++i
) {
4198 new_div
[i
] = bmap
->block2
.data
+
4199 (bmap
->extra
+ i
) * (1 + row_size
);
4200 isl_seq_clr(new_div
[i
], 1 + row_size
);
4202 for (i
= 0; i
< bmap
->extra
; ++i
)
4203 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4205 bmap
->div
= new_div
;
4212 /* Drop constraints from "bmap" that only involve the variables
4213 * of "type" in the range [first, first + n] that are not related
4214 * to any of the variables outside that interval.
4215 * These constraints cannot influence the values for the variables
4216 * outside the interval, except in case they cause "bmap" to be empty.
4217 * Only drop the constraints if "bmap" is known to be non-empty.
4219 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4220 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4221 unsigned first
, unsigned n
)
4225 unsigned dim
, n_div
;
4228 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4230 return isl_basic_map_free(bmap
);
4234 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4235 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4236 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4238 return isl_basic_map_free(bmap
);
4239 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4240 for (i
= 0; i
< first
; ++i
)
4242 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4245 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4250 /* Turn the n dimensions of type type, starting at first
4251 * into existentially quantified variables.
4253 * If a subset of the projected out variables are unrelated
4254 * to any of the variables that remain, then the constraints
4255 * involving this subset are simply dropped first.
4257 __isl_give isl_basic_map
*isl_basic_map_project_out(
4258 __isl_take isl_basic_map
*bmap
,
4259 enum isl_dim_type type
, unsigned first
, unsigned n
)
4264 return basic_map_space_reset(bmap
, type
);
4265 if (type
== isl_dim_div
)
4266 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4267 "cannot project out existentially quantified variables",
4268 return isl_basic_map_free(bmap
));
4270 empty
= isl_basic_map_plain_is_empty(bmap
);
4272 return isl_basic_map_free(bmap
);
4274 bmap
= isl_basic_map_set_to_empty(bmap
);
4276 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4280 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4281 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4283 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4284 return isl_basic_map_free(bmap
);
4286 bmap
= move_last(bmap
, type
, first
, n
);
4287 bmap
= isl_basic_map_cow(bmap
);
4288 bmap
= insert_div_rows(bmap
, n
);
4292 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4295 bmap
= isl_basic_map_simplify(bmap
);
4296 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4297 return isl_basic_map_finalize(bmap
);
4299 isl_basic_map_free(bmap
);
4303 /* Turn the n dimensions of type type, starting at first
4304 * into existentially quantified variables.
4306 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4307 enum isl_dim_type type
, unsigned first
, unsigned n
)
4309 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4313 /* Turn the n dimensions of type type, starting at first
4314 * into existentially quantified variables.
4316 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4317 enum isl_dim_type type
, unsigned first
, unsigned n
)
4325 return map_space_reset(map
, type
);
4327 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
4329 map
= isl_map_cow(map
);
4333 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4337 for (i
= 0; i
< map
->n
; ++i
) {
4338 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4349 /* Turn the n dimensions of type type, starting at first
4350 * into existentially quantified variables.
4352 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4353 enum isl_dim_type type
, unsigned first
, unsigned n
)
4355 return set_from_map(isl_map_project_out(set_to_map(set
),
4359 /* Return a map that projects the elements in "set" onto their
4360 * "n" set dimensions starting at "first".
4361 * "type" should be equal to isl_dim_set.
4363 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4364 enum isl_dim_type type
, unsigned first
, unsigned n
)
4372 if (type
!= isl_dim_set
)
4373 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4374 "only set dimensions can be projected out", goto error
);
4375 dim
= isl_set_dim(set
, isl_dim_set
);
4376 if (first
+ n
> dim
|| first
+ n
< first
)
4377 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4378 "index out of bounds", goto error
);
4380 map
= isl_map_from_domain(set
);
4381 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4382 for (i
= 0; i
< n
; ++i
)
4383 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4391 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
4395 for (i
= 0; i
< n
; ++i
) {
4396 j
= isl_basic_map_alloc_div(bmap
);
4399 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4403 isl_basic_map_free(bmap
);
4407 struct isl_basic_map
*isl_basic_map_apply_range(
4408 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4410 isl_space
*dim_result
= NULL
;
4411 struct isl_basic_map
*bmap
;
4412 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4413 struct isl_dim_map
*dim_map1
, *dim_map2
;
4415 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4417 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4418 bmap2
->dim
, isl_dim_in
))
4419 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4420 "spaces don't match", goto error
);
4422 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4423 isl_space_copy(bmap2
->dim
));
4425 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4426 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4427 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4428 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4430 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4431 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4432 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4433 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4434 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4435 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4436 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4437 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4438 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4439 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4440 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4442 bmap
= isl_basic_map_alloc_space(dim_result
,
4443 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4444 bmap1
->n_eq
+ bmap2
->n_eq
,
4445 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4446 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4447 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4448 bmap
= add_divs(bmap
, n
);
4449 bmap
= isl_basic_map_simplify(bmap
);
4450 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4451 return isl_basic_map_finalize(bmap
);
4453 isl_basic_map_free(bmap1
);
4454 isl_basic_map_free(bmap2
);
4458 struct isl_basic_set
*isl_basic_set_apply(
4459 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4464 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4467 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4470 isl_basic_set_free(bset
);
4471 isl_basic_map_free(bmap
);
4475 struct isl_basic_map
*isl_basic_map_apply_domain(
4476 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4478 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4480 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4481 bmap2
->dim
, isl_dim_in
))
4482 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4483 "spaces don't match", goto error
);
4485 bmap1
= isl_basic_map_reverse(bmap1
);
4486 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4487 return isl_basic_map_reverse(bmap1
);
4489 isl_basic_map_free(bmap1
);
4490 isl_basic_map_free(bmap2
);
4494 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4495 * A \cap B -> f(A) + f(B)
4497 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4498 __isl_take isl_basic_map
*bmap2
)
4500 unsigned n_in
, n_out
, nparam
, total
, pos
;
4501 struct isl_basic_map
*bmap
= NULL
;
4502 struct isl_dim_map
*dim_map1
, *dim_map2
;
4505 if (!bmap1
|| !bmap2
)
4508 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4511 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4512 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4513 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4515 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4516 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4517 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4518 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4519 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4520 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4521 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4522 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4523 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4524 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4525 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4527 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4528 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4529 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4530 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4531 for (i
= 0; i
< n_out
; ++i
) {
4532 int j
= isl_basic_map_alloc_equality(bmap
);
4535 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4536 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4537 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4538 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4540 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4541 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4542 bmap
= add_divs(bmap
, 2 * n_out
);
4544 bmap
= isl_basic_map_simplify(bmap
);
4545 return isl_basic_map_finalize(bmap
);
4547 isl_basic_map_free(bmap
);
4548 isl_basic_map_free(bmap1
);
4549 isl_basic_map_free(bmap2
);
4553 /* Given two maps A -> f(A) and B -> g(B), construct a map
4554 * A \cap B -> f(A) + f(B)
4556 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
4558 struct isl_map
*result
;
4564 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4566 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4567 map1
->n
* map2
->n
, 0);
4570 for (i
= 0; i
< map1
->n
; ++i
)
4571 for (j
= 0; j
< map2
->n
; ++j
) {
4572 struct isl_basic_map
*part
;
4573 part
= isl_basic_map_sum(
4574 isl_basic_map_copy(map1
->p
[i
]),
4575 isl_basic_map_copy(map2
->p
[j
]));
4576 if (isl_basic_map_is_empty(part
))
4577 isl_basic_map_free(part
);
4579 result
= isl_map_add_basic_map(result
, part
);
4592 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4593 __isl_take isl_set
*set2
)
4595 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4598 /* Given a basic map A -> f(A), construct A -> -f(A).
4600 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4605 bmap
= isl_basic_map_cow(bmap
);
4609 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4610 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4611 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4612 for (j
= 0; j
< n
; ++j
)
4613 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4614 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4615 for (j
= 0; j
< n
; ++j
)
4616 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4617 for (i
= 0; i
< bmap
->n_div
; ++i
)
4618 for (j
= 0; j
< n
; ++j
)
4619 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4620 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4621 return isl_basic_map_finalize(bmap
);
4624 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4626 return isl_basic_map_neg(bset
);
4629 /* Given a map A -> f(A), construct A -> -f(A).
4631 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4635 map
= isl_map_cow(map
);
4639 for (i
= 0; i
< map
->n
; ++i
) {
4640 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4651 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4653 return set_from_map(isl_map_neg(set_to_map(set
)));
4656 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4657 * A -> floor(f(A)/d).
4659 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4662 unsigned n_in
, n_out
, nparam
, total
, pos
;
4663 struct isl_basic_map
*result
= NULL
;
4664 struct isl_dim_map
*dim_map
;
4670 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4671 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4672 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4674 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4675 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4676 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4677 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4678 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4679 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4681 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4682 bmap
->n_div
+ n_out
,
4683 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4684 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4685 result
= add_divs(result
, n_out
);
4686 for (i
= 0; i
< n_out
; ++i
) {
4688 j
= isl_basic_map_alloc_inequality(result
);
4691 isl_seq_clr(result
->ineq
[j
], 1+total
);
4692 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4693 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4694 j
= isl_basic_map_alloc_inequality(result
);
4697 isl_seq_clr(result
->ineq
[j
], 1+total
);
4698 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4699 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4700 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4703 result
= isl_basic_map_simplify(result
);
4704 return isl_basic_map_finalize(result
);
4706 isl_basic_map_free(result
);
4710 /* Given a map A -> f(A) and an integer d, construct a map
4711 * A -> floor(f(A)/d).
4713 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
4717 map
= isl_map_cow(map
);
4721 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4722 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4723 for (i
= 0; i
< map
->n
; ++i
) {
4724 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4735 /* Given a map A -> f(A) and an integer d, construct a map
4736 * A -> floor(f(A)/d).
4738 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4739 __isl_take isl_val
*d
)
4743 if (!isl_val_is_int(d
))
4744 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4745 "expecting integer denominator", goto error
);
4746 map
= isl_map_floordiv(map
, d
->n
);
4755 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4762 i
= isl_basic_map_alloc_equality(bmap
);
4765 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4766 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4767 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4768 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4769 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4770 return isl_basic_map_finalize(bmap
);
4772 isl_basic_map_free(bmap
);
4776 /* Add a constraint to "bmap" expressing i_pos < o_pos
4778 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4785 i
= isl_basic_map_alloc_inequality(bmap
);
4788 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4789 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4790 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4791 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4792 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4793 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4794 return isl_basic_map_finalize(bmap
);
4796 isl_basic_map_free(bmap
);
4800 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4802 static __isl_give isl_basic_map
*var_less_or_equal(
4803 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4809 i
= isl_basic_map_alloc_inequality(bmap
);
4812 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4813 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4814 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4815 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4816 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4817 return isl_basic_map_finalize(bmap
);
4819 isl_basic_map_free(bmap
);
4823 /* Add a constraint to "bmap" expressing i_pos > o_pos
4825 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4832 i
= isl_basic_map_alloc_inequality(bmap
);
4835 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4836 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4837 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4838 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4839 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4840 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4841 return isl_basic_map_finalize(bmap
);
4843 isl_basic_map_free(bmap
);
4847 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4849 static __isl_give isl_basic_map
*var_more_or_equal(
4850 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4856 i
= isl_basic_map_alloc_inequality(bmap
);
4859 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4860 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4861 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4862 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4863 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4864 return isl_basic_map_finalize(bmap
);
4866 isl_basic_map_free(bmap
);
4870 __isl_give isl_basic_map
*isl_basic_map_equal(
4871 __isl_take isl_space
*dim
, unsigned n_equal
)
4874 struct isl_basic_map
*bmap
;
4875 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4878 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4879 bmap
= var_equal(bmap
, i
);
4880 return isl_basic_map_finalize(bmap
);
4883 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4885 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4889 struct isl_basic_map
*bmap
;
4890 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4893 for (i
= 0; i
< pos
&& bmap
; ++i
)
4894 bmap
= var_equal(bmap
, i
);
4896 bmap
= var_less(bmap
, pos
);
4897 return isl_basic_map_finalize(bmap
);
4900 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4902 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4903 __isl_take isl_space
*dim
, unsigned pos
)
4906 isl_basic_map
*bmap
;
4908 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4909 for (i
= 0; i
< pos
; ++i
)
4910 bmap
= var_equal(bmap
, i
);
4911 bmap
= var_less_or_equal(bmap
, pos
);
4912 return isl_basic_map_finalize(bmap
);
4915 /* Return a relation on "dim" expressing i_pos > o_pos
4917 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4921 struct isl_basic_map
*bmap
;
4922 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4925 for (i
= 0; i
< pos
&& bmap
; ++i
)
4926 bmap
= var_equal(bmap
, i
);
4928 bmap
= var_more(bmap
, pos
);
4929 return isl_basic_map_finalize(bmap
);
4932 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
4934 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4935 __isl_take isl_space
*dim
, unsigned pos
)
4938 isl_basic_map
*bmap
;
4940 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4941 for (i
= 0; i
< pos
; ++i
)
4942 bmap
= var_equal(bmap
, i
);
4943 bmap
= var_more_or_equal(bmap
, pos
);
4944 return isl_basic_map_finalize(bmap
);
4947 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4948 unsigned n
, int equal
)
4950 struct isl_map
*map
;
4953 if (n
== 0 && equal
)
4954 return isl_map_universe(dims
);
4956 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4958 for (i
= 0; i
+ 1 < n
; ++i
)
4959 map
= isl_map_add_basic_map(map
,
4960 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4963 map
= isl_map_add_basic_map(map
,
4964 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4966 map
= isl_map_add_basic_map(map
,
4967 isl_basic_map_less_at(dims
, n
- 1));
4969 isl_space_free(dims
);
4974 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4978 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4981 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4983 return map_lex_lte_first(dim
, n
, 0);
4986 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4988 return map_lex_lte_first(dim
, n
, 1);
4991 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4993 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4996 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4998 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
5001 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
5002 unsigned n
, int equal
)
5004 struct isl_map
*map
;
5007 if (n
== 0 && equal
)
5008 return isl_map_universe(dims
);
5010 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5012 for (i
= 0; i
+ 1 < n
; ++i
)
5013 map
= isl_map_add_basic_map(map
,
5014 isl_basic_map_more_at(isl_space_copy(dims
), i
));
5017 map
= isl_map_add_basic_map(map
,
5018 isl_basic_map_more_or_equal_at(dims
, n
- 1));
5020 map
= isl_map_add_basic_map(map
,
5021 isl_basic_map_more_at(dims
, n
- 1));
5023 isl_space_free(dims
);
5028 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
5032 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
5035 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5037 return map_lex_gte_first(dim
, n
, 0);
5040 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5042 return map_lex_gte_first(dim
, n
, 1);
5045 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5047 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5050 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5052 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5055 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5056 __isl_take isl_set
*set2
)
5059 map
= isl_map_lex_le(isl_set_get_space(set1
));
5060 map
= isl_map_intersect_domain(map
, set1
);
5061 map
= isl_map_intersect_range(map
, set2
);
5065 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5066 __isl_take isl_set
*set2
)
5069 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5070 map
= isl_map_intersect_domain(map
, set1
);
5071 map
= isl_map_intersect_range(map
, set2
);
5075 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5076 __isl_take isl_set
*set2
)
5079 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5080 map
= isl_map_intersect_domain(map
, set1
);
5081 map
= isl_map_intersect_range(map
, set2
);
5085 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5086 __isl_take isl_set
*set2
)
5089 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5090 map
= isl_map_intersect_domain(map
, set1
);
5091 map
= isl_map_intersect_range(map
, set2
);
5095 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5096 __isl_take isl_map
*map2
)
5099 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5100 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5101 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5105 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5106 __isl_take isl_map
*map2
)
5109 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5110 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5111 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5115 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5116 __isl_take isl_map
*map2
)
5119 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5120 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5121 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5125 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5126 __isl_take isl_map
*map2
)
5129 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5130 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5131 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5135 /* For a div d = floor(f/m), add the constraint
5139 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
5140 unsigned pos
, isl_int
*div
)
5143 unsigned total
= isl_basic_map_total_dim(bmap
);
5145 i
= isl_basic_map_alloc_inequality(bmap
);
5147 return isl_stat_error
;
5148 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5149 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
5154 /* For a div d = floor(f/m), add the constraint
5156 * -(f-(m-1)) + m d >= 0
5158 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
5159 unsigned pos
, isl_int
*div
)
5162 unsigned total
= isl_basic_map_total_dim(bmap
);
5164 i
= isl_basic_map_alloc_inequality(bmap
);
5166 return isl_stat_error
;
5167 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5168 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
5169 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5170 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5175 /* For a div d = floor(f/m), add the constraints
5178 * -(f-(m-1)) + m d >= 0
5180 * Note that the second constraint is the negation of
5184 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
5185 unsigned pos
, isl_int
*div
)
5187 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
5189 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
5194 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
5195 unsigned pos
, isl_int
*div
)
5197 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
5201 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
5203 unsigned total
= isl_basic_map_total_dim(bmap
);
5204 unsigned div_pos
= total
- bmap
->n_div
+ div
;
5206 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
5210 /* For each known div d = floor(f/m), add the constraints
5213 * -(f-(m-1)) + m d >= 0
5215 * Remove duplicate constraints in case of some these div constraints
5216 * already appear in "bmap".
5218 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5219 __isl_take isl_basic_map
*bmap
)
5225 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5229 bmap
= add_known_div_constraints(bmap
);
5230 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5231 bmap
= isl_basic_map_finalize(bmap
);
5235 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5237 * In particular, if this div is of the form d = floor(f/m),
5238 * then add the constraint
5242 * if sign < 0 or the constraint
5244 * -(f-(m-1)) + m d >= 0
5248 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
5249 unsigned div
, int sign
)
5257 total
= isl_basic_map_total_dim(bmap
);
5258 div_pos
= total
- bmap
->n_div
+ div
;
5261 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5263 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5266 struct isl_basic_set
*isl_basic_map_underlying_set(
5267 struct isl_basic_map
*bmap
)
5271 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5273 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5274 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5275 return bset_from_bmap(bmap
);
5276 bmap
= isl_basic_map_cow(bmap
);
5279 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5282 bmap
->extra
-= bmap
->n_div
;
5284 bmap
= isl_basic_map_finalize(bmap
);
5285 return bset_from_bmap(bmap
);
5287 isl_basic_map_free(bmap
);
5291 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5292 __isl_take isl_basic_set
*bset
)
5294 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5297 /* Replace each element in "list" by the result of applying
5298 * isl_basic_map_underlying_set to the element.
5300 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5301 __isl_take isl_basic_map_list
*list
)
5308 n
= isl_basic_map_list_n_basic_map(list
);
5309 for (i
= 0; i
< n
; ++i
) {
5310 isl_basic_map
*bmap
;
5311 isl_basic_set
*bset
;
5313 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5314 bset
= isl_basic_set_underlying_set(bmap
);
5315 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5321 struct isl_basic_map
*isl_basic_map_overlying_set(
5322 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
5324 struct isl_basic_map
*bmap
;
5325 struct isl_ctx
*ctx
;
5332 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5333 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5334 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5336 if (like
->n_div
== 0) {
5337 isl_space
*space
= isl_basic_map_get_space(like
);
5338 isl_basic_map_free(like
);
5339 return isl_basic_map_reset_space(bset
, space
);
5341 bset
= isl_basic_set_cow(bset
);
5344 total
= bset
->dim
->n_out
+ bset
->extra
;
5345 bmap
= bset_to_bmap(bset
);
5346 isl_space_free(bmap
->dim
);
5347 bmap
->dim
= isl_space_copy(like
->dim
);
5350 bmap
->n_div
= like
->n_div
;
5351 bmap
->extra
+= like
->n_div
;
5355 ltotal
= total
- bmap
->extra
+ like
->extra
;
5358 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5359 bmap
->extra
* (1 + 1 + total
));
5360 if (isl_blk_is_error(bmap
->block2
))
5362 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5366 for (i
= 0; i
< bmap
->extra
; ++i
)
5367 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5368 for (i
= 0; i
< like
->n_div
; ++i
) {
5369 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5370 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5372 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5374 isl_basic_map_free(like
);
5375 bmap
= isl_basic_map_simplify(bmap
);
5376 bmap
= isl_basic_map_finalize(bmap
);
5379 isl_basic_map_free(like
);
5380 isl_basic_set_free(bset
);
5384 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5385 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5387 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5388 bset_to_bmap(like
)));
5391 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
5395 map
= isl_map_cow(map
);
5398 map
->dim
= isl_space_cow(map
->dim
);
5402 for (i
= 1; i
< map
->n
; ++i
)
5403 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5405 for (i
= 0; i
< map
->n
; ++i
) {
5406 map
->p
[i
] = bset_to_bmap(
5407 isl_basic_map_underlying_set(map
->p
[i
]));
5412 map
->dim
= isl_space_underlying(map
->dim
, 0);
5414 isl_space_free(map
->dim
);
5415 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5419 return set_from_map(map
);
5425 /* Replace the space of "bmap" by "space".
5427 * If the space of "bmap" is identical to "space" (including the identifiers
5428 * of the input and output dimensions), then simply return the original input.
5430 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5431 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5434 isl_space
*bmap_space
;
5436 bmap_space
= isl_basic_map_peek_space(bmap
);
5437 equal
= isl_space_is_equal(bmap_space
, space
);
5438 if (equal
>= 0 && equal
)
5439 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5443 isl_space_free(space
);
5446 bmap
= isl_basic_map_cow(bmap
);
5447 if (!bmap
|| !space
)
5450 isl_space_free(bmap
->dim
);
5453 bmap
= isl_basic_map_finalize(bmap
);
5457 isl_basic_map_free(bmap
);
5458 isl_space_free(space
);
5462 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5463 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5465 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5469 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5470 __isl_take isl_space
*dim
)
5474 map
= isl_map_cow(map
);
5478 for (i
= 0; i
< map
->n
; ++i
) {
5479 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5480 isl_space_copy(dim
));
5484 isl_space_free(map
->dim
);
5490 isl_space_free(dim
);
5494 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5495 __isl_take isl_space
*dim
)
5497 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5500 /* Compute the parameter domain of the given basic set.
5502 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5508 is_params
= isl_basic_set_is_params(bset
);
5510 return isl_basic_set_free(bset
);
5514 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5515 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5516 space
= isl_basic_set_get_space(bset
);
5517 space
= isl_space_params(space
);
5518 bset
= isl_basic_set_reset_space(bset
, space
);
5522 /* Construct a zero-dimensional basic set with the given parameter domain.
5524 __isl_give isl_basic_set
*isl_basic_set_from_params(
5525 __isl_take isl_basic_set
*bset
)
5528 space
= isl_basic_set_get_space(bset
);
5529 space
= isl_space_set_from_params(space
);
5530 bset
= isl_basic_set_reset_space(bset
, space
);
5534 /* Compute the parameter domain of the given set.
5536 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5541 if (isl_set_is_params(set
))
5544 n
= isl_set_dim(set
, isl_dim_set
);
5545 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5546 space
= isl_set_get_space(set
);
5547 space
= isl_space_params(space
);
5548 set
= isl_set_reset_space(set
, space
);
5552 /* Construct a zero-dimensional set with the given parameter domain.
5554 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5557 space
= isl_set_get_space(set
);
5558 space
= isl_space_set_from_params(space
);
5559 set
= isl_set_reset_space(set
, space
);
5563 /* Compute the parameter domain of the given map.
5565 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5570 n
= isl_map_dim(map
, isl_dim_in
);
5571 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5572 n
= isl_map_dim(map
, isl_dim_out
);
5573 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5574 space
= isl_map_get_space(map
);
5575 space
= isl_space_params(space
);
5576 map
= isl_map_reset_space(map
, space
);
5580 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5587 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5589 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5590 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5592 return isl_basic_map_reset_space(bmap
, space
);
5595 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5598 return isl_bool_error
;
5599 return isl_space_may_be_set(bmap
->dim
);
5602 /* Is this basic map actually a set?
5603 * Users should never call this function. Outside of isl,
5604 * the type should indicate whether something is a set or a map.
5606 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5609 return isl_bool_error
;
5610 return isl_space_is_set(bmap
->dim
);
5613 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5617 is_set
= isl_basic_map_is_set(bmap
);
5622 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5624 isl_basic_map_free(bmap
);
5628 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5629 __isl_take isl_basic_map
*bmap
)
5633 isl_basic_map
*domain
;
5634 int nparam
, n_in
, n_out
;
5636 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5637 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5638 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5640 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5641 domain
= isl_basic_map_universe(dim
);
5643 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5644 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5645 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5647 for (i
= 0; i
< n_in
; ++i
)
5648 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5651 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5652 return isl_basic_map_finalize(bmap
);
5655 __isl_give isl_basic_map
*isl_basic_map_range_map(
5656 __isl_take isl_basic_map
*bmap
)
5660 isl_basic_map
*range
;
5661 int nparam
, n_in
, n_out
;
5663 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5664 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5665 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5667 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5668 range
= isl_basic_map_universe(dim
);
5670 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5671 bmap
= isl_basic_map_apply_range(bmap
, range
);
5672 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5674 for (i
= 0; i
< n_out
; ++i
)
5675 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5678 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5679 return isl_basic_map_finalize(bmap
);
5682 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5686 return isl_space_may_be_set(map
->dim
);
5689 /* Is this map actually a set?
5690 * Users should never call this function. Outside of isl,
5691 * the type should indicate whether something is a set or a map.
5693 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5696 return isl_bool_error
;
5697 return isl_space_is_set(map
->dim
);
5700 struct isl_set
*isl_map_range(struct isl_map
*map
)
5704 struct isl_set
*set
;
5706 is_set
= isl_map_is_set(map
);
5710 return set_from_map(map
);
5712 map
= isl_map_cow(map
);
5716 set
= set_from_map(map
);
5717 set
->dim
= isl_space_range(set
->dim
);
5720 for (i
= 0; i
< map
->n
; ++i
) {
5721 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5725 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5726 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5733 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5737 map
= isl_map_cow(map
);
5741 map
->dim
= isl_space_domain_map(map
->dim
);
5744 for (i
= 0; i
< map
->n
; ++i
) {
5745 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5749 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5750 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5757 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5760 isl_space
*range_dim
;
5762 map
= isl_map_cow(map
);
5766 range_dim
= isl_space_range(isl_map_get_space(map
));
5767 range_dim
= isl_space_from_range(range_dim
);
5768 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5769 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5772 for (i
= 0; i
< map
->n
; ++i
) {
5773 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5777 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5778 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5785 /* Given a wrapped map of the form A[B -> C],
5786 * return the map A[B -> C] -> B.
5788 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5795 if (!isl_set_has_tuple_id(set
))
5796 return isl_map_domain_map(isl_set_unwrap(set
));
5798 id
= isl_set_get_tuple_id(set
);
5799 map
= isl_map_domain_map(isl_set_unwrap(set
));
5800 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5805 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5806 __isl_take isl_basic_set
*bset
)
5808 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5811 __isl_give isl_basic_map
*isl_basic_map_from_range(
5812 __isl_take isl_basic_set
*bset
)
5815 space
= isl_basic_set_get_space(bset
);
5816 space
= isl_space_from_range(space
);
5817 bset
= isl_basic_set_reset_space(bset
, space
);
5818 return bset_to_bmap(bset
);
5821 /* Create a relation with the given set as range.
5822 * The domain of the created relation is a zero-dimensional
5823 * flat anonymous space.
5825 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5828 space
= isl_set_get_space(set
);
5829 space
= isl_space_from_range(space
);
5830 set
= isl_set_reset_space(set
, space
);
5831 return set_to_map(set
);
5834 /* Create a relation with the given set as domain.
5835 * The range of the created relation is a zero-dimensional
5836 * flat anonymous space.
5838 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5840 return isl_map_reverse(isl_map_from_range(set
));
5843 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5844 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5846 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5849 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5850 __isl_take isl_set
*range
)
5852 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5855 /* Return a newly allocated isl_map with given space and flags and
5856 * room for "n" basic maps.
5857 * Make sure that all cached information is cleared.
5859 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5862 struct isl_map
*map
;
5867 isl_die(space
->ctx
, isl_error_internal
,
5868 "negative number of basic maps", goto error
);
5869 map
= isl_calloc(space
->ctx
, struct isl_map
,
5870 sizeof(struct isl_map
) +
5871 (n
- 1) * sizeof(struct isl_basic_map
*));
5875 map
->ctx
= space
->ctx
;
5876 isl_ctx_ref(map
->ctx
);
5884 isl_space_free(space
);
5888 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5890 struct isl_basic_map
*bmap
;
5891 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5892 bmap
= isl_basic_map_set_to_empty(bmap
);
5896 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5898 struct isl_basic_set
*bset
;
5899 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5900 bset
= isl_basic_set_set_to_empty(bset
);
5904 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5906 struct isl_basic_map
*bmap
;
5907 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5908 bmap
= isl_basic_map_finalize(bmap
);
5912 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5914 struct isl_basic_set
*bset
;
5915 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5916 bset
= isl_basic_set_finalize(bset
);
5920 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5923 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5924 isl_basic_map
*bmap
;
5926 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5927 for (i
= 0; i
< total
; ++i
) {
5928 int k
= isl_basic_map_alloc_inequality(bmap
);
5931 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5932 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5936 isl_basic_map_free(bmap
);
5940 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5942 return isl_basic_map_nat_universe(dim
);
5945 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5947 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5950 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5952 return isl_map_nat_universe(dim
);
5955 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5957 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5960 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5962 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5965 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5967 struct isl_map
*map
;
5970 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5971 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5975 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5977 struct isl_set
*set
;
5980 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5981 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5985 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5988 struct isl_map
*dup
;
5992 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5993 for (i
= 0; i
< map
->n
; ++i
)
5994 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5998 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5999 __isl_take isl_basic_map
*bmap
)
6003 if (isl_basic_map_plain_is_empty(bmap
)) {
6004 isl_basic_map_free(bmap
);
6007 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6008 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6009 map
->p
[map
->n
] = bmap
;
6011 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6017 isl_basic_map_free(bmap
);
6021 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6032 isl_ctx_deref(map
->ctx
);
6033 for (i
= 0; i
< map
->n
; ++i
)
6034 isl_basic_map_free(map
->p
[i
]);
6035 isl_space_free(map
->dim
);
6041 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
6042 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
6046 bmap
= isl_basic_map_cow(bmap
);
6047 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6048 j
= isl_basic_map_alloc_equality(bmap
);
6051 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6052 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6053 isl_int_set_si(bmap
->eq
[j
][0], value
);
6054 bmap
= isl_basic_map_simplify(bmap
);
6055 return isl_basic_map_finalize(bmap
);
6057 isl_basic_map_free(bmap
);
6061 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6062 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6066 bmap
= isl_basic_map_cow(bmap
);
6067 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6068 j
= isl_basic_map_alloc_equality(bmap
);
6071 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6072 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6073 isl_int_set(bmap
->eq
[j
][0], value
);
6074 bmap
= isl_basic_map_simplify(bmap
);
6075 return isl_basic_map_finalize(bmap
);
6077 isl_basic_map_free(bmap
);
6081 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6082 enum isl_dim_type type
, unsigned pos
, int value
)
6084 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6085 return isl_basic_map_free(bmap
);
6086 return isl_basic_map_fix_pos_si(bmap
,
6087 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6090 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6091 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6093 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6094 return isl_basic_map_free(bmap
);
6095 return isl_basic_map_fix_pos(bmap
,
6096 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6099 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6100 * to be equal to "v".
6102 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6103 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6107 if (!isl_val_is_int(v
))
6108 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6109 "expecting integer value", goto error
);
6110 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6112 pos
+= isl_basic_map_offset(bmap
, type
);
6113 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6117 isl_basic_map_free(bmap
);
6122 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6123 * to be equal to "v".
6125 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6126 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6128 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6131 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6132 enum isl_dim_type type
, unsigned pos
, int value
)
6134 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6138 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6139 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6141 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6145 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6146 unsigned input
, int value
)
6148 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6151 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6152 unsigned dim
, int value
)
6154 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6155 isl_dim_set
, dim
, value
));
6158 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
6160 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6167 isl_basic_map_free(map
->p
[i
]);
6168 if (i
!= map
->n
- 1) {
6169 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6170 map
->p
[i
] = map
->p
[map
->n
- 1];
6177 /* Perform "fn" on each basic map of "map", where we may not be holding
6178 * the only reference to "map".
6179 * In particular, "fn" should be a semantics preserving operation
6180 * that we want to apply to all copies of "map". We therefore need
6181 * to be careful not to modify "map" in a way that breaks "map"
6182 * in case anything goes wrong.
6184 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6185 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6187 struct isl_basic_map
*bmap
;
6193 for (i
= map
->n
- 1; i
>= 0; --i
) {
6194 bmap
= isl_basic_map_copy(map
->p
[i
]);
6198 isl_basic_map_free(map
->p
[i
]);
6200 if (remove_if_empty(map
, i
) < 0)
6210 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
6211 enum isl_dim_type type
, unsigned pos
, int value
)
6215 map
= isl_map_cow(map
);
6219 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6220 for (i
= map
->n
- 1; i
>= 0; --i
) {
6221 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6222 if (remove_if_empty(map
, i
) < 0)
6225 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6232 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6233 enum isl_dim_type type
, unsigned pos
, int value
)
6235 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6238 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6239 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6243 map
= isl_map_cow(map
);
6247 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6248 for (i
= 0; i
< map
->n
; ++i
) {
6249 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6253 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6260 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6261 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6263 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6266 /* Fix the value of the variable at position "pos" of type "type" of "map"
6267 * to be equal to "v".
6269 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6270 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6274 map
= isl_map_cow(map
);
6278 if (!isl_val_is_int(v
))
6279 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6280 "expecting integer value", goto error
);
6281 if (pos
>= isl_map_dim(map
, type
))
6282 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6283 "index out of bounds", goto error
);
6284 for (i
= map
->n
- 1; i
>= 0; --i
) {
6285 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6287 if (remove_if_empty(map
, i
) < 0)
6290 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6299 /* Fix the value of the variable at position "pos" of type "type" of "set"
6300 * to be equal to "v".
6302 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6303 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6305 return isl_map_fix_val(set
, type
, pos
, v
);
6308 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6309 unsigned input
, int value
)
6311 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6314 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6316 return set_from_map(isl_map_fix_si(set_to_map(set
),
6317 isl_dim_set
, dim
, value
));
6320 static __isl_give isl_basic_map
*basic_map_bound_si(
6321 __isl_take isl_basic_map
*bmap
,
6322 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6326 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6327 return isl_basic_map_free(bmap
);
6328 pos
+= isl_basic_map_offset(bmap
, type
);
6329 bmap
= isl_basic_map_cow(bmap
);
6330 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6331 j
= isl_basic_map_alloc_inequality(bmap
);
6334 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6336 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6337 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6339 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6340 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6342 bmap
= isl_basic_map_simplify(bmap
);
6343 return isl_basic_map_finalize(bmap
);
6345 isl_basic_map_free(bmap
);
6349 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6350 __isl_take isl_basic_map
*bmap
,
6351 enum isl_dim_type type
, unsigned pos
, int value
)
6353 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6356 /* Constrain the values of the given dimension to be no greater than "value".
6358 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6359 __isl_take isl_basic_map
*bmap
,
6360 enum isl_dim_type type
, unsigned pos
, int value
)
6362 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6365 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6366 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6370 map
= isl_map_cow(map
);
6374 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6375 for (i
= 0; i
< map
->n
; ++i
) {
6376 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6377 type
, pos
, value
, upper
);
6381 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6388 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6389 enum isl_dim_type type
, unsigned pos
, int value
)
6391 return map_bound_si(map
, type
, pos
, value
, 0);
6394 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6395 enum isl_dim_type type
, unsigned pos
, int value
)
6397 return map_bound_si(map
, type
, pos
, value
, 1);
6400 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6401 enum isl_dim_type type
, unsigned pos
, int value
)
6403 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6407 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6408 enum isl_dim_type type
, unsigned pos
, int value
)
6410 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6413 /* Bound the given variable of "bmap" from below (or above is "upper"
6414 * is set) to "value".
6416 static __isl_give isl_basic_map
*basic_map_bound(
6417 __isl_take isl_basic_map
*bmap
,
6418 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6422 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6423 return isl_basic_map_free(bmap
);
6424 pos
+= isl_basic_map_offset(bmap
, type
);
6425 bmap
= isl_basic_map_cow(bmap
);
6426 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6427 j
= isl_basic_map_alloc_inequality(bmap
);
6430 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6432 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6433 isl_int_set(bmap
->ineq
[j
][0], value
);
6435 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6436 isl_int_neg(bmap
->ineq
[j
][0], value
);
6438 bmap
= isl_basic_map_simplify(bmap
);
6439 return isl_basic_map_finalize(bmap
);
6441 isl_basic_map_free(bmap
);
6445 /* Bound the given variable of "map" from below (or above is "upper"
6446 * is set) to "value".
6448 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6449 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6453 map
= isl_map_cow(map
);
6457 if (pos
>= isl_map_dim(map
, type
))
6458 isl_die(map
->ctx
, isl_error_invalid
,
6459 "index out of bounds", goto error
);
6460 for (i
= map
->n
- 1; i
>= 0; --i
) {
6461 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6462 if (remove_if_empty(map
, i
) < 0)
6465 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6472 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6473 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6475 return map_bound(map
, type
, pos
, value
, 0);
6478 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6479 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6481 return map_bound(map
, type
, pos
, value
, 1);
6484 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6485 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6487 return isl_map_lower_bound(set
, type
, pos
, value
);
6490 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6491 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6493 return isl_map_upper_bound(set
, type
, pos
, value
);
6496 /* Force the values of the variable at position "pos" of type "type" of "set"
6497 * to be no smaller than "value".
6499 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6500 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6504 if (!isl_val_is_int(value
))
6505 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6506 "expecting integer value", goto error
);
6507 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6508 isl_val_free(value
);
6511 isl_val_free(value
);
6516 /* Force the values of the variable at position "pos" of type "type" of "set"
6517 * to be no greater than "value".
6519 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6520 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6524 if (!isl_val_is_int(value
))
6525 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6526 "expecting integer value", goto error
);
6527 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6528 isl_val_free(value
);
6531 isl_val_free(value
);
6536 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
6540 map
= isl_map_cow(map
);
6544 map
->dim
= isl_space_reverse(map
->dim
);
6547 for (i
= 0; i
< map
->n
; ++i
) {
6548 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6552 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6560 #define TYPE isl_pw_multi_aff
6562 #define SUFFIX _pw_multi_aff
6564 #define EMPTY isl_pw_multi_aff_empty
6566 #define ADD isl_pw_multi_aff_union_add
6567 #include "isl_map_lexopt_templ.c"
6569 /* Given a map "map", compute the lexicographically minimal
6570 * (or maximal) image element for each domain element in dom,
6571 * in the form of an isl_pw_multi_aff.
6572 * If "empty" is not NULL, then set *empty to those elements in dom that
6573 * do not have an image element.
6574 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6575 * should be computed over the domain of "map". "empty" is also NULL
6578 * We first compute the lexicographically minimal or maximal element
6579 * in the first basic map. This results in a partial solution "res"
6580 * and a subset "todo" of dom that still need to be handled.
6581 * We then consider each of the remaining maps in "map" and successively
6582 * update both "res" and "todo".
6583 * If "empty" is NULL, then the todo sets are not needed and therefore
6584 * also not computed.
6586 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6587 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6588 __isl_give isl_set
**empty
, unsigned flags
)
6592 isl_pw_multi_aff
*res
;
6595 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6596 if (!map
|| (!full
&& !dom
))
6599 if (isl_map_plain_is_empty(map
)) {
6604 return isl_pw_multi_aff_from_map(map
);
6607 res
= basic_map_partial_lexopt_pw_multi_aff(
6608 isl_basic_map_copy(map
->p
[0]),
6609 isl_set_copy(dom
), empty
, flags
);
6613 for (i
= 1; i
< map
->n
; ++i
) {
6614 isl_pw_multi_aff
*res_i
;
6616 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6617 isl_basic_map_copy(map
->p
[i
]),
6618 isl_set_copy(dom
), empty
, flags
);
6620 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6621 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6623 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6626 todo
= isl_set_intersect(todo
, *empty
);
6645 #define TYPE isl_map
6649 #define EMPTY isl_map_empty
6651 #define ADD isl_map_union_disjoint
6652 #include "isl_map_lexopt_templ.c"
6654 /* Given a map "map", compute the lexicographically minimal
6655 * (or maximal) image element for each domain element in "dom",
6656 * in the form of an isl_map.
6657 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6658 * do not have an image element.
6659 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6660 * should be computed over the domain of "map". "empty" is also NULL
6663 * If the input consists of more than one disjunct, then first
6664 * compute the desired result in the form of an isl_pw_multi_aff and
6665 * then convert that into an isl_map.
6667 * This function used to have an explicit implementation in terms
6668 * of isl_maps, but it would continually intersect the domains of
6669 * partial results with the complement of the domain of the next
6670 * partial solution, potentially leading to an explosion in the number
6671 * of disjuncts if there are several disjuncts in the input.
6672 * An even earlier implementation of this function would look for
6673 * better results in the domain of the partial result and for extra
6674 * results in the complement of this domain, which would lead to
6675 * even more splintering.
6677 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6678 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6679 __isl_give isl_set
**empty
, unsigned flags
)
6682 struct isl_map
*res
;
6683 isl_pw_multi_aff
*pma
;
6685 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6686 if (!map
|| (!full
&& !dom
))
6689 if (isl_map_plain_is_empty(map
)) {
6698 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6704 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6706 return isl_map_from_pw_multi_aff(pma
);
6715 __isl_give isl_map
*isl_map_partial_lexmax(
6716 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6717 __isl_give isl_set
**empty
)
6719 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6722 __isl_give isl_map
*isl_map_partial_lexmin(
6723 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6724 __isl_give isl_set
**empty
)
6726 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6729 __isl_give isl_set
*isl_set_partial_lexmin(
6730 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6731 __isl_give isl_set
**empty
)
6733 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6737 __isl_give isl_set
*isl_set_partial_lexmax(
6738 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6739 __isl_give isl_set
**empty
)
6741 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6745 /* Compute the lexicographic minimum (or maximum if "flags" includes
6746 * ISL_OPT_MAX) of "bset" over its parametric domain.
6748 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6751 return isl_basic_map_lexopt(bset
, flags
);
6754 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6756 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6759 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6761 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6764 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6766 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6769 /* Compute the lexicographic minimum of "bset" over its parametric domain
6770 * for the purpose of quantifier elimination.
6771 * That is, find an explicit representation for all the existentially
6772 * quantified variables in "bset" by computing their lexicographic
6775 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6776 __isl_take isl_basic_set
*bset
)
6778 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6781 /* Extract the first and only affine expression from list
6782 * and then add it to *pwaff with the given dom.
6783 * This domain is known to be disjoint from other domains
6784 * because of the way isl_basic_map_foreach_lexmax works.
6786 static isl_stat
update_dim_opt(__isl_take isl_basic_set
*dom
,
6787 __isl_take isl_aff_list
*list
, void *user
)
6789 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6791 isl_pw_aff
**pwaff
= user
;
6792 isl_pw_aff
*pwaff_i
;
6796 if (isl_aff_list_n_aff(list
) != 1)
6797 isl_die(ctx
, isl_error_internal
,
6798 "expecting single element list", goto error
);
6800 aff
= isl_aff_list_get_aff(list
, 0);
6801 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6803 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6805 isl_aff_list_free(list
);
6809 isl_basic_set_free(dom
);
6810 isl_aff_list_free(list
);
6811 return isl_stat_error
;
6814 /* Given a basic map with one output dimension, compute the minimum or
6815 * maximum of that dimension as an isl_pw_aff.
6817 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6818 * call update_dim_opt on each leaf of the result.
6820 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6823 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6827 dim
= isl_space_from_domain(isl_space_domain(dim
));
6828 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6829 pwaff
= isl_pw_aff_empty(dim
);
6831 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6833 return isl_pw_aff_free(pwaff
);
6838 /* Compute the minimum or maximum of the given output dimension
6839 * as a function of the parameters and the input dimensions,
6840 * but independently of the other output dimensions.
6842 * We first project out the other output dimension and then compute
6843 * the "lexicographic" maximum in each basic map, combining the results
6844 * using isl_pw_aff_union_max.
6846 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6853 n_out
= isl_map_dim(map
, isl_dim_out
);
6854 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6855 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6860 isl_space
*dim
= isl_map_get_space(map
);
6862 return isl_pw_aff_empty(dim
);
6865 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6866 for (i
= 1; i
< map
->n
; ++i
) {
6867 isl_pw_aff
*pwaff_i
;
6869 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6870 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6878 /* Compute the minimum of the given output dimension as a function of the
6879 * parameters and input dimensions, but independently of
6880 * the other output dimensions.
6882 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6884 return map_dim_opt(map
, pos
, 0);
6887 /* Compute the maximum of the given output dimension as a function of the
6888 * parameters and input dimensions, but independently of
6889 * the other output dimensions.
6891 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6893 return map_dim_opt(map
, pos
, 1);
6896 /* Compute the minimum or maximum of the given set dimension
6897 * as a function of the parameters,
6898 * but independently of the other set dimensions.
6900 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6903 return map_dim_opt(set
, pos
, max
);
6906 /* Compute the maximum of the given set dimension as a function of the
6907 * parameters, but independently of the other set dimensions.
6909 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6911 return set_dim_opt(set
, pos
, 1);
6914 /* Compute the minimum of the given set dimension as a function of the
6915 * parameters, but independently of the other set dimensions.
6917 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6919 return set_dim_opt(set
, pos
, 0);
6922 /* Apply a preimage specified by "mat" on the parameters of "bset".
6923 * bset is assumed to have only parameters and divs.
6925 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
6926 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
6933 bset
->dim
= isl_space_cow(bset
->dim
);
6937 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6939 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6941 bset
->dim
->nparam
= 0;
6942 bset
->dim
->n_out
= nparam
;
6943 bset
= isl_basic_set_preimage(bset
, mat
);
6945 bset
->dim
->nparam
= bset
->dim
->n_out
;
6946 bset
->dim
->n_out
= 0;
6951 isl_basic_set_free(bset
);
6955 /* Apply a preimage specified by "mat" on the parameters of "set".
6956 * set is assumed to have only parameters and divs.
6958 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
6959 __isl_take isl_mat
*mat
)
6967 nparam
= isl_set_dim(set
, isl_dim_param
);
6969 if (mat
->n_row
!= 1 + nparam
)
6970 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
6971 "unexpected number of rows", goto error
);
6973 space
= isl_set_get_space(set
);
6974 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
6975 isl_dim_param
, 0, nparam
);
6976 set
= isl_set_reset_space(set
, space
);
6977 set
= isl_set_preimage(set
, mat
);
6978 nparam
= isl_set_dim(set
, isl_dim_out
);
6979 space
= isl_set_get_space(set
);
6980 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
6981 isl_dim_out
, 0, nparam
);
6982 set
= isl_set_reset_space(set
, space
);
6990 /* Intersect the basic set "bset" with the affine space specified by the
6991 * equalities in "eq".
6993 static __isl_give isl_basic_set
*basic_set_append_equalities(
6994 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7002 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7007 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7008 for (i
= 0; i
< eq
->n_row
; ++i
) {
7009 k
= isl_basic_set_alloc_equality(bset
);
7012 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7013 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7017 bset
= isl_basic_set_gauss(bset
, NULL
);
7018 bset
= isl_basic_set_finalize(bset
);
7023 isl_basic_set_free(bset
);
7027 /* Intersect the set "set" with the affine space specified by the
7028 * equalities in "eq".
7030 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7038 for (i
= 0; i
< set
->n
; ++i
) {
7039 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7052 /* Given a basic set "bset" that only involves parameters and existentially
7053 * quantified variables, return the index of the first equality
7054 * that only involves parameters. If there is no such equality then
7055 * return bset->n_eq.
7057 * This function assumes that isl_basic_set_gauss has been called on "bset".
7059 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7062 unsigned nparam
, n_div
;
7067 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7068 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7070 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7071 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7078 /* Compute an explicit representation for the existentially quantified
7079 * variables in "bset" by computing the "minimal value" of the set
7080 * variables. Since there are no set variables, the computation of
7081 * the minimal value essentially computes an explicit representation
7082 * of the non-empty part(s) of "bset".
7084 * The input only involves parameters and existentially quantified variables.
7085 * All equalities among parameters have been removed.
7087 * Since the existentially quantified variables in the result are in general
7088 * going to be different from those in the input, we first replace
7089 * them by the minimal number of variables based on their equalities.
7090 * This should simplify the parametric integer programming.
7092 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7094 isl_morph
*morph1
, *morph2
;
7100 if (bset
->n_eq
== 0)
7101 return isl_basic_set_lexmin_compute_divs(bset
);
7103 morph1
= isl_basic_set_parameter_compression(bset
);
7104 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7105 bset
= isl_basic_set_lift(bset
);
7106 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7107 bset
= isl_morph_basic_set(morph2
, bset
);
7108 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7109 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7111 set
= isl_basic_set_lexmin_compute_divs(bset
);
7113 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7118 /* Project the given basic set onto its parameter domain, possibly introducing
7119 * new, explicit, existential variables in the constraints.
7120 * The input has parameters and (possibly implicit) existential variables.
7121 * The output has the same parameters, but only
7122 * explicit existentially quantified variables.
7124 * The actual projection is performed by pip, but pip doesn't seem
7125 * to like equalities very much, so we first remove the equalities
7126 * among the parameters by performing a variable compression on
7127 * the parameters. Afterward, an inverse transformation is performed
7128 * and the equalities among the parameters are inserted back in.
7130 * The variable compression on the parameters may uncover additional
7131 * equalities that were only implicit before. We therefore check
7132 * if there are any new parameter equalities in the result and
7133 * if so recurse. The removal of parameter equalities is required
7134 * for the parameter compression performed by base_compute_divs.
7136 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7140 struct isl_mat
*T
, *T2
;
7141 struct isl_set
*set
;
7144 bset
= isl_basic_set_cow(bset
);
7148 if (bset
->n_eq
== 0)
7149 return base_compute_divs(bset
);
7151 bset
= isl_basic_set_gauss(bset
, NULL
);
7154 if (isl_basic_set_plain_is_empty(bset
))
7155 return isl_set_from_basic_set(bset
);
7157 i
= first_parameter_equality(bset
);
7158 if (i
== bset
->n_eq
)
7159 return base_compute_divs(bset
);
7161 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7162 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7164 eq
= isl_mat_cow(eq
);
7165 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7166 if (T
&& T
->n_col
== 0) {
7170 bset
= isl_basic_set_set_to_empty(bset
);
7171 return isl_set_from_basic_set(bset
);
7173 bset
= basic_set_parameter_preimage(bset
, T
);
7175 i
= first_parameter_equality(bset
);
7178 else if (i
== bset
->n_eq
)
7179 set
= base_compute_divs(bset
);
7181 set
= parameter_compute_divs(bset
);
7182 set
= set_parameter_preimage(set
, T2
);
7183 set
= set_append_equalities(set
, eq
);
7187 /* Insert the divs from "ls" before those of "bmap".
7189 * The number of columns is not changed, which means that the last
7190 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7191 * The caller is responsible for removing the same number of dimensions
7192 * from the space of "bmap".
7194 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7195 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7201 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7205 old_n_div
= bmap
->n_div
;
7206 bmap
= insert_div_rows(bmap
, n_div
);
7210 for (i
= 0; i
< n_div
; ++i
) {
7211 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7212 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7218 /* Replace the space of "bmap" by the space and divs of "ls".
7220 * If "ls" has any divs, then we simplify the result since we may
7221 * have discovered some additional equalities that could simplify
7222 * the div expressions.
7224 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7225 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7229 bmap
= isl_basic_map_cow(bmap
);
7233 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7234 bmap
= insert_divs_from_local_space(bmap
, ls
);
7238 isl_space_free(bmap
->dim
);
7239 bmap
->dim
= isl_local_space_get_space(ls
);
7243 isl_local_space_free(ls
);
7245 bmap
= isl_basic_map_simplify(bmap
);
7246 bmap
= isl_basic_map_finalize(bmap
);
7249 isl_basic_map_free(bmap
);
7250 isl_local_space_free(ls
);
7254 /* Replace the space of "map" by the space and divs of "ls".
7256 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7257 __isl_take isl_local_space
*ls
)
7261 map
= isl_map_cow(map
);
7265 for (i
= 0; i
< map
->n
; ++i
) {
7266 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7267 isl_local_space_copy(ls
));
7271 isl_space_free(map
->dim
);
7272 map
->dim
= isl_local_space_get_space(ls
);
7276 isl_local_space_free(ls
);
7279 isl_local_space_free(ls
);
7284 /* Compute an explicit representation for the existentially
7285 * quantified variables for which do not know any explicit representation yet.
7287 * We first sort the existentially quantified variables so that the
7288 * existentially quantified variables for which we already have an explicit
7289 * representation are placed before those for which we do not.
7290 * The input dimensions, the output dimensions and the existentially
7291 * quantified variables for which we already have an explicit
7292 * representation are then turned into parameters.
7293 * compute_divs returns a map with the same parameters and
7294 * no input or output dimensions and the dimension specification
7295 * is reset to that of the input, including the existentially quantified
7296 * variables for which we already had an explicit representation.
7298 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
7300 struct isl_basic_set
*bset
;
7301 struct isl_set
*set
;
7302 struct isl_map
*map
;
7304 isl_local_space
*ls
;
7311 bmap
= isl_basic_map_sort_divs(bmap
);
7312 bmap
= isl_basic_map_cow(bmap
);
7316 n_known
= isl_basic_map_first_unknown_div(bmap
);
7318 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7320 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7321 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7322 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7323 dim
= isl_space_set_alloc(bmap
->ctx
,
7324 nparam
+ n_in
+ n_out
+ n_known
, 0);
7328 ls
= isl_basic_map_get_local_space(bmap
);
7329 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7330 n_known
, bmap
->n_div
- n_known
);
7332 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7333 swap_div(bmap
, i
- n_known
, i
);
7334 bmap
->n_div
-= n_known
;
7335 bmap
->extra
-= n_known
;
7337 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7338 bset
= bset_from_bmap(bmap
);
7340 set
= parameter_compute_divs(bset
);
7341 map
= set_to_map(set
);
7342 map
= replace_space_by_local_space(map
, ls
);
7346 isl_basic_map_free(bmap
);
7350 /* Remove the explicit representation of local variable "div",
7353 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7354 __isl_take isl_basic_map
*bmap
, int div
)
7358 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7360 return isl_basic_map_free(bmap
);
7364 bmap
= isl_basic_map_cow(bmap
);
7367 isl_int_set_si(bmap
->div
[div
][0], 0);
7371 /* Is local variable "div" of "bmap" marked as not having an explicit
7373 * Note that even if "div" is not marked in this way and therefore
7374 * has an explicit representation, this representation may still
7375 * depend (indirectly) on other local variables that do not
7376 * have an explicit representation.
7378 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7381 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7382 return isl_bool_error
;
7383 return isl_int_is_zero(bmap
->div
[div
][0]);
7386 /* Return the position of the first local variable that does not
7387 * have an explicit representation.
7388 * Return the total number of local variables if they all have
7389 * an explicit representation.
7390 * Return -1 on error.
7392 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7399 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7400 if (!isl_basic_map_div_is_known(bmap
, i
))
7406 /* Return the position of the first local variable that does not
7407 * have an explicit representation.
7408 * Return the total number of local variables if they all have
7409 * an explicit representation.
7410 * Return -1 on error.
7412 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7414 return isl_basic_map_first_unknown_div(bset
);
7417 /* Does "bmap" have an explicit representation for all local variables?
7419 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7423 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7424 first
= isl_basic_map_first_unknown_div(bmap
);
7426 return isl_bool_error
;
7430 /* Do all basic maps in "map" have an explicit representation
7431 * for all local variables?
7433 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7438 return isl_bool_error
;
7440 for (i
= 0; i
< map
->n
; ++i
) {
7441 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7446 return isl_bool_true
;
7449 /* If bmap contains any unknown divs, then compute explicit
7450 * expressions for them. However, this computation may be
7451 * quite expensive, so first try to remove divs that aren't
7454 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7457 struct isl_map
*map
;
7459 known
= isl_basic_map_divs_known(bmap
);
7463 return isl_map_from_basic_map(bmap
);
7465 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7467 known
= isl_basic_map_divs_known(bmap
);
7471 return isl_map_from_basic_map(bmap
);
7473 map
= compute_divs(bmap
);
7476 isl_basic_map_free(bmap
);
7480 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
7484 struct isl_map
*res
;
7491 known
= isl_map_divs_known(map
);
7499 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7500 for (i
= 1 ; i
< map
->n
; ++i
) {
7502 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7503 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7504 res
= isl_map_union_disjoint(res
, r2
);
7506 res
= isl_map_union(res
, r2
);
7513 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7515 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7518 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7520 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7523 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7526 struct isl_set
*set
;
7531 map
= isl_map_cow(map
);
7535 set
= set_from_map(map
);
7536 set
->dim
= isl_space_domain(set
->dim
);
7539 for (i
= 0; i
< map
->n
; ++i
) {
7540 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7544 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7545 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7552 /* Return the union of "map1" and "map2", where we assume for now that
7553 * "map1" and "map2" are disjoint. Note that the basic maps inside
7554 * "map1" or "map2" may not be disjoint from each other.
7555 * Also note that this function is also called from isl_map_union,
7556 * which takes care of handling the situation where "map1" and "map2"
7557 * may not be disjoint.
7559 * If one of the inputs is empty, we can simply return the other input.
7560 * Similarly, if one of the inputs is universal, then it is equal to the union.
7562 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7563 __isl_take isl_map
*map2
)
7567 struct isl_map
*map
= NULL
;
7573 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7574 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7575 "spaces don't match", goto error
);
7586 is_universe
= isl_map_plain_is_universe(map1
);
7587 if (is_universe
< 0)
7594 is_universe
= isl_map_plain_is_universe(map2
);
7595 if (is_universe
< 0)
7602 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7603 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7604 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7606 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7607 map1
->n
+ map2
->n
, flags
);
7610 for (i
= 0; i
< map1
->n
; ++i
) {
7611 map
= isl_map_add_basic_map(map
,
7612 isl_basic_map_copy(map1
->p
[i
]));
7616 for (i
= 0; i
< map2
->n
; ++i
) {
7617 map
= isl_map_add_basic_map(map
,
7618 isl_basic_map_copy(map2
->p
[i
]));
7632 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7633 * guaranteed to be disjoint by the caller.
7635 * Note that this functions is called from within isl_map_make_disjoint,
7636 * so we have to be careful not to touch the constraints of the inputs
7639 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7640 __isl_take isl_map
*map2
)
7642 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7645 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7646 * not be disjoint. The parameters are assumed to have been aligned.
7648 * We currently simply call map_union_disjoint, the internal operation
7649 * of which does not really depend on the inputs being disjoint.
7650 * If the result contains more than one basic map, then we clear
7651 * the disjoint flag since the result may contain basic maps from
7652 * both inputs and these are not guaranteed to be disjoint.
7654 * As a special case, if "map1" and "map2" are obviously equal,
7655 * then we simply return "map1".
7657 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7658 __isl_take isl_map
*map2
)
7665 equal
= isl_map_plain_is_equal(map1
, map2
);
7673 map1
= map_union_disjoint(map1
, map2
);
7677 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7685 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7688 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7689 __isl_take isl_map
*map2
)
7691 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7694 struct isl_set
*isl_set_union_disjoint(
7695 struct isl_set
*set1
, struct isl_set
*set2
)
7697 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7701 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7703 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7706 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7709 * "map" and "set" are assumed to be compatible and non-NULL.
7711 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7712 __isl_take isl_set
*set
,
7713 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7714 __isl_take isl_basic_set
*bset
))
7717 struct isl_map
*result
;
7720 if (isl_set_plain_is_universe(set
)) {
7725 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7726 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7727 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7729 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7730 map
->n
* set
->n
, flags
);
7731 for (i
= 0; result
&& i
< map
->n
; ++i
)
7732 for (j
= 0; j
< set
->n
; ++j
) {
7733 result
= isl_map_add_basic_map(result
,
7734 fn(isl_basic_map_copy(map
->p
[i
]),
7735 isl_basic_set_copy(set
->p
[j
])));
7745 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7746 __isl_take isl_set
*set
)
7750 ok
= isl_map_compatible_range(map
, set
);
7754 isl_die(set
->ctx
, isl_error_invalid
,
7755 "incompatible spaces", goto error
);
7757 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7764 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7765 __isl_take isl_set
*set
)
7767 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7770 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7771 __isl_take isl_set
*set
)
7775 ok
= isl_map_compatible_domain(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_domain
);
7789 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7790 __isl_take isl_set
*set
)
7792 return isl_map_align_params_map_map_and(map
, set
,
7793 &map_intersect_domain
);
7796 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7797 __isl_take isl_map
*map2
)
7801 map1
= isl_map_reverse(map1
);
7802 map1
= isl_map_apply_range(map1
, map2
);
7803 return isl_map_reverse(map1
);
7810 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7811 __isl_take isl_map
*map2
)
7813 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7816 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7817 __isl_take isl_map
*map2
)
7819 isl_space
*dim_result
;
7820 struct isl_map
*result
;
7826 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7827 isl_space_copy(map2
->dim
));
7829 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7832 for (i
= 0; i
< map1
->n
; ++i
)
7833 for (j
= 0; j
< map2
->n
; ++j
) {
7834 result
= isl_map_add_basic_map(result
,
7835 isl_basic_map_apply_range(
7836 isl_basic_map_copy(map1
->p
[i
]),
7837 isl_basic_map_copy(map2
->p
[j
])));
7843 if (result
&& result
->n
<= 1)
7844 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7852 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7853 __isl_take isl_map
*map2
)
7855 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7859 * returns range - domain
7861 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
7863 isl_space
*target_space
;
7864 struct isl_basic_set
*bset
;
7871 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7872 bmap
->dim
, isl_dim_out
),
7874 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
7875 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
7876 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7877 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
7878 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
7879 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
7880 for (i
= 0; i
< dim
; ++i
) {
7881 int j
= isl_basic_map_alloc_equality(bmap
);
7883 bmap
= isl_basic_map_free(bmap
);
7886 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7887 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7888 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
7889 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7891 bset
= isl_basic_map_domain(bmap
);
7892 bset
= isl_basic_set_reset_space(bset
, target_space
);
7895 isl_basic_map_free(bmap
);
7900 * returns range - domain
7902 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7906 struct isl_set
*result
;
7911 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7912 map
->dim
, isl_dim_out
),
7914 dim
= isl_map_get_space(map
);
7915 dim
= isl_space_domain(dim
);
7916 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7919 for (i
= 0; i
< map
->n
; ++i
)
7920 result
= isl_set_add_basic_set(result
,
7921 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7930 * returns [domain -> range] -> range - domain
7932 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7933 __isl_take isl_basic_map
*bmap
)
7937 isl_basic_map
*domain
;
7941 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7942 bmap
->dim
, isl_dim_out
))
7943 isl_die(bmap
->ctx
, isl_error_invalid
,
7944 "domain and range don't match", goto error
);
7946 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7947 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7949 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7950 domain
= isl_basic_map_universe(dim
);
7952 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7953 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7954 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7956 total
= isl_basic_map_total_dim(bmap
);
7958 for (i
= 0; i
< n
; ++i
) {
7959 k
= isl_basic_map_alloc_equality(bmap
);
7962 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7963 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7964 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7965 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7968 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7969 return isl_basic_map_finalize(bmap
);
7971 isl_basic_map_free(bmap
);
7976 * returns [domain -> range] -> range - domain
7978 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7981 isl_space
*domain_dim
;
7986 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7987 map
->dim
, isl_dim_out
))
7988 isl_die(map
->ctx
, isl_error_invalid
,
7989 "domain and range don't match", goto error
);
7991 map
= isl_map_cow(map
);
7995 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7996 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7997 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
8000 for (i
= 0; i
< map
->n
; ++i
) {
8001 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8005 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8012 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
8014 struct isl_basic_map
*bmap
;
8022 nparam
= dims
->nparam
;
8024 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
8028 for (i
= 0; i
< dim
; ++i
) {
8029 int j
= isl_basic_map_alloc_equality(bmap
);
8032 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8033 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8034 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
8036 return isl_basic_map_finalize(bmap
);
8038 isl_basic_map_free(bmap
);
8042 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
8046 if (dim
->n_in
!= dim
->n_out
)
8047 isl_die(dim
->ctx
, isl_error_invalid
,
8048 "number of input and output dimensions needs to be "
8049 "the same", goto error
);
8050 return basic_map_identity(dim
);
8052 isl_space_free(dim
);
8056 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8058 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8061 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8063 isl_space
*dim
= isl_set_get_space(set
);
8065 id
= isl_map_identity(isl_space_map_from_set(dim
));
8066 return isl_map_intersect_range(id
, set
);
8069 /* Construct a basic set with all set dimensions having only non-negative
8072 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8073 __isl_take isl_space
*space
)
8078 struct isl_basic_set
*bset
;
8082 nparam
= space
->nparam
;
8084 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8087 for (i
= 0; i
< dim
; ++i
) {
8088 int k
= isl_basic_set_alloc_inequality(bset
);
8091 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8092 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8096 isl_basic_set_free(bset
);
8100 /* Construct the half-space x_pos >= 0.
8102 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
8106 isl_basic_set
*nonneg
;
8108 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8109 k
= isl_basic_set_alloc_inequality(nonneg
);
8112 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8113 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8115 return isl_basic_set_finalize(nonneg
);
8117 isl_basic_set_free(nonneg
);
8121 /* Construct the half-space x_pos <= -1.
8123 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
8128 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8129 k
= isl_basic_set_alloc_inequality(neg
);
8132 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8133 isl_int_set_si(neg
->ineq
[k
][0], -1);
8134 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8136 return isl_basic_set_finalize(neg
);
8138 isl_basic_set_free(neg
);
8142 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8143 enum isl_dim_type type
, unsigned first
, unsigned n
)
8147 isl_basic_set
*nonneg
;
8155 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8157 offset
= pos(set
->dim
, type
);
8158 for (i
= 0; i
< n
; ++i
) {
8159 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8160 offset
+ first
+ i
);
8161 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8163 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8172 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8174 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8180 return isl_stat_error
;
8181 if (isl_set_plain_is_empty(set
)) {
8186 return fn(set
, signs
, user
);
8189 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8191 half
= isl_set_intersect(half
, isl_set_copy(set
));
8192 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8196 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8198 half
= isl_set_intersect(half
, set
);
8199 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8202 return isl_stat_error
;
8205 /* Call "fn" on the intersections of "set" with each of the orthants
8206 * (except for obviously empty intersections). The orthant is identified
8207 * by the signs array, with each entry having value 1 or -1 according
8208 * to the sign of the corresponding variable.
8210 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8211 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8220 return isl_stat_error
;
8221 if (isl_set_plain_is_empty(set
))
8224 nparam
= isl_set_dim(set
, isl_dim_param
);
8225 nvar
= isl_set_dim(set
, isl_dim_set
);
8227 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8229 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8237 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8239 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8242 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8243 __isl_keep isl_basic_map
*bmap2
)
8246 struct isl_map
*map1
;
8247 struct isl_map
*map2
;
8249 if (!bmap1
|| !bmap2
)
8250 return isl_bool_error
;
8252 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8253 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8255 is_subset
= isl_map_is_subset(map1
, map2
);
8263 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8264 __isl_keep isl_basic_set
*bset2
)
8266 return isl_basic_map_is_subset(bset1
, bset2
);
8269 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8270 __isl_keep isl_basic_map
*bmap2
)
8274 if (!bmap1
|| !bmap2
)
8275 return isl_bool_error
;
8276 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8277 if (is_subset
!= isl_bool_true
)
8279 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8283 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8284 __isl_keep isl_basic_set
*bset2
)
8286 return isl_basic_map_is_equal(
8287 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8290 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8296 return isl_bool_error
;
8297 for (i
= 0; i
< map
->n
; ++i
) {
8298 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8300 return isl_bool_error
;
8302 return isl_bool_false
;
8304 return isl_bool_true
;
8307 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8309 return map
? map
->n
== 0 : isl_bool_error
;
8312 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8314 return set
? set
->n
== 0 : isl_bool_error
;
8317 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8319 return isl_map_is_empty(set_to_map(set
));
8322 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8323 __isl_keep isl_map
*map2
)
8326 return isl_bool_error
;
8328 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8331 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8332 __isl_keep isl_set
*set2
)
8335 return isl_bool_error
;
8337 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8340 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8345 return isl_bool_error
;
8346 is_subset
= isl_map_is_subset(map1
, map2
);
8347 if (is_subset
!= isl_bool_true
)
8349 is_subset
= isl_map_is_subset(map2
, map1
);
8353 /* Is "map1" equal to "map2"?
8355 * First check if they are obviously equal.
8356 * If not, then perform a more detailed analysis.
8358 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8362 equal
= isl_map_plain_is_equal(map1
, map2
);
8363 if (equal
< 0 || equal
)
8365 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8368 isl_bool
isl_basic_map_is_strict_subset(
8369 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8373 if (!bmap1
|| !bmap2
)
8374 return isl_bool_error
;
8375 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8376 if (is_subset
!= isl_bool_true
)
8378 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8379 if (is_subset
== isl_bool_error
)
8384 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8385 __isl_keep isl_map
*map2
)
8390 return isl_bool_error
;
8391 is_subset
= isl_map_is_subset(map1
, map2
);
8392 if (is_subset
!= isl_bool_true
)
8394 is_subset
= isl_map_is_subset(map2
, map1
);
8395 if (is_subset
== isl_bool_error
)
8400 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8401 __isl_keep isl_set
*set2
)
8403 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8406 /* Is "bmap" obviously equal to the universe with the same space?
8408 * That is, does it not have any constraints?
8410 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8413 return isl_bool_error
;
8414 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8417 /* Is "bset" obviously equal to the universe with the same space?
8419 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8421 return isl_basic_map_plain_is_universe(bset
);
8424 /* If "c" does not involve any existentially quantified variables,
8425 * then set *univ to false and abort
8427 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8429 isl_bool
*univ
= user
;
8432 n
= isl_constraint_dim(c
, isl_dim_div
);
8433 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8434 isl_constraint_free(c
);
8435 if (*univ
< 0 || !*univ
)
8436 return isl_stat_error
;
8440 /* Is "bmap" equal to the universe with the same space?
8442 * First check if it is obviously equal to the universe.
8443 * If not and if there are any constraints not involving
8444 * existentially quantified variables, then it is certainly
8445 * not equal to the universe.
8446 * Otherwise, check if the universe is a subset of "bmap".
8448 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8451 isl_basic_map
*test
;
8453 univ
= isl_basic_map_plain_is_universe(bmap
);
8454 if (univ
< 0 || univ
)
8456 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8457 return isl_bool_false
;
8458 univ
= isl_bool_true
;
8459 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8461 return isl_bool_error
;
8462 if (univ
< 0 || !univ
)
8464 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8465 univ
= isl_basic_map_is_subset(test
, bmap
);
8466 isl_basic_map_free(test
);
8470 /* Is "bset" equal to the universe with the same space?
8472 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8474 return isl_basic_map_is_universe(bset
);
8477 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8482 return isl_bool_error
;
8484 for (i
= 0; i
< map
->n
; ++i
) {
8485 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8490 return isl_bool_false
;
8493 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8495 return isl_map_plain_is_universe(set_to_map(set
));
8498 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8500 struct isl_basic_set
*bset
= NULL
;
8501 struct isl_vec
*sample
= NULL
;
8502 isl_bool empty
, non_empty
;
8505 return isl_bool_error
;
8507 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8508 return isl_bool_true
;
8510 if (isl_basic_map_plain_is_universe(bmap
))
8511 return isl_bool_false
;
8513 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8514 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8515 copy
= isl_basic_map_remove_redundancies(copy
);
8516 empty
= isl_basic_map_plain_is_empty(copy
);
8517 isl_basic_map_free(copy
);
8521 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8523 return isl_bool_error
;
8525 return isl_bool_false
;
8526 isl_vec_free(bmap
->sample
);
8527 bmap
->sample
= NULL
;
8528 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8530 return isl_bool_error
;
8531 sample
= isl_basic_set_sample_vec(bset
);
8533 return isl_bool_error
;
8534 empty
= sample
->size
== 0;
8535 isl_vec_free(bmap
->sample
);
8536 bmap
->sample
= sample
;
8538 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8543 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8546 return isl_bool_error
;
8547 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8550 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8553 return isl_bool_error
;
8554 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8557 /* Is "bmap" known to be non-empty?
8559 * That is, is the cached sample still valid?
8561 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8566 return isl_bool_error
;
8568 return isl_bool_false
;
8569 total
= 1 + isl_basic_map_total_dim(bmap
);
8570 if (bmap
->sample
->size
!= total
)
8571 return isl_bool_false
;
8572 return isl_basic_map_contains(bmap
, bmap
->sample
);
8575 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8577 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8580 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8581 __isl_take isl_basic_map
*bmap2
)
8583 struct isl_map
*map
;
8584 if (!bmap1
|| !bmap2
)
8587 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8589 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8592 map
= isl_map_add_basic_map(map
, bmap1
);
8593 map
= isl_map_add_basic_map(map
, bmap2
);
8596 isl_basic_map_free(bmap1
);
8597 isl_basic_map_free(bmap2
);
8601 struct isl_set
*isl_basic_set_union(
8602 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8604 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8605 bset_to_bmap(bset2
)));
8608 /* Order divs such that any div only depends on previous divs */
8609 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8610 __isl_take isl_basic_map
*bmap
)
8618 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8620 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8622 if (isl_int_is_zero(bmap
->div
[i
][0]))
8624 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8629 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8630 "integer division depends on itself",
8631 return isl_basic_map_free(bmap
));
8632 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8638 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8640 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8643 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8650 for (i
= 0; i
< map
->n
; ++i
) {
8651 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8662 /* Sort the local variables of "bset".
8664 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8665 __isl_take isl_basic_set
*bset
)
8667 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8670 /* Apply the expansion computed by isl_merge_divs.
8671 * The expansion itself is given by "exp" while the resulting
8672 * list of divs is given by "div".
8674 * Move the integer divisions of "bmap" into the right position
8675 * according to "exp" and then introduce the additional integer
8676 * divisions, adding div constraints.
8677 * The moving should be done first to avoid moving coefficients
8678 * in the definitions of the extra integer divisions.
8680 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8681 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8686 bmap
= isl_basic_map_cow(bmap
);
8690 if (div
->n_row
< bmap
->n_div
)
8691 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8692 "not an expansion", goto error
);
8694 n_div
= bmap
->n_div
;
8695 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8696 div
->n_row
- n_div
, 0,
8697 2 * (div
->n_row
- n_div
));
8699 for (i
= n_div
; i
< div
->n_row
; ++i
)
8700 if (isl_basic_map_alloc_div(bmap
) < 0)
8703 for (j
= n_div
- 1; j
>= 0; --j
) {
8706 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8709 for (i
= 0; i
< div
->n_row
; ++i
) {
8710 if (j
< n_div
&& exp
[j
] == i
) {
8713 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8714 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8716 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8724 isl_basic_map_free(bmap
);
8729 /* Apply the expansion computed by isl_merge_divs.
8730 * The expansion itself is given by "exp" while the resulting
8731 * list of divs is given by "div".
8733 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8734 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8736 return isl_basic_map_expand_divs(bset
, div
, exp
);
8739 /* Look for a div in dst that corresponds to the div "div" in src.
8740 * The divs before "div" in src and dst are assumed to be the same.
8742 * Returns -1 if no corresponding div was found and the position
8743 * of the corresponding div in dst otherwise.
8745 static int find_div(__isl_keep isl_basic_map
*dst
,
8746 __isl_keep isl_basic_map
*src
, unsigned div
)
8750 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8752 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8753 for (i
= div
; i
< dst
->n_div
; ++i
)
8754 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8755 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8756 dst
->n_div
- div
) == -1)
8761 /* Align the divs of "dst" to those of "src", adding divs from "src"
8762 * if needed. That is, make sure that the first src->n_div divs
8763 * of the result are equal to those of src.
8765 * The result is not finalized as by design it will have redundant
8766 * divs if any divs from "src" were copied.
8768 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8769 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8772 int known
, extended
;
8776 return isl_basic_map_free(dst
);
8778 if (src
->n_div
== 0)
8781 known
= isl_basic_map_divs_known(src
);
8783 return isl_basic_map_free(dst
);
8785 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8786 "some src divs are unknown",
8787 return isl_basic_map_free(dst
));
8789 src
= isl_basic_map_order_divs(src
);
8792 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8793 for (i
= 0; i
< src
->n_div
; ++i
) {
8794 int j
= find_div(dst
, src
, i
);
8797 int extra
= src
->n_div
- i
;
8798 dst
= isl_basic_map_cow(dst
);
8801 dst
= isl_basic_map_extend_space(dst
,
8802 isl_space_copy(dst
->dim
),
8803 extra
, 0, 2 * extra
);
8806 j
= isl_basic_map_alloc_div(dst
);
8808 return isl_basic_map_free(dst
);
8809 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8810 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8811 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8812 return isl_basic_map_free(dst
);
8815 isl_basic_map_swap_div(dst
, i
, j
);
8820 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
8828 map
= isl_map_compute_divs(map
);
8829 map
= isl_map_cow(map
);
8833 for (i
= 1; i
< map
->n
; ++i
)
8834 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8835 for (i
= 1; i
< map
->n
; ++i
) {
8836 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8838 return isl_map_free(map
);
8841 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8845 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
8847 return isl_map_align_divs_internal(map
);
8850 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8852 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
8855 /* Align the divs of the basic maps in "map" to those
8856 * of the basic maps in "list", as well as to the other basic maps in "map".
8857 * The elements in "list" are assumed to have known divs.
8859 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8860 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8864 map
= isl_map_compute_divs(map
);
8865 map
= isl_map_cow(map
);
8867 return isl_map_free(map
);
8871 n
= isl_basic_map_list_n_basic_map(list
);
8872 for (i
= 0; i
< n
; ++i
) {
8873 isl_basic_map
*bmap
;
8875 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8876 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8877 isl_basic_map_free(bmap
);
8880 return isl_map_free(map
);
8882 return isl_map_align_divs_internal(map
);
8885 /* Align the divs of each element of "list" to those of "bmap".
8886 * Both "bmap" and the elements of "list" are assumed to have known divs.
8888 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
8889 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
8894 return isl_basic_map_list_free(list
);
8896 n
= isl_basic_map_list_n_basic_map(list
);
8897 for (i
= 0; i
< n
; ++i
) {
8898 isl_basic_map
*bmap_i
;
8900 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
8901 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
8902 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
8908 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8909 __isl_take isl_map
*map
)
8913 ok
= isl_map_compatible_domain(map
, set
);
8917 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
8918 "incompatible spaces", goto error
);
8919 map
= isl_map_intersect_domain(map
, set
);
8920 set
= isl_map_range(map
);
8928 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8929 __isl_take isl_map
*map
)
8931 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8934 /* There is no need to cow as removing empty parts doesn't change
8935 * the meaning of the set.
8937 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8944 for (i
= map
->n
- 1; i
>= 0; --i
)
8945 remove_if_empty(map
, i
);
8950 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8952 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
8955 /* Given two basic sets bset1 and bset2, compute the maximal difference
8956 * between the values of dimension pos in bset1 and those in bset2
8957 * for any common value of the parameters and dimensions preceding pos.
8959 static enum isl_lp_result
basic_set_maximal_difference_at(
8960 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8961 int pos
, isl_int
*opt
)
8963 isl_basic_map
*bmap1
;
8964 isl_basic_map
*bmap2
;
8965 struct isl_ctx
*ctx
;
8966 struct isl_vec
*obj
;
8970 enum isl_lp_result res
;
8972 if (!bset1
|| !bset2
)
8973 return isl_lp_error
;
8975 nparam
= isl_basic_set_n_param(bset1
);
8976 dim1
= isl_basic_set_n_dim(bset1
);
8978 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
8979 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
8980 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
8981 isl_dim_out
, 0, pos
);
8982 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
8983 isl_dim_out
, 0, pos
);
8984 bmap1
= isl_basic_map_range_product(bmap1
, bmap2
);
8986 return isl_lp_error
;
8988 total
= isl_basic_map_total_dim(bmap1
);
8990 obj
= isl_vec_alloc(ctx
, 1 + total
);
8993 isl_seq_clr(obj
->block
.data
, 1 + total
);
8994 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8995 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8996 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8998 isl_basic_map_free(bmap1
);
9002 isl_basic_map_free(bmap1
);
9003 return isl_lp_error
;
9006 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9007 * for any common value of the parameters and dimensions preceding pos
9008 * in both basic sets, the values of dimension pos in bset1 are
9009 * smaller or larger than those in bset2.
9012 * 1 if bset1 follows bset2
9013 * -1 if bset1 precedes bset2
9014 * 0 if bset1 and bset2 are incomparable
9015 * -2 if some error occurred.
9017 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
9018 struct isl_basic_set
*bset2
, int pos
)
9021 enum isl_lp_result res
;
9026 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9028 if (res
== isl_lp_empty
)
9030 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9031 res
== isl_lp_unbounded
)
9033 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9042 /* Given two basic sets bset1 and bset2, check whether
9043 * for any common value of the parameters and dimensions preceding pos
9044 * there is a value of dimension pos in bset1 that is larger
9045 * than a value of the same dimension in bset2.
9048 * 1 if there exists such a pair
9049 * 0 if there is no such pair, but there is a pair of equal values
9051 * -2 if some error occurred.
9053 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9054 __isl_keep isl_basic_set
*bset2
, int pos
)
9057 enum isl_lp_result res
;
9062 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9064 if (res
== isl_lp_empty
)
9066 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9067 res
== isl_lp_unbounded
)
9069 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9071 else if (res
== isl_lp_ok
)
9080 /* Given two sets set1 and set2, check whether
9081 * for any common value of the parameters and dimensions preceding pos
9082 * there is a value of dimension pos in set1 that is larger
9083 * than a value of the same dimension in set2.
9086 * 1 if there exists such a pair
9087 * 0 if there is no such pair, but there is a pair of equal values
9089 * -2 if some error occurred.
9091 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9092 __isl_keep isl_set
*set2
, int pos
)
9100 for (i
= 0; i
< set1
->n
; ++i
)
9101 for (j
= 0; j
< set2
->n
; ++j
) {
9103 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9104 if (f
== 1 || f
== -2)
9113 static isl_bool
isl_basic_map_plain_has_fixed_var(
9114 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9121 return isl_bool_error
;
9122 total
= isl_basic_map_total_dim(bmap
);
9123 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9124 for (; d
+1 > pos
; --d
)
9125 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9129 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9130 return isl_bool_false
;
9131 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9132 return isl_bool_false
;
9133 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9134 return isl_bool_false
;
9136 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9137 return isl_bool_true
;
9139 return isl_bool_false
;
9142 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9143 unsigned pos
, isl_int
*val
)
9151 return isl_bool_error
;
9153 return isl_bool_false
;
9155 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9158 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9159 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9160 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9161 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9162 fixed
= isl_bool_false
;
9165 isl_int_set(*val
, v
);
9171 static isl_bool
isl_basic_set_plain_has_fixed_var(
9172 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9174 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9178 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9179 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9181 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9182 return isl_bool_error
;
9183 return isl_basic_map_plain_has_fixed_var(bmap
,
9184 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9187 /* If "bmap" obviously lies on a hyperplane where the given dimension
9188 * has a fixed value, then return that value.
9189 * Otherwise return NaN.
9191 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9192 __isl_keep isl_basic_map
*bmap
,
9193 enum isl_dim_type type
, unsigned pos
)
9201 ctx
= isl_basic_map_get_ctx(bmap
);
9202 v
= isl_val_alloc(ctx
);
9205 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9207 return isl_val_free(v
);
9209 isl_int_set_si(v
->d
, 1);
9213 return isl_val_nan(ctx
);
9216 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9217 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9219 if (pos
>= isl_map_dim(map
, type
))
9220 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9221 "position out of bounds", return isl_bool_error
);
9222 return isl_map_plain_has_fixed_var(map
,
9223 map_offset(map
, type
) - 1 + pos
, val
);
9226 /* If "map" obviously lies on a hyperplane where the given dimension
9227 * has a fixed value, then return that value.
9228 * Otherwise return NaN.
9230 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9231 enum isl_dim_type type
, unsigned pos
)
9239 ctx
= isl_map_get_ctx(map
);
9240 v
= isl_val_alloc(ctx
);
9243 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9245 return isl_val_free(v
);
9247 isl_int_set_si(v
->d
, 1);
9251 return isl_val_nan(ctx
);
9254 /* If "set" obviously lies on a hyperplane where the given dimension
9255 * has a fixed value, then return that value.
9256 * Otherwise return NaN.
9258 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9259 enum isl_dim_type type
, unsigned pos
)
9261 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9264 isl_bool
isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
9265 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9267 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
9270 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9271 * then return this fixed value in *val.
9273 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9274 unsigned dim
, isl_int
*val
)
9276 return isl_basic_set_plain_has_fixed_var(bset
,
9277 isl_basic_set_n_param(bset
) + dim
, val
);
9280 /* Return -1 if the constraint "c1" should be sorted before "c2"
9281 * and 1 if it should be sorted after "c2".
9282 * Return 0 if the two constraints are the same (up to the constant term).
9284 * In particular, if a constraint involves later variables than another
9285 * then it is sorted after this other constraint.
9286 * uset_gist depends on constraints without existentially quantified
9287 * variables sorting first.
9289 * For constraints that have the same latest variable, those
9290 * with the same coefficient for this latest variable (first in absolute value
9291 * and then in actual value) are grouped together.
9292 * This is useful for detecting pairs of constraints that can
9293 * be chained in their printed representation.
9295 * Finally, within a group, constraints are sorted according to
9296 * their coefficients (excluding the constant term).
9298 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9300 isl_int
**c1
= (isl_int
**) p1
;
9301 isl_int
**c2
= (isl_int
**) p2
;
9303 unsigned size
= *(unsigned *) arg
;
9306 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9307 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9312 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9315 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9319 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9322 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9323 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9324 * and 0 if the two constraints are the same (up to the constant term).
9326 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9327 isl_int
*c1
, isl_int
*c2
)
9333 total
= isl_basic_map_total_dim(bmap
);
9334 return sort_constraint_cmp(&c1
, &c2
, &total
);
9337 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9338 __isl_take isl_basic_map
*bmap
)
9344 if (bmap
->n_ineq
== 0)
9346 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9348 total
= isl_basic_map_total_dim(bmap
);
9349 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9350 &sort_constraint_cmp
, &total
) < 0)
9351 return isl_basic_map_free(bmap
);
9355 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9356 __isl_take isl_basic_set
*bset
)
9358 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9359 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9362 __isl_give isl_basic_map
*isl_basic_map_normalize(
9363 __isl_take isl_basic_map
*bmap
)
9367 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9369 bmap
= isl_basic_map_remove_redundancies(bmap
);
9370 bmap
= isl_basic_map_sort_constraints(bmap
);
9372 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9375 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9376 __isl_keep isl_basic_map
*bmap2
)
9380 isl_space
*space1
, *space2
;
9382 if (!bmap1
|| !bmap2
)
9387 space1
= isl_basic_map_peek_space(bmap1
);
9388 space2
= isl_basic_map_peek_space(bmap2
);
9389 cmp
= isl_space_cmp(space1
, space2
);
9392 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9393 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9394 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9395 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9396 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9398 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9400 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9402 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9403 return bmap1
->n_eq
- bmap2
->n_eq
;
9404 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9405 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9406 if (bmap1
->n_div
!= bmap2
->n_div
)
9407 return bmap1
->n_div
- bmap2
->n_div
;
9408 total
= isl_basic_map_total_dim(bmap1
);
9409 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9410 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9414 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9415 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9419 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9420 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9427 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9428 __isl_keep isl_basic_set
*bset2
)
9430 return isl_basic_map_plain_cmp(bset1
, bset2
);
9433 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9439 if (set1
->n
!= set2
->n
)
9440 return set1
->n
- set2
->n
;
9442 for (i
= 0; i
< set1
->n
; ++i
) {
9443 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9451 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9452 __isl_keep isl_basic_map
*bmap2
)
9454 if (!bmap1
|| !bmap2
)
9455 return isl_bool_error
;
9456 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9459 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9460 __isl_keep isl_basic_set
*bset2
)
9462 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9463 bset_to_bmap(bset2
));
9466 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9468 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9469 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9471 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9474 /* Sort the basic maps of "map" and remove duplicate basic maps.
9476 * While removing basic maps, we make sure that the basic maps remain
9477 * sorted because isl_map_normalize expects the basic maps of the result
9480 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9484 map
= isl_map_remove_empty_parts(map
);
9487 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9488 for (i
= map
->n
- 1; i
>= 1; --i
) {
9489 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9491 isl_basic_map_free(map
->p
[i
-1]);
9492 for (j
= i
; j
< map
->n
; ++j
)
9493 map
->p
[j
- 1] = map
->p
[j
];
9500 /* Remove obvious duplicates among the basic maps of "map".
9502 * Unlike isl_map_normalize, this function does not remove redundant
9503 * constraints and only removes duplicates that have exactly the same
9504 * constraints in the input. It does sort the constraints and
9505 * the basic maps to ease the detection of duplicates.
9507 * If "map" has already been normalized or if the basic maps are
9508 * disjoint, then there can be no duplicates.
9510 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9513 isl_basic_map
*bmap
;
9519 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9521 for (i
= 0; i
< map
->n
; ++i
) {
9522 bmap
= isl_basic_map_copy(map
->p
[i
]);
9523 bmap
= isl_basic_map_sort_constraints(bmap
);
9525 return isl_map_free(map
);
9526 isl_basic_map_free(map
->p
[i
]);
9530 map
= sort_and_remove_duplicates(map
);
9534 /* We normalize in place, but if anything goes wrong we need
9535 * to return NULL, so we need to make sure we don't change the
9536 * meaning of any possible other copies of map.
9538 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9541 struct isl_basic_map
*bmap
;
9545 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9547 for (i
= 0; i
< map
->n
; ++i
) {
9548 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9551 isl_basic_map_free(map
->p
[i
]);
9555 map
= sort_and_remove_duplicates(map
);
9557 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9564 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9566 return set_from_map(isl_map_normalize(set_to_map(set
)));
9569 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9570 __isl_keep isl_map
*map2
)
9576 return isl_bool_error
;
9579 return isl_bool_true
;
9580 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9581 return isl_bool_false
;
9583 map1
= isl_map_copy(map1
);
9584 map2
= isl_map_copy(map2
);
9585 map1
= isl_map_normalize(map1
);
9586 map2
= isl_map_normalize(map2
);
9589 equal
= map1
->n
== map2
->n
;
9590 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9591 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9601 return isl_bool_error
;
9604 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9605 __isl_keep isl_set
*set2
)
9607 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9610 /* Return the basic maps in "map" as a list.
9612 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9613 __isl_keep isl_map
*map
)
9617 isl_basic_map_list
*list
;
9621 ctx
= isl_map_get_ctx(map
);
9622 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9624 for (i
= 0; i
< map
->n
; ++i
) {
9625 isl_basic_map
*bmap
;
9627 bmap
= isl_basic_map_copy(map
->p
[i
]);
9628 list
= isl_basic_map_list_add(list
, bmap
);
9634 /* Return the intersection of the elements in the non-empty list "list".
9635 * All elements are assumed to live in the same space.
9637 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9638 __isl_take isl_basic_map_list
*list
)
9641 isl_basic_map
*bmap
;
9645 n
= isl_basic_map_list_n_basic_map(list
);
9647 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9648 "expecting non-empty list", goto error
);
9650 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9651 for (i
= 1; i
< n
; ++i
) {
9652 isl_basic_map
*bmap_i
;
9654 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9655 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9658 isl_basic_map_list_free(list
);
9661 isl_basic_map_list_free(list
);
9665 /* Return the intersection of the elements in the non-empty list "list".
9666 * All elements are assumed to live in the same space.
9668 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9669 __isl_take isl_basic_set_list
*list
)
9671 return isl_basic_map_list_intersect(list
);
9674 /* Return the union of the elements of "list".
9675 * The list is required to have at least one element.
9677 __isl_give isl_set
*isl_basic_set_list_union(
9678 __isl_take isl_basic_set_list
*list
)
9682 isl_basic_set
*bset
;
9687 n
= isl_basic_set_list_n_basic_set(list
);
9689 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9690 "expecting non-empty list", goto error
);
9692 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9693 space
= isl_basic_set_get_space(bset
);
9694 isl_basic_set_free(bset
);
9696 set
= isl_set_alloc_space(space
, n
, 0);
9697 for (i
= 0; i
< n
; ++i
) {
9698 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9699 set
= isl_set_add_basic_set(set
, bset
);
9702 isl_basic_set_list_free(list
);
9705 isl_basic_set_list_free(list
);
9709 /* Return the union of the elements in the non-empty list "list".
9710 * All elements are assumed to live in the same space.
9712 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9719 n
= isl_set_list_n_set(list
);
9721 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9722 "expecting non-empty list", goto error
);
9724 set
= isl_set_list_get_set(list
, 0);
9725 for (i
= 1; i
< n
; ++i
) {
9728 set_i
= isl_set_list_get_set(list
, i
);
9729 set
= isl_set_union(set
, set_i
);
9732 isl_set_list_free(list
);
9735 isl_set_list_free(list
);
9739 __isl_give isl_basic_map
*isl_basic_map_product(
9740 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9742 isl_space
*dim_result
= NULL
;
9743 struct isl_basic_map
*bmap
;
9744 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9745 struct isl_dim_map
*dim_map1
, *dim_map2
;
9747 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9749 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9750 isl_space_copy(bmap2
->dim
));
9752 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9753 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9754 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9755 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9756 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9758 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9759 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9760 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9761 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9762 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9763 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9764 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9765 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9766 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9767 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9768 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9770 bmap
= isl_basic_map_alloc_space(dim_result
,
9771 bmap1
->n_div
+ bmap2
->n_div
,
9772 bmap1
->n_eq
+ bmap2
->n_eq
,
9773 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9774 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9775 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9776 bmap
= isl_basic_map_simplify(bmap
);
9777 return isl_basic_map_finalize(bmap
);
9779 isl_basic_map_free(bmap1
);
9780 isl_basic_map_free(bmap2
);
9784 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9785 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9787 isl_basic_map
*prod
;
9789 prod
= isl_basic_map_product(bmap1
, bmap2
);
9790 prod
= isl_basic_map_flatten(prod
);
9794 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9795 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9797 return isl_basic_map_flat_range_product(bset1
, bset2
);
9800 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9801 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9803 isl_space
*space_result
= NULL
;
9804 isl_basic_map
*bmap
;
9805 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9806 struct isl_dim_map
*dim_map1
, *dim_map2
;
9808 if (!bmap1
|| !bmap2
)
9811 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9812 isl_space_copy(bmap2
->dim
));
9814 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9815 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9816 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9817 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9819 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9820 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9821 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9822 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9823 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9824 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9825 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9826 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9827 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9828 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9829 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9831 bmap
= isl_basic_map_alloc_space(space_result
,
9832 bmap1
->n_div
+ bmap2
->n_div
,
9833 bmap1
->n_eq
+ bmap2
->n_eq
,
9834 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9835 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9836 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9837 bmap
= isl_basic_map_simplify(bmap
);
9838 return isl_basic_map_finalize(bmap
);
9840 isl_basic_map_free(bmap1
);
9841 isl_basic_map_free(bmap2
);
9845 __isl_give isl_basic_map
*isl_basic_map_range_product(
9846 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9849 isl_space
*dim_result
= NULL
;
9850 isl_basic_map
*bmap
;
9851 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9852 struct isl_dim_map
*dim_map1
, *dim_map2
;
9854 rational
= isl_basic_map_is_rational(bmap1
);
9855 if (rational
>= 0 && rational
)
9856 rational
= isl_basic_map_is_rational(bmap2
);
9857 if (!bmap1
|| !bmap2
|| rational
< 0)
9860 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9863 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9864 isl_space_copy(bmap2
->dim
));
9866 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9867 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9868 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9869 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9871 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9872 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9873 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9874 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9875 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9876 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9877 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9878 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9879 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9880 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9881 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9883 bmap
= isl_basic_map_alloc_space(dim_result
,
9884 bmap1
->n_div
+ bmap2
->n_div
,
9885 bmap1
->n_eq
+ bmap2
->n_eq
,
9886 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9887 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9888 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9890 bmap
= isl_basic_map_set_rational(bmap
);
9891 bmap
= isl_basic_map_simplify(bmap
);
9892 return isl_basic_map_finalize(bmap
);
9894 isl_basic_map_free(bmap1
);
9895 isl_basic_map_free(bmap2
);
9899 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9900 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9902 isl_basic_map
*prod
;
9904 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9905 prod
= isl_basic_map_flatten_range(prod
);
9909 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
9910 * and collect the results.
9911 * The result live in the space obtained by calling "space_product"
9912 * on the spaces of "map1" and "map2".
9913 * If "remove_duplicates" is set then the result may contain duplicates
9914 * (even if the inputs do not) and so we try and remove the obvious
9917 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9918 __isl_take isl_map
*map2
,
9919 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
9920 __isl_take isl_space
*right
),
9921 __isl_give isl_basic_map
*(*basic_map_product
)(
9922 __isl_take isl_basic_map
*left
,
9923 __isl_take isl_basic_map
*right
),
9924 int remove_duplicates
)
9927 struct isl_map
*result
;
9931 m
= isl_map_has_equal_params(map1
, map2
);
9935 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
9936 "parameters don't match", goto error
);
9938 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9939 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9940 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9942 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
9943 isl_space_copy(map2
->dim
)),
9944 map1
->n
* map2
->n
, flags
);
9947 for (i
= 0; i
< map1
->n
; ++i
)
9948 for (j
= 0; j
< map2
->n
; ++j
) {
9949 struct isl_basic_map
*part
;
9950 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9951 isl_basic_map_copy(map2
->p
[j
]));
9952 if (isl_basic_map_is_empty(part
))
9953 isl_basic_map_free(part
);
9955 result
= isl_map_add_basic_map(result
, part
);
9959 if (remove_duplicates
)
9960 result
= isl_map_remove_obvious_duplicates(result
);
9970 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9972 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9973 __isl_take isl_map
*map2
)
9975 return map_product(map1
, map2
, &isl_space_product
,
9976 &isl_basic_map_product
, 0);
9979 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9980 __isl_take isl_map
*map2
)
9982 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9985 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9987 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9988 __isl_take isl_map
*map2
)
9992 prod
= isl_map_product(map1
, map2
);
9993 prod
= isl_map_flatten(prod
);
9997 /* Given two set A and B, construct its Cartesian product A x B.
9999 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10001 return isl_map_range_product(set1
, set2
);
10004 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10005 __isl_take isl_set
*set2
)
10007 return isl_map_flat_range_product(set1
, set2
);
10010 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10012 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10013 __isl_take isl_map
*map2
)
10015 return map_product(map1
, map2
, &isl_space_domain_product
,
10016 &isl_basic_map_domain_product
, 1);
10019 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10021 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10022 __isl_take isl_map
*map2
)
10024 return map_product(map1
, map2
, &isl_space_range_product
,
10025 &isl_basic_map_range_product
, 1);
10028 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10029 __isl_take isl_map
*map2
)
10031 return isl_map_align_params_map_map_and(map1
, map2
,
10032 &map_domain_product_aligned
);
10035 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10036 __isl_take isl_map
*map2
)
10038 return isl_map_align_params_map_map_and(map1
, map2
,
10039 &map_range_product_aligned
);
10042 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10044 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10047 int total1
, keep1
, total2
, keep2
;
10051 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10052 !isl_space_range_is_wrapping(map
->dim
))
10053 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10054 "not a product", return isl_map_free(map
));
10056 space
= isl_map_get_space(map
);
10057 total1
= isl_space_dim(space
, isl_dim_in
);
10058 total2
= isl_space_dim(space
, isl_dim_out
);
10059 space
= isl_space_factor_domain(space
);
10060 keep1
= isl_space_dim(space
, isl_dim_in
);
10061 keep2
= isl_space_dim(space
, isl_dim_out
);
10062 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10063 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10064 map
= isl_map_reset_space(map
, space
);
10069 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10071 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10074 int total1
, keep1
, total2
, keep2
;
10078 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10079 !isl_space_range_is_wrapping(map
->dim
))
10080 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10081 "not a product", return isl_map_free(map
));
10083 space
= isl_map_get_space(map
);
10084 total1
= isl_space_dim(space
, isl_dim_in
);
10085 total2
= isl_space_dim(space
, isl_dim_out
);
10086 space
= isl_space_factor_range(space
);
10087 keep1
= isl_space_dim(space
, isl_dim_in
);
10088 keep2
= isl_space_dim(space
, isl_dim_out
);
10089 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10090 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10091 map
= isl_map_reset_space(map
, space
);
10096 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10098 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10105 if (!isl_space_domain_is_wrapping(map
->dim
))
10106 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10107 "domain is not a product", return isl_map_free(map
));
10109 space
= isl_map_get_space(map
);
10110 total
= isl_space_dim(space
, isl_dim_in
);
10111 space
= isl_space_domain_factor_domain(space
);
10112 keep
= isl_space_dim(space
, isl_dim_in
);
10113 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10114 map
= isl_map_reset_space(map
, space
);
10119 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10121 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10128 if (!isl_space_domain_is_wrapping(map
->dim
))
10129 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10130 "domain is not a product", return isl_map_free(map
));
10132 space
= isl_map_get_space(map
);
10133 total
= isl_space_dim(space
, isl_dim_in
);
10134 space
= isl_space_domain_factor_range(space
);
10135 keep
= isl_space_dim(space
, isl_dim_in
);
10136 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10137 map
= isl_map_reset_space(map
, space
);
10142 /* Given a map A -> [B -> C], extract the map A -> B.
10144 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10151 if (!isl_space_range_is_wrapping(map
->dim
))
10152 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10153 "range is not a product", return isl_map_free(map
));
10155 space
= isl_map_get_space(map
);
10156 total
= isl_space_dim(space
, isl_dim_out
);
10157 space
= isl_space_range_factor_domain(space
);
10158 keep
= isl_space_dim(space
, isl_dim_out
);
10159 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10160 map
= isl_map_reset_space(map
, space
);
10165 /* Given a map A -> [B -> C], extract the map A -> C.
10167 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10174 if (!isl_space_range_is_wrapping(map
->dim
))
10175 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10176 "range is not a product", return isl_map_free(map
));
10178 space
= isl_map_get_space(map
);
10179 total
= isl_space_dim(space
, isl_dim_out
);
10180 space
= isl_space_range_factor_range(space
);
10181 keep
= isl_space_dim(space
, isl_dim_out
);
10182 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10183 map
= isl_map_reset_space(map
, space
);
10188 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10190 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10191 __isl_take isl_map
*map2
)
10195 prod
= isl_map_domain_product(map1
, map2
);
10196 prod
= isl_map_flatten_domain(prod
);
10200 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10202 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10203 __isl_take isl_map
*map2
)
10207 prod
= isl_map_range_product(map1
, map2
);
10208 prod
= isl_map_flatten_range(prod
);
10212 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10215 uint32_t hash
= isl_hash_init();
10220 bmap
= isl_basic_map_copy(bmap
);
10221 bmap
= isl_basic_map_normalize(bmap
);
10224 total
= isl_basic_map_total_dim(bmap
);
10225 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10226 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10228 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10229 isl_hash_hash(hash
, c_hash
);
10231 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10232 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10234 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10235 isl_hash_hash(hash
, c_hash
);
10237 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10238 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10240 if (isl_int_is_zero(bmap
->div
[i
][0]))
10242 isl_hash_byte(hash
, i
& 0xFF);
10243 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10244 isl_hash_hash(hash
, c_hash
);
10246 isl_basic_map_free(bmap
);
10250 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10252 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10255 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10262 map
= isl_map_copy(map
);
10263 map
= isl_map_normalize(map
);
10267 hash
= isl_hash_init();
10268 for (i
= 0; i
< map
->n
; ++i
) {
10269 uint32_t bmap_hash
;
10270 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10271 isl_hash_hash(hash
, bmap_hash
);
10279 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10281 return isl_map_get_hash(set_to_map(set
));
10284 /* Return the number of basic maps in the (current) representation of "map".
10286 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10288 return map
? map
->n
: 0;
10291 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10293 return set
? set
->n
: 0;
10296 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10297 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10302 return isl_stat_error
;
10304 for (i
= 0; i
< map
->n
; ++i
)
10305 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10306 return isl_stat_error
;
10308 return isl_stat_ok
;
10311 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10312 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10317 return isl_stat_error
;
10319 for (i
= 0; i
< set
->n
; ++i
)
10320 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10321 return isl_stat_error
;
10323 return isl_stat_ok
;
10326 /* Return a list of basic sets, the union of which is equal to "set".
10328 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10329 __isl_keep isl_set
*set
)
10332 isl_basic_set_list
*list
;
10337 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10338 for (i
= 0; i
< set
->n
; ++i
) {
10339 isl_basic_set
*bset
;
10341 bset
= isl_basic_set_copy(set
->p
[i
]);
10342 list
= isl_basic_set_list_add(list
, bset
);
10348 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10355 bset
= isl_basic_set_cow(bset
);
10359 dim
= isl_basic_set_get_space(bset
);
10360 dim
= isl_space_lift(dim
, bset
->n_div
);
10363 isl_space_free(bset
->dim
);
10365 bset
->extra
-= bset
->n_div
;
10368 bset
= isl_basic_set_finalize(bset
);
10372 isl_basic_set_free(bset
);
10376 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10382 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10387 set
= isl_set_cow(set
);
10391 n_div
= set
->p
[0]->n_div
;
10392 dim
= isl_set_get_space(set
);
10393 dim
= isl_space_lift(dim
, n_div
);
10396 isl_space_free(set
->dim
);
10399 for (i
= 0; i
< set
->n
; ++i
) {
10400 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10411 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10419 dim
= isl_basic_set_total_dim(bset
);
10420 size
+= bset
->n_eq
* (1 + dim
);
10421 size
+= bset
->n_ineq
* (1 + dim
);
10422 size
+= bset
->n_div
* (2 + dim
);
10427 int isl_set_size(__isl_keep isl_set
*set
)
10435 for (i
= 0; i
< set
->n
; ++i
)
10436 size
+= isl_basic_set_size(set
->p
[i
]);
10441 /* Check if there is any lower bound (if lower == 0) and/or upper
10442 * bound (if upper == 0) on the specified dim.
10444 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10445 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10449 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10450 return isl_bool_error
;
10452 pos
+= isl_basic_map_offset(bmap
, type
);
10454 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10455 if (isl_int_is_zero(bmap
->div
[i
][0]))
10457 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10458 return isl_bool_true
;
10461 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10462 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10463 return isl_bool_true
;
10465 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10466 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10473 return lower
&& upper
;
10476 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10477 enum isl_dim_type type
, unsigned pos
)
10479 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10482 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10483 enum isl_dim_type type
, unsigned pos
)
10485 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10488 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10489 enum isl_dim_type type
, unsigned pos
)
10491 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10494 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10495 enum isl_dim_type type
, unsigned pos
)
10500 return isl_bool_error
;
10502 for (i
= 0; i
< map
->n
; ++i
) {
10504 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10505 if (bounded
< 0 || !bounded
)
10509 return isl_bool_true
;
10512 /* Return true if the specified dim is involved in both an upper bound
10513 * and a lower bound.
10515 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10516 enum isl_dim_type type
, unsigned pos
)
10518 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10521 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10523 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10524 enum isl_dim_type type
, unsigned pos
,
10525 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10526 enum isl_dim_type type
, unsigned pos
))
10531 return isl_bool_error
;
10533 for (i
= 0; i
< map
->n
; ++i
) {
10535 bounded
= fn(map
->p
[i
], type
, pos
);
10536 if (bounded
< 0 || bounded
)
10540 return isl_bool_false
;
10543 /* Return 1 if the specified dim is involved in any lower bound.
10545 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10546 enum isl_dim_type type
, unsigned pos
)
10548 return has_any_bound(set
, type
, pos
,
10549 &isl_basic_map_dim_has_lower_bound
);
10552 /* Return 1 if the specified dim is involved in any upper bound.
10554 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10555 enum isl_dim_type type
, unsigned pos
)
10557 return has_any_bound(set
, type
, pos
,
10558 &isl_basic_map_dim_has_upper_bound
);
10561 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10563 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10564 enum isl_dim_type type
, unsigned pos
,
10565 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10566 enum isl_dim_type type
, unsigned pos
))
10571 return isl_bool_error
;
10573 for (i
= 0; i
< map
->n
; ++i
) {
10575 bounded
= fn(map
->p
[i
], type
, pos
);
10576 if (bounded
< 0 || !bounded
)
10580 return isl_bool_true
;
10583 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10585 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10586 enum isl_dim_type type
, unsigned pos
)
10588 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10591 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10593 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10594 enum isl_dim_type type
, unsigned pos
)
10596 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10599 /* For each of the "n" variables starting at "first", determine
10600 * the sign of the variable and put the results in the first "n"
10601 * elements of the array "signs".
10603 * 1 means that the variable is non-negative
10604 * -1 means that the variable is non-positive
10605 * 0 means the variable attains both positive and negative values.
10607 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10608 unsigned first
, unsigned n
, int *signs
)
10610 isl_vec
*bound
= NULL
;
10611 struct isl_tab
*tab
= NULL
;
10612 struct isl_tab_undo
*snap
;
10615 if (!bset
|| !signs
)
10616 return isl_stat_error
;
10618 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10619 tab
= isl_tab_from_basic_set(bset
, 0);
10620 if (!bound
|| !tab
)
10623 isl_seq_clr(bound
->el
, bound
->size
);
10624 isl_int_set_si(bound
->el
[0], -1);
10626 snap
= isl_tab_snap(tab
);
10627 for (i
= 0; i
< n
; ++i
) {
10630 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10631 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10633 empty
= tab
->empty
;
10634 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10635 if (isl_tab_rollback(tab
, snap
) < 0)
10643 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10644 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10646 empty
= tab
->empty
;
10647 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10648 if (isl_tab_rollback(tab
, snap
) < 0)
10651 signs
[i
] = empty
? -1 : 0;
10655 isl_vec_free(bound
);
10656 return isl_stat_ok
;
10659 isl_vec_free(bound
);
10660 return isl_stat_error
;
10663 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10664 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10666 if (!bset
|| !signs
)
10667 return isl_stat_error
;
10668 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10669 return isl_stat_error
);
10671 first
+= pos(bset
->dim
, type
) - 1;
10672 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10675 /* Is it possible for the integer division "div" to depend (possibly
10676 * indirectly) on any output dimensions?
10678 * If the div is undefined, then we conservatively assume that it
10679 * may depend on them.
10680 * Otherwise, we check if it actually depends on them or on any integer
10681 * divisions that may depend on them.
10683 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10686 unsigned n_out
, o_out
;
10687 unsigned n_div
, o_div
;
10689 if (isl_int_is_zero(bmap
->div
[div
][0]))
10690 return isl_bool_true
;
10692 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10693 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10695 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10696 return isl_bool_true
;
10698 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10699 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10701 for (i
= 0; i
< n_div
; ++i
) {
10702 isl_bool may_involve
;
10704 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10706 may_involve
= div_may_involve_output(bmap
, i
);
10707 if (may_involve
< 0 || may_involve
)
10708 return may_involve
;
10711 return isl_bool_false
;
10714 /* Return the first integer division of "bmap" in the range
10715 * [first, first + n[ that may depend on any output dimensions and
10716 * that has a non-zero coefficient in "c" (where the first coefficient
10717 * in "c" corresponds to integer division "first").
10719 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10720 isl_int
*c
, int first
, int n
)
10727 for (k
= first
; k
< first
+ n
; ++k
) {
10728 isl_bool may_involve
;
10730 if (isl_int_is_zero(c
[k
]))
10732 may_involve
= div_may_involve_output(bmap
, k
);
10733 if (may_involve
< 0)
10742 /* Look for a pair of inequality constraints in "bmap" of the form
10744 * -l + i >= 0 or i >= l
10746 * n + l - i >= 0 or i <= l + n
10748 * with n < "m" and i the output dimension at position "pos".
10749 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10750 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10751 * and earlier output dimensions, as well as integer divisions that do
10752 * not involve any of the output dimensions.
10754 * Return the index of the first inequality constraint or bmap->n_ineq
10755 * if no such pair can be found.
10757 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10758 int pos
, isl_int m
)
10763 unsigned n_div
, o_div
;
10764 unsigned n_out
, o_out
;
10770 ctx
= isl_basic_map_get_ctx(bmap
);
10771 total
= isl_basic_map_total_dim(bmap
);
10772 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10773 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10774 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10775 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10776 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10777 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10779 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10780 n_out
- (pos
+ 1)) != -1)
10782 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10785 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10786 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10789 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10790 bmap
->ineq
[j
] + 1, total
))
10794 if (j
>= bmap
->n_ineq
)
10796 isl_int_add(bmap
->ineq
[i
][0],
10797 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10798 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10799 isl_int_sub(bmap
->ineq
[i
][0],
10800 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10803 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10809 return bmap
->n_ineq
;
10812 /* Return the index of the equality of "bmap" that defines
10813 * the output dimension "pos" in terms of earlier dimensions.
10814 * The equality may also involve integer divisions, as long
10815 * as those integer divisions are defined in terms of
10816 * parameters or input dimensions.
10817 * In this case, *div is set to the number of integer divisions and
10818 * *ineq is set to the number of inequality constraints (provided
10819 * div and ineq are not NULL).
10821 * The equality may also involve a single integer division involving
10822 * the output dimensions (typically only output dimension "pos") as
10823 * long as the coefficient of output dimension "pos" is 1 or -1 and
10824 * there is a pair of constraints i >= l and i <= l + n, with i referring
10825 * to output dimension "pos", l an expression involving only earlier
10826 * dimensions and n smaller than the coefficient of the integer division
10827 * in the equality. In this case, the output dimension can be defined
10828 * in terms of a modulo expression that does not involve the integer division.
10829 * *div is then set to this single integer division and
10830 * *ineq is set to the index of constraint i >= l.
10832 * Return bmap->n_eq if there is no such equality.
10833 * Return -1 on error.
10835 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10836 int pos
, int *div
, int *ineq
)
10839 unsigned n_out
, o_out
;
10840 unsigned n_div
, o_div
;
10845 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10846 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10847 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10848 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10851 *ineq
= bmap
->n_ineq
;
10854 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10855 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10857 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10858 n_out
- (pos
+ 1)) != -1)
10860 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10864 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
10865 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
10867 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10868 k
+ 1, n_div
- (k
+1)) < n_div
)
10870 l
= find_modulo_constraint_pair(bmap
, pos
,
10871 bmap
->eq
[j
][o_div
+ k
]);
10874 if (l
>= bmap
->n_ineq
)
10886 /* Check if the given basic map is obviously single-valued.
10887 * In particular, for each output dimension, check that there is
10888 * an equality that defines the output dimension in terms of
10889 * earlier dimensions.
10891 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10897 return isl_bool_error
;
10899 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10901 for (i
= 0; i
< n_out
; ++i
) {
10904 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
10907 return isl_bool_error
;
10908 if (eq
>= bmap
->n_eq
)
10909 return isl_bool_false
;
10912 return isl_bool_true
;
10915 /* Check if the given basic map is single-valued.
10916 * We simply compute
10920 * and check if the result is a subset of the identity mapping.
10922 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10925 isl_basic_map
*test
;
10929 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10933 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10934 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10936 space
= isl_basic_map_get_space(bmap
);
10937 space
= isl_space_map_from_set(isl_space_range(space
));
10938 id
= isl_basic_map_identity(space
);
10940 sv
= isl_basic_map_is_subset(test
, id
);
10942 isl_basic_map_free(test
);
10943 isl_basic_map_free(id
);
10948 /* Check if the given map is obviously single-valued.
10950 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10953 return isl_bool_error
;
10955 return isl_bool_true
;
10957 return isl_bool_false
;
10959 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10962 /* Check if the given map is single-valued.
10963 * We simply compute
10967 * and check if the result is a subset of the identity mapping.
10969 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
10976 sv
= isl_map_plain_is_single_valued(map
);
10980 test
= isl_map_reverse(isl_map_copy(map
));
10981 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10983 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10984 id
= isl_map_identity(dim
);
10986 sv
= isl_map_is_subset(test
, id
);
10988 isl_map_free(test
);
10994 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
10998 map
= isl_map_copy(map
);
10999 map
= isl_map_reverse(map
);
11000 in
= isl_map_is_single_valued(map
);
11006 /* Check if the given map is obviously injective.
11008 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11012 map
= isl_map_copy(map
);
11013 map
= isl_map_reverse(map
);
11014 in
= isl_map_plain_is_single_valued(map
);
11020 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11024 sv
= isl_map_is_single_valued(map
);
11028 return isl_map_is_injective(map
);
11031 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11033 return isl_map_is_single_valued(set_to_map(set
));
11036 /* Does "map" only map elements to themselves?
11038 * If the domain and range spaces are different, then "map"
11039 * is considered not to be an identity relation, even if it is empty.
11040 * Otherwise, construct the maximal identity relation and
11041 * check whether "map" is a subset of this relation.
11043 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11047 isl_bool equal
, is_identity
;
11049 space
= isl_map_get_space(map
);
11050 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11051 isl_space_free(space
);
11052 if (equal
< 0 || !equal
)
11055 id
= isl_map_identity(isl_map_get_space(map
));
11056 is_identity
= isl_map_is_subset(map
, id
);
11059 return is_identity
;
11062 int isl_map_is_translation(__isl_keep isl_map
*map
)
11067 delta
= isl_map_deltas(isl_map_copy(map
));
11068 ok
= isl_set_is_singleton(delta
);
11069 isl_set_free(delta
);
11074 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11076 if (isl_seq_first_non_zero(p
, pos
) != -1)
11078 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11083 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11090 return isl_bool_error
;
11092 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11093 return isl_bool_false
;
11095 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11096 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11097 for (j
= 0; j
< nvar
; ++j
) {
11098 int lower
= 0, upper
= 0;
11099 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11100 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11102 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11103 return isl_bool_false
;
11106 if (i
< bset
->n_eq
)
11108 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11109 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11111 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11112 return isl_bool_false
;
11113 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11118 if (!lower
|| !upper
)
11119 return isl_bool_false
;
11122 return isl_bool_true
;
11125 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11128 return isl_bool_error
;
11130 return isl_bool_false
;
11132 return isl_basic_set_is_box(set
->p
[0]);
11135 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11138 return isl_bool_error
;
11140 return isl_space_is_wrapping(bset
->dim
);
11143 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11146 return isl_bool_error
;
11148 return isl_space_is_wrapping(set
->dim
);
11151 /* Modify the space of "map" through a call to "change".
11152 * If "can_change" is set (not NULL), then first call it to check
11153 * if the modification is allowed, printing the error message "cannot_change"
11156 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11157 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11158 const char *cannot_change
,
11159 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11167 ok
= can_change
? can_change(map
) : isl_bool_true
;
11169 return isl_map_free(map
);
11171 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11172 return isl_map_free(map
));
11174 space
= change(isl_map_get_space(map
));
11175 map
= isl_map_reset_space(map
, space
);
11180 /* Is the domain of "map" a wrapped relation?
11182 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11185 return isl_bool_error
;
11187 return isl_space_domain_is_wrapping(map
->dim
);
11190 /* Is the range of "map" a wrapped relation?
11192 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11195 return isl_bool_error
;
11197 return isl_space_range_is_wrapping(map
->dim
);
11200 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11202 bmap
= isl_basic_map_cow(bmap
);
11206 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11210 bmap
= isl_basic_map_finalize(bmap
);
11212 return bset_from_bmap(bmap
);
11214 isl_basic_map_free(bmap
);
11218 /* Given a map A -> B, return the set (A -> B).
11220 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11222 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11225 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11227 bset
= isl_basic_set_cow(bset
);
11231 bset
->dim
= isl_space_unwrap(bset
->dim
);
11235 bset
= isl_basic_set_finalize(bset
);
11237 return bset_to_bmap(bset
);
11239 isl_basic_set_free(bset
);
11243 /* Given a set (A -> B), return the map A -> B.
11244 * Error out if "set" is not of the form (A -> B).
11246 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11248 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11249 "not a wrapping set", &isl_space_unwrap
);
11252 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11253 enum isl_dim_type type
)
11258 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11261 bmap
= isl_basic_map_cow(bmap
);
11265 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11269 bmap
= isl_basic_map_finalize(bmap
);
11273 isl_basic_map_free(bmap
);
11277 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11278 enum isl_dim_type type
)
11285 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11288 map
= isl_map_cow(map
);
11292 for (i
= 0; i
< map
->n
; ++i
) {
11293 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11297 map
->dim
= isl_space_reset(map
->dim
, type
);
11307 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11312 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11315 bmap
= isl_basic_map_cow(bmap
);
11319 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11323 bmap
= isl_basic_map_finalize(bmap
);
11327 isl_basic_map_free(bmap
);
11331 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11333 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11336 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11337 __isl_take isl_basic_map
*bmap
)
11342 if (!bmap
->dim
->nested
[0])
11345 bmap
= isl_basic_map_cow(bmap
);
11349 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11353 bmap
= isl_basic_map_finalize(bmap
);
11357 isl_basic_map_free(bmap
);
11361 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11362 __isl_take isl_basic_map
*bmap
)
11367 if (!bmap
->dim
->nested
[1])
11370 bmap
= isl_basic_map_cow(bmap
);
11374 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11378 bmap
= isl_basic_map_finalize(bmap
);
11382 isl_basic_map_free(bmap
);
11386 /* Remove any internal structure from the spaces of domain and range of "map".
11388 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11393 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11396 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11399 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11401 return set_from_map(isl_map_flatten(set_to_map(set
)));
11404 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11406 isl_space
*dim
, *flat_dim
;
11409 dim
= isl_set_get_space(set
);
11410 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11411 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11412 map
= isl_map_intersect_domain(map
, set
);
11417 /* Remove any internal structure from the space of the domain of "map".
11419 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11424 if (!map
->dim
->nested
[0])
11427 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11430 /* Remove any internal structure from the space of the range of "map".
11432 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11437 if (!map
->dim
->nested
[1])
11440 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11443 /* Reorder the dimensions of "bmap" according to the given dim_map
11444 * and set the dimension specification to "dim" and
11445 * perform Gaussian elimination on the result.
11447 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11448 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11450 isl_basic_map
*res
;
11453 bmap
= isl_basic_map_cow(bmap
);
11454 if (!bmap
|| !dim
|| !dim_map
)
11457 flags
= bmap
->flags
;
11458 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11459 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11460 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11461 res
= isl_basic_map_alloc_space(dim
,
11462 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11463 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11465 res
->flags
= flags
;
11466 res
= isl_basic_map_gauss(res
, NULL
);
11467 res
= isl_basic_map_finalize(res
);
11471 isl_basic_map_free(bmap
);
11472 isl_space_free(dim
);
11476 /* Reorder the dimensions of "map" according to given reordering.
11478 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11479 __isl_take isl_reordering
*r
)
11482 struct isl_dim_map
*dim_map
;
11484 map
= isl_map_cow(map
);
11485 dim_map
= isl_dim_map_from_reordering(r
);
11486 if (!map
|| !r
|| !dim_map
)
11489 for (i
= 0; i
< map
->n
; ++i
) {
11490 struct isl_dim_map
*dim_map_i
;
11492 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11494 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11495 isl_space_copy(r
->dim
), dim_map_i
);
11501 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11503 isl_reordering_free(r
);
11509 isl_reordering_free(r
);
11513 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11514 __isl_take isl_reordering
*r
)
11516 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11519 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11520 __isl_take isl_space
*model
)
11525 if (!map
|| !model
)
11528 ctx
= isl_space_get_ctx(model
);
11529 if (!isl_space_has_named_params(model
))
11530 isl_die(ctx
, isl_error_invalid
,
11531 "model has unnamed parameters", goto error
);
11532 if (isl_map_check_named_params(map
) < 0)
11534 aligned
= isl_map_space_has_equal_params(map
, model
);
11538 isl_reordering
*exp
;
11540 model
= isl_space_drop_dims(model
, isl_dim_in
,
11541 0, isl_space_dim(model
, isl_dim_in
));
11542 model
= isl_space_drop_dims(model
, isl_dim_out
,
11543 0, isl_space_dim(model
, isl_dim_out
));
11544 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11545 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11546 map
= isl_map_realign(map
, exp
);
11549 isl_space_free(model
);
11552 isl_space_free(model
);
11557 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11558 __isl_take isl_space
*model
)
11560 return isl_map_align_params(set
, model
);
11563 /* Align the parameters of "bmap" to those of "model", introducing
11564 * additional parameters if needed.
11566 __isl_give isl_basic_map
*isl_basic_map_align_params(
11567 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11570 isl_bool equal_params
;
11572 if (!bmap
|| !model
)
11575 ctx
= isl_space_get_ctx(model
);
11576 if (!isl_space_has_named_params(model
))
11577 isl_die(ctx
, isl_error_invalid
,
11578 "model has unnamed parameters", goto error
);
11579 if (!isl_space_has_named_params(bmap
->dim
))
11580 isl_die(ctx
, isl_error_invalid
,
11581 "relation has unnamed parameters", goto error
);
11582 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11583 if (equal_params
< 0)
11585 if (!equal_params
) {
11586 isl_reordering
*exp
;
11587 struct isl_dim_map
*dim_map
;
11589 model
= isl_space_drop_dims(model
, isl_dim_in
,
11590 0, isl_space_dim(model
, isl_dim_in
));
11591 model
= isl_space_drop_dims(model
, isl_dim_out
,
11592 0, isl_space_dim(model
, isl_dim_out
));
11593 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11594 exp
= isl_reordering_extend_space(exp
,
11595 isl_basic_map_get_space(bmap
));
11596 dim_map
= isl_dim_map_from_reordering(exp
);
11597 bmap
= isl_basic_map_realign(bmap
,
11598 exp
? isl_space_copy(exp
->dim
) : NULL
,
11599 isl_dim_map_extend(dim_map
, bmap
));
11600 isl_reordering_free(exp
);
11604 isl_space_free(model
);
11607 isl_space_free(model
);
11608 isl_basic_map_free(bmap
);
11612 /* Do "bset" and "space" have the same parameters?
11614 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11615 __isl_keep isl_space
*space
)
11617 isl_space
*bset_space
;
11619 bset_space
= isl_basic_set_peek_space(bset
);
11620 return isl_space_has_equal_params(bset_space
, space
);
11623 /* Do "map" and "space" have the same parameters?
11625 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11626 __isl_keep isl_space
*space
)
11628 isl_space
*map_space
;
11630 map_space
= isl_map_peek_space(map
);
11631 return isl_space_has_equal_params(map_space
, space
);
11634 /* Do "set" and "space" have the same parameters?
11636 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11637 __isl_keep isl_space
*space
)
11639 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11642 /* Align the parameters of "bset" to those of "model", introducing
11643 * additional parameters if needed.
11645 __isl_give isl_basic_set
*isl_basic_set_align_params(
11646 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11648 return isl_basic_map_align_params(bset
, model
);
11651 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11652 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11653 enum isl_dim_type c2
, enum isl_dim_type c3
,
11654 enum isl_dim_type c4
, enum isl_dim_type c5
)
11656 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11657 struct isl_mat
*mat
;
11663 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11664 isl_basic_map_total_dim(bmap
) + 1);
11667 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11668 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11669 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11670 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11671 isl_int_set(mat
->row
[i
][pos
],
11672 bmap
->eq
[i
][off
+ k
]);
11680 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11681 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11682 enum isl_dim_type c2
, enum isl_dim_type c3
,
11683 enum isl_dim_type c4
, enum isl_dim_type c5
)
11685 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11686 struct isl_mat
*mat
;
11692 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11693 isl_basic_map_total_dim(bmap
) + 1);
11696 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11697 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11698 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11699 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11700 isl_int_set(mat
->row
[i
][pos
],
11701 bmap
->ineq
[i
][off
+ k
]);
11709 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11710 __isl_take isl_space
*dim
,
11711 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11712 enum isl_dim_type c2
, enum isl_dim_type c3
,
11713 enum isl_dim_type c4
, enum isl_dim_type c5
)
11715 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11716 isl_basic_map
*bmap
;
11722 if (!dim
|| !eq
|| !ineq
)
11725 if (eq
->n_col
!= ineq
->n_col
)
11726 isl_die(dim
->ctx
, isl_error_invalid
,
11727 "equalities and inequalities matrices should have "
11728 "same number of columns", goto error
);
11730 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11732 if (eq
->n_col
< total
)
11733 isl_die(dim
->ctx
, isl_error_invalid
,
11734 "number of columns too small", goto error
);
11736 extra
= eq
->n_col
- total
;
11738 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11739 eq
->n_row
, ineq
->n_row
);
11742 for (i
= 0; i
< extra
; ++i
) {
11743 k
= isl_basic_map_alloc_div(bmap
);
11746 isl_int_set_si(bmap
->div
[k
][0], 0);
11748 for (i
= 0; i
< eq
->n_row
; ++i
) {
11749 l
= isl_basic_map_alloc_equality(bmap
);
11752 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11753 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11754 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11755 isl_int_set(bmap
->eq
[l
][off
+ k
],
11761 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11762 l
= isl_basic_map_alloc_inequality(bmap
);
11765 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11766 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11767 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11768 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11769 ineq
->row
[i
][pos
]);
11775 isl_space_free(dim
);
11777 isl_mat_free(ineq
);
11779 bmap
= isl_basic_map_simplify(bmap
);
11780 return isl_basic_map_finalize(bmap
);
11782 isl_space_free(dim
);
11784 isl_mat_free(ineq
);
11788 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11789 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11790 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11792 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11793 c1
, c2
, c3
, c4
, isl_dim_in
);
11796 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11797 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11798 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11800 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11801 c1
, c2
, c3
, c4
, isl_dim_in
);
11804 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11805 __isl_take isl_space
*dim
,
11806 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11807 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11809 isl_basic_map
*bmap
;
11810 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11811 c1
, c2
, c3
, c4
, isl_dim_in
);
11812 return bset_from_bmap(bmap
);
11815 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11818 return isl_bool_error
;
11820 return isl_space_can_zip(bmap
->dim
);
11823 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11826 return isl_bool_error
;
11828 return isl_space_can_zip(map
->dim
);
11831 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11832 * (A -> C) -> (B -> D).
11834 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11843 if (!isl_basic_map_can_zip(bmap
))
11844 isl_die(bmap
->ctx
, isl_error_invalid
,
11845 "basic map cannot be zipped", goto error
);
11846 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11847 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11848 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11849 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11850 bmap
= isl_basic_map_cow(bmap
);
11851 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11854 bmap
->dim
= isl_space_zip(bmap
->dim
);
11857 bmap
= isl_basic_map_mark_final(bmap
);
11860 isl_basic_map_free(bmap
);
11864 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11865 * (A -> C) -> (B -> D).
11867 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11874 if (!isl_map_can_zip(map
))
11875 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
11878 map
= isl_map_cow(map
);
11882 for (i
= 0; i
< map
->n
; ++i
) {
11883 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
11888 map
->dim
= isl_space_zip(map
->dim
);
11898 /* Can we apply isl_basic_map_curry to "bmap"?
11899 * That is, does it have a nested relation in its domain?
11901 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
11904 return isl_bool_error
;
11906 return isl_space_can_curry(bmap
->dim
);
11909 /* Can we apply isl_map_curry to "map"?
11910 * That is, does it have a nested relation in its domain?
11912 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
11915 return isl_bool_error
;
11917 return isl_space_can_curry(map
->dim
);
11920 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11923 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
11929 if (!isl_basic_map_can_curry(bmap
))
11930 isl_die(bmap
->ctx
, isl_error_invalid
,
11931 "basic map cannot be curried", goto error
);
11932 bmap
= isl_basic_map_cow(bmap
);
11935 bmap
->dim
= isl_space_curry(bmap
->dim
);
11938 bmap
= isl_basic_map_mark_final(bmap
);
11941 isl_basic_map_free(bmap
);
11945 /* Given a map (A -> B) -> C, return the corresponding map
11948 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11950 return isl_map_change_space(map
, &isl_map_can_curry
,
11951 "map cannot be curried", &isl_space_curry
);
11954 /* Can isl_map_range_curry be applied to "map"?
11955 * That is, does it have a nested relation in its range,
11956 * the domain of which is itself a nested relation?
11958 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
11961 return isl_bool_error
;
11963 return isl_space_can_range_curry(map
->dim
);
11966 /* Given a map A -> ((B -> C) -> D), return the corresponding map
11967 * A -> (B -> (C -> D)).
11969 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
11971 return isl_map_change_space(map
, &isl_map_can_range_curry
,
11972 "map range cannot be curried",
11973 &isl_space_range_curry
);
11976 /* Can we apply isl_basic_map_uncurry to "bmap"?
11977 * That is, does it have a nested relation in its domain?
11979 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11982 return isl_bool_error
;
11984 return isl_space_can_uncurry(bmap
->dim
);
11987 /* Can we apply isl_map_uncurry to "map"?
11988 * That is, does it have a nested relation in its domain?
11990 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
11993 return isl_bool_error
;
11995 return isl_space_can_uncurry(map
->dim
);
11998 /* Given a basic map A -> (B -> C), return the corresponding basic map
12001 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12007 if (!isl_basic_map_can_uncurry(bmap
))
12008 isl_die(bmap
->ctx
, isl_error_invalid
,
12009 "basic map cannot be uncurried",
12010 return isl_basic_map_free(bmap
));
12011 bmap
= isl_basic_map_cow(bmap
);
12014 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12016 return isl_basic_map_free(bmap
);
12017 bmap
= isl_basic_map_mark_final(bmap
);
12021 /* Given a map A -> (B -> C), return the corresponding map
12024 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12026 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12027 "map cannot be uncurried", &isl_space_uncurry
);
12030 /* Construct a basic map mapping the domain of the affine expression
12031 * to a one-dimensional range prescribed by the affine expression.
12032 * If "rational" is set, then construct a rational basic map.
12034 * A NaN affine expression cannot be converted to a basic map.
12036 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
12037 __isl_take isl_aff
*aff
, int rational
)
12042 isl_local_space
*ls
;
12043 isl_basic_map
*bmap
= NULL
;
12047 is_nan
= isl_aff_is_nan(aff
);
12051 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
12052 "cannot convert NaN", goto error
);
12054 ls
= isl_aff_get_local_space(aff
);
12055 bmap
= isl_basic_map_from_local_space(ls
);
12056 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
12057 k
= isl_basic_map_alloc_equality(bmap
);
12061 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
12062 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
12063 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
12064 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
12065 aff
->v
->size
- (pos
+ 1));
12069 bmap
= isl_basic_map_set_rational(bmap
);
12070 bmap
= isl_basic_map_gauss(bmap
, NULL
);
12071 bmap
= isl_basic_map_finalize(bmap
);
12075 isl_basic_map_free(bmap
);
12079 /* Construct a basic map mapping the domain of the affine expression
12080 * to a one-dimensional range prescribed by the affine expression.
12082 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
12084 return isl_basic_map_from_aff2(aff
, 0);
12087 /* Construct a map mapping the domain of the affine expression
12088 * to a one-dimensional range prescribed by the affine expression.
12090 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
12092 isl_basic_map
*bmap
;
12094 bmap
= isl_basic_map_from_aff(aff
);
12095 return isl_map_from_basic_map(bmap
);
12098 /* Construct a basic map mapping the domain the multi-affine expression
12099 * to its range, with each dimension in the range equated to the
12100 * corresponding affine expression.
12101 * If "rational" is set, then construct a rational basic map.
12103 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
12104 __isl_take isl_multi_aff
*maff
, int rational
)
12108 isl_basic_map
*bmap
;
12113 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
12114 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
12115 "invalid space", goto error
);
12117 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
12118 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
12120 bmap
= isl_basic_map_set_rational(bmap
);
12122 for (i
= 0; i
< maff
->n
; ++i
) {
12124 isl_basic_map
*bmap_i
;
12126 aff
= isl_aff_copy(maff
->p
[i
]);
12127 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
12129 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12132 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
12134 isl_multi_aff_free(maff
);
12137 isl_multi_aff_free(maff
);
12141 /* Construct a basic map mapping the domain the multi-affine expression
12142 * to its range, with each dimension in the range equated to the
12143 * corresponding affine expression.
12145 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
12146 __isl_take isl_multi_aff
*ma
)
12148 return isl_basic_map_from_multi_aff2(ma
, 0);
12151 /* Construct a map mapping the domain the multi-affine expression
12152 * to its range, with each dimension in the range equated to the
12153 * corresponding affine expression.
12155 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
12157 isl_basic_map
*bmap
;
12159 bmap
= isl_basic_map_from_multi_aff(maff
);
12160 return isl_map_from_basic_map(bmap
);
12163 /* Construct a basic map mapping a domain in the given space to
12164 * to an n-dimensional range, with n the number of elements in the list,
12165 * where each coordinate in the range is prescribed by the
12166 * corresponding affine expression.
12167 * The domains of all affine expressions in the list are assumed to match
12170 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
12171 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
12175 isl_basic_map
*bmap
;
12180 dim
= isl_space_from_domain(domain_dim
);
12181 bmap
= isl_basic_map_universe(dim
);
12183 for (i
= 0; i
< list
->n
; ++i
) {
12185 isl_basic_map
*bmap_i
;
12187 aff
= isl_aff_copy(list
->p
[i
]);
12188 bmap_i
= isl_basic_map_from_aff(aff
);
12190 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12193 isl_aff_list_free(list
);
12197 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12198 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12200 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12203 /* Construct a basic map where the given dimensions are equal to each other.
12205 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12206 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12208 isl_basic_map
*bmap
= NULL
;
12214 if (pos1
>= isl_space_dim(space
, type1
))
12215 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12216 "index out of bounds", goto error
);
12217 if (pos2
>= isl_space_dim(space
, type2
))
12218 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12219 "index out of bounds", goto error
);
12221 if (type1
== type2
&& pos1
== pos2
)
12222 return isl_basic_map_universe(space
);
12224 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12225 i
= isl_basic_map_alloc_equality(bmap
);
12228 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12229 pos1
+= isl_basic_map_offset(bmap
, type1
);
12230 pos2
+= isl_basic_map_offset(bmap
, type2
);
12231 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12232 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12233 bmap
= isl_basic_map_finalize(bmap
);
12234 isl_space_free(space
);
12237 isl_space_free(space
);
12238 isl_basic_map_free(bmap
);
12242 /* Add a constraint imposing that the given two dimensions are equal.
12244 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12245 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12249 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12251 bmap
= isl_basic_map_intersect(bmap
, eq
);
12256 /* Add a constraint imposing that the given two dimensions are equal.
12258 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12259 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12261 isl_basic_map
*bmap
;
12263 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12265 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12270 /* Add a constraint imposing that the given two dimensions have opposite values.
12272 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12273 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12275 isl_basic_map
*bmap
= NULL
;
12281 if (pos1
>= isl_map_dim(map
, type1
))
12282 isl_die(map
->ctx
, isl_error_invalid
,
12283 "index out of bounds", goto error
);
12284 if (pos2
>= isl_map_dim(map
, type2
))
12285 isl_die(map
->ctx
, isl_error_invalid
,
12286 "index out of bounds", goto error
);
12288 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12289 i
= isl_basic_map_alloc_equality(bmap
);
12292 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12293 pos1
+= isl_basic_map_offset(bmap
, type1
);
12294 pos2
+= isl_basic_map_offset(bmap
, type2
);
12295 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12296 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12297 bmap
= isl_basic_map_finalize(bmap
);
12299 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12303 isl_basic_map_free(bmap
);
12308 /* Construct a constraint imposing that the value of the first dimension is
12309 * greater than or equal to that of the second.
12311 static __isl_give isl_constraint
*constraint_order_ge(
12312 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12313 enum isl_dim_type type2
, int pos2
)
12320 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12322 if (pos1
>= isl_constraint_dim(c
, type1
))
12323 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12324 "index out of bounds", return isl_constraint_free(c
));
12325 if (pos2
>= isl_constraint_dim(c
, type2
))
12326 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12327 "index out of bounds", return isl_constraint_free(c
));
12329 if (type1
== type2
&& pos1
== pos2
)
12332 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12333 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12338 /* Add a constraint imposing that the value of the first dimension is
12339 * greater than or equal to that of the second.
12341 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12342 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12347 if (type1
== type2
&& pos1
== pos2
)
12349 space
= isl_basic_map_get_space(bmap
);
12350 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12351 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12356 /* Add a constraint imposing that the value of the first dimension is
12357 * greater than or equal to that of the second.
12359 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12360 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12365 if (type1
== type2
&& pos1
== pos2
)
12367 space
= isl_map_get_space(map
);
12368 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12369 map
= isl_map_add_constraint(map
, c
);
12374 /* Add a constraint imposing that the value of the first dimension is
12375 * less than or equal to that of the second.
12377 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12378 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12380 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12383 /* Construct a basic map where the value of the first dimension is
12384 * greater than that of the second.
12386 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12387 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12389 isl_basic_map
*bmap
= NULL
;
12395 if (pos1
>= isl_space_dim(space
, type1
))
12396 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12397 "index out of bounds", goto error
);
12398 if (pos2
>= isl_space_dim(space
, type2
))
12399 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12400 "index out of bounds", goto error
);
12402 if (type1
== type2
&& pos1
== pos2
)
12403 return isl_basic_map_empty(space
);
12405 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12406 i
= isl_basic_map_alloc_inequality(bmap
);
12408 return isl_basic_map_free(bmap
);
12409 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12410 pos1
+= isl_basic_map_offset(bmap
, type1
);
12411 pos2
+= isl_basic_map_offset(bmap
, type2
);
12412 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12413 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12414 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12415 bmap
= isl_basic_map_finalize(bmap
);
12419 isl_space_free(space
);
12420 isl_basic_map_free(bmap
);
12424 /* Add a constraint imposing that the value of the first dimension is
12425 * greater than that of the second.
12427 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12428 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12432 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12434 bmap
= isl_basic_map_intersect(bmap
, gt
);
12439 /* Add a constraint imposing that the value of the first dimension is
12440 * greater than that of the second.
12442 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12443 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12445 isl_basic_map
*bmap
;
12447 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12449 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12454 /* Add a constraint imposing that the value of the first dimension is
12455 * smaller than that of the second.
12457 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12458 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12460 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12463 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12467 isl_local_space
*ls
;
12472 if (!isl_basic_map_divs_known(bmap
))
12473 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12474 "some divs are unknown", return NULL
);
12476 ls
= isl_basic_map_get_local_space(bmap
);
12477 div
= isl_local_space_get_div(ls
, pos
);
12478 isl_local_space_free(ls
);
12483 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12486 return isl_basic_map_get_div(bset
, pos
);
12489 /* Plug in "subs" for dimension "type", "pos" of "bset".
12491 * Let i be the dimension to replace and let "subs" be of the form
12495 * Any integer division with a non-zero coefficient for i,
12497 * floor((a i + g)/m)
12501 * floor((a f + d g)/(m d))
12503 * Constraints of the form
12511 * We currently require that "subs" is an integral expression.
12512 * Handling rational expressions may require us to add stride constraints
12513 * as we do in isl_basic_set_preimage_multi_aff.
12515 __isl_give isl_basic_set
*isl_basic_set_substitute(
12516 __isl_take isl_basic_set
*bset
,
12517 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12523 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12526 bset
= isl_basic_set_cow(bset
);
12527 if (!bset
|| !subs
)
12530 ctx
= isl_basic_set_get_ctx(bset
);
12531 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12532 isl_die(ctx
, isl_error_invalid
,
12533 "spaces don't match", goto error
);
12534 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12535 isl_die(ctx
, isl_error_unsupported
,
12536 "cannot handle divs yet", goto error
);
12537 if (!isl_int_is_one(subs
->v
->el
[0]))
12538 isl_die(ctx
, isl_error_invalid
,
12539 "can only substitute integer expressions", goto error
);
12541 pos
+= isl_basic_set_offset(bset
, type
);
12545 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12546 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12548 isl_int_set(v
, bset
->eq
[i
][pos
]);
12549 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12550 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12551 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12554 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12555 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12557 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12558 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12559 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12560 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12563 for (i
= 0; i
< bset
->n_div
; ++i
) {
12564 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12566 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12567 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12568 isl_seq_combine(bset
->div
[i
] + 1,
12569 subs
->v
->el
[0], bset
->div
[i
] + 1,
12570 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12571 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12576 bset
= isl_basic_set_simplify(bset
);
12577 return isl_basic_set_finalize(bset
);
12579 isl_basic_set_free(bset
);
12583 /* Plug in "subs" for dimension "type", "pos" of "set".
12585 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12586 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12590 if (set
&& isl_set_plain_is_empty(set
))
12593 set
= isl_set_cow(set
);
12597 for (i
= set
->n
- 1; i
>= 0; --i
) {
12598 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12599 if (remove_if_empty(set
, i
) < 0)
12609 /* Check if the range of "ma" is compatible with the domain or range
12610 * (depending on "type") of "bmap".
12612 static isl_stat
check_basic_map_compatible_range_multi_aff(
12613 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12614 __isl_keep isl_multi_aff
*ma
)
12617 isl_space
*ma_space
;
12619 ma_space
= isl_multi_aff_get_space(ma
);
12621 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12625 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12626 "parameters don't match", goto error
);
12627 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12631 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12632 "spaces don't match", goto error
);
12634 isl_space_free(ma_space
);
12635 return isl_stat_ok
;
12637 isl_space_free(ma_space
);
12638 return isl_stat_error
;
12641 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12642 * coefficients before the transformed range of dimensions,
12643 * the "n_after" coefficients after the transformed range of dimensions
12644 * and the coefficients of the other divs in "bmap".
12646 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12647 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12652 isl_local_space
*ls
;
12657 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
12661 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12662 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12663 for (i
= 0; i
< n_div
; ++i
) {
12664 int o_bmap
= 0, o_ls
= 0;
12666 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12667 o_bmap
+= 1 + 1 + n_param
;
12668 o_ls
+= 1 + 1 + n_param
;
12669 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12670 o_bmap
+= n_before
;
12671 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12672 ls
->div
->row
[i
] + o_ls
, n_set
);
12675 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12677 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12678 ls
->div
->row
[i
] + o_ls
, n_div
);
12681 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12682 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12686 isl_local_space_free(ls
);
12689 isl_local_space_free(ls
);
12693 /* How many stride constraints does "ma" enforce?
12694 * That is, how many of the affine expressions have a denominator
12695 * different from one?
12697 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12702 for (i
= 0; i
< ma
->n
; ++i
)
12703 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12709 /* For each affine expression in ma of the form
12711 * x_i = (f_i y + h_i)/m_i
12713 * with m_i different from one, add a constraint to "bmap"
12716 * f_i y + h_i = m_i alpha_i
12718 * with alpha_i an additional existentially quantified variable.
12720 * The input variables of "ma" correspond to a subset of the variables
12721 * of "bmap". There are "n_before" variables in "bmap" before this
12722 * subset and "n_after" variables after this subset.
12723 * The integer divisions of the affine expressions in "ma" are assumed
12724 * to have been aligned. There are "n_div_ma" of them and
12725 * they appear first in "bmap", straight after the "n_after" variables.
12727 static __isl_give isl_basic_map
*add_ma_strides(
12728 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12729 int n_before
, int n_after
, int n_div_ma
)
12737 total
= isl_basic_map_total_dim(bmap
);
12738 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12739 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12740 for (i
= 0; i
< ma
->n
; ++i
) {
12741 int o_bmap
= 0, o_ma
= 1;
12743 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12745 div
= isl_basic_map_alloc_div(bmap
);
12746 k
= isl_basic_map_alloc_equality(bmap
);
12747 if (div
< 0 || k
< 0)
12749 isl_int_set_si(bmap
->div
[div
][0], 0);
12750 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12751 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12752 o_bmap
+= 1 + n_param
;
12753 o_ma
+= 1 + n_param
;
12754 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12755 o_bmap
+= n_before
;
12756 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12757 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
12760 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12762 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12763 ma
->p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12764 o_bmap
+= n_div_ma
;
12766 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12767 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
12773 isl_basic_map_free(bmap
);
12777 /* Replace the domain or range space (depending on "type) of "space" by "set".
12779 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12780 enum isl_dim_type type
, __isl_take isl_space
*set
)
12782 if (type
== isl_dim_in
) {
12783 space
= isl_space_range(space
);
12784 space
= isl_space_map_from_domain_and_range(set
, space
);
12786 space
= isl_space_domain(space
);
12787 space
= isl_space_map_from_domain_and_range(space
, set
);
12793 /* Compute the preimage of the domain or range (depending on "type")
12794 * of "bmap" under the function represented by "ma".
12795 * In other words, plug in "ma" in the domain or range of "bmap".
12796 * The result is a basic map that lives in the same space as "bmap"
12797 * except that the domain or range has been replaced by
12798 * the domain space of "ma".
12800 * If bmap is represented by
12802 * A(p) + S u + B x + T v + C(divs) >= 0,
12804 * where u and x are input and output dimensions if type == isl_dim_out
12805 * while x and v are input and output dimensions if type == isl_dim_in,
12806 * and ma is represented by
12808 * x = D(p) + F(y) + G(divs')
12810 * then the result is
12812 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12814 * The divs in the input set are similarly adjusted.
12817 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12821 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12822 * B_i G(divs') + c_i(divs))/n_i)
12824 * If bmap is not a rational map and if F(y) involves any denominators
12826 * x_i = (f_i y + h_i)/m_i
12828 * then additional constraints are added to ensure that we only
12829 * map back integer points. That is we enforce
12831 * f_i y + h_i = m_i alpha_i
12833 * with alpha_i an additional existentially quantified variable.
12835 * We first copy over the divs from "ma".
12836 * Then we add the modified constraints and divs from "bmap".
12837 * Finally, we add the stride constraints, if needed.
12839 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12840 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12841 __isl_take isl_multi_aff
*ma
)
12845 isl_basic_map
*res
= NULL
;
12846 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12847 isl_int f
, c1
, c2
, g
;
12856 ma
= isl_multi_aff_align_divs(ma
);
12859 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12862 if (type
== isl_dim_in
) {
12864 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12866 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12869 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12870 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12872 space
= isl_multi_aff_get_domain_space(ma
);
12873 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12874 rational
= isl_basic_map_is_rational(bmap
);
12875 strides
= rational
? 0 : multi_aff_strides(ma
);
12876 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12877 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12879 res
= isl_basic_map_set_rational(res
);
12881 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12882 if (isl_basic_map_alloc_div(res
) < 0)
12885 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12888 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12889 k
= isl_basic_map_alloc_equality(res
);
12892 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12893 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12896 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12897 k
= isl_basic_map_alloc_inequality(res
);
12900 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12901 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12904 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12905 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12906 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12909 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12910 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12915 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
12921 isl_basic_map_free(bmap
);
12922 isl_multi_aff_free(ma
);
12923 res
= isl_basic_map_simplify(res
);
12924 return isl_basic_map_finalize(res
);
12930 isl_basic_map_free(bmap
);
12931 isl_multi_aff_free(ma
);
12932 isl_basic_map_free(res
);
12936 /* Compute the preimage of "bset" under the function represented by "ma".
12937 * In other words, plug in "ma" in "bset". The result is a basic set
12938 * that lives in the domain space of "ma".
12940 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12941 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12943 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12946 /* Compute the preimage of the domain of "bmap" under the function
12947 * represented by "ma".
12948 * In other words, plug in "ma" in the domain of "bmap".
12949 * The result is a basic map that lives in the same space as "bmap"
12950 * except that the domain has been replaced by the domain space of "ma".
12952 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12953 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12955 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12958 /* Compute the preimage of the range of "bmap" under the function
12959 * represented by "ma".
12960 * In other words, plug in "ma" in the range of "bmap".
12961 * The result is a basic map that lives in the same space as "bmap"
12962 * except that the range has been replaced by the domain space of "ma".
12964 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12965 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12967 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12970 /* Check if the range of "ma" is compatible with the domain or range
12971 * (depending on "type") of "map".
12972 * Return isl_stat_error if anything is wrong.
12974 static isl_stat
check_map_compatible_range_multi_aff(
12975 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12976 __isl_keep isl_multi_aff
*ma
)
12979 isl_space
*ma_space
;
12981 ma_space
= isl_multi_aff_get_space(ma
);
12982 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
12983 isl_space_free(ma_space
);
12985 return isl_stat_error
;
12987 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12988 "spaces don't match", return isl_stat_error
);
12989 return isl_stat_ok
;
12992 /* Compute the preimage of the domain or range (depending on "type")
12993 * of "map" under the function represented by "ma".
12994 * In other words, plug in "ma" in the domain or range of "map".
12995 * The result is a map that lives in the same space as "map"
12996 * except that the domain or range has been replaced by
12997 * the domain space of "ma".
12999 * The parameters are assumed to have been aligned.
13001 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13002 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13007 map
= isl_map_cow(map
);
13008 ma
= isl_multi_aff_align_divs(ma
);
13011 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13014 for (i
= 0; i
< map
->n
; ++i
) {
13015 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13016 isl_multi_aff_copy(ma
));
13021 space
= isl_multi_aff_get_domain_space(ma
);
13022 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13024 isl_space_free(map
->dim
);
13029 isl_multi_aff_free(ma
);
13031 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13032 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13035 isl_multi_aff_free(ma
);
13040 /* Compute the preimage of the domain or range (depending on "type")
13041 * of "map" under the function represented by "ma".
13042 * In other words, plug in "ma" in the domain or range of "map".
13043 * The result is a map that lives in the same space as "map"
13044 * except that the domain or range has been replaced by
13045 * the domain space of "ma".
13047 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13048 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13055 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13059 return map_preimage_multi_aff(map
, type
, ma
);
13061 if (isl_map_check_named_params(map
) < 0)
13063 if (!isl_space_has_named_params(ma
->space
))
13064 isl_die(map
->ctx
, isl_error_invalid
,
13065 "unaligned unnamed parameters", goto error
);
13066 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13067 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13069 return map_preimage_multi_aff(map
, type
, ma
);
13071 isl_multi_aff_free(ma
);
13072 return isl_map_free(map
);
13075 /* Compute the preimage of "set" under the function represented by "ma".
13076 * In other words, plug in "ma" in "set". The result is a set
13077 * that lives in the domain space of "ma".
13079 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13080 __isl_take isl_multi_aff
*ma
)
13082 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13085 /* Compute the preimage of the domain of "map" under the function
13086 * represented by "ma".
13087 * In other words, plug in "ma" in the domain of "map".
13088 * The result is a map that lives in the same space as "map"
13089 * except that the domain has been replaced by the domain space of "ma".
13091 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13092 __isl_take isl_multi_aff
*ma
)
13094 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13097 /* Compute the preimage of the range of "map" under the function
13098 * represented by "ma".
13099 * In other words, plug in "ma" in the range of "map".
13100 * The result is a map that lives in the same space as "map"
13101 * except that the range has been replaced by the domain space of "ma".
13103 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13104 __isl_take isl_multi_aff
*ma
)
13106 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13109 /* Compute the preimage of "map" under the function represented by "pma".
13110 * In other words, plug in "pma" in the domain or range of "map".
13111 * The result is a map that lives in the same space as "map",
13112 * except that the space of type "type" has been replaced by
13113 * the domain space of "pma".
13115 * The parameters of "map" and "pma" are assumed to have been aligned.
13117 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13118 __isl_take isl_map
*map
, enum isl_dim_type type
,
13119 __isl_take isl_pw_multi_aff
*pma
)
13128 isl_pw_multi_aff_free(pma
);
13129 res
= isl_map_empty(isl_map_get_space(map
));
13134 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13135 isl_multi_aff_copy(pma
->p
[0].maff
));
13136 if (type
== isl_dim_in
)
13137 res
= isl_map_intersect_domain(res
,
13138 isl_map_copy(pma
->p
[0].set
));
13140 res
= isl_map_intersect_range(res
,
13141 isl_map_copy(pma
->p
[0].set
));
13143 for (i
= 1; i
< pma
->n
; ++i
) {
13146 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13147 isl_multi_aff_copy(pma
->p
[i
].maff
));
13148 if (type
== isl_dim_in
)
13149 res_i
= isl_map_intersect_domain(res_i
,
13150 isl_map_copy(pma
->p
[i
].set
));
13152 res_i
= isl_map_intersect_range(res_i
,
13153 isl_map_copy(pma
->p
[i
].set
));
13154 res
= isl_map_union(res
, res_i
);
13157 isl_pw_multi_aff_free(pma
);
13161 isl_pw_multi_aff_free(pma
);
13166 /* Compute the preimage of "map" under the function represented by "pma".
13167 * In other words, plug in "pma" in the domain or range of "map".
13168 * The result is a map that lives in the same space as "map",
13169 * except that the space of type "type" has been replaced by
13170 * the domain space of "pma".
13172 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13173 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13180 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13184 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13186 if (isl_map_check_named_params(map
) < 0)
13188 if (!isl_space_has_named_params(pma
->dim
))
13189 isl_die(map
->ctx
, isl_error_invalid
,
13190 "unaligned unnamed parameters", goto error
);
13191 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13192 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13194 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13196 isl_pw_multi_aff_free(pma
);
13197 return isl_map_free(map
);
13200 /* Compute the preimage of "set" under the function represented by "pma".
13201 * In other words, plug in "pma" in "set". The result is a set
13202 * that lives in the domain space of "pma".
13204 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13205 __isl_take isl_pw_multi_aff
*pma
)
13207 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13210 /* Compute the preimage of the domain of "map" under the function
13211 * represented by "pma".
13212 * In other words, plug in "pma" in the domain of "map".
13213 * The result is a map that lives in the same space as "map",
13214 * except that domain space has been replaced by the domain space of "pma".
13216 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13217 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13219 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13222 /* Compute the preimage of the range of "map" under the function
13223 * represented by "pma".
13224 * In other words, plug in "pma" in the range of "map".
13225 * The result is a map that lives in the same space as "map",
13226 * except that range space has been replaced by the domain space of "pma".
13228 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13229 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13231 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13234 /* Compute the preimage of "map" under the function represented by "mpa".
13235 * In other words, plug in "mpa" in the domain or range of "map".
13236 * The result is a map that lives in the same space as "map",
13237 * except that the space of type "type" has been replaced by
13238 * the domain space of "mpa".
13240 * If the map does not involve any constraints that refer to the
13241 * dimensions of the substituted space, then the only possible
13242 * effect of "mpa" on the map is to map the space to a different space.
13243 * We create a separate isl_multi_aff to effectuate this change
13244 * in order to avoid spurious splitting of the map along the pieces
13247 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13248 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13251 isl_pw_multi_aff
*pma
;
13256 n
= isl_map_dim(map
, type
);
13257 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
13261 space
= isl_multi_pw_aff_get_space(mpa
);
13262 isl_multi_pw_aff_free(mpa
);
13263 ma
= isl_multi_aff_zero(space
);
13264 return isl_map_preimage_multi_aff(map
, type
, ma
);
13267 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13268 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13271 isl_multi_pw_aff_free(mpa
);
13275 /* Compute the preimage of "map" under the function represented by "mpa".
13276 * In other words, plug in "mpa" in the domain "map".
13277 * The result is a map that lives in the same space as "map",
13278 * except that domain space has been replaced by the domain space of "mpa".
13280 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13281 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13283 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13286 /* Compute the preimage of "set" by the function represented by "mpa".
13287 * In other words, plug in "mpa" in "set".
13289 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13290 __isl_take isl_multi_pw_aff
*mpa
)
13292 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13295 /* Are the "n" "coefficients" starting at "first" of the integer division
13296 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13298 * The "coefficient" at position 0 is the denominator.
13299 * The "coefficient" at position 1 is the constant term.
13301 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13302 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13303 unsigned first
, unsigned n
)
13305 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13306 return isl_bool_error
;
13307 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13308 return isl_bool_error
;
13309 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13310 bmap2
->div
[pos2
] + first
, n
);
13313 /* Are the integer division expressions at position "pos1" in "bmap1" and
13314 * "pos2" in "bmap2" equal to each other, except that the constant terms
13317 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13318 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13319 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13324 if (!bmap1
|| !bmap2
)
13325 return isl_bool_error
;
13326 total
= isl_basic_map_total_dim(bmap1
);
13327 if (total
!= isl_basic_map_total_dim(bmap2
))
13328 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13329 "incomparable div expressions", return isl_bool_error
);
13330 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13332 if (equal
< 0 || !equal
)
13334 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13336 if (equal
< 0 || equal
)
13337 return isl_bool_not(equal
);
13338 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13342 /* Replace the numerator of the constant term of the integer division
13343 * expression at position "div" in "bmap" by "value".
13344 * The caller guarantees that this does not change the meaning
13347 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13348 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13350 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13351 return isl_basic_map_free(bmap
);
13353 isl_int_set_si(bmap
->div
[div
][1], value
);
13358 /* Is the point "inner" internal to inequality constraint "ineq"
13360 * The point is considered to be internal to the inequality constraint,
13361 * if it strictly lies on the positive side of the inequality constraint,
13362 * or if it lies on the constraint and the constraint is lexico-positive.
13364 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13365 __isl_keep isl_basic_set
*bset
, int ineq
)
13371 if (!inner
|| !bset
)
13372 return isl_bool_error
;
13374 ctx
= isl_basic_set_get_ctx(bset
);
13375 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13376 &ctx
->normalize_gcd
);
13377 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13378 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13380 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13381 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13382 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13385 /* Tighten the inequality constraints of "bset" that are outward with respect
13386 * to the point "vec".
13387 * That is, tighten the constraints that are not satisfied by "vec".
13389 * "vec" is a point internal to some superset S of "bset" that is used
13390 * to make the subsets of S disjoint, by tightening one half of the constraints
13391 * that separate two subsets. In particular, the constraints of S
13392 * are all satisfied by "vec" and should not be tightened.
13393 * Of the internal constraints, those that have "vec" on the outside
13394 * are tightened. The shared facet is included in the adjacent subset
13395 * with the opposite constraint.
13396 * For constraints that saturate "vec", this criterion cannot be used
13397 * to determine which of the two sides should be tightened.
13398 * Instead, the sign of the first non-zero coefficient is used
13399 * to make this choice. Note that this second criterion is never used
13400 * on the constraints of S since "vec" is interior to "S".
13402 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13403 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13407 bset
= isl_basic_set_cow(bset
);
13410 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13413 internal
= is_internal(vec
, bset
, j
);
13415 return isl_basic_set_free(bset
);
13418 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13424 /* Replace the variables x of type "type" starting at "first" in "bmap"
13425 * by x' with x = M x' with M the matrix trans.
13426 * That is, replace the corresponding coefficients c by c M.
13428 * The transformation matrix should be a square matrix.
13430 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13431 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13432 __isl_take isl_mat
*trans
)
13436 bmap
= isl_basic_map_cow(bmap
);
13437 if (!bmap
|| !trans
)
13440 if (trans
->n_row
!= trans
->n_col
)
13441 isl_die(trans
->ctx
, isl_error_invalid
,
13442 "expecting square transformation matrix", goto error
);
13443 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13444 isl_die(trans
->ctx
, isl_error_invalid
,
13445 "oversized transformation matrix", goto error
);
13447 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13449 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13450 isl_mat_copy(trans
)) < 0)
13452 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13453 isl_mat_copy(trans
)) < 0)
13455 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13456 isl_mat_copy(trans
)) < 0)
13459 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
13460 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13462 isl_mat_free(trans
);
13465 isl_mat_free(trans
);
13466 isl_basic_map_free(bmap
);
13470 /* Replace the variables x of type "type" starting at "first" in "bset"
13471 * by x' with x = M x' with M the matrix trans.
13472 * That is, replace the corresponding coefficients c by c M.
13474 * The transformation matrix should be a square matrix.
13476 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13477 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13478 __isl_take isl_mat
*trans
)
13480 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);