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(struct isl_basic_set
*bset
,
129 enum isl_dim_type type
)
131 return isl_basic_map_offset(bset
, type
);
134 static unsigned map_offset(struct 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(const struct 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(const struct isl_basic_map
*bmap
)
174 return bmap
? bmap
->dim
->n_in
: 0;
177 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
179 return bmap
? bmap
->dim
->n_out
: 0;
182 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
184 return bmap
? bmap
->dim
->nparam
: 0;
187 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
189 return bmap
? bmap
->n_div
: 0;
192 unsigned isl_basic_map_total_dim(const struct 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 /* Reset the user pointer on all identifiers of parameters and tuples
851 * of the space of "map".
853 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
857 space
= isl_map_get_space(map
);
858 space
= isl_space_reset_user(space
);
859 map
= isl_map_reset_space(map
, space
);
864 /* Reset the user pointer on all identifiers of parameters and tuples
865 * of the space of "set".
867 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
869 return isl_map_reset_user(set
);
872 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
875 return isl_bool_error
;
876 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
879 /* Has "map" been marked as a rational map?
880 * In particular, have all basic maps in "map" been marked this way?
881 * An empty map is not considered to be rational.
882 * Maps where only some of the basic maps are marked rational
885 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
891 return isl_bool_error
;
893 return isl_bool_false
;
894 rational
= isl_basic_map_is_rational(map
->p
[0]);
897 for (i
= 1; i
< map
->n
; ++i
) {
900 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
903 if (rational
!= rational_i
)
904 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
905 "mixed rational and integer basic maps "
906 "not supported", return isl_bool_error
);
912 /* Has "set" been marked as a rational set?
913 * In particular, have all basic set in "set" been marked this way?
914 * An empty set is not considered to be rational.
915 * Sets where only some of the basic sets are marked rational
918 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
920 return isl_map_is_rational(set
);
923 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
925 return isl_basic_map_is_rational(bset
);
928 /* Does "bmap" contain any rational points?
930 * If "bmap" has an equality for each dimension, equating the dimension
931 * to an integer constant, then it has no rational points, even if it
932 * is marked as rational.
934 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
936 isl_bool has_rational
= isl_bool_true
;
940 return isl_bool_error
;
941 if (isl_basic_map_plain_is_empty(bmap
))
942 return isl_bool_false
;
943 if (!isl_basic_map_is_rational(bmap
))
944 return isl_bool_false
;
945 bmap
= isl_basic_map_copy(bmap
);
946 bmap
= isl_basic_map_implicit_equalities(bmap
);
948 return isl_bool_error
;
949 total
= isl_basic_map_total_dim(bmap
);
950 if (bmap
->n_eq
== total
) {
952 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
953 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
956 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
957 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
959 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
965 has_rational
= isl_bool_false
;
967 isl_basic_map_free(bmap
);
972 /* Does "map" contain any rational points?
974 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
977 isl_bool has_rational
;
980 return isl_bool_error
;
981 for (i
= 0; i
< map
->n
; ++i
) {
982 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
983 if (has_rational
< 0 || has_rational
)
986 return isl_bool_false
;
989 /* Does "set" contain any rational points?
991 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
993 return isl_map_has_rational(set
);
996 /* Is this basic set a parameter domain?
998 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1001 return isl_bool_error
;
1002 return isl_space_is_params(bset
->dim
);
1005 /* Is this set a parameter domain?
1007 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1010 return isl_bool_error
;
1011 return isl_space_is_params(set
->dim
);
1014 /* Is this map actually a parameter domain?
1015 * Users should never call this function. Outside of isl,
1016 * a map can never be a parameter domain.
1018 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1021 return isl_bool_error
;
1022 return isl_space_is_params(map
->dim
);
1025 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
1026 struct isl_basic_map
*bmap
, unsigned extra
,
1027 unsigned n_eq
, unsigned n_ineq
)
1030 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
1035 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1036 if (isl_blk_is_error(bmap
->block
))
1039 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1040 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1044 bmap
->block2
= isl_blk_empty();
1047 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1048 if (isl_blk_is_error(bmap
->block2
))
1051 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1056 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1057 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1059 for (i
= 0; i
< extra
; ++i
)
1060 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1064 bmap
->c_size
= n_eq
+ n_ineq
;
1065 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1066 bmap
->extra
= extra
;
1070 bmap
->sample
= NULL
;
1074 isl_basic_map_free(bmap
);
1078 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1079 unsigned nparam
, unsigned dim
, unsigned extra
,
1080 unsigned n_eq
, unsigned n_ineq
)
1082 struct isl_basic_map
*bmap
;
1085 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1089 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1090 return bset_from_bmap(bmap
);
1093 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1094 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1096 struct isl_basic_map
*bmap
;
1099 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1100 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1101 return bset_from_bmap(bmap
);
1103 isl_space_free(dim
);
1107 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1108 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1110 struct isl_basic_map
*bmap
;
1114 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1119 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1121 isl_space_free(dim
);
1125 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1126 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1127 unsigned n_eq
, unsigned n_ineq
)
1129 struct isl_basic_map
*bmap
;
1132 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1136 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1140 static void dup_constraints(
1141 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1144 unsigned total
= isl_basic_map_total_dim(src
);
1146 for (i
= 0; i
< src
->n_eq
; ++i
) {
1147 int j
= isl_basic_map_alloc_equality(dst
);
1148 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1151 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1152 int j
= isl_basic_map_alloc_inequality(dst
);
1153 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1156 for (i
= 0; i
< src
->n_div
; ++i
) {
1157 int j
= isl_basic_map_alloc_div(dst
);
1158 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1160 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1163 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
1165 struct isl_basic_map
*dup
;
1169 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1170 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1173 dup_constraints(dup
, bmap
);
1174 dup
->flags
= bmap
->flags
;
1175 dup
->sample
= isl_vec_copy(bmap
->sample
);
1179 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1181 struct isl_basic_map
*dup
;
1183 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1184 return bset_from_bmap(dup
);
1187 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
1192 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1196 return isl_basic_set_dup(bset
);
1199 struct isl_set
*isl_set_copy(struct isl_set
*set
)
1208 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
1213 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1217 bmap
= isl_basic_map_dup(bmap
);
1219 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1223 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1232 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1237 if (--bmap
->ref
> 0)
1240 isl_ctx_deref(bmap
->ctx
);
1242 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1244 isl_blk_free(bmap
->ctx
, bmap
->block
);
1245 isl_vec_free(bmap
->sample
);
1246 isl_space_free(bmap
->dim
);
1252 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1254 return isl_basic_map_free(bset_to_bmap(bset
));
1257 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1259 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1262 /* Check that "map" has only named parameters, reporting an error
1265 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1267 return isl_space_check_named_params(isl_map_peek_space(map
));
1270 /* Check that "bmap1" and "bmap2" have the same parameters,
1271 * reporting an error if they do not.
1273 static isl_stat
isl_basic_map_check_equal_params(
1274 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1278 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1280 return isl_stat_error
;
1282 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1283 "parameters don't match", return isl_stat_error
);
1287 __isl_give isl_map
*isl_map_align_params_map_map_and(
1288 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1289 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1290 __isl_take isl_map
*map2
))
1294 if (isl_map_has_equal_params(map1
, map2
))
1295 return fn(map1
, map2
);
1296 if (isl_map_check_named_params(map1
) < 0)
1298 if (isl_map_check_named_params(map2
) < 0)
1300 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1301 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1302 return fn(map1
, map2
);
1309 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1310 __isl_keep isl_map
*map2
,
1311 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1316 return isl_bool_error
;
1317 if (isl_map_has_equal_params(map1
, map2
))
1318 return fn(map1
, map2
);
1319 if (isl_map_check_named_params(map1
) < 0)
1320 return isl_bool_error
;
1321 if (isl_map_check_named_params(map2
) < 0)
1322 return isl_bool_error
;
1323 map1
= isl_map_copy(map1
);
1324 map2
= isl_map_copy(map2
);
1325 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1326 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1333 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1335 struct isl_ctx
*ctx
;
1339 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1340 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1342 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1343 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1344 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1345 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1346 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1347 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1349 int j
= isl_basic_map_alloc_inequality(bmap
);
1353 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1354 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1361 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1362 bmap
->extra
- bmap
->n_div
);
1363 return bmap
->n_eq
++;
1366 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1368 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1371 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1375 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1380 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1382 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1385 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1390 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1392 if (pos
!= bmap
->n_eq
- 1) {
1394 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1395 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1401 /* Turn inequality "pos" of "bmap" into an equality.
1403 * In particular, we move the inequality in front of the equalities
1404 * and move the last inequality in the position of the moved inequality.
1405 * Note that isl_tab_make_equalities_explicit depends on this particular
1406 * change in the ordering of the constraints.
1408 void isl_basic_map_inequality_to_equality(
1409 struct isl_basic_map
*bmap
, unsigned pos
)
1413 t
= bmap
->ineq
[pos
];
1414 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1415 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1420 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1421 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1422 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1423 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1426 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1428 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1431 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1433 struct isl_ctx
*ctx
;
1437 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1438 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1439 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1440 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1441 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1442 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1443 1 + isl_basic_map_total_dim(bmap
),
1444 bmap
->extra
- bmap
->n_div
);
1445 return bmap
->n_ineq
++;
1448 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1450 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1453 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1457 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1462 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1464 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1467 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1472 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1474 if (pos
!= bmap
->n_ineq
- 1) {
1475 t
= bmap
->ineq
[pos
];
1476 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1477 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1478 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1484 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1486 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1489 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1494 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1497 k
= isl_basic_map_alloc_equality(bmap
);
1500 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1503 isl_basic_map_free(bmap
);
1507 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1510 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1513 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1518 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1521 k
= isl_basic_map_alloc_inequality(bmap
);
1524 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1527 isl_basic_map_free(bmap
);
1531 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1534 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1537 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1541 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1542 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1543 1 + 1 + isl_basic_map_total_dim(bmap
),
1544 bmap
->extra
- bmap
->n_div
);
1545 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1546 return bmap
->n_div
++;
1549 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1551 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1554 /* Check that there are "n" dimensions of type "type" starting at "first"
1557 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1558 enum isl_dim_type type
, unsigned first
, unsigned n
)
1563 return isl_stat_error
;
1564 dim
= isl_basic_map_dim(bmap
, type
);
1565 if (first
+ n
> dim
|| first
+ n
< first
)
1566 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1567 "position or range out of bounds",
1568 return isl_stat_error
);
1572 /* Insert an extra integer division, prescribed by "div", to "bmap"
1573 * at (integer division) position "pos".
1575 * The integer division is first added at the end and then moved
1576 * into the right position.
1578 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1579 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1583 bmap
= isl_basic_map_cow(bmap
);
1585 return isl_basic_map_free(bmap
);
1587 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1588 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1589 "unexpected size", return isl_basic_map_free(bmap
));
1590 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1591 return isl_basic_map_free(bmap
);
1593 bmap
= isl_basic_map_extend_space(bmap
,
1594 isl_basic_map_get_space(bmap
), 1, 0, 2);
1595 k
= isl_basic_map_alloc_div(bmap
);
1597 return isl_basic_map_free(bmap
);
1598 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1599 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1601 for (i
= k
; i
> pos
; --i
)
1602 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1607 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1610 return isl_stat_error
;
1611 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1616 /* Copy constraint from src to dst, putting the vars of src at offset
1617 * dim_off in dst and the divs of src at offset div_off in dst.
1618 * If both sets are actually map, then dim_off applies to the input
1621 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1622 struct isl_basic_map
*src_map
, isl_int
*src
,
1623 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1625 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1626 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1627 unsigned src_in
= isl_basic_map_n_in(src_map
);
1628 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1629 unsigned src_out
= isl_basic_map_n_out(src_map
);
1630 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1631 isl_int_set(dst
[0], src
[0]);
1632 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1633 if (dst_nparam
> src_nparam
)
1634 isl_seq_clr(dst
+1+src_nparam
,
1635 dst_nparam
- src_nparam
);
1636 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1637 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1639 isl_min(dst_in
-in_off
, src_in
));
1640 if (dst_in
-in_off
> src_in
)
1641 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1642 dst_in
- in_off
- src_in
);
1643 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1644 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1645 src
+1+src_nparam
+src_in
,
1646 isl_min(dst_out
-out_off
, src_out
));
1647 if (dst_out
-out_off
> src_out
)
1648 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1649 dst_out
- out_off
- src_out
);
1650 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1651 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1652 src
+1+src_nparam
+src_in
+src_out
,
1653 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1654 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1655 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1656 div_off
+src_map
->n_div
,
1657 dst_map
->n_div
- div_off
- src_map
->n_div
);
1660 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1661 struct isl_basic_map
*src_map
, isl_int
*src
,
1662 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1664 isl_int_set(dst
[0], src
[0]);
1665 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1668 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1669 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1674 if (!bmap1
|| !bmap2
)
1677 div_off
= bmap1
->n_div
;
1679 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1680 int i1
= isl_basic_map_alloc_equality(bmap1
);
1683 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1684 i_pos
, o_pos
, div_off
);
1687 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1688 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1691 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1692 i_pos
, o_pos
, div_off
);
1695 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1696 int i1
= isl_basic_map_alloc_div(bmap1
);
1699 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1700 i_pos
, o_pos
, div_off
);
1703 isl_basic_map_free(bmap2
);
1708 isl_basic_map_free(bmap1
);
1709 isl_basic_map_free(bmap2
);
1713 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1714 struct isl_basic_set
*bset2
, unsigned pos
)
1716 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1717 bset_to_bmap(bset2
), 0, pos
));
1720 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1721 __isl_take isl_space
*dim
, unsigned extra
,
1722 unsigned n_eq
, unsigned n_ineq
)
1724 struct isl_basic_map
*ext
;
1734 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1735 base
->extra
>= base
->n_div
+ extra
;
1737 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1738 room_for_ineq(base
, n_ineq
)) {
1739 isl_space_free(dim
);
1743 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1744 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1745 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1746 extra
+= base
->extra
;
1748 n_ineq
+= base
->n_ineq
;
1750 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1756 ext
->sample
= isl_vec_copy(base
->sample
);
1757 flags
= base
->flags
;
1758 ext
= add_constraints(ext
, base
, 0, 0);
1761 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1767 isl_space_free(dim
);
1768 isl_basic_map_free(base
);
1772 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1773 __isl_take isl_space
*dim
, unsigned extra
,
1774 unsigned n_eq
, unsigned n_ineq
)
1776 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1777 dim
, extra
, n_eq
, n_ineq
));
1780 struct isl_basic_map
*isl_basic_map_extend_constraints(
1781 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1785 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1789 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1790 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1791 unsigned n_eq
, unsigned n_ineq
)
1793 struct isl_basic_map
*bmap
;
1798 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1802 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1805 isl_basic_map_free(base
);
1809 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1810 unsigned nparam
, unsigned dim
, unsigned extra
,
1811 unsigned n_eq
, unsigned n_ineq
)
1813 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1814 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1817 struct isl_basic_set
*isl_basic_set_extend_constraints(
1818 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1820 isl_basic_map
*bmap
= bset_to_bmap(base
);
1821 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1822 return bset_from_bmap(bmap
);
1825 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1827 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1830 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1835 if (bmap
->ref
> 1) {
1837 bmap
= isl_basic_map_dup(bmap
);
1840 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1841 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1846 /* Clear all cached information in "map", either because it is about
1847 * to be modified or because it is being freed.
1848 * Always return the same pointer that is passed in.
1849 * This is needed for the use in isl_map_free.
1851 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1853 isl_basic_map_free(map
->cached_simple_hull
[0]);
1854 isl_basic_map_free(map
->cached_simple_hull
[1]);
1855 map
->cached_simple_hull
[0] = NULL
;
1856 map
->cached_simple_hull
[1] = NULL
;
1860 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1862 return isl_map_cow(set
);
1865 /* Return an isl_map that is equal to "map" and that has only
1866 * a single reference.
1868 * If the original input already has only one reference, then
1869 * simply return it, but clear all cached information, since
1870 * it may be rendered invalid by the operations that will be
1871 * performed on the result.
1873 * Otherwise, create a duplicate (without any cached information).
1875 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1881 return clear_caches(map
);
1883 return isl_map_dup(map
);
1886 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1887 unsigned a_len
, unsigned b_len
)
1889 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1890 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1891 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1894 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1895 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1903 isl_assert(bmap
->ctx
,
1904 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1906 if (n1
== 0 || n2
== 0)
1909 bmap
= isl_basic_map_cow(bmap
);
1913 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1914 if (isl_blk_is_error(blk
))
1917 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1919 bmap
->eq
[i
] + pos
, n1
, n2
);
1921 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1923 bmap
->ineq
[i
] + pos
, n1
, n2
);
1925 for (i
= 0; i
< bmap
->n_div
; ++i
)
1927 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1929 isl_blk_free(bmap
->ctx
, blk
);
1931 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1932 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1933 return isl_basic_map_finalize(bmap
);
1935 isl_basic_map_free(bmap
);
1939 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1945 total
= isl_basic_map_total_dim(bmap
);
1946 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
1947 return isl_basic_map_free(bmap
);
1948 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1950 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1952 i
= isl_basic_map_alloc_equality(bmap
);
1956 isl_int_set_si(bmap
->eq
[i
][0], 1);
1957 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1958 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1959 isl_vec_free(bmap
->sample
);
1960 bmap
->sample
= NULL
;
1961 return isl_basic_map_finalize(bmap
);
1963 isl_basic_map_free(bmap
);
1967 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1969 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
1972 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1975 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1977 isl_int
*t
= bmap
->div
[a
];
1978 bmap
->div
[a
] = bmap
->div
[b
];
1982 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1983 * div definitions accordingly.
1985 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1988 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1990 swap_div(bmap
, a
, b
);
1992 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1993 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1995 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1996 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1998 for (i
= 0; i
< bmap
->n_div
; ++i
)
1999 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2000 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2003 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
2004 * div definitions accordingly.
2006 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
2008 isl_basic_map_swap_div(bset
, a
, b
);
2011 /* Eliminate the specified n dimensions starting at first from the
2012 * constraints, without removing the dimensions from the space.
2013 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2015 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2016 enum isl_dim_type type
, unsigned first
, unsigned n
)
2025 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2026 isl_die(map
->ctx
, isl_error_invalid
,
2027 "index out of bounds", goto error
);
2029 map
= isl_map_cow(map
);
2033 for (i
= 0; i
< map
->n
; ++i
) {
2034 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2044 /* Eliminate the specified n dimensions starting at first from the
2045 * constraints, without removing the dimensions from the space.
2046 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2048 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2049 enum isl_dim_type type
, unsigned first
, unsigned n
)
2051 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2054 /* Eliminate the specified n dimensions starting at first from the
2055 * constraints, without removing the dimensions from the space.
2056 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2058 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2059 unsigned first
, unsigned n
)
2061 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2064 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2065 __isl_take isl_basic_map
*bmap
)
2069 bmap
= isl_basic_map_eliminate_vars(bmap
,
2070 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2074 return isl_basic_map_finalize(bmap
);
2077 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2078 __isl_take isl_basic_set
*bset
)
2080 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2083 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2092 map
= isl_map_cow(map
);
2096 for (i
= 0; i
< map
->n
; ++i
) {
2097 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2107 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2109 return isl_map_remove_divs(set
);
2112 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
2113 enum isl_dim_type type
, unsigned first
, unsigned n
)
2115 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2116 return isl_basic_map_free(bmap
);
2117 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2119 bmap
= isl_basic_map_eliminate_vars(bmap
,
2120 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2123 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2125 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2129 /* Return true if the definition of the given div (recursively) involves
2130 * any of the given variables.
2132 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2133 unsigned first
, unsigned n
)
2136 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2138 if (isl_int_is_zero(bmap
->div
[div
][0]))
2139 return isl_bool_false
;
2140 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2141 return isl_bool_true
;
2143 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2146 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2148 involves
= div_involves_vars(bmap
, i
, first
, n
);
2149 if (involves
< 0 || involves
)
2153 return isl_bool_false
;
2156 /* Try and add a lower and/or upper bound on "div" to "bmap"
2157 * based on inequality "i".
2158 * "total" is the total number of variables (excluding the divs).
2159 * "v" is a temporary object that can be used during the calculations.
2160 * If "lb" is set, then a lower bound should be constructed.
2161 * If "ub" is set, then an upper bound should be constructed.
2163 * The calling function has already checked that the inequality does not
2164 * reference "div", but we still need to check that the inequality is
2165 * of the right form. We'll consider the case where we want to construct
2166 * a lower bound. The construction of upper bounds is similar.
2168 * Let "div" be of the form
2170 * q = floor((a + f(x))/d)
2172 * We essentially check if constraint "i" is of the form
2176 * so that we can use it to derive a lower bound on "div".
2177 * However, we allow a slightly more general form
2181 * with the condition that the coefficients of g(x) - f(x) are all
2183 * Rewriting this constraint as
2187 * adding a + f(x) to both sides and dividing by d, we obtain
2189 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2191 * Taking the floor on both sides, we obtain
2193 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2197 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2199 * In the case of an upper bound, we construct the constraint
2201 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2204 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2205 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2206 unsigned total
, isl_int v
, int lb
, int ub
)
2210 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2212 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2213 bmap
->div
[div
][1 + 1 + j
]);
2214 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2217 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2218 bmap
->div
[div
][1 + 1 + j
]);
2219 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2225 bmap
= isl_basic_map_cow(bmap
);
2226 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2228 int k
= isl_basic_map_alloc_inequality(bmap
);
2231 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2232 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2233 bmap
->div
[div
][1 + j
]);
2234 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2235 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2237 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2240 int k
= isl_basic_map_alloc_inequality(bmap
);
2243 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2244 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2245 bmap
->div
[div
][1 + j
]);
2246 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2247 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2249 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2252 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2255 isl_basic_map_free(bmap
);
2259 /* This function is called right before "div" is eliminated from "bmap"
2260 * using Fourier-Motzkin.
2261 * Look through the constraints of "bmap" for constraints on the argument
2262 * of the integer division and use them to construct constraints on the
2263 * integer division itself. These constraints can then be combined
2264 * during the Fourier-Motzkin elimination.
2265 * Note that it is only useful to introduce lower bounds on "div"
2266 * if "bmap" already contains upper bounds on "div" as the newly
2267 * introduce lower bounds can then be combined with the pre-existing
2268 * upper bounds. Similarly for upper bounds.
2269 * We therefore first check if "bmap" contains any lower and/or upper bounds
2272 * It is interesting to note that the introduction of these constraints
2273 * can indeed lead to more accurate results, even when compared to
2274 * deriving constraints on the argument of "div" from constraints on "div".
2275 * Consider, for example, the set
2277 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2279 * The second constraint can be rewritten as
2281 * 2 * [(-i-2j+3)/4] + k >= 0
2283 * from which we can derive
2285 * -i - 2j + 3 >= -2k
2291 * Combined with the first constraint, we obtain
2293 * -3 <= 3 + 2k or k >= -3
2295 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2296 * the first constraint, we obtain
2298 * [(i + 2j)/4] >= [-3/4] = -1
2300 * Combining this constraint with the second constraint, we obtain
2304 static __isl_give isl_basic_map
*insert_bounds_on_div(
2305 __isl_take isl_basic_map
*bmap
, int div
)
2308 int check_lb
, check_ub
;
2315 if (isl_int_is_zero(bmap
->div
[div
][0]))
2318 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2322 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2323 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2330 if (!check_lb
&& !check_ub
)
2335 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2336 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2339 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2340 check_lb
, check_ub
);
2348 /* Remove all divs (recursively) involving any of the given dimensions
2349 * in their definitions.
2351 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2352 __isl_take isl_basic_map
*bmap
,
2353 enum isl_dim_type type
, unsigned first
, unsigned n
)
2357 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2358 return isl_basic_map_free(bmap
);
2359 first
+= isl_basic_map_offset(bmap
, type
);
2361 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2364 involves
= div_involves_vars(bmap
, i
, first
, n
);
2366 return isl_basic_map_free(bmap
);
2369 bmap
= insert_bounds_on_div(bmap
, i
);
2370 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2379 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2380 __isl_take isl_basic_set
*bset
,
2381 enum isl_dim_type type
, unsigned first
, unsigned n
)
2383 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2386 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2387 enum isl_dim_type type
, unsigned first
, unsigned n
)
2396 map
= isl_map_cow(map
);
2400 for (i
= 0; i
< map
->n
; ++i
) {
2401 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2412 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2413 enum isl_dim_type type
, unsigned first
, unsigned n
)
2415 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2419 /* Does the description of "bmap" depend on the specified dimensions?
2420 * We also check whether the dimensions appear in any of the div definitions.
2421 * In principle there is no need for this check. If the dimensions appear
2422 * in a div definition, they also appear in the defining constraints of that
2425 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2426 enum isl_dim_type type
, unsigned first
, unsigned n
)
2430 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2431 return isl_bool_error
;
2433 first
+= isl_basic_map_offset(bmap
, type
);
2434 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2435 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2436 return isl_bool_true
;
2437 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2438 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2439 return isl_bool_true
;
2440 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2441 if (isl_int_is_zero(bmap
->div
[i
][0]))
2443 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2444 return isl_bool_true
;
2447 return isl_bool_false
;
2450 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2451 enum isl_dim_type type
, unsigned first
, unsigned n
)
2456 return isl_bool_error
;
2458 if (first
+ n
> isl_map_dim(map
, type
))
2459 isl_die(map
->ctx
, isl_error_invalid
,
2460 "index out of bounds", return isl_bool_error
);
2462 for (i
= 0; i
< map
->n
; ++i
) {
2463 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2465 if (involves
< 0 || involves
)
2469 return isl_bool_false
;
2472 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2473 enum isl_dim_type type
, unsigned first
, unsigned n
)
2475 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2478 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2479 enum isl_dim_type type
, unsigned first
, unsigned n
)
2481 return isl_map_involves_dims(set
, type
, first
, n
);
2484 /* Drop all constraints in bmap that involve any of the dimensions
2485 * first to first+n-1.
2487 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2488 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2495 bmap
= isl_basic_map_cow(bmap
);
2500 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2501 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2503 isl_basic_map_drop_equality(bmap
, i
);
2506 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2507 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2509 isl_basic_map_drop_inequality(bmap
, i
);
2512 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2516 /* Drop all constraints in bset that involve any of the dimensions
2517 * first to first+n-1.
2519 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2520 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2522 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2525 /* Drop all constraints in bmap that do not involve any of the dimensions
2526 * first to first + n - 1 of the given type.
2528 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2529 __isl_take isl_basic_map
*bmap
,
2530 enum isl_dim_type type
, unsigned first
, unsigned n
)
2535 isl_space
*space
= isl_basic_map_get_space(bmap
);
2536 isl_basic_map_free(bmap
);
2537 return isl_basic_map_universe(space
);
2539 bmap
= isl_basic_map_cow(bmap
);
2543 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2544 return isl_basic_map_free(bmap
);
2546 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2548 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2549 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2551 isl_basic_map_drop_equality(bmap
, i
);
2554 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2555 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2557 isl_basic_map_drop_inequality(bmap
, i
);
2560 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2564 /* Drop all constraints in bset that do not involve any of the dimensions
2565 * first to first + n - 1 of the given type.
2567 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2568 __isl_take isl_basic_set
*bset
,
2569 enum isl_dim_type type
, unsigned first
, unsigned n
)
2571 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2575 /* Drop all constraints in bmap that involve any of the dimensions
2576 * first to first + n - 1 of the given type.
2578 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2579 __isl_take isl_basic_map
*bmap
,
2580 enum isl_dim_type type
, unsigned first
, unsigned n
)
2587 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2588 return isl_basic_map_free(bmap
);
2590 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2591 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2592 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2595 /* Drop all constraints in bset that involve any of the dimensions
2596 * first to first + n - 1 of the given type.
2598 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2599 __isl_take isl_basic_set
*bset
,
2600 enum isl_dim_type type
, unsigned first
, unsigned n
)
2602 return isl_basic_map_drop_constraints_involving_dims(bset
,
2606 /* Drop constraints from "map" by applying "drop" to each basic map.
2608 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2609 enum isl_dim_type type
, unsigned first
, unsigned n
,
2610 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2611 enum isl_dim_type type
, unsigned first
, unsigned n
))
2619 dim
= isl_map_dim(map
, type
);
2620 if (first
+ n
> dim
|| first
+ n
< first
)
2621 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2622 "index out of bounds", return isl_map_free(map
));
2624 map
= isl_map_cow(map
);
2628 for (i
= 0; i
< map
->n
; ++i
) {
2629 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
2631 return isl_map_free(map
);
2635 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2640 /* Drop all constraints in map that involve any of the dimensions
2641 * first to first + n - 1 of the given type.
2643 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
2644 __isl_take isl_map
*map
,
2645 enum isl_dim_type type
, unsigned first
, unsigned n
)
2649 return drop_constraints(map
, type
, first
, n
,
2650 &isl_basic_map_drop_constraints_involving_dims
);
2653 /* Drop all constraints in "map" that do not involve any of the dimensions
2654 * first to first + n - 1 of the given type.
2656 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
2657 __isl_take isl_map
*map
,
2658 enum isl_dim_type type
, unsigned first
, unsigned n
)
2661 isl_space
*space
= isl_map_get_space(map
);
2663 return isl_map_universe(space
);
2665 return drop_constraints(map
, type
, first
, n
,
2666 &isl_basic_map_drop_constraints_not_involving_dims
);
2669 /* Drop all constraints in set that involve any of the dimensions
2670 * first to first + n - 1 of the given type.
2672 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
2673 __isl_take isl_set
*set
,
2674 enum isl_dim_type type
, unsigned first
, unsigned n
)
2676 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
2679 /* Drop all constraints in "set" that do not involve any of the dimensions
2680 * first to first + n - 1 of the given type.
2682 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
2683 __isl_take isl_set
*set
,
2684 enum isl_dim_type type
, unsigned first
, unsigned n
)
2686 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
2689 /* Does local variable "div" of "bmap" have a complete explicit representation?
2690 * Having a complete explicit representation requires not only
2691 * an explicit representation, but also that all local variables
2692 * that appear in this explicit representation in turn have
2693 * a complete explicit representation.
2695 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
2698 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2701 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
2702 if (marked
< 0 || marked
)
2703 return isl_bool_not(marked
);
2705 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2708 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2710 known
= isl_basic_map_div_is_known(bmap
, i
);
2711 if (known
< 0 || !known
)
2715 return isl_bool_true
;
2718 /* Remove all divs that are unknown or defined in terms of unknown divs.
2720 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2721 __isl_take isl_basic_map
*bmap
)
2728 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2729 if (isl_basic_map_div_is_known(bmap
, i
))
2731 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2740 /* Remove all divs that are unknown or defined in terms of unknown divs.
2742 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2743 __isl_take isl_basic_set
*bset
)
2745 return isl_basic_map_remove_unknown_divs(bset
);
2748 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2757 map
= isl_map_cow(map
);
2761 for (i
= 0; i
< map
->n
; ++i
) {
2762 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2772 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2774 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
2777 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2778 __isl_take isl_basic_set
*bset
,
2779 enum isl_dim_type type
, unsigned first
, unsigned n
)
2781 isl_basic_map
*bmap
= bset_to_bmap(bset
);
2782 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2783 return bset_from_bmap(bmap
);
2786 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2787 enum isl_dim_type type
, unsigned first
, unsigned n
)
2794 map
= isl_map_cow(map
);
2797 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2799 for (i
= 0; i
< map
->n
; ++i
) {
2800 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2801 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2805 map
= isl_map_drop(map
, type
, first
, n
);
2812 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2813 enum isl_dim_type type
, unsigned first
, unsigned n
)
2815 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
2819 /* Project out n inputs starting at first using Fourier-Motzkin */
2820 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2821 unsigned first
, unsigned n
)
2823 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2826 static void dump_term(struct isl_basic_map
*bmap
,
2827 isl_int c
, int pos
, FILE *out
)
2830 unsigned in
= isl_basic_map_n_in(bmap
);
2831 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2832 unsigned nparam
= isl_basic_map_n_param(bmap
);
2834 isl_int_print(out
, c
, 0);
2836 if (!isl_int_is_one(c
))
2837 isl_int_print(out
, c
, 0);
2838 if (pos
< 1 + nparam
) {
2839 name
= isl_space_get_dim_name(bmap
->dim
,
2840 isl_dim_param
, pos
- 1);
2842 fprintf(out
, "%s", name
);
2844 fprintf(out
, "p%d", pos
- 1);
2845 } else if (pos
< 1 + nparam
+ in
)
2846 fprintf(out
, "i%d", pos
- 1 - nparam
);
2847 else if (pos
< 1 + nparam
+ dim
)
2848 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2850 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2854 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2855 int sign
, FILE *out
)
2859 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2863 for (i
= 0, first
= 1; i
< len
; ++i
) {
2864 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2867 fprintf(out
, " + ");
2869 isl_int_abs(v
, c
[i
]);
2870 dump_term(bmap
, v
, i
, out
);
2877 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2878 const char *op
, FILE *out
, int indent
)
2882 fprintf(out
, "%*s", indent
, "");
2884 dump_constraint_sign(bmap
, c
, 1, out
);
2885 fprintf(out
, " %s ", op
);
2886 dump_constraint_sign(bmap
, c
, -1, out
);
2890 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2891 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2893 fprintf(out
, "%*s", indent
, "");
2894 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2899 static void dump_constraints(struct isl_basic_map
*bmap
,
2900 isl_int
**c
, unsigned n
,
2901 const char *op
, FILE *out
, int indent
)
2905 for (i
= 0; i
< n
; ++i
)
2906 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2909 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2913 unsigned total
= isl_basic_map_total_dim(bmap
);
2915 for (j
= 0; j
< 1 + total
; ++j
) {
2916 if (isl_int_is_zero(exp
[j
]))
2918 if (!first
&& isl_int_is_pos(exp
[j
]))
2920 dump_term(bmap
, exp
[j
], j
, out
);
2925 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2929 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2930 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2932 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2933 fprintf(out
, "%*s", indent
, "");
2934 fprintf(out
, "e%d = [(", i
);
2935 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2937 isl_int_print(out
, bmap
->div
[i
][0], 0);
2938 fprintf(out
, "]\n");
2942 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2943 FILE *out
, int indent
)
2946 fprintf(out
, "null basic set\n");
2950 fprintf(out
, "%*s", indent
, "");
2951 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2952 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2953 bset
->extra
, bset
->flags
);
2954 dump(bset_to_bmap(bset
), out
, indent
);
2957 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2958 FILE *out
, int indent
)
2961 fprintf(out
, "null basic map\n");
2965 fprintf(out
, "%*s", indent
, "");
2966 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2967 "flags: %x, n_name: %d\n",
2969 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2970 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2971 dump(bmap
, out
, indent
);
2974 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2979 total
= isl_basic_map_total_dim(bmap
);
2980 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2981 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2982 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2983 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2987 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
2992 if (isl_space_dim(space
, isl_dim_in
) != 0)
2993 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
2994 "set cannot have input dimensions", goto error
);
2995 return isl_map_alloc_space(space
, n
, flags
);
2997 isl_space_free(space
);
3001 /* Make sure "map" has room for at least "n" more basic maps.
3003 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
3006 struct isl_map
*grown
= NULL
;
3010 isl_assert(map
->ctx
, n
>= 0, goto error
);
3011 if (map
->n
+ n
<= map
->size
)
3013 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3016 for (i
= 0; i
< map
->n
; ++i
) {
3017 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3025 isl_map_free(grown
);
3030 /* Make sure "set" has room for at least "n" more basic sets.
3032 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3034 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3037 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
3039 return isl_map_from_basic_map(bset
);
3042 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
3044 struct isl_map
*map
;
3049 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3050 return isl_map_add_basic_map(map
, bmap
);
3053 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3054 __isl_take isl_basic_set
*bset
)
3056 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3057 bset_to_bmap(bset
)));
3060 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3062 return isl_map_free(set
);
3065 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3070 fprintf(out
, "null set\n");
3074 fprintf(out
, "%*s", indent
, "");
3075 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3076 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3078 for (i
= 0; i
< set
->n
; ++i
) {
3079 fprintf(out
, "%*s", indent
, "");
3080 fprintf(out
, "basic set %d:\n", i
);
3081 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3085 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3090 fprintf(out
, "null map\n");
3094 fprintf(out
, "%*s", indent
, "");
3095 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3096 "flags: %x, n_name: %d\n",
3097 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3098 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3099 for (i
= 0; i
< map
->n
; ++i
) {
3100 fprintf(out
, "%*s", indent
, "");
3101 fprintf(out
, "basic map %d:\n", i
);
3102 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3106 struct isl_basic_map
*isl_basic_map_intersect_domain(
3107 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
3109 struct isl_basic_map
*bmap_domain
;
3111 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3114 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3115 isl_assert(bset
->ctx
,
3116 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3118 bmap
= isl_basic_map_cow(bmap
);
3121 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3122 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3123 bmap_domain
= isl_basic_map_from_domain(bset
);
3124 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3126 bmap
= isl_basic_map_simplify(bmap
);
3127 return isl_basic_map_finalize(bmap
);
3129 isl_basic_map_free(bmap
);
3130 isl_basic_set_free(bset
);
3134 /* Check that the space of "bset" is the same as that of the range of "bmap".
3136 static isl_stat
isl_basic_map_check_compatible_range(
3137 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3141 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3143 return isl_stat_error
;
3145 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3146 "incompatible spaces", return isl_stat_error
);
3151 struct isl_basic_map
*isl_basic_map_intersect_range(
3152 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
3154 struct isl_basic_map
*bmap_range
;
3156 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3159 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3160 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3163 if (isl_basic_set_plain_is_universe(bset
)) {
3164 isl_basic_set_free(bset
);
3168 bmap
= isl_basic_map_cow(bmap
);
3171 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3172 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3173 bmap_range
= bset_to_bmap(bset
);
3174 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3176 bmap
= isl_basic_map_simplify(bmap
);
3177 return isl_basic_map_finalize(bmap
);
3179 isl_basic_map_free(bmap
);
3180 isl_basic_set_free(bset
);
3184 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3185 __isl_keep isl_vec
*vec
)
3192 return isl_bool_error
;
3194 total
= 1 + isl_basic_map_total_dim(bmap
);
3195 if (total
!= vec
->size
)
3196 return isl_bool_false
;
3200 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3201 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3202 if (!isl_int_is_zero(s
)) {
3204 return isl_bool_false
;
3208 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3209 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3210 if (isl_int_is_neg(s
)) {
3212 return isl_bool_false
;
3218 return isl_bool_true
;
3221 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3222 __isl_keep isl_vec
*vec
)
3224 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3227 struct isl_basic_map
*isl_basic_map_intersect(
3228 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3230 struct isl_vec
*sample
= NULL
;
3232 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3234 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3235 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3236 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3237 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3238 return isl_basic_map_intersect(bmap2
, bmap1
);
3240 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3241 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3242 isl_assert(bmap1
->ctx
,
3243 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3245 if (isl_basic_map_plain_is_empty(bmap1
)) {
3246 isl_basic_map_free(bmap2
);
3249 if (isl_basic_map_plain_is_empty(bmap2
)) {
3250 isl_basic_map_free(bmap1
);
3254 if (bmap1
->sample
&&
3255 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3256 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3257 sample
= isl_vec_copy(bmap1
->sample
);
3258 else if (bmap2
->sample
&&
3259 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3260 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3261 sample
= isl_vec_copy(bmap2
->sample
);
3263 bmap1
= isl_basic_map_cow(bmap1
);
3266 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3267 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3268 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3271 isl_vec_free(sample
);
3273 isl_vec_free(bmap1
->sample
);
3274 bmap1
->sample
= sample
;
3277 bmap1
= isl_basic_map_simplify(bmap1
);
3278 return isl_basic_map_finalize(bmap1
);
3281 isl_vec_free(sample
);
3282 isl_basic_map_free(bmap1
);
3283 isl_basic_map_free(bmap2
);
3287 struct isl_basic_set
*isl_basic_set_intersect(
3288 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3290 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3291 bset_to_bmap(bset2
)));
3294 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3295 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3297 return isl_basic_set_intersect(bset1
, bset2
);
3300 /* Special case of isl_map_intersect, where both map1 and map2
3301 * are convex, without any divs and such that either map1 or map2
3302 * contains a single constraint. This constraint is then simply
3303 * added to the other map.
3305 static __isl_give isl_map
*map_intersect_add_constraint(
3306 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3308 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3309 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3310 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3311 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3313 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3314 return isl_map_intersect(map2
, map1
);
3316 map1
= isl_map_cow(map1
);
3319 if (isl_map_plain_is_empty(map1
)) {
3323 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3324 if (map2
->p
[0]->n_eq
== 1)
3325 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3327 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3328 map2
->p
[0]->ineq
[0]);
3330 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3331 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3335 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3336 isl_basic_map_free(map1
->p
[0]);
3349 /* map2 may be either a parameter domain or a map living in the same
3352 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3353 __isl_take isl_map
*map2
)
3362 if ((isl_map_plain_is_empty(map1
) ||
3363 isl_map_plain_is_universe(map2
)) &&
3364 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3368 if ((isl_map_plain_is_empty(map2
) ||
3369 isl_map_plain_is_universe(map1
)) &&
3370 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3375 if (map1
->n
== 1 && map2
->n
== 1 &&
3376 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3377 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3378 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3379 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3380 return map_intersect_add_constraint(map1
, map2
);
3382 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3383 isl_space_dim(map2
->dim
, isl_dim_param
))
3384 isl_assert(map1
->ctx
,
3385 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3387 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3388 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3389 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3391 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3392 map1
->n
* map2
->n
, flags
);
3395 for (i
= 0; i
< map1
->n
; ++i
)
3396 for (j
= 0; j
< map2
->n
; ++j
) {
3397 struct isl_basic_map
*part
;
3398 part
= isl_basic_map_intersect(
3399 isl_basic_map_copy(map1
->p
[i
]),
3400 isl_basic_map_copy(map2
->p
[j
]));
3401 if (isl_basic_map_is_empty(part
) < 0)
3402 part
= isl_basic_map_free(part
);
3403 result
= isl_map_add_basic_map(result
, part
);
3416 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3417 __isl_take isl_map
*map2
)
3421 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3422 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3423 "spaces don't match", goto error
);
3424 return map_intersect_internal(map1
, map2
);
3431 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3432 __isl_take isl_map
*map2
)
3434 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3437 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3439 return set_from_map(isl_map_intersect(set_to_map(set1
),
3443 /* map_intersect_internal accepts intersections
3444 * with parameter domains, so we can just call that function.
3446 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3447 __isl_take isl_set
*params
)
3449 return map_intersect_internal(map
, params
);
3452 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3453 __isl_take isl_map
*map2
)
3455 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3458 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3459 __isl_take isl_set
*params
)
3461 return isl_map_intersect_params(set
, params
);
3464 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
3467 unsigned pos
, n1
, n2
;
3471 bmap
= isl_basic_map_cow(bmap
);
3474 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3475 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3476 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3477 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3478 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3479 return isl_basic_map_reset_space(bmap
, space
);
3482 static __isl_give isl_basic_map
*basic_map_space_reset(
3483 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3489 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3492 space
= isl_basic_map_get_space(bmap
);
3493 space
= isl_space_reset(space
, type
);
3494 bmap
= isl_basic_map_reset_space(bmap
, space
);
3498 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3499 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3500 unsigned pos
, unsigned n
)
3504 struct isl_basic_map
*res
;
3505 struct isl_dim_map
*dim_map
;
3506 unsigned total
, off
;
3507 enum isl_dim_type t
;
3510 return basic_map_space_reset(bmap
, type
);
3515 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3517 total
= isl_basic_map_total_dim(bmap
) + n
;
3518 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3520 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3522 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3524 unsigned size
= isl_basic_map_dim(bmap
, t
);
3525 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3527 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3528 pos
, size
- pos
, off
+ pos
+ n
);
3530 off
+= isl_space_dim(res_dim
, t
);
3532 isl_dim_map_div(dim_map
, bmap
, off
);
3534 res
= isl_basic_map_alloc_space(res_dim
,
3535 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3536 rational
= isl_basic_map_is_rational(bmap
);
3538 res
= isl_basic_map_free(res
);
3540 res
= isl_basic_map_set_rational(res
);
3541 if (isl_basic_map_plain_is_empty(bmap
)) {
3542 isl_basic_map_free(bmap
);
3544 return isl_basic_map_set_to_empty(res
);
3546 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3547 return isl_basic_map_finalize(res
);
3550 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3551 __isl_take isl_basic_set
*bset
,
3552 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3554 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3557 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3558 enum isl_dim_type type
, unsigned n
)
3562 return isl_basic_map_insert_dims(bmap
, type
,
3563 isl_basic_map_dim(bmap
, type
), n
);
3566 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3567 enum isl_dim_type type
, unsigned n
)
3571 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3572 return isl_basic_map_add_dims(bset
, type
, n
);
3574 isl_basic_set_free(bset
);
3578 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3579 enum isl_dim_type type
)
3583 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3586 space
= isl_map_get_space(map
);
3587 space
= isl_space_reset(space
, type
);
3588 map
= isl_map_reset_space(map
, space
);
3592 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3593 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3598 return map_space_reset(map
, type
);
3600 map
= isl_map_cow(map
);
3604 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3608 for (i
= 0; i
< map
->n
; ++i
) {
3609 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3620 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3621 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3623 return isl_map_insert_dims(set
, type
, pos
, n
);
3626 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3627 enum isl_dim_type type
, unsigned n
)
3631 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3634 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3635 enum isl_dim_type type
, unsigned n
)
3639 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3640 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
3646 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3647 __isl_take isl_basic_map
*bmap
,
3648 enum isl_dim_type dst_type
, unsigned dst_pos
,
3649 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3651 struct isl_dim_map
*dim_map
;
3652 struct isl_basic_map
*res
;
3653 enum isl_dim_type t
;
3654 unsigned total
, off
;
3661 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
3662 return isl_basic_map_free(bmap
);
3664 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3667 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3669 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3670 pos(bmap
->dim
, src_type
) + src_pos
+
3671 ((src_type
< dst_type
) ? n
: 0)) {
3672 bmap
= isl_basic_map_cow(bmap
);
3676 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3677 src_type
, src_pos
, n
);
3681 bmap
= isl_basic_map_finalize(bmap
);
3686 total
= isl_basic_map_total_dim(bmap
);
3687 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3690 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3691 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3692 if (t
== dst_type
) {
3693 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3696 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3699 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3700 dst_pos
, size
- dst_pos
, off
);
3701 off
+= size
- dst_pos
;
3702 } else if (t
== src_type
) {
3703 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3706 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3707 src_pos
+ n
, size
- src_pos
- n
, off
);
3708 off
+= size
- src_pos
- n
;
3710 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3714 isl_dim_map_div(dim_map
, bmap
, off
);
3716 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3717 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3718 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3722 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3723 src_type
, src_pos
, n
);
3727 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3728 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3729 bmap
= isl_basic_map_finalize(bmap
);
3733 isl_basic_map_free(bmap
);
3737 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3738 enum isl_dim_type dst_type
, unsigned dst_pos
,
3739 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3741 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3742 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
3743 src_type
, src_pos
, n
);
3744 return bset_from_bmap(bmap
);
3747 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3748 enum isl_dim_type dst_type
, unsigned dst_pos
,
3749 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3753 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3754 return set_from_map(isl_map_move_dims(set_to_map(set
),
3755 dst_type
, dst_pos
, src_type
, src_pos
, n
));
3761 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3762 enum isl_dim_type dst_type
, unsigned dst_pos
,
3763 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3772 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3775 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3778 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3780 map
= isl_map_cow(map
);
3784 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3788 for (i
= 0; i
< map
->n
; ++i
) {
3789 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3791 src_type
, src_pos
, n
);
3802 /* Move the specified dimensions to the last columns right before
3803 * the divs. Don't change the dimension specification of bmap.
3804 * That's the responsibility of the caller.
3806 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3807 enum isl_dim_type type
, unsigned first
, unsigned n
)
3809 struct isl_dim_map
*dim_map
;
3810 struct isl_basic_map
*res
;
3811 enum isl_dim_type t
;
3812 unsigned total
, off
;
3816 if (pos(bmap
->dim
, type
) + first
+ n
==
3817 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3820 total
= isl_basic_map_total_dim(bmap
);
3821 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3824 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3825 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3827 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3830 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3831 first
, n
, total
- bmap
->n_div
- n
);
3832 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3833 first
+ n
, size
- (first
+ n
), off
);
3834 off
+= size
- (first
+ n
);
3836 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3840 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3842 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3843 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3844 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3848 /* Insert "n" rows in the divs of "bmap".
3850 * The number of columns is not changed, which means that the last
3851 * dimensions of "bmap" are being reintepreted as the new divs.
3852 * The space of "bmap" is not adjusted, however, which means
3853 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3854 * from the space of "bmap" is the responsibility of the caller.
3856 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3864 bmap
= isl_basic_map_cow(bmap
);
3868 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3869 old
= bmap
->block2
.data
;
3870 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3871 (bmap
->extra
+ n
) * (1 + row_size
));
3872 if (!bmap
->block2
.data
)
3873 return isl_basic_map_free(bmap
);
3874 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3876 return isl_basic_map_free(bmap
);
3877 for (i
= 0; i
< n
; ++i
) {
3878 new_div
[i
] = bmap
->block2
.data
+
3879 (bmap
->extra
+ i
) * (1 + row_size
);
3880 isl_seq_clr(new_div
[i
], 1 + row_size
);
3882 for (i
= 0; i
< bmap
->extra
; ++i
)
3883 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3885 bmap
->div
= new_div
;
3892 /* Drop constraints from "bmap" that only involve the variables
3893 * of "type" in the range [first, first + n] that are not related
3894 * to any of the variables outside that interval.
3895 * These constraints cannot influence the values for the variables
3896 * outside the interval, except in case they cause "bmap" to be empty.
3897 * Only drop the constraints if "bmap" is known to be non-empty.
3899 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
3900 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3901 unsigned first
, unsigned n
)
3905 unsigned dim
, n_div
;
3908 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
3910 return isl_basic_map_free(bmap
);
3914 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
3915 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
3916 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
3918 return isl_basic_map_free(bmap
);
3919 first
+= isl_basic_map_offset(bmap
, type
) - 1;
3920 for (i
= 0; i
< first
; ++i
)
3922 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
3925 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
3930 /* Turn the n dimensions of type type, starting at first
3931 * into existentially quantified variables.
3933 * If a subset of the projected out variables are unrelated
3934 * to any of the variables that remain, then the constraints
3935 * involving this subset are simply dropped first.
3937 __isl_give isl_basic_map
*isl_basic_map_project_out(
3938 __isl_take isl_basic_map
*bmap
,
3939 enum isl_dim_type type
, unsigned first
, unsigned n
)
3942 return basic_map_space_reset(bmap
, type
);
3943 if (type
== isl_dim_div
)
3944 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
3945 "cannot project out existentially quantified variables",
3946 return isl_basic_map_free(bmap
));
3948 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
3952 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3953 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3955 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
3956 return isl_basic_map_free(bmap
);
3958 bmap
= move_last(bmap
, type
, first
, n
);
3959 bmap
= isl_basic_map_cow(bmap
);
3960 bmap
= insert_div_rows(bmap
, n
);
3964 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3967 bmap
= isl_basic_map_simplify(bmap
);
3968 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3969 return isl_basic_map_finalize(bmap
);
3971 isl_basic_map_free(bmap
);
3975 /* Turn the n dimensions of type type, starting at first
3976 * into existentially quantified variables.
3978 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3979 enum isl_dim_type type
, unsigned first
, unsigned n
)
3981 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
3985 /* Turn the n dimensions of type type, starting at first
3986 * into existentially quantified variables.
3988 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3989 enum isl_dim_type type
, unsigned first
, unsigned n
)
3997 return map_space_reset(map
, type
);
3999 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
4001 map
= isl_map_cow(map
);
4005 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4009 for (i
= 0; i
< map
->n
; ++i
) {
4010 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4021 /* Turn the n dimensions of type type, starting at first
4022 * into existentially quantified variables.
4024 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4025 enum isl_dim_type type
, unsigned first
, unsigned n
)
4027 return set_from_map(isl_map_project_out(set_to_map(set
),
4031 /* Return a map that projects the elements in "set" onto their
4032 * "n" set dimensions starting at "first".
4033 * "type" should be equal to isl_dim_set.
4035 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4036 enum isl_dim_type type
, unsigned first
, unsigned n
)
4044 if (type
!= isl_dim_set
)
4045 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4046 "only set dimensions can be projected out", goto error
);
4047 dim
= isl_set_dim(set
, isl_dim_set
);
4048 if (first
+ n
> dim
|| first
+ n
< first
)
4049 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4050 "index out of bounds", goto error
);
4052 map
= isl_map_from_domain(set
);
4053 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4054 for (i
= 0; i
< n
; ++i
)
4055 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4063 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
4067 for (i
= 0; i
< n
; ++i
) {
4068 j
= isl_basic_map_alloc_div(bmap
);
4071 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4075 isl_basic_map_free(bmap
);
4079 struct isl_basic_map
*isl_basic_map_apply_range(
4080 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4082 isl_space
*dim_result
= NULL
;
4083 struct isl_basic_map
*bmap
;
4084 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4085 struct isl_dim_map
*dim_map1
, *dim_map2
;
4087 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4089 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4090 bmap2
->dim
, isl_dim_in
))
4091 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4092 "spaces don't match", goto error
);
4094 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4095 isl_space_copy(bmap2
->dim
));
4097 n_in
= isl_basic_map_n_in(bmap1
);
4098 n_out
= isl_basic_map_n_out(bmap2
);
4099 n
= isl_basic_map_n_out(bmap1
);
4100 nparam
= isl_basic_map_n_param(bmap1
);
4102 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4103 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4104 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4105 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4106 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4107 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4108 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4109 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4110 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4111 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4112 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4114 bmap
= isl_basic_map_alloc_space(dim_result
,
4115 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4116 bmap1
->n_eq
+ bmap2
->n_eq
,
4117 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4118 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4119 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4120 bmap
= add_divs(bmap
, n
);
4121 bmap
= isl_basic_map_simplify(bmap
);
4122 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4123 return isl_basic_map_finalize(bmap
);
4125 isl_basic_map_free(bmap1
);
4126 isl_basic_map_free(bmap2
);
4130 struct isl_basic_set
*isl_basic_set_apply(
4131 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4136 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4139 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4142 isl_basic_set_free(bset
);
4143 isl_basic_map_free(bmap
);
4147 struct isl_basic_map
*isl_basic_map_apply_domain(
4148 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4150 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4152 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4153 bmap2
->dim
, isl_dim_in
))
4154 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4155 "spaces don't match", goto error
);
4157 bmap1
= isl_basic_map_reverse(bmap1
);
4158 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4159 return isl_basic_map_reverse(bmap1
);
4161 isl_basic_map_free(bmap1
);
4162 isl_basic_map_free(bmap2
);
4166 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4167 * A \cap B -> f(A) + f(B)
4169 struct isl_basic_map
*isl_basic_map_sum(
4170 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4172 unsigned n_in
, n_out
, nparam
, total
, pos
;
4173 struct isl_basic_map
*bmap
= NULL
;
4174 struct isl_dim_map
*dim_map1
, *dim_map2
;
4177 if (!bmap1
|| !bmap2
)
4180 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4183 nparam
= isl_basic_map_n_param(bmap1
);
4184 n_in
= isl_basic_map_n_in(bmap1
);
4185 n_out
= isl_basic_map_n_out(bmap1
);
4187 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4188 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4189 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4190 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4191 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4192 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4193 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4194 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4195 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4196 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4197 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4199 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4200 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4201 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4202 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4203 for (i
= 0; i
< n_out
; ++i
) {
4204 int j
= isl_basic_map_alloc_equality(bmap
);
4207 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4208 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4209 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4210 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4212 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4213 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4214 bmap
= add_divs(bmap
, 2 * n_out
);
4216 bmap
= isl_basic_map_simplify(bmap
);
4217 return isl_basic_map_finalize(bmap
);
4219 isl_basic_map_free(bmap
);
4220 isl_basic_map_free(bmap1
);
4221 isl_basic_map_free(bmap2
);
4225 /* Given two maps A -> f(A) and B -> g(B), construct a map
4226 * A \cap B -> f(A) + f(B)
4228 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
4230 struct isl_map
*result
;
4236 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4238 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4239 map1
->n
* map2
->n
, 0);
4242 for (i
= 0; i
< map1
->n
; ++i
)
4243 for (j
= 0; j
< map2
->n
; ++j
) {
4244 struct isl_basic_map
*part
;
4245 part
= isl_basic_map_sum(
4246 isl_basic_map_copy(map1
->p
[i
]),
4247 isl_basic_map_copy(map2
->p
[j
]));
4248 if (isl_basic_map_is_empty(part
))
4249 isl_basic_map_free(part
);
4251 result
= isl_map_add_basic_map(result
, part
);
4264 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4265 __isl_take isl_set
*set2
)
4267 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4270 /* Given a basic map A -> f(A), construct A -> -f(A).
4272 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
4277 bmap
= isl_basic_map_cow(bmap
);
4281 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4282 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4283 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4284 for (j
= 0; j
< n
; ++j
)
4285 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4286 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4287 for (j
= 0; j
< n
; ++j
)
4288 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4289 for (i
= 0; i
< bmap
->n_div
; ++i
)
4290 for (j
= 0; j
< n
; ++j
)
4291 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4292 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4293 return isl_basic_map_finalize(bmap
);
4296 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4298 return isl_basic_map_neg(bset
);
4301 /* Given a map A -> f(A), construct A -> -f(A).
4303 struct isl_map
*isl_map_neg(struct isl_map
*map
)
4307 map
= isl_map_cow(map
);
4311 for (i
= 0; i
< map
->n
; ++i
) {
4312 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4323 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4325 return set_from_map(isl_map_neg(set_to_map(set
)));
4328 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4329 * A -> floor(f(A)/d).
4331 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
4334 unsigned n_in
, n_out
, nparam
, total
, pos
;
4335 struct isl_basic_map
*result
= NULL
;
4336 struct isl_dim_map
*dim_map
;
4342 nparam
= isl_basic_map_n_param(bmap
);
4343 n_in
= isl_basic_map_n_in(bmap
);
4344 n_out
= isl_basic_map_n_out(bmap
);
4346 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4347 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4348 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4349 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4350 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4351 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4353 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4354 bmap
->n_div
+ n_out
,
4355 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4356 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4357 result
= add_divs(result
, n_out
);
4358 for (i
= 0; i
< n_out
; ++i
) {
4360 j
= isl_basic_map_alloc_inequality(result
);
4363 isl_seq_clr(result
->ineq
[j
], 1+total
);
4364 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4365 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4366 j
= isl_basic_map_alloc_inequality(result
);
4369 isl_seq_clr(result
->ineq
[j
], 1+total
);
4370 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4371 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4372 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4375 result
= isl_basic_map_simplify(result
);
4376 return isl_basic_map_finalize(result
);
4378 isl_basic_map_free(result
);
4382 /* Given a map A -> f(A) and an integer d, construct a map
4383 * A -> floor(f(A)/d).
4385 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
4389 map
= isl_map_cow(map
);
4393 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4394 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4395 for (i
= 0; i
< map
->n
; ++i
) {
4396 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4407 /* Given a map A -> f(A) and an integer d, construct a map
4408 * A -> floor(f(A)/d).
4410 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4411 __isl_take isl_val
*d
)
4415 if (!isl_val_is_int(d
))
4416 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4417 "expecting integer denominator", goto error
);
4418 map
= isl_map_floordiv(map
, d
->n
);
4427 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
4433 i
= isl_basic_map_alloc_equality(bmap
);
4436 nparam
= isl_basic_map_n_param(bmap
);
4437 n_in
= isl_basic_map_n_in(bmap
);
4438 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4439 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4440 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4441 return isl_basic_map_finalize(bmap
);
4443 isl_basic_map_free(bmap
);
4447 /* Add a constraint to "bmap" expressing i_pos < o_pos
4449 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
4455 i
= isl_basic_map_alloc_inequality(bmap
);
4458 nparam
= isl_basic_map_n_param(bmap
);
4459 n_in
= isl_basic_map_n_in(bmap
);
4460 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4461 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4462 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4463 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4464 return isl_basic_map_finalize(bmap
);
4466 isl_basic_map_free(bmap
);
4470 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4472 static __isl_give isl_basic_map
*var_less_or_equal(
4473 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4479 i
= isl_basic_map_alloc_inequality(bmap
);
4482 nparam
= isl_basic_map_n_param(bmap
);
4483 n_in
= isl_basic_map_n_in(bmap
);
4484 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4485 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4486 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4487 return isl_basic_map_finalize(bmap
);
4489 isl_basic_map_free(bmap
);
4493 /* Add a constraint to "bmap" expressing i_pos > o_pos
4495 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
4501 i
= isl_basic_map_alloc_inequality(bmap
);
4504 nparam
= isl_basic_map_n_param(bmap
);
4505 n_in
= isl_basic_map_n_in(bmap
);
4506 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4507 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4508 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4509 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4510 return isl_basic_map_finalize(bmap
);
4512 isl_basic_map_free(bmap
);
4516 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4518 static __isl_give isl_basic_map
*var_more_or_equal(
4519 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4525 i
= isl_basic_map_alloc_inequality(bmap
);
4528 nparam
= isl_basic_map_n_param(bmap
);
4529 n_in
= isl_basic_map_n_in(bmap
);
4530 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4531 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4532 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4533 return isl_basic_map_finalize(bmap
);
4535 isl_basic_map_free(bmap
);
4539 __isl_give isl_basic_map
*isl_basic_map_equal(
4540 __isl_take isl_space
*dim
, unsigned n_equal
)
4543 struct isl_basic_map
*bmap
;
4544 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4547 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4548 bmap
= var_equal(bmap
, i
);
4549 return isl_basic_map_finalize(bmap
);
4552 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4554 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4558 struct isl_basic_map
*bmap
;
4559 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4562 for (i
= 0; i
< pos
&& bmap
; ++i
)
4563 bmap
= var_equal(bmap
, i
);
4565 bmap
= var_less(bmap
, pos
);
4566 return isl_basic_map_finalize(bmap
);
4569 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4571 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4572 __isl_take isl_space
*dim
, unsigned pos
)
4575 isl_basic_map
*bmap
;
4577 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4578 for (i
= 0; i
< pos
; ++i
)
4579 bmap
= var_equal(bmap
, i
);
4580 bmap
= var_less_or_equal(bmap
, pos
);
4581 return isl_basic_map_finalize(bmap
);
4584 /* Return a relation on "dim" expressing i_pos > o_pos
4586 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4590 struct isl_basic_map
*bmap
;
4591 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4594 for (i
= 0; i
< pos
&& bmap
; ++i
)
4595 bmap
= var_equal(bmap
, i
);
4597 bmap
= var_more(bmap
, pos
);
4598 return isl_basic_map_finalize(bmap
);
4601 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
4603 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4604 __isl_take isl_space
*dim
, unsigned pos
)
4607 isl_basic_map
*bmap
;
4609 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4610 for (i
= 0; i
< pos
; ++i
)
4611 bmap
= var_equal(bmap
, i
);
4612 bmap
= var_more_or_equal(bmap
, pos
);
4613 return isl_basic_map_finalize(bmap
);
4616 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4617 unsigned n
, int equal
)
4619 struct isl_map
*map
;
4622 if (n
== 0 && equal
)
4623 return isl_map_universe(dims
);
4625 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4627 for (i
= 0; i
+ 1 < n
; ++i
)
4628 map
= isl_map_add_basic_map(map
,
4629 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4632 map
= isl_map_add_basic_map(map
,
4633 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4635 map
= isl_map_add_basic_map(map
,
4636 isl_basic_map_less_at(dims
, n
- 1));
4638 isl_space_free(dims
);
4643 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4647 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4650 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4652 return map_lex_lte_first(dim
, n
, 0);
4655 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4657 return map_lex_lte_first(dim
, n
, 1);
4660 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4662 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4665 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4667 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4670 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4671 unsigned n
, int equal
)
4673 struct isl_map
*map
;
4676 if (n
== 0 && equal
)
4677 return isl_map_universe(dims
);
4679 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4681 for (i
= 0; i
+ 1 < n
; ++i
)
4682 map
= isl_map_add_basic_map(map
,
4683 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4686 map
= isl_map_add_basic_map(map
,
4687 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4689 map
= isl_map_add_basic_map(map
,
4690 isl_basic_map_more_at(dims
, n
- 1));
4692 isl_space_free(dims
);
4697 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4701 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4704 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4706 return map_lex_gte_first(dim
, n
, 0);
4709 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4711 return map_lex_gte_first(dim
, n
, 1);
4714 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4716 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4719 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4721 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4724 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4725 __isl_take isl_set
*set2
)
4728 map
= isl_map_lex_le(isl_set_get_space(set1
));
4729 map
= isl_map_intersect_domain(map
, set1
);
4730 map
= isl_map_intersect_range(map
, set2
);
4734 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4735 __isl_take isl_set
*set2
)
4738 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4739 map
= isl_map_intersect_domain(map
, set1
);
4740 map
= isl_map_intersect_range(map
, set2
);
4744 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4745 __isl_take isl_set
*set2
)
4748 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4749 map
= isl_map_intersect_domain(map
, set1
);
4750 map
= isl_map_intersect_range(map
, set2
);
4754 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4755 __isl_take isl_set
*set2
)
4758 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4759 map
= isl_map_intersect_domain(map
, set1
);
4760 map
= isl_map_intersect_range(map
, set2
);
4764 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4765 __isl_take isl_map
*map2
)
4768 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4769 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4770 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4774 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4775 __isl_take isl_map
*map2
)
4778 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4779 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4780 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4784 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4785 __isl_take isl_map
*map2
)
4788 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4789 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4790 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4794 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4795 __isl_take isl_map
*map2
)
4798 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4799 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4800 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4804 /* For a div d = floor(f/m), add the constraint
4808 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
4809 unsigned pos
, isl_int
*div
)
4812 unsigned total
= isl_basic_map_total_dim(bmap
);
4814 i
= isl_basic_map_alloc_inequality(bmap
);
4816 return isl_stat_error
;
4817 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4818 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4823 /* For a div d = floor(f/m), add the constraint
4825 * -(f-(m-1)) + m d >= 0
4827 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
4828 unsigned pos
, isl_int
*div
)
4831 unsigned total
= isl_basic_map_total_dim(bmap
);
4833 i
= isl_basic_map_alloc_inequality(bmap
);
4835 return isl_stat_error
;
4836 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4837 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
4838 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
4839 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
4844 /* For a div d = floor(f/m), add the constraints
4847 * -(f-(m-1)) + m d >= 0
4849 * Note that the second constraint is the negation of
4853 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4854 unsigned pos
, isl_int
*div
)
4856 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
4858 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
4863 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4864 unsigned pos
, isl_int
*div
)
4866 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
4870 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4872 unsigned total
= isl_basic_map_total_dim(bmap
);
4873 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4875 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4879 /* For each known div d = floor(f/m), add the constraints
4882 * -(f-(m-1)) + m d >= 0
4884 * Remove duplicate constraints in case of some these div constraints
4885 * already appear in "bmap".
4887 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
4888 __isl_take isl_basic_map
*bmap
)
4894 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4898 bmap
= add_known_div_constraints(bmap
);
4899 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
4900 bmap
= isl_basic_map_finalize(bmap
);
4904 /* Add the div constraint of sign "sign" for div "div" of "bmap".
4906 * In particular, if this div is of the form d = floor(f/m),
4907 * then add the constraint
4911 * if sign < 0 or the constraint
4913 * -(f-(m-1)) + m d >= 0
4917 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
4918 unsigned div
, int sign
)
4926 total
= isl_basic_map_total_dim(bmap
);
4927 div_pos
= total
- bmap
->n_div
+ div
;
4930 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4932 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4935 struct isl_basic_set
*isl_basic_map_underlying_set(
4936 struct isl_basic_map
*bmap
)
4940 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4942 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4943 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4944 return bset_from_bmap(bmap
);
4945 bmap
= isl_basic_map_cow(bmap
);
4948 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4951 bmap
->extra
-= bmap
->n_div
;
4953 bmap
= isl_basic_map_finalize(bmap
);
4954 return bset_from_bmap(bmap
);
4956 isl_basic_map_free(bmap
);
4960 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4961 __isl_take isl_basic_set
*bset
)
4963 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
4966 /* Replace each element in "list" by the result of applying
4967 * isl_basic_map_underlying_set to the element.
4969 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
4970 __isl_take isl_basic_map_list
*list
)
4977 n
= isl_basic_map_list_n_basic_map(list
);
4978 for (i
= 0; i
< n
; ++i
) {
4979 isl_basic_map
*bmap
;
4980 isl_basic_set
*bset
;
4982 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
4983 bset
= isl_basic_set_underlying_set(bmap
);
4984 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
4990 struct isl_basic_map
*isl_basic_map_overlying_set(
4991 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4993 struct isl_basic_map
*bmap
;
4994 struct isl_ctx
*ctx
;
5001 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5002 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5003 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5005 if (like
->n_div
== 0) {
5006 isl_space
*space
= isl_basic_map_get_space(like
);
5007 isl_basic_map_free(like
);
5008 return isl_basic_map_reset_space(bset
, space
);
5010 bset
= isl_basic_set_cow(bset
);
5013 total
= bset
->dim
->n_out
+ bset
->extra
;
5014 bmap
= bset_to_bmap(bset
);
5015 isl_space_free(bmap
->dim
);
5016 bmap
->dim
= isl_space_copy(like
->dim
);
5019 bmap
->n_div
= like
->n_div
;
5020 bmap
->extra
+= like
->n_div
;
5024 ltotal
= total
- bmap
->extra
+ like
->extra
;
5027 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5028 bmap
->extra
* (1 + 1 + total
));
5029 if (isl_blk_is_error(bmap
->block2
))
5031 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5035 for (i
= 0; i
< bmap
->extra
; ++i
)
5036 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5037 for (i
= 0; i
< like
->n_div
; ++i
) {
5038 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5039 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5041 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5043 isl_basic_map_free(like
);
5044 bmap
= isl_basic_map_simplify(bmap
);
5045 bmap
= isl_basic_map_finalize(bmap
);
5048 isl_basic_map_free(like
);
5049 isl_basic_set_free(bset
);
5053 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5054 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5056 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5057 bset_to_bmap(like
)));
5060 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
5064 map
= isl_map_cow(map
);
5067 map
->dim
= isl_space_cow(map
->dim
);
5071 for (i
= 1; i
< map
->n
; ++i
)
5072 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5074 for (i
= 0; i
< map
->n
; ++i
) {
5075 map
->p
[i
] = bset_to_bmap(
5076 isl_basic_map_underlying_set(map
->p
[i
]));
5081 map
->dim
= isl_space_underlying(map
->dim
, 0);
5083 isl_space_free(map
->dim
);
5084 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5088 return set_from_map(map
);
5094 /* Replace the space of "bmap" by "space".
5096 * If the space of "bmap" is identical to "space" (including the identifiers
5097 * of the input and output dimensions), then simply return the original input.
5099 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5100 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5103 isl_space
*bmap_space
;
5105 bmap_space
= isl_basic_map_peek_space(bmap
);
5106 equal
= isl_space_is_equal(bmap_space
, space
);
5107 if (equal
>= 0 && equal
)
5108 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5112 isl_space_free(space
);
5115 bmap
= isl_basic_map_cow(bmap
);
5116 if (!bmap
|| !space
)
5119 isl_space_free(bmap
->dim
);
5122 bmap
= isl_basic_map_finalize(bmap
);
5126 isl_basic_map_free(bmap
);
5127 isl_space_free(space
);
5131 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5132 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5134 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5138 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5139 __isl_take isl_space
*dim
)
5143 map
= isl_map_cow(map
);
5147 for (i
= 0; i
< map
->n
; ++i
) {
5148 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5149 isl_space_copy(dim
));
5153 isl_space_free(map
->dim
);
5159 isl_space_free(dim
);
5163 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5164 __isl_take isl_space
*dim
)
5166 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5169 /* Compute the parameter domain of the given basic set.
5171 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5177 is_params
= isl_basic_set_is_params(bset
);
5179 return isl_basic_set_free(bset
);
5183 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5184 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5185 space
= isl_basic_set_get_space(bset
);
5186 space
= isl_space_params(space
);
5187 bset
= isl_basic_set_reset_space(bset
, space
);
5191 /* Construct a zero-dimensional basic set with the given parameter domain.
5193 __isl_give isl_basic_set
*isl_basic_set_from_params(
5194 __isl_take isl_basic_set
*bset
)
5197 space
= isl_basic_set_get_space(bset
);
5198 space
= isl_space_set_from_params(space
);
5199 bset
= isl_basic_set_reset_space(bset
, space
);
5203 /* Compute the parameter domain of the given set.
5205 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5210 if (isl_set_is_params(set
))
5213 n
= isl_set_dim(set
, isl_dim_set
);
5214 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5215 space
= isl_set_get_space(set
);
5216 space
= isl_space_params(space
);
5217 set
= isl_set_reset_space(set
, space
);
5221 /* Construct a zero-dimensional set with the given parameter domain.
5223 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5226 space
= isl_set_get_space(set
);
5227 space
= isl_space_set_from_params(space
);
5228 set
= isl_set_reset_space(set
, space
);
5232 /* Compute the parameter domain of the given map.
5234 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5239 n
= isl_map_dim(map
, isl_dim_in
);
5240 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5241 n
= isl_map_dim(map
, isl_dim_out
);
5242 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5243 space
= isl_map_get_space(map
);
5244 space
= isl_space_params(space
);
5245 map
= isl_map_reset_space(map
, space
);
5249 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5256 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5258 n_out
= isl_basic_map_n_out(bmap
);
5259 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5261 return isl_basic_map_reset_space(bmap
, space
);
5264 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5267 return isl_bool_error
;
5268 return isl_space_may_be_set(bmap
->dim
);
5271 /* Is this basic map actually a set?
5272 * Users should never call this function. Outside of isl,
5273 * the type should indicate whether something is a set or a map.
5275 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5278 return isl_bool_error
;
5279 return isl_space_is_set(bmap
->dim
);
5282 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5286 is_set
= isl_basic_map_is_set(bmap
);
5291 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5293 isl_basic_map_free(bmap
);
5297 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5298 __isl_take isl_basic_map
*bmap
)
5302 isl_basic_map
*domain
;
5303 int nparam
, n_in
, n_out
;
5305 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5306 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5307 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5309 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5310 domain
= isl_basic_map_universe(dim
);
5312 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5313 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5314 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5316 for (i
= 0; i
< n_in
; ++i
)
5317 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5320 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5321 return isl_basic_map_finalize(bmap
);
5324 __isl_give isl_basic_map
*isl_basic_map_range_map(
5325 __isl_take isl_basic_map
*bmap
)
5329 isl_basic_map
*range
;
5330 int nparam
, n_in
, n_out
;
5332 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5333 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5334 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5336 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5337 range
= isl_basic_map_universe(dim
);
5339 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5340 bmap
= isl_basic_map_apply_range(bmap
, range
);
5341 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5343 for (i
= 0; i
< n_out
; ++i
)
5344 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5347 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5348 return isl_basic_map_finalize(bmap
);
5351 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5355 return isl_space_may_be_set(map
->dim
);
5358 /* Is this map actually a set?
5359 * Users should never call this function. Outside of isl,
5360 * the type should indicate whether something is a set or a map.
5362 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5365 return isl_bool_error
;
5366 return isl_space_is_set(map
->dim
);
5369 struct isl_set
*isl_map_range(struct isl_map
*map
)
5373 struct isl_set
*set
;
5375 is_set
= isl_map_is_set(map
);
5379 return set_from_map(map
);
5381 map
= isl_map_cow(map
);
5385 set
= set_from_map(map
);
5386 set
->dim
= isl_space_range(set
->dim
);
5389 for (i
= 0; i
< map
->n
; ++i
) {
5390 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5394 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5395 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5402 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5406 map
= isl_map_cow(map
);
5410 map
->dim
= isl_space_domain_map(map
->dim
);
5413 for (i
= 0; i
< map
->n
; ++i
) {
5414 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5418 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5419 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5426 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5429 isl_space
*range_dim
;
5431 map
= isl_map_cow(map
);
5435 range_dim
= isl_space_range(isl_map_get_space(map
));
5436 range_dim
= isl_space_from_range(range_dim
);
5437 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5438 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5441 for (i
= 0; i
< map
->n
; ++i
) {
5442 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5446 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5447 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5454 /* Given a wrapped map of the form A[B -> C],
5455 * return the map A[B -> C] -> B.
5457 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5464 if (!isl_set_has_tuple_id(set
))
5465 return isl_map_domain_map(isl_set_unwrap(set
));
5467 id
= isl_set_get_tuple_id(set
);
5468 map
= isl_map_domain_map(isl_set_unwrap(set
));
5469 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5474 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5475 __isl_take isl_basic_set
*bset
)
5477 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5480 __isl_give isl_basic_map
*isl_basic_map_from_range(
5481 __isl_take isl_basic_set
*bset
)
5484 space
= isl_basic_set_get_space(bset
);
5485 space
= isl_space_from_range(space
);
5486 bset
= isl_basic_set_reset_space(bset
, space
);
5487 return bset_to_bmap(bset
);
5490 /* Create a relation with the given set as range.
5491 * The domain of the created relation is a zero-dimensional
5492 * flat anonymous space.
5494 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5497 space
= isl_set_get_space(set
);
5498 space
= isl_space_from_range(space
);
5499 set
= isl_set_reset_space(set
, space
);
5500 return set_to_map(set
);
5503 /* Create a relation with the given set as domain.
5504 * The range of the created relation is a zero-dimensional
5505 * flat anonymous space.
5507 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5509 return isl_map_reverse(isl_map_from_range(set
));
5512 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5513 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5515 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5518 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5519 __isl_take isl_set
*range
)
5521 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5524 /* Return a newly allocated isl_map with given space and flags and
5525 * room for "n" basic maps.
5526 * Make sure that all cached information is cleared.
5528 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5531 struct isl_map
*map
;
5536 isl_die(space
->ctx
, isl_error_internal
,
5537 "negative number of basic maps", goto error
);
5538 map
= isl_calloc(space
->ctx
, struct isl_map
,
5539 sizeof(struct isl_map
) +
5540 (n
- 1) * sizeof(struct isl_basic_map
*));
5544 map
->ctx
= space
->ctx
;
5545 isl_ctx_ref(map
->ctx
);
5553 isl_space_free(space
);
5557 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5559 struct isl_basic_map
*bmap
;
5560 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5561 bmap
= isl_basic_map_set_to_empty(bmap
);
5565 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5567 struct isl_basic_set
*bset
;
5568 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5569 bset
= isl_basic_set_set_to_empty(bset
);
5573 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5575 struct isl_basic_map
*bmap
;
5576 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5577 bmap
= isl_basic_map_finalize(bmap
);
5581 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5583 struct isl_basic_set
*bset
;
5584 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5585 bset
= isl_basic_set_finalize(bset
);
5589 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5592 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5593 isl_basic_map
*bmap
;
5595 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5596 for (i
= 0; i
< total
; ++i
) {
5597 int k
= isl_basic_map_alloc_inequality(bmap
);
5600 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5601 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5605 isl_basic_map_free(bmap
);
5609 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5611 return isl_basic_map_nat_universe(dim
);
5614 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5616 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5619 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5621 return isl_map_nat_universe(dim
);
5624 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5626 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5629 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5631 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5634 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5636 struct isl_map
*map
;
5639 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5640 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5644 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5646 struct isl_set
*set
;
5649 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5650 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5654 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5657 struct isl_map
*dup
;
5661 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5662 for (i
= 0; i
< map
->n
; ++i
)
5663 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5667 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5668 __isl_take isl_basic_map
*bmap
)
5672 if (isl_basic_map_plain_is_empty(bmap
)) {
5673 isl_basic_map_free(bmap
);
5676 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5677 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5678 map
->p
[map
->n
] = bmap
;
5680 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5686 isl_basic_map_free(bmap
);
5690 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
5701 isl_ctx_deref(map
->ctx
);
5702 for (i
= 0; i
< map
->n
; ++i
)
5703 isl_basic_map_free(map
->p
[i
]);
5704 isl_space_free(map
->dim
);
5710 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5711 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5715 bmap
= isl_basic_map_cow(bmap
);
5716 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5717 j
= isl_basic_map_alloc_equality(bmap
);
5720 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5721 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5722 isl_int_set_si(bmap
->eq
[j
][0], value
);
5723 bmap
= isl_basic_map_simplify(bmap
);
5724 return isl_basic_map_finalize(bmap
);
5726 isl_basic_map_free(bmap
);
5730 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5731 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5735 bmap
= isl_basic_map_cow(bmap
);
5736 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5737 j
= isl_basic_map_alloc_equality(bmap
);
5740 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5741 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5742 isl_int_set(bmap
->eq
[j
][0], value
);
5743 bmap
= isl_basic_map_simplify(bmap
);
5744 return isl_basic_map_finalize(bmap
);
5746 isl_basic_map_free(bmap
);
5750 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5751 enum isl_dim_type type
, unsigned pos
, int value
)
5753 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
5754 return isl_basic_map_free(bmap
);
5755 return isl_basic_map_fix_pos_si(bmap
,
5756 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5759 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5760 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5762 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
5763 return isl_basic_map_free(bmap
);
5764 return isl_basic_map_fix_pos(bmap
,
5765 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5768 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5769 * to be equal to "v".
5771 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5772 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5776 if (!isl_val_is_int(v
))
5777 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5778 "expecting integer value", goto error
);
5779 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
5781 pos
+= isl_basic_map_offset(bmap
, type
);
5782 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5786 isl_basic_map_free(bmap
);
5791 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5792 * to be equal to "v".
5794 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5795 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5797 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5800 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5801 enum isl_dim_type type
, unsigned pos
, int value
)
5803 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
5807 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5808 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5810 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
5814 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5815 unsigned input
, int value
)
5817 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5820 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5821 unsigned dim
, int value
)
5823 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
5824 isl_dim_set
, dim
, value
));
5827 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5829 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5836 isl_basic_map_free(map
->p
[i
]);
5837 if (i
!= map
->n
- 1) {
5838 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5839 map
->p
[i
] = map
->p
[map
->n
- 1];
5846 /* Perform "fn" on each basic map of "map", where we may not be holding
5847 * the only reference to "map".
5848 * In particular, "fn" should be a semantics preserving operation
5849 * that we want to apply to all copies of "map". We therefore need
5850 * to be careful not to modify "map" in a way that breaks "map"
5851 * in case anything goes wrong.
5853 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5854 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5856 struct isl_basic_map
*bmap
;
5862 for (i
= map
->n
- 1; i
>= 0; --i
) {
5863 bmap
= isl_basic_map_copy(map
->p
[i
]);
5867 isl_basic_map_free(map
->p
[i
]);
5869 if (remove_if_empty(map
, i
) < 0)
5879 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5880 enum isl_dim_type type
, unsigned pos
, int value
)
5884 map
= isl_map_cow(map
);
5888 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5889 for (i
= map
->n
- 1; i
>= 0; --i
) {
5890 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5891 if (remove_if_empty(map
, i
) < 0)
5894 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5901 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5902 enum isl_dim_type type
, unsigned pos
, int value
)
5904 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
5907 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5908 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5912 map
= isl_map_cow(map
);
5916 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5917 for (i
= 0; i
< map
->n
; ++i
) {
5918 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5922 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5929 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5930 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5932 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
5935 /* Fix the value of the variable at position "pos" of type "type" of "map"
5936 * to be equal to "v".
5938 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5939 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5943 map
= isl_map_cow(map
);
5947 if (!isl_val_is_int(v
))
5948 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5949 "expecting integer value", goto error
);
5950 if (pos
>= isl_map_dim(map
, type
))
5951 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5952 "index out of bounds", goto error
);
5953 for (i
= map
->n
- 1; i
>= 0; --i
) {
5954 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5956 if (remove_if_empty(map
, i
) < 0)
5959 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5968 /* Fix the value of the variable at position "pos" of type "type" of "set"
5969 * to be equal to "v".
5971 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5972 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5974 return isl_map_fix_val(set
, type
, pos
, v
);
5977 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5978 unsigned input
, int value
)
5980 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5983 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5985 return set_from_map(isl_map_fix_si(set_to_map(set
),
5986 isl_dim_set
, dim
, value
));
5989 static __isl_give isl_basic_map
*basic_map_bound_si(
5990 __isl_take isl_basic_map
*bmap
,
5991 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5995 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
5996 return isl_basic_map_free(bmap
);
5997 pos
+= isl_basic_map_offset(bmap
, type
);
5998 bmap
= isl_basic_map_cow(bmap
);
5999 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6000 j
= isl_basic_map_alloc_inequality(bmap
);
6003 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6005 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6006 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6008 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6009 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6011 bmap
= isl_basic_map_simplify(bmap
);
6012 return isl_basic_map_finalize(bmap
);
6014 isl_basic_map_free(bmap
);
6018 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6019 __isl_take isl_basic_map
*bmap
,
6020 enum isl_dim_type type
, unsigned pos
, int value
)
6022 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6025 /* Constrain the values of the given dimension to be no greater than "value".
6027 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6028 __isl_take isl_basic_map
*bmap
,
6029 enum isl_dim_type type
, unsigned pos
, int value
)
6031 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6034 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6035 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6039 map
= isl_map_cow(map
);
6043 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6044 for (i
= 0; i
< map
->n
; ++i
) {
6045 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6046 type
, pos
, value
, upper
);
6050 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6057 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6058 enum isl_dim_type type
, unsigned pos
, int value
)
6060 return map_bound_si(map
, type
, pos
, value
, 0);
6063 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6064 enum isl_dim_type type
, unsigned pos
, int value
)
6066 return map_bound_si(map
, type
, pos
, value
, 1);
6069 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6070 enum isl_dim_type type
, unsigned pos
, int value
)
6072 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6076 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6077 enum isl_dim_type type
, unsigned pos
, int value
)
6079 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6082 /* Bound the given variable of "bmap" from below (or above is "upper"
6083 * is set) to "value".
6085 static __isl_give isl_basic_map
*basic_map_bound(
6086 __isl_take isl_basic_map
*bmap
,
6087 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6091 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6092 return isl_basic_map_free(bmap
);
6093 pos
+= isl_basic_map_offset(bmap
, type
);
6094 bmap
= isl_basic_map_cow(bmap
);
6095 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6096 j
= isl_basic_map_alloc_inequality(bmap
);
6099 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6101 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6102 isl_int_set(bmap
->ineq
[j
][0], value
);
6104 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6105 isl_int_neg(bmap
->ineq
[j
][0], value
);
6107 bmap
= isl_basic_map_simplify(bmap
);
6108 return isl_basic_map_finalize(bmap
);
6110 isl_basic_map_free(bmap
);
6114 /* Bound the given variable of "map" from below (or above is "upper"
6115 * is set) to "value".
6117 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6118 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6122 map
= isl_map_cow(map
);
6126 if (pos
>= isl_map_dim(map
, type
))
6127 isl_die(map
->ctx
, isl_error_invalid
,
6128 "index out of bounds", goto error
);
6129 for (i
= map
->n
- 1; i
>= 0; --i
) {
6130 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6131 if (remove_if_empty(map
, i
) < 0)
6134 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6141 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6142 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6144 return map_bound(map
, type
, pos
, value
, 0);
6147 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6148 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6150 return map_bound(map
, type
, pos
, value
, 1);
6153 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6154 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6156 return isl_map_lower_bound(set
, type
, pos
, value
);
6159 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6160 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6162 return isl_map_upper_bound(set
, type
, pos
, value
);
6165 /* Force the values of the variable at position "pos" of type "type" of "set"
6166 * to be no smaller than "value".
6168 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6169 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6173 if (!isl_val_is_int(value
))
6174 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6175 "expecting integer value", goto error
);
6176 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6177 isl_val_free(value
);
6180 isl_val_free(value
);
6185 /* Force the values of the variable at position "pos" of type "type" of "set"
6186 * to be no greater than "value".
6188 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6189 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6193 if (!isl_val_is_int(value
))
6194 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6195 "expecting integer value", goto error
);
6196 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6197 isl_val_free(value
);
6200 isl_val_free(value
);
6205 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
6209 map
= isl_map_cow(map
);
6213 map
->dim
= isl_space_reverse(map
->dim
);
6216 for (i
= 0; i
< map
->n
; ++i
) {
6217 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6221 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6229 #define TYPE isl_pw_multi_aff
6231 #define SUFFIX _pw_multi_aff
6233 #define EMPTY isl_pw_multi_aff_empty
6235 #define ADD isl_pw_multi_aff_union_add
6236 #include "isl_map_lexopt_templ.c"
6238 /* Given a map "map", compute the lexicographically minimal
6239 * (or maximal) image element for each domain element in dom,
6240 * in the form of an isl_pw_multi_aff.
6241 * If "empty" is not NULL, then set *empty to those elements in dom that
6242 * do not have an image element.
6243 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6244 * should be computed over the domain of "map". "empty" is also NULL
6247 * We first compute the lexicographically minimal or maximal element
6248 * in the first basic map. This results in a partial solution "res"
6249 * and a subset "todo" of dom that still need to be handled.
6250 * We then consider each of the remaining maps in "map" and successively
6251 * update both "res" and "todo".
6252 * If "empty" is NULL, then the todo sets are not needed and therefore
6253 * also not computed.
6255 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6256 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6257 __isl_give isl_set
**empty
, unsigned flags
)
6261 isl_pw_multi_aff
*res
;
6264 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6265 if (!map
|| (!full
&& !dom
))
6268 if (isl_map_plain_is_empty(map
)) {
6273 return isl_pw_multi_aff_from_map(map
);
6276 res
= basic_map_partial_lexopt_pw_multi_aff(
6277 isl_basic_map_copy(map
->p
[0]),
6278 isl_set_copy(dom
), empty
, flags
);
6282 for (i
= 1; i
< map
->n
; ++i
) {
6283 isl_pw_multi_aff
*res_i
;
6285 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6286 isl_basic_map_copy(map
->p
[i
]),
6287 isl_set_copy(dom
), empty
, flags
);
6289 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6290 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6292 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6295 todo
= isl_set_intersect(todo
, *empty
);
6314 #define TYPE isl_map
6318 #define EMPTY isl_map_empty
6320 #define ADD isl_map_union_disjoint
6321 #include "isl_map_lexopt_templ.c"
6323 /* Given a map "map", compute the lexicographically minimal
6324 * (or maximal) image element for each domain element in "dom",
6325 * in the form of an isl_map.
6326 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6327 * do not have an image element.
6328 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6329 * should be computed over the domain of "map". "empty" is also NULL
6332 * If the input consists of more than one disjunct, then first
6333 * compute the desired result in the form of an isl_pw_multi_aff and
6334 * then convert that into an isl_map.
6336 * This function used to have an explicit implementation in terms
6337 * of isl_maps, but it would continually intersect the domains of
6338 * partial results with the complement of the domain of the next
6339 * partial solution, potentially leading to an explosion in the number
6340 * of disjuncts if there are several disjuncts in the input.
6341 * An even earlier implementation of this function would look for
6342 * better results in the domain of the partial result and for extra
6343 * results in the complement of this domain, which would lead to
6344 * even more splintering.
6346 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6347 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6348 __isl_give isl_set
**empty
, unsigned flags
)
6351 struct isl_map
*res
;
6352 isl_pw_multi_aff
*pma
;
6354 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6355 if (!map
|| (!full
&& !dom
))
6358 if (isl_map_plain_is_empty(map
)) {
6367 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6373 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6375 return isl_map_from_pw_multi_aff(pma
);
6384 __isl_give isl_map
*isl_map_partial_lexmax(
6385 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6386 __isl_give isl_set
**empty
)
6388 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6391 __isl_give isl_map
*isl_map_partial_lexmin(
6392 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6393 __isl_give isl_set
**empty
)
6395 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6398 __isl_give isl_set
*isl_set_partial_lexmin(
6399 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6400 __isl_give isl_set
**empty
)
6402 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6406 __isl_give isl_set
*isl_set_partial_lexmax(
6407 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6408 __isl_give isl_set
**empty
)
6410 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6414 /* Compute the lexicographic minimum (or maximum if "flags" includes
6415 * ISL_OPT_MAX) of "bset" over its parametric domain.
6417 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6420 return isl_basic_map_lexopt(bset
, flags
);
6423 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6425 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6428 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6430 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6433 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6435 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6438 /* Compute the lexicographic minimum of "bset" over its parametric domain
6439 * for the purpose of quantifier elimination.
6440 * That is, find an explicit representation for all the existentially
6441 * quantified variables in "bset" by computing their lexicographic
6444 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6445 __isl_take isl_basic_set
*bset
)
6447 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6450 /* Extract the first and only affine expression from list
6451 * and then add it to *pwaff with the given dom.
6452 * This domain is known to be disjoint from other domains
6453 * because of the way isl_basic_map_foreach_lexmax works.
6455 static isl_stat
update_dim_opt(__isl_take isl_basic_set
*dom
,
6456 __isl_take isl_aff_list
*list
, void *user
)
6458 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6460 isl_pw_aff
**pwaff
= user
;
6461 isl_pw_aff
*pwaff_i
;
6465 if (isl_aff_list_n_aff(list
) != 1)
6466 isl_die(ctx
, isl_error_internal
,
6467 "expecting single element list", goto error
);
6469 aff
= isl_aff_list_get_aff(list
, 0);
6470 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6472 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6474 isl_aff_list_free(list
);
6478 isl_basic_set_free(dom
);
6479 isl_aff_list_free(list
);
6480 return isl_stat_error
;
6483 /* Given a basic map with one output dimension, compute the minimum or
6484 * maximum of that dimension as an isl_pw_aff.
6486 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6487 * call update_dim_opt on each leaf of the result.
6489 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6492 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6496 dim
= isl_space_from_domain(isl_space_domain(dim
));
6497 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6498 pwaff
= isl_pw_aff_empty(dim
);
6500 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6502 return isl_pw_aff_free(pwaff
);
6507 /* Compute the minimum or maximum of the given output dimension
6508 * as a function of the parameters and the input dimensions,
6509 * but independently of the other output dimensions.
6511 * We first project out the other output dimension and then compute
6512 * the "lexicographic" maximum in each basic map, combining the results
6513 * using isl_pw_aff_union_max.
6515 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6522 n_out
= isl_map_dim(map
, isl_dim_out
);
6523 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6524 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6529 isl_space
*dim
= isl_map_get_space(map
);
6531 return isl_pw_aff_empty(dim
);
6534 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6535 for (i
= 1; i
< map
->n
; ++i
) {
6536 isl_pw_aff
*pwaff_i
;
6538 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6539 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6547 /* Compute the minimum of the given output dimension as a function of the
6548 * parameters and input dimensions, but independently of
6549 * the other output dimensions.
6551 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6553 return map_dim_opt(map
, pos
, 0);
6556 /* Compute the maximum of the given output dimension as a function of the
6557 * parameters and input dimensions, but independently of
6558 * the other output dimensions.
6560 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6562 return map_dim_opt(map
, pos
, 1);
6565 /* Compute the minimum or maximum of the given set dimension
6566 * as a function of the parameters,
6567 * but independently of the other set dimensions.
6569 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6572 return map_dim_opt(set
, pos
, max
);
6575 /* Compute the maximum of the given set dimension as a function of the
6576 * parameters, but independently of the other set dimensions.
6578 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6580 return set_dim_opt(set
, pos
, 1);
6583 /* Compute the minimum of the given set dimension as a function of the
6584 * parameters, but independently of the other set dimensions.
6586 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6588 return set_dim_opt(set
, pos
, 0);
6591 /* Apply a preimage specified by "mat" on the parameters of "bset".
6592 * bset is assumed to have only parameters and divs.
6594 static struct isl_basic_set
*basic_set_parameter_preimage(
6595 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6602 bset
->dim
= isl_space_cow(bset
->dim
);
6606 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6608 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6610 bset
->dim
->nparam
= 0;
6611 bset
->dim
->n_out
= nparam
;
6612 bset
= isl_basic_set_preimage(bset
, mat
);
6614 bset
->dim
->nparam
= bset
->dim
->n_out
;
6615 bset
->dim
->n_out
= 0;
6620 isl_basic_set_free(bset
);
6624 /* Apply a preimage specified by "mat" on the parameters of "set".
6625 * set is assumed to have only parameters and divs.
6627 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
6628 __isl_take isl_mat
*mat
)
6636 nparam
= isl_set_dim(set
, isl_dim_param
);
6638 if (mat
->n_row
!= 1 + nparam
)
6639 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
6640 "unexpected number of rows", goto error
);
6642 space
= isl_set_get_space(set
);
6643 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
6644 isl_dim_param
, 0, nparam
);
6645 set
= isl_set_reset_space(set
, space
);
6646 set
= isl_set_preimage(set
, mat
);
6647 nparam
= isl_set_dim(set
, isl_dim_out
);
6648 space
= isl_set_get_space(set
);
6649 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
6650 isl_dim_out
, 0, nparam
);
6651 set
= isl_set_reset_space(set
, space
);
6659 /* Intersect the basic set "bset" with the affine space specified by the
6660 * equalities in "eq".
6662 static struct isl_basic_set
*basic_set_append_equalities(
6663 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6671 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6676 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6677 for (i
= 0; i
< eq
->n_row
; ++i
) {
6678 k
= isl_basic_set_alloc_equality(bset
);
6681 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6682 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6686 bset
= isl_basic_set_gauss(bset
, NULL
);
6687 bset
= isl_basic_set_finalize(bset
);
6692 isl_basic_set_free(bset
);
6696 /* Intersect the set "set" with the affine space specified by the
6697 * equalities in "eq".
6699 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6707 for (i
= 0; i
< set
->n
; ++i
) {
6708 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6721 /* Given a basic set "bset" that only involves parameters and existentially
6722 * quantified variables, return the index of the first equality
6723 * that only involves parameters. If there is no such equality then
6724 * return bset->n_eq.
6726 * This function assumes that isl_basic_set_gauss has been called on "bset".
6728 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6731 unsigned nparam
, n_div
;
6736 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6737 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6739 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6740 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6747 /* Compute an explicit representation for the existentially quantified
6748 * variables in "bset" by computing the "minimal value" of the set
6749 * variables. Since there are no set variables, the computation of
6750 * the minimal value essentially computes an explicit representation
6751 * of the non-empty part(s) of "bset".
6753 * The input only involves parameters and existentially quantified variables.
6754 * All equalities among parameters have been removed.
6756 * Since the existentially quantified variables in the result are in general
6757 * going to be different from those in the input, we first replace
6758 * them by the minimal number of variables based on their equalities.
6759 * This should simplify the parametric integer programming.
6761 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6763 isl_morph
*morph1
, *morph2
;
6769 if (bset
->n_eq
== 0)
6770 return isl_basic_set_lexmin_compute_divs(bset
);
6772 morph1
= isl_basic_set_parameter_compression(bset
);
6773 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6774 bset
= isl_basic_set_lift(bset
);
6775 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6776 bset
= isl_morph_basic_set(morph2
, bset
);
6777 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6778 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6780 set
= isl_basic_set_lexmin_compute_divs(bset
);
6782 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6787 /* Project the given basic set onto its parameter domain, possibly introducing
6788 * new, explicit, existential variables in the constraints.
6789 * The input has parameters and (possibly implicit) existential variables.
6790 * The output has the same parameters, but only
6791 * explicit existentially quantified variables.
6793 * The actual projection is performed by pip, but pip doesn't seem
6794 * to like equalities very much, so we first remove the equalities
6795 * among the parameters by performing a variable compression on
6796 * the parameters. Afterward, an inverse transformation is performed
6797 * and the equalities among the parameters are inserted back in.
6799 * The variable compression on the parameters may uncover additional
6800 * equalities that were only implicit before. We therefore check
6801 * if there are any new parameter equalities in the result and
6802 * if so recurse. The removal of parameter equalities is required
6803 * for the parameter compression performed by base_compute_divs.
6805 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6809 struct isl_mat
*T
, *T2
;
6810 struct isl_set
*set
;
6813 bset
= isl_basic_set_cow(bset
);
6817 if (bset
->n_eq
== 0)
6818 return base_compute_divs(bset
);
6820 bset
= isl_basic_set_gauss(bset
, NULL
);
6823 if (isl_basic_set_plain_is_empty(bset
))
6824 return isl_set_from_basic_set(bset
);
6826 i
= first_parameter_equality(bset
);
6827 if (i
== bset
->n_eq
)
6828 return base_compute_divs(bset
);
6830 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6831 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6833 eq
= isl_mat_cow(eq
);
6834 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6835 if (T
&& T
->n_col
== 0) {
6839 bset
= isl_basic_set_set_to_empty(bset
);
6840 return isl_set_from_basic_set(bset
);
6842 bset
= basic_set_parameter_preimage(bset
, T
);
6844 i
= first_parameter_equality(bset
);
6847 else if (i
== bset
->n_eq
)
6848 set
= base_compute_divs(bset
);
6850 set
= parameter_compute_divs(bset
);
6851 set
= set_parameter_preimage(set
, T2
);
6852 set
= set_append_equalities(set
, eq
);
6856 /* Insert the divs from "ls" before those of "bmap".
6858 * The number of columns is not changed, which means that the last
6859 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6860 * The caller is responsible for removing the same number of dimensions
6861 * from the space of "bmap".
6863 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6864 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6870 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6874 old_n_div
= bmap
->n_div
;
6875 bmap
= insert_div_rows(bmap
, n_div
);
6879 for (i
= 0; i
< n_div
; ++i
) {
6880 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6881 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6887 /* Replace the space of "bmap" by the space and divs of "ls".
6889 * If "ls" has any divs, then we simplify the result since we may
6890 * have discovered some additional equalities that could simplify
6891 * the div expressions.
6893 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6894 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6898 bmap
= isl_basic_map_cow(bmap
);
6902 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6903 bmap
= insert_divs_from_local_space(bmap
, ls
);
6907 isl_space_free(bmap
->dim
);
6908 bmap
->dim
= isl_local_space_get_space(ls
);
6912 isl_local_space_free(ls
);
6914 bmap
= isl_basic_map_simplify(bmap
);
6915 bmap
= isl_basic_map_finalize(bmap
);
6918 isl_basic_map_free(bmap
);
6919 isl_local_space_free(ls
);
6923 /* Replace the space of "map" by the space and divs of "ls".
6925 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6926 __isl_take isl_local_space
*ls
)
6930 map
= isl_map_cow(map
);
6934 for (i
= 0; i
< map
->n
; ++i
) {
6935 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6936 isl_local_space_copy(ls
));
6940 isl_space_free(map
->dim
);
6941 map
->dim
= isl_local_space_get_space(ls
);
6945 isl_local_space_free(ls
);
6948 isl_local_space_free(ls
);
6953 /* Compute an explicit representation for the existentially
6954 * quantified variables for which do not know any explicit representation yet.
6956 * We first sort the existentially quantified variables so that the
6957 * existentially quantified variables for which we already have an explicit
6958 * representation are placed before those for which we do not.
6959 * The input dimensions, the output dimensions and the existentially
6960 * quantified variables for which we already have an explicit
6961 * representation are then turned into parameters.
6962 * compute_divs returns a map with the same parameters and
6963 * no input or output dimensions and the dimension specification
6964 * is reset to that of the input, including the existentially quantified
6965 * variables for which we already had an explicit representation.
6967 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6969 struct isl_basic_set
*bset
;
6970 struct isl_set
*set
;
6971 struct isl_map
*map
;
6973 isl_local_space
*ls
;
6980 bmap
= isl_basic_map_sort_divs(bmap
);
6981 bmap
= isl_basic_map_cow(bmap
);
6985 n_known
= isl_basic_map_first_unknown_div(bmap
);
6987 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
6989 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6990 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6991 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6992 dim
= isl_space_set_alloc(bmap
->ctx
,
6993 nparam
+ n_in
+ n_out
+ n_known
, 0);
6997 ls
= isl_basic_map_get_local_space(bmap
);
6998 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6999 n_known
, bmap
->n_div
- n_known
);
7001 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7002 swap_div(bmap
, i
- n_known
, i
);
7003 bmap
->n_div
-= n_known
;
7004 bmap
->extra
-= n_known
;
7006 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7007 bset
= bset_from_bmap(bmap
);
7009 set
= parameter_compute_divs(bset
);
7010 map
= set_to_map(set
);
7011 map
= replace_space_by_local_space(map
, ls
);
7015 isl_basic_map_free(bmap
);
7019 /* Remove the explicit representation of local variable "div",
7022 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7023 __isl_take isl_basic_map
*bmap
, int div
)
7027 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7029 return isl_basic_map_free(bmap
);
7033 bmap
= isl_basic_map_cow(bmap
);
7036 isl_int_set_si(bmap
->div
[div
][0], 0);
7040 /* Is local variable "div" of "bmap" marked as not having an explicit
7042 * Note that even if "div" is not marked in this way and therefore
7043 * has an explicit representation, this representation may still
7044 * depend (indirectly) on other local variables that do not
7045 * have an explicit representation.
7047 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7050 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7051 return isl_bool_error
;
7052 return isl_int_is_zero(bmap
->div
[div
][0]);
7055 /* Return the position of the first local variable that does not
7056 * have an explicit representation.
7057 * Return the total number of local variables if they all have
7058 * an explicit representation.
7059 * Return -1 on error.
7061 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7068 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7069 if (!isl_basic_map_div_is_known(bmap
, i
))
7075 /* Return the position of the first local variable that does not
7076 * have an explicit representation.
7077 * Return the total number of local variables if they all have
7078 * an explicit representation.
7079 * Return -1 on error.
7081 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7083 return isl_basic_map_first_unknown_div(bset
);
7086 /* Does "bmap" have an explicit representation for all local variables?
7088 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7092 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7093 first
= isl_basic_map_first_unknown_div(bmap
);
7095 return isl_bool_error
;
7099 /* Do all basic maps in "map" have an explicit representation
7100 * for all local variables?
7102 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7107 return isl_bool_error
;
7109 for (i
= 0; i
< map
->n
; ++i
) {
7110 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7115 return isl_bool_true
;
7118 /* If bmap contains any unknown divs, then compute explicit
7119 * expressions for them. However, this computation may be
7120 * quite expensive, so first try to remove divs that aren't
7123 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
7126 struct isl_map
*map
;
7128 known
= isl_basic_map_divs_known(bmap
);
7132 return isl_map_from_basic_map(bmap
);
7134 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7136 known
= isl_basic_map_divs_known(bmap
);
7140 return isl_map_from_basic_map(bmap
);
7142 map
= compute_divs(bmap
);
7145 isl_basic_map_free(bmap
);
7149 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
7153 struct isl_map
*res
;
7160 known
= isl_map_divs_known(map
);
7168 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7169 for (i
= 1 ; i
< map
->n
; ++i
) {
7171 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7172 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7173 res
= isl_map_union_disjoint(res
, r2
);
7175 res
= isl_map_union(res
, r2
);
7182 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7184 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7187 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7189 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7192 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7195 struct isl_set
*set
;
7200 map
= isl_map_cow(map
);
7204 set
= set_from_map(map
);
7205 set
->dim
= isl_space_domain(set
->dim
);
7208 for (i
= 0; i
< map
->n
; ++i
) {
7209 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7213 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7214 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7221 /* Return the union of "map1" and "map2", where we assume for now that
7222 * "map1" and "map2" are disjoint. Note that the basic maps inside
7223 * "map1" or "map2" may not be disjoint from each other.
7224 * Also note that this function is also called from isl_map_union,
7225 * which takes care of handling the situation where "map1" and "map2"
7226 * may not be disjoint.
7228 * If one of the inputs is empty, we can simply return the other input.
7229 * Similarly, if one of the inputs is universal, then it is equal to the union.
7231 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7232 __isl_take isl_map
*map2
)
7236 struct isl_map
*map
= NULL
;
7242 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7243 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7244 "spaces don't match", goto error
);
7255 is_universe
= isl_map_plain_is_universe(map1
);
7256 if (is_universe
< 0)
7263 is_universe
= isl_map_plain_is_universe(map2
);
7264 if (is_universe
< 0)
7271 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7272 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7273 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7275 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7276 map1
->n
+ map2
->n
, flags
);
7279 for (i
= 0; i
< map1
->n
; ++i
) {
7280 map
= isl_map_add_basic_map(map
,
7281 isl_basic_map_copy(map1
->p
[i
]));
7285 for (i
= 0; i
< map2
->n
; ++i
) {
7286 map
= isl_map_add_basic_map(map
,
7287 isl_basic_map_copy(map2
->p
[i
]));
7301 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7302 * guaranteed to be disjoint by the caller.
7304 * Note that this functions is called from within isl_map_make_disjoint,
7305 * so we have to be careful not to touch the constraints of the inputs
7308 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7309 __isl_take isl_map
*map2
)
7311 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7314 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7315 * not be disjoint. The parameters are assumed to have been aligned.
7317 * We currently simply call map_union_disjoint, the internal operation
7318 * of which does not really depend on the inputs being disjoint.
7319 * If the result contains more than one basic map, then we clear
7320 * the disjoint flag since the result may contain basic maps from
7321 * both inputs and these are not guaranteed to be disjoint.
7323 * As a special case, if "map1" and "map2" are obviously equal,
7324 * then we simply return "map1".
7326 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7327 __isl_take isl_map
*map2
)
7334 equal
= isl_map_plain_is_equal(map1
, map2
);
7342 map1
= map_union_disjoint(map1
, map2
);
7346 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7354 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7357 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7358 __isl_take isl_map
*map2
)
7360 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7363 struct isl_set
*isl_set_union_disjoint(
7364 struct isl_set
*set1
, struct isl_set
*set2
)
7366 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7370 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7372 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7375 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7378 * "map" and "set" are assumed to be compatible and non-NULL.
7380 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7381 __isl_take isl_set
*set
,
7382 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7383 __isl_take isl_basic_set
*bset
))
7386 struct isl_map
*result
;
7389 if (isl_set_plain_is_universe(set
)) {
7394 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7395 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7396 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7398 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7399 map
->n
* set
->n
, flags
);
7400 for (i
= 0; result
&& i
< map
->n
; ++i
)
7401 for (j
= 0; j
< set
->n
; ++j
) {
7402 result
= isl_map_add_basic_map(result
,
7403 fn(isl_basic_map_copy(map
->p
[i
]),
7404 isl_basic_set_copy(set
->p
[j
])));
7414 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7415 __isl_take isl_set
*set
)
7419 ok
= isl_map_compatible_range(map
, set
);
7423 isl_die(set
->ctx
, isl_error_invalid
,
7424 "incompatible spaces", goto error
);
7426 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7433 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7434 __isl_take isl_set
*set
)
7436 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7439 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7440 __isl_take isl_set
*set
)
7444 ok
= isl_map_compatible_domain(map
, set
);
7448 isl_die(set
->ctx
, isl_error_invalid
,
7449 "incompatible spaces", goto error
);
7451 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7458 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7459 __isl_take isl_set
*set
)
7461 return isl_map_align_params_map_map_and(map
, set
,
7462 &map_intersect_domain
);
7465 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7466 __isl_take isl_map
*map2
)
7470 map1
= isl_map_reverse(map1
);
7471 map1
= isl_map_apply_range(map1
, map2
);
7472 return isl_map_reverse(map1
);
7479 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7480 __isl_take isl_map
*map2
)
7482 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7485 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7486 __isl_take isl_map
*map2
)
7488 isl_space
*dim_result
;
7489 struct isl_map
*result
;
7495 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7496 isl_space_copy(map2
->dim
));
7498 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7501 for (i
= 0; i
< map1
->n
; ++i
)
7502 for (j
= 0; j
< map2
->n
; ++j
) {
7503 result
= isl_map_add_basic_map(result
,
7504 isl_basic_map_apply_range(
7505 isl_basic_map_copy(map1
->p
[i
]),
7506 isl_basic_map_copy(map2
->p
[j
])));
7512 if (result
&& result
->n
<= 1)
7513 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7521 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7522 __isl_take isl_map
*map2
)
7524 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7528 * returns range - domain
7530 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7532 isl_space
*target_space
;
7533 struct isl_basic_set
*bset
;
7540 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7541 bmap
->dim
, isl_dim_out
),
7543 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
7544 dim
= isl_basic_map_n_in(bmap
);
7545 nparam
= isl_basic_map_n_param(bmap
);
7546 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
7547 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
7548 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
7549 for (i
= 0; i
< dim
; ++i
) {
7550 int j
= isl_basic_map_alloc_equality(bmap
);
7552 bmap
= isl_basic_map_free(bmap
);
7555 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7556 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7557 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
7558 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7560 bset
= isl_basic_map_domain(bmap
);
7561 bset
= isl_basic_set_reset_space(bset
, target_space
);
7564 isl_basic_map_free(bmap
);
7569 * returns range - domain
7571 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7575 struct isl_set
*result
;
7580 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7581 map
->dim
, isl_dim_out
),
7583 dim
= isl_map_get_space(map
);
7584 dim
= isl_space_domain(dim
);
7585 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7588 for (i
= 0; i
< map
->n
; ++i
)
7589 result
= isl_set_add_basic_set(result
,
7590 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7599 * returns [domain -> range] -> range - domain
7601 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7602 __isl_take isl_basic_map
*bmap
)
7606 isl_basic_map
*domain
;
7610 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7611 bmap
->dim
, isl_dim_out
))
7612 isl_die(bmap
->ctx
, isl_error_invalid
,
7613 "domain and range don't match", goto error
);
7615 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7616 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7618 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7619 domain
= isl_basic_map_universe(dim
);
7621 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7622 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7623 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7625 total
= isl_basic_map_total_dim(bmap
);
7627 for (i
= 0; i
< n
; ++i
) {
7628 k
= isl_basic_map_alloc_equality(bmap
);
7631 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7632 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7633 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7634 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7637 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7638 return isl_basic_map_finalize(bmap
);
7640 isl_basic_map_free(bmap
);
7645 * returns [domain -> range] -> range - domain
7647 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7650 isl_space
*domain_dim
;
7655 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7656 map
->dim
, isl_dim_out
))
7657 isl_die(map
->ctx
, isl_error_invalid
,
7658 "domain and range don't match", goto error
);
7660 map
= isl_map_cow(map
);
7664 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7665 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7666 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7669 for (i
= 0; i
< map
->n
; ++i
) {
7670 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7674 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7681 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7683 struct isl_basic_map
*bmap
;
7691 nparam
= dims
->nparam
;
7693 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7697 for (i
= 0; i
< dim
; ++i
) {
7698 int j
= isl_basic_map_alloc_equality(bmap
);
7701 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7702 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7703 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7705 return isl_basic_map_finalize(bmap
);
7707 isl_basic_map_free(bmap
);
7711 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7715 if (dim
->n_in
!= dim
->n_out
)
7716 isl_die(dim
->ctx
, isl_error_invalid
,
7717 "number of input and output dimensions needs to be "
7718 "the same", goto error
);
7719 return basic_map_identity(dim
);
7721 isl_space_free(dim
);
7725 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7727 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7730 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7732 isl_space
*dim
= isl_set_get_space(set
);
7734 id
= isl_map_identity(isl_space_map_from_set(dim
));
7735 return isl_map_intersect_range(id
, set
);
7738 /* Construct a basic set with all set dimensions having only non-negative
7741 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7742 __isl_take isl_space
*space
)
7747 struct isl_basic_set
*bset
;
7751 nparam
= space
->nparam
;
7753 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7756 for (i
= 0; i
< dim
; ++i
) {
7757 int k
= isl_basic_set_alloc_inequality(bset
);
7760 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7761 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7765 isl_basic_set_free(bset
);
7769 /* Construct the half-space x_pos >= 0.
7771 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7775 isl_basic_set
*nonneg
;
7777 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7778 k
= isl_basic_set_alloc_inequality(nonneg
);
7781 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7782 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7784 return isl_basic_set_finalize(nonneg
);
7786 isl_basic_set_free(nonneg
);
7790 /* Construct the half-space x_pos <= -1.
7792 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7797 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7798 k
= isl_basic_set_alloc_inequality(neg
);
7801 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7802 isl_int_set_si(neg
->ineq
[k
][0], -1);
7803 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7805 return isl_basic_set_finalize(neg
);
7807 isl_basic_set_free(neg
);
7811 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7812 enum isl_dim_type type
, unsigned first
, unsigned n
)
7816 isl_basic_set
*nonneg
;
7824 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7826 offset
= pos(set
->dim
, type
);
7827 for (i
= 0; i
< n
; ++i
) {
7828 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7829 offset
+ first
+ i
);
7830 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
7832 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7841 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7843 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7849 return isl_stat_error
;
7850 if (isl_set_plain_is_empty(set
)) {
7855 return fn(set
, signs
, user
);
7858 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7860 half
= isl_set_intersect(half
, isl_set_copy(set
));
7861 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7865 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7867 half
= isl_set_intersect(half
, set
);
7868 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7871 return isl_stat_error
;
7874 /* Call "fn" on the intersections of "set" with each of the orthants
7875 * (except for obviously empty intersections). The orthant is identified
7876 * by the signs array, with each entry having value 1 or -1 according
7877 * to the sign of the corresponding variable.
7879 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7880 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7889 return isl_stat_error
;
7890 if (isl_set_plain_is_empty(set
))
7893 nparam
= isl_set_dim(set
, isl_dim_param
);
7894 nvar
= isl_set_dim(set
, isl_dim_set
);
7896 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7898 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7906 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7908 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
7911 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
7912 __isl_keep isl_basic_map
*bmap2
)
7915 struct isl_map
*map1
;
7916 struct isl_map
*map2
;
7918 if (!bmap1
|| !bmap2
)
7919 return isl_bool_error
;
7921 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7922 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7924 is_subset
= isl_map_is_subset(map1
, map2
);
7932 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7933 __isl_keep isl_basic_set
*bset2
)
7935 return isl_basic_map_is_subset(bset1
, bset2
);
7938 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
7939 __isl_keep isl_basic_map
*bmap2
)
7943 if (!bmap1
|| !bmap2
)
7944 return isl_bool_error
;
7945 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7946 if (is_subset
!= isl_bool_true
)
7948 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7952 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
7953 __isl_keep isl_basic_set
*bset2
)
7955 return isl_basic_map_is_equal(
7956 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
7959 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
7965 return isl_bool_error
;
7966 for (i
= 0; i
< map
->n
; ++i
) {
7967 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7969 return isl_bool_error
;
7971 return isl_bool_false
;
7973 return isl_bool_true
;
7976 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7978 return map
? map
->n
== 0 : isl_bool_error
;
7981 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
7983 return set
? set
->n
== 0 : isl_bool_error
;
7986 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
7988 return isl_map_is_empty(set_to_map(set
));
7991 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
7992 __isl_keep isl_map
*map2
)
7995 return isl_bool_error
;
7997 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8000 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8001 __isl_keep isl_set
*set2
)
8004 return isl_bool_error
;
8006 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8009 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8014 return isl_bool_error
;
8015 is_subset
= isl_map_is_subset(map1
, map2
);
8016 if (is_subset
!= isl_bool_true
)
8018 is_subset
= isl_map_is_subset(map2
, map1
);
8022 /* Is "map1" equal to "map2"?
8024 * First check if they are obviously equal.
8025 * If not, then perform a more detailed analysis.
8027 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8031 equal
= isl_map_plain_is_equal(map1
, map2
);
8032 if (equal
< 0 || equal
)
8034 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8037 isl_bool
isl_basic_map_is_strict_subset(
8038 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8042 if (!bmap1
|| !bmap2
)
8043 return isl_bool_error
;
8044 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8045 if (is_subset
!= isl_bool_true
)
8047 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8048 if (is_subset
== isl_bool_error
)
8053 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8054 __isl_keep isl_map
*map2
)
8059 return isl_bool_error
;
8060 is_subset
= isl_map_is_subset(map1
, map2
);
8061 if (is_subset
!= isl_bool_true
)
8063 is_subset
= isl_map_is_subset(map2
, map1
);
8064 if (is_subset
== isl_bool_error
)
8069 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8070 __isl_keep isl_set
*set2
)
8072 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8075 /* Is "bmap" obviously equal to the universe with the same space?
8077 * That is, does it not have any constraints?
8079 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8082 return isl_bool_error
;
8083 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8086 /* Is "bset" obviously equal to the universe with the same space?
8088 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8090 return isl_basic_map_plain_is_universe(bset
);
8093 /* If "c" does not involve any existentially quantified variables,
8094 * then set *univ to false and abort
8096 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8098 isl_bool
*univ
= user
;
8101 n
= isl_constraint_dim(c
, isl_dim_div
);
8102 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8103 isl_constraint_free(c
);
8104 if (*univ
< 0 || !*univ
)
8105 return isl_stat_error
;
8109 /* Is "bmap" equal to the universe with the same space?
8111 * First check if it is obviously equal to the universe.
8112 * If not and if there are any constraints not involving
8113 * existentially quantified variables, then it is certainly
8114 * not equal to the universe.
8115 * Otherwise, check if the universe is a subset of "bmap".
8117 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8120 isl_basic_map
*test
;
8122 univ
= isl_basic_map_plain_is_universe(bmap
);
8123 if (univ
< 0 || univ
)
8125 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8126 return isl_bool_false
;
8127 univ
= isl_bool_true
;
8128 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8130 return isl_bool_error
;
8131 if (univ
< 0 || !univ
)
8133 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8134 univ
= isl_basic_map_is_subset(test
, bmap
);
8135 isl_basic_map_free(test
);
8139 /* Is "bset" equal to the universe with the same space?
8141 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8143 return isl_basic_map_is_universe(bset
);
8146 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8151 return isl_bool_error
;
8153 for (i
= 0; i
< map
->n
; ++i
) {
8154 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8159 return isl_bool_false
;
8162 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8164 return isl_map_plain_is_universe(set_to_map(set
));
8167 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8169 struct isl_basic_set
*bset
= NULL
;
8170 struct isl_vec
*sample
= NULL
;
8171 isl_bool empty
, non_empty
;
8174 return isl_bool_error
;
8176 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8177 return isl_bool_true
;
8179 if (isl_basic_map_plain_is_universe(bmap
))
8180 return isl_bool_false
;
8182 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8183 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8184 copy
= isl_basic_map_remove_redundancies(copy
);
8185 empty
= isl_basic_map_plain_is_empty(copy
);
8186 isl_basic_map_free(copy
);
8190 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8192 return isl_bool_error
;
8194 return isl_bool_false
;
8195 isl_vec_free(bmap
->sample
);
8196 bmap
->sample
= NULL
;
8197 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8199 return isl_bool_error
;
8200 sample
= isl_basic_set_sample_vec(bset
);
8202 return isl_bool_error
;
8203 empty
= sample
->size
== 0;
8204 isl_vec_free(bmap
->sample
);
8205 bmap
->sample
= sample
;
8207 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8212 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8215 return isl_bool_error
;
8216 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8219 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8222 return isl_bool_error
;
8223 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8226 /* Is "bmap" known to be non-empty?
8228 * That is, is the cached sample still valid?
8230 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8235 return isl_bool_error
;
8237 return isl_bool_false
;
8238 total
= 1 + isl_basic_map_total_dim(bmap
);
8239 if (bmap
->sample
->size
!= total
)
8240 return isl_bool_false
;
8241 return isl_basic_map_contains(bmap
, bmap
->sample
);
8244 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8246 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8249 struct isl_map
*isl_basic_map_union(
8250 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8252 struct isl_map
*map
;
8253 if (!bmap1
|| !bmap2
)
8256 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8258 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8261 map
= isl_map_add_basic_map(map
, bmap1
);
8262 map
= isl_map_add_basic_map(map
, bmap2
);
8265 isl_basic_map_free(bmap1
);
8266 isl_basic_map_free(bmap2
);
8270 struct isl_set
*isl_basic_set_union(
8271 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8273 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8274 bset_to_bmap(bset2
)));
8277 /* Order divs such that any div only depends on previous divs */
8278 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
8286 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8288 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8290 if (isl_int_is_zero(bmap
->div
[i
][0]))
8292 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8297 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8298 "integer division depends on itself",
8299 return isl_basic_map_free(bmap
));
8300 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8306 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8308 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8311 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8318 for (i
= 0; i
< map
->n
; ++i
) {
8319 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8330 /* Sort the local variables of "bset".
8332 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8333 __isl_take isl_basic_set
*bset
)
8335 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8338 /* Apply the expansion computed by isl_merge_divs.
8339 * The expansion itself is given by "exp" while the resulting
8340 * list of divs is given by "div".
8342 * Move the integer divisions of "bmap" into the right position
8343 * according to "exp" and then introduce the additional integer
8344 * divisions, adding div constraints.
8345 * The moving should be done first to avoid moving coefficients
8346 * in the definitions of the extra integer divisions.
8348 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8349 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8354 bmap
= isl_basic_map_cow(bmap
);
8358 if (div
->n_row
< bmap
->n_div
)
8359 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8360 "not an expansion", goto error
);
8362 n_div
= bmap
->n_div
;
8363 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8364 div
->n_row
- n_div
, 0,
8365 2 * (div
->n_row
- n_div
));
8367 for (i
= n_div
; i
< div
->n_row
; ++i
)
8368 if (isl_basic_map_alloc_div(bmap
) < 0)
8371 for (j
= n_div
- 1; j
>= 0; --j
) {
8374 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8377 for (i
= 0; i
< div
->n_row
; ++i
) {
8378 if (j
< n_div
&& exp
[j
] == i
) {
8381 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8382 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8384 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8392 isl_basic_map_free(bmap
);
8397 /* Apply the expansion computed by isl_merge_divs.
8398 * The expansion itself is given by "exp" while the resulting
8399 * list of divs is given by "div".
8401 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8402 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8404 return isl_basic_map_expand_divs(bset
, div
, exp
);
8407 /* Look for a div in dst that corresponds to the div "div" in src.
8408 * The divs before "div" in src and dst are assumed to be the same.
8410 * Returns -1 if no corresponding div was found and the position
8411 * of the corresponding div in dst otherwise.
8413 static int find_div(struct isl_basic_map
*dst
,
8414 struct isl_basic_map
*src
, unsigned div
)
8418 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8420 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8421 for (i
= div
; i
< dst
->n_div
; ++i
)
8422 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8423 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8424 dst
->n_div
- div
) == -1)
8429 /* Align the divs of "dst" to those of "src", adding divs from "src"
8430 * if needed. That is, make sure that the first src->n_div divs
8431 * of the result are equal to those of src.
8433 * The result is not finalized as by design it will have redundant
8434 * divs if any divs from "src" were copied.
8436 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8437 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8440 int known
, extended
;
8444 return isl_basic_map_free(dst
);
8446 if (src
->n_div
== 0)
8449 known
= isl_basic_map_divs_known(src
);
8451 return isl_basic_map_free(dst
);
8453 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8454 "some src divs are unknown",
8455 return isl_basic_map_free(dst
));
8457 src
= isl_basic_map_order_divs(src
);
8460 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8461 for (i
= 0; i
< src
->n_div
; ++i
) {
8462 int j
= find_div(dst
, src
, i
);
8465 int extra
= src
->n_div
- i
;
8466 dst
= isl_basic_map_cow(dst
);
8469 dst
= isl_basic_map_extend_space(dst
,
8470 isl_space_copy(dst
->dim
),
8471 extra
, 0, 2 * extra
);
8474 j
= isl_basic_map_alloc_div(dst
);
8476 return isl_basic_map_free(dst
);
8477 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8478 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8479 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8480 return isl_basic_map_free(dst
);
8483 isl_basic_map_swap_div(dst
, i
, j
);
8488 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8496 map
= isl_map_compute_divs(map
);
8497 map
= isl_map_cow(map
);
8501 for (i
= 1; i
< map
->n
; ++i
)
8502 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8503 for (i
= 1; i
< map
->n
; ++i
) {
8504 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8506 return isl_map_free(map
);
8509 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8513 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8515 return set_from_map(isl_map_align_divs(set_to_map(set
)));
8518 /* Align the divs of the basic maps in "map" to those
8519 * of the basic maps in "list", as well as to the other basic maps in "map".
8520 * The elements in "list" are assumed to have known divs.
8522 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8523 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8527 map
= isl_map_compute_divs(map
);
8528 map
= isl_map_cow(map
);
8530 return isl_map_free(map
);
8534 n
= isl_basic_map_list_n_basic_map(list
);
8535 for (i
= 0; i
< n
; ++i
) {
8536 isl_basic_map
*bmap
;
8538 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8539 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8540 isl_basic_map_free(bmap
);
8543 return isl_map_free(map
);
8545 return isl_map_align_divs(map
);
8548 /* Align the divs of each element of "list" to those of "bmap".
8549 * Both "bmap" and the elements of "list" are assumed to have known divs.
8551 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
8552 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
8557 return isl_basic_map_list_free(list
);
8559 n
= isl_basic_map_list_n_basic_map(list
);
8560 for (i
= 0; i
< n
; ++i
) {
8561 isl_basic_map
*bmap_i
;
8563 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
8564 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
8565 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
8571 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8572 __isl_take isl_map
*map
)
8576 ok
= isl_map_compatible_domain(map
, set
);
8580 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
8581 "incompatible spaces", goto error
);
8582 map
= isl_map_intersect_domain(map
, set
);
8583 set
= isl_map_range(map
);
8591 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8592 __isl_take isl_map
*map
)
8594 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8597 /* There is no need to cow as removing empty parts doesn't change
8598 * the meaning of the set.
8600 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8607 for (i
= map
->n
- 1; i
>= 0; --i
)
8608 remove_if_empty(map
, i
);
8613 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8615 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
8618 /* Given two basic sets bset1 and bset2, compute the maximal difference
8619 * between the values of dimension pos in bset1 and those in bset2
8620 * for any common value of the parameters and dimensions preceding pos.
8622 static enum isl_lp_result
basic_set_maximal_difference_at(
8623 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8624 int pos
, isl_int
*opt
)
8626 isl_basic_map
*bmap1
;
8627 isl_basic_map
*bmap2
;
8628 struct isl_ctx
*ctx
;
8629 struct isl_vec
*obj
;
8633 enum isl_lp_result res
;
8635 if (!bset1
|| !bset2
)
8636 return isl_lp_error
;
8638 nparam
= isl_basic_set_n_param(bset1
);
8639 dim1
= isl_basic_set_n_dim(bset1
);
8641 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
8642 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
8643 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
8644 isl_dim_out
, 0, pos
);
8645 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
8646 isl_dim_out
, 0, pos
);
8647 bmap1
= isl_basic_map_range_product(bmap1
, bmap2
);
8649 return isl_lp_error
;
8651 total
= isl_basic_map_total_dim(bmap1
);
8653 obj
= isl_vec_alloc(ctx
, 1 + total
);
8656 isl_seq_clr(obj
->block
.data
, 1 + total
);
8657 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8658 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8659 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8661 isl_basic_map_free(bmap1
);
8665 isl_basic_map_free(bmap1
);
8666 return isl_lp_error
;
8669 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8670 * for any common value of the parameters and dimensions preceding pos
8671 * in both basic sets, the values of dimension pos in bset1 are
8672 * smaller or larger than those in bset2.
8675 * 1 if bset1 follows bset2
8676 * -1 if bset1 precedes bset2
8677 * 0 if bset1 and bset2 are incomparable
8678 * -2 if some error occurred.
8680 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8681 struct isl_basic_set
*bset2
, int pos
)
8684 enum isl_lp_result res
;
8689 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8691 if (res
== isl_lp_empty
)
8693 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8694 res
== isl_lp_unbounded
)
8696 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8705 /* Given two basic sets bset1 and bset2, check whether
8706 * for any common value of the parameters and dimensions preceding pos
8707 * there is a value of dimension pos in bset1 that is larger
8708 * than a value of the same dimension in bset2.
8711 * 1 if there exists such a pair
8712 * 0 if there is no such pair, but there is a pair of equal values
8714 * -2 if some error occurred.
8716 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8717 __isl_keep isl_basic_set
*bset2
, int pos
)
8720 enum isl_lp_result res
;
8725 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8727 if (res
== isl_lp_empty
)
8729 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8730 res
== isl_lp_unbounded
)
8732 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8734 else if (res
== isl_lp_ok
)
8743 /* Given two sets set1 and set2, check whether
8744 * for any common value of the parameters and dimensions preceding pos
8745 * there is a value of dimension pos in set1 that is larger
8746 * than a value of the same dimension in set2.
8749 * 1 if there exists such a pair
8750 * 0 if there is no such pair, but there is a pair of equal values
8752 * -2 if some error occurred.
8754 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8755 __isl_keep isl_set
*set2
, int pos
)
8763 for (i
= 0; i
< set1
->n
; ++i
)
8764 for (j
= 0; j
< set2
->n
; ++j
) {
8766 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8767 if (f
== 1 || f
== -2)
8776 static isl_bool
isl_basic_map_plain_has_fixed_var(
8777 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
8784 return isl_bool_error
;
8785 total
= isl_basic_map_total_dim(bmap
);
8786 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8787 for (; d
+1 > pos
; --d
)
8788 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8792 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8793 return isl_bool_false
;
8794 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8795 return isl_bool_false
;
8796 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8797 return isl_bool_false
;
8799 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8800 return isl_bool_true
;
8802 return isl_bool_false
;
8805 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8806 unsigned pos
, isl_int
*val
)
8814 return isl_bool_error
;
8816 return isl_bool_false
;
8818 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8821 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8822 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
8823 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8824 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
8825 fixed
= isl_bool_false
;
8828 isl_int_set(*val
, v
);
8834 static isl_bool
isl_basic_set_plain_has_fixed_var(
8835 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
8837 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
8841 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8842 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8844 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
8845 return isl_bool_error
;
8846 return isl_basic_map_plain_has_fixed_var(bmap
,
8847 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8850 /* If "bmap" obviously lies on a hyperplane where the given dimension
8851 * has a fixed value, then return that value.
8852 * Otherwise return NaN.
8854 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8855 __isl_keep isl_basic_map
*bmap
,
8856 enum isl_dim_type type
, unsigned pos
)
8864 ctx
= isl_basic_map_get_ctx(bmap
);
8865 v
= isl_val_alloc(ctx
);
8868 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8870 return isl_val_free(v
);
8872 isl_int_set_si(v
->d
, 1);
8876 return isl_val_nan(ctx
);
8879 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8880 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8882 if (pos
>= isl_map_dim(map
, type
))
8883 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
8884 "position out of bounds", return isl_bool_error
);
8885 return isl_map_plain_has_fixed_var(map
,
8886 map_offset(map
, type
) - 1 + pos
, val
);
8889 /* If "map" obviously lies on a hyperplane where the given dimension
8890 * has a fixed value, then return that value.
8891 * Otherwise return NaN.
8893 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8894 enum isl_dim_type type
, unsigned pos
)
8902 ctx
= isl_map_get_ctx(map
);
8903 v
= isl_val_alloc(ctx
);
8906 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8908 return isl_val_free(v
);
8910 isl_int_set_si(v
->d
, 1);
8914 return isl_val_nan(ctx
);
8917 /* If "set" obviously lies on a hyperplane where the given dimension
8918 * has a fixed value, then return that value.
8919 * Otherwise return NaN.
8921 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8922 enum isl_dim_type type
, unsigned pos
)
8924 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8927 isl_bool
isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8928 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8930 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8933 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8934 * then return this fixed value in *val.
8936 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8937 unsigned dim
, isl_int
*val
)
8939 return isl_basic_set_plain_has_fixed_var(bset
,
8940 isl_basic_set_n_param(bset
) + dim
, val
);
8943 /* Return -1 if the constraint "c1" should be sorted before "c2"
8944 * and 1 if it should be sorted after "c2".
8945 * Return 0 if the two constraints are the same (up to the constant term).
8947 * In particular, if a constraint involves later variables than another
8948 * then it is sorted after this other constraint.
8949 * uset_gist depends on constraints without existentially quantified
8950 * variables sorting first.
8952 * For constraints that have the same latest variable, those
8953 * with the same coefficient for this latest variable (first in absolute value
8954 * and then in actual value) are grouped together.
8955 * This is useful for detecting pairs of constraints that can
8956 * be chained in their printed representation.
8958 * Finally, within a group, constraints are sorted according to
8959 * their coefficients (excluding the constant term).
8961 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
8963 isl_int
**c1
= (isl_int
**) p1
;
8964 isl_int
**c2
= (isl_int
**) p2
;
8966 unsigned size
= *(unsigned *) arg
;
8969 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
8970 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
8975 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
8978 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
8982 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
8985 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
8986 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
8987 * and 0 if the two constraints are the same (up to the constant term).
8989 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
8990 isl_int
*c1
, isl_int
*c2
)
8996 total
= isl_basic_map_total_dim(bmap
);
8997 return sort_constraint_cmp(&c1
, &c2
, &total
);
9000 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9001 __isl_take isl_basic_map
*bmap
)
9007 if (bmap
->n_ineq
== 0)
9009 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9011 total
= isl_basic_map_total_dim(bmap
);
9012 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9013 &sort_constraint_cmp
, &total
) < 0)
9014 return isl_basic_map_free(bmap
);
9018 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9019 __isl_take isl_basic_set
*bset
)
9021 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9022 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9025 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
9029 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9031 bmap
= isl_basic_map_remove_redundancies(bmap
);
9032 bmap
= isl_basic_map_sort_constraints(bmap
);
9034 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9037 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9038 __isl_keep isl_basic_map
*bmap2
)
9042 isl_space
*space1
, *space2
;
9044 if (!bmap1
|| !bmap2
)
9049 space1
= isl_basic_map_peek_space(bmap1
);
9050 space2
= isl_basic_map_peek_space(bmap2
);
9051 cmp
= isl_space_cmp(space1
, space2
);
9054 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9055 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9056 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9057 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9058 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9060 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9062 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9064 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9065 return bmap1
->n_eq
- bmap2
->n_eq
;
9066 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9067 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9068 if (bmap1
->n_div
!= bmap2
->n_div
)
9069 return bmap1
->n_div
- bmap2
->n_div
;
9070 total
= isl_basic_map_total_dim(bmap1
);
9071 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9072 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9076 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9077 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9081 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9082 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9089 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9090 __isl_keep isl_basic_set
*bset2
)
9092 return isl_basic_map_plain_cmp(bset1
, bset2
);
9095 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9101 if (set1
->n
!= set2
->n
)
9102 return set1
->n
- set2
->n
;
9104 for (i
= 0; i
< set1
->n
; ++i
) {
9105 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9113 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9114 __isl_keep isl_basic_map
*bmap2
)
9116 if (!bmap1
|| !bmap2
)
9117 return isl_bool_error
;
9118 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9121 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9122 __isl_keep isl_basic_set
*bset2
)
9124 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9125 bset_to_bmap(bset2
));
9128 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9130 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9131 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9133 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9136 /* Sort the basic maps of "map" and remove duplicate basic maps.
9138 * While removing basic maps, we make sure that the basic maps remain
9139 * sorted because isl_map_normalize expects the basic maps of the result
9142 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9146 map
= isl_map_remove_empty_parts(map
);
9149 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9150 for (i
= map
->n
- 1; i
>= 1; --i
) {
9151 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9153 isl_basic_map_free(map
->p
[i
-1]);
9154 for (j
= i
; j
< map
->n
; ++j
)
9155 map
->p
[j
- 1] = map
->p
[j
];
9162 /* Remove obvious duplicates among the basic maps of "map".
9164 * Unlike isl_map_normalize, this function does not remove redundant
9165 * constraints and only removes duplicates that have exactly the same
9166 * constraints in the input. It does sort the constraints and
9167 * the basic maps to ease the detection of duplicates.
9169 * If "map" has already been normalized or if the basic maps are
9170 * disjoint, then there can be no duplicates.
9172 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9175 isl_basic_map
*bmap
;
9181 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9183 for (i
= 0; i
< map
->n
; ++i
) {
9184 bmap
= isl_basic_map_copy(map
->p
[i
]);
9185 bmap
= isl_basic_map_sort_constraints(bmap
);
9187 return isl_map_free(map
);
9188 isl_basic_map_free(map
->p
[i
]);
9192 map
= sort_and_remove_duplicates(map
);
9196 /* We normalize in place, but if anything goes wrong we need
9197 * to return NULL, so we need to make sure we don't change the
9198 * meaning of any possible other copies of map.
9200 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9203 struct isl_basic_map
*bmap
;
9207 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9209 for (i
= 0; i
< map
->n
; ++i
) {
9210 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9213 isl_basic_map_free(map
->p
[i
]);
9217 map
= sort_and_remove_duplicates(map
);
9219 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9226 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9228 return set_from_map(isl_map_normalize(set_to_map(set
)));
9231 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9232 __isl_keep isl_map
*map2
)
9238 return isl_bool_error
;
9241 return isl_bool_true
;
9242 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9243 return isl_bool_false
;
9245 map1
= isl_map_copy(map1
);
9246 map2
= isl_map_copy(map2
);
9247 map1
= isl_map_normalize(map1
);
9248 map2
= isl_map_normalize(map2
);
9251 equal
= map1
->n
== map2
->n
;
9252 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9253 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9263 return isl_bool_error
;
9266 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9267 __isl_keep isl_set
*set2
)
9269 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9272 /* Return the basic maps in "map" as a list.
9274 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9275 __isl_keep isl_map
*map
)
9279 isl_basic_map_list
*list
;
9283 ctx
= isl_map_get_ctx(map
);
9284 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9286 for (i
= 0; i
< map
->n
; ++i
) {
9287 isl_basic_map
*bmap
;
9289 bmap
= isl_basic_map_copy(map
->p
[i
]);
9290 list
= isl_basic_map_list_add(list
, bmap
);
9296 /* Return the intersection of the elements in the non-empty list "list".
9297 * All elements are assumed to live in the same space.
9299 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9300 __isl_take isl_basic_map_list
*list
)
9303 isl_basic_map
*bmap
;
9307 n
= isl_basic_map_list_n_basic_map(list
);
9309 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9310 "expecting non-empty list", goto error
);
9312 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9313 for (i
= 1; i
< n
; ++i
) {
9314 isl_basic_map
*bmap_i
;
9316 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9317 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9320 isl_basic_map_list_free(list
);
9323 isl_basic_map_list_free(list
);
9327 /* Return the intersection of the elements in the non-empty list "list".
9328 * All elements are assumed to live in the same space.
9330 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9331 __isl_take isl_basic_set_list
*list
)
9333 return isl_basic_map_list_intersect(list
);
9336 /* Return the union of the elements of "list".
9337 * The list is required to have at least one element.
9339 __isl_give isl_set
*isl_basic_set_list_union(
9340 __isl_take isl_basic_set_list
*list
)
9344 isl_basic_set
*bset
;
9349 n
= isl_basic_set_list_n_basic_set(list
);
9351 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9352 "expecting non-empty list", goto error
);
9354 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9355 space
= isl_basic_set_get_space(bset
);
9356 isl_basic_set_free(bset
);
9358 set
= isl_set_alloc_space(space
, n
, 0);
9359 for (i
= 0; i
< n
; ++i
) {
9360 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9361 set
= isl_set_add_basic_set(set
, bset
);
9364 isl_basic_set_list_free(list
);
9367 isl_basic_set_list_free(list
);
9371 /* Return the union of the elements in the non-empty list "list".
9372 * All elements are assumed to live in the same space.
9374 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9381 n
= isl_set_list_n_set(list
);
9383 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9384 "expecting non-empty list", goto error
);
9386 set
= isl_set_list_get_set(list
, 0);
9387 for (i
= 1; i
< n
; ++i
) {
9390 set_i
= isl_set_list_get_set(list
, i
);
9391 set
= isl_set_union(set
, set_i
);
9394 isl_set_list_free(list
);
9397 isl_set_list_free(list
);
9401 struct isl_basic_map
*isl_basic_map_product(
9402 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9404 isl_space
*dim_result
= NULL
;
9405 struct isl_basic_map
*bmap
;
9406 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9407 struct isl_dim_map
*dim_map1
, *dim_map2
;
9409 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9411 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9412 isl_space_copy(bmap2
->dim
));
9414 in1
= isl_basic_map_n_in(bmap1
);
9415 in2
= isl_basic_map_n_in(bmap2
);
9416 out1
= isl_basic_map_n_out(bmap1
);
9417 out2
= isl_basic_map_n_out(bmap2
);
9418 nparam
= isl_basic_map_n_param(bmap1
);
9420 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9421 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9422 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9423 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9424 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9425 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9426 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9427 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9428 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9429 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9430 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9432 bmap
= isl_basic_map_alloc_space(dim_result
,
9433 bmap1
->n_div
+ bmap2
->n_div
,
9434 bmap1
->n_eq
+ bmap2
->n_eq
,
9435 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9436 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9437 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9438 bmap
= isl_basic_map_simplify(bmap
);
9439 return isl_basic_map_finalize(bmap
);
9441 isl_basic_map_free(bmap1
);
9442 isl_basic_map_free(bmap2
);
9446 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9447 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9449 isl_basic_map
*prod
;
9451 prod
= isl_basic_map_product(bmap1
, bmap2
);
9452 prod
= isl_basic_map_flatten(prod
);
9456 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9457 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9459 return isl_basic_map_flat_range_product(bset1
, bset2
);
9462 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9463 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9465 isl_space
*space_result
= NULL
;
9466 isl_basic_map
*bmap
;
9467 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9468 struct isl_dim_map
*dim_map1
, *dim_map2
;
9470 if (!bmap1
|| !bmap2
)
9473 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9474 isl_space_copy(bmap2
->dim
));
9476 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9477 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9478 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9479 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9481 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9482 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9483 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9484 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9485 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9486 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9487 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9488 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9489 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9490 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9491 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9493 bmap
= isl_basic_map_alloc_space(space_result
,
9494 bmap1
->n_div
+ bmap2
->n_div
,
9495 bmap1
->n_eq
+ bmap2
->n_eq
,
9496 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9497 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9498 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9499 bmap
= isl_basic_map_simplify(bmap
);
9500 return isl_basic_map_finalize(bmap
);
9502 isl_basic_map_free(bmap1
);
9503 isl_basic_map_free(bmap2
);
9507 __isl_give isl_basic_map
*isl_basic_map_range_product(
9508 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9511 isl_space
*dim_result
= NULL
;
9512 isl_basic_map
*bmap
;
9513 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9514 struct isl_dim_map
*dim_map1
, *dim_map2
;
9516 rational
= isl_basic_map_is_rational(bmap1
);
9517 if (rational
>= 0 && rational
)
9518 rational
= isl_basic_map_is_rational(bmap2
);
9519 if (!bmap1
|| !bmap2
|| rational
< 0)
9522 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9525 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9526 isl_space_copy(bmap2
->dim
));
9528 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9529 out1
= isl_basic_map_n_out(bmap1
);
9530 out2
= isl_basic_map_n_out(bmap2
);
9531 nparam
= isl_basic_map_n_param(bmap1
);
9533 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9534 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9535 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9536 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9537 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9538 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9539 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9540 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9541 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9542 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9543 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9545 bmap
= isl_basic_map_alloc_space(dim_result
,
9546 bmap1
->n_div
+ bmap2
->n_div
,
9547 bmap1
->n_eq
+ bmap2
->n_eq
,
9548 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9549 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9550 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9552 bmap
= isl_basic_map_set_rational(bmap
);
9553 bmap
= isl_basic_map_simplify(bmap
);
9554 return isl_basic_map_finalize(bmap
);
9556 isl_basic_map_free(bmap1
);
9557 isl_basic_map_free(bmap2
);
9561 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9562 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9564 isl_basic_map
*prod
;
9566 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9567 prod
= isl_basic_map_flatten_range(prod
);
9571 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
9572 * and collect the results.
9573 * The result live in the space obtained by calling "space_product"
9574 * on the spaces of "map1" and "map2".
9575 * If "remove_duplicates" is set then the result may contain duplicates
9576 * (even if the inputs do not) and so we try and remove the obvious
9579 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9580 __isl_take isl_map
*map2
,
9581 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
9582 __isl_take isl_space
*right
),
9583 __isl_give isl_basic_map
*(*basic_map_product
)(
9584 __isl_take isl_basic_map
*left
,
9585 __isl_take isl_basic_map
*right
),
9586 int remove_duplicates
)
9589 struct isl_map
*result
;
9593 m
= isl_map_has_equal_params(map1
, map2
);
9597 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
9598 "parameters don't match", goto error
);
9600 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9601 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9602 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9604 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
9605 isl_space_copy(map2
->dim
)),
9606 map1
->n
* map2
->n
, flags
);
9609 for (i
= 0; i
< map1
->n
; ++i
)
9610 for (j
= 0; j
< map2
->n
; ++j
) {
9611 struct isl_basic_map
*part
;
9612 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9613 isl_basic_map_copy(map2
->p
[j
]));
9614 if (isl_basic_map_is_empty(part
))
9615 isl_basic_map_free(part
);
9617 result
= isl_map_add_basic_map(result
, part
);
9621 if (remove_duplicates
)
9622 result
= isl_map_remove_obvious_duplicates(result
);
9632 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9634 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9635 __isl_take isl_map
*map2
)
9637 return map_product(map1
, map2
, &isl_space_product
,
9638 &isl_basic_map_product
, 0);
9641 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9642 __isl_take isl_map
*map2
)
9644 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9647 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9649 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9650 __isl_take isl_map
*map2
)
9654 prod
= isl_map_product(map1
, map2
);
9655 prod
= isl_map_flatten(prod
);
9659 /* Given two set A and B, construct its Cartesian product A x B.
9661 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9663 return isl_map_range_product(set1
, set2
);
9666 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9667 __isl_take isl_set
*set2
)
9669 return isl_map_flat_range_product(set1
, set2
);
9672 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9674 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9675 __isl_take isl_map
*map2
)
9677 return map_product(map1
, map2
, &isl_space_domain_product
,
9678 &isl_basic_map_domain_product
, 1);
9681 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9683 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9684 __isl_take isl_map
*map2
)
9686 return map_product(map1
, map2
, &isl_space_range_product
,
9687 &isl_basic_map_range_product
, 1);
9690 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9691 __isl_take isl_map
*map2
)
9693 return isl_map_align_params_map_map_and(map1
, map2
,
9694 &map_domain_product_aligned
);
9697 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9698 __isl_take isl_map
*map2
)
9700 return isl_map_align_params_map_map_and(map1
, map2
,
9701 &map_range_product_aligned
);
9704 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
9706 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
9709 int total1
, keep1
, total2
, keep2
;
9713 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9714 !isl_space_range_is_wrapping(map
->dim
))
9715 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9716 "not a product", return isl_map_free(map
));
9718 space
= isl_map_get_space(map
);
9719 total1
= isl_space_dim(space
, isl_dim_in
);
9720 total2
= isl_space_dim(space
, isl_dim_out
);
9721 space
= isl_space_factor_domain(space
);
9722 keep1
= isl_space_dim(space
, isl_dim_in
);
9723 keep2
= isl_space_dim(space
, isl_dim_out
);
9724 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
9725 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
9726 map
= isl_map_reset_space(map
, space
);
9731 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
9733 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
9736 int total1
, keep1
, total2
, keep2
;
9740 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9741 !isl_space_range_is_wrapping(map
->dim
))
9742 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9743 "not a product", return isl_map_free(map
));
9745 space
= isl_map_get_space(map
);
9746 total1
= isl_space_dim(space
, isl_dim_in
);
9747 total2
= isl_space_dim(space
, isl_dim_out
);
9748 space
= isl_space_factor_range(space
);
9749 keep1
= isl_space_dim(space
, isl_dim_in
);
9750 keep2
= isl_space_dim(space
, isl_dim_out
);
9751 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
9752 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
9753 map
= isl_map_reset_space(map
, space
);
9758 /* Given a map of the form [A -> B] -> C, return the map A -> C.
9760 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
9767 if (!isl_space_domain_is_wrapping(map
->dim
))
9768 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9769 "domain is not a product", return isl_map_free(map
));
9771 space
= isl_map_get_space(map
);
9772 total
= isl_space_dim(space
, isl_dim_in
);
9773 space
= isl_space_domain_factor_domain(space
);
9774 keep
= isl_space_dim(space
, isl_dim_in
);
9775 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
9776 map
= isl_map_reset_space(map
, space
);
9781 /* Given a map of the form [A -> B] -> C, return the map B -> C.
9783 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
9790 if (!isl_space_domain_is_wrapping(map
->dim
))
9791 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9792 "domain is not a product", return isl_map_free(map
));
9794 space
= isl_map_get_space(map
);
9795 total
= isl_space_dim(space
, isl_dim_in
);
9796 space
= isl_space_domain_factor_range(space
);
9797 keep
= isl_space_dim(space
, isl_dim_in
);
9798 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
9799 map
= isl_map_reset_space(map
, space
);
9804 /* Given a map A -> [B -> C], extract the map A -> B.
9806 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
9813 if (!isl_space_range_is_wrapping(map
->dim
))
9814 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9815 "range is not a product", return isl_map_free(map
));
9817 space
= isl_map_get_space(map
);
9818 total
= isl_space_dim(space
, isl_dim_out
);
9819 space
= isl_space_range_factor_domain(space
);
9820 keep
= isl_space_dim(space
, isl_dim_out
);
9821 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
9822 map
= isl_map_reset_space(map
, space
);
9827 /* Given a map A -> [B -> C], extract the map A -> C.
9829 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
9836 if (!isl_space_range_is_wrapping(map
->dim
))
9837 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9838 "range is not a product", return isl_map_free(map
));
9840 space
= isl_map_get_space(map
);
9841 total
= isl_space_dim(space
, isl_dim_out
);
9842 space
= isl_space_range_factor_range(space
);
9843 keep
= isl_space_dim(space
, isl_dim_out
);
9844 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
9845 map
= isl_map_reset_space(map
, space
);
9850 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9852 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9853 __isl_take isl_map
*map2
)
9857 prod
= isl_map_domain_product(map1
, map2
);
9858 prod
= isl_map_flatten_domain(prod
);
9862 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9864 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9865 __isl_take isl_map
*map2
)
9869 prod
= isl_map_range_product(map1
, map2
);
9870 prod
= isl_map_flatten_range(prod
);
9874 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9877 uint32_t hash
= isl_hash_init();
9882 bmap
= isl_basic_map_copy(bmap
);
9883 bmap
= isl_basic_map_normalize(bmap
);
9886 total
= isl_basic_map_total_dim(bmap
);
9887 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9888 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9890 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9891 isl_hash_hash(hash
, c_hash
);
9893 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9894 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9896 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9897 isl_hash_hash(hash
, c_hash
);
9899 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9900 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9902 if (isl_int_is_zero(bmap
->div
[i
][0]))
9904 isl_hash_byte(hash
, i
& 0xFF);
9905 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9906 isl_hash_hash(hash
, c_hash
);
9908 isl_basic_map_free(bmap
);
9912 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9914 return isl_basic_map_get_hash(bset_to_bmap(bset
));
9917 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9924 map
= isl_map_copy(map
);
9925 map
= isl_map_normalize(map
);
9929 hash
= isl_hash_init();
9930 for (i
= 0; i
< map
->n
; ++i
) {
9932 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9933 isl_hash_hash(hash
, bmap_hash
);
9941 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9943 return isl_map_get_hash(set_to_map(set
));
9946 /* Return the number of basic maps in the (current) representation of "map".
9948 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
9950 return map
? map
->n
: 0;
9953 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
9955 return set
? set
->n
: 0;
9958 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
9959 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
9964 return isl_stat_error
;
9966 for (i
= 0; i
< map
->n
; ++i
)
9967 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
9968 return isl_stat_error
;
9973 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
9974 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
9979 return isl_stat_error
;
9981 for (i
= 0; i
< set
->n
; ++i
)
9982 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
9983 return isl_stat_error
;
9988 /* Return a list of basic sets, the union of which is equal to "set".
9990 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
9991 __isl_keep isl_set
*set
)
9994 isl_basic_set_list
*list
;
9999 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10000 for (i
= 0; i
< set
->n
; ++i
) {
10001 isl_basic_set
*bset
;
10003 bset
= isl_basic_set_copy(set
->p
[i
]);
10004 list
= isl_basic_set_list_add(list
, bset
);
10010 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10017 bset
= isl_basic_set_cow(bset
);
10021 dim
= isl_basic_set_get_space(bset
);
10022 dim
= isl_space_lift(dim
, bset
->n_div
);
10025 isl_space_free(bset
->dim
);
10027 bset
->extra
-= bset
->n_div
;
10030 bset
= isl_basic_set_finalize(bset
);
10034 isl_basic_set_free(bset
);
10038 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10044 set
= isl_set_align_divs(set
);
10049 set
= isl_set_cow(set
);
10053 n_div
= set
->p
[0]->n_div
;
10054 dim
= isl_set_get_space(set
);
10055 dim
= isl_space_lift(dim
, n_div
);
10058 isl_space_free(set
->dim
);
10061 for (i
= 0; i
< set
->n
; ++i
) {
10062 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10073 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10081 dim
= isl_basic_set_total_dim(bset
);
10082 size
+= bset
->n_eq
* (1 + dim
);
10083 size
+= bset
->n_ineq
* (1 + dim
);
10084 size
+= bset
->n_div
* (2 + dim
);
10089 int isl_set_size(__isl_keep isl_set
*set
)
10097 for (i
= 0; i
< set
->n
; ++i
)
10098 size
+= isl_basic_set_size(set
->p
[i
]);
10103 /* Check if there is any lower bound (if lower == 0) and/or upper
10104 * bound (if upper == 0) on the specified dim.
10106 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10107 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10111 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10112 return isl_bool_error
;
10114 pos
+= isl_basic_map_offset(bmap
, type
);
10116 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10117 if (isl_int_is_zero(bmap
->div
[i
][0]))
10119 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10120 return isl_bool_true
;
10123 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10124 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10125 return isl_bool_true
;
10127 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10128 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10135 return lower
&& upper
;
10138 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10139 enum isl_dim_type type
, unsigned pos
)
10141 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10144 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10145 enum isl_dim_type type
, unsigned pos
)
10147 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10150 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10151 enum isl_dim_type type
, unsigned pos
)
10153 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10156 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10157 enum isl_dim_type type
, unsigned pos
)
10162 return isl_bool_error
;
10164 for (i
= 0; i
< map
->n
; ++i
) {
10166 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10167 if (bounded
< 0 || !bounded
)
10171 return isl_bool_true
;
10174 /* Return true if the specified dim is involved in both an upper bound
10175 * and a lower bound.
10177 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10178 enum isl_dim_type type
, unsigned pos
)
10180 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10183 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10185 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10186 enum isl_dim_type type
, unsigned pos
,
10187 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10188 enum isl_dim_type type
, unsigned pos
))
10193 return isl_bool_error
;
10195 for (i
= 0; i
< map
->n
; ++i
) {
10197 bounded
= fn(map
->p
[i
], type
, pos
);
10198 if (bounded
< 0 || bounded
)
10202 return isl_bool_false
;
10205 /* Return 1 if the specified dim is involved in any lower bound.
10207 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10208 enum isl_dim_type type
, unsigned pos
)
10210 return has_any_bound(set
, type
, pos
,
10211 &isl_basic_map_dim_has_lower_bound
);
10214 /* Return 1 if the specified dim is involved in any upper bound.
10216 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10217 enum isl_dim_type type
, unsigned pos
)
10219 return has_any_bound(set
, type
, pos
,
10220 &isl_basic_map_dim_has_upper_bound
);
10223 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10225 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10226 enum isl_dim_type type
, unsigned pos
,
10227 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10228 enum isl_dim_type type
, unsigned pos
))
10233 return isl_bool_error
;
10235 for (i
= 0; i
< map
->n
; ++i
) {
10237 bounded
= fn(map
->p
[i
], type
, pos
);
10238 if (bounded
< 0 || !bounded
)
10242 return isl_bool_true
;
10245 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10247 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10248 enum isl_dim_type type
, unsigned pos
)
10250 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10253 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10255 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10256 enum isl_dim_type type
, unsigned pos
)
10258 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10261 /* For each of the "n" variables starting at "first", determine
10262 * the sign of the variable and put the results in the first "n"
10263 * elements of the array "signs".
10265 * 1 means that the variable is non-negative
10266 * -1 means that the variable is non-positive
10267 * 0 means the variable attains both positive and negative values.
10269 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10270 unsigned first
, unsigned n
, int *signs
)
10272 isl_vec
*bound
= NULL
;
10273 struct isl_tab
*tab
= NULL
;
10274 struct isl_tab_undo
*snap
;
10277 if (!bset
|| !signs
)
10278 return isl_stat_error
;
10280 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10281 tab
= isl_tab_from_basic_set(bset
, 0);
10282 if (!bound
|| !tab
)
10285 isl_seq_clr(bound
->el
, bound
->size
);
10286 isl_int_set_si(bound
->el
[0], -1);
10288 snap
= isl_tab_snap(tab
);
10289 for (i
= 0; i
< n
; ++i
) {
10292 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10293 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10295 empty
= tab
->empty
;
10296 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10297 if (isl_tab_rollback(tab
, snap
) < 0)
10305 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10306 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10308 empty
= tab
->empty
;
10309 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10310 if (isl_tab_rollback(tab
, snap
) < 0)
10313 signs
[i
] = empty
? -1 : 0;
10317 isl_vec_free(bound
);
10318 return isl_stat_ok
;
10321 isl_vec_free(bound
);
10322 return isl_stat_error
;
10325 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10326 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10328 if (!bset
|| !signs
)
10329 return isl_stat_error
;
10330 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10331 return isl_stat_error
);
10333 first
+= pos(bset
->dim
, type
) - 1;
10334 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10337 /* Is it possible for the integer division "div" to depend (possibly
10338 * indirectly) on any output dimensions?
10340 * If the div is undefined, then we conservatively assume that it
10341 * may depend on them.
10342 * Otherwise, we check if it actually depends on them or on any integer
10343 * divisions that may depend on them.
10345 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10348 unsigned n_out
, o_out
;
10349 unsigned n_div
, o_div
;
10351 if (isl_int_is_zero(bmap
->div
[div
][0]))
10352 return isl_bool_true
;
10354 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10355 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10357 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10358 return isl_bool_true
;
10360 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10361 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10363 for (i
= 0; i
< n_div
; ++i
) {
10364 isl_bool may_involve
;
10366 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10368 may_involve
= div_may_involve_output(bmap
, i
);
10369 if (may_involve
< 0 || may_involve
)
10370 return may_involve
;
10373 return isl_bool_false
;
10376 /* Return the first integer division of "bmap" in the range
10377 * [first, first + n[ that may depend on any output dimensions and
10378 * that has a non-zero coefficient in "c" (where the first coefficient
10379 * in "c" corresponds to integer division "first").
10381 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10382 isl_int
*c
, int first
, int n
)
10389 for (k
= first
; k
< first
+ n
; ++k
) {
10390 isl_bool may_involve
;
10392 if (isl_int_is_zero(c
[k
]))
10394 may_involve
= div_may_involve_output(bmap
, k
);
10395 if (may_involve
< 0)
10404 /* Look for a pair of inequality constraints in "bmap" of the form
10406 * -l + i >= 0 or i >= l
10408 * n + l - i >= 0 or i <= l + n
10410 * with n < "m" and i the output dimension at position "pos".
10411 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10412 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10413 * and earlier output dimensions, as well as integer divisions that do
10414 * not involve any of the output dimensions.
10416 * Return the index of the first inequality constraint or bmap->n_ineq
10417 * if no such pair can be found.
10419 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10420 int pos
, isl_int m
)
10425 unsigned n_div
, o_div
;
10426 unsigned n_out
, o_out
;
10432 ctx
= isl_basic_map_get_ctx(bmap
);
10433 total
= isl_basic_map_total_dim(bmap
);
10434 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10435 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10436 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10437 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10438 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10439 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10441 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10442 n_out
- (pos
+ 1)) != -1)
10444 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10447 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10448 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10451 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10452 bmap
->ineq
[j
] + 1, total
))
10456 if (j
>= bmap
->n_ineq
)
10458 isl_int_add(bmap
->ineq
[i
][0],
10459 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10460 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10461 isl_int_sub(bmap
->ineq
[i
][0],
10462 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10465 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10471 return bmap
->n_ineq
;
10474 /* Return the index of the equality of "bmap" that defines
10475 * the output dimension "pos" in terms of earlier dimensions.
10476 * The equality may also involve integer divisions, as long
10477 * as those integer divisions are defined in terms of
10478 * parameters or input dimensions.
10479 * In this case, *div is set to the number of integer divisions and
10480 * *ineq is set to the number of inequality constraints (provided
10481 * div and ineq are not NULL).
10483 * The equality may also involve a single integer division involving
10484 * the output dimensions (typically only output dimension "pos") as
10485 * long as the coefficient of output dimension "pos" is 1 or -1 and
10486 * there is a pair of constraints i >= l and i <= l + n, with i referring
10487 * to output dimension "pos", l an expression involving only earlier
10488 * dimensions and n smaller than the coefficient of the integer division
10489 * in the equality. In this case, the output dimension can be defined
10490 * in terms of a modulo expression that does not involve the integer division.
10491 * *div is then set to this single integer division and
10492 * *ineq is set to the index of constraint i >= l.
10494 * Return bmap->n_eq if there is no such equality.
10495 * Return -1 on error.
10497 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10498 int pos
, int *div
, int *ineq
)
10501 unsigned n_out
, o_out
;
10502 unsigned n_div
, o_div
;
10507 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10508 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10509 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10510 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10513 *ineq
= bmap
->n_ineq
;
10516 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10517 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10519 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10520 n_out
- (pos
+ 1)) != -1)
10522 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10526 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
10527 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
10529 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10530 k
+ 1, n_div
- (k
+1)) < n_div
)
10532 l
= find_modulo_constraint_pair(bmap
, pos
,
10533 bmap
->eq
[j
][o_div
+ k
]);
10536 if (l
>= bmap
->n_ineq
)
10548 /* Check if the given basic map is obviously single-valued.
10549 * In particular, for each output dimension, check that there is
10550 * an equality that defines the output dimension in terms of
10551 * earlier dimensions.
10553 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10559 return isl_bool_error
;
10561 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10563 for (i
= 0; i
< n_out
; ++i
) {
10566 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
10569 return isl_bool_error
;
10570 if (eq
>= bmap
->n_eq
)
10571 return isl_bool_false
;
10574 return isl_bool_true
;
10577 /* Check if the given basic map is single-valued.
10578 * We simply compute
10582 * and check if the result is a subset of the identity mapping.
10584 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10587 isl_basic_map
*test
;
10591 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10595 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10596 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10598 space
= isl_basic_map_get_space(bmap
);
10599 space
= isl_space_map_from_set(isl_space_range(space
));
10600 id
= isl_basic_map_identity(space
);
10602 sv
= isl_basic_map_is_subset(test
, id
);
10604 isl_basic_map_free(test
);
10605 isl_basic_map_free(id
);
10610 /* Check if the given map is obviously single-valued.
10612 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10615 return isl_bool_error
;
10617 return isl_bool_true
;
10619 return isl_bool_false
;
10621 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10624 /* Check if the given map is single-valued.
10625 * We simply compute
10629 * and check if the result is a subset of the identity mapping.
10631 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
10638 sv
= isl_map_plain_is_single_valued(map
);
10642 test
= isl_map_reverse(isl_map_copy(map
));
10643 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10645 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10646 id
= isl_map_identity(dim
);
10648 sv
= isl_map_is_subset(test
, id
);
10650 isl_map_free(test
);
10656 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
10660 map
= isl_map_copy(map
);
10661 map
= isl_map_reverse(map
);
10662 in
= isl_map_is_single_valued(map
);
10668 /* Check if the given map is obviously injective.
10670 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10674 map
= isl_map_copy(map
);
10675 map
= isl_map_reverse(map
);
10676 in
= isl_map_plain_is_single_valued(map
);
10682 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
10686 sv
= isl_map_is_single_valued(map
);
10690 return isl_map_is_injective(map
);
10693 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
10695 return isl_map_is_single_valued(set_to_map(set
));
10698 /* Does "map" only map elements to themselves?
10700 * If the domain and range spaces are different, then "map"
10701 * is considered not to be an identity relation, even if it is empty.
10702 * Otherwise, construct the maximal identity relation and
10703 * check whether "map" is a subset of this relation.
10705 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
10709 isl_bool equal
, is_identity
;
10711 space
= isl_map_get_space(map
);
10712 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
10713 isl_space_free(space
);
10714 if (equal
< 0 || !equal
)
10717 id
= isl_map_identity(isl_map_get_space(map
));
10718 is_identity
= isl_map_is_subset(map
, id
);
10721 return is_identity
;
10724 int isl_map_is_translation(__isl_keep isl_map
*map
)
10729 delta
= isl_map_deltas(isl_map_copy(map
));
10730 ok
= isl_set_is_singleton(delta
);
10731 isl_set_free(delta
);
10736 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
10738 if (isl_seq_first_non_zero(p
, pos
) != -1)
10740 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
10745 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
10752 return isl_bool_error
;
10754 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
10755 return isl_bool_false
;
10757 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
10758 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
10759 for (j
= 0; j
< nvar
; ++j
) {
10760 int lower
= 0, upper
= 0;
10761 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10762 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
10764 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
10765 return isl_bool_false
;
10768 if (i
< bset
->n_eq
)
10770 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10771 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
10773 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
10774 return isl_bool_false
;
10775 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
10780 if (!lower
|| !upper
)
10781 return isl_bool_false
;
10784 return isl_bool_true
;
10787 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
10790 return isl_bool_error
;
10792 return isl_bool_false
;
10794 return isl_basic_set_is_box(set
->p
[0]);
10797 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
10800 return isl_bool_error
;
10802 return isl_space_is_wrapping(bset
->dim
);
10805 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
10808 return isl_bool_error
;
10810 return isl_space_is_wrapping(set
->dim
);
10813 /* Modify the space of "map" through a call to "change".
10814 * If "can_change" is set (not NULL), then first call it to check
10815 * if the modification is allowed, printing the error message "cannot_change"
10818 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
10819 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
10820 const char *cannot_change
,
10821 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
10829 ok
= can_change
? can_change(map
) : isl_bool_true
;
10831 return isl_map_free(map
);
10833 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
10834 return isl_map_free(map
));
10836 space
= change(isl_map_get_space(map
));
10837 map
= isl_map_reset_space(map
, space
);
10842 /* Is the domain of "map" a wrapped relation?
10844 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
10847 return isl_bool_error
;
10849 return isl_space_domain_is_wrapping(map
->dim
);
10852 /* Is the range of "map" a wrapped relation?
10854 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
10857 return isl_bool_error
;
10859 return isl_space_range_is_wrapping(map
->dim
);
10862 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
10864 bmap
= isl_basic_map_cow(bmap
);
10868 bmap
->dim
= isl_space_wrap(bmap
->dim
);
10872 bmap
= isl_basic_map_finalize(bmap
);
10874 return bset_from_bmap(bmap
);
10876 isl_basic_map_free(bmap
);
10880 /* Given a map A -> B, return the set (A -> B).
10882 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
10884 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
10887 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
10889 bset
= isl_basic_set_cow(bset
);
10893 bset
->dim
= isl_space_unwrap(bset
->dim
);
10897 bset
= isl_basic_set_finalize(bset
);
10899 return bset_to_bmap(bset
);
10901 isl_basic_set_free(bset
);
10905 /* Given a set (A -> B), return the map A -> B.
10906 * Error out if "set" is not of the form (A -> B).
10908 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
10910 return isl_map_change_space(set
, &isl_set_is_wrapping
,
10911 "not a wrapping set", &isl_space_unwrap
);
10914 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
10915 enum isl_dim_type type
)
10920 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
10923 bmap
= isl_basic_map_cow(bmap
);
10927 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
10931 bmap
= isl_basic_map_finalize(bmap
);
10935 isl_basic_map_free(bmap
);
10939 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
10940 enum isl_dim_type type
)
10947 if (!isl_space_is_named_or_nested(map
->dim
, type
))
10950 map
= isl_map_cow(map
);
10954 for (i
= 0; i
< map
->n
; ++i
) {
10955 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
10959 map
->dim
= isl_space_reset(map
->dim
, type
);
10969 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
10974 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
10977 bmap
= isl_basic_map_cow(bmap
);
10981 bmap
->dim
= isl_space_flatten(bmap
->dim
);
10985 bmap
= isl_basic_map_finalize(bmap
);
10989 isl_basic_map_free(bmap
);
10993 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
10995 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
10998 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
10999 __isl_take isl_basic_map
*bmap
)
11004 if (!bmap
->dim
->nested
[0])
11007 bmap
= isl_basic_map_cow(bmap
);
11011 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11015 bmap
= isl_basic_map_finalize(bmap
);
11019 isl_basic_map_free(bmap
);
11023 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11024 __isl_take isl_basic_map
*bmap
)
11029 if (!bmap
->dim
->nested
[1])
11032 bmap
= isl_basic_map_cow(bmap
);
11036 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11040 bmap
= isl_basic_map_finalize(bmap
);
11044 isl_basic_map_free(bmap
);
11048 /* Remove any internal structure from the spaces of domain and range of "map".
11050 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11055 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11058 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11061 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11063 return set_from_map(isl_map_flatten(set_to_map(set
)));
11066 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11068 isl_space
*dim
, *flat_dim
;
11071 dim
= isl_set_get_space(set
);
11072 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11073 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11074 map
= isl_map_intersect_domain(map
, set
);
11079 /* Remove any internal structure from the space of the domain of "map".
11081 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11086 if (!map
->dim
->nested
[0])
11089 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11092 /* Remove any internal structure from the space of the range of "map".
11094 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11099 if (!map
->dim
->nested
[1])
11102 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11105 /* Reorder the dimensions of "bmap" according to the given dim_map
11106 * and set the dimension specification to "dim" and
11107 * perform Gaussian elimination on the result.
11109 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11110 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11112 isl_basic_map
*res
;
11115 bmap
= isl_basic_map_cow(bmap
);
11116 if (!bmap
|| !dim
|| !dim_map
)
11119 flags
= bmap
->flags
;
11120 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11121 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11122 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11123 res
= isl_basic_map_alloc_space(dim
,
11124 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11125 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11127 res
->flags
= flags
;
11128 res
= isl_basic_map_gauss(res
, NULL
);
11129 res
= isl_basic_map_finalize(res
);
11133 isl_basic_map_free(bmap
);
11134 isl_space_free(dim
);
11138 /* Reorder the dimensions of "map" according to given reordering.
11140 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11141 __isl_take isl_reordering
*r
)
11144 struct isl_dim_map
*dim_map
;
11146 map
= isl_map_cow(map
);
11147 dim_map
= isl_dim_map_from_reordering(r
);
11148 if (!map
|| !r
|| !dim_map
)
11151 for (i
= 0; i
< map
->n
; ++i
) {
11152 struct isl_dim_map
*dim_map_i
;
11154 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11156 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11157 isl_space_copy(r
->dim
), dim_map_i
);
11163 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11165 isl_reordering_free(r
);
11171 isl_reordering_free(r
);
11175 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11176 __isl_take isl_reordering
*r
)
11178 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11181 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11182 __isl_take isl_space
*model
)
11187 if (!map
|| !model
)
11190 ctx
= isl_space_get_ctx(model
);
11191 if (!isl_space_has_named_params(model
))
11192 isl_die(ctx
, isl_error_invalid
,
11193 "model has unnamed parameters", goto error
);
11194 if (isl_map_check_named_params(map
) < 0)
11196 aligned
= isl_map_space_has_equal_params(map
, model
);
11200 isl_reordering
*exp
;
11202 model
= isl_space_drop_dims(model
, isl_dim_in
,
11203 0, isl_space_dim(model
, isl_dim_in
));
11204 model
= isl_space_drop_dims(model
, isl_dim_out
,
11205 0, isl_space_dim(model
, isl_dim_out
));
11206 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11207 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11208 map
= isl_map_realign(map
, exp
);
11211 isl_space_free(model
);
11214 isl_space_free(model
);
11219 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11220 __isl_take isl_space
*model
)
11222 return isl_map_align_params(set
, model
);
11225 /* Align the parameters of "bmap" to those of "model", introducing
11226 * additional parameters if needed.
11228 __isl_give isl_basic_map
*isl_basic_map_align_params(
11229 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11232 isl_bool equal_params
;
11234 if (!bmap
|| !model
)
11237 ctx
= isl_space_get_ctx(model
);
11238 if (!isl_space_has_named_params(model
))
11239 isl_die(ctx
, isl_error_invalid
,
11240 "model has unnamed parameters", goto error
);
11241 if (!isl_space_has_named_params(bmap
->dim
))
11242 isl_die(ctx
, isl_error_invalid
,
11243 "relation has unnamed parameters", goto error
);
11244 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11245 if (equal_params
< 0)
11247 if (!equal_params
) {
11248 isl_reordering
*exp
;
11249 struct isl_dim_map
*dim_map
;
11251 model
= isl_space_drop_dims(model
, isl_dim_in
,
11252 0, isl_space_dim(model
, isl_dim_in
));
11253 model
= isl_space_drop_dims(model
, isl_dim_out
,
11254 0, isl_space_dim(model
, isl_dim_out
));
11255 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11256 exp
= isl_reordering_extend_space(exp
,
11257 isl_basic_map_get_space(bmap
));
11258 dim_map
= isl_dim_map_from_reordering(exp
);
11259 bmap
= isl_basic_map_realign(bmap
,
11260 exp
? isl_space_copy(exp
->dim
) : NULL
,
11261 isl_dim_map_extend(dim_map
, bmap
));
11262 isl_reordering_free(exp
);
11266 isl_space_free(model
);
11269 isl_space_free(model
);
11270 isl_basic_map_free(bmap
);
11274 /* Do "bset" and "space" have the same parameters?
11276 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11277 __isl_keep isl_space
*space
)
11279 isl_space
*bset_space
;
11281 bset_space
= isl_basic_set_peek_space(bset
);
11282 return isl_space_has_equal_params(bset_space
, space
);
11285 /* Do "map" and "space" have the same parameters?
11287 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11288 __isl_keep isl_space
*space
)
11290 isl_space
*map_space
;
11292 map_space
= isl_map_peek_space(map
);
11293 return isl_space_has_equal_params(map_space
, space
);
11296 /* Do "set" and "space" have the same parameters?
11298 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11299 __isl_keep isl_space
*space
)
11301 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11304 /* Align the parameters of "bset" to those of "model", introducing
11305 * additional parameters if needed.
11307 __isl_give isl_basic_set
*isl_basic_set_align_params(
11308 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11310 return isl_basic_map_align_params(bset
, model
);
11313 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11314 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11315 enum isl_dim_type c2
, enum isl_dim_type c3
,
11316 enum isl_dim_type c4
, enum isl_dim_type c5
)
11318 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11319 struct isl_mat
*mat
;
11325 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11326 isl_basic_map_total_dim(bmap
) + 1);
11329 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11330 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11331 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11332 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11333 isl_int_set(mat
->row
[i
][pos
],
11334 bmap
->eq
[i
][off
+ k
]);
11342 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11343 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11344 enum isl_dim_type c2
, enum isl_dim_type c3
,
11345 enum isl_dim_type c4
, enum isl_dim_type c5
)
11347 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11348 struct isl_mat
*mat
;
11354 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11355 isl_basic_map_total_dim(bmap
) + 1);
11358 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11359 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11360 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11361 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11362 isl_int_set(mat
->row
[i
][pos
],
11363 bmap
->ineq
[i
][off
+ k
]);
11371 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11372 __isl_take isl_space
*dim
,
11373 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11374 enum isl_dim_type c2
, enum isl_dim_type c3
,
11375 enum isl_dim_type c4
, enum isl_dim_type c5
)
11377 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11378 isl_basic_map
*bmap
;
11384 if (!dim
|| !eq
|| !ineq
)
11387 if (eq
->n_col
!= ineq
->n_col
)
11388 isl_die(dim
->ctx
, isl_error_invalid
,
11389 "equalities and inequalities matrices should have "
11390 "same number of columns", goto error
);
11392 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11394 if (eq
->n_col
< total
)
11395 isl_die(dim
->ctx
, isl_error_invalid
,
11396 "number of columns too small", goto error
);
11398 extra
= eq
->n_col
- total
;
11400 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11401 eq
->n_row
, ineq
->n_row
);
11404 for (i
= 0; i
< extra
; ++i
) {
11405 k
= isl_basic_map_alloc_div(bmap
);
11408 isl_int_set_si(bmap
->div
[k
][0], 0);
11410 for (i
= 0; i
< eq
->n_row
; ++i
) {
11411 l
= isl_basic_map_alloc_equality(bmap
);
11414 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11415 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11416 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11417 isl_int_set(bmap
->eq
[l
][off
+ k
],
11423 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11424 l
= isl_basic_map_alloc_inequality(bmap
);
11427 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11428 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11429 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11430 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11431 ineq
->row
[i
][pos
]);
11437 isl_space_free(dim
);
11439 isl_mat_free(ineq
);
11441 bmap
= isl_basic_map_simplify(bmap
);
11442 return isl_basic_map_finalize(bmap
);
11444 isl_space_free(dim
);
11446 isl_mat_free(ineq
);
11450 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11451 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11452 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11454 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11455 c1
, c2
, c3
, c4
, isl_dim_in
);
11458 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11459 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11460 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11462 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11463 c1
, c2
, c3
, c4
, isl_dim_in
);
11466 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11467 __isl_take isl_space
*dim
,
11468 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11469 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11471 isl_basic_map
*bmap
;
11472 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11473 c1
, c2
, c3
, c4
, isl_dim_in
);
11474 return bset_from_bmap(bmap
);
11477 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11480 return isl_bool_error
;
11482 return isl_space_can_zip(bmap
->dim
);
11485 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11488 return isl_bool_error
;
11490 return isl_space_can_zip(map
->dim
);
11493 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11494 * (A -> C) -> (B -> D).
11496 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11505 if (!isl_basic_map_can_zip(bmap
))
11506 isl_die(bmap
->ctx
, isl_error_invalid
,
11507 "basic map cannot be zipped", goto error
);
11508 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11509 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11510 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11511 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11512 bmap
= isl_basic_map_cow(bmap
);
11513 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11516 bmap
->dim
= isl_space_zip(bmap
->dim
);
11519 bmap
= isl_basic_map_mark_final(bmap
);
11522 isl_basic_map_free(bmap
);
11526 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11527 * (A -> C) -> (B -> D).
11529 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11536 if (!isl_map_can_zip(map
))
11537 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
11540 map
= isl_map_cow(map
);
11544 for (i
= 0; i
< map
->n
; ++i
) {
11545 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
11550 map
->dim
= isl_space_zip(map
->dim
);
11560 /* Can we apply isl_basic_map_curry to "bmap"?
11561 * That is, does it have a nested relation in its domain?
11563 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
11566 return isl_bool_error
;
11568 return isl_space_can_curry(bmap
->dim
);
11571 /* Can we apply isl_map_curry to "map"?
11572 * That is, does it have a nested relation in its domain?
11574 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
11577 return isl_bool_error
;
11579 return isl_space_can_curry(map
->dim
);
11582 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11585 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
11591 if (!isl_basic_map_can_curry(bmap
))
11592 isl_die(bmap
->ctx
, isl_error_invalid
,
11593 "basic map cannot be curried", goto error
);
11594 bmap
= isl_basic_map_cow(bmap
);
11597 bmap
->dim
= isl_space_curry(bmap
->dim
);
11600 bmap
= isl_basic_map_mark_final(bmap
);
11603 isl_basic_map_free(bmap
);
11607 /* Given a map (A -> B) -> C, return the corresponding map
11610 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11612 return isl_map_change_space(map
, &isl_map_can_curry
,
11613 "map cannot be curried", &isl_space_curry
);
11616 /* Can isl_map_range_curry be applied to "map"?
11617 * That is, does it have a nested relation in its range,
11618 * the domain of which is itself a nested relation?
11620 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
11623 return isl_bool_error
;
11625 return isl_space_can_range_curry(map
->dim
);
11628 /* Given a map A -> ((B -> C) -> D), return the corresponding map
11629 * A -> (B -> (C -> D)).
11631 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
11633 return isl_map_change_space(map
, &isl_map_can_range_curry
,
11634 "map range cannot be curried",
11635 &isl_space_range_curry
);
11638 /* Can we apply isl_basic_map_uncurry to "bmap"?
11639 * That is, does it have a nested relation in its domain?
11641 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11644 return isl_bool_error
;
11646 return isl_space_can_uncurry(bmap
->dim
);
11649 /* Can we apply isl_map_uncurry to "map"?
11650 * That is, does it have a nested relation in its domain?
11652 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
11655 return isl_bool_error
;
11657 return isl_space_can_uncurry(map
->dim
);
11660 /* Given a basic map A -> (B -> C), return the corresponding basic map
11663 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
11669 if (!isl_basic_map_can_uncurry(bmap
))
11670 isl_die(bmap
->ctx
, isl_error_invalid
,
11671 "basic map cannot be uncurried",
11672 return isl_basic_map_free(bmap
));
11673 bmap
= isl_basic_map_cow(bmap
);
11676 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
11678 return isl_basic_map_free(bmap
);
11679 bmap
= isl_basic_map_mark_final(bmap
);
11683 /* Given a map A -> (B -> C), return the corresponding map
11686 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
11688 return isl_map_change_space(map
, &isl_map_can_uncurry
,
11689 "map cannot be uncurried", &isl_space_uncurry
);
11692 /* Construct a basic map mapping the domain of the affine expression
11693 * to a one-dimensional range prescribed by the affine expression.
11694 * If "rational" is set, then construct a rational basic map.
11696 * A NaN affine expression cannot be converted to a basic map.
11698 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
11699 __isl_take isl_aff
*aff
, int rational
)
11704 isl_local_space
*ls
;
11705 isl_basic_map
*bmap
= NULL
;
11709 is_nan
= isl_aff_is_nan(aff
);
11713 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
11714 "cannot convert NaN", goto error
);
11716 ls
= isl_aff_get_local_space(aff
);
11717 bmap
= isl_basic_map_from_local_space(ls
);
11718 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11719 k
= isl_basic_map_alloc_equality(bmap
);
11723 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11724 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11725 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11726 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11727 aff
->v
->size
- (pos
+ 1));
11731 bmap
= isl_basic_map_set_rational(bmap
);
11732 bmap
= isl_basic_map_finalize(bmap
);
11736 isl_basic_map_free(bmap
);
11740 /* Construct a basic map mapping the domain of the affine expression
11741 * to a one-dimensional range prescribed by the affine expression.
11743 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11745 return isl_basic_map_from_aff2(aff
, 0);
11748 /* Construct a map mapping the domain of the affine expression
11749 * to a one-dimensional range prescribed by the affine expression.
11751 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11753 isl_basic_map
*bmap
;
11755 bmap
= isl_basic_map_from_aff(aff
);
11756 return isl_map_from_basic_map(bmap
);
11759 /* Construct a basic map mapping the domain the multi-affine expression
11760 * to its range, with each dimension in the range equated to the
11761 * corresponding affine expression.
11762 * If "rational" is set, then construct a rational basic map.
11764 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
11765 __isl_take isl_multi_aff
*maff
, int rational
)
11769 isl_basic_map
*bmap
;
11774 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
11775 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
11776 "invalid space", goto error
);
11778 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
11779 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
11781 bmap
= isl_basic_map_set_rational(bmap
);
11783 for (i
= 0; i
< maff
->n
; ++i
) {
11785 isl_basic_map
*bmap_i
;
11787 aff
= isl_aff_copy(maff
->p
[i
]);
11788 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
11790 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11793 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
11795 isl_multi_aff_free(maff
);
11798 isl_multi_aff_free(maff
);
11802 /* Construct a basic map mapping the domain the multi-affine expression
11803 * to its range, with each dimension in the range equated to the
11804 * corresponding affine expression.
11806 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
11807 __isl_take isl_multi_aff
*ma
)
11809 return isl_basic_map_from_multi_aff2(ma
, 0);
11812 /* Construct a map mapping the domain the multi-affine expression
11813 * to its range, with each dimension in the range equated to the
11814 * corresponding affine expression.
11816 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
11818 isl_basic_map
*bmap
;
11820 bmap
= isl_basic_map_from_multi_aff(maff
);
11821 return isl_map_from_basic_map(bmap
);
11824 /* Construct a basic map mapping a domain in the given space to
11825 * to an n-dimensional range, with n the number of elements in the list,
11826 * where each coordinate in the range is prescribed by the
11827 * corresponding affine expression.
11828 * The domains of all affine expressions in the list are assumed to match
11831 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
11832 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
11836 isl_basic_map
*bmap
;
11841 dim
= isl_space_from_domain(domain_dim
);
11842 bmap
= isl_basic_map_universe(dim
);
11844 for (i
= 0; i
< list
->n
; ++i
) {
11846 isl_basic_map
*bmap_i
;
11848 aff
= isl_aff_copy(list
->p
[i
]);
11849 bmap_i
= isl_basic_map_from_aff(aff
);
11851 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11854 isl_aff_list_free(list
);
11858 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
11859 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11861 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
11864 /* Construct a basic map where the given dimensions are equal to each other.
11866 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
11867 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11869 isl_basic_map
*bmap
= NULL
;
11875 if (pos1
>= isl_space_dim(space
, type1
))
11876 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11877 "index out of bounds", goto error
);
11878 if (pos2
>= isl_space_dim(space
, type2
))
11879 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11880 "index out of bounds", goto error
);
11882 if (type1
== type2
&& pos1
== pos2
)
11883 return isl_basic_map_universe(space
);
11885 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
11886 i
= isl_basic_map_alloc_equality(bmap
);
11889 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11890 pos1
+= isl_basic_map_offset(bmap
, type1
);
11891 pos2
+= isl_basic_map_offset(bmap
, type2
);
11892 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
11893 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11894 bmap
= isl_basic_map_finalize(bmap
);
11895 isl_space_free(space
);
11898 isl_space_free(space
);
11899 isl_basic_map_free(bmap
);
11903 /* Add a constraint imposing that the given two dimensions are equal.
11905 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
11906 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11910 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11912 bmap
= isl_basic_map_intersect(bmap
, eq
);
11917 /* Add a constraint imposing that the given two dimensions are equal.
11919 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
11920 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11922 isl_basic_map
*bmap
;
11924 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11926 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11931 /* Add a constraint imposing that the given two dimensions have opposite values.
11933 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
11934 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11936 isl_basic_map
*bmap
= NULL
;
11942 if (pos1
>= isl_map_dim(map
, type1
))
11943 isl_die(map
->ctx
, isl_error_invalid
,
11944 "index out of bounds", goto error
);
11945 if (pos2
>= isl_map_dim(map
, type2
))
11946 isl_die(map
->ctx
, isl_error_invalid
,
11947 "index out of bounds", goto error
);
11949 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
11950 i
= isl_basic_map_alloc_equality(bmap
);
11953 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11954 pos1
+= isl_basic_map_offset(bmap
, type1
);
11955 pos2
+= isl_basic_map_offset(bmap
, type2
);
11956 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
11957 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11958 bmap
= isl_basic_map_finalize(bmap
);
11960 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11964 isl_basic_map_free(bmap
);
11969 /* Construct a constraint imposing that the value of the first dimension is
11970 * greater than or equal to that of the second.
11972 static __isl_give isl_constraint
*constraint_order_ge(
11973 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
11974 enum isl_dim_type type2
, int pos2
)
11981 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
11983 if (pos1
>= isl_constraint_dim(c
, type1
))
11984 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
11985 "index out of bounds", return isl_constraint_free(c
));
11986 if (pos2
>= isl_constraint_dim(c
, type2
))
11987 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
11988 "index out of bounds", return isl_constraint_free(c
));
11990 if (type1
== type2
&& pos1
== pos2
)
11993 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
11994 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
11999 /* Add a constraint imposing that the value of the first dimension is
12000 * greater than or equal to that of the second.
12002 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12003 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12008 if (type1
== type2
&& pos1
== pos2
)
12010 space
= isl_basic_map_get_space(bmap
);
12011 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12012 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12017 /* Add a constraint imposing that the value of the first dimension is
12018 * greater than or equal to that of the second.
12020 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12021 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12026 if (type1
== type2
&& pos1
== pos2
)
12028 space
= isl_map_get_space(map
);
12029 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12030 map
= isl_map_add_constraint(map
, c
);
12035 /* Add a constraint imposing that the value of the first dimension is
12036 * less than or equal to that of the second.
12038 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12039 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12041 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12044 /* Construct a basic map where the value of the first dimension is
12045 * greater than that of the second.
12047 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12048 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12050 isl_basic_map
*bmap
= NULL
;
12056 if (pos1
>= isl_space_dim(space
, type1
))
12057 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12058 "index out of bounds", goto error
);
12059 if (pos2
>= isl_space_dim(space
, type2
))
12060 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12061 "index out of bounds", goto error
);
12063 if (type1
== type2
&& pos1
== pos2
)
12064 return isl_basic_map_empty(space
);
12066 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12067 i
= isl_basic_map_alloc_inequality(bmap
);
12069 return isl_basic_map_free(bmap
);
12070 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12071 pos1
+= isl_basic_map_offset(bmap
, type1
);
12072 pos2
+= isl_basic_map_offset(bmap
, type2
);
12073 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12074 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12075 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12076 bmap
= isl_basic_map_finalize(bmap
);
12080 isl_space_free(space
);
12081 isl_basic_map_free(bmap
);
12085 /* Add a constraint imposing that the value of the first dimension is
12086 * greater than that of the second.
12088 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12089 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12093 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12095 bmap
= isl_basic_map_intersect(bmap
, gt
);
12100 /* Add a constraint imposing that the value of the first dimension is
12101 * greater than that of the second.
12103 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12104 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12106 isl_basic_map
*bmap
;
12108 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12110 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12115 /* Add a constraint imposing that the value of the first dimension is
12116 * smaller than that of the second.
12118 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12119 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12121 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12124 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12128 isl_local_space
*ls
;
12133 if (!isl_basic_map_divs_known(bmap
))
12134 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12135 "some divs are unknown", return NULL
);
12137 ls
= isl_basic_map_get_local_space(bmap
);
12138 div
= isl_local_space_get_div(ls
, pos
);
12139 isl_local_space_free(ls
);
12144 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12147 return isl_basic_map_get_div(bset
, pos
);
12150 /* Plug in "subs" for dimension "type", "pos" of "bset".
12152 * Let i be the dimension to replace and let "subs" be of the form
12156 * Any integer division with a non-zero coefficient for i,
12158 * floor((a i + g)/m)
12162 * floor((a f + d g)/(m d))
12164 * Constraints of the form
12172 * We currently require that "subs" is an integral expression.
12173 * Handling rational expressions may require us to add stride constraints
12174 * as we do in isl_basic_set_preimage_multi_aff.
12176 __isl_give isl_basic_set
*isl_basic_set_substitute(
12177 __isl_take isl_basic_set
*bset
,
12178 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12184 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12187 bset
= isl_basic_set_cow(bset
);
12188 if (!bset
|| !subs
)
12191 ctx
= isl_basic_set_get_ctx(bset
);
12192 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12193 isl_die(ctx
, isl_error_invalid
,
12194 "spaces don't match", goto error
);
12195 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12196 isl_die(ctx
, isl_error_unsupported
,
12197 "cannot handle divs yet", goto error
);
12198 if (!isl_int_is_one(subs
->v
->el
[0]))
12199 isl_die(ctx
, isl_error_invalid
,
12200 "can only substitute integer expressions", goto error
);
12202 pos
+= isl_basic_set_offset(bset
, type
);
12206 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12207 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12209 isl_int_set(v
, bset
->eq
[i
][pos
]);
12210 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12211 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12212 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12215 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12216 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12218 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12219 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12220 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12221 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12224 for (i
= 0; i
< bset
->n_div
; ++i
) {
12225 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12227 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12228 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12229 isl_seq_combine(bset
->div
[i
] + 1,
12230 subs
->v
->el
[0], bset
->div
[i
] + 1,
12231 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12232 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12237 bset
= isl_basic_set_simplify(bset
);
12238 return isl_basic_set_finalize(bset
);
12240 isl_basic_set_free(bset
);
12244 /* Plug in "subs" for dimension "type", "pos" of "set".
12246 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12247 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12251 if (set
&& isl_set_plain_is_empty(set
))
12254 set
= isl_set_cow(set
);
12258 for (i
= set
->n
- 1; i
>= 0; --i
) {
12259 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12260 if (remove_if_empty(set
, i
) < 0)
12270 /* Check if the range of "ma" is compatible with the domain or range
12271 * (depending on "type") of "bmap".
12273 static isl_stat
check_basic_map_compatible_range_multi_aff(
12274 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12275 __isl_keep isl_multi_aff
*ma
)
12278 isl_space
*ma_space
;
12280 ma_space
= isl_multi_aff_get_space(ma
);
12282 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12286 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12287 "parameters don't match", goto error
);
12288 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12292 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12293 "spaces don't match", goto error
);
12295 isl_space_free(ma_space
);
12296 return isl_stat_ok
;
12298 isl_space_free(ma_space
);
12299 return isl_stat_error
;
12302 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12303 * coefficients before the transformed range of dimensions,
12304 * the "n_after" coefficients after the transformed range of dimensions
12305 * and the coefficients of the other divs in "bmap".
12307 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12308 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12313 isl_local_space
*ls
;
12318 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
12322 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12323 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12324 for (i
= 0; i
< n_div
; ++i
) {
12325 int o_bmap
= 0, o_ls
= 0;
12327 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12328 o_bmap
+= 1 + 1 + n_param
;
12329 o_ls
+= 1 + 1 + n_param
;
12330 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12331 o_bmap
+= n_before
;
12332 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12333 ls
->div
->row
[i
] + o_ls
, n_set
);
12336 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12338 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12339 ls
->div
->row
[i
] + o_ls
, n_div
);
12342 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12343 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12347 isl_local_space_free(ls
);
12350 isl_local_space_free(ls
);
12354 /* How many stride constraints does "ma" enforce?
12355 * That is, how many of the affine expressions have a denominator
12356 * different from one?
12358 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12363 for (i
= 0; i
< ma
->n
; ++i
)
12364 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12370 /* For each affine expression in ma of the form
12372 * x_i = (f_i y + h_i)/m_i
12374 * with m_i different from one, add a constraint to "bmap"
12377 * f_i y + h_i = m_i alpha_i
12379 * with alpha_i an additional existentially quantified variable.
12381 * The input variables of "ma" correspond to a subset of the variables
12382 * of "bmap". There are "n_before" variables in "bmap" before this
12383 * subset and "n_after" variables after this subset.
12384 * The integer divisions of the affine expressions in "ma" are assumed
12385 * to have been aligned. There are "n_div_ma" of them and
12386 * they appear first in "bmap", straight after the "n_after" variables.
12388 static __isl_give isl_basic_map
*add_ma_strides(
12389 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12390 int n_before
, int n_after
, int n_div_ma
)
12398 total
= isl_basic_map_total_dim(bmap
);
12399 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12400 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12401 for (i
= 0; i
< ma
->n
; ++i
) {
12402 int o_bmap
= 0, o_ma
= 1;
12404 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12406 div
= isl_basic_map_alloc_div(bmap
);
12407 k
= isl_basic_map_alloc_equality(bmap
);
12408 if (div
< 0 || k
< 0)
12410 isl_int_set_si(bmap
->div
[div
][0], 0);
12411 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12412 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12413 o_bmap
+= 1 + n_param
;
12414 o_ma
+= 1 + n_param
;
12415 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12416 o_bmap
+= n_before
;
12417 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12418 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
12421 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12423 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12424 ma
->p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12425 o_bmap
+= n_div_ma
;
12427 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12428 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
12434 isl_basic_map_free(bmap
);
12438 /* Replace the domain or range space (depending on "type) of "space" by "set".
12440 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12441 enum isl_dim_type type
, __isl_take isl_space
*set
)
12443 if (type
== isl_dim_in
) {
12444 space
= isl_space_range(space
);
12445 space
= isl_space_map_from_domain_and_range(set
, space
);
12447 space
= isl_space_domain(space
);
12448 space
= isl_space_map_from_domain_and_range(space
, set
);
12454 /* Compute the preimage of the domain or range (depending on "type")
12455 * of "bmap" under the function represented by "ma".
12456 * In other words, plug in "ma" in the domain or range of "bmap".
12457 * The result is a basic map that lives in the same space as "bmap"
12458 * except that the domain or range has been replaced by
12459 * the domain space of "ma".
12461 * If bmap is represented by
12463 * A(p) + S u + B x + T v + C(divs) >= 0,
12465 * where u and x are input and output dimensions if type == isl_dim_out
12466 * while x and v are input and output dimensions if type == isl_dim_in,
12467 * and ma is represented by
12469 * x = D(p) + F(y) + G(divs')
12471 * then the result is
12473 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12475 * The divs in the input set are similarly adjusted.
12478 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12482 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12483 * B_i G(divs') + c_i(divs))/n_i)
12485 * If bmap is not a rational map and if F(y) involves any denominators
12487 * x_i = (f_i y + h_i)/m_i
12489 * then additional constraints are added to ensure that we only
12490 * map back integer points. That is we enforce
12492 * f_i y + h_i = m_i alpha_i
12494 * with alpha_i an additional existentially quantified variable.
12496 * We first copy over the divs from "ma".
12497 * Then we add the modified constraints and divs from "bmap".
12498 * Finally, we add the stride constraints, if needed.
12500 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12501 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12502 __isl_take isl_multi_aff
*ma
)
12506 isl_basic_map
*res
= NULL
;
12507 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12508 isl_int f
, c1
, c2
, g
;
12517 ma
= isl_multi_aff_align_divs(ma
);
12520 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12523 if (type
== isl_dim_in
) {
12525 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12527 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12530 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12531 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12533 space
= isl_multi_aff_get_domain_space(ma
);
12534 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12535 rational
= isl_basic_map_is_rational(bmap
);
12536 strides
= rational
? 0 : multi_aff_strides(ma
);
12537 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12538 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12540 res
= isl_basic_map_set_rational(res
);
12542 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12543 if (isl_basic_map_alloc_div(res
) < 0)
12546 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12549 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12550 k
= isl_basic_map_alloc_equality(res
);
12553 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12554 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12557 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12558 k
= isl_basic_map_alloc_inequality(res
);
12561 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12562 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12565 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12566 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12567 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12570 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12571 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12576 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
12582 isl_basic_map_free(bmap
);
12583 isl_multi_aff_free(ma
);
12584 res
= isl_basic_map_simplify(res
);
12585 return isl_basic_map_finalize(res
);
12591 isl_basic_map_free(bmap
);
12592 isl_multi_aff_free(ma
);
12593 isl_basic_map_free(res
);
12597 /* Compute the preimage of "bset" under the function represented by "ma".
12598 * In other words, plug in "ma" in "bset". The result is a basic set
12599 * that lives in the domain space of "ma".
12601 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12602 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12604 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12607 /* Compute the preimage of the domain of "bmap" under the function
12608 * represented by "ma".
12609 * In other words, plug in "ma" in the domain of "bmap".
12610 * The result is a basic map that lives in the same space as "bmap"
12611 * except that the domain has been replaced by the domain space of "ma".
12613 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12614 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12616 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12619 /* Compute the preimage of the range of "bmap" under the function
12620 * represented by "ma".
12621 * In other words, plug in "ma" in the range of "bmap".
12622 * The result is a basic map that lives in the same space as "bmap"
12623 * except that the range has been replaced by the domain space of "ma".
12625 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12626 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12628 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12631 /* Check if the range of "ma" is compatible with the domain or range
12632 * (depending on "type") of "map".
12633 * Return isl_stat_error if anything is wrong.
12635 static isl_stat
check_map_compatible_range_multi_aff(
12636 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12637 __isl_keep isl_multi_aff
*ma
)
12640 isl_space
*ma_space
;
12642 ma_space
= isl_multi_aff_get_space(ma
);
12643 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
12644 isl_space_free(ma_space
);
12646 return isl_stat_error
;
12648 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12649 "spaces don't match", return isl_stat_error
);
12650 return isl_stat_ok
;
12653 /* Compute the preimage of the domain or range (depending on "type")
12654 * of "map" under the function represented by "ma".
12655 * In other words, plug in "ma" in the domain or range of "map".
12656 * The result is a map that lives in the same space as "map"
12657 * except that the domain or range has been replaced by
12658 * the domain space of "ma".
12660 * The parameters are assumed to have been aligned.
12662 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
12663 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12668 map
= isl_map_cow(map
);
12669 ma
= isl_multi_aff_align_divs(ma
);
12672 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
12675 for (i
= 0; i
< map
->n
; ++i
) {
12676 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
12677 isl_multi_aff_copy(ma
));
12682 space
= isl_multi_aff_get_domain_space(ma
);
12683 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
12685 isl_space_free(map
->dim
);
12690 isl_multi_aff_free(ma
);
12692 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
12693 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
12696 isl_multi_aff_free(ma
);
12701 /* Compute the preimage of the domain or range (depending on "type")
12702 * of "map" under the function represented by "ma".
12703 * In other words, plug in "ma" in the domain or range of "map".
12704 * The result is a map that lives in the same space as "map"
12705 * except that the domain or range has been replaced by
12706 * the domain space of "ma".
12708 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
12709 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12716 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
12720 return map_preimage_multi_aff(map
, type
, ma
);
12722 if (isl_map_check_named_params(map
) < 0)
12724 if (!isl_space_has_named_params(ma
->space
))
12725 isl_die(map
->ctx
, isl_error_invalid
,
12726 "unaligned unnamed parameters", goto error
);
12727 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
12728 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
12730 return map_preimage_multi_aff(map
, type
, ma
);
12732 isl_multi_aff_free(ma
);
12733 return isl_map_free(map
);
12736 /* Compute the preimage of "set" under the function represented by "ma".
12737 * In other words, plug in "ma" in "set". The result is a set
12738 * that lives in the domain space of "ma".
12740 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
12741 __isl_take isl_multi_aff
*ma
)
12743 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
12746 /* Compute the preimage of the domain of "map" under the function
12747 * represented by "ma".
12748 * In other words, plug in "ma" in the domain of "map".
12749 * The result is a map that lives in the same space as "map"
12750 * except that the domain has been replaced by the domain space of "ma".
12752 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
12753 __isl_take isl_multi_aff
*ma
)
12755 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
12758 /* Compute the preimage of the range of "map" under the function
12759 * represented by "ma".
12760 * In other words, plug in "ma" in the range of "map".
12761 * The result is a map that lives in the same space as "map"
12762 * except that the range has been replaced by the domain space of "ma".
12764 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
12765 __isl_take isl_multi_aff
*ma
)
12767 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
12770 /* Compute the preimage of "map" under the function represented by "pma".
12771 * In other words, plug in "pma" in the domain or range of "map".
12772 * The result is a map that lives in the same space as "map",
12773 * except that the space of type "type" has been replaced by
12774 * the domain space of "pma".
12776 * The parameters of "map" and "pma" are assumed to have been aligned.
12778 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
12779 __isl_take isl_map
*map
, enum isl_dim_type type
,
12780 __isl_take isl_pw_multi_aff
*pma
)
12789 isl_pw_multi_aff_free(pma
);
12790 res
= isl_map_empty(isl_map_get_space(map
));
12795 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12796 isl_multi_aff_copy(pma
->p
[0].maff
));
12797 if (type
== isl_dim_in
)
12798 res
= isl_map_intersect_domain(res
,
12799 isl_map_copy(pma
->p
[0].set
));
12801 res
= isl_map_intersect_range(res
,
12802 isl_map_copy(pma
->p
[0].set
));
12804 for (i
= 1; i
< pma
->n
; ++i
) {
12807 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12808 isl_multi_aff_copy(pma
->p
[i
].maff
));
12809 if (type
== isl_dim_in
)
12810 res_i
= isl_map_intersect_domain(res_i
,
12811 isl_map_copy(pma
->p
[i
].set
));
12813 res_i
= isl_map_intersect_range(res_i
,
12814 isl_map_copy(pma
->p
[i
].set
));
12815 res
= isl_map_union(res
, res_i
);
12818 isl_pw_multi_aff_free(pma
);
12822 isl_pw_multi_aff_free(pma
);
12827 /* Compute the preimage of "map" under the function represented by "pma".
12828 * In other words, plug in "pma" in the domain or range of "map".
12829 * The result is a map that lives in the same space as "map",
12830 * except that the space of type "type" has been replaced by
12831 * the domain space of "pma".
12833 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
12834 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
12841 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
12845 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12847 if (isl_map_check_named_params(map
) < 0)
12849 if (!isl_space_has_named_params(pma
->dim
))
12850 isl_die(map
->ctx
, isl_error_invalid
,
12851 "unaligned unnamed parameters", goto error
);
12852 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
12853 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
12855 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12857 isl_pw_multi_aff_free(pma
);
12858 return isl_map_free(map
);
12861 /* Compute the preimage of "set" under the function represented by "pma".
12862 * In other words, plug in "pma" in "set". The result is a set
12863 * that lives in the domain space of "pma".
12865 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
12866 __isl_take isl_pw_multi_aff
*pma
)
12868 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
12871 /* Compute the preimage of the domain of "map" under the function
12872 * represented by "pma".
12873 * In other words, plug in "pma" in the domain of "map".
12874 * The result is a map that lives in the same space as "map",
12875 * except that domain space has been replaced by the domain space of "pma".
12877 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
12878 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12880 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
12883 /* Compute the preimage of the range of "map" under the function
12884 * represented by "pma".
12885 * In other words, plug in "pma" in the range of "map".
12886 * The result is a map that lives in the same space as "map",
12887 * except that range space has been replaced by the domain space of "pma".
12889 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
12890 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12892 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
12895 /* Compute the preimage of "map" under the function represented by "mpa".
12896 * In other words, plug in "mpa" in the domain or range of "map".
12897 * The result is a map that lives in the same space as "map",
12898 * except that the space of type "type" has been replaced by
12899 * the domain space of "mpa".
12901 * If the map does not involve any constraints that refer to the
12902 * dimensions of the substituted space, then the only possible
12903 * effect of "mpa" on the map is to map the space to a different space.
12904 * We create a separate isl_multi_aff to effectuate this change
12905 * in order to avoid spurious splitting of the map along the pieces
12908 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
12909 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
12912 isl_pw_multi_aff
*pma
;
12917 n
= isl_map_dim(map
, type
);
12918 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
12922 space
= isl_multi_pw_aff_get_space(mpa
);
12923 isl_multi_pw_aff_free(mpa
);
12924 ma
= isl_multi_aff_zero(space
);
12925 return isl_map_preimage_multi_aff(map
, type
, ma
);
12928 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
12929 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
12932 isl_multi_pw_aff_free(mpa
);
12936 /* Compute the preimage of "map" under the function represented by "mpa".
12937 * In other words, plug in "mpa" in the domain "map".
12938 * The result is a map that lives in the same space as "map",
12939 * except that domain space has been replaced by the domain space of "mpa".
12941 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
12942 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
12944 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
12947 /* Compute the preimage of "set" by the function represented by "mpa".
12948 * In other words, plug in "mpa" in "set".
12950 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
12951 __isl_take isl_multi_pw_aff
*mpa
)
12953 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
12956 /* Are the "n" "coefficients" starting at "first" of the integer division
12957 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
12959 * The "coefficient" at position 0 is the denominator.
12960 * The "coefficient" at position 1 is the constant term.
12962 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
12963 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
12964 unsigned first
, unsigned n
)
12966 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
12967 return isl_bool_error
;
12968 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
12969 return isl_bool_error
;
12970 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
12971 bmap2
->div
[pos2
] + first
, n
);
12974 /* Are the integer division expressions at position "pos1" in "bmap1" and
12975 * "pos2" in "bmap2" equal to each other, except that the constant terms
12978 isl_bool
isl_basic_map_equal_div_expr_except_constant(
12979 __isl_keep isl_basic_map
*bmap1
, int pos1
,
12980 __isl_keep isl_basic_map
*bmap2
, int pos2
)
12985 if (!bmap1
|| !bmap2
)
12986 return isl_bool_error
;
12987 total
= isl_basic_map_total_dim(bmap1
);
12988 if (total
!= isl_basic_map_total_dim(bmap2
))
12989 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
12990 "incomparable div expressions", return isl_bool_error
);
12991 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
12993 if (equal
< 0 || !equal
)
12995 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
12997 if (equal
< 0 || equal
)
12998 return isl_bool_not(equal
);
12999 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13003 /* Replace the numerator of the constant term of the integer division
13004 * expression at position "div" in "bmap" by "value".
13005 * The caller guarantees that this does not change the meaning
13008 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13009 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13011 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13012 return isl_basic_map_free(bmap
);
13014 isl_int_set_si(bmap
->div
[div
][1], value
);
13019 /* Is the point "inner" internal to inequality constraint "ineq"
13021 * The point is considered to be internal to the inequality constraint,
13022 * if it strictly lies on the positive side of the inequality constraint,
13023 * or if it lies on the constraint and the constraint is lexico-positive.
13025 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13026 __isl_keep isl_basic_set
*bset
, int ineq
)
13032 if (!inner
|| !bset
)
13033 return isl_bool_error
;
13035 ctx
= isl_basic_set_get_ctx(bset
);
13036 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13037 &ctx
->normalize_gcd
);
13038 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13039 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13041 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13042 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13043 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13046 /* Tighten the inequality constraints of "bset" that are outward with respect
13047 * to the point "vec".
13048 * That is, tighten the constraints that are not satisfied by "vec".
13050 * "vec" is a point internal to some superset S of "bset" that is used
13051 * to make the subsets of S disjoint, by tightening one half of the constraints
13052 * that separate two subsets. In particular, the constraints of S
13053 * are all satisfied by "vec" and should not be tightened.
13054 * Of the internal constraints, those that have "vec" on the outside
13055 * are tightened. The shared facet is included in the adjacent subset
13056 * with the opposite constraint.
13057 * For constraints that saturate "vec", this criterion cannot be used
13058 * to determine which of the two sides should be tightened.
13059 * Instead, the sign of the first non-zero coefficient is used
13060 * to make this choice. Note that this second criterion is never used
13061 * on the constraints of S since "vec" is interior to "S".
13063 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13064 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13068 bset
= isl_basic_set_cow(bset
);
13071 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13074 internal
= is_internal(vec
, bset
, j
);
13076 return isl_basic_set_free(bset
);
13079 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);