2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 INRIA Paris
7 * Copyright 2016 Sven Verdoolaege
9 * Use of this software is governed by the MIT license
11 * Written by Sven Verdoolaege, K.U.Leuven, Departement
12 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
14 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
17 * B.P. 105 - 78153 Le Chesnay, France
18 * and Centre de Recherche Inria de Paris, 2 rue Simone Iff - Voie DQ12,
19 * CS 42112, 75589 Paris Cedex 12, France
23 #include <isl_ctx_private.h>
24 #include <isl_map_private.h>
26 #include <isl/constraint.h>
27 #include "isl_space_private.h"
28 #include "isl_equalities.h"
29 #include <isl_lp_private.h>
33 #include <isl_reordering.h>
34 #include "isl_sample.h"
38 #include <isl_mat_private.h>
39 #include <isl_vec_private.h>
40 #include <isl_dim_map.h>
41 #include <isl_local_space_private.h>
42 #include <isl_aff_private.h>
43 #include <isl_options_private.h>
44 #include <isl_morph.h>
45 #include <isl_val_private.h>
46 #include <isl/deprecated/map_int.h>
47 #include <isl/deprecated/set_int.h>
49 #include <bset_to_bmap.c>
50 #include <bset_from_bmap.c>
51 #include <set_to_map.c>
52 #include <set_from_map.c>
54 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
57 case isl_dim_param
: return dim
->nparam
;
58 case isl_dim_in
: return dim
->n_in
;
59 case isl_dim_out
: return dim
->n_out
;
60 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
65 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
68 case isl_dim_param
: return 1;
69 case isl_dim_in
: return 1 + dim
->nparam
;
70 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
75 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
76 enum isl_dim_type type
)
81 case isl_dim_cst
: return 1;
84 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
85 case isl_dim_div
: return bmap
->n_div
;
86 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
91 /* Return the space of "map".
93 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
95 return map
? map
->dim
: NULL
;
98 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
100 return map
? n(map
->dim
, type
) : 0;
103 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
105 return set
? n(set
->dim
, type
) : 0;
108 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
109 enum isl_dim_type type
)
118 case isl_dim_cst
: return 0;
119 case isl_dim_param
: return 1;
120 case isl_dim_in
: return 1 + space
->nparam
;
121 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
122 case isl_dim_div
: return 1 + space
->nparam
+ space
->n_in
+
128 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
129 enum isl_dim_type type
)
131 return isl_basic_map_offset(bset
, type
);
134 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
136 return pos(map
->dim
, type
);
139 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
140 enum isl_dim_type type
)
142 return isl_basic_map_dim(bset
, type
);
145 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
147 return isl_basic_set_dim(bset
, isl_dim_set
);
150 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
152 return isl_basic_set_dim(bset
, isl_dim_param
);
155 unsigned isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
159 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
162 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
164 return isl_set_dim(set
, isl_dim_set
);
167 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
169 return isl_set_dim(set
, isl_dim_param
);
172 unsigned isl_basic_map_n_in(__isl_keep
const isl_basic_map
*bmap
)
174 return bmap
? bmap
->dim
->n_in
: 0;
177 unsigned isl_basic_map_n_out(__isl_keep
const isl_basic_map
*bmap
)
179 return bmap
? bmap
->dim
->n_out
: 0;
182 unsigned isl_basic_map_n_param(__isl_keep
const isl_basic_map
*bmap
)
184 return bmap
? bmap
->dim
->nparam
: 0;
187 unsigned isl_basic_map_n_div(__isl_keep
const isl_basic_map
*bmap
)
189 return bmap
? bmap
->n_div
: 0;
192 unsigned isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
194 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
197 unsigned isl_map_n_in(__isl_keep
const isl_map
*map
)
199 return map
? map
->dim
->n_in
: 0;
202 unsigned isl_map_n_out(__isl_keep
const isl_map
*map
)
204 return map
? map
->dim
->n_out
: 0;
207 unsigned isl_map_n_param(__isl_keep
const isl_map
*map
)
209 return map
? map
->dim
->nparam
: 0;
212 /* Do "bmap1" and "bmap2" have the same parameters?
214 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
215 __isl_keep isl_basic_map
*bmap2
)
217 isl_space
*space1
, *space2
;
219 space1
= isl_basic_map_peek_space(bmap1
);
220 space2
= isl_basic_map_peek_space(bmap2
);
221 return isl_space_has_equal_params(space1
, space2
);
224 /* Do "map1" and "map2" have the same parameters?
226 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
227 __isl_keep isl_map
*map2
)
229 isl_space
*space1
, *space2
;
231 space1
= isl_map_peek_space(map1
);
232 space2
= isl_map_peek_space(map2
);
233 return isl_space_has_equal_params(space1
, space2
);
236 /* Do "map" and "set" have the same parameters?
238 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
239 __isl_keep isl_set
*set
)
241 return isl_map_has_equal_params(map
, set_to_map(set
));
244 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
245 __isl_keep isl_set
*set
)
249 return isl_bool_error
;
250 m
= isl_map_has_equal_params(map
, set_to_map(set
));
253 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
254 set
->dim
, isl_dim_set
);
257 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
258 __isl_keep isl_basic_set
*bset
)
262 return isl_bool_error
;
263 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
266 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
267 bset
->dim
, isl_dim_set
);
270 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
271 __isl_keep isl_set
*set
)
275 return isl_bool_error
;
276 m
= isl_map_has_equal_params(map
, set_to_map(set
));
279 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
280 set
->dim
, isl_dim_set
);
283 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
284 __isl_keep isl_basic_set
*bset
)
288 return isl_bool_error
;
289 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
292 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
293 bset
->dim
, isl_dim_set
);
296 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
298 return bmap
? bmap
->ctx
: NULL
;
301 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
303 return bset
? bset
->ctx
: NULL
;
306 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
308 return map
? map
->ctx
: NULL
;
311 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
313 return set
? set
->ctx
: NULL
;
316 /* Return the space of "bmap".
318 __isl_keep isl_space
*isl_basic_map_peek_space(
319 __isl_keep
const isl_basic_map
*bmap
)
321 return bmap
? bmap
->dim
: NULL
;
324 /* Return the space of "bset".
326 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
328 return isl_basic_map_peek_space(bset_to_bmap(bset
));
331 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
333 return isl_space_copy(isl_basic_map_peek_space(bmap
));
336 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
338 return isl_basic_map_get_space(bset_to_bmap(bset
));
341 /* Extract the divs in "bmap" as a matrix.
343 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
354 ctx
= isl_basic_map_get_ctx(bmap
);
355 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
356 cols
= 1 + 1 + total
+ bmap
->n_div
;
357 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
361 for (i
= 0; i
< bmap
->n_div
; ++i
)
362 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
367 /* Extract the divs in "bset" as a matrix.
369 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
371 return isl_basic_map_get_divs(bset
);
374 __isl_give isl_local_space
*isl_basic_map_get_local_space(
375 __isl_keep isl_basic_map
*bmap
)
382 div
= isl_basic_map_get_divs(bmap
);
383 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
386 __isl_give isl_local_space
*isl_basic_set_get_local_space(
387 __isl_keep isl_basic_set
*bset
)
389 return isl_basic_map_get_local_space(bset
);
392 /* For each known div d = floor(f/m), add the constraints
395 * -(f-(m-1)) + m d >= 0
397 * Do not finalize the result.
399 static __isl_give isl_basic_map
*add_known_div_constraints(
400 __isl_take isl_basic_map
*bmap
)
407 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
410 bmap
= isl_basic_map_cow(bmap
);
411 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
414 for (i
= 0; i
< n_div
; ++i
) {
415 if (isl_int_is_zero(bmap
->div
[i
][0]))
417 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
418 return isl_basic_map_free(bmap
);
424 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
425 __isl_take isl_local_space
*ls
)
434 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
435 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
436 n_div
, 0, 2 * n_div
);
438 for (i
= 0; i
< n_div
; ++i
)
439 if (isl_basic_map_alloc_div(bmap
) < 0)
442 for (i
= 0; i
< n_div
; ++i
)
443 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
444 bmap
= add_known_div_constraints(bmap
);
446 isl_local_space_free(ls
);
449 isl_local_space_free(ls
);
450 isl_basic_map_free(bmap
);
454 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
455 __isl_take isl_local_space
*ls
)
457 return isl_basic_map_from_local_space(ls
);
460 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
462 return isl_space_copy(isl_map_peek_space(map
));
465 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
469 return isl_space_copy(set
->dim
);
472 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
473 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
475 bmap
= isl_basic_map_cow(bmap
);
478 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
481 bmap
= isl_basic_map_finalize(bmap
);
484 isl_basic_map_free(bmap
);
488 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
489 __isl_take isl_basic_set
*bset
, const char *s
)
491 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
494 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
495 enum isl_dim_type type
)
497 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
500 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
501 enum isl_dim_type type
, const char *s
)
505 map
= isl_map_cow(map
);
509 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
513 for (i
= 0; i
< map
->n
; ++i
) {
514 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
525 /* Replace the identifier of the tuple of type "type" by "id".
527 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
528 __isl_take isl_basic_map
*bmap
,
529 enum isl_dim_type type
, __isl_take isl_id
*id
)
531 bmap
= isl_basic_map_cow(bmap
);
534 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
536 return isl_basic_map_free(bmap
);
537 bmap
= isl_basic_map_finalize(bmap
);
544 /* Replace the identifier of the tuple by "id".
546 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
547 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
549 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
552 /* Does the input or output tuple have a name?
554 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
556 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
559 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
560 enum isl_dim_type type
)
562 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
565 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
568 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
572 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
573 enum isl_dim_type type
, __isl_take isl_id
*id
)
575 map
= isl_map_cow(map
);
579 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
581 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
587 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
588 __isl_take isl_id
*id
)
590 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
593 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
594 enum isl_dim_type type
)
596 map
= isl_map_cow(map
);
600 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
602 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
605 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
607 return isl_map_reset_tuple_id(set
, isl_dim_set
);
610 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
612 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
615 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
616 enum isl_dim_type type
)
618 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
621 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
623 return isl_map_has_tuple_id(set
, isl_dim_set
);
626 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
628 return isl_map_get_tuple_id(set
, isl_dim_set
);
631 /* Does the set tuple have a name?
633 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
636 return isl_bool_error
;
637 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
641 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
643 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
646 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
648 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
651 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
652 enum isl_dim_type type
, unsigned pos
)
654 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
657 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
658 enum isl_dim_type type
, unsigned pos
)
660 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
663 /* Does the given dimension have a name?
665 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
666 enum isl_dim_type type
, unsigned pos
)
669 return isl_bool_error
;
670 return isl_space_has_dim_name(map
->dim
, type
, pos
);
673 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
674 enum isl_dim_type type
, unsigned pos
)
676 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
679 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
680 enum isl_dim_type type
, unsigned pos
)
682 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
685 /* Does the given dimension have a name?
687 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
688 enum isl_dim_type type
, unsigned pos
)
691 return isl_bool_error
;
692 return isl_space_has_dim_name(set
->dim
, type
, pos
);
695 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
696 __isl_take isl_basic_map
*bmap
,
697 enum isl_dim_type type
, unsigned pos
, const char *s
)
699 bmap
= isl_basic_map_cow(bmap
);
702 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
705 return isl_basic_map_finalize(bmap
);
707 isl_basic_map_free(bmap
);
711 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
712 enum isl_dim_type type
, unsigned pos
, const char *s
)
716 map
= isl_map_cow(map
);
720 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
724 for (i
= 0; i
< map
->n
; ++i
) {
725 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
736 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
737 __isl_take isl_basic_set
*bset
,
738 enum isl_dim_type type
, unsigned pos
, const char *s
)
740 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
744 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
745 enum isl_dim_type type
, unsigned pos
, const char *s
)
747 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
751 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
752 enum isl_dim_type type
, unsigned pos
)
755 return isl_bool_error
;
756 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
759 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
760 enum isl_dim_type type
, unsigned pos
)
762 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
765 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
766 enum isl_dim_type type
, unsigned pos
)
768 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
771 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
772 enum isl_dim_type type
, unsigned pos
)
774 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
777 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
778 enum isl_dim_type type
, unsigned pos
)
780 return isl_map_has_dim_id(set
, type
, pos
);
783 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
784 enum isl_dim_type type
, unsigned pos
)
786 return isl_map_get_dim_id(set
, type
, pos
);
789 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
790 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
792 map
= isl_map_cow(map
);
796 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
798 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
804 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
805 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
807 return isl_map_set_dim_id(set
, type
, pos
, id
);
810 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
811 __isl_keep isl_id
*id
)
815 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
818 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
819 __isl_keep isl_id
*id
)
821 return isl_map_find_dim_by_id(set
, type
, id
);
824 /* Return the position of the dimension of the given type and name
826 * Return -1 if no such dimension can be found.
828 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
829 enum isl_dim_type type
, const char *name
)
833 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
836 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
841 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
844 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
847 return isl_map_find_dim_by_name(set
, type
, name
);
850 /* Check whether equality i of bset is a pure stride constraint
851 * on a single dimension, i.e., of the form
855 * with k a constant and e an existentially quantified variable.
857 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
866 return isl_bool_error
;
868 if (!isl_int_is_zero(bset
->eq
[i
][0]))
869 return isl_bool_false
;
871 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
872 d
= isl_basic_set_dim(bset
, isl_dim_set
);
873 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
875 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
876 return isl_bool_false
;
877 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
879 return isl_bool_false
;
880 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
882 return isl_bool_false
;
884 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
886 return isl_bool_false
;
887 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
888 n_div
- pos2
- 1) != -1)
889 return isl_bool_false
;
890 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
891 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
892 return isl_bool_false
;
894 return isl_bool_true
;
897 /* Reset the user pointer on all identifiers of parameters and tuples
898 * of the space of "map".
900 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
904 space
= isl_map_get_space(map
);
905 space
= isl_space_reset_user(space
);
906 map
= isl_map_reset_space(map
, space
);
911 /* Reset the user pointer on all identifiers of parameters and tuples
912 * of the space of "set".
914 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
916 return isl_map_reset_user(set
);
919 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
922 return isl_bool_error
;
923 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
926 /* Has "map" been marked as a rational map?
927 * In particular, have all basic maps in "map" been marked this way?
928 * An empty map is not considered to be rational.
929 * Maps where only some of the basic maps are marked rational
932 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
938 return isl_bool_error
;
940 return isl_bool_false
;
941 rational
= isl_basic_map_is_rational(map
->p
[0]);
944 for (i
= 1; i
< map
->n
; ++i
) {
947 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
950 if (rational
!= rational_i
)
951 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
952 "mixed rational and integer basic maps "
953 "not supported", return isl_bool_error
);
959 /* Has "set" been marked as a rational set?
960 * In particular, have all basic set in "set" been marked this way?
961 * An empty set is not considered to be rational.
962 * Sets where only some of the basic sets are marked rational
965 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
967 return isl_map_is_rational(set
);
970 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
972 return isl_basic_map_is_rational(bset
);
975 /* Does "bmap" contain any rational points?
977 * If "bmap" has an equality for each dimension, equating the dimension
978 * to an integer constant, then it has no rational points, even if it
979 * is marked as rational.
981 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
983 isl_bool has_rational
= isl_bool_true
;
987 return isl_bool_error
;
988 if (isl_basic_map_plain_is_empty(bmap
))
989 return isl_bool_false
;
990 if (!isl_basic_map_is_rational(bmap
))
991 return isl_bool_false
;
992 bmap
= isl_basic_map_copy(bmap
);
993 bmap
= isl_basic_map_implicit_equalities(bmap
);
995 return isl_bool_error
;
996 total
= isl_basic_map_total_dim(bmap
);
997 if (bmap
->n_eq
== total
) {
999 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1000 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1003 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1004 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1006 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1011 if (i
== bmap
->n_eq
)
1012 has_rational
= isl_bool_false
;
1014 isl_basic_map_free(bmap
);
1016 return has_rational
;
1019 /* Does "map" contain any rational points?
1021 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1024 isl_bool has_rational
;
1027 return isl_bool_error
;
1028 for (i
= 0; i
< map
->n
; ++i
) {
1029 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1030 if (has_rational
< 0 || has_rational
)
1031 return has_rational
;
1033 return isl_bool_false
;
1036 /* Does "set" contain any rational points?
1038 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1040 return isl_map_has_rational(set
);
1043 /* Is this basic set a parameter domain?
1045 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1048 return isl_bool_error
;
1049 return isl_space_is_params(bset
->dim
);
1052 /* Is this set a parameter domain?
1054 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1057 return isl_bool_error
;
1058 return isl_space_is_params(set
->dim
);
1061 /* Is this map actually a parameter domain?
1062 * Users should never call this function. Outside of isl,
1063 * a map can never be a parameter domain.
1065 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1068 return isl_bool_error
;
1069 return isl_space_is_params(map
->dim
);
1072 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
1073 struct isl_basic_map
*bmap
, unsigned extra
,
1074 unsigned n_eq
, unsigned n_ineq
)
1077 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
1082 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1083 if (isl_blk_is_error(bmap
->block
))
1086 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1087 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1091 bmap
->block2
= isl_blk_empty();
1094 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1095 if (isl_blk_is_error(bmap
->block2
))
1098 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1103 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1104 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1106 for (i
= 0; i
< extra
; ++i
)
1107 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1111 bmap
->c_size
= n_eq
+ n_ineq
;
1112 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1113 bmap
->extra
= extra
;
1117 bmap
->sample
= NULL
;
1121 isl_basic_map_free(bmap
);
1125 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1126 unsigned nparam
, unsigned dim
, unsigned extra
,
1127 unsigned n_eq
, unsigned n_ineq
)
1129 struct isl_basic_map
*bmap
;
1132 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1136 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1137 return bset_from_bmap(bmap
);
1140 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1141 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1143 struct isl_basic_map
*bmap
;
1146 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1147 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1148 return bset_from_bmap(bmap
);
1150 isl_space_free(dim
);
1154 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1155 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1157 struct isl_basic_map
*bmap
;
1161 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1166 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1168 isl_space_free(dim
);
1172 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1173 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1174 unsigned n_eq
, unsigned n_ineq
)
1176 struct isl_basic_map
*bmap
;
1179 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1183 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1187 static void dup_constraints(
1188 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1191 unsigned total
= isl_basic_map_total_dim(src
);
1193 for (i
= 0; i
< src
->n_eq
; ++i
) {
1194 int j
= isl_basic_map_alloc_equality(dst
);
1195 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1198 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1199 int j
= isl_basic_map_alloc_inequality(dst
);
1200 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1203 for (i
= 0; i
< src
->n_div
; ++i
) {
1204 int j
= isl_basic_map_alloc_div(dst
);
1205 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1207 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1210 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1212 struct isl_basic_map
*dup
;
1216 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1217 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1220 dup_constraints(dup
, bmap
);
1221 dup
->flags
= bmap
->flags
;
1222 dup
->sample
= isl_vec_copy(bmap
->sample
);
1226 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1228 struct isl_basic_map
*dup
;
1230 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1231 return bset_from_bmap(dup
);
1234 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1239 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1243 return isl_basic_set_dup(bset
);
1246 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1255 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1260 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1264 bmap
= isl_basic_map_dup(bmap
);
1266 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1270 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1279 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1284 if (--bmap
->ref
> 0)
1287 isl_ctx_deref(bmap
->ctx
);
1289 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1291 isl_blk_free(bmap
->ctx
, bmap
->block
);
1292 isl_vec_free(bmap
->sample
);
1293 isl_space_free(bmap
->dim
);
1299 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1301 return isl_basic_map_free(bset_to_bmap(bset
));
1304 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1306 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1309 /* Check that "map" has only named parameters, reporting an error
1312 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1314 return isl_space_check_named_params(isl_map_peek_space(map
));
1317 /* Check that "bmap1" and "bmap2" have the same parameters,
1318 * reporting an error if they do not.
1320 static isl_stat
isl_basic_map_check_equal_params(
1321 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1325 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1327 return isl_stat_error
;
1329 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1330 "parameters don't match", return isl_stat_error
);
1334 __isl_give isl_map
*isl_map_align_params_map_map_and(
1335 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1336 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1337 __isl_take isl_map
*map2
))
1341 if (isl_map_has_equal_params(map1
, map2
))
1342 return fn(map1
, map2
);
1343 if (isl_map_check_named_params(map1
) < 0)
1345 if (isl_map_check_named_params(map2
) < 0)
1347 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1348 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1349 return fn(map1
, map2
);
1356 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1357 __isl_keep isl_map
*map2
,
1358 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1363 return isl_bool_error
;
1364 if (isl_map_has_equal_params(map1
, map2
))
1365 return fn(map1
, map2
);
1366 if (isl_map_check_named_params(map1
) < 0)
1367 return isl_bool_error
;
1368 if (isl_map_check_named_params(map2
) < 0)
1369 return isl_bool_error
;
1370 map1
= isl_map_copy(map1
);
1371 map2
= isl_map_copy(map2
);
1372 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1373 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1380 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1382 struct isl_ctx
*ctx
;
1386 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1387 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1389 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1390 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1391 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1392 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1393 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1394 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1396 int j
= isl_basic_map_alloc_inequality(bmap
);
1400 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1401 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1408 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1409 bmap
->extra
- bmap
->n_div
);
1410 return bmap
->n_eq
++;
1413 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1415 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1418 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1422 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1427 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1429 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1432 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1437 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1439 if (pos
!= bmap
->n_eq
- 1) {
1441 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1442 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1448 /* Turn inequality "pos" of "bmap" into an equality.
1450 * In particular, we move the inequality in front of the equalities
1451 * and move the last inequality in the position of the moved inequality.
1452 * Note that isl_tab_make_equalities_explicit depends on this particular
1453 * change in the ordering of the constraints.
1455 void isl_basic_map_inequality_to_equality(
1456 struct isl_basic_map
*bmap
, unsigned pos
)
1460 t
= bmap
->ineq
[pos
];
1461 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1462 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1467 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1468 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1469 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1470 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1473 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1475 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1478 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1480 struct isl_ctx
*ctx
;
1484 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1485 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1486 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1487 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1488 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1489 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1490 1 + isl_basic_map_total_dim(bmap
),
1491 bmap
->extra
- bmap
->n_div
);
1492 return bmap
->n_ineq
++;
1495 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1497 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1500 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1504 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1509 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1511 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1514 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1519 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1521 if (pos
!= bmap
->n_ineq
- 1) {
1522 t
= bmap
->ineq
[pos
];
1523 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1524 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1525 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1531 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1533 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1536 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1541 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1544 k
= isl_basic_map_alloc_equality(bmap
);
1547 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1550 isl_basic_map_free(bmap
);
1554 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1557 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1560 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1565 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1568 k
= isl_basic_map_alloc_inequality(bmap
);
1571 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1574 isl_basic_map_free(bmap
);
1578 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1581 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1584 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1588 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1589 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1590 1 + 1 + isl_basic_map_total_dim(bmap
),
1591 bmap
->extra
- bmap
->n_div
);
1592 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1593 return bmap
->n_div
++;
1596 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1598 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1601 /* Check that there are "n" dimensions of type "type" starting at "first"
1604 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1605 enum isl_dim_type type
, unsigned first
, unsigned n
)
1610 return isl_stat_error
;
1611 dim
= isl_basic_map_dim(bmap
, type
);
1612 if (first
+ n
> dim
|| first
+ n
< first
)
1613 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1614 "position or range out of bounds",
1615 return isl_stat_error
);
1619 /* Insert an extra integer division, prescribed by "div", to "bmap"
1620 * at (integer division) position "pos".
1622 * The integer division is first added at the end and then moved
1623 * into the right position.
1625 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1626 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1630 bmap
= isl_basic_map_cow(bmap
);
1632 return isl_basic_map_free(bmap
);
1634 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1635 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1636 "unexpected size", return isl_basic_map_free(bmap
));
1637 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1638 return isl_basic_map_free(bmap
);
1640 bmap
= isl_basic_map_extend_space(bmap
,
1641 isl_basic_map_get_space(bmap
), 1, 0, 2);
1642 k
= isl_basic_map_alloc_div(bmap
);
1644 return isl_basic_map_free(bmap
);
1645 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1646 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1648 for (i
= k
; i
> pos
; --i
)
1649 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1654 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1657 return isl_stat_error
;
1658 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1663 /* Copy constraint from src to dst, putting the vars of src at offset
1664 * dim_off in dst and the divs of src at offset div_off in dst.
1665 * If both sets are actually map, then dim_off applies to the input
1668 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1669 struct isl_basic_map
*src_map
, isl_int
*src
,
1670 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1672 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1673 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1674 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1675 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1676 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1677 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1678 isl_int_set(dst
[0], src
[0]);
1679 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1680 if (dst_nparam
> src_nparam
)
1681 isl_seq_clr(dst
+1+src_nparam
,
1682 dst_nparam
- src_nparam
);
1683 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1684 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1686 isl_min(dst_in
-in_off
, src_in
));
1687 if (dst_in
-in_off
> src_in
)
1688 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1689 dst_in
- in_off
- src_in
);
1690 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1691 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1692 src
+1+src_nparam
+src_in
,
1693 isl_min(dst_out
-out_off
, src_out
));
1694 if (dst_out
-out_off
> src_out
)
1695 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1696 dst_out
- out_off
- src_out
);
1697 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1698 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1699 src
+1+src_nparam
+src_in
+src_out
,
1700 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1701 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1702 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1703 div_off
+src_map
->n_div
,
1704 dst_map
->n_div
- div_off
- src_map
->n_div
);
1707 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1708 struct isl_basic_map
*src_map
, isl_int
*src
,
1709 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1711 isl_int_set(dst
[0], src
[0]);
1712 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1715 static __isl_give isl_basic_map
*add_constraints(
1716 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1717 unsigned i_pos
, unsigned o_pos
)
1722 if (!bmap1
|| !bmap2
)
1725 div_off
= bmap1
->n_div
;
1727 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1728 int i1
= isl_basic_map_alloc_equality(bmap1
);
1731 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1732 i_pos
, o_pos
, div_off
);
1735 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1736 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1739 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1740 i_pos
, o_pos
, div_off
);
1743 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1744 int i1
= isl_basic_map_alloc_div(bmap1
);
1747 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1748 i_pos
, o_pos
, div_off
);
1751 isl_basic_map_free(bmap2
);
1756 isl_basic_map_free(bmap1
);
1757 isl_basic_map_free(bmap2
);
1761 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1762 struct isl_basic_set
*bset2
, unsigned pos
)
1764 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1765 bset_to_bmap(bset2
), 0, pos
));
1768 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1769 __isl_take isl_basic_map
*base
, __isl_take isl_space
*dim
,
1770 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1772 struct isl_basic_map
*ext
;
1782 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1783 base
->extra
>= base
->n_div
+ extra
;
1785 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1786 room_for_ineq(base
, n_ineq
)) {
1787 isl_space_free(dim
);
1791 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1792 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1793 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1794 extra
+= base
->extra
;
1796 n_ineq
+= base
->n_ineq
;
1798 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1804 ext
->sample
= isl_vec_copy(base
->sample
);
1805 flags
= base
->flags
;
1806 ext
= add_constraints(ext
, base
, 0, 0);
1809 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1815 isl_space_free(dim
);
1816 isl_basic_map_free(base
);
1820 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1821 __isl_take isl_space
*dim
, unsigned extra
,
1822 unsigned n_eq
, unsigned n_ineq
)
1824 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1825 dim
, extra
, n_eq
, n_ineq
));
1828 struct isl_basic_map
*isl_basic_map_extend_constraints(
1829 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1833 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1837 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1838 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1839 unsigned n_eq
, unsigned n_ineq
)
1841 struct isl_basic_map
*bmap
;
1846 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1850 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1853 isl_basic_map_free(base
);
1857 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1858 unsigned nparam
, unsigned dim
, unsigned extra
,
1859 unsigned n_eq
, unsigned n_ineq
)
1861 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1862 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1865 struct isl_basic_set
*isl_basic_set_extend_constraints(
1866 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1868 isl_basic_map
*bmap
= bset_to_bmap(base
);
1869 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1870 return bset_from_bmap(bmap
);
1873 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1875 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1878 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1883 if (bmap
->ref
> 1) {
1885 bmap
= isl_basic_map_dup(bmap
);
1888 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1889 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1894 /* Clear all cached information in "map", either because it is about
1895 * to be modified or because it is being freed.
1896 * Always return the same pointer that is passed in.
1897 * This is needed for the use in isl_map_free.
1899 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1901 isl_basic_map_free(map
->cached_simple_hull
[0]);
1902 isl_basic_map_free(map
->cached_simple_hull
[1]);
1903 map
->cached_simple_hull
[0] = NULL
;
1904 map
->cached_simple_hull
[1] = NULL
;
1908 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1910 return isl_map_cow(set
);
1913 /* Return an isl_map that is equal to "map" and that has only
1914 * a single reference.
1916 * If the original input already has only one reference, then
1917 * simply return it, but clear all cached information, since
1918 * it may be rendered invalid by the operations that will be
1919 * performed on the result.
1921 * Otherwise, create a duplicate (without any cached information).
1923 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1929 return clear_caches(map
);
1931 return isl_map_dup(map
);
1934 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1935 unsigned a_len
, unsigned b_len
)
1937 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1938 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1939 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1942 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1943 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1951 isl_assert(bmap
->ctx
,
1952 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1954 if (n1
== 0 || n2
== 0)
1957 bmap
= isl_basic_map_cow(bmap
);
1961 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1962 if (isl_blk_is_error(blk
))
1965 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1967 bmap
->eq
[i
] + pos
, n1
, n2
);
1969 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1971 bmap
->ineq
[i
] + pos
, n1
, n2
);
1973 for (i
= 0; i
< bmap
->n_div
; ++i
)
1975 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1977 isl_blk_free(bmap
->ctx
, blk
);
1979 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1980 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1981 return isl_basic_map_finalize(bmap
);
1983 isl_basic_map_free(bmap
);
1987 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
1988 __isl_take isl_basic_map
*bmap
)
1994 total
= isl_basic_map_total_dim(bmap
);
1995 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
1996 return isl_basic_map_free(bmap
);
1997 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1999 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2001 i
= isl_basic_map_alloc_equality(bmap
);
2005 isl_int_set_si(bmap
->eq
[i
][0], 1);
2006 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2007 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2008 isl_vec_free(bmap
->sample
);
2009 bmap
->sample
= NULL
;
2010 return isl_basic_map_finalize(bmap
);
2012 isl_basic_map_free(bmap
);
2016 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
2018 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2021 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2022 __isl_take isl_basic_map
*bmap
)
2027 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2030 bmap
= isl_basic_map_cow(bmap
);
2034 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2036 return isl_basic_map_finalize(bmap
);
2039 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2040 __isl_take isl_basic_set
*bset
)
2042 return isl_basic_map_set_rational(bset
);
2045 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2046 __isl_take isl_basic_set
*bset
)
2051 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2054 bset
= isl_basic_set_cow(bset
);
2058 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2060 return isl_basic_set_finalize(bset
);
2063 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2067 map
= isl_map_cow(map
);
2070 for (i
= 0; i
< map
->n
; ++i
) {
2071 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2081 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2083 return isl_map_set_rational(set
);
2086 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2089 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2091 isl_int
*t
= bmap
->div
[a
];
2092 bmap
->div
[a
] = bmap
->div
[b
];
2096 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2097 * div definitions accordingly.
2099 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
2102 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2104 swap_div(bmap
, a
, b
);
2106 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2107 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2109 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2110 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2112 for (i
= 0; i
< bmap
->n_div
; ++i
)
2113 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2114 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2117 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
2118 * div definitions accordingly.
2120 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
2122 isl_basic_map_swap_div(bset
, a
, b
);
2125 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2127 isl_seq_cpy(c
, c
+ n
, rem
);
2128 isl_seq_clr(c
+ rem
, n
);
2131 /* Drop n dimensions starting at first.
2133 * In principle, this frees up some extra variables as the number
2134 * of columns remains constant, but we would have to extend
2135 * the div array too as the number of rows in this array is assumed
2136 * to be equal to extra.
2138 struct isl_basic_set
*isl_basic_set_drop_dims(
2139 struct isl_basic_set
*bset
, unsigned first
, unsigned n
)
2141 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2144 /* Move "n" divs starting at "first" to the end of the list of divs.
2146 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2147 unsigned first
, unsigned n
)
2152 if (first
+ n
== bmap
->n_div
)
2155 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2158 for (i
= 0; i
< n
; ++i
)
2159 div
[i
] = bmap
->div
[first
+ i
];
2160 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2161 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2162 for (i
= 0; i
< n
; ++i
)
2163 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2167 isl_basic_map_free(bmap
);
2171 /* Drop "n" dimensions of type "type" starting at "first".
2173 * In principle, this frees up some extra variables as the number
2174 * of columns remains constant, but we would have to extend
2175 * the div array too as the number of rows in this array is assumed
2176 * to be equal to extra.
2178 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2179 enum isl_dim_type type
, unsigned first
, unsigned n
)
2189 dim
= isl_basic_map_dim(bmap
, type
);
2190 isl_assert(bmap
->ctx
, first
+ n
<= dim
, goto error
);
2192 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2195 bmap
= isl_basic_map_cow(bmap
);
2199 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2200 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2201 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2202 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2204 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2205 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2207 for (i
= 0; i
< bmap
->n_div
; ++i
)
2208 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2210 if (type
== isl_dim_div
) {
2211 bmap
= move_divs_last(bmap
, first
, n
);
2214 if (isl_basic_map_free_div(bmap
, n
) < 0)
2215 return isl_basic_map_free(bmap
);
2217 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2221 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2222 bmap
= isl_basic_map_simplify(bmap
);
2223 return isl_basic_map_finalize(bmap
);
2225 isl_basic_map_free(bmap
);
2229 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2230 enum isl_dim_type type
, unsigned first
, unsigned n
)
2232 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2236 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2237 enum isl_dim_type type
, unsigned first
, unsigned n
)
2244 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2246 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2248 map
= isl_map_cow(map
);
2251 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2255 for (i
= 0; i
< map
->n
; ++i
) {
2256 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2260 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2268 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2269 enum isl_dim_type type
, unsigned first
, unsigned n
)
2271 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2275 * We don't cow, as the div is assumed to be redundant.
2277 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2278 __isl_take isl_basic_map
*bmap
, unsigned div
)
2286 pos
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + div
;
2288 isl_assert(bmap
->ctx
, div
< bmap
->n_div
, goto error
);
2290 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2291 constraint_drop_vars(bmap
->eq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2293 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2294 if (!isl_int_is_zero(bmap
->ineq
[i
][pos
])) {
2295 isl_basic_map_drop_inequality(bmap
, i
);
2299 constraint_drop_vars(bmap
->ineq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2302 for (i
= 0; i
< bmap
->n_div
; ++i
)
2303 constraint_drop_vars(bmap
->div
[i
]+1+pos
, 1, bmap
->extra
-div
-1);
2305 if (div
!= bmap
->n_div
- 1) {
2307 isl_int
*t
= bmap
->div
[div
];
2309 for (j
= div
; j
< bmap
->n_div
- 1; ++j
)
2310 bmap
->div
[j
] = bmap
->div
[j
+1];
2312 bmap
->div
[bmap
->n_div
- 1] = t
;
2314 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2315 if (isl_basic_map_free_div(bmap
, 1) < 0)
2316 return isl_basic_map_free(bmap
);
2320 isl_basic_map_free(bmap
);
2324 /* Eliminate the specified n dimensions starting at first from the
2325 * constraints, without removing the dimensions from the space.
2326 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2328 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2329 enum isl_dim_type type
, unsigned first
, unsigned n
)
2338 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2339 isl_die(map
->ctx
, isl_error_invalid
,
2340 "index out of bounds", goto error
);
2342 map
= isl_map_cow(map
);
2346 for (i
= 0; i
< map
->n
; ++i
) {
2347 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2357 /* Eliminate the specified n dimensions starting at first from the
2358 * constraints, without removing the dimensions from the space.
2359 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2361 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2362 enum isl_dim_type type
, unsigned first
, unsigned n
)
2364 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2367 /* Eliminate the specified n dimensions starting at first from the
2368 * constraints, without removing the dimensions from the space.
2369 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2371 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2372 unsigned first
, unsigned n
)
2374 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2377 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2378 __isl_take isl_basic_map
*bmap
)
2382 bmap
= isl_basic_map_eliminate_vars(bmap
,
2383 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2387 return isl_basic_map_finalize(bmap
);
2390 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2391 __isl_take isl_basic_set
*bset
)
2393 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2396 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2405 map
= isl_map_cow(map
);
2409 for (i
= 0; i
< map
->n
; ++i
) {
2410 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2420 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2422 return isl_map_remove_divs(set
);
2425 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2426 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2427 unsigned first
, unsigned n
)
2429 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2430 return isl_basic_map_free(bmap
);
2431 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2433 bmap
= isl_basic_map_eliminate_vars(bmap
,
2434 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2437 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2439 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2443 /* Return true if the definition of the given div (recursively) involves
2444 * any of the given variables.
2446 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2447 unsigned first
, unsigned n
)
2450 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2452 if (isl_int_is_zero(bmap
->div
[div
][0]))
2453 return isl_bool_false
;
2454 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2455 return isl_bool_true
;
2457 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2460 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2462 involves
= div_involves_vars(bmap
, i
, first
, n
);
2463 if (involves
< 0 || involves
)
2467 return isl_bool_false
;
2470 /* Try and add a lower and/or upper bound on "div" to "bmap"
2471 * based on inequality "i".
2472 * "total" is the total number of variables (excluding the divs).
2473 * "v" is a temporary object that can be used during the calculations.
2474 * If "lb" is set, then a lower bound should be constructed.
2475 * If "ub" is set, then an upper bound should be constructed.
2477 * The calling function has already checked that the inequality does not
2478 * reference "div", but we still need to check that the inequality is
2479 * of the right form. We'll consider the case where we want to construct
2480 * a lower bound. The construction of upper bounds is similar.
2482 * Let "div" be of the form
2484 * q = floor((a + f(x))/d)
2486 * We essentially check if constraint "i" is of the form
2490 * so that we can use it to derive a lower bound on "div".
2491 * However, we allow a slightly more general form
2495 * with the condition that the coefficients of g(x) - f(x) are all
2497 * Rewriting this constraint as
2501 * adding a + f(x) to both sides and dividing by d, we obtain
2503 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2505 * Taking the floor on both sides, we obtain
2507 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2511 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2513 * In the case of an upper bound, we construct the constraint
2515 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2518 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2519 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2520 unsigned total
, isl_int v
, int lb
, int ub
)
2524 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2526 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2527 bmap
->div
[div
][1 + 1 + j
]);
2528 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2531 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2532 bmap
->div
[div
][1 + 1 + j
]);
2533 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2539 bmap
= isl_basic_map_cow(bmap
);
2540 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2542 int k
= isl_basic_map_alloc_inequality(bmap
);
2545 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2546 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2547 bmap
->div
[div
][1 + j
]);
2548 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2549 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2551 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2554 int k
= isl_basic_map_alloc_inequality(bmap
);
2557 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2558 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2559 bmap
->div
[div
][1 + j
]);
2560 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2561 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2563 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2566 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2569 isl_basic_map_free(bmap
);
2573 /* This function is called right before "div" is eliminated from "bmap"
2574 * using Fourier-Motzkin.
2575 * Look through the constraints of "bmap" for constraints on the argument
2576 * of the integer division and use them to construct constraints on the
2577 * integer division itself. These constraints can then be combined
2578 * during the Fourier-Motzkin elimination.
2579 * Note that it is only useful to introduce lower bounds on "div"
2580 * if "bmap" already contains upper bounds on "div" as the newly
2581 * introduce lower bounds can then be combined with the pre-existing
2582 * upper bounds. Similarly for upper bounds.
2583 * We therefore first check if "bmap" contains any lower and/or upper bounds
2586 * It is interesting to note that the introduction of these constraints
2587 * can indeed lead to more accurate results, even when compared to
2588 * deriving constraints on the argument of "div" from constraints on "div".
2589 * Consider, for example, the set
2591 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2593 * The second constraint can be rewritten as
2595 * 2 * [(-i-2j+3)/4] + k >= 0
2597 * from which we can derive
2599 * -i - 2j + 3 >= -2k
2605 * Combined with the first constraint, we obtain
2607 * -3 <= 3 + 2k or k >= -3
2609 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2610 * the first constraint, we obtain
2612 * [(i + 2j)/4] >= [-3/4] = -1
2614 * Combining this constraint with the second constraint, we obtain
2618 static __isl_give isl_basic_map
*insert_bounds_on_div(
2619 __isl_take isl_basic_map
*bmap
, int div
)
2622 int check_lb
, check_ub
;
2629 if (isl_int_is_zero(bmap
->div
[div
][0]))
2632 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2636 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2637 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2644 if (!check_lb
&& !check_ub
)
2649 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2650 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2653 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2654 check_lb
, check_ub
);
2662 /* Remove all divs (recursively) involving any of the given dimensions
2663 * in their definitions.
2665 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2666 __isl_take isl_basic_map
*bmap
,
2667 enum isl_dim_type type
, unsigned first
, unsigned n
)
2671 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2672 return isl_basic_map_free(bmap
);
2673 first
+= isl_basic_map_offset(bmap
, type
);
2675 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2678 involves
= div_involves_vars(bmap
, i
, first
, n
);
2680 return isl_basic_map_free(bmap
);
2683 bmap
= insert_bounds_on_div(bmap
, i
);
2684 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2693 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2694 __isl_take isl_basic_set
*bset
,
2695 enum isl_dim_type type
, unsigned first
, unsigned n
)
2697 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2700 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2701 enum isl_dim_type type
, unsigned first
, unsigned n
)
2710 map
= isl_map_cow(map
);
2714 for (i
= 0; i
< map
->n
; ++i
) {
2715 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2726 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2727 enum isl_dim_type type
, unsigned first
, unsigned n
)
2729 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2733 /* Does the description of "bmap" depend on the specified dimensions?
2734 * We also check whether the dimensions appear in any of the div definitions.
2735 * In principle there is no need for this check. If the dimensions appear
2736 * in a div definition, they also appear in the defining constraints of that
2739 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2740 enum isl_dim_type type
, unsigned first
, unsigned n
)
2744 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2745 return isl_bool_error
;
2747 first
+= isl_basic_map_offset(bmap
, type
);
2748 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2749 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2750 return isl_bool_true
;
2751 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2752 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2753 return isl_bool_true
;
2754 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2755 if (isl_int_is_zero(bmap
->div
[i
][0]))
2757 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2758 return isl_bool_true
;
2761 return isl_bool_false
;
2764 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2765 enum isl_dim_type type
, unsigned first
, unsigned n
)
2770 return isl_bool_error
;
2772 if (first
+ n
> isl_map_dim(map
, type
))
2773 isl_die(map
->ctx
, isl_error_invalid
,
2774 "index out of bounds", return isl_bool_error
);
2776 for (i
= 0; i
< map
->n
; ++i
) {
2777 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2779 if (involves
< 0 || involves
)
2783 return isl_bool_false
;
2786 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2787 enum isl_dim_type type
, unsigned first
, unsigned n
)
2789 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2792 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2793 enum isl_dim_type type
, unsigned first
, unsigned n
)
2795 return isl_map_involves_dims(set
, type
, first
, n
);
2798 /* Drop all constraints in bmap that involve any of the dimensions
2799 * first to first+n-1.
2801 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2802 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2809 bmap
= isl_basic_map_cow(bmap
);
2814 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2815 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2817 isl_basic_map_drop_equality(bmap
, i
);
2820 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2821 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2823 isl_basic_map_drop_inequality(bmap
, i
);
2826 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2830 /* Drop all constraints in bset that involve any of the dimensions
2831 * first to first+n-1.
2833 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2834 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2836 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2839 /* Drop all constraints in bmap that do not involve any of the dimensions
2840 * first to first + n - 1 of the given type.
2842 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2843 __isl_take isl_basic_map
*bmap
,
2844 enum isl_dim_type type
, unsigned first
, unsigned n
)
2849 isl_space
*space
= isl_basic_map_get_space(bmap
);
2850 isl_basic_map_free(bmap
);
2851 return isl_basic_map_universe(space
);
2853 bmap
= isl_basic_map_cow(bmap
);
2857 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2858 return isl_basic_map_free(bmap
);
2860 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2862 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2863 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2865 isl_basic_map_drop_equality(bmap
, i
);
2868 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2869 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2871 isl_basic_map_drop_inequality(bmap
, i
);
2874 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2878 /* Drop all constraints in bset that do not involve any of the dimensions
2879 * first to first + n - 1 of the given type.
2881 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2882 __isl_take isl_basic_set
*bset
,
2883 enum isl_dim_type type
, unsigned first
, unsigned n
)
2885 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2889 /* Drop all constraints in bmap that involve any of the dimensions
2890 * first to first + n - 1 of the given type.
2892 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2893 __isl_take isl_basic_map
*bmap
,
2894 enum isl_dim_type type
, unsigned first
, unsigned n
)
2901 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2902 return isl_basic_map_free(bmap
);
2904 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2905 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2906 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2909 /* Drop all constraints in bset that involve any of the dimensions
2910 * first to first + n - 1 of the given type.
2912 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2913 __isl_take isl_basic_set
*bset
,
2914 enum isl_dim_type type
, unsigned first
, unsigned n
)
2916 return isl_basic_map_drop_constraints_involving_dims(bset
,
2920 /* Drop constraints from "map" by applying "drop" to each basic map.
2922 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2923 enum isl_dim_type type
, unsigned first
, unsigned n
,
2924 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2925 enum isl_dim_type type
, unsigned first
, unsigned n
))
2933 dim
= isl_map_dim(map
, type
);
2934 if (first
+ n
> dim
|| first
+ n
< first
)
2935 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2936 "index out of bounds", return isl_map_free(map
));
2938 map
= isl_map_cow(map
);
2942 for (i
= 0; i
< map
->n
; ++i
) {
2943 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
2945 return isl_map_free(map
);
2949 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2954 /* Drop all constraints in map that involve any of the dimensions
2955 * first to first + n - 1 of the given type.
2957 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
2958 __isl_take isl_map
*map
,
2959 enum isl_dim_type type
, unsigned first
, unsigned n
)
2963 return drop_constraints(map
, type
, first
, n
,
2964 &isl_basic_map_drop_constraints_involving_dims
);
2967 /* Drop all constraints in "map" that do not involve any of the dimensions
2968 * first to first + n - 1 of the given type.
2970 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
2971 __isl_take isl_map
*map
,
2972 enum isl_dim_type type
, unsigned first
, unsigned n
)
2975 isl_space
*space
= isl_map_get_space(map
);
2977 return isl_map_universe(space
);
2979 return drop_constraints(map
, type
, first
, n
,
2980 &isl_basic_map_drop_constraints_not_involving_dims
);
2983 /* Drop all constraints in set that involve any of the dimensions
2984 * first to first + n - 1 of the given type.
2986 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
2987 __isl_take isl_set
*set
,
2988 enum isl_dim_type type
, unsigned first
, unsigned n
)
2990 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
2993 /* Drop all constraints in "set" that do not involve any of the dimensions
2994 * first to first + n - 1 of the given type.
2996 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
2997 __isl_take isl_set
*set
,
2998 enum isl_dim_type type
, unsigned first
, unsigned n
)
3000 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3003 /* Does local variable "div" of "bmap" have a complete explicit representation?
3004 * Having a complete explicit representation requires not only
3005 * an explicit representation, but also that all local variables
3006 * that appear in this explicit representation in turn have
3007 * a complete explicit representation.
3009 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3012 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3015 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3016 if (marked
< 0 || marked
)
3017 return isl_bool_not(marked
);
3019 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3022 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3024 known
= isl_basic_map_div_is_known(bmap
, i
);
3025 if (known
< 0 || !known
)
3029 return isl_bool_true
;
3032 /* Remove all divs that are unknown or defined in terms of unknown divs.
3034 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3035 __isl_take isl_basic_map
*bmap
)
3042 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3043 if (isl_basic_map_div_is_known(bmap
, i
))
3045 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3054 /* Remove all divs that are unknown or defined in terms of unknown divs.
3056 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3057 __isl_take isl_basic_set
*bset
)
3059 return isl_basic_map_remove_unknown_divs(bset
);
3062 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3071 map
= isl_map_cow(map
);
3075 for (i
= 0; i
< map
->n
; ++i
) {
3076 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3086 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3088 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3091 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3092 __isl_take isl_basic_set
*bset
,
3093 enum isl_dim_type type
, unsigned first
, unsigned n
)
3095 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3096 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3097 return bset_from_bmap(bmap
);
3100 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3101 enum isl_dim_type type
, unsigned first
, unsigned n
)
3108 map
= isl_map_cow(map
);
3111 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3113 for (i
= 0; i
< map
->n
; ++i
) {
3114 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3115 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3119 map
= isl_map_drop(map
, type
, first
, n
);
3126 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3127 enum isl_dim_type type
, unsigned first
, unsigned n
)
3129 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3133 /* Project out n inputs starting at first using Fourier-Motzkin */
3134 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3135 unsigned first
, unsigned n
)
3137 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3140 static void dump_term(struct isl_basic_map
*bmap
,
3141 isl_int c
, int pos
, FILE *out
)
3144 unsigned in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3145 unsigned dim
= in
+ isl_basic_map_dim(bmap
, isl_dim_out
);
3146 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3148 isl_int_print(out
, c
, 0);
3150 if (!isl_int_is_one(c
))
3151 isl_int_print(out
, c
, 0);
3152 if (pos
< 1 + nparam
) {
3153 name
= isl_space_get_dim_name(bmap
->dim
,
3154 isl_dim_param
, pos
- 1);
3156 fprintf(out
, "%s", name
);
3158 fprintf(out
, "p%d", pos
- 1);
3159 } else if (pos
< 1 + nparam
+ in
)
3160 fprintf(out
, "i%d", pos
- 1 - nparam
);
3161 else if (pos
< 1 + nparam
+ dim
)
3162 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
3164 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
3168 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
3169 int sign
, FILE *out
)
3173 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
3177 for (i
= 0, first
= 1; i
< len
; ++i
) {
3178 if (isl_int_sgn(c
[i
]) * sign
<= 0)
3181 fprintf(out
, " + ");
3183 isl_int_abs(v
, c
[i
]);
3184 dump_term(bmap
, v
, i
, out
);
3191 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
3192 const char *op
, FILE *out
, int indent
)
3196 fprintf(out
, "%*s", indent
, "");
3198 dump_constraint_sign(bmap
, c
, 1, out
);
3199 fprintf(out
, " %s ", op
);
3200 dump_constraint_sign(bmap
, c
, -1, out
);
3204 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
3205 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
3207 fprintf(out
, "%*s", indent
, "");
3208 fprintf(out
, "ERROR: unused div coefficient not zero\n");
3213 static void dump_constraints(struct isl_basic_map
*bmap
,
3214 isl_int
**c
, unsigned n
,
3215 const char *op
, FILE *out
, int indent
)
3219 for (i
= 0; i
< n
; ++i
)
3220 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
3223 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
3227 unsigned total
= isl_basic_map_total_dim(bmap
);
3229 for (j
= 0; j
< 1 + total
; ++j
) {
3230 if (isl_int_is_zero(exp
[j
]))
3232 if (!first
&& isl_int_is_pos(exp
[j
]))
3234 dump_term(bmap
, exp
[j
], j
, out
);
3239 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
3243 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
3244 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
3246 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3247 fprintf(out
, "%*s", indent
, "");
3248 fprintf(out
, "e%d = [(", i
);
3249 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
3251 isl_int_print(out
, bmap
->div
[i
][0], 0);
3252 fprintf(out
, "]\n");
3256 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3257 FILE *out
, int indent
)
3260 fprintf(out
, "null basic set\n");
3264 fprintf(out
, "%*s", indent
, "");
3265 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3266 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3267 bset
->extra
, bset
->flags
);
3268 dump(bset_to_bmap(bset
), out
, indent
);
3271 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3272 FILE *out
, int indent
)
3275 fprintf(out
, "null basic map\n");
3279 fprintf(out
, "%*s", indent
, "");
3280 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3281 "flags: %x, n_name: %d\n",
3283 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3284 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3285 dump(bmap
, out
, indent
);
3288 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
3293 total
= isl_basic_map_total_dim(bmap
);
3294 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
3295 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3296 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3297 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3301 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3306 if (isl_space_dim(space
, isl_dim_in
) != 0)
3307 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3308 "set cannot have input dimensions", goto error
);
3309 return isl_map_alloc_space(space
, n
, flags
);
3311 isl_space_free(space
);
3315 /* Make sure "map" has room for at least "n" more basic maps.
3317 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3320 struct isl_map
*grown
= NULL
;
3324 isl_assert(map
->ctx
, n
>= 0, goto error
);
3325 if (map
->n
+ n
<= map
->size
)
3327 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3330 for (i
= 0; i
< map
->n
; ++i
) {
3331 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3339 isl_map_free(grown
);
3344 /* Make sure "set" has room for at least "n" more basic sets.
3346 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3348 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3351 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3353 return isl_map_from_basic_map(bset
);
3356 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
3358 struct isl_map
*map
;
3363 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3364 return isl_map_add_basic_map(map
, bmap
);
3367 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3368 __isl_take isl_basic_set
*bset
)
3370 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3371 bset_to_bmap(bset
)));
3374 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3376 return isl_map_free(set
);
3379 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3384 fprintf(out
, "null set\n");
3388 fprintf(out
, "%*s", indent
, "");
3389 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3390 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3392 for (i
= 0; i
< set
->n
; ++i
) {
3393 fprintf(out
, "%*s", indent
, "");
3394 fprintf(out
, "basic set %d:\n", i
);
3395 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3399 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3404 fprintf(out
, "null map\n");
3408 fprintf(out
, "%*s", indent
, "");
3409 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3410 "flags: %x, n_name: %d\n",
3411 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3412 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3413 for (i
= 0; i
< map
->n
; ++i
) {
3414 fprintf(out
, "%*s", indent
, "");
3415 fprintf(out
, "basic map %d:\n", i
);
3416 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3420 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3421 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3423 struct isl_basic_map
*bmap_domain
;
3425 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3428 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3429 isl_assert(bset
->ctx
,
3430 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3432 bmap
= isl_basic_map_cow(bmap
);
3435 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3436 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3437 bmap_domain
= isl_basic_map_from_domain(bset
);
3438 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3440 bmap
= isl_basic_map_simplify(bmap
);
3441 return isl_basic_map_finalize(bmap
);
3443 isl_basic_map_free(bmap
);
3444 isl_basic_set_free(bset
);
3448 /* Check that the space of "bset" is the same as that of the range of "bmap".
3450 static isl_stat
isl_basic_map_check_compatible_range(
3451 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3455 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3457 return isl_stat_error
;
3459 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3460 "incompatible spaces", return isl_stat_error
);
3465 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3466 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3468 struct isl_basic_map
*bmap_range
;
3470 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3473 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3474 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3477 if (isl_basic_set_plain_is_universe(bset
)) {
3478 isl_basic_set_free(bset
);
3482 bmap
= isl_basic_map_cow(bmap
);
3485 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3486 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3487 bmap_range
= bset_to_bmap(bset
);
3488 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3490 bmap
= isl_basic_map_simplify(bmap
);
3491 return isl_basic_map_finalize(bmap
);
3493 isl_basic_map_free(bmap
);
3494 isl_basic_set_free(bset
);
3498 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3499 __isl_keep isl_vec
*vec
)
3506 return isl_bool_error
;
3508 total
= 1 + isl_basic_map_total_dim(bmap
);
3509 if (total
!= vec
->size
)
3510 return isl_bool_false
;
3514 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3515 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3516 if (!isl_int_is_zero(s
)) {
3518 return isl_bool_false
;
3522 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3523 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3524 if (isl_int_is_neg(s
)) {
3526 return isl_bool_false
;
3532 return isl_bool_true
;
3535 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3536 __isl_keep isl_vec
*vec
)
3538 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3541 __isl_give isl_basic_map
*isl_basic_map_intersect(
3542 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3544 struct isl_vec
*sample
= NULL
;
3546 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3548 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3549 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3550 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3551 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3552 return isl_basic_map_intersect(bmap2
, bmap1
);
3554 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3555 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3556 isl_assert(bmap1
->ctx
,
3557 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3559 if (isl_basic_map_plain_is_empty(bmap1
)) {
3560 isl_basic_map_free(bmap2
);
3563 if (isl_basic_map_plain_is_empty(bmap2
)) {
3564 isl_basic_map_free(bmap1
);
3568 if (bmap1
->sample
&&
3569 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3570 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3571 sample
= isl_vec_copy(bmap1
->sample
);
3572 else if (bmap2
->sample
&&
3573 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3574 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3575 sample
= isl_vec_copy(bmap2
->sample
);
3577 bmap1
= isl_basic_map_cow(bmap1
);
3580 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3581 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3582 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3585 isl_vec_free(sample
);
3587 isl_vec_free(bmap1
->sample
);
3588 bmap1
->sample
= sample
;
3591 bmap1
= isl_basic_map_simplify(bmap1
);
3592 return isl_basic_map_finalize(bmap1
);
3595 isl_vec_free(sample
);
3596 isl_basic_map_free(bmap1
);
3597 isl_basic_map_free(bmap2
);
3601 struct isl_basic_set
*isl_basic_set_intersect(
3602 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3604 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3605 bset_to_bmap(bset2
)));
3608 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3609 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3611 return isl_basic_set_intersect(bset1
, bset2
);
3614 /* Special case of isl_map_intersect, where both map1 and map2
3615 * are convex, without any divs and such that either map1 or map2
3616 * contains a single constraint. This constraint is then simply
3617 * added to the other map.
3619 static __isl_give isl_map
*map_intersect_add_constraint(
3620 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3622 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3623 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3624 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3625 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3627 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3628 return isl_map_intersect(map2
, map1
);
3630 map1
= isl_map_cow(map1
);
3633 if (isl_map_plain_is_empty(map1
)) {
3637 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3638 if (map2
->p
[0]->n_eq
== 1)
3639 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3641 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3642 map2
->p
[0]->ineq
[0]);
3644 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3645 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3649 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3650 isl_basic_map_free(map1
->p
[0]);
3663 /* map2 may be either a parameter domain or a map living in the same
3666 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3667 __isl_take isl_map
*map2
)
3676 if ((isl_map_plain_is_empty(map1
) ||
3677 isl_map_plain_is_universe(map2
)) &&
3678 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3682 if ((isl_map_plain_is_empty(map2
) ||
3683 isl_map_plain_is_universe(map1
)) &&
3684 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3689 if (map1
->n
== 1 && map2
->n
== 1 &&
3690 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3691 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3692 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3693 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3694 return map_intersect_add_constraint(map1
, map2
);
3696 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3697 isl_space_dim(map2
->dim
, isl_dim_param
))
3698 isl_assert(map1
->ctx
,
3699 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3701 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3702 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3703 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3705 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3706 map1
->n
* map2
->n
, flags
);
3709 for (i
= 0; i
< map1
->n
; ++i
)
3710 for (j
= 0; j
< map2
->n
; ++j
) {
3711 struct isl_basic_map
*part
;
3712 part
= isl_basic_map_intersect(
3713 isl_basic_map_copy(map1
->p
[i
]),
3714 isl_basic_map_copy(map2
->p
[j
]));
3715 if (isl_basic_map_is_empty(part
) < 0)
3716 part
= isl_basic_map_free(part
);
3717 result
= isl_map_add_basic_map(result
, part
);
3730 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3731 __isl_take isl_map
*map2
)
3735 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3736 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3737 "spaces don't match", goto error
);
3738 return map_intersect_internal(map1
, map2
);
3745 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3746 __isl_take isl_map
*map2
)
3748 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3751 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3753 return set_from_map(isl_map_intersect(set_to_map(set1
),
3757 /* map_intersect_internal accepts intersections
3758 * with parameter domains, so we can just call that function.
3760 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3761 __isl_take isl_set
*params
)
3763 return map_intersect_internal(map
, params
);
3766 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3767 __isl_take isl_map
*map2
)
3769 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3772 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3773 __isl_take isl_set
*params
)
3775 return isl_map_intersect_params(set
, params
);
3778 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3781 unsigned pos
, n1
, n2
;
3785 bmap
= isl_basic_map_cow(bmap
);
3788 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3789 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3790 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3791 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3792 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3793 return isl_basic_map_reset_space(bmap
, space
);
3796 static __isl_give isl_basic_map
*basic_map_space_reset(
3797 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3803 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3806 space
= isl_basic_map_get_space(bmap
);
3807 space
= isl_space_reset(space
, type
);
3808 bmap
= isl_basic_map_reset_space(bmap
, space
);
3812 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3813 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3814 unsigned pos
, unsigned n
)
3818 struct isl_basic_map
*res
;
3819 struct isl_dim_map
*dim_map
;
3820 unsigned total
, off
;
3821 enum isl_dim_type t
;
3824 return basic_map_space_reset(bmap
, type
);
3829 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3831 total
= isl_basic_map_total_dim(bmap
) + n
;
3832 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3834 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3836 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3838 unsigned size
= isl_basic_map_dim(bmap
, t
);
3839 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3841 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3842 pos
, size
- pos
, off
+ pos
+ n
);
3844 off
+= isl_space_dim(res_dim
, t
);
3846 isl_dim_map_div(dim_map
, bmap
, off
);
3848 res
= isl_basic_map_alloc_space(res_dim
,
3849 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3850 rational
= isl_basic_map_is_rational(bmap
);
3852 res
= isl_basic_map_free(res
);
3854 res
= isl_basic_map_set_rational(res
);
3855 if (isl_basic_map_plain_is_empty(bmap
)) {
3856 isl_basic_map_free(bmap
);
3858 return isl_basic_map_set_to_empty(res
);
3860 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3861 return isl_basic_map_finalize(res
);
3864 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3865 __isl_take isl_basic_set
*bset
,
3866 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3868 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3871 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3872 enum isl_dim_type type
, unsigned n
)
3876 return isl_basic_map_insert_dims(bmap
, type
,
3877 isl_basic_map_dim(bmap
, type
), n
);
3880 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3881 enum isl_dim_type type
, unsigned n
)
3885 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3886 return isl_basic_map_add_dims(bset
, type
, n
);
3888 isl_basic_set_free(bset
);
3892 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3893 enum isl_dim_type type
)
3897 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3900 space
= isl_map_get_space(map
);
3901 space
= isl_space_reset(space
, type
);
3902 map
= isl_map_reset_space(map
, space
);
3906 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3907 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3912 return map_space_reset(map
, type
);
3914 map
= isl_map_cow(map
);
3918 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3922 for (i
= 0; i
< map
->n
; ++i
) {
3923 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3934 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3935 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3937 return isl_map_insert_dims(set
, type
, pos
, n
);
3940 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3941 enum isl_dim_type type
, unsigned n
)
3945 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3948 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3949 enum isl_dim_type type
, unsigned n
)
3953 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3954 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
3960 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3961 __isl_take isl_basic_map
*bmap
,
3962 enum isl_dim_type dst_type
, unsigned dst_pos
,
3963 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3965 struct isl_dim_map
*dim_map
;
3966 struct isl_basic_map
*res
;
3967 enum isl_dim_type t
;
3968 unsigned total
, off
;
3973 bmap
= isl_basic_map_reset(bmap
, src_type
);
3974 bmap
= isl_basic_map_reset(bmap
, dst_type
);
3978 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
3979 return isl_basic_map_free(bmap
);
3981 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3984 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3986 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3987 pos(bmap
->dim
, src_type
) + src_pos
+
3988 ((src_type
< dst_type
) ? n
: 0)) {
3989 bmap
= isl_basic_map_cow(bmap
);
3993 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3994 src_type
, src_pos
, n
);
3998 bmap
= isl_basic_map_finalize(bmap
);
4003 total
= isl_basic_map_total_dim(bmap
);
4004 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4007 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4008 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4009 if (t
== dst_type
) {
4010 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4013 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
4016 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4017 dst_pos
, size
- dst_pos
, off
);
4018 off
+= size
- dst_pos
;
4019 } else if (t
== src_type
) {
4020 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4023 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4024 src_pos
+ n
, size
- src_pos
- n
, off
);
4025 off
+= size
- src_pos
- n
;
4027 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4031 isl_dim_map_div(dim_map
, bmap
, off
);
4033 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4034 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4035 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4039 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4040 src_type
, src_pos
, n
);
4044 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4045 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4046 bmap
= isl_basic_map_finalize(bmap
);
4050 isl_basic_map_free(bmap
);
4054 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4055 enum isl_dim_type dst_type
, unsigned dst_pos
,
4056 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4058 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4059 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4060 src_type
, src_pos
, n
);
4061 return bset_from_bmap(bmap
);
4064 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4065 enum isl_dim_type dst_type
, unsigned dst_pos
,
4066 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4070 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4071 return set_from_map(isl_map_move_dims(set_to_map(set
),
4072 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4078 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4079 enum isl_dim_type dst_type
, unsigned dst_pos
,
4080 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4087 map
= isl_map_reset(map
, src_type
);
4088 map
= isl_map_reset(map
, dst_type
);
4092 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
4095 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4098 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4100 map
= isl_map_cow(map
);
4104 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4108 for (i
= 0; i
< map
->n
; ++i
) {
4109 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4111 src_type
, src_pos
, n
);
4122 /* Move the specified dimensions to the last columns right before
4123 * the divs. Don't change the dimension specification of bmap.
4124 * That's the responsibility of the caller.
4126 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4127 enum isl_dim_type type
, unsigned first
, unsigned n
)
4129 struct isl_dim_map
*dim_map
;
4130 struct isl_basic_map
*res
;
4131 enum isl_dim_type t
;
4132 unsigned total
, off
;
4136 if (pos(bmap
->dim
, type
) + first
+ n
==
4137 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
4140 total
= isl_basic_map_total_dim(bmap
);
4141 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4144 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4145 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4147 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4150 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4151 first
, n
, total
- bmap
->n_div
- n
);
4152 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4153 first
+ n
, size
- (first
+ n
), off
);
4154 off
+= size
- (first
+ n
);
4156 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4160 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4162 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4163 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4164 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4168 /* Insert "n" rows in the divs of "bmap".
4170 * The number of columns is not changed, which means that the last
4171 * dimensions of "bmap" are being reintepreted as the new divs.
4172 * The space of "bmap" is not adjusted, however, which means
4173 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4174 * from the space of "bmap" is the responsibility of the caller.
4176 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4184 bmap
= isl_basic_map_cow(bmap
);
4188 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
4189 old
= bmap
->block2
.data
;
4190 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4191 (bmap
->extra
+ n
) * (1 + row_size
));
4192 if (!bmap
->block2
.data
)
4193 return isl_basic_map_free(bmap
);
4194 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4196 return isl_basic_map_free(bmap
);
4197 for (i
= 0; i
< n
; ++i
) {
4198 new_div
[i
] = bmap
->block2
.data
+
4199 (bmap
->extra
+ i
) * (1 + row_size
);
4200 isl_seq_clr(new_div
[i
], 1 + row_size
);
4202 for (i
= 0; i
< bmap
->extra
; ++i
)
4203 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4205 bmap
->div
= new_div
;
4212 /* Drop constraints from "bmap" that only involve the variables
4213 * of "type" in the range [first, first + n] that are not related
4214 * to any of the variables outside that interval.
4215 * These constraints cannot influence the values for the variables
4216 * outside the interval, except in case they cause "bmap" to be empty.
4217 * Only drop the constraints if "bmap" is known to be non-empty.
4219 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4220 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4221 unsigned first
, unsigned n
)
4225 unsigned dim
, n_div
;
4228 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4230 return isl_basic_map_free(bmap
);
4234 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4235 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4236 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4238 return isl_basic_map_free(bmap
);
4239 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4240 for (i
= 0; i
< first
; ++i
)
4242 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4245 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4250 /* Turn the n dimensions of type type, starting at first
4251 * into existentially quantified variables.
4253 * If a subset of the projected out variables are unrelated
4254 * to any of the variables that remain, then the constraints
4255 * involving this subset are simply dropped first.
4257 __isl_give isl_basic_map
*isl_basic_map_project_out(
4258 __isl_take isl_basic_map
*bmap
,
4259 enum isl_dim_type type
, unsigned first
, unsigned n
)
4264 return basic_map_space_reset(bmap
, type
);
4265 if (type
== isl_dim_div
)
4266 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4267 "cannot project out existentially quantified variables",
4268 return isl_basic_map_free(bmap
));
4270 empty
= isl_basic_map_plain_is_empty(bmap
);
4272 return isl_basic_map_free(bmap
);
4274 bmap
= isl_basic_map_set_to_empty(bmap
);
4276 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4280 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4281 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4283 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4284 return isl_basic_map_free(bmap
);
4286 bmap
= move_last(bmap
, type
, first
, n
);
4287 bmap
= isl_basic_map_cow(bmap
);
4288 bmap
= insert_div_rows(bmap
, n
);
4292 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4295 bmap
= isl_basic_map_simplify(bmap
);
4296 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4297 return isl_basic_map_finalize(bmap
);
4299 isl_basic_map_free(bmap
);
4303 /* Turn the n dimensions of type type, starting at first
4304 * into existentially quantified variables.
4306 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4307 enum isl_dim_type type
, unsigned first
, unsigned n
)
4309 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4313 /* Turn the n dimensions of type type, starting at first
4314 * into existentially quantified variables.
4316 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4317 enum isl_dim_type type
, unsigned first
, unsigned n
)
4325 return map_space_reset(map
, type
);
4327 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
4329 map
= isl_map_cow(map
);
4333 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4337 for (i
= 0; i
< map
->n
; ++i
) {
4338 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4349 /* Turn the n dimensions of type type, starting at first
4350 * into existentially quantified variables.
4352 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4353 enum isl_dim_type type
, unsigned first
, unsigned n
)
4355 return set_from_map(isl_map_project_out(set_to_map(set
),
4359 /* Return a map that projects the elements in "set" onto their
4360 * "n" set dimensions starting at "first".
4361 * "type" should be equal to isl_dim_set.
4363 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4364 enum isl_dim_type type
, unsigned first
, unsigned n
)
4372 if (type
!= isl_dim_set
)
4373 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4374 "only set dimensions can be projected out", goto error
);
4375 dim
= isl_set_dim(set
, isl_dim_set
);
4376 if (first
+ n
> dim
|| first
+ n
< first
)
4377 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4378 "index out of bounds", goto error
);
4380 map
= isl_map_from_domain(set
);
4381 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4382 for (i
= 0; i
< n
; ++i
)
4383 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4391 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
4395 for (i
= 0; i
< n
; ++i
) {
4396 j
= isl_basic_map_alloc_div(bmap
);
4399 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4403 isl_basic_map_free(bmap
);
4407 struct isl_basic_map
*isl_basic_map_apply_range(
4408 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4410 isl_space
*dim_result
= NULL
;
4411 struct isl_basic_map
*bmap
;
4412 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4413 struct isl_dim_map
*dim_map1
, *dim_map2
;
4415 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4417 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4418 bmap2
->dim
, isl_dim_in
))
4419 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4420 "spaces don't match", goto error
);
4422 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4423 isl_space_copy(bmap2
->dim
));
4425 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4426 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4427 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4428 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4430 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4431 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4432 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4433 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4434 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4435 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4436 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4437 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4438 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4439 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4440 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4442 bmap
= isl_basic_map_alloc_space(dim_result
,
4443 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4444 bmap1
->n_eq
+ bmap2
->n_eq
,
4445 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4446 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4447 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4448 bmap
= add_divs(bmap
, n
);
4449 bmap
= isl_basic_map_simplify(bmap
);
4450 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4451 return isl_basic_map_finalize(bmap
);
4453 isl_basic_map_free(bmap1
);
4454 isl_basic_map_free(bmap2
);
4458 struct isl_basic_set
*isl_basic_set_apply(
4459 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4464 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4467 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4470 isl_basic_set_free(bset
);
4471 isl_basic_map_free(bmap
);
4475 struct isl_basic_map
*isl_basic_map_apply_domain(
4476 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4478 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4480 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4481 bmap2
->dim
, isl_dim_in
))
4482 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4483 "spaces don't match", goto error
);
4485 bmap1
= isl_basic_map_reverse(bmap1
);
4486 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4487 return isl_basic_map_reverse(bmap1
);
4489 isl_basic_map_free(bmap1
);
4490 isl_basic_map_free(bmap2
);
4494 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4495 * A \cap B -> f(A) + f(B)
4497 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4498 __isl_take isl_basic_map
*bmap2
)
4500 unsigned n_in
, n_out
, nparam
, total
, pos
;
4501 struct isl_basic_map
*bmap
= NULL
;
4502 struct isl_dim_map
*dim_map1
, *dim_map2
;
4505 if (!bmap1
|| !bmap2
)
4508 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4511 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4512 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4513 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4515 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4516 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4517 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4518 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4519 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4520 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4521 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4522 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4523 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4524 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4525 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4527 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4528 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4529 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4530 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4531 for (i
= 0; i
< n_out
; ++i
) {
4532 int j
= isl_basic_map_alloc_equality(bmap
);
4535 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4536 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4537 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4538 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4540 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4541 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4542 bmap
= add_divs(bmap
, 2 * n_out
);
4544 bmap
= isl_basic_map_simplify(bmap
);
4545 return isl_basic_map_finalize(bmap
);
4547 isl_basic_map_free(bmap
);
4548 isl_basic_map_free(bmap1
);
4549 isl_basic_map_free(bmap2
);
4553 /* Given two maps A -> f(A) and B -> g(B), construct a map
4554 * A \cap B -> f(A) + f(B)
4556 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4557 __isl_take isl_map
*map2
)
4559 struct isl_map
*result
;
4565 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4567 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4568 map1
->n
* map2
->n
, 0);
4571 for (i
= 0; i
< map1
->n
; ++i
)
4572 for (j
= 0; j
< map2
->n
; ++j
) {
4573 struct isl_basic_map
*part
;
4574 part
= isl_basic_map_sum(
4575 isl_basic_map_copy(map1
->p
[i
]),
4576 isl_basic_map_copy(map2
->p
[j
]));
4577 if (isl_basic_map_is_empty(part
))
4578 isl_basic_map_free(part
);
4580 result
= isl_map_add_basic_map(result
, part
);
4593 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4594 __isl_take isl_set
*set2
)
4596 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4599 /* Given a basic map A -> f(A), construct A -> -f(A).
4601 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4606 bmap
= isl_basic_map_cow(bmap
);
4610 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4611 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4612 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4613 for (j
= 0; j
< n
; ++j
)
4614 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4615 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4616 for (j
= 0; j
< n
; ++j
)
4617 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4618 for (i
= 0; i
< bmap
->n_div
; ++i
)
4619 for (j
= 0; j
< n
; ++j
)
4620 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4621 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4622 return isl_basic_map_finalize(bmap
);
4625 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4627 return isl_basic_map_neg(bset
);
4630 /* Given a map A -> f(A), construct A -> -f(A).
4632 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4636 map
= isl_map_cow(map
);
4640 for (i
= 0; i
< map
->n
; ++i
) {
4641 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4652 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4654 return set_from_map(isl_map_neg(set_to_map(set
)));
4657 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4658 * A -> floor(f(A)/d).
4660 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4663 unsigned n_in
, n_out
, nparam
, total
, pos
;
4664 struct isl_basic_map
*result
= NULL
;
4665 struct isl_dim_map
*dim_map
;
4671 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4672 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4673 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4675 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4676 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4677 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4678 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4679 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4680 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4682 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4683 bmap
->n_div
+ n_out
,
4684 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4685 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4686 result
= add_divs(result
, n_out
);
4687 for (i
= 0; i
< n_out
; ++i
) {
4689 j
= isl_basic_map_alloc_inequality(result
);
4692 isl_seq_clr(result
->ineq
[j
], 1+total
);
4693 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4694 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4695 j
= isl_basic_map_alloc_inequality(result
);
4698 isl_seq_clr(result
->ineq
[j
], 1+total
);
4699 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4700 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4701 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4704 result
= isl_basic_map_simplify(result
);
4705 return isl_basic_map_finalize(result
);
4707 isl_basic_map_free(result
);
4711 /* Given a map A -> f(A) and an integer d, construct a map
4712 * A -> floor(f(A)/d).
4714 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
4718 map
= isl_map_cow(map
);
4722 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4723 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4724 for (i
= 0; i
< map
->n
; ++i
) {
4725 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4736 /* Given a map A -> f(A) and an integer d, construct a map
4737 * A -> floor(f(A)/d).
4739 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4740 __isl_take isl_val
*d
)
4744 if (!isl_val_is_int(d
))
4745 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4746 "expecting integer denominator", goto error
);
4747 map
= isl_map_floordiv(map
, d
->n
);
4756 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4763 i
= isl_basic_map_alloc_equality(bmap
);
4766 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4767 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4768 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4769 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4770 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4771 return isl_basic_map_finalize(bmap
);
4773 isl_basic_map_free(bmap
);
4777 /* Add a constraint to "bmap" expressing i_pos < o_pos
4779 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4786 i
= isl_basic_map_alloc_inequality(bmap
);
4789 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4790 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4791 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4792 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4793 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4794 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4795 return isl_basic_map_finalize(bmap
);
4797 isl_basic_map_free(bmap
);
4801 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4803 static __isl_give isl_basic_map
*var_less_or_equal(
4804 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4810 i
= isl_basic_map_alloc_inequality(bmap
);
4813 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4814 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4815 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4816 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4817 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4818 return isl_basic_map_finalize(bmap
);
4820 isl_basic_map_free(bmap
);
4824 /* Add a constraint to "bmap" expressing i_pos > o_pos
4826 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4833 i
= isl_basic_map_alloc_inequality(bmap
);
4836 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4837 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4838 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4839 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4840 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4841 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4842 return isl_basic_map_finalize(bmap
);
4844 isl_basic_map_free(bmap
);
4848 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4850 static __isl_give isl_basic_map
*var_more_or_equal(
4851 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4857 i
= isl_basic_map_alloc_inequality(bmap
);
4860 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4861 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4862 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4863 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4864 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4865 return isl_basic_map_finalize(bmap
);
4867 isl_basic_map_free(bmap
);
4871 __isl_give isl_basic_map
*isl_basic_map_equal(
4872 __isl_take isl_space
*dim
, unsigned n_equal
)
4875 struct isl_basic_map
*bmap
;
4876 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4879 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4880 bmap
= var_equal(bmap
, i
);
4881 return isl_basic_map_finalize(bmap
);
4884 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4886 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4890 struct isl_basic_map
*bmap
;
4891 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4894 for (i
= 0; i
< pos
&& bmap
; ++i
)
4895 bmap
= var_equal(bmap
, i
);
4897 bmap
= var_less(bmap
, pos
);
4898 return isl_basic_map_finalize(bmap
);
4901 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4903 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4904 __isl_take isl_space
*dim
, unsigned pos
)
4907 isl_basic_map
*bmap
;
4909 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4910 for (i
= 0; i
< pos
; ++i
)
4911 bmap
= var_equal(bmap
, i
);
4912 bmap
= var_less_or_equal(bmap
, pos
);
4913 return isl_basic_map_finalize(bmap
);
4916 /* Return a relation on "dim" expressing i_pos > o_pos
4918 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4922 struct isl_basic_map
*bmap
;
4923 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4926 for (i
= 0; i
< pos
&& bmap
; ++i
)
4927 bmap
= var_equal(bmap
, i
);
4929 bmap
= var_more(bmap
, pos
);
4930 return isl_basic_map_finalize(bmap
);
4933 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
4935 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4936 __isl_take isl_space
*dim
, unsigned pos
)
4939 isl_basic_map
*bmap
;
4941 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4942 for (i
= 0; i
< pos
; ++i
)
4943 bmap
= var_equal(bmap
, i
);
4944 bmap
= var_more_or_equal(bmap
, pos
);
4945 return isl_basic_map_finalize(bmap
);
4948 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4949 unsigned n
, int equal
)
4951 struct isl_map
*map
;
4954 if (n
== 0 && equal
)
4955 return isl_map_universe(dims
);
4957 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4959 for (i
= 0; i
+ 1 < n
; ++i
)
4960 map
= isl_map_add_basic_map(map
,
4961 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4964 map
= isl_map_add_basic_map(map
,
4965 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4967 map
= isl_map_add_basic_map(map
,
4968 isl_basic_map_less_at(dims
, n
- 1));
4970 isl_space_free(dims
);
4975 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4979 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4982 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4984 return map_lex_lte_first(dim
, n
, 0);
4987 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4989 return map_lex_lte_first(dim
, n
, 1);
4992 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4994 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4997 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4999 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
5002 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
5003 unsigned n
, int equal
)
5005 struct isl_map
*map
;
5008 if (n
== 0 && equal
)
5009 return isl_map_universe(dims
);
5011 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5013 for (i
= 0; i
+ 1 < n
; ++i
)
5014 map
= isl_map_add_basic_map(map
,
5015 isl_basic_map_more_at(isl_space_copy(dims
), i
));
5018 map
= isl_map_add_basic_map(map
,
5019 isl_basic_map_more_or_equal_at(dims
, n
- 1));
5021 map
= isl_map_add_basic_map(map
,
5022 isl_basic_map_more_at(dims
, n
- 1));
5024 isl_space_free(dims
);
5029 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
5033 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
5036 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5038 return map_lex_gte_first(dim
, n
, 0);
5041 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5043 return map_lex_gte_first(dim
, n
, 1);
5046 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5048 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5051 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5053 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5056 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5057 __isl_take isl_set
*set2
)
5060 map
= isl_map_lex_le(isl_set_get_space(set1
));
5061 map
= isl_map_intersect_domain(map
, set1
);
5062 map
= isl_map_intersect_range(map
, set2
);
5066 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5067 __isl_take isl_set
*set2
)
5070 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5071 map
= isl_map_intersect_domain(map
, set1
);
5072 map
= isl_map_intersect_range(map
, set2
);
5076 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5077 __isl_take isl_set
*set2
)
5080 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5081 map
= isl_map_intersect_domain(map
, set1
);
5082 map
= isl_map_intersect_range(map
, set2
);
5086 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5087 __isl_take isl_set
*set2
)
5090 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5091 map
= isl_map_intersect_domain(map
, set1
);
5092 map
= isl_map_intersect_range(map
, set2
);
5096 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5097 __isl_take isl_map
*map2
)
5100 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5101 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5102 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5106 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5107 __isl_take isl_map
*map2
)
5110 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5111 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5112 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5116 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5117 __isl_take isl_map
*map2
)
5120 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5121 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5122 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5126 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5127 __isl_take isl_map
*map2
)
5130 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5131 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5132 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5136 /* For a div d = floor(f/m), add the constraint
5140 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
5141 unsigned pos
, isl_int
*div
)
5144 unsigned total
= isl_basic_map_total_dim(bmap
);
5146 i
= isl_basic_map_alloc_inequality(bmap
);
5148 return isl_stat_error
;
5149 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5150 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
5155 /* For a div d = floor(f/m), add the constraint
5157 * -(f-(m-1)) + m d >= 0
5159 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
5160 unsigned pos
, isl_int
*div
)
5163 unsigned total
= isl_basic_map_total_dim(bmap
);
5165 i
= isl_basic_map_alloc_inequality(bmap
);
5167 return isl_stat_error
;
5168 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5169 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
5170 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5171 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5176 /* For a div d = floor(f/m), add the constraints
5179 * -(f-(m-1)) + m d >= 0
5181 * Note that the second constraint is the negation of
5185 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
5186 unsigned pos
, isl_int
*div
)
5188 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
5190 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
5195 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
5196 unsigned pos
, isl_int
*div
)
5198 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
5202 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
5204 unsigned total
= isl_basic_map_total_dim(bmap
);
5205 unsigned div_pos
= total
- bmap
->n_div
+ div
;
5207 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
5211 /* For each known div d = floor(f/m), add the constraints
5214 * -(f-(m-1)) + m d >= 0
5216 * Remove duplicate constraints in case of some these div constraints
5217 * already appear in "bmap".
5219 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5220 __isl_take isl_basic_map
*bmap
)
5226 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5230 bmap
= add_known_div_constraints(bmap
);
5231 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5232 bmap
= isl_basic_map_finalize(bmap
);
5236 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5238 * In particular, if this div is of the form d = floor(f/m),
5239 * then add the constraint
5243 * if sign < 0 or the constraint
5245 * -(f-(m-1)) + m d >= 0
5249 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
5250 unsigned div
, int sign
)
5258 total
= isl_basic_map_total_dim(bmap
);
5259 div_pos
= total
- bmap
->n_div
+ div
;
5262 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5264 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5267 struct isl_basic_set
*isl_basic_map_underlying_set(
5268 struct isl_basic_map
*bmap
)
5272 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5274 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5275 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5276 return bset_from_bmap(bmap
);
5277 bmap
= isl_basic_map_cow(bmap
);
5280 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5283 bmap
->extra
-= bmap
->n_div
;
5285 bmap
= isl_basic_map_finalize(bmap
);
5286 return bset_from_bmap(bmap
);
5288 isl_basic_map_free(bmap
);
5292 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5293 __isl_take isl_basic_set
*bset
)
5295 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5298 /* Replace each element in "list" by the result of applying
5299 * isl_basic_map_underlying_set to the element.
5301 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5302 __isl_take isl_basic_map_list
*list
)
5309 n
= isl_basic_map_list_n_basic_map(list
);
5310 for (i
= 0; i
< n
; ++i
) {
5311 isl_basic_map
*bmap
;
5312 isl_basic_set
*bset
;
5314 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5315 bset
= isl_basic_set_underlying_set(bmap
);
5316 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5322 struct isl_basic_map
*isl_basic_map_overlying_set(
5323 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
5325 struct isl_basic_map
*bmap
;
5326 struct isl_ctx
*ctx
;
5333 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5334 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5335 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5337 if (like
->n_div
== 0) {
5338 isl_space
*space
= isl_basic_map_get_space(like
);
5339 isl_basic_map_free(like
);
5340 return isl_basic_map_reset_space(bset
, space
);
5342 bset
= isl_basic_set_cow(bset
);
5345 total
= bset
->dim
->n_out
+ bset
->extra
;
5346 bmap
= bset_to_bmap(bset
);
5347 isl_space_free(bmap
->dim
);
5348 bmap
->dim
= isl_space_copy(like
->dim
);
5351 bmap
->n_div
= like
->n_div
;
5352 bmap
->extra
+= like
->n_div
;
5356 ltotal
= total
- bmap
->extra
+ like
->extra
;
5359 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5360 bmap
->extra
* (1 + 1 + total
));
5361 if (isl_blk_is_error(bmap
->block2
))
5363 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5367 for (i
= 0; i
< bmap
->extra
; ++i
)
5368 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5369 for (i
= 0; i
< like
->n_div
; ++i
) {
5370 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5371 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5373 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5375 isl_basic_map_free(like
);
5376 bmap
= isl_basic_map_simplify(bmap
);
5377 bmap
= isl_basic_map_finalize(bmap
);
5380 isl_basic_map_free(like
);
5381 isl_basic_set_free(bset
);
5385 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5386 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5388 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5389 bset_to_bmap(like
)));
5392 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
5396 map
= isl_map_cow(map
);
5399 map
->dim
= isl_space_cow(map
->dim
);
5403 for (i
= 1; i
< map
->n
; ++i
)
5404 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5406 for (i
= 0; i
< map
->n
; ++i
) {
5407 map
->p
[i
] = bset_to_bmap(
5408 isl_basic_map_underlying_set(map
->p
[i
]));
5413 map
->dim
= isl_space_underlying(map
->dim
, 0);
5415 isl_space_free(map
->dim
);
5416 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5420 return set_from_map(map
);
5426 /* Replace the space of "bmap" by "space".
5428 * If the space of "bmap" is identical to "space" (including the identifiers
5429 * of the input and output dimensions), then simply return the original input.
5431 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5432 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5435 isl_space
*bmap_space
;
5437 bmap_space
= isl_basic_map_peek_space(bmap
);
5438 equal
= isl_space_is_equal(bmap_space
, space
);
5439 if (equal
>= 0 && equal
)
5440 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5444 isl_space_free(space
);
5447 bmap
= isl_basic_map_cow(bmap
);
5448 if (!bmap
|| !space
)
5451 isl_space_free(bmap
->dim
);
5454 bmap
= isl_basic_map_finalize(bmap
);
5458 isl_basic_map_free(bmap
);
5459 isl_space_free(space
);
5463 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5464 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5466 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5470 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5471 __isl_take isl_space
*dim
)
5475 map
= isl_map_cow(map
);
5479 for (i
= 0; i
< map
->n
; ++i
) {
5480 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5481 isl_space_copy(dim
));
5485 isl_space_free(map
->dim
);
5491 isl_space_free(dim
);
5495 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5496 __isl_take isl_space
*dim
)
5498 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5501 /* Compute the parameter domain of the given basic set.
5503 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5509 is_params
= isl_basic_set_is_params(bset
);
5511 return isl_basic_set_free(bset
);
5515 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5516 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5517 space
= isl_basic_set_get_space(bset
);
5518 space
= isl_space_params(space
);
5519 bset
= isl_basic_set_reset_space(bset
, space
);
5523 /* Construct a zero-dimensional basic set with the given parameter domain.
5525 __isl_give isl_basic_set
*isl_basic_set_from_params(
5526 __isl_take isl_basic_set
*bset
)
5529 space
= isl_basic_set_get_space(bset
);
5530 space
= isl_space_set_from_params(space
);
5531 bset
= isl_basic_set_reset_space(bset
, space
);
5535 /* Compute the parameter domain of the given set.
5537 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5542 if (isl_set_is_params(set
))
5545 n
= isl_set_dim(set
, isl_dim_set
);
5546 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5547 space
= isl_set_get_space(set
);
5548 space
= isl_space_params(space
);
5549 set
= isl_set_reset_space(set
, space
);
5553 /* Construct a zero-dimensional set with the given parameter domain.
5555 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5558 space
= isl_set_get_space(set
);
5559 space
= isl_space_set_from_params(space
);
5560 set
= isl_set_reset_space(set
, space
);
5564 /* Compute the parameter domain of the given map.
5566 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5571 n
= isl_map_dim(map
, isl_dim_in
);
5572 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5573 n
= isl_map_dim(map
, isl_dim_out
);
5574 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5575 space
= isl_map_get_space(map
);
5576 space
= isl_space_params(space
);
5577 map
= isl_map_reset_space(map
, space
);
5581 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5588 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5590 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5591 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5593 return isl_basic_map_reset_space(bmap
, space
);
5596 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5599 return isl_bool_error
;
5600 return isl_space_may_be_set(bmap
->dim
);
5603 /* Is this basic map actually a set?
5604 * Users should never call this function. Outside of isl,
5605 * the type should indicate whether something is a set or a map.
5607 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5610 return isl_bool_error
;
5611 return isl_space_is_set(bmap
->dim
);
5614 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5618 is_set
= isl_basic_map_is_set(bmap
);
5623 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5625 isl_basic_map_free(bmap
);
5629 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5630 __isl_take isl_basic_map
*bmap
)
5634 isl_basic_map
*domain
;
5635 int nparam
, n_in
, n_out
;
5637 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5638 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5639 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5641 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5642 domain
= isl_basic_map_universe(dim
);
5644 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5645 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5646 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5648 for (i
= 0; i
< n_in
; ++i
)
5649 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5652 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5653 return isl_basic_map_finalize(bmap
);
5656 __isl_give isl_basic_map
*isl_basic_map_range_map(
5657 __isl_take isl_basic_map
*bmap
)
5661 isl_basic_map
*range
;
5662 int nparam
, n_in
, n_out
;
5664 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5665 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5666 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5668 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5669 range
= isl_basic_map_universe(dim
);
5671 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5672 bmap
= isl_basic_map_apply_range(bmap
, range
);
5673 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5675 for (i
= 0; i
< n_out
; ++i
)
5676 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5679 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5680 return isl_basic_map_finalize(bmap
);
5683 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5687 return isl_space_may_be_set(map
->dim
);
5690 /* Is this map actually a set?
5691 * Users should never call this function. Outside of isl,
5692 * the type should indicate whether something is a set or a map.
5694 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5697 return isl_bool_error
;
5698 return isl_space_is_set(map
->dim
);
5701 struct isl_set
*isl_map_range(struct isl_map
*map
)
5705 struct isl_set
*set
;
5707 is_set
= isl_map_is_set(map
);
5711 return set_from_map(map
);
5713 map
= isl_map_cow(map
);
5717 set
= set_from_map(map
);
5718 set
->dim
= isl_space_range(set
->dim
);
5721 for (i
= 0; i
< map
->n
; ++i
) {
5722 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5726 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5727 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5734 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5738 map
= isl_map_cow(map
);
5742 map
->dim
= isl_space_domain_map(map
->dim
);
5745 for (i
= 0; i
< map
->n
; ++i
) {
5746 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5750 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5751 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5758 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5761 isl_space
*range_dim
;
5763 map
= isl_map_cow(map
);
5767 range_dim
= isl_space_range(isl_map_get_space(map
));
5768 range_dim
= isl_space_from_range(range_dim
);
5769 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5770 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5773 for (i
= 0; i
< map
->n
; ++i
) {
5774 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5778 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5779 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5786 /* Given a wrapped map of the form A[B -> C],
5787 * return the map A[B -> C] -> B.
5789 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5796 if (!isl_set_has_tuple_id(set
))
5797 return isl_map_domain_map(isl_set_unwrap(set
));
5799 id
= isl_set_get_tuple_id(set
);
5800 map
= isl_map_domain_map(isl_set_unwrap(set
));
5801 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5806 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5807 __isl_take isl_basic_set
*bset
)
5809 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5812 __isl_give isl_basic_map
*isl_basic_map_from_range(
5813 __isl_take isl_basic_set
*bset
)
5816 space
= isl_basic_set_get_space(bset
);
5817 space
= isl_space_from_range(space
);
5818 bset
= isl_basic_set_reset_space(bset
, space
);
5819 return bset_to_bmap(bset
);
5822 /* Create a relation with the given set as range.
5823 * The domain of the created relation is a zero-dimensional
5824 * flat anonymous space.
5826 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5829 space
= isl_set_get_space(set
);
5830 space
= isl_space_from_range(space
);
5831 set
= isl_set_reset_space(set
, space
);
5832 return set_to_map(set
);
5835 /* Create a relation with the given set as domain.
5836 * The range of the created relation is a zero-dimensional
5837 * flat anonymous space.
5839 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5841 return isl_map_reverse(isl_map_from_range(set
));
5844 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5845 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5847 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5850 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5851 __isl_take isl_set
*range
)
5853 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5856 /* Return a newly allocated isl_map with given space and flags and
5857 * room for "n" basic maps.
5858 * Make sure that all cached information is cleared.
5860 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5863 struct isl_map
*map
;
5868 isl_die(space
->ctx
, isl_error_internal
,
5869 "negative number of basic maps", goto error
);
5870 map
= isl_calloc(space
->ctx
, struct isl_map
,
5871 sizeof(struct isl_map
) +
5872 (n
- 1) * sizeof(struct isl_basic_map
*));
5876 map
->ctx
= space
->ctx
;
5877 isl_ctx_ref(map
->ctx
);
5885 isl_space_free(space
);
5889 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5891 struct isl_basic_map
*bmap
;
5892 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5893 bmap
= isl_basic_map_set_to_empty(bmap
);
5897 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5899 struct isl_basic_set
*bset
;
5900 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5901 bset
= isl_basic_set_set_to_empty(bset
);
5905 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5907 struct isl_basic_map
*bmap
;
5908 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5909 bmap
= isl_basic_map_finalize(bmap
);
5913 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5915 struct isl_basic_set
*bset
;
5916 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5917 bset
= isl_basic_set_finalize(bset
);
5921 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5924 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5925 isl_basic_map
*bmap
;
5927 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5928 for (i
= 0; i
< total
; ++i
) {
5929 int k
= isl_basic_map_alloc_inequality(bmap
);
5932 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5933 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5937 isl_basic_map_free(bmap
);
5941 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5943 return isl_basic_map_nat_universe(dim
);
5946 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5948 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5951 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5953 return isl_map_nat_universe(dim
);
5956 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5958 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5961 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5963 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5966 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5968 struct isl_map
*map
;
5971 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5972 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5976 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5978 struct isl_set
*set
;
5981 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5982 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5986 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5989 struct isl_map
*dup
;
5993 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5994 for (i
= 0; i
< map
->n
; ++i
)
5995 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5999 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6000 __isl_take isl_basic_map
*bmap
)
6004 if (isl_basic_map_plain_is_empty(bmap
)) {
6005 isl_basic_map_free(bmap
);
6008 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6009 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6010 map
->p
[map
->n
] = bmap
;
6012 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6018 isl_basic_map_free(bmap
);
6022 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6033 isl_ctx_deref(map
->ctx
);
6034 for (i
= 0; i
< map
->n
; ++i
)
6035 isl_basic_map_free(map
->p
[i
]);
6036 isl_space_free(map
->dim
);
6042 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
6043 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
6047 bmap
= isl_basic_map_cow(bmap
);
6048 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6049 j
= isl_basic_map_alloc_equality(bmap
);
6052 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6053 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6054 isl_int_set_si(bmap
->eq
[j
][0], value
);
6055 bmap
= isl_basic_map_simplify(bmap
);
6056 return isl_basic_map_finalize(bmap
);
6058 isl_basic_map_free(bmap
);
6062 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6063 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6067 bmap
= isl_basic_map_cow(bmap
);
6068 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6069 j
= isl_basic_map_alloc_equality(bmap
);
6072 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6073 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6074 isl_int_set(bmap
->eq
[j
][0], value
);
6075 bmap
= isl_basic_map_simplify(bmap
);
6076 return isl_basic_map_finalize(bmap
);
6078 isl_basic_map_free(bmap
);
6082 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6083 enum isl_dim_type type
, unsigned pos
, int value
)
6085 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6086 return isl_basic_map_free(bmap
);
6087 return isl_basic_map_fix_pos_si(bmap
,
6088 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6091 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6092 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6094 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6095 return isl_basic_map_free(bmap
);
6096 return isl_basic_map_fix_pos(bmap
,
6097 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6100 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6101 * to be equal to "v".
6103 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6104 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6108 if (!isl_val_is_int(v
))
6109 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6110 "expecting integer value", goto error
);
6111 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6113 pos
+= isl_basic_map_offset(bmap
, type
);
6114 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6118 isl_basic_map_free(bmap
);
6123 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6124 * to be equal to "v".
6126 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6127 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6129 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6132 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6133 enum isl_dim_type type
, unsigned pos
, int value
)
6135 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6139 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6140 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6142 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6146 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6147 unsigned input
, int value
)
6149 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6152 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6153 unsigned dim
, int value
)
6155 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6156 isl_dim_set
, dim
, value
));
6159 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
6161 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6168 isl_basic_map_free(map
->p
[i
]);
6169 if (i
!= map
->n
- 1) {
6170 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6171 map
->p
[i
] = map
->p
[map
->n
- 1];
6178 /* Perform "fn" on each basic map of "map", where we may not be holding
6179 * the only reference to "map".
6180 * In particular, "fn" should be a semantics preserving operation
6181 * that we want to apply to all copies of "map". We therefore need
6182 * to be careful not to modify "map" in a way that breaks "map"
6183 * in case anything goes wrong.
6185 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6186 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6188 struct isl_basic_map
*bmap
;
6194 for (i
= map
->n
- 1; i
>= 0; --i
) {
6195 bmap
= isl_basic_map_copy(map
->p
[i
]);
6199 isl_basic_map_free(map
->p
[i
]);
6201 if (remove_if_empty(map
, i
) < 0)
6211 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6212 enum isl_dim_type type
, unsigned pos
, int value
)
6216 map
= isl_map_cow(map
);
6220 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6221 for (i
= map
->n
- 1; i
>= 0; --i
) {
6222 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6223 if (remove_if_empty(map
, i
) < 0)
6226 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6233 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6234 enum isl_dim_type type
, unsigned pos
, int value
)
6236 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6239 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6240 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6244 map
= isl_map_cow(map
);
6248 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6249 for (i
= 0; i
< map
->n
; ++i
) {
6250 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6254 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6261 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6262 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6264 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6267 /* Fix the value of the variable at position "pos" of type "type" of "map"
6268 * to be equal to "v".
6270 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6271 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6275 map
= isl_map_cow(map
);
6279 if (!isl_val_is_int(v
))
6280 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6281 "expecting integer value", goto error
);
6282 if (pos
>= isl_map_dim(map
, type
))
6283 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6284 "index out of bounds", goto error
);
6285 for (i
= map
->n
- 1; i
>= 0; --i
) {
6286 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6288 if (remove_if_empty(map
, i
) < 0)
6291 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6300 /* Fix the value of the variable at position "pos" of type "type" of "set"
6301 * to be equal to "v".
6303 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6304 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6306 return isl_map_fix_val(set
, type
, pos
, v
);
6309 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6310 unsigned input
, int value
)
6312 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6315 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6317 return set_from_map(isl_map_fix_si(set_to_map(set
),
6318 isl_dim_set
, dim
, value
));
6321 static __isl_give isl_basic_map
*basic_map_bound_si(
6322 __isl_take isl_basic_map
*bmap
,
6323 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6327 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6328 return isl_basic_map_free(bmap
);
6329 pos
+= isl_basic_map_offset(bmap
, type
);
6330 bmap
= isl_basic_map_cow(bmap
);
6331 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6332 j
= isl_basic_map_alloc_inequality(bmap
);
6335 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6337 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6338 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6340 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6341 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6343 bmap
= isl_basic_map_simplify(bmap
);
6344 return isl_basic_map_finalize(bmap
);
6346 isl_basic_map_free(bmap
);
6350 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6351 __isl_take isl_basic_map
*bmap
,
6352 enum isl_dim_type type
, unsigned pos
, int value
)
6354 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6357 /* Constrain the values of the given dimension to be no greater than "value".
6359 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6360 __isl_take isl_basic_map
*bmap
,
6361 enum isl_dim_type type
, unsigned pos
, int value
)
6363 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6366 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6367 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6371 map
= isl_map_cow(map
);
6375 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6376 for (i
= 0; i
< map
->n
; ++i
) {
6377 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6378 type
, pos
, value
, upper
);
6382 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6389 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6390 enum isl_dim_type type
, unsigned pos
, int value
)
6392 return map_bound_si(map
, type
, pos
, value
, 0);
6395 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6396 enum isl_dim_type type
, unsigned pos
, int value
)
6398 return map_bound_si(map
, type
, pos
, value
, 1);
6401 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6402 enum isl_dim_type type
, unsigned pos
, int value
)
6404 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6408 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6409 enum isl_dim_type type
, unsigned pos
, int value
)
6411 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6414 /* Bound the given variable of "bmap" from below (or above is "upper"
6415 * is set) to "value".
6417 static __isl_give isl_basic_map
*basic_map_bound(
6418 __isl_take isl_basic_map
*bmap
,
6419 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6423 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6424 return isl_basic_map_free(bmap
);
6425 pos
+= isl_basic_map_offset(bmap
, type
);
6426 bmap
= isl_basic_map_cow(bmap
);
6427 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6428 j
= isl_basic_map_alloc_inequality(bmap
);
6431 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6433 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6434 isl_int_set(bmap
->ineq
[j
][0], value
);
6436 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6437 isl_int_neg(bmap
->ineq
[j
][0], value
);
6439 bmap
= isl_basic_map_simplify(bmap
);
6440 return isl_basic_map_finalize(bmap
);
6442 isl_basic_map_free(bmap
);
6446 /* Bound the given variable of "map" from below (or above is "upper"
6447 * is set) to "value".
6449 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6450 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6454 map
= isl_map_cow(map
);
6458 if (pos
>= isl_map_dim(map
, type
))
6459 isl_die(map
->ctx
, isl_error_invalid
,
6460 "index out of bounds", goto error
);
6461 for (i
= map
->n
- 1; i
>= 0; --i
) {
6462 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6463 if (remove_if_empty(map
, i
) < 0)
6466 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6473 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6474 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6476 return map_bound(map
, type
, pos
, value
, 0);
6479 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6480 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6482 return map_bound(map
, type
, pos
, value
, 1);
6485 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6486 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6488 return isl_map_lower_bound(set
, type
, pos
, value
);
6491 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6492 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6494 return isl_map_upper_bound(set
, type
, pos
, value
);
6497 /* Force the values of the variable at position "pos" of type "type" of "set"
6498 * to be no smaller than "value".
6500 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6501 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6505 if (!isl_val_is_int(value
))
6506 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6507 "expecting integer value", goto error
);
6508 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6509 isl_val_free(value
);
6512 isl_val_free(value
);
6517 /* Force the values of the variable at position "pos" of type "type" of "set"
6518 * to be no greater than "value".
6520 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6521 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6525 if (!isl_val_is_int(value
))
6526 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6527 "expecting integer value", goto error
);
6528 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6529 isl_val_free(value
);
6532 isl_val_free(value
);
6537 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6541 map
= isl_map_cow(map
);
6545 map
->dim
= isl_space_reverse(map
->dim
);
6548 for (i
= 0; i
< map
->n
; ++i
) {
6549 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6553 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6561 #define TYPE isl_pw_multi_aff
6563 #define SUFFIX _pw_multi_aff
6565 #define EMPTY isl_pw_multi_aff_empty
6567 #define ADD isl_pw_multi_aff_union_add
6568 #include "isl_map_lexopt_templ.c"
6570 /* Given a map "map", compute the lexicographically minimal
6571 * (or maximal) image element for each domain element in dom,
6572 * in the form of an isl_pw_multi_aff.
6573 * If "empty" is not NULL, then set *empty to those elements in dom that
6574 * do not have an image element.
6575 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6576 * should be computed over the domain of "map". "empty" is also NULL
6579 * We first compute the lexicographically minimal or maximal element
6580 * in the first basic map. This results in a partial solution "res"
6581 * and a subset "todo" of dom that still need to be handled.
6582 * We then consider each of the remaining maps in "map" and successively
6583 * update both "res" and "todo".
6584 * If "empty" is NULL, then the todo sets are not needed and therefore
6585 * also not computed.
6587 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6588 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6589 __isl_give isl_set
**empty
, unsigned flags
)
6593 isl_pw_multi_aff
*res
;
6596 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6597 if (!map
|| (!full
&& !dom
))
6600 if (isl_map_plain_is_empty(map
)) {
6605 return isl_pw_multi_aff_from_map(map
);
6608 res
= basic_map_partial_lexopt_pw_multi_aff(
6609 isl_basic_map_copy(map
->p
[0]),
6610 isl_set_copy(dom
), empty
, flags
);
6614 for (i
= 1; i
< map
->n
; ++i
) {
6615 isl_pw_multi_aff
*res_i
;
6617 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6618 isl_basic_map_copy(map
->p
[i
]),
6619 isl_set_copy(dom
), empty
, flags
);
6621 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6622 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6624 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6627 todo
= isl_set_intersect(todo
, *empty
);
6646 #define TYPE isl_map
6650 #define EMPTY isl_map_empty
6652 #define ADD isl_map_union_disjoint
6653 #include "isl_map_lexopt_templ.c"
6655 /* Given a map "map", compute the lexicographically minimal
6656 * (or maximal) image element for each domain element in "dom",
6657 * in the form of an isl_map.
6658 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6659 * do not have an image element.
6660 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6661 * should be computed over the domain of "map". "empty" is also NULL
6664 * If the input consists of more than one disjunct, then first
6665 * compute the desired result in the form of an isl_pw_multi_aff and
6666 * then convert that into an isl_map.
6668 * This function used to have an explicit implementation in terms
6669 * of isl_maps, but it would continually intersect the domains of
6670 * partial results with the complement of the domain of the next
6671 * partial solution, potentially leading to an explosion in the number
6672 * of disjuncts if there are several disjuncts in the input.
6673 * An even earlier implementation of this function would look for
6674 * better results in the domain of the partial result and for extra
6675 * results in the complement of this domain, which would lead to
6676 * even more splintering.
6678 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6679 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6680 __isl_give isl_set
**empty
, unsigned flags
)
6683 struct isl_map
*res
;
6684 isl_pw_multi_aff
*pma
;
6686 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6687 if (!map
|| (!full
&& !dom
))
6690 if (isl_map_plain_is_empty(map
)) {
6699 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6705 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6707 return isl_map_from_pw_multi_aff(pma
);
6716 __isl_give isl_map
*isl_map_partial_lexmax(
6717 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6718 __isl_give isl_set
**empty
)
6720 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6723 __isl_give isl_map
*isl_map_partial_lexmin(
6724 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6725 __isl_give isl_set
**empty
)
6727 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6730 __isl_give isl_set
*isl_set_partial_lexmin(
6731 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6732 __isl_give isl_set
**empty
)
6734 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6738 __isl_give isl_set
*isl_set_partial_lexmax(
6739 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6740 __isl_give isl_set
**empty
)
6742 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6746 /* Compute the lexicographic minimum (or maximum if "flags" includes
6747 * ISL_OPT_MAX) of "bset" over its parametric domain.
6749 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6752 return isl_basic_map_lexopt(bset
, flags
);
6755 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6757 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6760 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6762 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6765 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6767 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6770 /* Compute the lexicographic minimum of "bset" over its parametric domain
6771 * for the purpose of quantifier elimination.
6772 * That is, find an explicit representation for all the existentially
6773 * quantified variables in "bset" by computing their lexicographic
6776 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6777 __isl_take isl_basic_set
*bset
)
6779 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6782 /* Extract the first and only affine expression from list
6783 * and then add it to *pwaff with the given dom.
6784 * This domain is known to be disjoint from other domains
6785 * because of the way isl_basic_map_foreach_lexmax works.
6787 static isl_stat
update_dim_opt(__isl_take isl_basic_set
*dom
,
6788 __isl_take isl_aff_list
*list
, void *user
)
6790 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6792 isl_pw_aff
**pwaff
= user
;
6793 isl_pw_aff
*pwaff_i
;
6797 if (isl_aff_list_n_aff(list
) != 1)
6798 isl_die(ctx
, isl_error_internal
,
6799 "expecting single element list", goto error
);
6801 aff
= isl_aff_list_get_aff(list
, 0);
6802 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6804 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6806 isl_aff_list_free(list
);
6810 isl_basic_set_free(dom
);
6811 isl_aff_list_free(list
);
6812 return isl_stat_error
;
6815 /* Given a basic map with one output dimension, compute the minimum or
6816 * maximum of that dimension as an isl_pw_aff.
6818 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6819 * call update_dim_opt on each leaf of the result.
6821 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6824 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6828 dim
= isl_space_from_domain(isl_space_domain(dim
));
6829 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6830 pwaff
= isl_pw_aff_empty(dim
);
6832 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6834 return isl_pw_aff_free(pwaff
);
6839 /* Compute the minimum or maximum of the given output dimension
6840 * as a function of the parameters and the input dimensions,
6841 * but independently of the other output dimensions.
6843 * We first project out the other output dimension and then compute
6844 * the "lexicographic" maximum in each basic map, combining the results
6845 * using isl_pw_aff_union_max.
6847 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6854 n_out
= isl_map_dim(map
, isl_dim_out
);
6855 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6856 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6861 isl_space
*dim
= isl_map_get_space(map
);
6863 return isl_pw_aff_empty(dim
);
6866 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6867 for (i
= 1; i
< map
->n
; ++i
) {
6868 isl_pw_aff
*pwaff_i
;
6870 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6871 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6879 /* Compute the minimum of the given output dimension as a function of the
6880 * parameters and input dimensions, but independently of
6881 * the other output dimensions.
6883 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6885 return map_dim_opt(map
, pos
, 0);
6888 /* Compute the maximum of the given output dimension as a function of the
6889 * parameters and input dimensions, but independently of
6890 * the other output dimensions.
6892 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6894 return map_dim_opt(map
, pos
, 1);
6897 /* Compute the minimum or maximum of the given set dimension
6898 * as a function of the parameters,
6899 * but independently of the other set dimensions.
6901 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6904 return map_dim_opt(set
, pos
, max
);
6907 /* Compute the maximum of the given set dimension as a function of the
6908 * parameters, but independently of the other set dimensions.
6910 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6912 return set_dim_opt(set
, pos
, 1);
6915 /* Compute the minimum of the given set dimension as a function of the
6916 * parameters, but independently of the other set dimensions.
6918 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6920 return set_dim_opt(set
, pos
, 0);
6923 /* Apply a preimage specified by "mat" on the parameters of "bset".
6924 * bset is assumed to have only parameters and divs.
6926 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
6927 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
6934 bset
->dim
= isl_space_cow(bset
->dim
);
6938 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6940 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6942 bset
->dim
->nparam
= 0;
6943 bset
->dim
->n_out
= nparam
;
6944 bset
= isl_basic_set_preimage(bset
, mat
);
6946 bset
->dim
->nparam
= bset
->dim
->n_out
;
6947 bset
->dim
->n_out
= 0;
6952 isl_basic_set_free(bset
);
6956 /* Apply a preimage specified by "mat" on the parameters of "set".
6957 * set is assumed to have only parameters and divs.
6959 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
6960 __isl_take isl_mat
*mat
)
6968 nparam
= isl_set_dim(set
, isl_dim_param
);
6970 if (mat
->n_row
!= 1 + nparam
)
6971 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
6972 "unexpected number of rows", goto error
);
6974 space
= isl_set_get_space(set
);
6975 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
6976 isl_dim_param
, 0, nparam
);
6977 set
= isl_set_reset_space(set
, space
);
6978 set
= isl_set_preimage(set
, mat
);
6979 nparam
= isl_set_dim(set
, isl_dim_out
);
6980 space
= isl_set_get_space(set
);
6981 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
6982 isl_dim_out
, 0, nparam
);
6983 set
= isl_set_reset_space(set
, space
);
6991 /* Intersect the basic set "bset" with the affine space specified by the
6992 * equalities in "eq".
6994 static __isl_give isl_basic_set
*basic_set_append_equalities(
6995 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7003 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7008 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7009 for (i
= 0; i
< eq
->n_row
; ++i
) {
7010 k
= isl_basic_set_alloc_equality(bset
);
7013 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7014 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7018 bset
= isl_basic_set_gauss(bset
, NULL
);
7019 bset
= isl_basic_set_finalize(bset
);
7024 isl_basic_set_free(bset
);
7028 /* Intersect the set "set" with the affine space specified by the
7029 * equalities in "eq".
7031 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7039 for (i
= 0; i
< set
->n
; ++i
) {
7040 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7053 /* Given a basic set "bset" that only involves parameters and existentially
7054 * quantified variables, return the index of the first equality
7055 * that only involves parameters. If there is no such equality then
7056 * return bset->n_eq.
7058 * This function assumes that isl_basic_set_gauss has been called on "bset".
7060 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7063 unsigned nparam
, n_div
;
7068 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7069 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7071 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7072 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7079 /* Compute an explicit representation for the existentially quantified
7080 * variables in "bset" by computing the "minimal value" of the set
7081 * variables. Since there are no set variables, the computation of
7082 * the minimal value essentially computes an explicit representation
7083 * of the non-empty part(s) of "bset".
7085 * The input only involves parameters and existentially quantified variables.
7086 * All equalities among parameters have been removed.
7088 * Since the existentially quantified variables in the result are in general
7089 * going to be different from those in the input, we first replace
7090 * them by the minimal number of variables based on their equalities.
7091 * This should simplify the parametric integer programming.
7093 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7095 isl_morph
*morph1
, *morph2
;
7101 if (bset
->n_eq
== 0)
7102 return isl_basic_set_lexmin_compute_divs(bset
);
7104 morph1
= isl_basic_set_parameter_compression(bset
);
7105 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7106 bset
= isl_basic_set_lift(bset
);
7107 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7108 bset
= isl_morph_basic_set(morph2
, bset
);
7109 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7110 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7112 set
= isl_basic_set_lexmin_compute_divs(bset
);
7114 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7119 /* Project the given basic set onto its parameter domain, possibly introducing
7120 * new, explicit, existential variables in the constraints.
7121 * The input has parameters and (possibly implicit) existential variables.
7122 * The output has the same parameters, but only
7123 * explicit existentially quantified variables.
7125 * The actual projection is performed by pip, but pip doesn't seem
7126 * to like equalities very much, so we first remove the equalities
7127 * among the parameters by performing a variable compression on
7128 * the parameters. Afterward, an inverse transformation is performed
7129 * and the equalities among the parameters are inserted back in.
7131 * The variable compression on the parameters may uncover additional
7132 * equalities that were only implicit before. We therefore check
7133 * if there are any new parameter equalities in the result and
7134 * if so recurse. The removal of parameter equalities is required
7135 * for the parameter compression performed by base_compute_divs.
7137 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7141 struct isl_mat
*T
, *T2
;
7142 struct isl_set
*set
;
7145 bset
= isl_basic_set_cow(bset
);
7149 if (bset
->n_eq
== 0)
7150 return base_compute_divs(bset
);
7152 bset
= isl_basic_set_gauss(bset
, NULL
);
7155 if (isl_basic_set_plain_is_empty(bset
))
7156 return isl_set_from_basic_set(bset
);
7158 i
= first_parameter_equality(bset
);
7159 if (i
== bset
->n_eq
)
7160 return base_compute_divs(bset
);
7162 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7163 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7165 eq
= isl_mat_cow(eq
);
7166 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7167 if (T
&& T
->n_col
== 0) {
7171 bset
= isl_basic_set_set_to_empty(bset
);
7172 return isl_set_from_basic_set(bset
);
7174 bset
= basic_set_parameter_preimage(bset
, T
);
7176 i
= first_parameter_equality(bset
);
7179 else if (i
== bset
->n_eq
)
7180 set
= base_compute_divs(bset
);
7182 set
= parameter_compute_divs(bset
);
7183 set
= set_parameter_preimage(set
, T2
);
7184 set
= set_append_equalities(set
, eq
);
7188 /* Insert the divs from "ls" before those of "bmap".
7190 * The number of columns is not changed, which means that the last
7191 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7192 * The caller is responsible for removing the same number of dimensions
7193 * from the space of "bmap".
7195 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7196 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7202 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7206 old_n_div
= bmap
->n_div
;
7207 bmap
= insert_div_rows(bmap
, n_div
);
7211 for (i
= 0; i
< n_div
; ++i
) {
7212 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7213 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7219 /* Replace the space of "bmap" by the space and divs of "ls".
7221 * If "ls" has any divs, then we simplify the result since we may
7222 * have discovered some additional equalities that could simplify
7223 * the div expressions.
7225 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7226 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7230 bmap
= isl_basic_map_cow(bmap
);
7234 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7235 bmap
= insert_divs_from_local_space(bmap
, ls
);
7239 isl_space_free(bmap
->dim
);
7240 bmap
->dim
= isl_local_space_get_space(ls
);
7244 isl_local_space_free(ls
);
7246 bmap
= isl_basic_map_simplify(bmap
);
7247 bmap
= isl_basic_map_finalize(bmap
);
7250 isl_basic_map_free(bmap
);
7251 isl_local_space_free(ls
);
7255 /* Replace the space of "map" by the space and divs of "ls".
7257 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7258 __isl_take isl_local_space
*ls
)
7262 map
= isl_map_cow(map
);
7266 for (i
= 0; i
< map
->n
; ++i
) {
7267 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7268 isl_local_space_copy(ls
));
7272 isl_space_free(map
->dim
);
7273 map
->dim
= isl_local_space_get_space(ls
);
7277 isl_local_space_free(ls
);
7280 isl_local_space_free(ls
);
7285 /* Compute an explicit representation for the existentially
7286 * quantified variables for which do not know any explicit representation yet.
7288 * We first sort the existentially quantified variables so that the
7289 * existentially quantified variables for which we already have an explicit
7290 * representation are placed before those for which we do not.
7291 * The input dimensions, the output dimensions and the existentially
7292 * quantified variables for which we already have an explicit
7293 * representation are then turned into parameters.
7294 * compute_divs returns a map with the same parameters and
7295 * no input or output dimensions and the dimension specification
7296 * is reset to that of the input, including the existentially quantified
7297 * variables for which we already had an explicit representation.
7299 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
7301 struct isl_basic_set
*bset
;
7302 struct isl_set
*set
;
7303 struct isl_map
*map
;
7305 isl_local_space
*ls
;
7312 bmap
= isl_basic_map_sort_divs(bmap
);
7313 bmap
= isl_basic_map_cow(bmap
);
7317 n_known
= isl_basic_map_first_unknown_div(bmap
);
7319 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7321 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7322 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7323 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7324 dim
= isl_space_set_alloc(bmap
->ctx
,
7325 nparam
+ n_in
+ n_out
+ n_known
, 0);
7329 ls
= isl_basic_map_get_local_space(bmap
);
7330 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7331 n_known
, bmap
->n_div
- n_known
);
7333 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7334 swap_div(bmap
, i
- n_known
, i
);
7335 bmap
->n_div
-= n_known
;
7336 bmap
->extra
-= n_known
;
7338 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7339 bset
= bset_from_bmap(bmap
);
7341 set
= parameter_compute_divs(bset
);
7342 map
= set_to_map(set
);
7343 map
= replace_space_by_local_space(map
, ls
);
7347 isl_basic_map_free(bmap
);
7351 /* Remove the explicit representation of local variable "div",
7354 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7355 __isl_take isl_basic_map
*bmap
, int div
)
7359 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7361 return isl_basic_map_free(bmap
);
7365 bmap
= isl_basic_map_cow(bmap
);
7368 isl_int_set_si(bmap
->div
[div
][0], 0);
7372 /* Is local variable "div" of "bmap" marked as not having an explicit
7374 * Note that even if "div" is not marked in this way and therefore
7375 * has an explicit representation, this representation may still
7376 * depend (indirectly) on other local variables that do not
7377 * have an explicit representation.
7379 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7382 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7383 return isl_bool_error
;
7384 return isl_int_is_zero(bmap
->div
[div
][0]);
7387 /* Return the position of the first local variable that does not
7388 * have an explicit representation.
7389 * Return the total number of local variables if they all have
7390 * an explicit representation.
7391 * Return -1 on error.
7393 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7400 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7401 if (!isl_basic_map_div_is_known(bmap
, i
))
7407 /* Return the position of the first local variable that does not
7408 * have an explicit representation.
7409 * Return the total number of local variables if they all have
7410 * an explicit representation.
7411 * Return -1 on error.
7413 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7415 return isl_basic_map_first_unknown_div(bset
);
7418 /* Does "bmap" have an explicit representation for all local variables?
7420 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7424 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7425 first
= isl_basic_map_first_unknown_div(bmap
);
7427 return isl_bool_error
;
7431 /* Do all basic maps in "map" have an explicit representation
7432 * for all local variables?
7434 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7439 return isl_bool_error
;
7441 for (i
= 0; i
< map
->n
; ++i
) {
7442 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7447 return isl_bool_true
;
7450 /* If bmap contains any unknown divs, then compute explicit
7451 * expressions for them. However, this computation may be
7452 * quite expensive, so first try to remove divs that aren't
7455 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7458 struct isl_map
*map
;
7460 known
= isl_basic_map_divs_known(bmap
);
7464 return isl_map_from_basic_map(bmap
);
7466 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7468 known
= isl_basic_map_divs_known(bmap
);
7472 return isl_map_from_basic_map(bmap
);
7474 map
= compute_divs(bmap
);
7477 isl_basic_map_free(bmap
);
7481 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
7485 struct isl_map
*res
;
7492 known
= isl_map_divs_known(map
);
7500 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7501 for (i
= 1 ; i
< map
->n
; ++i
) {
7503 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7504 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7505 res
= isl_map_union_disjoint(res
, r2
);
7507 res
= isl_map_union(res
, r2
);
7514 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7516 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7519 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7521 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7524 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7527 struct isl_set
*set
;
7532 map
= isl_map_cow(map
);
7536 set
= set_from_map(map
);
7537 set
->dim
= isl_space_domain(set
->dim
);
7540 for (i
= 0; i
< map
->n
; ++i
) {
7541 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7545 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7546 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7553 /* Return the union of "map1" and "map2", where we assume for now that
7554 * "map1" and "map2" are disjoint. Note that the basic maps inside
7555 * "map1" or "map2" may not be disjoint from each other.
7556 * Also note that this function is also called from isl_map_union,
7557 * which takes care of handling the situation where "map1" and "map2"
7558 * may not be disjoint.
7560 * If one of the inputs is empty, we can simply return the other input.
7561 * Similarly, if one of the inputs is universal, then it is equal to the union.
7563 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7564 __isl_take isl_map
*map2
)
7568 struct isl_map
*map
= NULL
;
7574 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7575 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7576 "spaces don't match", goto error
);
7587 is_universe
= isl_map_plain_is_universe(map1
);
7588 if (is_universe
< 0)
7595 is_universe
= isl_map_plain_is_universe(map2
);
7596 if (is_universe
< 0)
7603 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7604 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7605 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7607 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7608 map1
->n
+ map2
->n
, flags
);
7611 for (i
= 0; i
< map1
->n
; ++i
) {
7612 map
= isl_map_add_basic_map(map
,
7613 isl_basic_map_copy(map1
->p
[i
]));
7617 for (i
= 0; i
< map2
->n
; ++i
) {
7618 map
= isl_map_add_basic_map(map
,
7619 isl_basic_map_copy(map2
->p
[i
]));
7633 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7634 * guaranteed to be disjoint by the caller.
7636 * Note that this functions is called from within isl_map_make_disjoint,
7637 * so we have to be careful not to touch the constraints of the inputs
7640 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7641 __isl_take isl_map
*map2
)
7643 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7646 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7647 * not be disjoint. The parameters are assumed to have been aligned.
7649 * We currently simply call map_union_disjoint, the internal operation
7650 * of which does not really depend on the inputs being disjoint.
7651 * If the result contains more than one basic map, then we clear
7652 * the disjoint flag since the result may contain basic maps from
7653 * both inputs and these are not guaranteed to be disjoint.
7655 * As a special case, if "map1" and "map2" are obviously equal,
7656 * then we simply return "map1".
7658 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7659 __isl_take isl_map
*map2
)
7666 equal
= isl_map_plain_is_equal(map1
, map2
);
7674 map1
= map_union_disjoint(map1
, map2
);
7678 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7686 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7689 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7690 __isl_take isl_map
*map2
)
7692 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7695 struct isl_set
*isl_set_union_disjoint(
7696 struct isl_set
*set1
, struct isl_set
*set2
)
7698 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7702 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7704 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7707 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7710 * "map" and "set" are assumed to be compatible and non-NULL.
7712 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7713 __isl_take isl_set
*set
,
7714 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7715 __isl_take isl_basic_set
*bset
))
7718 struct isl_map
*result
;
7721 if (isl_set_plain_is_universe(set
)) {
7726 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7727 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7728 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7730 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7731 map
->n
* set
->n
, flags
);
7732 for (i
= 0; result
&& i
< map
->n
; ++i
)
7733 for (j
= 0; j
< set
->n
; ++j
) {
7734 result
= isl_map_add_basic_map(result
,
7735 fn(isl_basic_map_copy(map
->p
[i
]),
7736 isl_basic_set_copy(set
->p
[j
])));
7746 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7747 __isl_take isl_set
*set
)
7751 ok
= isl_map_compatible_range(map
, set
);
7755 isl_die(set
->ctx
, isl_error_invalid
,
7756 "incompatible spaces", goto error
);
7758 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7765 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7766 __isl_take isl_set
*set
)
7768 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7771 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7772 __isl_take isl_set
*set
)
7776 ok
= isl_map_compatible_domain(map
, set
);
7780 isl_die(set
->ctx
, isl_error_invalid
,
7781 "incompatible spaces", goto error
);
7783 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7790 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7791 __isl_take isl_set
*set
)
7793 return isl_map_align_params_map_map_and(map
, set
,
7794 &map_intersect_domain
);
7797 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7798 __isl_take isl_map
*map2
)
7802 map1
= isl_map_reverse(map1
);
7803 map1
= isl_map_apply_range(map1
, map2
);
7804 return isl_map_reverse(map1
);
7811 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7812 __isl_take isl_map
*map2
)
7814 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7817 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7818 __isl_take isl_map
*map2
)
7820 isl_space
*dim_result
;
7821 struct isl_map
*result
;
7827 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7828 isl_space_copy(map2
->dim
));
7830 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7833 for (i
= 0; i
< map1
->n
; ++i
)
7834 for (j
= 0; j
< map2
->n
; ++j
) {
7835 result
= isl_map_add_basic_map(result
,
7836 isl_basic_map_apply_range(
7837 isl_basic_map_copy(map1
->p
[i
]),
7838 isl_basic_map_copy(map2
->p
[j
])));
7844 if (result
&& result
->n
<= 1)
7845 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7853 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7854 __isl_take isl_map
*map2
)
7856 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7860 * returns range - domain
7862 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
7864 isl_space
*target_space
;
7865 struct isl_basic_set
*bset
;
7872 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7873 bmap
->dim
, isl_dim_out
),
7875 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
7876 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
7877 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7878 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
7879 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
7880 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
7881 for (i
= 0; i
< dim
; ++i
) {
7882 int j
= isl_basic_map_alloc_equality(bmap
);
7884 bmap
= isl_basic_map_free(bmap
);
7887 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7888 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7889 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
7890 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7892 bset
= isl_basic_map_domain(bmap
);
7893 bset
= isl_basic_set_reset_space(bset
, target_space
);
7896 isl_basic_map_free(bmap
);
7901 * returns range - domain
7903 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7907 struct isl_set
*result
;
7912 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7913 map
->dim
, isl_dim_out
),
7915 dim
= isl_map_get_space(map
);
7916 dim
= isl_space_domain(dim
);
7917 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7920 for (i
= 0; i
< map
->n
; ++i
)
7921 result
= isl_set_add_basic_set(result
,
7922 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7931 * returns [domain -> range] -> range - domain
7933 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7934 __isl_take isl_basic_map
*bmap
)
7938 isl_basic_map
*domain
;
7942 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7943 bmap
->dim
, isl_dim_out
))
7944 isl_die(bmap
->ctx
, isl_error_invalid
,
7945 "domain and range don't match", goto error
);
7947 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7948 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7950 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7951 domain
= isl_basic_map_universe(dim
);
7953 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7954 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7955 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7957 total
= isl_basic_map_total_dim(bmap
);
7959 for (i
= 0; i
< n
; ++i
) {
7960 k
= isl_basic_map_alloc_equality(bmap
);
7963 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7964 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7965 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7966 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7969 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7970 return isl_basic_map_finalize(bmap
);
7972 isl_basic_map_free(bmap
);
7977 * returns [domain -> range] -> range - domain
7979 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7982 isl_space
*domain_dim
;
7987 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7988 map
->dim
, isl_dim_out
))
7989 isl_die(map
->ctx
, isl_error_invalid
,
7990 "domain and range don't match", goto error
);
7992 map
= isl_map_cow(map
);
7996 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7997 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7998 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
8001 for (i
= 0; i
< map
->n
; ++i
) {
8002 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8006 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8013 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
8015 struct isl_basic_map
*bmap
;
8023 nparam
= dims
->nparam
;
8025 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
8029 for (i
= 0; i
< dim
; ++i
) {
8030 int j
= isl_basic_map_alloc_equality(bmap
);
8033 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8034 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8035 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
8037 return isl_basic_map_finalize(bmap
);
8039 isl_basic_map_free(bmap
);
8043 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
8047 if (dim
->n_in
!= dim
->n_out
)
8048 isl_die(dim
->ctx
, isl_error_invalid
,
8049 "number of input and output dimensions needs to be "
8050 "the same", goto error
);
8051 return basic_map_identity(dim
);
8053 isl_space_free(dim
);
8057 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8059 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8062 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8064 isl_space
*dim
= isl_set_get_space(set
);
8066 id
= isl_map_identity(isl_space_map_from_set(dim
));
8067 return isl_map_intersect_range(id
, set
);
8070 /* Construct a basic set with all set dimensions having only non-negative
8073 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8074 __isl_take isl_space
*space
)
8079 struct isl_basic_set
*bset
;
8083 nparam
= space
->nparam
;
8085 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8088 for (i
= 0; i
< dim
; ++i
) {
8089 int k
= isl_basic_set_alloc_inequality(bset
);
8092 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8093 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8097 isl_basic_set_free(bset
);
8101 /* Construct the half-space x_pos >= 0.
8103 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
8107 isl_basic_set
*nonneg
;
8109 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8110 k
= isl_basic_set_alloc_inequality(nonneg
);
8113 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8114 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8116 return isl_basic_set_finalize(nonneg
);
8118 isl_basic_set_free(nonneg
);
8122 /* Construct the half-space x_pos <= -1.
8124 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
8129 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8130 k
= isl_basic_set_alloc_inequality(neg
);
8133 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8134 isl_int_set_si(neg
->ineq
[k
][0], -1);
8135 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8137 return isl_basic_set_finalize(neg
);
8139 isl_basic_set_free(neg
);
8143 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8144 enum isl_dim_type type
, unsigned first
, unsigned n
)
8148 isl_basic_set
*nonneg
;
8156 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8158 offset
= pos(set
->dim
, type
);
8159 for (i
= 0; i
< n
; ++i
) {
8160 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8161 offset
+ first
+ i
);
8162 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8164 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8173 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8175 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8181 return isl_stat_error
;
8182 if (isl_set_plain_is_empty(set
)) {
8187 return fn(set
, signs
, user
);
8190 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8192 half
= isl_set_intersect(half
, isl_set_copy(set
));
8193 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8197 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8199 half
= isl_set_intersect(half
, set
);
8200 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8203 return isl_stat_error
;
8206 /* Call "fn" on the intersections of "set" with each of the orthants
8207 * (except for obviously empty intersections). The orthant is identified
8208 * by the signs array, with each entry having value 1 or -1 according
8209 * to the sign of the corresponding variable.
8211 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8212 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8221 return isl_stat_error
;
8222 if (isl_set_plain_is_empty(set
))
8225 nparam
= isl_set_dim(set
, isl_dim_param
);
8226 nvar
= isl_set_dim(set
, isl_dim_set
);
8228 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8230 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8238 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8240 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8243 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8244 __isl_keep isl_basic_map
*bmap2
)
8247 struct isl_map
*map1
;
8248 struct isl_map
*map2
;
8250 if (!bmap1
|| !bmap2
)
8251 return isl_bool_error
;
8253 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8254 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8256 is_subset
= isl_map_is_subset(map1
, map2
);
8264 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8265 __isl_keep isl_basic_set
*bset2
)
8267 return isl_basic_map_is_subset(bset1
, bset2
);
8270 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8271 __isl_keep isl_basic_map
*bmap2
)
8275 if (!bmap1
|| !bmap2
)
8276 return isl_bool_error
;
8277 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8278 if (is_subset
!= isl_bool_true
)
8280 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8284 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8285 __isl_keep isl_basic_set
*bset2
)
8287 return isl_basic_map_is_equal(
8288 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8291 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8297 return isl_bool_error
;
8298 for (i
= 0; i
< map
->n
; ++i
) {
8299 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8301 return isl_bool_error
;
8303 return isl_bool_false
;
8305 return isl_bool_true
;
8308 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8310 return map
? map
->n
== 0 : isl_bool_error
;
8313 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8315 return set
? set
->n
== 0 : isl_bool_error
;
8318 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8320 return isl_map_is_empty(set_to_map(set
));
8323 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8324 __isl_keep isl_map
*map2
)
8327 return isl_bool_error
;
8329 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8332 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8333 __isl_keep isl_set
*set2
)
8336 return isl_bool_error
;
8338 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8341 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8346 return isl_bool_error
;
8347 is_subset
= isl_map_is_subset(map1
, map2
);
8348 if (is_subset
!= isl_bool_true
)
8350 is_subset
= isl_map_is_subset(map2
, map1
);
8354 /* Is "map1" equal to "map2"?
8356 * First check if they are obviously equal.
8357 * If not, then perform a more detailed analysis.
8359 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8363 equal
= isl_map_plain_is_equal(map1
, map2
);
8364 if (equal
< 0 || equal
)
8366 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8369 isl_bool
isl_basic_map_is_strict_subset(
8370 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8374 if (!bmap1
|| !bmap2
)
8375 return isl_bool_error
;
8376 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8377 if (is_subset
!= isl_bool_true
)
8379 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8380 if (is_subset
== isl_bool_error
)
8385 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8386 __isl_keep isl_map
*map2
)
8391 return isl_bool_error
;
8392 is_subset
= isl_map_is_subset(map1
, map2
);
8393 if (is_subset
!= isl_bool_true
)
8395 is_subset
= isl_map_is_subset(map2
, map1
);
8396 if (is_subset
== isl_bool_error
)
8401 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8402 __isl_keep isl_set
*set2
)
8404 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8407 /* Is "bmap" obviously equal to the universe with the same space?
8409 * That is, does it not have any constraints?
8411 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8414 return isl_bool_error
;
8415 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8418 /* Is "bset" obviously equal to the universe with the same space?
8420 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8422 return isl_basic_map_plain_is_universe(bset
);
8425 /* If "c" does not involve any existentially quantified variables,
8426 * then set *univ to false and abort
8428 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8430 isl_bool
*univ
= user
;
8433 n
= isl_constraint_dim(c
, isl_dim_div
);
8434 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8435 isl_constraint_free(c
);
8436 if (*univ
< 0 || !*univ
)
8437 return isl_stat_error
;
8441 /* Is "bmap" equal to the universe with the same space?
8443 * First check if it is obviously equal to the universe.
8444 * If not and if there are any constraints not involving
8445 * existentially quantified variables, then it is certainly
8446 * not equal to the universe.
8447 * Otherwise, check if the universe is a subset of "bmap".
8449 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8452 isl_basic_map
*test
;
8454 univ
= isl_basic_map_plain_is_universe(bmap
);
8455 if (univ
< 0 || univ
)
8457 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8458 return isl_bool_false
;
8459 univ
= isl_bool_true
;
8460 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8462 return isl_bool_error
;
8463 if (univ
< 0 || !univ
)
8465 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8466 univ
= isl_basic_map_is_subset(test
, bmap
);
8467 isl_basic_map_free(test
);
8471 /* Is "bset" equal to the universe with the same space?
8473 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8475 return isl_basic_map_is_universe(bset
);
8478 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8483 return isl_bool_error
;
8485 for (i
= 0; i
< map
->n
; ++i
) {
8486 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8491 return isl_bool_false
;
8494 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8496 return isl_map_plain_is_universe(set_to_map(set
));
8499 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8501 struct isl_basic_set
*bset
= NULL
;
8502 struct isl_vec
*sample
= NULL
;
8503 isl_bool empty
, non_empty
;
8506 return isl_bool_error
;
8508 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8509 return isl_bool_true
;
8511 if (isl_basic_map_plain_is_universe(bmap
))
8512 return isl_bool_false
;
8514 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8515 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8516 copy
= isl_basic_map_remove_redundancies(copy
);
8517 empty
= isl_basic_map_plain_is_empty(copy
);
8518 isl_basic_map_free(copy
);
8522 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8524 return isl_bool_error
;
8526 return isl_bool_false
;
8527 isl_vec_free(bmap
->sample
);
8528 bmap
->sample
= NULL
;
8529 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8531 return isl_bool_error
;
8532 sample
= isl_basic_set_sample_vec(bset
);
8534 return isl_bool_error
;
8535 empty
= sample
->size
== 0;
8536 isl_vec_free(bmap
->sample
);
8537 bmap
->sample
= sample
;
8539 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8544 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8547 return isl_bool_error
;
8548 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8551 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8554 return isl_bool_error
;
8555 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8558 /* Is "bmap" known to be non-empty?
8560 * That is, is the cached sample still valid?
8562 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8567 return isl_bool_error
;
8569 return isl_bool_false
;
8570 total
= 1 + isl_basic_map_total_dim(bmap
);
8571 if (bmap
->sample
->size
!= total
)
8572 return isl_bool_false
;
8573 return isl_basic_map_contains(bmap
, bmap
->sample
);
8576 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8578 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8581 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8582 __isl_take isl_basic_map
*bmap2
)
8584 struct isl_map
*map
;
8585 if (!bmap1
|| !bmap2
)
8588 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8590 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8593 map
= isl_map_add_basic_map(map
, bmap1
);
8594 map
= isl_map_add_basic_map(map
, bmap2
);
8597 isl_basic_map_free(bmap1
);
8598 isl_basic_map_free(bmap2
);
8602 struct isl_set
*isl_basic_set_union(
8603 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8605 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8606 bset_to_bmap(bset2
)));
8609 /* Order divs such that any div only depends on previous divs */
8610 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8611 __isl_take isl_basic_map
*bmap
)
8619 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8621 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8623 if (isl_int_is_zero(bmap
->div
[i
][0]))
8625 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8630 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8631 "integer division depends on itself",
8632 return isl_basic_map_free(bmap
));
8633 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8639 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8641 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8644 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8651 for (i
= 0; i
< map
->n
; ++i
) {
8652 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8663 /* Sort the local variables of "bset".
8665 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8666 __isl_take isl_basic_set
*bset
)
8668 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8671 /* Apply the expansion computed by isl_merge_divs.
8672 * The expansion itself is given by "exp" while the resulting
8673 * list of divs is given by "div".
8675 * Move the integer divisions of "bmap" into the right position
8676 * according to "exp" and then introduce the additional integer
8677 * divisions, adding div constraints.
8678 * The moving should be done first to avoid moving coefficients
8679 * in the definitions of the extra integer divisions.
8681 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8682 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8687 bmap
= isl_basic_map_cow(bmap
);
8691 if (div
->n_row
< bmap
->n_div
)
8692 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8693 "not an expansion", goto error
);
8695 n_div
= bmap
->n_div
;
8696 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8697 div
->n_row
- n_div
, 0,
8698 2 * (div
->n_row
- n_div
));
8700 for (i
= n_div
; i
< div
->n_row
; ++i
)
8701 if (isl_basic_map_alloc_div(bmap
) < 0)
8704 for (j
= n_div
- 1; j
>= 0; --j
) {
8707 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8710 for (i
= 0; i
< div
->n_row
; ++i
) {
8711 if (j
< n_div
&& exp
[j
] == i
) {
8714 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8715 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8717 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8725 isl_basic_map_free(bmap
);
8730 /* Apply the expansion computed by isl_merge_divs.
8731 * The expansion itself is given by "exp" while the resulting
8732 * list of divs is given by "div".
8734 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8735 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8737 return isl_basic_map_expand_divs(bset
, div
, exp
);
8740 /* Look for a div in dst that corresponds to the div "div" in src.
8741 * The divs before "div" in src and dst are assumed to be the same.
8743 * Returns -1 if no corresponding div was found and the position
8744 * of the corresponding div in dst otherwise.
8746 static int find_div(__isl_keep isl_basic_map
*dst
,
8747 __isl_keep isl_basic_map
*src
, unsigned div
)
8751 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8753 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8754 for (i
= div
; i
< dst
->n_div
; ++i
)
8755 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8756 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8757 dst
->n_div
- div
) == -1)
8762 /* Align the divs of "dst" to those of "src", adding divs from "src"
8763 * if needed. That is, make sure that the first src->n_div divs
8764 * of the result are equal to those of src.
8766 * The result is not finalized as by design it will have redundant
8767 * divs if any divs from "src" were copied.
8769 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8770 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8773 int known
, extended
;
8777 return isl_basic_map_free(dst
);
8779 if (src
->n_div
== 0)
8782 known
= isl_basic_map_divs_known(src
);
8784 return isl_basic_map_free(dst
);
8786 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8787 "some src divs are unknown",
8788 return isl_basic_map_free(dst
));
8790 src
= isl_basic_map_order_divs(src
);
8793 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8794 for (i
= 0; i
< src
->n_div
; ++i
) {
8795 int j
= find_div(dst
, src
, i
);
8798 int extra
= src
->n_div
- i
;
8799 dst
= isl_basic_map_cow(dst
);
8802 dst
= isl_basic_map_extend_space(dst
,
8803 isl_space_copy(dst
->dim
),
8804 extra
, 0, 2 * extra
);
8807 j
= isl_basic_map_alloc_div(dst
);
8809 return isl_basic_map_free(dst
);
8810 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8811 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8812 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8813 return isl_basic_map_free(dst
);
8816 isl_basic_map_swap_div(dst
, i
, j
);
8821 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
8829 map
= isl_map_compute_divs(map
);
8830 map
= isl_map_cow(map
);
8834 for (i
= 1; i
< map
->n
; ++i
)
8835 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8836 for (i
= 1; i
< map
->n
; ++i
) {
8837 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8839 return isl_map_free(map
);
8842 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8846 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
8848 return isl_map_align_divs_internal(map
);
8851 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8853 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
8856 /* Align the divs of the basic maps in "map" to those
8857 * of the basic maps in "list", as well as to the other basic maps in "map".
8858 * The elements in "list" are assumed to have known divs.
8860 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8861 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8865 map
= isl_map_compute_divs(map
);
8866 map
= isl_map_cow(map
);
8868 return isl_map_free(map
);
8872 n
= isl_basic_map_list_n_basic_map(list
);
8873 for (i
= 0; i
< n
; ++i
) {
8874 isl_basic_map
*bmap
;
8876 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8877 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8878 isl_basic_map_free(bmap
);
8881 return isl_map_free(map
);
8883 return isl_map_align_divs_internal(map
);
8886 /* Align the divs of each element of "list" to those of "bmap".
8887 * Both "bmap" and the elements of "list" are assumed to have known divs.
8889 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
8890 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
8895 return isl_basic_map_list_free(list
);
8897 n
= isl_basic_map_list_n_basic_map(list
);
8898 for (i
= 0; i
< n
; ++i
) {
8899 isl_basic_map
*bmap_i
;
8901 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
8902 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
8903 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
8909 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8910 __isl_take isl_map
*map
)
8914 ok
= isl_map_compatible_domain(map
, set
);
8918 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
8919 "incompatible spaces", goto error
);
8920 map
= isl_map_intersect_domain(map
, set
);
8921 set
= isl_map_range(map
);
8929 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8930 __isl_take isl_map
*map
)
8932 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8935 /* There is no need to cow as removing empty parts doesn't change
8936 * the meaning of the set.
8938 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8945 for (i
= map
->n
- 1; i
>= 0; --i
)
8946 remove_if_empty(map
, i
);
8951 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8953 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
8956 /* Given two basic sets bset1 and bset2, compute the maximal difference
8957 * between the values of dimension pos in bset1 and those in bset2
8958 * for any common value of the parameters and dimensions preceding pos.
8960 static enum isl_lp_result
basic_set_maximal_difference_at(
8961 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8962 int pos
, isl_int
*opt
)
8964 isl_basic_map
*bmap1
;
8965 isl_basic_map
*bmap2
;
8966 struct isl_ctx
*ctx
;
8967 struct isl_vec
*obj
;
8971 enum isl_lp_result res
;
8973 if (!bset1
|| !bset2
)
8974 return isl_lp_error
;
8976 nparam
= isl_basic_set_n_param(bset1
);
8977 dim1
= isl_basic_set_n_dim(bset1
);
8979 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
8980 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
8981 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
8982 isl_dim_out
, 0, pos
);
8983 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
8984 isl_dim_out
, 0, pos
);
8985 bmap1
= isl_basic_map_range_product(bmap1
, bmap2
);
8987 return isl_lp_error
;
8989 total
= isl_basic_map_total_dim(bmap1
);
8991 obj
= isl_vec_alloc(ctx
, 1 + total
);
8994 isl_seq_clr(obj
->block
.data
, 1 + total
);
8995 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8996 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8997 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8999 isl_basic_map_free(bmap1
);
9003 isl_basic_map_free(bmap1
);
9004 return isl_lp_error
;
9007 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9008 * for any common value of the parameters and dimensions preceding pos
9009 * in both basic sets, the values of dimension pos in bset1 are
9010 * smaller or larger than those in bset2.
9013 * 1 if bset1 follows bset2
9014 * -1 if bset1 precedes bset2
9015 * 0 if bset1 and bset2 are incomparable
9016 * -2 if some error occurred.
9018 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
9019 struct isl_basic_set
*bset2
, int pos
)
9022 enum isl_lp_result res
;
9027 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9029 if (res
== isl_lp_empty
)
9031 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9032 res
== isl_lp_unbounded
)
9034 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9043 /* Given two basic sets bset1 and bset2, check whether
9044 * for any common value of the parameters and dimensions preceding pos
9045 * there is a value of dimension pos in bset1 that is larger
9046 * than a value of the same dimension in bset2.
9049 * 1 if there exists such a pair
9050 * 0 if there is no such pair, but there is a pair of equal values
9052 * -2 if some error occurred.
9054 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9055 __isl_keep isl_basic_set
*bset2
, int pos
)
9058 enum isl_lp_result res
;
9063 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9065 if (res
== isl_lp_empty
)
9067 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9068 res
== isl_lp_unbounded
)
9070 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9072 else if (res
== isl_lp_ok
)
9081 /* Given two sets set1 and set2, check whether
9082 * for any common value of the parameters and dimensions preceding pos
9083 * there is a value of dimension pos in set1 that is larger
9084 * than a value of the same dimension in set2.
9087 * 1 if there exists such a pair
9088 * 0 if there is no such pair, but there is a pair of equal values
9090 * -2 if some error occurred.
9092 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9093 __isl_keep isl_set
*set2
, int pos
)
9101 for (i
= 0; i
< set1
->n
; ++i
)
9102 for (j
= 0; j
< set2
->n
; ++j
) {
9104 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9105 if (f
== 1 || f
== -2)
9114 static isl_bool
isl_basic_map_plain_has_fixed_var(
9115 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9122 return isl_bool_error
;
9123 total
= isl_basic_map_total_dim(bmap
);
9124 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9125 for (; d
+1 > pos
; --d
)
9126 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9130 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9131 return isl_bool_false
;
9132 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9133 return isl_bool_false
;
9134 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9135 return isl_bool_false
;
9137 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9138 return isl_bool_true
;
9140 return isl_bool_false
;
9143 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9144 unsigned pos
, isl_int
*val
)
9152 return isl_bool_error
;
9154 return isl_bool_false
;
9156 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9159 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9160 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9161 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9162 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9163 fixed
= isl_bool_false
;
9166 isl_int_set(*val
, v
);
9172 static isl_bool
isl_basic_set_plain_has_fixed_var(
9173 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9175 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9179 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9180 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9182 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9183 return isl_bool_error
;
9184 return isl_basic_map_plain_has_fixed_var(bmap
,
9185 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9188 /* If "bmap" obviously lies on a hyperplane where the given dimension
9189 * has a fixed value, then return that value.
9190 * Otherwise return NaN.
9192 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9193 __isl_keep isl_basic_map
*bmap
,
9194 enum isl_dim_type type
, unsigned pos
)
9202 ctx
= isl_basic_map_get_ctx(bmap
);
9203 v
= isl_val_alloc(ctx
);
9206 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9208 return isl_val_free(v
);
9210 isl_int_set_si(v
->d
, 1);
9214 return isl_val_nan(ctx
);
9217 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9218 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9220 if (pos
>= isl_map_dim(map
, type
))
9221 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9222 "position out of bounds", return isl_bool_error
);
9223 return isl_map_plain_has_fixed_var(map
,
9224 map_offset(map
, type
) - 1 + pos
, val
);
9227 /* If "map" obviously lies on a hyperplane where the given dimension
9228 * has a fixed value, then return that value.
9229 * Otherwise return NaN.
9231 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9232 enum isl_dim_type type
, unsigned pos
)
9240 ctx
= isl_map_get_ctx(map
);
9241 v
= isl_val_alloc(ctx
);
9244 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9246 return isl_val_free(v
);
9248 isl_int_set_si(v
->d
, 1);
9252 return isl_val_nan(ctx
);
9255 /* If "set" obviously lies on a hyperplane where the given dimension
9256 * has a fixed value, then return that value.
9257 * Otherwise return NaN.
9259 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9260 enum isl_dim_type type
, unsigned pos
)
9262 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9265 isl_bool
isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
9266 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9268 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
9271 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9272 * then return this fixed value in *val.
9274 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9275 unsigned dim
, isl_int
*val
)
9277 return isl_basic_set_plain_has_fixed_var(bset
,
9278 isl_basic_set_n_param(bset
) + dim
, val
);
9281 /* Return -1 if the constraint "c1" should be sorted before "c2"
9282 * and 1 if it should be sorted after "c2".
9283 * Return 0 if the two constraints are the same (up to the constant term).
9285 * In particular, if a constraint involves later variables than another
9286 * then it is sorted after this other constraint.
9287 * uset_gist depends on constraints without existentially quantified
9288 * variables sorting first.
9290 * For constraints that have the same latest variable, those
9291 * with the same coefficient for this latest variable (first in absolute value
9292 * and then in actual value) are grouped together.
9293 * This is useful for detecting pairs of constraints that can
9294 * be chained in their printed representation.
9296 * Finally, within a group, constraints are sorted according to
9297 * their coefficients (excluding the constant term).
9299 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9301 isl_int
**c1
= (isl_int
**) p1
;
9302 isl_int
**c2
= (isl_int
**) p2
;
9304 unsigned size
= *(unsigned *) arg
;
9307 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9308 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9313 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9316 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9320 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9323 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9324 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9325 * and 0 if the two constraints are the same (up to the constant term).
9327 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9328 isl_int
*c1
, isl_int
*c2
)
9334 total
= isl_basic_map_total_dim(bmap
);
9335 return sort_constraint_cmp(&c1
, &c2
, &total
);
9338 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9339 __isl_take isl_basic_map
*bmap
)
9345 if (bmap
->n_ineq
== 0)
9347 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9349 total
= isl_basic_map_total_dim(bmap
);
9350 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9351 &sort_constraint_cmp
, &total
) < 0)
9352 return isl_basic_map_free(bmap
);
9356 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9357 __isl_take isl_basic_set
*bset
)
9359 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9360 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9363 __isl_give isl_basic_map
*isl_basic_map_normalize(
9364 __isl_take isl_basic_map
*bmap
)
9368 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9370 bmap
= isl_basic_map_remove_redundancies(bmap
);
9371 bmap
= isl_basic_map_sort_constraints(bmap
);
9373 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9376 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9377 __isl_keep isl_basic_map
*bmap2
)
9381 isl_space
*space1
, *space2
;
9383 if (!bmap1
|| !bmap2
)
9388 space1
= isl_basic_map_peek_space(bmap1
);
9389 space2
= isl_basic_map_peek_space(bmap2
);
9390 cmp
= isl_space_cmp(space1
, space2
);
9393 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9394 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9395 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9396 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9397 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9399 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9401 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9403 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9404 return bmap1
->n_eq
- bmap2
->n_eq
;
9405 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9406 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9407 if (bmap1
->n_div
!= bmap2
->n_div
)
9408 return bmap1
->n_div
- bmap2
->n_div
;
9409 total
= isl_basic_map_total_dim(bmap1
);
9410 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9411 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9415 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9416 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9420 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9421 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9428 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9429 __isl_keep isl_basic_set
*bset2
)
9431 return isl_basic_map_plain_cmp(bset1
, bset2
);
9434 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9440 if (set1
->n
!= set2
->n
)
9441 return set1
->n
- set2
->n
;
9443 for (i
= 0; i
< set1
->n
; ++i
) {
9444 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9452 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9453 __isl_keep isl_basic_map
*bmap2
)
9455 if (!bmap1
|| !bmap2
)
9456 return isl_bool_error
;
9457 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9460 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9461 __isl_keep isl_basic_set
*bset2
)
9463 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9464 bset_to_bmap(bset2
));
9467 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9469 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9470 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9472 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9475 /* Sort the basic maps of "map" and remove duplicate basic maps.
9477 * While removing basic maps, we make sure that the basic maps remain
9478 * sorted because isl_map_normalize expects the basic maps of the result
9481 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9485 map
= isl_map_remove_empty_parts(map
);
9488 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9489 for (i
= map
->n
- 1; i
>= 1; --i
) {
9490 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9492 isl_basic_map_free(map
->p
[i
-1]);
9493 for (j
= i
; j
< map
->n
; ++j
)
9494 map
->p
[j
- 1] = map
->p
[j
];
9501 /* Remove obvious duplicates among the basic maps of "map".
9503 * Unlike isl_map_normalize, this function does not remove redundant
9504 * constraints and only removes duplicates that have exactly the same
9505 * constraints in the input. It does sort the constraints and
9506 * the basic maps to ease the detection of duplicates.
9508 * If "map" has already been normalized or if the basic maps are
9509 * disjoint, then there can be no duplicates.
9511 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9514 isl_basic_map
*bmap
;
9520 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9522 for (i
= 0; i
< map
->n
; ++i
) {
9523 bmap
= isl_basic_map_copy(map
->p
[i
]);
9524 bmap
= isl_basic_map_sort_constraints(bmap
);
9526 return isl_map_free(map
);
9527 isl_basic_map_free(map
->p
[i
]);
9531 map
= sort_and_remove_duplicates(map
);
9535 /* We normalize in place, but if anything goes wrong we need
9536 * to return NULL, so we need to make sure we don't change the
9537 * meaning of any possible other copies of map.
9539 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9542 struct isl_basic_map
*bmap
;
9546 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9548 for (i
= 0; i
< map
->n
; ++i
) {
9549 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9552 isl_basic_map_free(map
->p
[i
]);
9556 map
= sort_and_remove_duplicates(map
);
9558 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9565 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9567 return set_from_map(isl_map_normalize(set_to_map(set
)));
9570 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9571 __isl_keep isl_map
*map2
)
9577 return isl_bool_error
;
9580 return isl_bool_true
;
9581 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9582 return isl_bool_false
;
9584 map1
= isl_map_copy(map1
);
9585 map2
= isl_map_copy(map2
);
9586 map1
= isl_map_normalize(map1
);
9587 map2
= isl_map_normalize(map2
);
9590 equal
= map1
->n
== map2
->n
;
9591 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9592 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9602 return isl_bool_error
;
9605 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9606 __isl_keep isl_set
*set2
)
9608 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9611 /* Return the basic maps in "map" as a list.
9613 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9614 __isl_keep isl_map
*map
)
9618 isl_basic_map_list
*list
;
9622 ctx
= isl_map_get_ctx(map
);
9623 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9625 for (i
= 0; i
< map
->n
; ++i
) {
9626 isl_basic_map
*bmap
;
9628 bmap
= isl_basic_map_copy(map
->p
[i
]);
9629 list
= isl_basic_map_list_add(list
, bmap
);
9635 /* Return the intersection of the elements in the non-empty list "list".
9636 * All elements are assumed to live in the same space.
9638 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9639 __isl_take isl_basic_map_list
*list
)
9642 isl_basic_map
*bmap
;
9646 n
= isl_basic_map_list_n_basic_map(list
);
9648 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9649 "expecting non-empty list", goto error
);
9651 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9652 for (i
= 1; i
< n
; ++i
) {
9653 isl_basic_map
*bmap_i
;
9655 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9656 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9659 isl_basic_map_list_free(list
);
9662 isl_basic_map_list_free(list
);
9666 /* Return the intersection of the elements in the non-empty list "list".
9667 * All elements are assumed to live in the same space.
9669 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9670 __isl_take isl_basic_set_list
*list
)
9672 return isl_basic_map_list_intersect(list
);
9675 /* Return the union of the elements of "list".
9676 * The list is required to have at least one element.
9678 __isl_give isl_set
*isl_basic_set_list_union(
9679 __isl_take isl_basic_set_list
*list
)
9683 isl_basic_set
*bset
;
9688 n
= isl_basic_set_list_n_basic_set(list
);
9690 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9691 "expecting non-empty list", goto error
);
9693 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9694 space
= isl_basic_set_get_space(bset
);
9695 isl_basic_set_free(bset
);
9697 set
= isl_set_alloc_space(space
, n
, 0);
9698 for (i
= 0; i
< n
; ++i
) {
9699 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9700 set
= isl_set_add_basic_set(set
, bset
);
9703 isl_basic_set_list_free(list
);
9706 isl_basic_set_list_free(list
);
9710 /* Return the union of the elements in the non-empty list "list".
9711 * All elements are assumed to live in the same space.
9713 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9720 n
= isl_set_list_n_set(list
);
9722 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9723 "expecting non-empty list", goto error
);
9725 set
= isl_set_list_get_set(list
, 0);
9726 for (i
= 1; i
< n
; ++i
) {
9729 set_i
= isl_set_list_get_set(list
, i
);
9730 set
= isl_set_union(set
, set_i
);
9733 isl_set_list_free(list
);
9736 isl_set_list_free(list
);
9740 __isl_give isl_basic_map
*isl_basic_map_product(
9741 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9743 isl_space
*dim_result
= NULL
;
9744 struct isl_basic_map
*bmap
;
9745 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9746 struct isl_dim_map
*dim_map1
, *dim_map2
;
9748 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9750 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9751 isl_space_copy(bmap2
->dim
));
9753 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9754 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9755 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9756 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9757 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9759 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9760 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9761 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9762 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9763 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9764 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9765 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9766 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9767 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9768 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9769 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9771 bmap
= isl_basic_map_alloc_space(dim_result
,
9772 bmap1
->n_div
+ bmap2
->n_div
,
9773 bmap1
->n_eq
+ bmap2
->n_eq
,
9774 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9775 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9776 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9777 bmap
= isl_basic_map_simplify(bmap
);
9778 return isl_basic_map_finalize(bmap
);
9780 isl_basic_map_free(bmap1
);
9781 isl_basic_map_free(bmap2
);
9785 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9786 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9788 isl_basic_map
*prod
;
9790 prod
= isl_basic_map_product(bmap1
, bmap2
);
9791 prod
= isl_basic_map_flatten(prod
);
9795 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9796 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9798 return isl_basic_map_flat_range_product(bset1
, bset2
);
9801 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9802 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9804 isl_space
*space_result
= NULL
;
9805 isl_basic_map
*bmap
;
9806 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9807 struct isl_dim_map
*dim_map1
, *dim_map2
;
9809 if (!bmap1
|| !bmap2
)
9812 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9813 isl_space_copy(bmap2
->dim
));
9815 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9816 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9817 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9818 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9820 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9821 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9822 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9823 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9824 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9825 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9826 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9827 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9828 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9829 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9830 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9832 bmap
= isl_basic_map_alloc_space(space_result
,
9833 bmap1
->n_div
+ bmap2
->n_div
,
9834 bmap1
->n_eq
+ bmap2
->n_eq
,
9835 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9836 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9837 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9838 bmap
= isl_basic_map_simplify(bmap
);
9839 return isl_basic_map_finalize(bmap
);
9841 isl_basic_map_free(bmap1
);
9842 isl_basic_map_free(bmap2
);
9846 __isl_give isl_basic_map
*isl_basic_map_range_product(
9847 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9850 isl_space
*dim_result
= NULL
;
9851 isl_basic_map
*bmap
;
9852 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9853 struct isl_dim_map
*dim_map1
, *dim_map2
;
9855 rational
= isl_basic_map_is_rational(bmap1
);
9856 if (rational
>= 0 && rational
)
9857 rational
= isl_basic_map_is_rational(bmap2
);
9858 if (!bmap1
|| !bmap2
|| rational
< 0)
9861 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9864 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9865 isl_space_copy(bmap2
->dim
));
9867 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9868 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9869 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9870 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9872 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9873 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9874 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9875 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9876 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9877 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9878 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9879 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9880 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9881 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9882 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9884 bmap
= isl_basic_map_alloc_space(dim_result
,
9885 bmap1
->n_div
+ bmap2
->n_div
,
9886 bmap1
->n_eq
+ bmap2
->n_eq
,
9887 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9888 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9889 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9891 bmap
= isl_basic_map_set_rational(bmap
);
9892 bmap
= isl_basic_map_simplify(bmap
);
9893 return isl_basic_map_finalize(bmap
);
9895 isl_basic_map_free(bmap1
);
9896 isl_basic_map_free(bmap2
);
9900 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9901 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9903 isl_basic_map
*prod
;
9905 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9906 prod
= isl_basic_map_flatten_range(prod
);
9910 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
9911 * and collect the results.
9912 * The result live in the space obtained by calling "space_product"
9913 * on the spaces of "map1" and "map2".
9914 * If "remove_duplicates" is set then the result may contain duplicates
9915 * (even if the inputs do not) and so we try and remove the obvious
9918 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9919 __isl_take isl_map
*map2
,
9920 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
9921 __isl_take isl_space
*right
),
9922 __isl_give isl_basic_map
*(*basic_map_product
)(
9923 __isl_take isl_basic_map
*left
,
9924 __isl_take isl_basic_map
*right
),
9925 int remove_duplicates
)
9928 struct isl_map
*result
;
9932 m
= isl_map_has_equal_params(map1
, map2
);
9936 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
9937 "parameters don't match", goto error
);
9939 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9940 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9941 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9943 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
9944 isl_space_copy(map2
->dim
)),
9945 map1
->n
* map2
->n
, flags
);
9948 for (i
= 0; i
< map1
->n
; ++i
)
9949 for (j
= 0; j
< map2
->n
; ++j
) {
9950 struct isl_basic_map
*part
;
9951 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9952 isl_basic_map_copy(map2
->p
[j
]));
9953 if (isl_basic_map_is_empty(part
))
9954 isl_basic_map_free(part
);
9956 result
= isl_map_add_basic_map(result
, part
);
9960 if (remove_duplicates
)
9961 result
= isl_map_remove_obvious_duplicates(result
);
9971 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9973 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9974 __isl_take isl_map
*map2
)
9976 return map_product(map1
, map2
, &isl_space_product
,
9977 &isl_basic_map_product
, 0);
9980 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9981 __isl_take isl_map
*map2
)
9983 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9986 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9988 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9989 __isl_take isl_map
*map2
)
9993 prod
= isl_map_product(map1
, map2
);
9994 prod
= isl_map_flatten(prod
);
9998 /* Given two set A and B, construct its Cartesian product A x B.
10000 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10002 return isl_map_range_product(set1
, set2
);
10005 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10006 __isl_take isl_set
*set2
)
10008 return isl_map_flat_range_product(set1
, set2
);
10011 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10013 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10014 __isl_take isl_map
*map2
)
10016 return map_product(map1
, map2
, &isl_space_domain_product
,
10017 &isl_basic_map_domain_product
, 1);
10020 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10022 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10023 __isl_take isl_map
*map2
)
10025 return map_product(map1
, map2
, &isl_space_range_product
,
10026 &isl_basic_map_range_product
, 1);
10029 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10030 __isl_take isl_map
*map2
)
10032 return isl_map_align_params_map_map_and(map1
, map2
,
10033 &map_domain_product_aligned
);
10036 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10037 __isl_take isl_map
*map2
)
10039 return isl_map_align_params_map_map_and(map1
, map2
,
10040 &map_range_product_aligned
);
10043 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10045 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10048 int total1
, keep1
, total2
, keep2
;
10052 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10053 !isl_space_range_is_wrapping(map
->dim
))
10054 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10055 "not a product", return isl_map_free(map
));
10057 space
= isl_map_get_space(map
);
10058 total1
= isl_space_dim(space
, isl_dim_in
);
10059 total2
= isl_space_dim(space
, isl_dim_out
);
10060 space
= isl_space_factor_domain(space
);
10061 keep1
= isl_space_dim(space
, isl_dim_in
);
10062 keep2
= isl_space_dim(space
, isl_dim_out
);
10063 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10064 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10065 map
= isl_map_reset_space(map
, space
);
10070 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10072 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10075 int total1
, keep1
, total2
, keep2
;
10079 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10080 !isl_space_range_is_wrapping(map
->dim
))
10081 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10082 "not a product", return isl_map_free(map
));
10084 space
= isl_map_get_space(map
);
10085 total1
= isl_space_dim(space
, isl_dim_in
);
10086 total2
= isl_space_dim(space
, isl_dim_out
);
10087 space
= isl_space_factor_range(space
);
10088 keep1
= isl_space_dim(space
, isl_dim_in
);
10089 keep2
= isl_space_dim(space
, isl_dim_out
);
10090 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10091 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10092 map
= isl_map_reset_space(map
, space
);
10097 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10099 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10106 if (!isl_space_domain_is_wrapping(map
->dim
))
10107 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10108 "domain is not a product", return isl_map_free(map
));
10110 space
= isl_map_get_space(map
);
10111 total
= isl_space_dim(space
, isl_dim_in
);
10112 space
= isl_space_domain_factor_domain(space
);
10113 keep
= isl_space_dim(space
, isl_dim_in
);
10114 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10115 map
= isl_map_reset_space(map
, space
);
10120 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10122 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10129 if (!isl_space_domain_is_wrapping(map
->dim
))
10130 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10131 "domain is not a product", return isl_map_free(map
));
10133 space
= isl_map_get_space(map
);
10134 total
= isl_space_dim(space
, isl_dim_in
);
10135 space
= isl_space_domain_factor_range(space
);
10136 keep
= isl_space_dim(space
, isl_dim_in
);
10137 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10138 map
= isl_map_reset_space(map
, space
);
10143 /* Given a map A -> [B -> C], extract the map A -> B.
10145 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10152 if (!isl_space_range_is_wrapping(map
->dim
))
10153 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10154 "range is not a product", return isl_map_free(map
));
10156 space
= isl_map_get_space(map
);
10157 total
= isl_space_dim(space
, isl_dim_out
);
10158 space
= isl_space_range_factor_domain(space
);
10159 keep
= isl_space_dim(space
, isl_dim_out
);
10160 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10161 map
= isl_map_reset_space(map
, space
);
10166 /* Given a map A -> [B -> C], extract the map A -> C.
10168 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10175 if (!isl_space_range_is_wrapping(map
->dim
))
10176 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10177 "range is not a product", return isl_map_free(map
));
10179 space
= isl_map_get_space(map
);
10180 total
= isl_space_dim(space
, isl_dim_out
);
10181 space
= isl_space_range_factor_range(space
);
10182 keep
= isl_space_dim(space
, isl_dim_out
);
10183 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10184 map
= isl_map_reset_space(map
, space
);
10189 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10191 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10192 __isl_take isl_map
*map2
)
10196 prod
= isl_map_domain_product(map1
, map2
);
10197 prod
= isl_map_flatten_domain(prod
);
10201 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10203 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10204 __isl_take isl_map
*map2
)
10208 prod
= isl_map_range_product(map1
, map2
);
10209 prod
= isl_map_flatten_range(prod
);
10213 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10216 uint32_t hash
= isl_hash_init();
10221 bmap
= isl_basic_map_copy(bmap
);
10222 bmap
= isl_basic_map_normalize(bmap
);
10225 total
= isl_basic_map_total_dim(bmap
);
10226 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10227 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10229 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10230 isl_hash_hash(hash
, c_hash
);
10232 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10233 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10235 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10236 isl_hash_hash(hash
, c_hash
);
10238 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10239 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10241 if (isl_int_is_zero(bmap
->div
[i
][0]))
10243 isl_hash_byte(hash
, i
& 0xFF);
10244 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10245 isl_hash_hash(hash
, c_hash
);
10247 isl_basic_map_free(bmap
);
10251 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10253 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10256 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10263 map
= isl_map_copy(map
);
10264 map
= isl_map_normalize(map
);
10268 hash
= isl_hash_init();
10269 for (i
= 0; i
< map
->n
; ++i
) {
10270 uint32_t bmap_hash
;
10271 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10272 isl_hash_hash(hash
, bmap_hash
);
10280 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10282 return isl_map_get_hash(set_to_map(set
));
10285 /* Return the number of basic maps in the (current) representation of "map".
10287 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10289 return map
? map
->n
: 0;
10292 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10294 return set
? set
->n
: 0;
10297 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10298 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10303 return isl_stat_error
;
10305 for (i
= 0; i
< map
->n
; ++i
)
10306 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10307 return isl_stat_error
;
10309 return isl_stat_ok
;
10312 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10313 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10318 return isl_stat_error
;
10320 for (i
= 0; i
< set
->n
; ++i
)
10321 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10322 return isl_stat_error
;
10324 return isl_stat_ok
;
10327 /* Return a list of basic sets, the union of which is equal to "set".
10329 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10330 __isl_keep isl_set
*set
)
10333 isl_basic_set_list
*list
;
10338 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10339 for (i
= 0; i
< set
->n
; ++i
) {
10340 isl_basic_set
*bset
;
10342 bset
= isl_basic_set_copy(set
->p
[i
]);
10343 list
= isl_basic_set_list_add(list
, bset
);
10349 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10356 bset
= isl_basic_set_cow(bset
);
10360 dim
= isl_basic_set_get_space(bset
);
10361 dim
= isl_space_lift(dim
, bset
->n_div
);
10364 isl_space_free(bset
->dim
);
10366 bset
->extra
-= bset
->n_div
;
10369 bset
= isl_basic_set_finalize(bset
);
10373 isl_basic_set_free(bset
);
10377 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10383 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10388 set
= isl_set_cow(set
);
10392 n_div
= set
->p
[0]->n_div
;
10393 dim
= isl_set_get_space(set
);
10394 dim
= isl_space_lift(dim
, n_div
);
10397 isl_space_free(set
->dim
);
10400 for (i
= 0; i
< set
->n
; ++i
) {
10401 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10412 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10420 dim
= isl_basic_set_total_dim(bset
);
10421 size
+= bset
->n_eq
* (1 + dim
);
10422 size
+= bset
->n_ineq
* (1 + dim
);
10423 size
+= bset
->n_div
* (2 + dim
);
10428 int isl_set_size(__isl_keep isl_set
*set
)
10436 for (i
= 0; i
< set
->n
; ++i
)
10437 size
+= isl_basic_set_size(set
->p
[i
]);
10442 /* Check if there is any lower bound (if lower == 0) and/or upper
10443 * bound (if upper == 0) on the specified dim.
10445 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10446 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10450 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10451 return isl_bool_error
;
10453 pos
+= isl_basic_map_offset(bmap
, type
);
10455 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10456 if (isl_int_is_zero(bmap
->div
[i
][0]))
10458 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10459 return isl_bool_true
;
10462 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10463 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10464 return isl_bool_true
;
10466 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10467 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10474 return lower
&& upper
;
10477 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10478 enum isl_dim_type type
, unsigned pos
)
10480 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10483 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10484 enum isl_dim_type type
, unsigned pos
)
10486 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10489 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10490 enum isl_dim_type type
, unsigned pos
)
10492 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10495 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10496 enum isl_dim_type type
, unsigned pos
)
10501 return isl_bool_error
;
10503 for (i
= 0; i
< map
->n
; ++i
) {
10505 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10506 if (bounded
< 0 || !bounded
)
10510 return isl_bool_true
;
10513 /* Return true if the specified dim is involved in both an upper bound
10514 * and a lower bound.
10516 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10517 enum isl_dim_type type
, unsigned pos
)
10519 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10522 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10524 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10525 enum isl_dim_type type
, unsigned pos
,
10526 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10527 enum isl_dim_type type
, unsigned pos
))
10532 return isl_bool_error
;
10534 for (i
= 0; i
< map
->n
; ++i
) {
10536 bounded
= fn(map
->p
[i
], type
, pos
);
10537 if (bounded
< 0 || bounded
)
10541 return isl_bool_false
;
10544 /* Return 1 if the specified dim is involved in any lower bound.
10546 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10547 enum isl_dim_type type
, unsigned pos
)
10549 return has_any_bound(set
, type
, pos
,
10550 &isl_basic_map_dim_has_lower_bound
);
10553 /* Return 1 if the specified dim is involved in any upper bound.
10555 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10556 enum isl_dim_type type
, unsigned pos
)
10558 return has_any_bound(set
, type
, pos
,
10559 &isl_basic_map_dim_has_upper_bound
);
10562 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10564 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10565 enum isl_dim_type type
, unsigned pos
,
10566 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10567 enum isl_dim_type type
, unsigned pos
))
10572 return isl_bool_error
;
10574 for (i
= 0; i
< map
->n
; ++i
) {
10576 bounded
= fn(map
->p
[i
], type
, pos
);
10577 if (bounded
< 0 || !bounded
)
10581 return isl_bool_true
;
10584 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10586 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10587 enum isl_dim_type type
, unsigned pos
)
10589 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10592 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10594 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10595 enum isl_dim_type type
, unsigned pos
)
10597 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10600 /* For each of the "n" variables starting at "first", determine
10601 * the sign of the variable and put the results in the first "n"
10602 * elements of the array "signs".
10604 * 1 means that the variable is non-negative
10605 * -1 means that the variable is non-positive
10606 * 0 means the variable attains both positive and negative values.
10608 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10609 unsigned first
, unsigned n
, int *signs
)
10611 isl_vec
*bound
= NULL
;
10612 struct isl_tab
*tab
= NULL
;
10613 struct isl_tab_undo
*snap
;
10616 if (!bset
|| !signs
)
10617 return isl_stat_error
;
10619 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10620 tab
= isl_tab_from_basic_set(bset
, 0);
10621 if (!bound
|| !tab
)
10624 isl_seq_clr(bound
->el
, bound
->size
);
10625 isl_int_set_si(bound
->el
[0], -1);
10627 snap
= isl_tab_snap(tab
);
10628 for (i
= 0; i
< n
; ++i
) {
10631 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10632 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10634 empty
= tab
->empty
;
10635 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10636 if (isl_tab_rollback(tab
, snap
) < 0)
10644 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10645 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10647 empty
= tab
->empty
;
10648 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10649 if (isl_tab_rollback(tab
, snap
) < 0)
10652 signs
[i
] = empty
? -1 : 0;
10656 isl_vec_free(bound
);
10657 return isl_stat_ok
;
10660 isl_vec_free(bound
);
10661 return isl_stat_error
;
10664 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10665 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10667 if (!bset
|| !signs
)
10668 return isl_stat_error
;
10669 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10670 return isl_stat_error
);
10672 first
+= pos(bset
->dim
, type
) - 1;
10673 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10676 /* Is it possible for the integer division "div" to depend (possibly
10677 * indirectly) on any output dimensions?
10679 * If the div is undefined, then we conservatively assume that it
10680 * may depend on them.
10681 * Otherwise, we check if it actually depends on them or on any integer
10682 * divisions that may depend on them.
10684 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10687 unsigned n_out
, o_out
;
10688 unsigned n_div
, o_div
;
10690 if (isl_int_is_zero(bmap
->div
[div
][0]))
10691 return isl_bool_true
;
10693 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10694 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10696 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10697 return isl_bool_true
;
10699 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10700 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10702 for (i
= 0; i
< n_div
; ++i
) {
10703 isl_bool may_involve
;
10705 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10707 may_involve
= div_may_involve_output(bmap
, i
);
10708 if (may_involve
< 0 || may_involve
)
10709 return may_involve
;
10712 return isl_bool_false
;
10715 /* Return the first integer division of "bmap" in the range
10716 * [first, first + n[ that may depend on any output dimensions and
10717 * that has a non-zero coefficient in "c" (where the first coefficient
10718 * in "c" corresponds to integer division "first").
10720 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10721 isl_int
*c
, int first
, int n
)
10728 for (k
= first
; k
< first
+ n
; ++k
) {
10729 isl_bool may_involve
;
10731 if (isl_int_is_zero(c
[k
]))
10733 may_involve
= div_may_involve_output(bmap
, k
);
10734 if (may_involve
< 0)
10743 /* Look for a pair of inequality constraints in "bmap" of the form
10745 * -l + i >= 0 or i >= l
10747 * n + l - i >= 0 or i <= l + n
10749 * with n < "m" and i the output dimension at position "pos".
10750 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10751 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10752 * and earlier output dimensions, as well as integer divisions that do
10753 * not involve any of the output dimensions.
10755 * Return the index of the first inequality constraint or bmap->n_ineq
10756 * if no such pair can be found.
10758 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10759 int pos
, isl_int m
)
10764 unsigned n_div
, o_div
;
10765 unsigned n_out
, o_out
;
10771 ctx
= isl_basic_map_get_ctx(bmap
);
10772 total
= isl_basic_map_total_dim(bmap
);
10773 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10774 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10775 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10776 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10777 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10778 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10780 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10781 n_out
- (pos
+ 1)) != -1)
10783 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10786 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10787 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10790 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10791 bmap
->ineq
[j
] + 1, total
))
10795 if (j
>= bmap
->n_ineq
)
10797 isl_int_add(bmap
->ineq
[i
][0],
10798 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10799 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10800 isl_int_sub(bmap
->ineq
[i
][0],
10801 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10804 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10810 return bmap
->n_ineq
;
10813 /* Return the index of the equality of "bmap" that defines
10814 * the output dimension "pos" in terms of earlier dimensions.
10815 * The equality may also involve integer divisions, as long
10816 * as those integer divisions are defined in terms of
10817 * parameters or input dimensions.
10818 * In this case, *div is set to the number of integer divisions and
10819 * *ineq is set to the number of inequality constraints (provided
10820 * div and ineq are not NULL).
10822 * The equality may also involve a single integer division involving
10823 * the output dimensions (typically only output dimension "pos") as
10824 * long as the coefficient of output dimension "pos" is 1 or -1 and
10825 * there is a pair of constraints i >= l and i <= l + n, with i referring
10826 * to output dimension "pos", l an expression involving only earlier
10827 * dimensions and n smaller than the coefficient of the integer division
10828 * in the equality. In this case, the output dimension can be defined
10829 * in terms of a modulo expression that does not involve the integer division.
10830 * *div is then set to this single integer division and
10831 * *ineq is set to the index of constraint i >= l.
10833 * Return bmap->n_eq if there is no such equality.
10834 * Return -1 on error.
10836 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10837 int pos
, int *div
, int *ineq
)
10840 unsigned n_out
, o_out
;
10841 unsigned n_div
, o_div
;
10846 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10847 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10848 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10849 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10852 *ineq
= bmap
->n_ineq
;
10855 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10856 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10858 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10859 n_out
- (pos
+ 1)) != -1)
10861 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10865 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
10866 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
10868 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10869 k
+ 1, n_div
- (k
+1)) < n_div
)
10871 l
= find_modulo_constraint_pair(bmap
, pos
,
10872 bmap
->eq
[j
][o_div
+ k
]);
10875 if (l
>= bmap
->n_ineq
)
10887 /* Check if the given basic map is obviously single-valued.
10888 * In particular, for each output dimension, check that there is
10889 * an equality that defines the output dimension in terms of
10890 * earlier dimensions.
10892 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10898 return isl_bool_error
;
10900 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10902 for (i
= 0; i
< n_out
; ++i
) {
10905 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
10908 return isl_bool_error
;
10909 if (eq
>= bmap
->n_eq
)
10910 return isl_bool_false
;
10913 return isl_bool_true
;
10916 /* Check if the given basic map is single-valued.
10917 * We simply compute
10921 * and check if the result is a subset of the identity mapping.
10923 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10926 isl_basic_map
*test
;
10930 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10934 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10935 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10937 space
= isl_basic_map_get_space(bmap
);
10938 space
= isl_space_map_from_set(isl_space_range(space
));
10939 id
= isl_basic_map_identity(space
);
10941 sv
= isl_basic_map_is_subset(test
, id
);
10943 isl_basic_map_free(test
);
10944 isl_basic_map_free(id
);
10949 /* Check if the given map is obviously single-valued.
10951 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10954 return isl_bool_error
;
10956 return isl_bool_true
;
10958 return isl_bool_false
;
10960 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10963 /* Check if the given map is single-valued.
10964 * We simply compute
10968 * and check if the result is a subset of the identity mapping.
10970 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
10977 sv
= isl_map_plain_is_single_valued(map
);
10981 test
= isl_map_reverse(isl_map_copy(map
));
10982 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10984 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10985 id
= isl_map_identity(dim
);
10987 sv
= isl_map_is_subset(test
, id
);
10989 isl_map_free(test
);
10995 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
10999 map
= isl_map_copy(map
);
11000 map
= isl_map_reverse(map
);
11001 in
= isl_map_is_single_valued(map
);
11007 /* Check if the given map is obviously injective.
11009 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11013 map
= isl_map_copy(map
);
11014 map
= isl_map_reverse(map
);
11015 in
= isl_map_plain_is_single_valued(map
);
11021 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11025 sv
= isl_map_is_single_valued(map
);
11029 return isl_map_is_injective(map
);
11032 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11034 return isl_map_is_single_valued(set_to_map(set
));
11037 /* Does "map" only map elements to themselves?
11039 * If the domain and range spaces are different, then "map"
11040 * is considered not to be an identity relation, even if it is empty.
11041 * Otherwise, construct the maximal identity relation and
11042 * check whether "map" is a subset of this relation.
11044 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11048 isl_bool equal
, is_identity
;
11050 space
= isl_map_get_space(map
);
11051 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11052 isl_space_free(space
);
11053 if (equal
< 0 || !equal
)
11056 id
= isl_map_identity(isl_map_get_space(map
));
11057 is_identity
= isl_map_is_subset(map
, id
);
11060 return is_identity
;
11063 int isl_map_is_translation(__isl_keep isl_map
*map
)
11068 delta
= isl_map_deltas(isl_map_copy(map
));
11069 ok
= isl_set_is_singleton(delta
);
11070 isl_set_free(delta
);
11075 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11077 if (isl_seq_first_non_zero(p
, pos
) != -1)
11079 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11084 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11091 return isl_bool_error
;
11093 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11094 return isl_bool_false
;
11096 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11097 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11098 for (j
= 0; j
< nvar
; ++j
) {
11099 int lower
= 0, upper
= 0;
11100 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11101 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11103 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11104 return isl_bool_false
;
11107 if (i
< bset
->n_eq
)
11109 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11110 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11112 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11113 return isl_bool_false
;
11114 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11119 if (!lower
|| !upper
)
11120 return isl_bool_false
;
11123 return isl_bool_true
;
11126 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11129 return isl_bool_error
;
11131 return isl_bool_false
;
11133 return isl_basic_set_is_box(set
->p
[0]);
11136 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11139 return isl_bool_error
;
11141 return isl_space_is_wrapping(bset
->dim
);
11144 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11147 return isl_bool_error
;
11149 return isl_space_is_wrapping(set
->dim
);
11152 /* Modify the space of "map" through a call to "change".
11153 * If "can_change" is set (not NULL), then first call it to check
11154 * if the modification is allowed, printing the error message "cannot_change"
11157 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11158 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11159 const char *cannot_change
,
11160 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11168 ok
= can_change
? can_change(map
) : isl_bool_true
;
11170 return isl_map_free(map
);
11172 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11173 return isl_map_free(map
));
11175 space
= change(isl_map_get_space(map
));
11176 map
= isl_map_reset_space(map
, space
);
11181 /* Is the domain of "map" a wrapped relation?
11183 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11186 return isl_bool_error
;
11188 return isl_space_domain_is_wrapping(map
->dim
);
11191 /* Is the range of "map" a wrapped relation?
11193 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11196 return isl_bool_error
;
11198 return isl_space_range_is_wrapping(map
->dim
);
11201 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11203 bmap
= isl_basic_map_cow(bmap
);
11207 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11211 bmap
= isl_basic_map_finalize(bmap
);
11213 return bset_from_bmap(bmap
);
11215 isl_basic_map_free(bmap
);
11219 /* Given a map A -> B, return the set (A -> B).
11221 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11223 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11226 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11228 bset
= isl_basic_set_cow(bset
);
11232 bset
->dim
= isl_space_unwrap(bset
->dim
);
11236 bset
= isl_basic_set_finalize(bset
);
11238 return bset_to_bmap(bset
);
11240 isl_basic_set_free(bset
);
11244 /* Given a set (A -> B), return the map A -> B.
11245 * Error out if "set" is not of the form (A -> B).
11247 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11249 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11250 "not a wrapping set", &isl_space_unwrap
);
11253 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11254 enum isl_dim_type type
)
11259 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11262 bmap
= isl_basic_map_cow(bmap
);
11266 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11270 bmap
= isl_basic_map_finalize(bmap
);
11274 isl_basic_map_free(bmap
);
11278 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11279 enum isl_dim_type type
)
11286 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11289 map
= isl_map_cow(map
);
11293 for (i
= 0; i
< map
->n
; ++i
) {
11294 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11298 map
->dim
= isl_space_reset(map
->dim
, type
);
11308 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11313 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11316 bmap
= isl_basic_map_cow(bmap
);
11320 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11324 bmap
= isl_basic_map_finalize(bmap
);
11328 isl_basic_map_free(bmap
);
11332 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11334 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11337 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11338 __isl_take isl_basic_map
*bmap
)
11343 if (!bmap
->dim
->nested
[0])
11346 bmap
= isl_basic_map_cow(bmap
);
11350 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11354 bmap
= isl_basic_map_finalize(bmap
);
11358 isl_basic_map_free(bmap
);
11362 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11363 __isl_take isl_basic_map
*bmap
)
11368 if (!bmap
->dim
->nested
[1])
11371 bmap
= isl_basic_map_cow(bmap
);
11375 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11379 bmap
= isl_basic_map_finalize(bmap
);
11383 isl_basic_map_free(bmap
);
11387 /* Remove any internal structure from the spaces of domain and range of "map".
11389 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11394 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11397 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11400 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11402 return set_from_map(isl_map_flatten(set_to_map(set
)));
11405 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11407 isl_space
*dim
, *flat_dim
;
11410 dim
= isl_set_get_space(set
);
11411 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11412 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11413 map
= isl_map_intersect_domain(map
, set
);
11418 /* Remove any internal structure from the space of the domain of "map".
11420 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11425 if (!map
->dim
->nested
[0])
11428 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11431 /* Remove any internal structure from the space of the range of "map".
11433 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11438 if (!map
->dim
->nested
[1])
11441 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11444 /* Reorder the dimensions of "bmap" according to the given dim_map
11445 * and set the dimension specification to "dim" and
11446 * perform Gaussian elimination on the result.
11448 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11449 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11451 isl_basic_map
*res
;
11454 bmap
= isl_basic_map_cow(bmap
);
11455 if (!bmap
|| !dim
|| !dim_map
)
11458 flags
= bmap
->flags
;
11459 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11460 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11461 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11462 res
= isl_basic_map_alloc_space(dim
,
11463 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11464 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11466 res
->flags
= flags
;
11467 res
= isl_basic_map_gauss(res
, NULL
);
11468 res
= isl_basic_map_finalize(res
);
11472 isl_basic_map_free(bmap
);
11473 isl_space_free(dim
);
11477 /* Reorder the dimensions of "map" according to given reordering.
11479 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11480 __isl_take isl_reordering
*r
)
11483 struct isl_dim_map
*dim_map
;
11485 map
= isl_map_cow(map
);
11486 dim_map
= isl_dim_map_from_reordering(r
);
11487 if (!map
|| !r
|| !dim_map
)
11490 for (i
= 0; i
< map
->n
; ++i
) {
11491 struct isl_dim_map
*dim_map_i
;
11493 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11495 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11496 isl_space_copy(r
->dim
), dim_map_i
);
11502 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11504 isl_reordering_free(r
);
11510 isl_reordering_free(r
);
11514 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11515 __isl_take isl_reordering
*r
)
11517 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11520 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11521 __isl_take isl_space
*model
)
11526 if (!map
|| !model
)
11529 ctx
= isl_space_get_ctx(model
);
11530 if (!isl_space_has_named_params(model
))
11531 isl_die(ctx
, isl_error_invalid
,
11532 "model has unnamed parameters", goto error
);
11533 if (isl_map_check_named_params(map
) < 0)
11535 aligned
= isl_map_space_has_equal_params(map
, model
);
11539 isl_reordering
*exp
;
11541 model
= isl_space_drop_dims(model
, isl_dim_in
,
11542 0, isl_space_dim(model
, isl_dim_in
));
11543 model
= isl_space_drop_dims(model
, isl_dim_out
,
11544 0, isl_space_dim(model
, isl_dim_out
));
11545 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11546 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11547 map
= isl_map_realign(map
, exp
);
11550 isl_space_free(model
);
11553 isl_space_free(model
);
11558 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11559 __isl_take isl_space
*model
)
11561 return isl_map_align_params(set
, model
);
11564 /* Align the parameters of "bmap" to those of "model", introducing
11565 * additional parameters if needed.
11567 __isl_give isl_basic_map
*isl_basic_map_align_params(
11568 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11571 isl_bool equal_params
;
11573 if (!bmap
|| !model
)
11576 ctx
= isl_space_get_ctx(model
);
11577 if (!isl_space_has_named_params(model
))
11578 isl_die(ctx
, isl_error_invalid
,
11579 "model has unnamed parameters", goto error
);
11580 if (!isl_space_has_named_params(bmap
->dim
))
11581 isl_die(ctx
, isl_error_invalid
,
11582 "relation has unnamed parameters", goto error
);
11583 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11584 if (equal_params
< 0)
11586 if (!equal_params
) {
11587 isl_reordering
*exp
;
11588 struct isl_dim_map
*dim_map
;
11590 model
= isl_space_drop_dims(model
, isl_dim_in
,
11591 0, isl_space_dim(model
, isl_dim_in
));
11592 model
= isl_space_drop_dims(model
, isl_dim_out
,
11593 0, isl_space_dim(model
, isl_dim_out
));
11594 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11595 exp
= isl_reordering_extend_space(exp
,
11596 isl_basic_map_get_space(bmap
));
11597 dim_map
= isl_dim_map_from_reordering(exp
);
11598 bmap
= isl_basic_map_realign(bmap
,
11599 exp
? isl_space_copy(exp
->dim
) : NULL
,
11600 isl_dim_map_extend(dim_map
, bmap
));
11601 isl_reordering_free(exp
);
11605 isl_space_free(model
);
11608 isl_space_free(model
);
11609 isl_basic_map_free(bmap
);
11613 /* Do "bset" and "space" have the same parameters?
11615 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11616 __isl_keep isl_space
*space
)
11618 isl_space
*bset_space
;
11620 bset_space
= isl_basic_set_peek_space(bset
);
11621 return isl_space_has_equal_params(bset_space
, space
);
11624 /* Do "map" and "space" have the same parameters?
11626 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11627 __isl_keep isl_space
*space
)
11629 isl_space
*map_space
;
11631 map_space
= isl_map_peek_space(map
);
11632 return isl_space_has_equal_params(map_space
, space
);
11635 /* Do "set" and "space" have the same parameters?
11637 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11638 __isl_keep isl_space
*space
)
11640 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11643 /* Align the parameters of "bset" to those of "model", introducing
11644 * additional parameters if needed.
11646 __isl_give isl_basic_set
*isl_basic_set_align_params(
11647 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11649 return isl_basic_map_align_params(bset
, model
);
11652 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11653 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11654 enum isl_dim_type c2
, enum isl_dim_type c3
,
11655 enum isl_dim_type c4
, enum isl_dim_type c5
)
11657 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11658 struct isl_mat
*mat
;
11664 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11665 isl_basic_map_total_dim(bmap
) + 1);
11668 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11669 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11670 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11671 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11672 isl_int_set(mat
->row
[i
][pos
],
11673 bmap
->eq
[i
][off
+ k
]);
11681 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11682 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11683 enum isl_dim_type c2
, enum isl_dim_type c3
,
11684 enum isl_dim_type c4
, enum isl_dim_type c5
)
11686 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11687 struct isl_mat
*mat
;
11693 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11694 isl_basic_map_total_dim(bmap
) + 1);
11697 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11698 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11699 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11700 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11701 isl_int_set(mat
->row
[i
][pos
],
11702 bmap
->ineq
[i
][off
+ k
]);
11710 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11711 __isl_take isl_space
*dim
,
11712 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11713 enum isl_dim_type c2
, enum isl_dim_type c3
,
11714 enum isl_dim_type c4
, enum isl_dim_type c5
)
11716 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11717 isl_basic_map
*bmap
;
11723 if (!dim
|| !eq
|| !ineq
)
11726 if (eq
->n_col
!= ineq
->n_col
)
11727 isl_die(dim
->ctx
, isl_error_invalid
,
11728 "equalities and inequalities matrices should have "
11729 "same number of columns", goto error
);
11731 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11733 if (eq
->n_col
< total
)
11734 isl_die(dim
->ctx
, isl_error_invalid
,
11735 "number of columns too small", goto error
);
11737 extra
= eq
->n_col
- total
;
11739 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11740 eq
->n_row
, ineq
->n_row
);
11743 for (i
= 0; i
< extra
; ++i
) {
11744 k
= isl_basic_map_alloc_div(bmap
);
11747 isl_int_set_si(bmap
->div
[k
][0], 0);
11749 for (i
= 0; i
< eq
->n_row
; ++i
) {
11750 l
= isl_basic_map_alloc_equality(bmap
);
11753 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11754 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11755 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11756 isl_int_set(bmap
->eq
[l
][off
+ k
],
11762 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11763 l
= isl_basic_map_alloc_inequality(bmap
);
11766 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11767 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11768 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11769 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11770 ineq
->row
[i
][pos
]);
11776 isl_space_free(dim
);
11778 isl_mat_free(ineq
);
11780 bmap
= isl_basic_map_simplify(bmap
);
11781 return isl_basic_map_finalize(bmap
);
11783 isl_space_free(dim
);
11785 isl_mat_free(ineq
);
11789 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11790 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11791 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11793 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11794 c1
, c2
, c3
, c4
, isl_dim_in
);
11797 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11798 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11799 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11801 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11802 c1
, c2
, c3
, c4
, isl_dim_in
);
11805 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11806 __isl_take isl_space
*dim
,
11807 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11808 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11810 isl_basic_map
*bmap
;
11811 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11812 c1
, c2
, c3
, c4
, isl_dim_in
);
11813 return bset_from_bmap(bmap
);
11816 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11819 return isl_bool_error
;
11821 return isl_space_can_zip(bmap
->dim
);
11824 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11827 return isl_bool_error
;
11829 return isl_space_can_zip(map
->dim
);
11832 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11833 * (A -> C) -> (B -> D).
11835 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11844 if (!isl_basic_map_can_zip(bmap
))
11845 isl_die(bmap
->ctx
, isl_error_invalid
,
11846 "basic map cannot be zipped", goto error
);
11847 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11848 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11849 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11850 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11851 bmap
= isl_basic_map_cow(bmap
);
11852 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11855 bmap
->dim
= isl_space_zip(bmap
->dim
);
11858 bmap
= isl_basic_map_mark_final(bmap
);
11861 isl_basic_map_free(bmap
);
11865 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11866 * (A -> C) -> (B -> D).
11868 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11875 if (!isl_map_can_zip(map
))
11876 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
11879 map
= isl_map_cow(map
);
11883 for (i
= 0; i
< map
->n
; ++i
) {
11884 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
11889 map
->dim
= isl_space_zip(map
->dim
);
11899 /* Can we apply isl_basic_map_curry to "bmap"?
11900 * That is, does it have a nested relation in its domain?
11902 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
11905 return isl_bool_error
;
11907 return isl_space_can_curry(bmap
->dim
);
11910 /* Can we apply isl_map_curry to "map"?
11911 * That is, does it have a nested relation in its domain?
11913 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
11916 return isl_bool_error
;
11918 return isl_space_can_curry(map
->dim
);
11921 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11924 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
11930 if (!isl_basic_map_can_curry(bmap
))
11931 isl_die(bmap
->ctx
, isl_error_invalid
,
11932 "basic map cannot be curried", goto error
);
11933 bmap
= isl_basic_map_cow(bmap
);
11936 bmap
->dim
= isl_space_curry(bmap
->dim
);
11939 bmap
= isl_basic_map_mark_final(bmap
);
11942 isl_basic_map_free(bmap
);
11946 /* Given a map (A -> B) -> C, return the corresponding map
11949 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11951 return isl_map_change_space(map
, &isl_map_can_curry
,
11952 "map cannot be curried", &isl_space_curry
);
11955 /* Can isl_map_range_curry be applied to "map"?
11956 * That is, does it have a nested relation in its range,
11957 * the domain of which is itself a nested relation?
11959 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
11962 return isl_bool_error
;
11964 return isl_space_can_range_curry(map
->dim
);
11967 /* Given a map A -> ((B -> C) -> D), return the corresponding map
11968 * A -> (B -> (C -> D)).
11970 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
11972 return isl_map_change_space(map
, &isl_map_can_range_curry
,
11973 "map range cannot be curried",
11974 &isl_space_range_curry
);
11977 /* Can we apply isl_basic_map_uncurry to "bmap"?
11978 * That is, does it have a nested relation in its domain?
11980 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11983 return isl_bool_error
;
11985 return isl_space_can_uncurry(bmap
->dim
);
11988 /* Can we apply isl_map_uncurry to "map"?
11989 * That is, does it have a nested relation in its domain?
11991 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
11994 return isl_bool_error
;
11996 return isl_space_can_uncurry(map
->dim
);
11999 /* Given a basic map A -> (B -> C), return the corresponding basic map
12002 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12008 if (!isl_basic_map_can_uncurry(bmap
))
12009 isl_die(bmap
->ctx
, isl_error_invalid
,
12010 "basic map cannot be uncurried",
12011 return isl_basic_map_free(bmap
));
12012 bmap
= isl_basic_map_cow(bmap
);
12015 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12017 return isl_basic_map_free(bmap
);
12018 bmap
= isl_basic_map_mark_final(bmap
);
12022 /* Given a map A -> (B -> C), return the corresponding map
12025 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12027 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12028 "map cannot be uncurried", &isl_space_uncurry
);
12031 /* Construct a basic map mapping the domain of the affine expression
12032 * to a one-dimensional range prescribed by the affine expression.
12033 * If "rational" is set, then construct a rational basic map.
12035 * A NaN affine expression cannot be converted to a basic map.
12037 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
12038 __isl_take isl_aff
*aff
, int rational
)
12043 isl_local_space
*ls
;
12044 isl_basic_map
*bmap
= NULL
;
12048 is_nan
= isl_aff_is_nan(aff
);
12052 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
12053 "cannot convert NaN", goto error
);
12055 ls
= isl_aff_get_local_space(aff
);
12056 bmap
= isl_basic_map_from_local_space(ls
);
12057 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
12058 k
= isl_basic_map_alloc_equality(bmap
);
12062 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
12063 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
12064 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
12065 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
12066 aff
->v
->size
- (pos
+ 1));
12070 bmap
= isl_basic_map_set_rational(bmap
);
12071 bmap
= isl_basic_map_gauss(bmap
, NULL
);
12072 bmap
= isl_basic_map_finalize(bmap
);
12076 isl_basic_map_free(bmap
);
12080 /* Construct a basic map mapping the domain of the affine expression
12081 * to a one-dimensional range prescribed by the affine expression.
12083 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
12085 return isl_basic_map_from_aff2(aff
, 0);
12088 /* Construct a map mapping the domain of the affine expression
12089 * to a one-dimensional range prescribed by the affine expression.
12091 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
12093 isl_basic_map
*bmap
;
12095 bmap
= isl_basic_map_from_aff(aff
);
12096 return isl_map_from_basic_map(bmap
);
12099 /* Construct a basic map mapping the domain the multi-affine expression
12100 * to its range, with each dimension in the range equated to the
12101 * corresponding affine expression.
12102 * If "rational" is set, then construct a rational basic map.
12104 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
12105 __isl_take isl_multi_aff
*maff
, int rational
)
12109 isl_basic_map
*bmap
;
12114 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
12115 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
12116 "invalid space", goto error
);
12118 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
12119 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
12121 bmap
= isl_basic_map_set_rational(bmap
);
12123 for (i
= 0; i
< maff
->n
; ++i
) {
12125 isl_basic_map
*bmap_i
;
12127 aff
= isl_aff_copy(maff
->p
[i
]);
12128 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
12130 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12133 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
12135 isl_multi_aff_free(maff
);
12138 isl_multi_aff_free(maff
);
12142 /* Construct a basic map mapping the domain the multi-affine expression
12143 * to its range, with each dimension in the range equated to the
12144 * corresponding affine expression.
12146 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
12147 __isl_take isl_multi_aff
*ma
)
12149 return isl_basic_map_from_multi_aff2(ma
, 0);
12152 /* Construct a map mapping the domain the multi-affine expression
12153 * to its range, with each dimension in the range equated to the
12154 * corresponding affine expression.
12156 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
12158 isl_basic_map
*bmap
;
12160 bmap
= isl_basic_map_from_multi_aff(maff
);
12161 return isl_map_from_basic_map(bmap
);
12164 /* Construct a basic map mapping a domain in the given space to
12165 * to an n-dimensional range, with n the number of elements in the list,
12166 * where each coordinate in the range is prescribed by the
12167 * corresponding affine expression.
12168 * The domains of all affine expressions in the list are assumed to match
12171 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
12172 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
12176 isl_basic_map
*bmap
;
12181 dim
= isl_space_from_domain(domain_dim
);
12182 bmap
= isl_basic_map_universe(dim
);
12184 for (i
= 0; i
< list
->n
; ++i
) {
12186 isl_basic_map
*bmap_i
;
12188 aff
= isl_aff_copy(list
->p
[i
]);
12189 bmap_i
= isl_basic_map_from_aff(aff
);
12191 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12194 isl_aff_list_free(list
);
12198 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12199 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12201 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12204 /* Construct a basic map where the given dimensions are equal to each other.
12206 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12207 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12209 isl_basic_map
*bmap
= NULL
;
12215 if (pos1
>= isl_space_dim(space
, type1
))
12216 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12217 "index out of bounds", goto error
);
12218 if (pos2
>= isl_space_dim(space
, type2
))
12219 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12220 "index out of bounds", goto error
);
12222 if (type1
== type2
&& pos1
== pos2
)
12223 return isl_basic_map_universe(space
);
12225 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12226 i
= isl_basic_map_alloc_equality(bmap
);
12229 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12230 pos1
+= isl_basic_map_offset(bmap
, type1
);
12231 pos2
+= isl_basic_map_offset(bmap
, type2
);
12232 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12233 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12234 bmap
= isl_basic_map_finalize(bmap
);
12235 isl_space_free(space
);
12238 isl_space_free(space
);
12239 isl_basic_map_free(bmap
);
12243 /* Add a constraint imposing that the given two dimensions are equal.
12245 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12246 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12250 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12252 bmap
= isl_basic_map_intersect(bmap
, eq
);
12257 /* Add a constraint imposing that the given two dimensions are equal.
12259 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12260 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12262 isl_basic_map
*bmap
;
12264 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12266 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12271 /* Add a constraint imposing that the given two dimensions have opposite values.
12273 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12274 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12276 isl_basic_map
*bmap
= NULL
;
12282 if (pos1
>= isl_map_dim(map
, type1
))
12283 isl_die(map
->ctx
, isl_error_invalid
,
12284 "index out of bounds", goto error
);
12285 if (pos2
>= isl_map_dim(map
, type2
))
12286 isl_die(map
->ctx
, isl_error_invalid
,
12287 "index out of bounds", goto error
);
12289 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12290 i
= isl_basic_map_alloc_equality(bmap
);
12293 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12294 pos1
+= isl_basic_map_offset(bmap
, type1
);
12295 pos2
+= isl_basic_map_offset(bmap
, type2
);
12296 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12297 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12298 bmap
= isl_basic_map_finalize(bmap
);
12300 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12304 isl_basic_map_free(bmap
);
12309 /* Construct a constraint imposing that the value of the first dimension is
12310 * greater than or equal to that of the second.
12312 static __isl_give isl_constraint
*constraint_order_ge(
12313 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12314 enum isl_dim_type type2
, int pos2
)
12321 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12323 if (pos1
>= isl_constraint_dim(c
, type1
))
12324 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12325 "index out of bounds", return isl_constraint_free(c
));
12326 if (pos2
>= isl_constraint_dim(c
, type2
))
12327 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12328 "index out of bounds", return isl_constraint_free(c
));
12330 if (type1
== type2
&& pos1
== pos2
)
12333 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12334 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12339 /* Add a constraint imposing that the value of the first dimension is
12340 * greater than or equal to that of the second.
12342 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12343 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12348 if (type1
== type2
&& pos1
== pos2
)
12350 space
= isl_basic_map_get_space(bmap
);
12351 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12352 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12357 /* Add a constraint imposing that the value of the first dimension is
12358 * greater than or equal to that of the second.
12360 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12361 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12366 if (type1
== type2
&& pos1
== pos2
)
12368 space
= isl_map_get_space(map
);
12369 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12370 map
= isl_map_add_constraint(map
, c
);
12375 /* Add a constraint imposing that the value of the first dimension is
12376 * less than or equal to that of the second.
12378 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12379 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12381 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12384 /* Construct a basic map where the value of the first dimension is
12385 * greater than that of the second.
12387 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12388 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12390 isl_basic_map
*bmap
= NULL
;
12396 if (pos1
>= isl_space_dim(space
, type1
))
12397 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12398 "index out of bounds", goto error
);
12399 if (pos2
>= isl_space_dim(space
, type2
))
12400 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12401 "index out of bounds", goto error
);
12403 if (type1
== type2
&& pos1
== pos2
)
12404 return isl_basic_map_empty(space
);
12406 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12407 i
= isl_basic_map_alloc_inequality(bmap
);
12409 return isl_basic_map_free(bmap
);
12410 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12411 pos1
+= isl_basic_map_offset(bmap
, type1
);
12412 pos2
+= isl_basic_map_offset(bmap
, type2
);
12413 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12414 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12415 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12416 bmap
= isl_basic_map_finalize(bmap
);
12420 isl_space_free(space
);
12421 isl_basic_map_free(bmap
);
12425 /* Add a constraint imposing that the value of the first dimension is
12426 * greater than that of the second.
12428 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12429 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12433 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12435 bmap
= isl_basic_map_intersect(bmap
, gt
);
12440 /* Add a constraint imposing that the value of the first dimension is
12441 * greater than that of the second.
12443 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12444 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12446 isl_basic_map
*bmap
;
12448 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12450 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12455 /* Add a constraint imposing that the value of the first dimension is
12456 * smaller than that of the second.
12458 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12459 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12461 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12464 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12468 isl_local_space
*ls
;
12473 if (!isl_basic_map_divs_known(bmap
))
12474 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12475 "some divs are unknown", return NULL
);
12477 ls
= isl_basic_map_get_local_space(bmap
);
12478 div
= isl_local_space_get_div(ls
, pos
);
12479 isl_local_space_free(ls
);
12484 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12487 return isl_basic_map_get_div(bset
, pos
);
12490 /* Plug in "subs" for dimension "type", "pos" of "bset".
12492 * Let i be the dimension to replace and let "subs" be of the form
12496 * Any integer division with a non-zero coefficient for i,
12498 * floor((a i + g)/m)
12502 * floor((a f + d g)/(m d))
12504 * Constraints of the form
12512 * We currently require that "subs" is an integral expression.
12513 * Handling rational expressions may require us to add stride constraints
12514 * as we do in isl_basic_set_preimage_multi_aff.
12516 __isl_give isl_basic_set
*isl_basic_set_substitute(
12517 __isl_take isl_basic_set
*bset
,
12518 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12524 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12527 bset
= isl_basic_set_cow(bset
);
12528 if (!bset
|| !subs
)
12531 ctx
= isl_basic_set_get_ctx(bset
);
12532 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12533 isl_die(ctx
, isl_error_invalid
,
12534 "spaces don't match", goto error
);
12535 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12536 isl_die(ctx
, isl_error_unsupported
,
12537 "cannot handle divs yet", goto error
);
12538 if (!isl_int_is_one(subs
->v
->el
[0]))
12539 isl_die(ctx
, isl_error_invalid
,
12540 "can only substitute integer expressions", goto error
);
12542 pos
+= isl_basic_set_offset(bset
, type
);
12546 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12547 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12549 isl_int_set(v
, bset
->eq
[i
][pos
]);
12550 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12551 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12552 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12555 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12556 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12558 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12559 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12560 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12561 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12564 for (i
= 0; i
< bset
->n_div
; ++i
) {
12565 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12567 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12568 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12569 isl_seq_combine(bset
->div
[i
] + 1,
12570 subs
->v
->el
[0], bset
->div
[i
] + 1,
12571 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12572 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12577 bset
= isl_basic_set_simplify(bset
);
12578 return isl_basic_set_finalize(bset
);
12580 isl_basic_set_free(bset
);
12584 /* Plug in "subs" for dimension "type", "pos" of "set".
12586 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12587 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12591 if (set
&& isl_set_plain_is_empty(set
))
12594 set
= isl_set_cow(set
);
12598 for (i
= set
->n
- 1; i
>= 0; --i
) {
12599 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12600 if (remove_if_empty(set
, i
) < 0)
12610 /* Check if the range of "ma" is compatible with the domain or range
12611 * (depending on "type") of "bmap".
12613 static isl_stat
check_basic_map_compatible_range_multi_aff(
12614 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12615 __isl_keep isl_multi_aff
*ma
)
12618 isl_space
*ma_space
;
12620 ma_space
= isl_multi_aff_get_space(ma
);
12622 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12626 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12627 "parameters don't match", goto error
);
12628 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12632 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12633 "spaces don't match", goto error
);
12635 isl_space_free(ma_space
);
12636 return isl_stat_ok
;
12638 isl_space_free(ma_space
);
12639 return isl_stat_error
;
12642 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12643 * coefficients before the transformed range of dimensions,
12644 * the "n_after" coefficients after the transformed range of dimensions
12645 * and the coefficients of the other divs in "bmap".
12647 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12648 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12653 isl_local_space
*ls
;
12658 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
12662 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12663 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12664 for (i
= 0; i
< n_div
; ++i
) {
12665 int o_bmap
= 0, o_ls
= 0;
12667 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12668 o_bmap
+= 1 + 1 + n_param
;
12669 o_ls
+= 1 + 1 + n_param
;
12670 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12671 o_bmap
+= n_before
;
12672 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12673 ls
->div
->row
[i
] + o_ls
, n_set
);
12676 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12678 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12679 ls
->div
->row
[i
] + o_ls
, n_div
);
12682 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12683 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12687 isl_local_space_free(ls
);
12690 isl_local_space_free(ls
);
12694 /* How many stride constraints does "ma" enforce?
12695 * That is, how many of the affine expressions have a denominator
12696 * different from one?
12698 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12703 for (i
= 0; i
< ma
->n
; ++i
)
12704 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12710 /* For each affine expression in ma of the form
12712 * x_i = (f_i y + h_i)/m_i
12714 * with m_i different from one, add a constraint to "bmap"
12717 * f_i y + h_i = m_i alpha_i
12719 * with alpha_i an additional existentially quantified variable.
12721 * The input variables of "ma" correspond to a subset of the variables
12722 * of "bmap". There are "n_before" variables in "bmap" before this
12723 * subset and "n_after" variables after this subset.
12724 * The integer divisions of the affine expressions in "ma" are assumed
12725 * to have been aligned. There are "n_div_ma" of them and
12726 * they appear first in "bmap", straight after the "n_after" variables.
12728 static __isl_give isl_basic_map
*add_ma_strides(
12729 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12730 int n_before
, int n_after
, int n_div_ma
)
12738 total
= isl_basic_map_total_dim(bmap
);
12739 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12740 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12741 for (i
= 0; i
< ma
->n
; ++i
) {
12742 int o_bmap
= 0, o_ma
= 1;
12744 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12746 div
= isl_basic_map_alloc_div(bmap
);
12747 k
= isl_basic_map_alloc_equality(bmap
);
12748 if (div
< 0 || k
< 0)
12750 isl_int_set_si(bmap
->div
[div
][0], 0);
12751 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12752 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12753 o_bmap
+= 1 + n_param
;
12754 o_ma
+= 1 + n_param
;
12755 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12756 o_bmap
+= n_before
;
12757 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12758 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
12761 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12763 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12764 ma
->p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12765 o_bmap
+= n_div_ma
;
12767 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12768 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
12774 isl_basic_map_free(bmap
);
12778 /* Replace the domain or range space (depending on "type) of "space" by "set".
12780 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12781 enum isl_dim_type type
, __isl_take isl_space
*set
)
12783 if (type
== isl_dim_in
) {
12784 space
= isl_space_range(space
);
12785 space
= isl_space_map_from_domain_and_range(set
, space
);
12787 space
= isl_space_domain(space
);
12788 space
= isl_space_map_from_domain_and_range(space
, set
);
12794 /* Compute the preimage of the domain or range (depending on "type")
12795 * of "bmap" under the function represented by "ma".
12796 * In other words, plug in "ma" in the domain or range of "bmap".
12797 * The result is a basic map that lives in the same space as "bmap"
12798 * except that the domain or range has been replaced by
12799 * the domain space of "ma".
12801 * If bmap is represented by
12803 * A(p) + S u + B x + T v + C(divs) >= 0,
12805 * where u and x are input and output dimensions if type == isl_dim_out
12806 * while x and v are input and output dimensions if type == isl_dim_in,
12807 * and ma is represented by
12809 * x = D(p) + F(y) + G(divs')
12811 * then the result is
12813 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12815 * The divs in the input set are similarly adjusted.
12818 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12822 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12823 * B_i G(divs') + c_i(divs))/n_i)
12825 * If bmap is not a rational map and if F(y) involves any denominators
12827 * x_i = (f_i y + h_i)/m_i
12829 * then additional constraints are added to ensure that we only
12830 * map back integer points. That is we enforce
12832 * f_i y + h_i = m_i alpha_i
12834 * with alpha_i an additional existentially quantified variable.
12836 * We first copy over the divs from "ma".
12837 * Then we add the modified constraints and divs from "bmap".
12838 * Finally, we add the stride constraints, if needed.
12840 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12841 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12842 __isl_take isl_multi_aff
*ma
)
12846 isl_basic_map
*res
= NULL
;
12847 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12848 isl_int f
, c1
, c2
, g
;
12857 ma
= isl_multi_aff_align_divs(ma
);
12860 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12863 if (type
== isl_dim_in
) {
12865 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12867 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12870 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12871 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12873 space
= isl_multi_aff_get_domain_space(ma
);
12874 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12875 rational
= isl_basic_map_is_rational(bmap
);
12876 strides
= rational
? 0 : multi_aff_strides(ma
);
12877 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12878 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12880 res
= isl_basic_map_set_rational(res
);
12882 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12883 if (isl_basic_map_alloc_div(res
) < 0)
12886 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12889 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12890 k
= isl_basic_map_alloc_equality(res
);
12893 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12894 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12897 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12898 k
= isl_basic_map_alloc_inequality(res
);
12901 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12902 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12905 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12906 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12907 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12910 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12911 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12916 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
12922 isl_basic_map_free(bmap
);
12923 isl_multi_aff_free(ma
);
12924 res
= isl_basic_map_simplify(res
);
12925 return isl_basic_map_finalize(res
);
12931 isl_basic_map_free(bmap
);
12932 isl_multi_aff_free(ma
);
12933 isl_basic_map_free(res
);
12937 /* Compute the preimage of "bset" under the function represented by "ma".
12938 * In other words, plug in "ma" in "bset". The result is a basic set
12939 * that lives in the domain space of "ma".
12941 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12942 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12944 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12947 /* Compute the preimage of the domain of "bmap" under the function
12948 * represented by "ma".
12949 * In other words, plug in "ma" in the domain of "bmap".
12950 * The result is a basic map that lives in the same space as "bmap"
12951 * except that the domain has been replaced by the domain space of "ma".
12953 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12954 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12956 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12959 /* Compute the preimage of the range of "bmap" under the function
12960 * represented by "ma".
12961 * In other words, plug in "ma" in the range of "bmap".
12962 * The result is a basic map that lives in the same space as "bmap"
12963 * except that the range has been replaced by the domain space of "ma".
12965 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12966 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12968 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12971 /* Check if the range of "ma" is compatible with the domain or range
12972 * (depending on "type") of "map".
12973 * Return isl_stat_error if anything is wrong.
12975 static isl_stat
check_map_compatible_range_multi_aff(
12976 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12977 __isl_keep isl_multi_aff
*ma
)
12980 isl_space
*ma_space
;
12982 ma_space
= isl_multi_aff_get_space(ma
);
12983 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
12984 isl_space_free(ma_space
);
12986 return isl_stat_error
;
12988 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12989 "spaces don't match", return isl_stat_error
);
12990 return isl_stat_ok
;
12993 /* Compute the preimage of the domain or range (depending on "type")
12994 * of "map" under the function represented by "ma".
12995 * In other words, plug in "ma" in the domain or range of "map".
12996 * The result is a map that lives in the same space as "map"
12997 * except that the domain or range has been replaced by
12998 * the domain space of "ma".
13000 * The parameters are assumed to have been aligned.
13002 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13003 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13008 map
= isl_map_cow(map
);
13009 ma
= isl_multi_aff_align_divs(ma
);
13012 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13015 for (i
= 0; i
< map
->n
; ++i
) {
13016 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13017 isl_multi_aff_copy(ma
));
13022 space
= isl_multi_aff_get_domain_space(ma
);
13023 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13025 isl_space_free(map
->dim
);
13030 isl_multi_aff_free(ma
);
13032 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13033 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13036 isl_multi_aff_free(ma
);
13041 /* Compute the preimage of the domain or range (depending on "type")
13042 * of "map" under the function represented by "ma".
13043 * In other words, plug in "ma" in the domain or range of "map".
13044 * The result is a map that lives in the same space as "map"
13045 * except that the domain or range has been replaced by
13046 * the domain space of "ma".
13048 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13049 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13056 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13060 return map_preimage_multi_aff(map
, type
, ma
);
13062 if (isl_map_check_named_params(map
) < 0)
13064 if (!isl_space_has_named_params(ma
->space
))
13065 isl_die(map
->ctx
, isl_error_invalid
,
13066 "unaligned unnamed parameters", goto error
);
13067 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13068 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13070 return map_preimage_multi_aff(map
, type
, ma
);
13072 isl_multi_aff_free(ma
);
13073 return isl_map_free(map
);
13076 /* Compute the preimage of "set" under the function represented by "ma".
13077 * In other words, plug in "ma" in "set". The result is a set
13078 * that lives in the domain space of "ma".
13080 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13081 __isl_take isl_multi_aff
*ma
)
13083 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13086 /* Compute the preimage of the domain of "map" under the function
13087 * represented by "ma".
13088 * In other words, plug in "ma" in the domain of "map".
13089 * The result is a map that lives in the same space as "map"
13090 * except that the domain has been replaced by the domain space of "ma".
13092 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13093 __isl_take isl_multi_aff
*ma
)
13095 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13098 /* Compute the preimage of the range of "map" under the function
13099 * represented by "ma".
13100 * In other words, plug in "ma" in the range of "map".
13101 * The result is a map that lives in the same space as "map"
13102 * except that the range has been replaced by the domain space of "ma".
13104 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13105 __isl_take isl_multi_aff
*ma
)
13107 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13110 /* Compute the preimage of "map" under the function represented by "pma".
13111 * In other words, plug in "pma" in the domain or range of "map".
13112 * The result is a map that lives in the same space as "map",
13113 * except that the space of type "type" has been replaced by
13114 * the domain space of "pma".
13116 * The parameters of "map" and "pma" are assumed to have been aligned.
13118 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13119 __isl_take isl_map
*map
, enum isl_dim_type type
,
13120 __isl_take isl_pw_multi_aff
*pma
)
13129 isl_pw_multi_aff_free(pma
);
13130 res
= isl_map_empty(isl_map_get_space(map
));
13135 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13136 isl_multi_aff_copy(pma
->p
[0].maff
));
13137 if (type
== isl_dim_in
)
13138 res
= isl_map_intersect_domain(res
,
13139 isl_map_copy(pma
->p
[0].set
));
13141 res
= isl_map_intersect_range(res
,
13142 isl_map_copy(pma
->p
[0].set
));
13144 for (i
= 1; i
< pma
->n
; ++i
) {
13147 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13148 isl_multi_aff_copy(pma
->p
[i
].maff
));
13149 if (type
== isl_dim_in
)
13150 res_i
= isl_map_intersect_domain(res_i
,
13151 isl_map_copy(pma
->p
[i
].set
));
13153 res_i
= isl_map_intersect_range(res_i
,
13154 isl_map_copy(pma
->p
[i
].set
));
13155 res
= isl_map_union(res
, res_i
);
13158 isl_pw_multi_aff_free(pma
);
13162 isl_pw_multi_aff_free(pma
);
13167 /* Compute the preimage of "map" under the function represented by "pma".
13168 * In other words, plug in "pma" in the domain or range of "map".
13169 * The result is a map that lives in the same space as "map",
13170 * except that the space of type "type" has been replaced by
13171 * the domain space of "pma".
13173 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13174 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13181 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13185 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13187 if (isl_map_check_named_params(map
) < 0)
13189 if (!isl_space_has_named_params(pma
->dim
))
13190 isl_die(map
->ctx
, isl_error_invalid
,
13191 "unaligned unnamed parameters", goto error
);
13192 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13193 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13195 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13197 isl_pw_multi_aff_free(pma
);
13198 return isl_map_free(map
);
13201 /* Compute the preimage of "set" under the function represented by "pma".
13202 * In other words, plug in "pma" in "set". The result is a set
13203 * that lives in the domain space of "pma".
13205 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13206 __isl_take isl_pw_multi_aff
*pma
)
13208 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13211 /* Compute the preimage of the domain of "map" under the function
13212 * represented by "pma".
13213 * In other words, plug in "pma" in the domain of "map".
13214 * The result is a map that lives in the same space as "map",
13215 * except that domain space has been replaced by the domain space of "pma".
13217 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13218 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13220 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13223 /* Compute the preimage of the range of "map" under the function
13224 * represented by "pma".
13225 * In other words, plug in "pma" in the range of "map".
13226 * The result is a map that lives in the same space as "map",
13227 * except that range space has been replaced by the domain space of "pma".
13229 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13230 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13232 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13235 /* Compute the preimage of "map" under the function represented by "mpa".
13236 * In other words, plug in "mpa" in the domain or range of "map".
13237 * The result is a map that lives in the same space as "map",
13238 * except that the space of type "type" has been replaced by
13239 * the domain space of "mpa".
13241 * If the map does not involve any constraints that refer to the
13242 * dimensions of the substituted space, then the only possible
13243 * effect of "mpa" on the map is to map the space to a different space.
13244 * We create a separate isl_multi_aff to effectuate this change
13245 * in order to avoid spurious splitting of the map along the pieces
13248 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13249 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13252 isl_pw_multi_aff
*pma
;
13257 n
= isl_map_dim(map
, type
);
13258 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
13262 space
= isl_multi_pw_aff_get_space(mpa
);
13263 isl_multi_pw_aff_free(mpa
);
13264 ma
= isl_multi_aff_zero(space
);
13265 return isl_map_preimage_multi_aff(map
, type
, ma
);
13268 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13269 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13272 isl_multi_pw_aff_free(mpa
);
13276 /* Compute the preimage of "map" under the function represented by "mpa".
13277 * In other words, plug in "mpa" in the domain "map".
13278 * The result is a map that lives in the same space as "map",
13279 * except that domain space has been replaced by the domain space of "mpa".
13281 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13282 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13284 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13287 /* Compute the preimage of "set" by the function represented by "mpa".
13288 * In other words, plug in "mpa" in "set".
13290 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13291 __isl_take isl_multi_pw_aff
*mpa
)
13293 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13296 /* Are the "n" "coefficients" starting at "first" of the integer division
13297 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13299 * The "coefficient" at position 0 is the denominator.
13300 * The "coefficient" at position 1 is the constant term.
13302 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13303 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13304 unsigned first
, unsigned n
)
13306 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13307 return isl_bool_error
;
13308 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13309 return isl_bool_error
;
13310 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13311 bmap2
->div
[pos2
] + first
, n
);
13314 /* Are the integer division expressions at position "pos1" in "bmap1" and
13315 * "pos2" in "bmap2" equal to each other, except that the constant terms
13318 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13319 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13320 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13325 if (!bmap1
|| !bmap2
)
13326 return isl_bool_error
;
13327 total
= isl_basic_map_total_dim(bmap1
);
13328 if (total
!= isl_basic_map_total_dim(bmap2
))
13329 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13330 "incomparable div expressions", return isl_bool_error
);
13331 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13333 if (equal
< 0 || !equal
)
13335 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13337 if (equal
< 0 || equal
)
13338 return isl_bool_not(equal
);
13339 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13343 /* Replace the numerator of the constant term of the integer division
13344 * expression at position "div" in "bmap" by "value".
13345 * The caller guarantees that this does not change the meaning
13348 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13349 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13351 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13352 return isl_basic_map_free(bmap
);
13354 isl_int_set_si(bmap
->div
[div
][1], value
);
13359 /* Is the point "inner" internal to inequality constraint "ineq"
13361 * The point is considered to be internal to the inequality constraint,
13362 * if it strictly lies on the positive side of the inequality constraint,
13363 * or if it lies on the constraint and the constraint is lexico-positive.
13365 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13366 __isl_keep isl_basic_set
*bset
, int ineq
)
13372 if (!inner
|| !bset
)
13373 return isl_bool_error
;
13375 ctx
= isl_basic_set_get_ctx(bset
);
13376 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13377 &ctx
->normalize_gcd
);
13378 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13379 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13381 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13382 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13383 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13386 /* Tighten the inequality constraints of "bset" that are outward with respect
13387 * to the point "vec".
13388 * That is, tighten the constraints that are not satisfied by "vec".
13390 * "vec" is a point internal to some superset S of "bset" that is used
13391 * to make the subsets of S disjoint, by tightening one half of the constraints
13392 * that separate two subsets. In particular, the constraints of S
13393 * are all satisfied by "vec" and should not be tightened.
13394 * Of the internal constraints, those that have "vec" on the outside
13395 * are tightened. The shared facet is included in the adjacent subset
13396 * with the opposite constraint.
13397 * For constraints that saturate "vec", this criterion cannot be used
13398 * to determine which of the two sides should be tightened.
13399 * Instead, the sign of the first non-zero coefficient is used
13400 * to make this choice. Note that this second criterion is never used
13401 * on the constraints of S since "vec" is interior to "S".
13403 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13404 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13408 bset
= isl_basic_set_cow(bset
);
13411 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13414 internal
= is_internal(vec
, bset
, j
);
13416 return isl_basic_set_free(bset
);
13419 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13425 /* Replace the variables x of type "type" starting at "first" in "bmap"
13426 * by x' with x = M x' with M the matrix trans.
13427 * That is, replace the corresponding coefficients c by c M.
13429 * The transformation matrix should be a square matrix.
13431 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13432 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13433 __isl_take isl_mat
*trans
)
13437 bmap
= isl_basic_map_cow(bmap
);
13438 if (!bmap
|| !trans
)
13441 if (trans
->n_row
!= trans
->n_col
)
13442 isl_die(trans
->ctx
, isl_error_invalid
,
13443 "expecting square transformation matrix", goto error
);
13444 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13445 isl_die(trans
->ctx
, isl_error_invalid
,
13446 "oversized transformation matrix", goto error
);
13448 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13450 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13451 isl_mat_copy(trans
)) < 0)
13453 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13454 isl_mat_copy(trans
)) < 0)
13456 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13457 isl_mat_copy(trans
)) < 0)
13460 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
13461 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13463 isl_mat_free(trans
);
13466 isl_mat_free(trans
);
13467 isl_basic_map_free(bmap
);
13471 /* Replace the variables x of type "type" starting at "first" in "bset"
13472 * by x' with x = M x' with M the matrix trans.
13473 * That is, replace the corresponding coefficients c by c M.
13475 * The transformation matrix should be a square matrix.
13477 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13478 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13479 __isl_take isl_mat
*trans
)
13481 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);