2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 #include <isl_ctx_private.h>
17 #include <isl_map_private.h>
19 #include "isl_space_private.h"
20 #include "isl_equalities.h"
21 #include <isl_list_private.h>
26 #include "isl_map_piplib.h"
27 #include <isl_reordering.h>
28 #include "isl_sample.h"
31 #include <isl_mat_private.h>
32 #include <isl_dim_map.h>
33 #include <isl_local_space_private.h>
34 #include <isl_aff_private.h>
35 #include <isl_options_private.h>
37 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
40 case isl_dim_param
: return dim
->nparam
;
41 case isl_dim_in
: return dim
->n_in
;
42 case isl_dim_out
: return dim
->n_out
;
43 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
48 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
51 case isl_dim_param
: return 1;
52 case isl_dim_in
: return 1 + dim
->nparam
;
53 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
58 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
59 enum isl_dim_type type
)
64 case isl_dim_cst
: return 1;
67 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
68 case isl_dim_div
: return bmap
->n_div
;
69 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
74 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
76 return map
? n(map
->dim
, type
) : 0;
79 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
81 return set
? n(set
->dim
, type
) : 0;
84 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
85 enum isl_dim_type type
)
87 isl_space
*dim
= bmap
->dim
;
89 case isl_dim_cst
: return 0;
90 case isl_dim_param
: return 1;
91 case isl_dim_in
: return 1 + dim
->nparam
;
92 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
93 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
98 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
99 enum isl_dim_type type
)
101 return isl_basic_map_offset(bset
, type
);
104 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
106 return pos(map
->dim
, type
);
109 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
110 enum isl_dim_type type
)
112 return isl_basic_map_dim(bset
, type
);
115 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
117 return isl_basic_set_dim(bset
, isl_dim_set
);
120 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
122 return isl_basic_set_dim(bset
, isl_dim_param
);
125 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
129 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
132 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
134 return isl_set_dim(set
, isl_dim_set
);
137 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
139 return isl_set_dim(set
, isl_dim_param
);
142 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
144 return bmap
? bmap
->dim
->n_in
: 0;
147 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
149 return bmap
? bmap
->dim
->n_out
: 0;
152 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
154 return bmap
? bmap
->dim
->nparam
: 0;
157 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
159 return bmap
? bmap
->n_div
: 0;
162 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
164 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
167 unsigned isl_map_n_in(const struct isl_map
*map
)
169 return map
? map
->dim
->n_in
: 0;
172 unsigned isl_map_n_out(const struct isl_map
*map
)
174 return map
? map
->dim
->n_out
: 0;
177 unsigned isl_map_n_param(const struct isl_map
*map
)
179 return map
? map
->dim
->nparam
: 0;
182 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
187 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
190 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
193 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
194 struct isl_basic_set
*bset
)
199 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
202 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
205 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
210 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
213 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
216 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
217 struct isl_basic_set
*bset
)
222 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
225 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
228 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
230 return bmap
? bmap
->ctx
: NULL
;
233 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
235 return bset
? bset
->ctx
: NULL
;
238 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
240 return map
? map
->ctx
: NULL
;
243 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
245 return set
? set
->ctx
: NULL
;
248 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
252 return isl_space_copy(bmap
->dim
);
255 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
259 return isl_space_copy(bset
->dim
);
262 /* Extract the divs in "bmap" as a matrix.
264 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
275 ctx
= isl_basic_map_get_ctx(bmap
);
276 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
277 cols
= 1 + 1 + total
+ bmap
->n_div
;
278 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
282 for (i
= 0; i
< bmap
->n_div
; ++i
)
283 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
288 __isl_give isl_local_space
*isl_basic_map_get_local_space(
289 __isl_keep isl_basic_map
*bmap
)
296 div
= isl_basic_map_get_divs(bmap
);
297 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
300 __isl_give isl_local_space
*isl_basic_set_get_local_space(
301 __isl_keep isl_basic_set
*bset
)
303 return isl_basic_map_get_local_space(bset
);
306 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
307 __isl_take isl_local_space
*ls
)
316 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
317 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
318 n_div
, 0, 2 * n_div
);
320 for (i
= 0; i
< n_div
; ++i
)
321 if (isl_basic_map_alloc_div(bmap
) < 0)
324 for (i
= 0; i
< n_div
; ++i
) {
325 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
326 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
330 isl_local_space_free(ls
);
333 isl_local_space_free(ls
);
334 isl_basic_map_free(bmap
);
338 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
339 __isl_take isl_local_space
*ls
)
341 return isl_basic_map_from_local_space(ls
);
344 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
348 return isl_space_copy(map
->dim
);
351 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
355 return isl_space_copy(set
->dim
);
358 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
359 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
361 bmap
= isl_basic_map_cow(bmap
);
364 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
367 bmap
= isl_basic_map_finalize(bmap
);
370 isl_basic_map_free(bmap
);
374 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
375 __isl_take isl_basic_set
*bset
, const char *s
)
377 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
380 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
381 enum isl_dim_type type
)
383 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
386 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
387 enum isl_dim_type type
, const char *s
)
391 map
= isl_map_cow(map
);
395 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
399 for (i
= 0; i
< map
->n
; ++i
) {
400 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
411 /* Does the input or output tuple have a name?
413 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
415 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
418 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
419 enum isl_dim_type type
)
421 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
424 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
427 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
430 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
431 enum isl_dim_type type
, __isl_take isl_id
*id
)
433 map
= isl_map_cow(map
);
435 return isl_id_free(id
);
437 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
439 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
442 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
443 __isl_take isl_id
*id
)
445 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
448 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
449 enum isl_dim_type type
)
451 map
= isl_map_cow(map
);
455 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
457 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
460 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
462 return isl_map_reset_tuple_id(set
, isl_dim_set
);
465 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
467 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
470 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
471 enum isl_dim_type type
)
473 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
476 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
478 return isl_map_has_tuple_id(set
, isl_dim_set
);
481 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
483 return isl_map_get_tuple_id(set
, isl_dim_set
);
486 /* Does the set tuple have a name?
488 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
490 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
494 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
496 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
499 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
501 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
504 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
505 enum isl_dim_type type
, unsigned pos
)
507 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
510 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
511 enum isl_dim_type type
, unsigned pos
)
513 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
516 /* Does the given dimension have a name?
518 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
519 enum isl_dim_type type
, unsigned pos
)
521 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
524 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
525 enum isl_dim_type type
, unsigned pos
)
527 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
530 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
531 enum isl_dim_type type
, unsigned pos
)
533 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
536 /* Does the given dimension have a name?
538 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
539 enum isl_dim_type type
, unsigned pos
)
541 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
544 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
545 __isl_take isl_basic_map
*bmap
,
546 enum isl_dim_type type
, unsigned pos
, const char *s
)
548 bmap
= isl_basic_map_cow(bmap
);
551 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
554 return isl_basic_map_finalize(bmap
);
556 isl_basic_map_free(bmap
);
560 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
561 enum isl_dim_type type
, unsigned pos
, const char *s
)
565 map
= isl_map_cow(map
);
569 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
573 for (i
= 0; i
< map
->n
; ++i
) {
574 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
585 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
586 __isl_take isl_basic_set
*bset
,
587 enum isl_dim_type type
, unsigned pos
, const char *s
)
589 return (isl_basic_set
*)isl_basic_map_set_dim_name(
590 (isl_basic_map
*)bset
, type
, pos
, s
);
593 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
594 enum isl_dim_type type
, unsigned pos
, const char *s
)
596 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
599 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
600 enum isl_dim_type type
, unsigned pos
)
602 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
605 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
606 enum isl_dim_type type
, unsigned pos
)
608 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
611 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
612 enum isl_dim_type type
, unsigned pos
)
614 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
617 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
618 enum isl_dim_type type
, unsigned pos
)
620 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
623 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
624 enum isl_dim_type type
, unsigned pos
)
626 return isl_map_has_dim_id(set
, type
, pos
);
629 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
630 enum isl_dim_type type
, unsigned pos
)
632 return isl_map_get_dim_id(set
, type
, pos
);
635 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
636 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
638 map
= isl_map_cow(map
);
640 return isl_id_free(id
);
642 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
644 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
647 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
648 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
650 return isl_map_set_dim_id(set
, type
, pos
, id
);
653 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
654 __isl_keep isl_id
*id
)
658 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
661 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
662 __isl_keep isl_id
*id
)
664 return isl_map_find_dim_by_id(set
, type
, id
);
667 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
672 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
675 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
678 return isl_map_find_dim_by_name(set
, type
, name
);
681 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
685 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
688 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
690 return isl_basic_map_is_rational(bset
);
693 /* Is this basic set a parameter domain?
695 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
699 return isl_space_is_params(bset
->dim
);
702 /* Is this set a parameter domain?
704 int isl_set_is_params(__isl_keep isl_set
*set
)
708 return isl_space_is_params(set
->dim
);
711 /* Is this map actually a parameter domain?
712 * Users should never call this function. Outside of isl,
713 * a map can never be a parameter domain.
715 int isl_map_is_params(__isl_keep isl_map
*map
)
719 return isl_space_is_params(map
->dim
);
722 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
723 struct isl_basic_map
*bmap
, unsigned extra
,
724 unsigned n_eq
, unsigned n_ineq
)
727 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
732 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
733 if (isl_blk_is_error(bmap
->block
))
736 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
741 bmap
->block2
= isl_blk_empty();
744 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
745 if (isl_blk_is_error(bmap
->block2
))
748 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
753 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
754 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
756 for (i
= 0; i
< extra
; ++i
)
757 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
761 bmap
->c_size
= n_eq
+ n_ineq
;
762 bmap
->eq
= bmap
->ineq
+ n_ineq
;
771 isl_basic_map_free(bmap
);
775 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
776 unsigned nparam
, unsigned dim
, unsigned extra
,
777 unsigned n_eq
, unsigned n_ineq
)
779 struct isl_basic_map
*bmap
;
782 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
786 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
787 return (struct isl_basic_set
*)bmap
;
790 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
791 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
793 struct isl_basic_map
*bmap
;
796 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
797 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
798 return (struct isl_basic_set
*)bmap
;
804 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
805 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
807 struct isl_basic_map
*bmap
;
811 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
816 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
822 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
823 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
824 unsigned n_eq
, unsigned n_ineq
)
826 struct isl_basic_map
*bmap
;
829 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
833 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
837 static void dup_constraints(
838 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
841 unsigned total
= isl_basic_map_total_dim(src
);
843 for (i
= 0; i
< src
->n_eq
; ++i
) {
844 int j
= isl_basic_map_alloc_equality(dst
);
845 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
848 for (i
= 0; i
< src
->n_ineq
; ++i
) {
849 int j
= isl_basic_map_alloc_inequality(dst
);
850 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
853 for (i
= 0; i
< src
->n_div
; ++i
) {
854 int j
= isl_basic_map_alloc_div(dst
);
855 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
857 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
860 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
862 struct isl_basic_map
*dup
;
866 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
867 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
870 dup_constraints(dup
, bmap
);
871 dup
->flags
= bmap
->flags
;
872 dup
->sample
= isl_vec_copy(bmap
->sample
);
876 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
878 struct isl_basic_map
*dup
;
880 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
881 return (struct isl_basic_set
*)dup
;
884 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
889 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
893 return isl_basic_set_dup(bset
);
896 struct isl_set
*isl_set_copy(struct isl_set
*set
)
905 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
910 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
914 bmap
= isl_basic_map_dup(bmap
);
916 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
920 struct isl_map
*isl_map_copy(struct isl_map
*map
)
929 void *isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
937 isl_ctx_deref(bmap
->ctx
);
939 isl_blk_free(bmap
->ctx
, bmap
->block2
);
941 isl_blk_free(bmap
->ctx
, bmap
->block
);
942 isl_vec_free(bmap
->sample
);
943 isl_space_free(bmap
->dim
);
949 void *isl_basic_set_free(struct isl_basic_set
*bset
)
951 return isl_basic_map_free((struct isl_basic_map
*)bset
);
954 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
956 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
959 __isl_give isl_map
*isl_map_align_params_map_map_and(
960 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
961 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
962 __isl_take isl_map
*map2
))
966 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
967 return fn(map1
, map2
);
968 if (!isl_space_has_named_params(map1
->dim
) ||
969 !isl_space_has_named_params(map2
->dim
))
970 isl_die(map1
->ctx
, isl_error_invalid
,
971 "unaligned unnamed parameters", goto error
);
972 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
973 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
974 return fn(map1
, map2
);
981 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
982 __isl_keep isl_map
*map2
,
983 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
989 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
990 return fn(map1
, map2
);
991 if (!isl_space_has_named_params(map1
->dim
) ||
992 !isl_space_has_named_params(map2
->dim
))
993 isl_die(map1
->ctx
, isl_error_invalid
,
994 "unaligned unnamed parameters", return -1);
995 map1
= isl_map_copy(map1
);
996 map2
= isl_map_copy(map2
);
997 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
998 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1005 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1007 struct isl_ctx
*ctx
;
1011 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1012 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1014 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1015 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1016 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1017 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1018 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1019 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1021 int j
= isl_basic_map_alloc_inequality(bmap
);
1025 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1026 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1033 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1034 bmap
->extra
- bmap
->n_div
);
1035 return bmap
->n_eq
++;
1038 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1040 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1043 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1047 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1052 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1054 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1057 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1062 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1064 if (pos
!= bmap
->n_eq
- 1) {
1066 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1067 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1073 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1075 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1078 void isl_basic_map_inequality_to_equality(
1079 struct isl_basic_map
*bmap
, unsigned pos
)
1083 t
= bmap
->ineq
[pos
];
1084 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1085 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1090 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1091 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1092 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1093 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1096 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1098 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1101 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1103 struct isl_ctx
*ctx
;
1107 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1108 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1109 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1110 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1111 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1112 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1113 1 + isl_basic_map_total_dim(bmap
),
1114 bmap
->extra
- bmap
->n_div
);
1115 return bmap
->n_ineq
++;
1118 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1120 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1123 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1127 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1132 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1134 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1137 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1142 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1144 if (pos
!= bmap
->n_ineq
- 1) {
1145 t
= bmap
->ineq
[pos
];
1146 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1147 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1148 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1154 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1156 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1159 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1164 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1167 k
= isl_basic_map_alloc_equality(bmap
);
1170 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1173 isl_basic_map_free(bmap
);
1177 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1180 return (isl_basic_set
*)
1181 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1184 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1189 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1192 k
= isl_basic_map_alloc_inequality(bmap
);
1195 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1198 isl_basic_map_free(bmap
);
1202 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1205 return (isl_basic_set
*)
1206 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1209 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1213 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1214 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1215 1 + 1 + isl_basic_map_total_dim(bmap
),
1216 bmap
->extra
- bmap
->n_div
);
1217 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1218 return bmap
->n_div
++;
1221 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1223 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1226 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1230 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1235 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1237 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1240 /* Copy constraint from src to dst, putting the vars of src at offset
1241 * dim_off in dst and the divs of src at offset div_off in dst.
1242 * If both sets are actually map, then dim_off applies to the input
1245 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1246 struct isl_basic_map
*src_map
, isl_int
*src
,
1247 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1249 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1250 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1251 unsigned src_in
= isl_basic_map_n_in(src_map
);
1252 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1253 unsigned src_out
= isl_basic_map_n_out(src_map
);
1254 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1255 isl_int_set(dst
[0], src
[0]);
1256 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1257 if (dst_nparam
> src_nparam
)
1258 isl_seq_clr(dst
+1+src_nparam
,
1259 dst_nparam
- src_nparam
);
1260 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1261 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1263 isl_min(dst_in
-in_off
, src_in
));
1264 if (dst_in
-in_off
> src_in
)
1265 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1266 dst_in
- in_off
- src_in
);
1267 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1268 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1269 src
+1+src_nparam
+src_in
,
1270 isl_min(dst_out
-out_off
, src_out
));
1271 if (dst_out
-out_off
> src_out
)
1272 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1273 dst_out
- out_off
- src_out
);
1274 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1275 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1276 src
+1+src_nparam
+src_in
+src_out
,
1277 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1278 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1279 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1280 div_off
+src_map
->n_div
,
1281 dst_map
->n_div
- div_off
- src_map
->n_div
);
1284 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1285 struct isl_basic_map
*src_map
, isl_int
*src
,
1286 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1288 isl_int_set(dst
[0], src
[0]);
1289 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1292 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1293 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1298 if (!bmap1
|| !bmap2
)
1301 div_off
= bmap1
->n_div
;
1303 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1304 int i1
= isl_basic_map_alloc_equality(bmap1
);
1307 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1308 i_pos
, o_pos
, div_off
);
1311 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1312 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1315 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1316 i_pos
, o_pos
, div_off
);
1319 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1320 int i1
= isl_basic_map_alloc_div(bmap1
);
1323 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1324 i_pos
, o_pos
, div_off
);
1327 isl_basic_map_free(bmap2
);
1332 isl_basic_map_free(bmap1
);
1333 isl_basic_map_free(bmap2
);
1337 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1338 struct isl_basic_set
*bset2
, unsigned pos
)
1340 return (struct isl_basic_set
*)
1341 add_constraints((struct isl_basic_map
*)bset1
,
1342 (struct isl_basic_map
*)bset2
, 0, pos
);
1345 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1346 __isl_take isl_space
*dim
, unsigned extra
,
1347 unsigned n_eq
, unsigned n_ineq
)
1349 struct isl_basic_map
*ext
;
1359 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1360 base
->extra
>= base
->n_div
+ extra
;
1362 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1363 room_for_ineq(base
, n_ineq
)) {
1364 isl_space_free(dim
);
1368 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1369 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1370 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1371 extra
+= base
->extra
;
1373 n_ineq
+= base
->n_ineq
;
1375 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1381 ext
->sample
= isl_vec_copy(base
->sample
);
1382 flags
= base
->flags
;
1383 ext
= add_constraints(ext
, base
, 0, 0);
1386 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1392 isl_space_free(dim
);
1393 isl_basic_map_free(base
);
1397 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1398 __isl_take isl_space
*dim
, unsigned extra
,
1399 unsigned n_eq
, unsigned n_ineq
)
1401 return (struct isl_basic_set
*)
1402 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1403 extra
, n_eq
, n_ineq
);
1406 struct isl_basic_map
*isl_basic_map_extend_constraints(
1407 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1411 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1415 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1416 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1417 unsigned n_eq
, unsigned n_ineq
)
1419 struct isl_basic_map
*bmap
;
1424 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1428 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1431 isl_basic_map_free(base
);
1435 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1436 unsigned nparam
, unsigned dim
, unsigned extra
,
1437 unsigned n_eq
, unsigned n_ineq
)
1439 return (struct isl_basic_set
*)
1440 isl_basic_map_extend((struct isl_basic_map
*)base
,
1441 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1444 struct isl_basic_set
*isl_basic_set_extend_constraints(
1445 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1447 return (struct isl_basic_set
*)
1448 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1452 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1454 return (struct isl_basic_set
*)
1455 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1458 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1463 if (bmap
->ref
> 1) {
1465 bmap
= isl_basic_map_dup(bmap
);
1468 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1472 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1480 return isl_set_dup(set
);
1483 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1491 return isl_map_dup(map
);
1494 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1495 unsigned a_len
, unsigned b_len
)
1497 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1498 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1499 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1502 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1503 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1511 isl_assert(bmap
->ctx
,
1512 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1514 if (n1
== 0 || n2
== 0)
1517 bmap
= isl_basic_map_cow(bmap
);
1521 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1522 if (isl_blk_is_error(blk
))
1525 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1527 bmap
->eq
[i
] + pos
, n1
, n2
);
1529 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1531 bmap
->ineq
[i
] + pos
, n1
, n2
);
1533 for (i
= 0; i
< bmap
->n_div
; ++i
)
1535 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1537 isl_blk_free(bmap
->ctx
, blk
);
1539 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1540 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1541 return isl_basic_map_finalize(bmap
);
1543 isl_basic_map_free(bmap
);
1547 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1548 __isl_take isl_basic_set
*bset
, unsigned n
)
1553 nparam
= isl_basic_set_n_param(bset
);
1554 dim
= isl_basic_set_n_dim(bset
);
1555 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1557 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1559 isl_basic_set_free(bset
);
1563 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1569 total
= isl_basic_map_total_dim(bmap
);
1570 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1571 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1573 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1575 i
= isl_basic_map_alloc_equality(bmap
);
1579 isl_int_set_si(bmap
->eq
[i
][0], 1);
1580 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1581 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1582 isl_vec_free(bmap
->sample
);
1583 bmap
->sample
= NULL
;
1584 return isl_basic_map_finalize(bmap
);
1586 isl_basic_map_free(bmap
);
1590 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1592 return (struct isl_basic_set
*)
1593 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1596 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1599 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1600 isl_int
*t
= bmap
->div
[a
];
1601 bmap
->div
[a
] = bmap
->div
[b
];
1604 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1605 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1607 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1608 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1610 for (i
= 0; i
< bmap
->n_div
; ++i
)
1611 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1612 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1615 /* Eliminate the specified n dimensions starting at first from the
1616 * constraints, without removing the dimensions from the space.
1617 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1619 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1620 enum isl_dim_type type
, unsigned first
, unsigned n
)
1629 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1630 isl_die(map
->ctx
, isl_error_invalid
,
1631 "index out of bounds", goto error
);
1633 map
= isl_map_cow(map
);
1637 for (i
= 0; i
< map
->n
; ++i
) {
1638 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1648 /* Eliminate the specified n dimensions starting at first from the
1649 * constraints, without removing the dimensions from the space.
1650 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1652 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1653 enum isl_dim_type type
, unsigned first
, unsigned n
)
1655 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1658 /* Eliminate the specified n dimensions starting at first from the
1659 * constraints, without removing the dimensions from the space.
1660 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1662 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1663 unsigned first
, unsigned n
)
1665 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1668 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1669 __isl_take isl_basic_map
*bmap
)
1673 bmap
= isl_basic_map_eliminate_vars(bmap
,
1674 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1678 return isl_basic_map_finalize(bmap
);
1681 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1682 __isl_take isl_basic_set
*bset
)
1684 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1685 (struct isl_basic_map
*)bset
);
1688 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1697 map
= isl_map_cow(map
);
1701 for (i
= 0; i
< map
->n
; ++i
) {
1702 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1712 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1714 return isl_map_remove_divs(set
);
1717 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1718 enum isl_dim_type type
, unsigned first
, unsigned n
)
1722 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1724 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1726 bmap
= isl_basic_map_eliminate_vars(bmap
,
1727 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1730 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1732 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1735 isl_basic_map_free(bmap
);
1739 /* Return true if the definition of the given div (recursively) involves
1740 * any of the given variables.
1742 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1743 unsigned first
, unsigned n
)
1746 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1748 if (isl_int_is_zero(bmap
->div
[div
][0]))
1750 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1753 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1754 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1756 if (div_involves_vars(bmap
, i
, first
, n
))
1763 /* Try and add a lower and/or upper bound on "div" to "bmap"
1764 * based on inequality "i".
1765 * "total" is the total number of variables (excluding the divs).
1766 * "v" is a temporary object that can be used during the calculations.
1767 * If "lb" is set, then a lower bound should be constructed.
1768 * If "ub" is set, then an upper bound should be constructed.
1770 * The calling function has already checked that the inequality does not
1771 * reference "div", but we still need to check that the inequality is
1772 * of the right form. We'll consider the case where we want to construct
1773 * a lower bound. The construction of upper bounds is similar.
1775 * Let "div" be of the form
1777 * q = floor((a + f(x))/d)
1779 * We essentially check if constraint "i" is of the form
1783 * so that we can use it to derive a lower bound on "div".
1784 * However, we allow a slightly more general form
1788 * with the condition that the coefficients of g(x) - f(x) are all
1790 * Rewriting this constraint as
1794 * adding a + f(x) to both sides and dividing by d, we obtain
1796 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1798 * Taking the floor on both sides, we obtain
1800 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1804 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1806 * In the case of an upper bound, we construct the constraint
1808 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1811 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1812 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1813 unsigned total
, isl_int v
, int lb
, int ub
)
1817 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1819 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1820 bmap
->div
[div
][1 + 1 + j
]);
1821 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1824 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1825 bmap
->div
[div
][1 + 1 + j
]);
1826 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1832 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1834 int k
= isl_basic_map_alloc_inequality(bmap
);
1837 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1838 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1839 bmap
->div
[div
][1 + j
]);
1840 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1841 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1843 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1846 int k
= isl_basic_map_alloc_inequality(bmap
);
1849 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1850 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1851 bmap
->div
[div
][1 + j
]);
1852 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1853 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1855 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1860 isl_basic_map_free(bmap
);
1864 /* This function is called right before "div" is eliminated from "bmap"
1865 * using Fourier-Motzkin.
1866 * Look through the constraints of "bmap" for constraints on the argument
1867 * of the integer division and use them to construct constraints on the
1868 * integer division itself. These constraints can then be combined
1869 * during the Fourier-Motzkin elimination.
1870 * Note that it is only useful to introduce lower bounds on "div"
1871 * if "bmap" already contains upper bounds on "div" as the newly
1872 * introduce lower bounds can then be combined with the pre-existing
1873 * upper bounds. Similarly for upper bounds.
1874 * We therefore first check if "bmap" contains any lower and/or upper bounds
1877 * It is interesting to note that the introduction of these constraints
1878 * can indeed lead to more accurate results, even when compared to
1879 * deriving constraints on the argument of "div" from constraints on "div".
1880 * Consider, for example, the set
1882 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1884 * The second constraint can be rewritten as
1886 * 2 * [(-i-2j+3)/4] + k >= 0
1888 * from which we can derive
1890 * -i - 2j + 3 >= -2k
1896 * Combined with the first constraint, we obtain
1898 * -3 <= 3 + 2k or k >= -3
1900 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1901 * the first constraint, we obtain
1903 * [(i + 2j)/4] >= [-3/4] = -1
1905 * Combining this constraint with the second constraint, we obtain
1909 static __isl_give isl_basic_map
*insert_bounds_on_div(
1910 __isl_take isl_basic_map
*bmap
, int div
)
1913 int check_lb
, check_ub
;
1920 if (isl_int_is_zero(bmap
->div
[div
][0]))
1923 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1927 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
1928 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
1935 if (!check_lb
&& !check_ub
)
1940 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
1941 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
1944 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
1945 check_lb
, check_ub
);
1953 /* Remove all divs (recursively) involving any of the given dimensions
1954 * in their definitions.
1956 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1957 __isl_take isl_basic_map
*bmap
,
1958 enum isl_dim_type type
, unsigned first
, unsigned n
)
1964 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1966 first
+= isl_basic_map_offset(bmap
, type
);
1968 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1969 if (!div_involves_vars(bmap
, i
, first
, n
))
1971 bmap
= insert_bounds_on_div(bmap
, i
);
1972 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1980 isl_basic_map_free(bmap
);
1984 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
1985 __isl_take isl_basic_set
*bset
,
1986 enum isl_dim_type type
, unsigned first
, unsigned n
)
1988 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
1991 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1992 enum isl_dim_type type
, unsigned first
, unsigned n
)
2001 map
= isl_map_cow(map
);
2005 for (i
= 0; i
< map
->n
; ++i
) {
2006 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2017 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2018 enum isl_dim_type type
, unsigned first
, unsigned n
)
2020 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2024 /* Does the desciption of "bmap" depend on the specified dimensions?
2025 * We also check whether the dimensions appear in any of the div definitions.
2026 * In principle there is no need for this check. If the dimensions appear
2027 * in a div definition, they also appear in the defining constraints of that
2030 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2031 enum isl_dim_type type
, unsigned first
, unsigned n
)
2038 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2039 isl_die(bmap
->ctx
, isl_error_invalid
,
2040 "index out of bounds", return -1);
2042 first
+= isl_basic_map_offset(bmap
, type
);
2043 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2044 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2046 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2047 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2049 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2050 if (isl_int_is_zero(bmap
->div
[i
][0]))
2052 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2059 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2060 enum isl_dim_type type
, unsigned first
, unsigned n
)
2067 if (first
+ n
> isl_map_dim(map
, type
))
2068 isl_die(map
->ctx
, isl_error_invalid
,
2069 "index out of bounds", return -1);
2071 for (i
= 0; i
< map
->n
; ++i
) {
2072 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2074 if (involves
< 0 || involves
)
2081 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2082 enum isl_dim_type type
, unsigned first
, unsigned n
)
2084 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2087 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2088 enum isl_dim_type type
, unsigned first
, unsigned n
)
2090 return isl_map_involves_dims(set
, type
, first
, n
);
2093 /* Return true if the definition of the given div is unknown or depends
2096 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2099 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2101 if (isl_int_is_zero(bmap
->div
[div
][0]))
2104 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2105 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2107 if (div_is_unknown(bmap
, i
))
2114 /* Remove all divs that are unknown or defined in terms of unknown divs.
2116 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2117 __isl_take isl_basic_map
*bmap
)
2124 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2125 if (!div_is_unknown(bmap
, i
))
2127 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2136 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2145 map
= isl_map_cow(map
);
2149 for (i
= 0; i
< map
->n
; ++i
) {
2150 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2160 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2162 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2165 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2166 __isl_take isl_basic_set
*bset
,
2167 enum isl_dim_type type
, unsigned first
, unsigned n
)
2169 return (isl_basic_set
*)
2170 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2173 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2174 enum isl_dim_type type
, unsigned first
, unsigned n
)
2181 map
= isl_map_cow(map
);
2184 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2186 for (i
= 0; i
< map
->n
; ++i
) {
2187 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2188 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2192 map
= isl_map_drop(map
, type
, first
, n
);
2199 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2200 enum isl_dim_type type
, unsigned first
, unsigned n
)
2202 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2205 /* Project out n inputs starting at first using Fourier-Motzkin */
2206 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2207 unsigned first
, unsigned n
)
2209 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2212 static void dump_term(struct isl_basic_map
*bmap
,
2213 isl_int c
, int pos
, FILE *out
)
2216 unsigned in
= isl_basic_map_n_in(bmap
);
2217 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2218 unsigned nparam
= isl_basic_map_n_param(bmap
);
2220 isl_int_print(out
, c
, 0);
2222 if (!isl_int_is_one(c
))
2223 isl_int_print(out
, c
, 0);
2224 if (pos
< 1 + nparam
) {
2225 name
= isl_space_get_dim_name(bmap
->dim
,
2226 isl_dim_param
, pos
- 1);
2228 fprintf(out
, "%s", name
);
2230 fprintf(out
, "p%d", pos
- 1);
2231 } else if (pos
< 1 + nparam
+ in
)
2232 fprintf(out
, "i%d", pos
- 1 - nparam
);
2233 else if (pos
< 1 + nparam
+ dim
)
2234 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2236 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2240 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2241 int sign
, FILE *out
)
2245 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2249 for (i
= 0, first
= 1; i
< len
; ++i
) {
2250 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2253 fprintf(out
, " + ");
2255 isl_int_abs(v
, c
[i
]);
2256 dump_term(bmap
, v
, i
, out
);
2263 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2264 const char *op
, FILE *out
, int indent
)
2268 fprintf(out
, "%*s", indent
, "");
2270 dump_constraint_sign(bmap
, c
, 1, out
);
2271 fprintf(out
, " %s ", op
);
2272 dump_constraint_sign(bmap
, c
, -1, out
);
2276 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2277 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2279 fprintf(out
, "%*s", indent
, "");
2280 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2285 static void dump_constraints(struct isl_basic_map
*bmap
,
2286 isl_int
**c
, unsigned n
,
2287 const char *op
, FILE *out
, int indent
)
2291 for (i
= 0; i
< n
; ++i
)
2292 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2295 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2299 unsigned total
= isl_basic_map_total_dim(bmap
);
2301 for (j
= 0; j
< 1 + total
; ++j
) {
2302 if (isl_int_is_zero(exp
[j
]))
2304 if (!first
&& isl_int_is_pos(exp
[j
]))
2306 dump_term(bmap
, exp
[j
], j
, out
);
2311 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2315 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2316 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2318 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2319 fprintf(out
, "%*s", indent
, "");
2320 fprintf(out
, "e%d = [(", i
);
2321 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2323 isl_int_print(out
, bmap
->div
[i
][0], 0);
2324 fprintf(out
, "]\n");
2328 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2329 FILE *out
, int indent
)
2332 fprintf(out
, "null basic set\n");
2336 fprintf(out
, "%*s", indent
, "");
2337 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2338 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2339 bset
->extra
, bset
->flags
);
2340 dump((struct isl_basic_map
*)bset
, out
, indent
);
2343 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2344 FILE *out
, int indent
)
2347 fprintf(out
, "null basic map\n");
2351 fprintf(out
, "%*s", indent
, "");
2352 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2353 "flags: %x, n_name: %d\n",
2355 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2356 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2357 dump(bmap
, out
, indent
);
2360 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2365 total
= isl_basic_map_total_dim(bmap
);
2366 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2367 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2368 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2369 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2373 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2376 struct isl_set
*set
;
2380 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2381 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2382 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2383 sizeof(struct isl_set
) +
2384 (n
- 1) * sizeof(struct isl_basic_set
*));
2388 set
->ctx
= dim
->ctx
;
2389 isl_ctx_ref(set
->ctx
);
2397 isl_space_free(dim
);
2401 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2402 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2404 struct isl_set
*set
;
2407 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2411 set
= isl_set_alloc_space(dims
, n
, flags
);
2415 /* Make sure "map" has room for at least "n" more basic maps.
2417 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2420 struct isl_map
*grown
= NULL
;
2424 isl_assert(map
->ctx
, n
>= 0, goto error
);
2425 if (map
->n
+ n
<= map
->size
)
2427 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2430 for (i
= 0; i
< map
->n
; ++i
) {
2431 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2439 isl_map_free(grown
);
2444 /* Make sure "set" has room for at least "n" more basic sets.
2446 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2448 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2451 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2454 struct isl_set
*dup
;
2459 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2462 for (i
= 0; i
< set
->n
; ++i
)
2463 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2467 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2469 return isl_map_from_basic_map(bset
);
2472 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2474 struct isl_map
*map
;
2479 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2480 return isl_map_add_basic_map(map
, bmap
);
2483 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2484 __isl_take isl_basic_set
*bset
)
2486 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2487 (struct isl_basic_map
*)bset
);
2490 void *isl_set_free(__isl_take isl_set
*set
)
2500 isl_ctx_deref(set
->ctx
);
2501 for (i
= 0; i
< set
->n
; ++i
)
2502 isl_basic_set_free(set
->p
[i
]);
2503 isl_space_free(set
->dim
);
2509 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2514 fprintf(out
, "null set\n");
2518 fprintf(out
, "%*s", indent
, "");
2519 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2520 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2522 for (i
= 0; i
< set
->n
; ++i
) {
2523 fprintf(out
, "%*s", indent
, "");
2524 fprintf(out
, "basic set %d:\n", i
);
2525 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2529 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2534 fprintf(out
, "null map\n");
2538 fprintf(out
, "%*s", indent
, "");
2539 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2540 "flags: %x, n_name: %d\n",
2541 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2542 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2543 for (i
= 0; i
< map
->n
; ++i
) {
2544 fprintf(out
, "%*s", indent
, "");
2545 fprintf(out
, "basic map %d:\n", i
);
2546 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2550 struct isl_basic_map
*isl_basic_map_intersect_domain(
2551 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2553 struct isl_basic_map
*bmap_domain
;
2558 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2559 bset
->dim
, isl_dim_param
), goto error
);
2561 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2562 isl_assert(bset
->ctx
,
2563 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2565 bmap
= isl_basic_map_cow(bmap
);
2568 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2569 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2570 bmap_domain
= isl_basic_map_from_domain(bset
);
2571 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2573 bmap
= isl_basic_map_simplify(bmap
);
2574 return isl_basic_map_finalize(bmap
);
2576 isl_basic_map_free(bmap
);
2577 isl_basic_set_free(bset
);
2581 struct isl_basic_map
*isl_basic_map_intersect_range(
2582 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2584 struct isl_basic_map
*bmap_range
;
2589 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2590 bset
->dim
, isl_dim_param
), goto error
);
2592 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2593 isl_assert(bset
->ctx
,
2594 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2596 if (isl_basic_set_is_universe(bset
)) {
2597 isl_basic_set_free(bset
);
2601 bmap
= isl_basic_map_cow(bmap
);
2604 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2605 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2606 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2607 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2609 bmap
= isl_basic_map_simplify(bmap
);
2610 return isl_basic_map_finalize(bmap
);
2612 isl_basic_map_free(bmap
);
2613 isl_basic_set_free(bset
);
2617 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2623 total
= 1 + isl_basic_map_total_dim(bmap
);
2624 if (total
!= vec
->size
)
2629 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2630 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2631 if (!isl_int_is_zero(s
)) {
2637 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2638 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2639 if (isl_int_is_neg(s
)) {
2650 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2652 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2655 struct isl_basic_map
*isl_basic_map_intersect(
2656 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2658 struct isl_vec
*sample
= NULL
;
2660 if (!bmap1
|| !bmap2
)
2663 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2664 bmap2
->dim
, isl_dim_param
), goto error
);
2665 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2666 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2667 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2668 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2669 return isl_basic_map_intersect(bmap2
, bmap1
);
2671 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2672 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2673 isl_assert(bmap1
->ctx
,
2674 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2676 if (bmap1
->sample
&&
2677 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2678 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2679 sample
= isl_vec_copy(bmap1
->sample
);
2680 else if (bmap2
->sample
&&
2681 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2682 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2683 sample
= isl_vec_copy(bmap2
->sample
);
2685 bmap1
= isl_basic_map_cow(bmap1
);
2688 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2689 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2690 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2693 isl_vec_free(sample
);
2695 isl_vec_free(bmap1
->sample
);
2696 bmap1
->sample
= sample
;
2699 bmap1
= isl_basic_map_simplify(bmap1
);
2700 return isl_basic_map_finalize(bmap1
);
2703 isl_vec_free(sample
);
2704 isl_basic_map_free(bmap1
);
2705 isl_basic_map_free(bmap2
);
2709 struct isl_basic_set
*isl_basic_set_intersect(
2710 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2712 return (struct isl_basic_set
*)
2713 isl_basic_map_intersect(
2714 (struct isl_basic_map
*)bset1
,
2715 (struct isl_basic_map
*)bset2
);
2718 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2719 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2721 return isl_basic_set_intersect(bset1
, bset2
);
2724 /* Special case of isl_map_intersect, where both map1 and map2
2725 * are convex, without any divs and such that either map1 or map2
2726 * contains a single constraint. This constraint is then simply
2727 * added to the other map.
2729 static __isl_give isl_map
*map_intersect_add_constraint(
2730 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2732 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2733 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2734 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2735 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2737 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2738 return isl_map_intersect(map2
, map1
);
2740 isl_assert(map2
->ctx
,
2741 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2743 map1
= isl_map_cow(map1
);
2746 if (isl_map_plain_is_empty(map1
)) {
2750 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2751 if (map2
->p
[0]->n_eq
== 1)
2752 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2754 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2755 map2
->p
[0]->ineq
[0]);
2757 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2758 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2762 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2763 isl_basic_map_free(map1
->p
[0]);
2776 /* map2 may be either a parameter domain or a map living in the same
2779 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2780 __isl_take isl_map
*map2
)
2783 struct isl_map
*result
;
2789 if (isl_map_plain_is_empty(map1
) &&
2790 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2794 if (isl_map_plain_is_empty(map2
) &&
2795 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2800 if (map1
->n
== 1 && map2
->n
== 1 &&
2801 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2802 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2803 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2804 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2805 return map_intersect_add_constraint(map1
, map2
);
2807 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2808 isl_space_dim(map2
->dim
, isl_dim_param
))
2809 isl_assert(map1
->ctx
,
2810 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2812 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2813 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2814 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2816 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2817 map1
->n
* map2
->n
, flags
);
2820 for (i
= 0; i
< map1
->n
; ++i
)
2821 for (j
= 0; j
< map2
->n
; ++j
) {
2822 struct isl_basic_map
*part
;
2823 part
= isl_basic_map_intersect(
2824 isl_basic_map_copy(map1
->p
[i
]),
2825 isl_basic_map_copy(map2
->p
[j
]));
2826 if (isl_basic_map_is_empty(part
) < 0)
2828 result
= isl_map_add_basic_map(result
, part
);
2841 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2842 __isl_take isl_map
*map2
)
2846 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2847 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2848 "spaces don't match", goto error
);
2849 return map_intersect_internal(map1
, map2
);
2856 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2857 __isl_take isl_map
*map2
)
2859 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2862 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2864 return (struct isl_set
*)
2865 isl_map_intersect((struct isl_map
*)set1
,
2866 (struct isl_map
*)set2
);
2869 /* map_intersect_internal accepts intersections
2870 * with parameter domains, so we can just call that function.
2872 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2873 __isl_take isl_set
*params
)
2875 return map_intersect_internal(map
, params
);
2878 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2879 __isl_take isl_map
*map2
)
2881 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2884 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2885 __isl_take isl_set
*params
)
2887 return isl_map_intersect_params(set
, params
);
2890 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2893 struct isl_basic_set
*bset
;
2898 bmap
= isl_basic_map_cow(bmap
);
2901 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2902 in
= isl_basic_map_n_in(bmap
);
2903 bset
= isl_basic_set_from_basic_map(bmap
);
2904 bset
= isl_basic_set_swap_vars(bset
, in
);
2905 return isl_basic_map_from_basic_set(bset
, dim
);
2908 static __isl_give isl_basic_map
*basic_map_space_reset(
2909 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2913 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
2916 space
= isl_basic_map_get_space(bmap
);
2917 space
= isl_space_reset(space
, type
);
2918 bmap
= isl_basic_map_reset_space(bmap
, space
);
2922 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
2923 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2924 unsigned pos
, unsigned n
)
2927 struct isl_basic_map
*res
;
2928 struct isl_dim_map
*dim_map
;
2929 unsigned total
, off
;
2930 enum isl_dim_type t
;
2933 return basic_map_space_reset(bmap
, type
);
2938 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
2940 total
= isl_basic_map_total_dim(bmap
) + n
;
2941 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2943 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2945 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2947 unsigned size
= isl_basic_map_dim(bmap
, t
);
2948 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2950 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2951 pos
, size
- pos
, off
+ pos
+ n
);
2953 off
+= isl_space_dim(res_dim
, t
);
2955 isl_dim_map_div(dim_map
, bmap
, off
);
2957 res
= isl_basic_map_alloc_space(res_dim
,
2958 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2959 if (isl_basic_map_is_rational(bmap
))
2960 res
= isl_basic_map_set_rational(res
);
2961 if (isl_basic_map_plain_is_empty(bmap
)) {
2962 isl_basic_map_free(bmap
);
2963 return isl_basic_map_set_to_empty(res
);
2965 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2966 return isl_basic_map_finalize(res
);
2969 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
2970 __isl_take isl_basic_set
*bset
,
2971 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2973 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
2976 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2977 enum isl_dim_type type
, unsigned n
)
2981 return isl_basic_map_insert_dims(bmap
, type
,
2982 isl_basic_map_dim(bmap
, type
), n
);
2985 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2986 enum isl_dim_type type
, unsigned n
)
2990 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2991 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2993 isl_basic_set_free(bset
);
2997 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
2998 enum isl_dim_type type
)
3002 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3005 space
= isl_map_get_space(map
);
3006 space
= isl_space_reset(space
, type
);
3007 map
= isl_map_reset_space(map
, space
);
3011 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3012 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3017 return map_space_reset(map
, type
);
3019 map
= isl_map_cow(map
);
3023 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3027 for (i
= 0; i
< map
->n
; ++i
) {
3028 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3039 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3040 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3042 return isl_map_insert_dims(set
, type
, pos
, n
);
3045 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3046 enum isl_dim_type type
, unsigned n
)
3050 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3053 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3054 enum isl_dim_type type
, unsigned n
)
3058 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3059 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3065 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3066 __isl_take isl_basic_map
*bmap
,
3067 enum isl_dim_type dst_type
, unsigned dst_pos
,
3068 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3070 struct isl_dim_map
*dim_map
;
3071 struct isl_basic_map
*res
;
3072 enum isl_dim_type t
;
3073 unsigned total
, off
;
3080 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3083 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3086 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3088 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3089 pos(bmap
->dim
, src_type
) + src_pos
+
3090 ((src_type
< dst_type
) ? n
: 0)) {
3091 bmap
= isl_basic_map_cow(bmap
);
3095 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3096 src_type
, src_pos
, n
);
3100 bmap
= isl_basic_map_finalize(bmap
);
3105 total
= isl_basic_map_total_dim(bmap
);
3106 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3109 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3110 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3111 if (t
== dst_type
) {
3112 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3115 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3118 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3119 dst_pos
, size
- dst_pos
, off
);
3120 off
+= size
- dst_pos
;
3121 } else if (t
== src_type
) {
3122 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3125 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3126 src_pos
+ n
, size
- src_pos
- n
, off
);
3127 off
+= size
- src_pos
- n
;
3129 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3133 isl_dim_map_div(dim_map
, bmap
, off
);
3135 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3136 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3137 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3139 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3140 src_type
, src_pos
, n
);
3144 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3145 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3146 bmap
= isl_basic_map_finalize(bmap
);
3150 isl_basic_map_free(bmap
);
3154 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3155 enum isl_dim_type dst_type
, unsigned dst_pos
,
3156 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3158 return (isl_basic_set
*)isl_basic_map_move_dims(
3159 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3162 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3163 enum isl_dim_type dst_type
, unsigned dst_pos
,
3164 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3168 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3169 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3170 src_type
, src_pos
, n
);
3176 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3177 enum isl_dim_type dst_type
, unsigned dst_pos
,
3178 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3187 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3190 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3193 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3195 map
= isl_map_cow(map
);
3199 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3203 for (i
= 0; i
< map
->n
; ++i
) {
3204 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3206 src_type
, src_pos
, n
);
3217 /* Move the specified dimensions to the last columns right before
3218 * the divs. Don't change the dimension specification of bmap.
3219 * That's the responsibility of the caller.
3221 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3222 enum isl_dim_type type
, unsigned first
, unsigned n
)
3224 struct isl_dim_map
*dim_map
;
3225 struct isl_basic_map
*res
;
3226 enum isl_dim_type t
;
3227 unsigned total
, off
;
3231 if (pos(bmap
->dim
, type
) + first
+ n
==
3232 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3235 total
= isl_basic_map_total_dim(bmap
);
3236 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3239 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3240 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3242 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3245 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3246 first
, n
, total
- bmap
->n_div
- n
);
3247 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3248 first
+ n
, size
- (first
+ n
), off
);
3249 off
+= size
- (first
+ n
);
3251 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3255 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3257 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3258 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3259 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3263 /* Turn the n dimensions of type type, starting at first
3264 * into existentially quantified variables.
3266 __isl_give isl_basic_map
*isl_basic_map_project_out(
3267 __isl_take isl_basic_map
*bmap
,
3268 enum isl_dim_type type
, unsigned first
, unsigned n
)
3276 return basic_map_space_reset(bmap
, type
);
3281 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3282 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3284 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3287 bmap
= move_last(bmap
, type
, first
, n
);
3288 bmap
= isl_basic_map_cow(bmap
);
3292 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3293 old
= bmap
->block2
.data
;
3294 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3295 (bmap
->extra
+ n
) * (1 + row_size
));
3296 if (!bmap
->block2
.data
)
3298 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3301 for (i
= 0; i
< n
; ++i
) {
3302 new_div
[i
] = bmap
->block2
.data
+
3303 (bmap
->extra
+ i
) * (1 + row_size
);
3304 isl_seq_clr(new_div
[i
], 1 + row_size
);
3306 for (i
= 0; i
< bmap
->extra
; ++i
)
3307 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3309 bmap
->div
= new_div
;
3313 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3316 bmap
= isl_basic_map_simplify(bmap
);
3317 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3318 return isl_basic_map_finalize(bmap
);
3320 isl_basic_map_free(bmap
);
3324 /* Turn the n dimensions of type type, starting at first
3325 * into existentially quantified variables.
3327 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3328 enum isl_dim_type type
, unsigned first
, unsigned n
)
3330 return (isl_basic_set
*)isl_basic_map_project_out(
3331 (isl_basic_map
*)bset
, type
, first
, n
);
3334 /* Turn the n dimensions of type type, starting at first
3335 * into existentially quantified variables.
3337 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3338 enum isl_dim_type type
, unsigned first
, unsigned n
)
3346 return map_space_reset(map
, type
);
3348 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3350 map
= isl_map_cow(map
);
3354 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3358 for (i
= 0; i
< map
->n
; ++i
) {
3359 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3370 /* Turn the n dimensions of type type, starting at first
3371 * into existentially quantified variables.
3373 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3374 enum isl_dim_type type
, unsigned first
, unsigned n
)
3376 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3379 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3383 for (i
= 0; i
< n
; ++i
) {
3384 j
= isl_basic_map_alloc_div(bmap
);
3387 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3391 isl_basic_map_free(bmap
);
3395 struct isl_basic_map
*isl_basic_map_apply_range(
3396 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3398 isl_space
*dim_result
= NULL
;
3399 struct isl_basic_map
*bmap
;
3400 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3401 struct isl_dim_map
*dim_map1
, *dim_map2
;
3403 if (!bmap1
|| !bmap2
)
3406 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3407 isl_space_copy(bmap2
->dim
));
3409 n_in
= isl_basic_map_n_in(bmap1
);
3410 n_out
= isl_basic_map_n_out(bmap2
);
3411 n
= isl_basic_map_n_out(bmap1
);
3412 nparam
= isl_basic_map_n_param(bmap1
);
3414 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3415 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3416 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3417 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3418 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3419 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3420 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3421 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3422 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3423 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3424 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3426 bmap
= isl_basic_map_alloc_space(dim_result
,
3427 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3428 bmap1
->n_eq
+ bmap2
->n_eq
,
3429 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3430 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3431 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3432 bmap
= add_divs(bmap
, n
);
3433 bmap
= isl_basic_map_simplify(bmap
);
3434 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3435 return isl_basic_map_finalize(bmap
);
3437 isl_basic_map_free(bmap1
);
3438 isl_basic_map_free(bmap2
);
3442 struct isl_basic_set
*isl_basic_set_apply(
3443 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3448 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3451 return (struct isl_basic_set
*)
3452 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3454 isl_basic_set_free(bset
);
3455 isl_basic_map_free(bmap
);
3459 struct isl_basic_map
*isl_basic_map_apply_domain(
3460 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3462 if (!bmap1
|| !bmap2
)
3465 isl_assert(bmap1
->ctx
,
3466 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3467 isl_assert(bmap1
->ctx
,
3468 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3471 bmap1
= isl_basic_map_reverse(bmap1
);
3472 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3473 return isl_basic_map_reverse(bmap1
);
3475 isl_basic_map_free(bmap1
);
3476 isl_basic_map_free(bmap2
);
3480 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3481 * A \cap B -> f(A) + f(B)
3483 struct isl_basic_map
*isl_basic_map_sum(
3484 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3486 unsigned n_in
, n_out
, nparam
, total
, pos
;
3487 struct isl_basic_map
*bmap
= NULL
;
3488 struct isl_dim_map
*dim_map1
, *dim_map2
;
3491 if (!bmap1
|| !bmap2
)
3494 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3497 nparam
= isl_basic_map_n_param(bmap1
);
3498 n_in
= isl_basic_map_n_in(bmap1
);
3499 n_out
= isl_basic_map_n_out(bmap1
);
3501 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3502 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3503 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3504 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3505 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3506 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3507 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3508 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3509 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3510 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3511 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3513 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3514 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3515 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3516 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3517 for (i
= 0; i
< n_out
; ++i
) {
3518 int j
= isl_basic_map_alloc_equality(bmap
);
3521 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3522 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3523 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3524 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3526 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3527 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3528 bmap
= add_divs(bmap
, 2 * n_out
);
3530 bmap
= isl_basic_map_simplify(bmap
);
3531 return isl_basic_map_finalize(bmap
);
3533 isl_basic_map_free(bmap
);
3534 isl_basic_map_free(bmap1
);
3535 isl_basic_map_free(bmap2
);
3539 /* Given two maps A -> f(A) and B -> g(B), construct a map
3540 * A \cap B -> f(A) + f(B)
3542 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3544 struct isl_map
*result
;
3550 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3552 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3553 map1
->n
* map2
->n
, 0);
3556 for (i
= 0; i
< map1
->n
; ++i
)
3557 for (j
= 0; j
< map2
->n
; ++j
) {
3558 struct isl_basic_map
*part
;
3559 part
= isl_basic_map_sum(
3560 isl_basic_map_copy(map1
->p
[i
]),
3561 isl_basic_map_copy(map2
->p
[j
]));
3562 if (isl_basic_map_is_empty(part
))
3563 isl_basic_map_free(part
);
3565 result
= isl_map_add_basic_map(result
, part
);
3578 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3579 __isl_take isl_set
*set2
)
3581 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3584 /* Given a basic map A -> f(A), construct A -> -f(A).
3586 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3591 bmap
= isl_basic_map_cow(bmap
);
3595 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3596 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3597 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3598 for (j
= 0; j
< n
; ++j
)
3599 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3600 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3601 for (j
= 0; j
< n
; ++j
)
3602 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3603 for (i
= 0; i
< bmap
->n_div
; ++i
)
3604 for (j
= 0; j
< n
; ++j
)
3605 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3606 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3607 return isl_basic_map_finalize(bmap
);
3610 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3612 return isl_basic_map_neg(bset
);
3615 /* Given a map A -> f(A), construct A -> -f(A).
3617 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3621 map
= isl_map_cow(map
);
3625 for (i
= 0; i
< map
->n
; ++i
) {
3626 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3637 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3639 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3642 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3643 * A -> floor(f(A)/d).
3645 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3648 unsigned n_in
, n_out
, nparam
, total
, pos
;
3649 struct isl_basic_map
*result
= NULL
;
3650 struct isl_dim_map
*dim_map
;
3656 nparam
= isl_basic_map_n_param(bmap
);
3657 n_in
= isl_basic_map_n_in(bmap
);
3658 n_out
= isl_basic_map_n_out(bmap
);
3660 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3661 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3662 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3663 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3664 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3665 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3667 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3668 bmap
->n_div
+ n_out
,
3669 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3670 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3671 result
= add_divs(result
, n_out
);
3672 for (i
= 0; i
< n_out
; ++i
) {
3674 j
= isl_basic_map_alloc_inequality(result
);
3677 isl_seq_clr(result
->ineq
[j
], 1+total
);
3678 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3679 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3680 j
= isl_basic_map_alloc_inequality(result
);
3683 isl_seq_clr(result
->ineq
[j
], 1+total
);
3684 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3685 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3686 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3689 result
= isl_basic_map_simplify(result
);
3690 return isl_basic_map_finalize(result
);
3692 isl_basic_map_free(result
);
3696 /* Given a map A -> f(A) and an integer d, construct a map
3697 * A -> floor(f(A)/d).
3699 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3703 map
= isl_map_cow(map
);
3707 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3708 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3709 for (i
= 0; i
< map
->n
; ++i
) {
3710 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3721 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3727 i
= isl_basic_map_alloc_equality(bmap
);
3730 nparam
= isl_basic_map_n_param(bmap
);
3731 n_in
= isl_basic_map_n_in(bmap
);
3732 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3733 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3734 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3735 return isl_basic_map_finalize(bmap
);
3737 isl_basic_map_free(bmap
);
3741 /* Add a constraints to "bmap" expressing i_pos < o_pos
3743 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3749 i
= isl_basic_map_alloc_inequality(bmap
);
3752 nparam
= isl_basic_map_n_param(bmap
);
3753 n_in
= isl_basic_map_n_in(bmap
);
3754 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3755 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3756 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3757 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3758 return isl_basic_map_finalize(bmap
);
3760 isl_basic_map_free(bmap
);
3764 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3766 static __isl_give isl_basic_map
*var_less_or_equal(
3767 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3773 i
= isl_basic_map_alloc_inequality(bmap
);
3776 nparam
= isl_basic_map_n_param(bmap
);
3777 n_in
= isl_basic_map_n_in(bmap
);
3778 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3779 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3780 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3781 return isl_basic_map_finalize(bmap
);
3783 isl_basic_map_free(bmap
);
3787 /* Add a constraints to "bmap" expressing i_pos > o_pos
3789 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3795 i
= isl_basic_map_alloc_inequality(bmap
);
3798 nparam
= isl_basic_map_n_param(bmap
);
3799 n_in
= isl_basic_map_n_in(bmap
);
3800 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3801 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3802 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3803 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3804 return isl_basic_map_finalize(bmap
);
3806 isl_basic_map_free(bmap
);
3810 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3812 static __isl_give isl_basic_map
*var_more_or_equal(
3813 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3819 i
= isl_basic_map_alloc_inequality(bmap
);
3822 nparam
= isl_basic_map_n_param(bmap
);
3823 n_in
= isl_basic_map_n_in(bmap
);
3824 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3825 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3826 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3827 return isl_basic_map_finalize(bmap
);
3829 isl_basic_map_free(bmap
);
3833 __isl_give isl_basic_map
*isl_basic_map_equal(
3834 __isl_take isl_space
*dim
, unsigned n_equal
)
3837 struct isl_basic_map
*bmap
;
3838 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3841 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3842 bmap
= var_equal(bmap
, i
);
3843 return isl_basic_map_finalize(bmap
);
3846 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3848 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3852 struct isl_basic_map
*bmap
;
3853 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3856 for (i
= 0; i
< pos
&& bmap
; ++i
)
3857 bmap
= var_equal(bmap
, i
);
3859 bmap
= var_less(bmap
, pos
);
3860 return isl_basic_map_finalize(bmap
);
3863 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3865 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3866 __isl_take isl_space
*dim
, unsigned pos
)
3869 isl_basic_map
*bmap
;
3871 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3872 for (i
= 0; i
< pos
; ++i
)
3873 bmap
= var_equal(bmap
, i
);
3874 bmap
= var_less_or_equal(bmap
, pos
);
3875 return isl_basic_map_finalize(bmap
);
3878 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3880 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3884 struct isl_basic_map
*bmap
;
3885 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3888 for (i
= 0; i
< pos
&& bmap
; ++i
)
3889 bmap
= var_equal(bmap
, i
);
3891 bmap
= var_more(bmap
, pos
);
3892 return isl_basic_map_finalize(bmap
);
3895 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3897 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3898 __isl_take isl_space
*dim
, unsigned pos
)
3901 isl_basic_map
*bmap
;
3903 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3904 for (i
= 0; i
< pos
; ++i
)
3905 bmap
= var_equal(bmap
, i
);
3906 bmap
= var_more_or_equal(bmap
, pos
);
3907 return isl_basic_map_finalize(bmap
);
3910 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
3911 unsigned n
, int equal
)
3913 struct isl_map
*map
;
3916 if (n
== 0 && equal
)
3917 return isl_map_universe(dims
);
3919 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3921 for (i
= 0; i
+ 1 < n
; ++i
)
3922 map
= isl_map_add_basic_map(map
,
3923 isl_basic_map_less_at(isl_space_copy(dims
), i
));
3926 map
= isl_map_add_basic_map(map
,
3927 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3929 map
= isl_map_add_basic_map(map
,
3930 isl_basic_map_less_at(dims
, n
- 1));
3932 isl_space_free(dims
);
3937 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
3941 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3944 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
3946 return map_lex_lte_first(dim
, n
, 0);
3949 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
3951 return map_lex_lte_first(dim
, n
, 1);
3954 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
3956 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
3959 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
3961 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
3964 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
3965 unsigned n
, int equal
)
3967 struct isl_map
*map
;
3970 if (n
== 0 && equal
)
3971 return isl_map_universe(dims
);
3973 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3975 for (i
= 0; i
+ 1 < n
; ++i
)
3976 map
= isl_map_add_basic_map(map
,
3977 isl_basic_map_more_at(isl_space_copy(dims
), i
));
3980 map
= isl_map_add_basic_map(map
,
3981 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3983 map
= isl_map_add_basic_map(map
,
3984 isl_basic_map_more_at(dims
, n
- 1));
3986 isl_space_free(dims
);
3991 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
3995 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3998 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4000 return map_lex_gte_first(dim
, n
, 0);
4003 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4005 return map_lex_gte_first(dim
, n
, 1);
4008 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4010 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4013 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4015 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4018 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4019 __isl_take isl_set
*set2
)
4022 map
= isl_map_lex_le(isl_set_get_space(set1
));
4023 map
= isl_map_intersect_domain(map
, set1
);
4024 map
= isl_map_intersect_range(map
, set2
);
4028 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4029 __isl_take isl_set
*set2
)
4032 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4033 map
= isl_map_intersect_domain(map
, set1
);
4034 map
= isl_map_intersect_range(map
, set2
);
4038 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4039 __isl_take isl_set
*set2
)
4042 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4043 map
= isl_map_intersect_domain(map
, set1
);
4044 map
= isl_map_intersect_range(map
, set2
);
4048 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4049 __isl_take isl_set
*set2
)
4052 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4053 map
= isl_map_intersect_domain(map
, set1
);
4054 map
= isl_map_intersect_range(map
, set2
);
4058 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4059 __isl_take isl_map
*map2
)
4062 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4063 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4064 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4068 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4069 __isl_take isl_map
*map2
)
4072 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4073 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4074 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4078 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4079 __isl_take isl_map
*map2
)
4082 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4083 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4084 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4088 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4089 __isl_take isl_map
*map2
)
4092 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4093 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4094 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4098 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4099 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4101 struct isl_basic_map
*bmap
;
4103 bset
= isl_basic_set_cow(bset
);
4107 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4108 isl_space_free(bset
->dim
);
4109 bmap
= (struct isl_basic_map
*) bset
;
4111 return isl_basic_map_finalize(bmap
);
4113 isl_basic_set_free(bset
);
4114 isl_space_free(dim
);
4118 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4122 if (bmap
->dim
->n_in
== 0)
4123 return (struct isl_basic_set
*)bmap
;
4124 bmap
= isl_basic_map_cow(bmap
);
4127 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4130 bmap
= isl_basic_map_finalize(bmap
);
4131 return (struct isl_basic_set
*)bmap
;
4133 isl_basic_map_free(bmap
);
4137 /* For a div d = floor(f/m), add the constraints
4140 * -(f-(n-1)) + m d >= 0
4142 * Note that the second constraint is the negation of
4146 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4147 unsigned pos
, isl_int
*div
)
4150 unsigned total
= isl_basic_map_total_dim(bmap
);
4152 i
= isl_basic_map_alloc_inequality(bmap
);
4155 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4156 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4158 j
= isl_basic_map_alloc_inequality(bmap
);
4161 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4162 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4163 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4167 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4168 unsigned pos
, isl_int
*div
)
4170 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4174 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4176 unsigned total
= isl_basic_map_total_dim(bmap
);
4177 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4179 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4183 struct isl_basic_set
*isl_basic_map_underlying_set(
4184 struct isl_basic_map
*bmap
)
4188 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4190 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4191 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4192 return (struct isl_basic_set
*)bmap
;
4193 bmap
= isl_basic_map_cow(bmap
);
4196 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4199 bmap
->extra
-= bmap
->n_div
;
4201 bmap
= isl_basic_map_finalize(bmap
);
4202 return (struct isl_basic_set
*)bmap
;
4207 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4208 __isl_take isl_basic_set
*bset
)
4210 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4213 struct isl_basic_map
*isl_basic_map_overlying_set(
4214 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4216 struct isl_basic_map
*bmap
;
4217 struct isl_ctx
*ctx
;
4224 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4225 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4226 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4228 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4229 isl_basic_map_free(like
);
4230 return (struct isl_basic_map
*)bset
;
4232 bset
= isl_basic_set_cow(bset
);
4235 total
= bset
->dim
->n_out
+ bset
->extra
;
4236 bmap
= (struct isl_basic_map
*)bset
;
4237 isl_space_free(bmap
->dim
);
4238 bmap
->dim
= isl_space_copy(like
->dim
);
4241 bmap
->n_div
= like
->n_div
;
4242 bmap
->extra
+= like
->n_div
;
4246 ltotal
= total
- bmap
->extra
+ like
->extra
;
4249 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4250 bmap
->extra
* (1 + 1 + total
));
4251 if (isl_blk_is_error(bmap
->block2
))
4253 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4257 for (i
= 0; i
< bmap
->extra
; ++i
)
4258 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4259 for (i
= 0; i
< like
->n_div
; ++i
) {
4260 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4261 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4263 bmap
= isl_basic_map_extend_constraints(bmap
,
4264 0, 2 * like
->n_div
);
4265 for (i
= 0; i
< like
->n_div
; ++i
) {
4266 if (isl_int_is_zero(bmap
->div
[i
][0]))
4268 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4272 isl_basic_map_free(like
);
4273 bmap
= isl_basic_map_simplify(bmap
);
4274 bmap
= isl_basic_map_finalize(bmap
);
4277 isl_basic_map_free(like
);
4278 isl_basic_set_free(bset
);
4282 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4283 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4285 return (struct isl_basic_set
*)
4286 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4289 struct isl_set
*isl_set_from_underlying_set(
4290 struct isl_set
*set
, struct isl_basic_set
*like
)
4296 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4298 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4299 isl_basic_set_free(like
);
4302 set
= isl_set_cow(set
);
4305 for (i
= 0; i
< set
->n
; ++i
) {
4306 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4307 isl_basic_set_copy(like
));
4311 isl_space_free(set
->dim
);
4312 set
->dim
= isl_space_copy(like
->dim
);
4315 isl_basic_set_free(like
);
4318 isl_basic_set_free(like
);
4323 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4327 map
= isl_map_cow(map
);
4330 map
->dim
= isl_space_cow(map
->dim
);
4334 for (i
= 1; i
< map
->n
; ++i
)
4335 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4337 for (i
= 0; i
< map
->n
; ++i
) {
4338 map
->p
[i
] = (struct isl_basic_map
*)
4339 isl_basic_map_underlying_set(map
->p
[i
]);
4344 map
->dim
= isl_space_underlying(map
->dim
, 0);
4346 isl_space_free(map
->dim
);
4347 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4351 return (struct isl_set
*)map
;
4357 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4359 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4362 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4363 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4365 bmap
= isl_basic_map_cow(bmap
);
4369 isl_space_free(bmap
->dim
);
4372 bmap
= isl_basic_map_finalize(bmap
);
4376 isl_basic_map_free(bmap
);
4377 isl_space_free(dim
);
4381 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4382 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4384 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4388 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4389 __isl_take isl_space
*dim
)
4393 map
= isl_map_cow(map
);
4397 for (i
= 0; i
< map
->n
; ++i
) {
4398 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4399 isl_space_copy(dim
));
4403 isl_space_free(map
->dim
);
4409 isl_space_free(dim
);
4413 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4414 __isl_take isl_space
*dim
)
4416 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4419 /* Compute the parameter domain of the given basic set.
4421 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4426 if (isl_basic_set_is_params(bset
))
4429 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4430 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4431 space
= isl_basic_set_get_space(bset
);
4432 space
= isl_space_params(space
);
4433 bset
= isl_basic_set_reset_space(bset
, space
);
4437 /* Compute the parameter domain of the given set.
4439 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4444 if (isl_set_is_params(set
))
4447 n
= isl_set_dim(set
, isl_dim_set
);
4448 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4449 space
= isl_set_get_space(set
);
4450 space
= isl_space_params(space
);
4451 set
= isl_set_reset_space(set
, space
);
4455 /* Construct a zero-dimensional set with the given parameter domain.
4457 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4460 space
= isl_set_get_space(set
);
4461 space
= isl_space_set_from_params(space
);
4462 set
= isl_set_reset_space(set
, space
);
4466 /* Compute the parameter domain of the given map.
4468 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4473 n
= isl_map_dim(map
, isl_dim_in
);
4474 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4475 n
= isl_map_dim(map
, isl_dim_out
);
4476 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4477 space
= isl_map_get_space(map
);
4478 space
= isl_space_params(space
);
4479 map
= isl_map_reset_space(map
, space
);
4483 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4486 struct isl_basic_set
*domain
;
4492 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4494 n_in
= isl_basic_map_n_in(bmap
);
4495 n_out
= isl_basic_map_n_out(bmap
);
4496 domain
= isl_basic_set_from_basic_map(bmap
);
4497 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4499 domain
= isl_basic_set_reset_space(domain
, dim
);
4504 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4508 return isl_space_may_be_set(bmap
->dim
);
4511 /* Is this basic map actually a set?
4512 * Users should never call this function. Outside of isl,
4513 * the type should indicate whether something is a set or a map.
4515 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4519 return isl_space_is_set(bmap
->dim
);
4522 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4526 if (isl_basic_map_is_set(bmap
))
4528 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4531 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4532 __isl_take isl_basic_map
*bmap
)
4536 isl_basic_map
*domain
;
4537 int nparam
, n_in
, n_out
;
4540 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4541 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4542 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4544 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4545 domain
= isl_basic_map_universe(dim
);
4547 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4548 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4549 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4551 total
= isl_basic_map_total_dim(bmap
);
4553 for (i
= 0; i
< n_in
; ++i
) {
4554 k
= isl_basic_map_alloc_equality(bmap
);
4557 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4558 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4559 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4562 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4563 return isl_basic_map_finalize(bmap
);
4565 isl_basic_map_free(bmap
);
4569 __isl_give isl_basic_map
*isl_basic_map_range_map(
4570 __isl_take isl_basic_map
*bmap
)
4574 isl_basic_map
*range
;
4575 int nparam
, n_in
, n_out
;
4578 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4579 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4580 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4582 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4583 range
= isl_basic_map_universe(dim
);
4585 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4586 bmap
= isl_basic_map_apply_range(bmap
, range
);
4587 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4589 total
= isl_basic_map_total_dim(bmap
);
4591 for (i
= 0; i
< n_out
; ++i
) {
4592 k
= isl_basic_map_alloc_equality(bmap
);
4595 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4596 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4597 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4600 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4601 return isl_basic_map_finalize(bmap
);
4603 isl_basic_map_free(bmap
);
4607 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4611 return isl_space_may_be_set(map
->dim
);
4614 /* Is this map actually a set?
4615 * Users should never call this function. Outside of isl,
4616 * the type should indicate whether something is a set or a map.
4618 int isl_map_is_set(__isl_keep isl_map
*map
)
4622 return isl_space_is_set(map
->dim
);
4625 struct isl_set
*isl_map_range(struct isl_map
*map
)
4628 struct isl_set
*set
;
4632 if (isl_map_is_set(map
))
4633 return (isl_set
*)map
;
4635 map
= isl_map_cow(map
);
4639 set
= (struct isl_set
*) map
;
4640 set
->dim
= isl_space_range(set
->dim
);
4643 for (i
= 0; i
< map
->n
; ++i
) {
4644 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4648 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4649 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4656 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4659 isl_space
*domain_dim
;
4661 map
= isl_map_cow(map
);
4665 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4666 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4667 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4670 for (i
= 0; i
< map
->n
; ++i
) {
4671 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4675 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4676 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4683 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4686 isl_space
*range_dim
;
4688 map
= isl_map_cow(map
);
4692 range_dim
= isl_space_range(isl_map_get_space(map
));
4693 range_dim
= isl_space_from_range(range_dim
);
4694 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4695 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4698 for (i
= 0; i
< map
->n
; ++i
) {
4699 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4703 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4704 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4711 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4712 __isl_take isl_space
*dim
)
4715 struct isl_map
*map
= NULL
;
4717 set
= isl_set_cow(set
);
4720 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4721 map
= (struct isl_map
*)set
;
4722 for (i
= 0; i
< set
->n
; ++i
) {
4723 map
->p
[i
] = isl_basic_map_from_basic_set(
4724 set
->p
[i
], isl_space_copy(dim
));
4728 isl_space_free(map
->dim
);
4732 isl_space_free(dim
);
4737 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4738 __isl_take isl_basic_set
*bset
)
4740 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4743 __isl_give isl_basic_map
*isl_basic_map_from_range(
4744 __isl_take isl_basic_set
*bset
)
4747 space
= isl_basic_set_get_space(bset
);
4748 space
= isl_space_from_range(space
);
4749 bset
= isl_basic_set_reset_space(bset
, space
);
4750 return (isl_basic_map
*)bset
;
4753 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4756 space
= isl_set_get_space(set
);
4757 space
= isl_space_from_range(space
);
4758 set
= isl_set_reset_space(set
, space
);
4759 return (struct isl_map
*)set
;
4762 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4764 return isl_map_reverse(isl_map_from_range(set
));
4767 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4768 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4770 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4773 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4774 __isl_take isl_set
*range
)
4776 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4779 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4782 struct isl_set
*set
= NULL
;
4786 map
= isl_map_cow(map
);
4789 map
->dim
= isl_space_as_set_space(map
->dim
);
4792 set
= (struct isl_set
*)map
;
4793 for (i
= 0; i
< map
->n
; ++i
) {
4794 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4804 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4807 struct isl_map
*map
;
4812 isl_die(dim
->ctx
, isl_error_internal
,
4813 "negative number of basic maps", goto error
);
4814 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4815 sizeof(struct isl_map
) +
4816 (n
- 1) * sizeof(struct isl_basic_map
*));
4820 map
->ctx
= dim
->ctx
;
4821 isl_ctx_ref(map
->ctx
);
4829 isl_space_free(dim
);
4833 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4834 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4837 struct isl_map
*map
;
4840 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4844 map
= isl_map_alloc_space(dims
, n
, flags
);
4848 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4850 struct isl_basic_map
*bmap
;
4851 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4852 bmap
= isl_basic_map_set_to_empty(bmap
);
4856 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4858 struct isl_basic_set
*bset
;
4859 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4860 bset
= isl_basic_set_set_to_empty(bset
);
4864 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4866 struct isl_basic_map
*bmap
;
4869 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4870 bmap
= isl_basic_map_set_to_empty(bmap
);
4874 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4876 struct isl_basic_map
*bmap
;
4879 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4880 bmap
= isl_basic_map_set_to_empty(bmap
);
4884 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4886 struct isl_basic_set
*bset
;
4889 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4890 bset
= isl_basic_set_set_to_empty(bset
);
4894 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
4896 struct isl_basic_map
*bmap
;
4897 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
4898 bmap
= isl_basic_map_finalize(bmap
);
4902 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
4904 struct isl_basic_set
*bset
;
4905 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
4906 bset
= isl_basic_set_finalize(bset
);
4910 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
4913 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
4914 isl_basic_map
*bmap
;
4916 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
4917 for (i
= 0; i
< total
; ++i
) {
4918 int k
= isl_basic_map_alloc_inequality(bmap
);
4921 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4922 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4926 isl_basic_map_free(bmap
);
4930 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
4932 return isl_basic_map_nat_universe(dim
);
4935 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
4937 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4940 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
4942 return isl_map_nat_universe(dim
);
4945 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4946 __isl_keep isl_basic_map
*model
)
4950 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4953 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4957 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4960 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4961 __isl_keep isl_set
*model
)
4965 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4968 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
4970 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4973 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4977 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4980 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4984 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4987 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
4989 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4992 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4996 return isl_set_empty(isl_space_copy(model
->dim
));
4999 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5001 struct isl_map
*map
;
5004 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5005 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5009 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5011 struct isl_set
*set
;
5014 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5015 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5019 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5023 return isl_set_universe(isl_space_copy(model
->dim
));
5026 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5029 struct isl_map
*dup
;
5033 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5034 for (i
= 0; i
< map
->n
; ++i
)
5035 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5039 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5040 __isl_take isl_basic_map
*bmap
)
5044 if (isl_basic_map_plain_is_empty(bmap
)) {
5045 isl_basic_map_free(bmap
);
5048 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5049 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5050 map
->p
[map
->n
] = bmap
;
5052 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5058 isl_basic_map_free(bmap
);
5062 void *isl_map_free(struct isl_map
*map
)
5072 isl_ctx_deref(map
->ctx
);
5073 for (i
= 0; i
< map
->n
; ++i
)
5074 isl_basic_map_free(map
->p
[i
]);
5075 isl_space_free(map
->dim
);
5081 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5082 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5086 base
= isl_map_cow(base
);
5090 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5093 for (i
= 0; i
< base
->n
; ++i
) {
5094 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5095 isl_space_copy(base
->dim
), 0, 0, 0);
5105 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5106 unsigned nparam
, unsigned dim
)
5108 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5112 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5113 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5117 bmap
= isl_basic_map_cow(bmap
);
5118 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5119 j
= isl_basic_map_alloc_equality(bmap
);
5122 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5123 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5124 isl_int_set_si(bmap
->eq
[j
][0], value
);
5125 bmap
= isl_basic_map_simplify(bmap
);
5126 return isl_basic_map_finalize(bmap
);
5128 isl_basic_map_free(bmap
);
5132 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5133 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5137 bmap
= isl_basic_map_cow(bmap
);
5138 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5139 j
= isl_basic_map_alloc_equality(bmap
);
5142 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5143 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5144 isl_int_set(bmap
->eq
[j
][0], value
);
5145 bmap
= isl_basic_map_simplify(bmap
);
5146 return isl_basic_map_finalize(bmap
);
5148 isl_basic_map_free(bmap
);
5152 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5153 enum isl_dim_type type
, unsigned pos
, int value
)
5157 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5158 return isl_basic_map_fix_pos_si(bmap
,
5159 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5161 isl_basic_map_free(bmap
);
5165 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5166 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5170 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5171 return isl_basic_map_fix_pos(bmap
,
5172 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5174 isl_basic_map_free(bmap
);
5178 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5179 enum isl_dim_type type
, unsigned pos
, int value
)
5181 return (struct isl_basic_set
*)
5182 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5186 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5187 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5189 return (struct isl_basic_set
*)
5190 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5194 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5195 unsigned input
, int value
)
5197 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5200 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5201 unsigned dim
, int value
)
5203 return (struct isl_basic_set
*)
5204 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5205 isl_dim_set
, dim
, value
);
5208 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5210 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5217 isl_basic_map_free(map
->p
[i
]);
5218 if (i
!= map
->n
- 1) {
5219 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5220 map
->p
[i
] = map
->p
[map
->n
- 1];
5227 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5228 enum isl_dim_type type
, unsigned pos
, int value
)
5232 map
= isl_map_cow(map
);
5236 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5237 for (i
= map
->n
- 1; i
>= 0; --i
) {
5238 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5239 if (remove_if_empty(map
, i
) < 0)
5242 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5249 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5250 enum isl_dim_type type
, unsigned pos
, int value
)
5252 return (struct isl_set
*)
5253 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5256 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5257 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5261 map
= isl_map_cow(map
);
5265 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5266 for (i
= 0; i
< map
->n
; ++i
) {
5267 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5271 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5278 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5279 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5281 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5284 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5285 unsigned input
, int value
)
5287 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5290 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5292 return (struct isl_set
*)
5293 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5296 static __isl_give isl_basic_map
*basic_map_bound_si(
5297 __isl_take isl_basic_map
*bmap
,
5298 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5304 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5305 pos
+= isl_basic_map_offset(bmap
, type
);
5306 bmap
= isl_basic_map_cow(bmap
);
5307 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5308 j
= isl_basic_map_alloc_inequality(bmap
);
5311 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5313 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5314 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5316 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5317 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5319 bmap
= isl_basic_map_simplify(bmap
);
5320 return isl_basic_map_finalize(bmap
);
5322 isl_basic_map_free(bmap
);
5326 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5327 __isl_take isl_basic_map
*bmap
,
5328 enum isl_dim_type type
, unsigned pos
, int value
)
5330 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5333 /* Constrain the values of the given dimension to be no greater than "value".
5335 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5336 __isl_take isl_basic_map
*bmap
,
5337 enum isl_dim_type type
, unsigned pos
, int value
)
5339 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5342 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5343 unsigned dim
, isl_int value
)
5347 bset
= isl_basic_set_cow(bset
);
5348 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5349 j
= isl_basic_set_alloc_inequality(bset
);
5352 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5353 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5354 isl_int_neg(bset
->ineq
[j
][0], value
);
5355 bset
= isl_basic_set_simplify(bset
);
5356 return isl_basic_set_finalize(bset
);
5358 isl_basic_set_free(bset
);
5362 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5363 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5367 map
= isl_map_cow(map
);
5371 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5372 for (i
= 0; i
< map
->n
; ++i
) {
5373 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5374 type
, pos
, value
, upper
);
5378 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5385 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5386 enum isl_dim_type type
, unsigned pos
, int value
)
5388 return map_bound_si(map
, type
, pos
, value
, 0);
5391 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5392 enum isl_dim_type type
, unsigned pos
, int value
)
5394 return map_bound_si(map
, type
, pos
, value
, 1);
5397 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5398 enum isl_dim_type type
, unsigned pos
, int value
)
5400 return (struct isl_set
*)
5401 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5404 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5405 enum isl_dim_type type
, unsigned pos
, int value
)
5407 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5410 /* Bound the given variable of "bmap" from below (or above is "upper"
5411 * is set) to "value".
5413 static __isl_give isl_basic_map
*basic_map_bound(
5414 __isl_take isl_basic_map
*bmap
,
5415 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5421 if (pos
>= isl_basic_map_dim(bmap
, type
))
5422 isl_die(bmap
->ctx
, isl_error_invalid
,
5423 "index out of bounds", goto error
);
5424 pos
+= isl_basic_map_offset(bmap
, type
);
5425 bmap
= isl_basic_map_cow(bmap
);
5426 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5427 j
= isl_basic_map_alloc_inequality(bmap
);
5430 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5432 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5433 isl_int_set(bmap
->ineq
[j
][0], value
);
5435 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5436 isl_int_neg(bmap
->ineq
[j
][0], value
);
5438 bmap
= isl_basic_map_simplify(bmap
);
5439 return isl_basic_map_finalize(bmap
);
5441 isl_basic_map_free(bmap
);
5445 /* Bound the given variable of "map" from below (or above is "upper"
5446 * is set) to "value".
5448 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5449 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5453 map
= isl_map_cow(map
);
5457 if (pos
>= isl_map_dim(map
, type
))
5458 isl_die(map
->ctx
, isl_error_invalid
,
5459 "index out of bounds", goto error
);
5460 for (i
= map
->n
- 1; i
>= 0; --i
) {
5461 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5462 if (remove_if_empty(map
, i
) < 0)
5465 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5472 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5473 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5475 return map_bound(map
, type
, pos
, value
, 0);
5478 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5479 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5481 return map_bound(map
, type
, pos
, value
, 1);
5484 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5485 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5487 return isl_map_lower_bound(set
, type
, pos
, value
);
5490 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5491 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5493 return isl_map_upper_bound(set
, type
, pos
, value
);
5496 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5501 set
= isl_set_cow(set
);
5505 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5506 for (i
= 0; i
< set
->n
; ++i
) {
5507 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5517 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5521 map
= isl_map_cow(map
);
5525 map
->dim
= isl_space_reverse(map
->dim
);
5528 for (i
= 0; i
< map
->n
; ++i
) {
5529 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5533 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5540 static struct isl_map
*isl_basic_map_partial_lexopt(
5541 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5542 struct isl_set
**empty
, int max
)
5546 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5547 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5549 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5551 isl_basic_map_free(bmap
);
5552 isl_basic_set_free(dom
);
5558 struct isl_map
*isl_basic_map_partial_lexmax(
5559 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5560 struct isl_set
**empty
)
5562 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5565 struct isl_map
*isl_basic_map_partial_lexmin(
5566 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5567 struct isl_set
**empty
)
5569 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5572 struct isl_set
*isl_basic_set_partial_lexmin(
5573 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5574 struct isl_set
**empty
)
5576 return (struct isl_set
*)
5577 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5581 struct isl_set
*isl_basic_set_partial_lexmax(
5582 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5583 struct isl_set
**empty
)
5585 return (struct isl_set
*)
5586 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5590 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5591 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5592 __isl_give isl_set
**empty
)
5594 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5597 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5598 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5599 __isl_give isl_set
**empty
)
5601 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5604 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5605 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5606 __isl_give isl_set
**empty
)
5608 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5611 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5612 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5613 __isl_give isl_set
**empty
)
5615 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5618 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5619 __isl_take isl_basic_map
*bmap
, int max
)
5621 isl_basic_set
*dom
= NULL
;
5622 isl_space
*dom_space
;
5626 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5627 dom
= isl_basic_set_universe(dom_space
);
5628 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5630 isl_basic_map_free(bmap
);
5634 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5635 __isl_take isl_basic_map
*bmap
)
5637 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5641 #define TYPE isl_pw_multi_aff
5643 #define SUFFIX _pw_multi_aff
5645 #define EMPTY isl_pw_multi_aff_empty
5647 #define ADD isl_pw_multi_aff_union_add
5648 #include "isl_map_lexopt_templ.c"
5650 /* Given a map "map", compute the lexicographically minimal
5651 * (or maximal) image element for each domain element in dom,
5652 * in the form of an isl_pw_multi_aff.
5653 * Set *empty to those elements in dom that do not have an image element.
5655 * We first compute the lexicographically minimal or maximal element
5656 * in the first basic map. This results in a partial solution "res"
5657 * and a subset "todo" of dom that still need to be handled.
5658 * We then consider each of the remaining maps in "map" and successively
5659 * update both "res" and "todo".
5661 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5662 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5663 __isl_give isl_set
**empty
, int max
)
5666 isl_pw_multi_aff
*res
;
5672 if (isl_map_plain_is_empty(map
)) {
5677 return isl_pw_multi_aff_from_map(map
);
5680 res
= basic_map_partial_lexopt_pw_multi_aff(
5681 isl_basic_map_copy(map
->p
[0]),
5682 isl_set_copy(dom
), &todo
, max
);
5684 for (i
= 1; i
< map
->n
; ++i
) {
5685 isl_pw_multi_aff
*res_i
;
5688 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5689 isl_basic_map_copy(map
->p
[i
]),
5690 isl_set_copy(dom
), &todo_i
, max
);
5693 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5695 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5697 todo
= isl_set_intersect(todo
, todo_i
);
5718 #define TYPE isl_map
5722 #define EMPTY isl_map_empty
5724 #define ADD isl_map_union_disjoint
5725 #include "isl_map_lexopt_templ.c"
5727 /* Given a map "map", compute the lexicographically minimal
5728 * (or maximal) image element for each domain element in dom.
5729 * Set *empty to those elements in dom that do not have an image element.
5731 * We first compute the lexicographically minimal or maximal element
5732 * in the first basic map. This results in a partial solution "res"
5733 * and a subset "todo" of dom that still need to be handled.
5734 * We then consider each of the remaining maps in "map" and successively
5735 * update both "res" and "todo".
5737 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5738 * Assume we are computing the lexicographical maximum.
5739 * We first compute the lexicographically maximal element in basic map i.
5740 * This results in a partial solution res_i and a subset todo_i.
5741 * Then we combine these results with those obtain for the first k basic maps
5742 * to obtain a result that is valid for the first k+1 basic maps.
5743 * In particular, the set where there is no solution is the set where
5744 * there is no solution for the first k basic maps and also no solution
5745 * for the ith basic map, i.e.,
5747 * todo^i = todo^k * todo_i
5749 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5750 * solutions, arbitrarily breaking ties in favor of res^k.
5751 * That is, when res^k(a) >= res_i(a), we pick res^k and
5752 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5753 * the lexicographic order.)
5754 * In practice, we compute
5756 * res^k * (res_i . "<=")
5760 * res_i * (res^k . "<")
5762 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5763 * where only one of res^k and res_i provides a solution and we simply pick
5770 * Note that we only compute these intersections when dom(res^k) intersects
5771 * dom(res_i). Otherwise, the only effect of these intersections is to
5772 * potentially break up res^k and res_i into smaller pieces.
5773 * We want to avoid such splintering as much as possible.
5774 * In fact, an earlier implementation of this function would look for
5775 * better results in the domain of res^k and for extra results in todo^k,
5776 * but this would always result in a splintering according to todo^k,
5777 * even when the domain of basic map i is disjoint from the domains of
5778 * the previous basic maps.
5780 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5781 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5782 __isl_give isl_set
**empty
, int max
)
5785 struct isl_map
*res
;
5786 struct isl_set
*todo
;
5791 if (isl_map_plain_is_empty(map
)) {
5799 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5800 isl_set_copy(dom
), &todo
, max
);
5802 for (i
= 1; i
< map
->n
; ++i
) {
5806 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5808 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5809 isl_set_copy(dom
), &todo_i
, max
);
5812 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5813 le
= isl_map_lex_le(dim
);
5815 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5816 le
= isl_map_lex_ge(dim
);
5818 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5819 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5820 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5821 le
= isl_map_intersect(le
, isl_map_copy(res
));
5823 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5824 res
= isl_map_intersect_domain(res
,
5825 isl_set_copy(todo_i
));
5826 res_i
= isl_map_intersect_domain(res_i
,
5827 isl_set_copy(todo
));
5830 res
= isl_map_union_disjoint(res
, res_i
);
5831 res
= isl_map_union_disjoint(res
, lt
);
5832 res
= isl_map_union_disjoint(res
, le
);
5834 todo
= isl_set_intersect(todo
, todo_i
);
5854 __isl_give isl_map
*isl_map_partial_lexmax(
5855 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5856 __isl_give isl_set
**empty
)
5858 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5861 __isl_give isl_map
*isl_map_partial_lexmin(
5862 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5863 __isl_give isl_set
**empty
)
5865 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5868 __isl_give isl_set
*isl_set_partial_lexmin(
5869 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5870 __isl_give isl_set
**empty
)
5872 return (struct isl_set
*)
5873 isl_map_partial_lexmin((struct isl_map
*)set
,
5877 __isl_give isl_set
*isl_set_partial_lexmax(
5878 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5879 __isl_give isl_set
**empty
)
5881 return (struct isl_set
*)
5882 isl_map_partial_lexmax((struct isl_map
*)set
,
5886 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5888 struct isl_basic_set
*dom
= NULL
;
5893 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
5894 dom
= isl_basic_set_universe(dom_dim
);
5895 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5897 isl_basic_map_free(bmap
);
5901 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
5903 return isl_basic_map_lexopt(bmap
, 0);
5906 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
5908 return isl_basic_map_lexopt(bmap
, 1);
5911 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
5913 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
5916 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
5918 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
5921 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
5923 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
5926 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
5928 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
5931 /* Extract the first and only affine expression from list
5932 * and then add it to *pwaff with the given dom.
5933 * This domain is known to be disjoint from other domains
5934 * because of the way isl_basic_map_foreach_lexmax works.
5936 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
5937 __isl_take isl_aff_list
*list
, void *user
)
5939 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
5941 isl_pw_aff
**pwaff
= user
;
5942 isl_pw_aff
*pwaff_i
;
5944 if (isl_aff_list_n_aff(list
) != 1)
5945 isl_die(ctx
, isl_error_internal
,
5946 "expecting single element list", goto error
);
5948 aff
= isl_aff_list_get_aff(list
, 0);
5949 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
5951 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
5953 isl_aff_list_free(list
);
5957 isl_basic_set_free(dom
);
5958 isl_aff_list_free(list
);
5962 /* Given a basic map with one output dimension, compute the minimum or
5963 * maximum of that dimension as an isl_pw_aff.
5965 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5966 * call update_dim_opt on each leaf of the result.
5968 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
5971 isl_space
*dim
= isl_basic_map_get_space(bmap
);
5975 dim
= isl_space_from_domain(isl_space_domain(dim
));
5976 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
5977 pwaff
= isl_pw_aff_empty(dim
);
5979 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
5981 return isl_pw_aff_free(pwaff
);
5986 /* Compute the minimum or maximum of the given output dimension
5987 * as a function of the parameters and the input dimensions,
5988 * but independently of the other output dimensions.
5990 * We first project out the other output dimension and then compute
5991 * the "lexicographic" maximum in each basic map, combining the results
5992 * using isl_pw_aff_union_max.
5994 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6001 n_out
= isl_map_dim(map
, isl_dim_out
);
6002 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6003 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6008 isl_space
*dim
= isl_map_get_space(map
);
6009 dim
= isl_space_domain(isl_space_from_range(dim
));
6011 return isl_pw_aff_empty(dim
);
6014 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6015 for (i
= 1; i
< map
->n
; ++i
) {
6016 isl_pw_aff
*pwaff_i
;
6018 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6019 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6027 /* Compute the maximum of the given output dimension as a function of the
6028 * parameters and input dimensions, but independently of
6029 * the other output dimensions.
6031 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6033 return map_dim_opt(map
, pos
, 1);
6036 /* Compute the minimum or maximum of the given set dimension
6037 * as a function of the parameters,
6038 * but independently of the other set dimensions.
6040 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6043 return map_dim_opt(set
, pos
, max
);
6046 /* Compute the maximum of the given set dimension as a function of the
6047 * parameters, but independently of the other set dimensions.
6049 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6051 return set_dim_opt(set
, pos
, 1);
6054 /* Compute the minimum of the given set dimension as a function of the
6055 * parameters, but independently of the other set dimensions.
6057 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6059 return set_dim_opt(set
, pos
, 0);
6062 /* Apply a preimage specified by "mat" on the parameters of "bset".
6063 * bset is assumed to have only parameters and divs.
6065 static struct isl_basic_set
*basic_set_parameter_preimage(
6066 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6073 bset
->dim
= isl_space_cow(bset
->dim
);
6077 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6079 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6081 bset
->dim
->nparam
= 0;
6082 bset
->dim
->n_out
= nparam
;
6083 bset
= isl_basic_set_preimage(bset
, mat
);
6085 bset
->dim
->nparam
= bset
->dim
->n_out
;
6086 bset
->dim
->n_out
= 0;
6091 isl_basic_set_free(bset
);
6095 /* Apply a preimage specified by "mat" on the parameters of "set".
6096 * set is assumed to have only parameters and divs.
6098 static struct isl_set
*set_parameter_preimage(
6099 struct isl_set
*set
, struct isl_mat
*mat
)
6101 isl_space
*dim
= NULL
;
6107 dim
= isl_space_copy(set
->dim
);
6108 dim
= isl_space_cow(dim
);
6112 nparam
= isl_set_dim(set
, isl_dim_param
);
6114 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6117 dim
->n_out
= nparam
;
6118 isl_set_reset_space(set
, dim
);
6119 set
= isl_set_preimage(set
, mat
);
6122 dim
= isl_space_copy(set
->dim
);
6123 dim
= isl_space_cow(dim
);
6126 dim
->nparam
= dim
->n_out
;
6128 isl_set_reset_space(set
, dim
);
6131 isl_space_free(dim
);
6138 /* Intersect the basic set "bset" with the affine space specified by the
6139 * equalities in "eq".
6141 static struct isl_basic_set
*basic_set_append_equalities(
6142 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6150 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6155 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6156 for (i
= 0; i
< eq
->n_row
; ++i
) {
6157 k
= isl_basic_set_alloc_equality(bset
);
6160 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6161 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6165 bset
= isl_basic_set_gauss(bset
, NULL
);
6166 bset
= isl_basic_set_finalize(bset
);
6171 isl_basic_set_free(bset
);
6175 /* Intersect the set "set" with the affine space specified by the
6176 * equalities in "eq".
6178 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6186 for (i
= 0; i
< set
->n
; ++i
) {
6187 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6200 /* Project the given basic set onto its parameter domain, possibly introducing
6201 * new, explicit, existential variables in the constraints.
6202 * The input has parameters and (possibly implicit) existential variables.
6203 * The output has the same parameters, but only
6204 * explicit existentially quantified variables.
6206 * The actual projection is performed by pip, but pip doesn't seem
6207 * to like equalities very much, so we first remove the equalities
6208 * among the parameters by performing a variable compression on
6209 * the parameters. Afterward, an inverse transformation is performed
6210 * and the equalities among the parameters are inserted back in.
6212 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6216 struct isl_mat
*T
, *T2
;
6217 struct isl_set
*set
;
6218 unsigned nparam
, n_div
;
6220 bset
= isl_basic_set_cow(bset
);
6224 if (bset
->n_eq
== 0)
6225 return isl_basic_set_lexmin(bset
);
6227 isl_basic_set_gauss(bset
, NULL
);
6229 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6230 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6232 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6233 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6236 if (i
== bset
->n_eq
)
6237 return isl_basic_set_lexmin(bset
);
6239 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6241 eq
= isl_mat_cow(eq
);
6242 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6243 if (T
&& T
->n_col
== 0) {
6247 bset
= isl_basic_set_set_to_empty(bset
);
6248 return isl_set_from_basic_set(bset
);
6250 bset
= basic_set_parameter_preimage(bset
, T
);
6252 set
= isl_basic_set_lexmin(bset
);
6253 set
= set_parameter_preimage(set
, T2
);
6254 set
= set_append_equalities(set
, eq
);
6258 /* Compute an explicit representation for all the existentially
6259 * quantified variables.
6260 * The input and output dimensions are first turned into parameters.
6261 * compute_divs then returns a map with the same parameters and
6262 * no input or output dimensions and the dimension specification
6263 * is reset to that of the input.
6265 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6267 struct isl_basic_set
*bset
;
6268 struct isl_set
*set
;
6269 struct isl_map
*map
;
6270 isl_space
*dim
, *orig_dim
= NULL
;
6275 bmap
= isl_basic_map_cow(bmap
);
6279 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6280 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6281 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6282 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
6286 orig_dim
= bmap
->dim
;
6288 bset
= (struct isl_basic_set
*)bmap
;
6290 set
= parameter_compute_divs(bset
);
6291 map
= (struct isl_map
*)set
;
6292 map
= isl_map_reset_space(map
, orig_dim
);
6296 isl_basic_map_free(bmap
);
6300 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6308 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6309 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6310 if (isl_int_is_zero(bmap
->div
[i
][0]))
6312 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6318 static int map_divs_known(__isl_keep isl_map
*map
)
6325 for (i
= 0; i
< map
->n
; ++i
) {
6326 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6334 /* If bmap contains any unknown divs, then compute explicit
6335 * expressions for them. However, this computation may be
6336 * quite expensive, so first try to remove divs that aren't
6339 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6342 struct isl_map
*map
;
6344 known
= isl_basic_map_divs_known(bmap
);
6348 return isl_map_from_basic_map(bmap
);
6350 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6352 known
= isl_basic_map_divs_known(bmap
);
6356 return isl_map_from_basic_map(bmap
);
6358 map
= compute_divs(bmap
);
6361 isl_basic_map_free(bmap
);
6365 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6369 struct isl_map
*res
;
6376 known
= map_divs_known(map
);
6384 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6385 for (i
= 1 ; i
< map
->n
; ++i
) {
6387 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6388 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6389 res
= isl_map_union_disjoint(res
, r2
);
6391 res
= isl_map_union(res
, r2
);
6398 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6400 return (struct isl_set
*)
6401 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6404 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6406 return (struct isl_set
*)
6407 isl_map_compute_divs((struct isl_map
*)set
);
6410 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6413 struct isl_set
*set
;
6418 map
= isl_map_cow(map
);
6422 set
= (struct isl_set
*)map
;
6423 set
->dim
= isl_space_domain(set
->dim
);
6426 for (i
= 0; i
< map
->n
; ++i
) {
6427 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6431 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6432 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6439 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6440 __isl_take isl_map
*map2
)
6444 struct isl_map
*map
= NULL
;
6458 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6460 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6461 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6462 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6464 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6465 map1
->n
+ map2
->n
, flags
);
6468 for (i
= 0; i
< map1
->n
; ++i
) {
6469 map
= isl_map_add_basic_map(map
,
6470 isl_basic_map_copy(map1
->p
[i
]));
6474 for (i
= 0; i
< map2
->n
; ++i
) {
6475 map
= isl_map_add_basic_map(map
,
6476 isl_basic_map_copy(map2
->p
[i
]));
6490 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6491 __isl_take isl_map
*map2
)
6493 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6496 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6498 map1
= isl_map_union_disjoint(map1
, map2
);
6502 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6506 struct isl_set
*isl_set_union_disjoint(
6507 struct isl_set
*set1
, struct isl_set
*set2
)
6509 return (struct isl_set
*)
6510 isl_map_union_disjoint(
6511 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6514 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6516 return (struct isl_set
*)
6517 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6520 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6521 __isl_take isl_set
*set
)
6524 struct isl_map
*result
;
6530 if (!isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
))
6531 isl_die(set
->ctx
, isl_error_invalid
,
6532 "parameters don't match", goto error
);
6534 if (isl_space_dim(set
->dim
, isl_dim_set
) != 0 &&
6535 !isl_map_compatible_range(map
, set
))
6536 isl_die(set
->ctx
, isl_error_invalid
,
6537 "incompatible spaces", goto error
);
6539 if (isl_set_plain_is_universe(set
)) {
6544 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6545 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6546 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6548 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6549 map
->n
* set
->n
, flags
);
6552 for (i
= 0; i
< map
->n
; ++i
)
6553 for (j
= 0; j
< set
->n
; ++j
) {
6554 result
= isl_map_add_basic_map(result
,
6555 isl_basic_map_intersect_range(
6556 isl_basic_map_copy(map
->p
[i
]),
6557 isl_basic_set_copy(set
->p
[j
])));
6570 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6571 __isl_take isl_set
*set
)
6573 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6576 struct isl_map
*isl_map_intersect_domain(
6577 struct isl_map
*map
, struct isl_set
*set
)
6579 return isl_map_reverse(
6580 isl_map_intersect_range(isl_map_reverse(map
), set
));
6583 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6584 __isl_take isl_map
*map2
)
6588 map1
= isl_map_reverse(map1
);
6589 map1
= isl_map_apply_range(map1
, map2
);
6590 return isl_map_reverse(map1
);
6597 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6598 __isl_take isl_map
*map2
)
6600 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6603 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6604 __isl_take isl_map
*map2
)
6606 isl_space
*dim_result
;
6607 struct isl_map
*result
;
6613 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6614 isl_space_copy(map2
->dim
));
6616 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6619 for (i
= 0; i
< map1
->n
; ++i
)
6620 for (j
= 0; j
< map2
->n
; ++j
) {
6621 result
= isl_map_add_basic_map(result
,
6622 isl_basic_map_apply_range(
6623 isl_basic_map_copy(map1
->p
[i
]),
6624 isl_basic_map_copy(map2
->p
[j
])));
6630 if (result
&& result
->n
<= 1)
6631 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6639 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6640 __isl_take isl_map
*map2
)
6642 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6646 * returns range - domain
6648 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6650 isl_space
*dims
, *target_dim
;
6651 struct isl_basic_set
*bset
;
6658 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6659 bmap
->dim
, isl_dim_out
),
6661 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6662 dim
= isl_basic_map_n_in(bmap
);
6663 nparam
= isl_basic_map_n_param(bmap
);
6664 bset
= isl_basic_set_from_basic_map(bmap
);
6665 bset
= isl_basic_set_cow(bset
);
6666 dims
= isl_basic_set_get_space(bset
);
6667 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6668 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6669 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6670 for (i
= 0; i
< dim
; ++i
) {
6671 int j
= isl_basic_map_alloc_equality(
6672 (struct isl_basic_map
*)bset
);
6675 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6676 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6677 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6678 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6680 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6681 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6684 isl_basic_map_free(bmap
);
6689 * returns range - domain
6691 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
6695 struct isl_set
*result
;
6700 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6701 map
->dim
, isl_dim_out
),
6703 dim
= isl_map_get_space(map
);
6704 dim
= isl_space_domain(dim
);
6705 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6708 for (i
= 0; i
< map
->n
; ++i
)
6709 result
= isl_set_add_basic_set(result
,
6710 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6719 * returns [domain -> range] -> range - domain
6721 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6722 __isl_take isl_basic_map
*bmap
)
6726 isl_basic_map
*domain
;
6730 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6731 isl_die(bmap
->ctx
, isl_error_invalid
,
6732 "domain and range don't match", goto error
);
6734 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6735 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6737 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6738 domain
= isl_basic_map_universe(dim
);
6740 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6741 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6742 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6744 total
= isl_basic_map_total_dim(bmap
);
6746 for (i
= 0; i
< n
; ++i
) {
6747 k
= isl_basic_map_alloc_equality(bmap
);
6750 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6751 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6752 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6753 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6756 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6757 return isl_basic_map_finalize(bmap
);
6759 isl_basic_map_free(bmap
);
6764 * returns [domain -> range] -> range - domain
6766 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6769 isl_space
*domain_dim
;
6774 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6775 isl_die(map
->ctx
, isl_error_invalid
,
6776 "domain and range don't match", goto error
);
6778 map
= isl_map_cow(map
);
6782 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6783 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6784 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6787 for (i
= 0; i
< map
->n
; ++i
) {
6788 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6792 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6799 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6801 struct isl_basic_map
*bmap
;
6809 nparam
= dims
->nparam
;
6811 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6815 for (i
= 0; i
< dim
; ++i
) {
6816 int j
= isl_basic_map_alloc_equality(bmap
);
6819 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6820 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6821 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6823 return isl_basic_map_finalize(bmap
);
6825 isl_basic_map_free(bmap
);
6829 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
6833 if (dim
->n_in
!= dim
->n_out
)
6834 isl_die(dim
->ctx
, isl_error_invalid
,
6835 "number of input and output dimensions needs to be "
6836 "the same", goto error
);
6837 return basic_map_identity(dim
);
6839 isl_space_free(dim
);
6843 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
6845 if (!model
|| !model
->dim
)
6847 return isl_basic_map_identity(isl_space_copy(model
->dim
));
6850 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
6852 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
6855 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
6857 if (!model
|| !model
->dim
)
6859 return isl_map_identity(isl_space_copy(model
->dim
));
6862 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
6864 if (!model
|| !model
->dim
)
6866 return isl_map_identity(isl_space_copy(model
->dim
));
6869 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
6871 isl_space
*dim
= isl_set_get_space(set
);
6873 id
= isl_map_identity(isl_space_map_from_set(dim
));
6874 return isl_map_intersect_range(id
, set
);
6877 /* Construct a basic set with all set dimensions having only non-negative
6880 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
6881 __isl_take isl_space
*space
)
6886 struct isl_basic_set
*bset
;
6890 nparam
= space
->nparam
;
6892 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
6895 for (i
= 0; i
< dim
; ++i
) {
6896 int k
= isl_basic_set_alloc_inequality(bset
);
6899 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
6900 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
6904 isl_basic_set_free(bset
);
6908 /* Construct the half-space x_pos >= 0.
6910 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
6914 isl_basic_set
*nonneg
;
6916 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6917 k
= isl_basic_set_alloc_inequality(nonneg
);
6920 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
6921 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
6923 return isl_basic_set_finalize(nonneg
);
6925 isl_basic_set_free(nonneg
);
6929 /* Construct the half-space x_pos <= -1.
6931 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
6936 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6937 k
= isl_basic_set_alloc_inequality(neg
);
6940 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
6941 isl_int_set_si(neg
->ineq
[k
][0], -1);
6942 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
6944 return isl_basic_set_finalize(neg
);
6946 isl_basic_set_free(neg
);
6950 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
6951 enum isl_dim_type type
, unsigned first
, unsigned n
)
6954 isl_basic_set
*nonneg
;
6962 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
6964 for (i
= 0; i
< n
; ++i
) {
6965 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
6966 pos(set
->dim
, type
) + first
+ i
);
6967 neg
= neg_halfspace(isl_set_get_space(set
),
6968 pos(set
->dim
, type
) + first
+ i
);
6970 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
6979 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
6980 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6987 if (isl_set_plain_is_empty(set
)) {
6992 return fn(set
, signs
, user
);
6995 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
6997 half
= isl_set_intersect(half
, isl_set_copy(set
));
6998 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7002 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7004 half
= isl_set_intersect(half
, set
);
7005 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7011 /* Call "fn" on the intersections of "set" with each of the orthants
7012 * (except for obviously empty intersections). The orthant is identified
7013 * by the signs array, with each entry having value 1 or -1 according
7014 * to the sign of the corresponding variable.
7016 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7017 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7027 if (isl_set_plain_is_empty(set
))
7030 nparam
= isl_set_dim(set
, isl_dim_param
);
7031 nvar
= isl_set_dim(set
, isl_dim_set
);
7033 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7035 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7043 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7045 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7048 int isl_basic_map_is_subset(
7049 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7052 struct isl_map
*map1
;
7053 struct isl_map
*map2
;
7055 if (!bmap1
|| !bmap2
)
7058 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7059 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7061 is_subset
= isl_map_is_subset(map1
, map2
);
7069 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7070 __isl_keep isl_basic_set
*bset2
)
7072 return isl_basic_map_is_subset(bset1
, bset2
);
7075 int isl_basic_map_is_equal(
7076 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7080 if (!bmap1
|| !bmap2
)
7082 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7085 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7089 int isl_basic_set_is_equal(
7090 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7092 return isl_basic_map_is_equal(
7093 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7096 int isl_map_is_empty(struct isl_map
*map
)
7103 for (i
= 0; i
< map
->n
; ++i
) {
7104 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7113 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7115 return map
? map
->n
== 0 : -1;
7118 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7120 return isl_map_plain_is_empty(map
);
7123 int isl_set_plain_is_empty(struct isl_set
*set
)
7125 return set
? set
->n
== 0 : -1;
7128 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7130 return isl_set_plain_is_empty(set
);
7133 int isl_set_is_empty(struct isl_set
*set
)
7135 return isl_map_is_empty((struct isl_map
*)set
);
7138 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7143 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7146 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7151 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7154 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7160 is_subset
= isl_map_is_subset(map1
, map2
);
7163 is_subset
= isl_map_is_subset(map2
, map1
);
7167 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7169 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7172 int isl_basic_map_is_strict_subset(
7173 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7177 if (!bmap1
|| !bmap2
)
7179 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7182 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7183 if (is_subset
== -1)
7188 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7194 is_subset
= isl_map_is_subset(map1
, map2
);
7197 is_subset
= isl_map_is_subset(map2
, map1
);
7198 if (is_subset
== -1)
7203 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7205 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7208 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7212 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7215 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7219 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7222 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7229 for (i
= 0; i
< map
->n
; ++i
) {
7230 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7238 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7240 return isl_map_plain_is_universe((isl_map
*) set
);
7243 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7245 return isl_set_plain_is_universe(set
);
7248 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7250 struct isl_basic_set
*bset
= NULL
;
7251 struct isl_vec
*sample
= NULL
;
7258 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7261 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7262 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7263 copy
= isl_basic_map_remove_redundancies(copy
);
7264 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
7265 isl_basic_map_free(copy
);
7269 total
= 1 + isl_basic_map_total_dim(bmap
);
7270 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7271 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7277 isl_vec_free(bmap
->sample
);
7278 bmap
->sample
= NULL
;
7279 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7282 sample
= isl_basic_set_sample_vec(bset
);
7285 empty
= sample
->size
== 0;
7286 isl_vec_free(bmap
->sample
);
7287 bmap
->sample
= sample
;
7289 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7294 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7298 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7301 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7303 return isl_basic_map_plain_is_empty(bmap
);
7306 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7310 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7313 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7315 return isl_basic_set_plain_is_empty(bset
);
7318 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7320 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7323 struct isl_map
*isl_basic_map_union(
7324 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7326 struct isl_map
*map
;
7327 if (!bmap1
|| !bmap2
)
7330 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7332 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7335 map
= isl_map_add_basic_map(map
, bmap1
);
7336 map
= isl_map_add_basic_map(map
, bmap2
);
7339 isl_basic_map_free(bmap1
);
7340 isl_basic_map_free(bmap2
);
7344 struct isl_set
*isl_basic_set_union(
7345 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7347 return (struct isl_set
*)isl_basic_map_union(
7348 (struct isl_basic_map
*)bset1
,
7349 (struct isl_basic_map
*)bset2
);
7352 /* Order divs such that any div only depends on previous divs */
7353 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7361 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7363 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7365 if (isl_int_is_zero(bmap
->div
[i
][0]))
7367 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7371 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7377 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7379 return (struct isl_basic_set
*)
7380 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7383 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7390 for (i
= 0; i
< map
->n
; ++i
) {
7391 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7402 /* Apply the expansion computed by isl_merge_divs.
7403 * The expansion itself is given by "exp" while the resulting
7404 * list of divs is given by "div".
7406 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7407 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7412 bset
= isl_basic_set_cow(bset
);
7416 if (div
->n_row
< bset
->n_div
)
7417 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7418 "not an expansion", goto error
);
7420 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7421 div
->n_row
- bset
->n_div
, 0,
7422 2 * (div
->n_row
- bset
->n_div
));
7424 n_div
= bset
->n_div
;
7425 for (i
= n_div
; i
< div
->n_row
; ++i
)
7426 if (isl_basic_set_alloc_div(bset
) < 0)
7430 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7431 if (j
>= 0 && exp
[j
] == i
) {
7433 isl_basic_map_swap_div(bset
, i
, j
);
7436 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7437 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7445 isl_basic_set_free(bset
);
7450 /* Look for a div in dst that corresponds to the div "div" in src.
7451 * The divs before "div" in src and dst are assumed to be the same.
7453 * Returns -1 if no corresponding div was found and the position
7454 * of the corresponding div in dst otherwise.
7456 static int find_div(struct isl_basic_map
*dst
,
7457 struct isl_basic_map
*src
, unsigned div
)
7461 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7463 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7464 for (i
= div
; i
< dst
->n_div
; ++i
)
7465 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7466 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7467 dst
->n_div
- div
) == -1)
7472 struct isl_basic_map
*isl_basic_map_align_divs(
7473 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7476 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7481 if (src
->n_div
== 0)
7484 for (i
= 0; i
< src
->n_div
; ++i
)
7485 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7487 src
= isl_basic_map_order_divs(src
);
7488 dst
= isl_basic_map_cow(dst
);
7489 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7490 src
->n_div
, 0, 2 * src
->n_div
);
7493 for (i
= 0; i
< src
->n_div
; ++i
) {
7494 int j
= find_div(dst
, src
, i
);
7496 j
= isl_basic_map_alloc_div(dst
);
7499 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7500 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7501 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7505 isl_basic_map_swap_div(dst
, i
, j
);
7509 isl_basic_map_free(dst
);
7513 struct isl_basic_set
*isl_basic_set_align_divs(
7514 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7516 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7517 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7520 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7528 map
= isl_map_compute_divs(map
);
7529 map
= isl_map_cow(map
);
7533 for (i
= 1; i
< map
->n
; ++i
)
7534 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7535 for (i
= 1; i
< map
->n
; ++i
)
7536 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7538 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7542 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7544 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7547 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7548 __isl_take isl_map
*map
)
7552 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7553 map
= isl_map_intersect_domain(map
, set
);
7554 set
= isl_map_range(map
);
7562 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7563 __isl_take isl_map
*map
)
7565 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7568 /* There is no need to cow as removing empty parts doesn't change
7569 * the meaning of the set.
7571 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7578 for (i
= map
->n
- 1; i
>= 0; --i
)
7579 remove_if_empty(map
, i
);
7584 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7586 return (struct isl_set
*)
7587 isl_map_remove_empty_parts((struct isl_map
*)set
);
7590 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7592 struct isl_basic_map
*bmap
;
7593 if (!map
|| map
->n
== 0)
7595 bmap
= map
->p
[map
->n
-1];
7596 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7597 return isl_basic_map_copy(bmap
);
7600 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7602 return (struct isl_basic_set
*)
7603 isl_map_copy_basic_map((struct isl_map
*)set
);
7606 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7607 __isl_keep isl_basic_map
*bmap
)
7613 for (i
= map
->n
-1; i
>= 0; --i
) {
7614 if (map
->p
[i
] != bmap
)
7616 map
= isl_map_cow(map
);
7619 isl_basic_map_free(map
->p
[i
]);
7620 if (i
!= map
->n
-1) {
7621 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7622 map
->p
[i
] = map
->p
[map
->n
-1];
7633 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7634 struct isl_basic_set
*bset
)
7636 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7637 (struct isl_basic_map
*)bset
);
7640 /* Given two basic sets bset1 and bset2, compute the maximal difference
7641 * between the values of dimension pos in bset1 and those in bset2
7642 * for any common value of the parameters and dimensions preceding pos.
7644 static enum isl_lp_result
basic_set_maximal_difference_at(
7645 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7646 int pos
, isl_int
*opt
)
7649 struct isl_basic_map
*bmap1
= NULL
;
7650 struct isl_basic_map
*bmap2
= NULL
;
7651 struct isl_ctx
*ctx
;
7652 struct isl_vec
*obj
;
7655 unsigned dim1
, dim2
;
7656 enum isl_lp_result res
;
7658 if (!bset1
|| !bset2
)
7659 return isl_lp_error
;
7661 nparam
= isl_basic_set_n_param(bset1
);
7662 dim1
= isl_basic_set_n_dim(bset1
);
7663 dim2
= isl_basic_set_n_dim(bset2
);
7664 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7665 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7666 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7667 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7668 if (!bmap1
|| !bmap2
)
7670 bmap1
= isl_basic_map_cow(bmap1
);
7671 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7672 pos
, (dim1
- pos
) + (dim2
- pos
),
7673 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7674 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7677 total
= isl_basic_map_total_dim(bmap1
);
7679 obj
= isl_vec_alloc(ctx
, 1 + total
);
7680 isl_seq_clr(obj
->block
.data
, 1 + total
);
7681 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7682 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7685 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7687 isl_basic_map_free(bmap1
);
7691 isl_basic_map_free(bmap1
);
7692 isl_basic_map_free(bmap2
);
7693 return isl_lp_error
;
7696 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7697 * for any common value of the parameters and dimensions preceding pos
7698 * in both basic sets, the values of dimension pos in bset1 are
7699 * smaller or larger than those in bset2.
7702 * 1 if bset1 follows bset2
7703 * -1 if bset1 precedes bset2
7704 * 0 if bset1 and bset2 are incomparable
7705 * -2 if some error occurred.
7707 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7708 struct isl_basic_set
*bset2
, int pos
)
7711 enum isl_lp_result res
;
7716 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7718 if (res
== isl_lp_empty
)
7720 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7721 res
== isl_lp_unbounded
)
7723 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7732 /* Given two basic sets bset1 and bset2, check whether
7733 * for any common value of the parameters and dimensions preceding pos
7734 * there is a value of dimension pos in bset1 that is larger
7735 * than a value of the same dimension in bset2.
7738 * 1 if there exists such a pair
7739 * 0 if there is no such pair, but there is a pair of equal values
7741 * -2 if some error occurred.
7743 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7744 __isl_keep isl_basic_set
*bset2
, int pos
)
7747 enum isl_lp_result res
;
7752 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7754 if (res
== isl_lp_empty
)
7756 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7757 res
== isl_lp_unbounded
)
7759 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7761 else if (res
== isl_lp_ok
)
7770 /* Given two sets set1 and set2, check whether
7771 * for any common value of the parameters and dimensions preceding pos
7772 * there is a value of dimension pos in set1 that is larger
7773 * than a value of the same dimension in set2.
7776 * 1 if there exists such a pair
7777 * 0 if there is no such pair, but there is a pair of equal values
7779 * -2 if some error occurred.
7781 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7782 __isl_keep isl_set
*set2
, int pos
)
7790 for (i
= 0; i
< set1
->n
; ++i
)
7791 for (j
= 0; j
< set2
->n
; ++j
) {
7793 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7794 if (f
== 1 || f
== -2)
7803 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7804 unsigned pos
, isl_int
*val
)
7812 total
= isl_basic_map_total_dim(bmap
);
7813 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7814 for (; d
+1 > pos
; --d
)
7815 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7819 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7821 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7823 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7826 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7832 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7833 unsigned pos
, isl_int
*val
)
7845 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
7848 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
7849 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
7850 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
7851 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7855 isl_int_set(*val
, v
);
7861 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
7862 unsigned pos
, isl_int
*val
)
7864 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
7868 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
7871 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
7874 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
7875 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7877 if (pos
>= isl_basic_map_dim(bmap
, type
))
7879 return isl_basic_map_plain_has_fixed_var(bmap
,
7880 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
7883 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
7884 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7886 if (pos
>= isl_map_dim(map
, type
))
7888 return isl_map_plain_has_fixed_var(map
,
7889 map_offset(map
, type
) - 1 + pos
, val
);
7892 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
7893 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7895 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
7898 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
7899 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7901 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
7904 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7905 * then return this fixed value in *val.
7907 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
7908 unsigned dim
, isl_int
*val
)
7910 return isl_basic_set_plain_has_fixed_var(bset
,
7911 isl_basic_set_n_param(bset
) + dim
, val
);
7914 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7915 * then return this fixed value in *val.
7917 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
7918 unsigned dim
, isl_int
*val
)
7920 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
7923 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
7924 unsigned dim
, isl_int
*val
)
7926 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
7929 /* Check if input variable in has fixed value and if so and if val is not NULL,
7930 * then return this fixed value in *val.
7932 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
7933 unsigned in
, isl_int
*val
)
7935 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
7938 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7939 * and if val is not NULL, then return this lower bound in *val.
7941 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7942 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
7944 int i
, i_eq
= -1, i_ineq
= -1;
7951 total
= isl_basic_set_total_dim(bset
);
7952 nparam
= isl_basic_set_n_param(bset
);
7953 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7954 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
7960 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7961 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
7963 if (i_eq
!= -1 || i_ineq
!= -1)
7967 if (i_eq
== -1 && i_ineq
== -1)
7969 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
7970 /* The coefficient should always be one due to normalization. */
7971 if (!isl_int_is_one(c
[1+nparam
+dim
]))
7973 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
7975 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
7976 total
- nparam
- dim
- 1) != -1)
7979 isl_int_neg(*val
, c
[0]);
7983 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
7984 unsigned dim
, isl_int
*val
)
7996 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8000 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8002 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8003 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8005 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8009 isl_int_set(*val
, v
);
8020 /* uset_gist depends on constraints without existentially quantified
8021 * variables sorting first.
8023 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8025 const struct constraint
*c1
= (const struct constraint
*)p1
;
8026 const struct constraint
*c2
= (const struct constraint
*)p2
;
8028 unsigned size
= isl_min(c1
->size
, c2
->size
);
8030 l1
= isl_seq_last_non_zero(c1
->c
, size
);
8031 l2
= isl_seq_last_non_zero(c2
->c
, size
);
8036 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
8039 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8040 struct isl_basic_map
*bmap
)
8043 struct constraint
*c
;
8048 total
= isl_basic_map_total_dim(bmap
);
8049 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8052 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8054 c
[i
].c
= bmap
->ineq
[i
];
8056 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8057 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8058 bmap
->ineq
[i
] = c
[i
].c
;
8062 isl_basic_map_free(bmap
);
8066 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8067 __isl_take isl_basic_set
*bset
)
8069 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8070 (struct isl_basic_map
*)bset
);
8073 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8077 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8079 bmap
= isl_basic_map_remove_redundancies(bmap
);
8080 bmap
= isl_basic_map_sort_constraints(bmap
);
8081 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8085 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8087 return (struct isl_basic_set
*)isl_basic_map_normalize(
8088 (struct isl_basic_map
*)bset
);
8091 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8092 const __isl_keep isl_basic_map
*bmap2
)
8099 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8100 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8101 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8102 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8103 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8104 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8105 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8106 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8107 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8108 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8109 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8111 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8113 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8115 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8116 return bmap1
->n_eq
- bmap2
->n_eq
;
8117 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8118 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8119 if (bmap1
->n_div
!= bmap2
->n_div
)
8120 return bmap1
->n_div
- bmap2
->n_div
;
8121 total
= isl_basic_map_total_dim(bmap1
);
8122 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8123 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8127 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8128 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8132 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8133 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8140 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8141 const __isl_keep isl_basic_set
*bset2
)
8143 return isl_basic_map_plain_cmp(bset1
, bset2
);
8146 int isl_set_plain_cmp(const __isl_keep isl_set
*set1
,
8147 const __isl_keep isl_set
*set2
)
8153 if (set1
->n
!= set2
->n
)
8154 return set1
->n
- set2
->n
;
8156 for (i
= 0; i
< set1
->n
; ++i
) {
8157 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8165 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8166 __isl_keep isl_basic_map
*bmap2
)
8168 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8171 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8172 __isl_keep isl_basic_set
*bset2
)
8174 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8175 (isl_basic_map
*)bset2
);
8178 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8180 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8181 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8183 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8186 /* We normalize in place, but if anything goes wrong we need
8187 * to return NULL, so we need to make sure we don't change the
8188 * meaning of any possible other copies of map.
8190 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8193 struct isl_basic_map
*bmap
;
8197 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8199 for (i
= 0; i
< map
->n
; ++i
) {
8200 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8203 isl_basic_map_free(map
->p
[i
]);
8206 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8207 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8208 map
= isl_map_remove_empty_parts(map
);
8211 for (i
= map
->n
- 1; i
>= 1; --i
) {
8212 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8214 isl_basic_map_free(map
->p
[i
-1]);
8215 for (j
= i
; j
< map
->n
; ++j
)
8216 map
->p
[j
-1] = map
->p
[j
];
8226 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8228 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8231 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8241 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8244 map1
= isl_map_copy(map1
);
8245 map2
= isl_map_copy(map2
);
8246 map1
= isl_map_normalize(map1
);
8247 map2
= isl_map_normalize(map2
);
8250 equal
= map1
->n
== map2
->n
;
8251 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8252 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8265 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8267 return isl_map_plain_is_equal(map1
, map2
);
8270 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8272 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8273 (struct isl_map
*)set2
);
8276 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8278 return isl_set_plain_is_equal(set1
, set2
);
8281 /* Return an interval that ranges from min to max (inclusive)
8283 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8284 isl_int min
, isl_int max
)
8287 struct isl_basic_set
*bset
= NULL
;
8289 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8293 k
= isl_basic_set_alloc_inequality(bset
);
8296 isl_int_set_si(bset
->ineq
[k
][1], 1);
8297 isl_int_neg(bset
->ineq
[k
][0], min
);
8299 k
= isl_basic_set_alloc_inequality(bset
);
8302 isl_int_set_si(bset
->ineq
[k
][1], -1);
8303 isl_int_set(bset
->ineq
[k
][0], max
);
8307 isl_basic_set_free(bset
);
8311 /* Return the Cartesian product of the basic sets in list (in the given order).
8313 __isl_give isl_basic_set
*isl_basic_set_list_product(
8314 __isl_take
struct isl_basic_set_list
*list
)
8322 struct isl_basic_set
*product
= NULL
;
8326 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8327 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8328 nparam
= isl_basic_set_n_param(list
->p
[0]);
8329 dim
= isl_basic_set_n_dim(list
->p
[0]);
8330 extra
= list
->p
[0]->n_div
;
8331 n_eq
= list
->p
[0]->n_eq
;
8332 n_ineq
= list
->p
[0]->n_ineq
;
8333 for (i
= 1; i
< list
->n
; ++i
) {
8334 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8335 isl_assert(list
->ctx
,
8336 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8337 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8338 extra
+= list
->p
[i
]->n_div
;
8339 n_eq
+= list
->p
[i
]->n_eq
;
8340 n_ineq
+= list
->p
[i
]->n_ineq
;
8342 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8347 for (i
= 0; i
< list
->n
; ++i
) {
8348 isl_basic_set_add_constraints(product
,
8349 isl_basic_set_copy(list
->p
[i
]), dim
);
8350 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8352 isl_basic_set_list_free(list
);
8355 isl_basic_set_free(product
);
8356 isl_basic_set_list_free(list
);
8360 struct isl_basic_map
*isl_basic_map_product(
8361 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8363 isl_space
*dim_result
= NULL
;
8364 struct isl_basic_map
*bmap
;
8365 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8366 struct isl_dim_map
*dim_map1
, *dim_map2
;
8368 if (!bmap1
|| !bmap2
)
8371 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8372 bmap2
->dim
, isl_dim_param
), goto error
);
8373 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8374 isl_space_copy(bmap2
->dim
));
8376 in1
= isl_basic_map_n_in(bmap1
);
8377 in2
= isl_basic_map_n_in(bmap2
);
8378 out1
= isl_basic_map_n_out(bmap1
);
8379 out2
= isl_basic_map_n_out(bmap2
);
8380 nparam
= isl_basic_map_n_param(bmap1
);
8382 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8383 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8384 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8385 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8386 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8387 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8388 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8389 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8390 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8391 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8392 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8394 bmap
= isl_basic_map_alloc_space(dim_result
,
8395 bmap1
->n_div
+ bmap2
->n_div
,
8396 bmap1
->n_eq
+ bmap2
->n_eq
,
8397 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8398 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8399 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8400 bmap
= isl_basic_map_simplify(bmap
);
8401 return isl_basic_map_finalize(bmap
);
8403 isl_basic_map_free(bmap1
);
8404 isl_basic_map_free(bmap2
);
8408 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8409 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8411 isl_basic_map
*prod
;
8413 prod
= isl_basic_map_product(bmap1
, bmap2
);
8414 prod
= isl_basic_map_flatten(prod
);
8418 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8419 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8421 return isl_basic_map_flat_range_product(bset1
, bset2
);
8424 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8425 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8427 isl_space
*space_result
= NULL
;
8428 isl_basic_map
*bmap
;
8429 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8430 struct isl_dim_map
*dim_map1
, *dim_map2
;
8432 if (!bmap1
|| !bmap2
)
8435 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8436 isl_space_copy(bmap2
->dim
));
8438 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8439 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8440 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8441 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8443 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8444 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8445 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8446 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8447 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8448 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8449 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8450 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8451 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8452 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8453 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8455 bmap
= isl_basic_map_alloc_space(space_result
,
8456 bmap1
->n_div
+ bmap2
->n_div
,
8457 bmap1
->n_eq
+ bmap2
->n_eq
,
8458 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8459 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8460 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8461 bmap
= isl_basic_map_simplify(bmap
);
8462 return isl_basic_map_finalize(bmap
);
8464 isl_basic_map_free(bmap1
);
8465 isl_basic_map_free(bmap2
);
8469 __isl_give isl_basic_map
*isl_basic_map_range_product(
8470 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8472 isl_space
*dim_result
= NULL
;
8473 isl_basic_map
*bmap
;
8474 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8475 struct isl_dim_map
*dim_map1
, *dim_map2
;
8477 if (!bmap1
|| !bmap2
)
8480 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8481 bmap2
->dim
, isl_dim_param
))
8482 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8483 "parameters don't match", goto error
);
8485 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8486 isl_space_copy(bmap2
->dim
));
8488 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8489 out1
= isl_basic_map_n_out(bmap1
);
8490 out2
= isl_basic_map_n_out(bmap2
);
8491 nparam
= isl_basic_map_n_param(bmap1
);
8493 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8494 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8495 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8496 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8497 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8498 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8499 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8500 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8501 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8502 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8503 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8505 bmap
= isl_basic_map_alloc_space(dim_result
,
8506 bmap1
->n_div
+ bmap2
->n_div
,
8507 bmap1
->n_eq
+ bmap2
->n_eq
,
8508 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8509 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8510 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8511 bmap
= isl_basic_map_simplify(bmap
);
8512 return isl_basic_map_finalize(bmap
);
8514 isl_basic_map_free(bmap1
);
8515 isl_basic_map_free(bmap2
);
8519 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8520 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8522 isl_basic_map
*prod
;
8524 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8525 prod
= isl_basic_map_flatten_range(prod
);
8529 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8530 __isl_take isl_map
*map2
,
8531 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8532 __isl_take isl_space
*right
),
8533 __isl_give isl_basic_map
*(*basic_map_product
)(
8534 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8537 struct isl_map
*result
;
8543 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8544 map2
->dim
, isl_dim_param
), goto error
);
8546 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8547 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8548 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8550 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8551 isl_space_copy(map2
->dim
)),
8552 map1
->n
* map2
->n
, flags
);
8555 for (i
= 0; i
< map1
->n
; ++i
)
8556 for (j
= 0; j
< map2
->n
; ++j
) {
8557 struct isl_basic_map
*part
;
8558 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8559 isl_basic_map_copy(map2
->p
[j
]));
8560 if (isl_basic_map_is_empty(part
))
8561 isl_basic_map_free(part
);
8563 result
= isl_map_add_basic_map(result
, part
);
8576 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8578 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8579 __isl_take isl_map
*map2
)
8581 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8584 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8585 __isl_take isl_map
*map2
)
8587 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8590 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8592 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8593 __isl_take isl_map
*map2
)
8597 prod
= isl_map_product(map1
, map2
);
8598 prod
= isl_map_flatten(prod
);
8602 /* Given two set A and B, construct its Cartesian product A x B.
8604 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8606 return isl_map_range_product(set1
, set2
);
8609 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8610 __isl_take isl_set
*set2
)
8612 return isl_map_flat_range_product(set1
, set2
);
8615 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8617 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8618 __isl_take isl_map
*map2
)
8620 return map_product(map1
, map2
, &isl_space_domain_product
,
8621 &isl_basic_map_domain_product
);
8624 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8626 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8627 __isl_take isl_map
*map2
)
8629 return map_product(map1
, map2
, &isl_space_range_product
,
8630 &isl_basic_map_range_product
);
8633 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8634 __isl_take isl_map
*map2
)
8636 return isl_map_align_params_map_map_and(map1
, map2
,
8637 &map_domain_product_aligned
);
8640 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8641 __isl_take isl_map
*map2
)
8643 return isl_map_align_params_map_map_and(map1
, map2
,
8644 &map_range_product_aligned
);
8647 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8649 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8650 __isl_take isl_map
*map2
)
8654 prod
= isl_map_domain_product(map1
, map2
);
8655 prod
= isl_map_flatten_domain(prod
);
8659 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8661 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8662 __isl_take isl_map
*map2
)
8666 prod
= isl_map_range_product(map1
, map2
);
8667 prod
= isl_map_flatten_range(prod
);
8671 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8674 uint32_t hash
= isl_hash_init();
8679 bmap
= isl_basic_map_copy(bmap
);
8680 bmap
= isl_basic_map_normalize(bmap
);
8683 total
= isl_basic_map_total_dim(bmap
);
8684 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8685 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8687 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8688 isl_hash_hash(hash
, c_hash
);
8690 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8691 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8693 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8694 isl_hash_hash(hash
, c_hash
);
8696 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8697 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8699 if (isl_int_is_zero(bmap
->div
[i
][0]))
8701 isl_hash_byte(hash
, i
& 0xFF);
8702 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8703 isl_hash_hash(hash
, c_hash
);
8705 isl_basic_map_free(bmap
);
8709 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8711 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8714 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8721 map
= isl_map_copy(map
);
8722 map
= isl_map_normalize(map
);
8726 hash
= isl_hash_init();
8727 for (i
= 0; i
< map
->n
; ++i
) {
8729 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8730 isl_hash_hash(hash
, bmap_hash
);
8738 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8740 return isl_map_get_hash((isl_map
*)set
);
8743 /* Check if the value for dimension dim is completely determined
8744 * by the values of the other parameters and variables.
8745 * That is, check if dimension dim is involved in an equality.
8747 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8754 nparam
= isl_basic_set_n_param(bset
);
8755 for (i
= 0; i
< bset
->n_eq
; ++i
)
8756 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8761 /* Check if the value for dimension dim is completely determined
8762 * by the values of the other parameters and variables.
8763 * That is, check if dimension dim is involved in an equality
8764 * for each of the subsets.
8766 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8772 for (i
= 0; i
< set
->n
; ++i
) {
8774 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8781 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8783 return set
? set
->n
: 0;
8786 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8787 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8794 for (i
= 0; i
< map
->n
; ++i
)
8795 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8801 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8802 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8809 for (i
= 0; i
< set
->n
; ++i
)
8810 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8816 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
8823 bset
= isl_basic_set_cow(bset
);
8827 dim
= isl_basic_set_get_space(bset
);
8828 dim
= isl_space_lift(dim
, bset
->n_div
);
8831 isl_space_free(bset
->dim
);
8833 bset
->extra
-= bset
->n_div
;
8836 bset
= isl_basic_set_finalize(bset
);
8840 isl_basic_set_free(bset
);
8844 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
8850 set
= isl_set_align_divs(set
);
8855 set
= isl_set_cow(set
);
8859 n_div
= set
->p
[0]->n_div
;
8860 dim
= isl_set_get_space(set
);
8861 dim
= isl_space_lift(dim
, n_div
);
8864 isl_space_free(set
->dim
);
8867 for (i
= 0; i
< set
->n
; ++i
) {
8868 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
8879 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
8882 struct isl_basic_map
*bmap
;
8889 set
= isl_set_align_divs(set
);
8894 dim
= isl_set_get_space(set
);
8895 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
8897 return isl_map_identity(isl_space_map_from_set(dim
));
8900 n_div
= set
->p
[0]->n_div
;
8901 dim
= isl_space_map_from_set(dim
);
8902 n_param
= isl_space_dim(dim
, isl_dim_param
);
8903 n_set
= isl_space_dim(dim
, isl_dim_in
);
8904 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
8905 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
8906 for (i
= 0; i
< n_set
; ++i
)
8907 bmap
= var_equal(bmap
, i
);
8909 total
= n_param
+ n_set
+ n_set
+ n_div
;
8910 for (i
= 0; i
< n_div
; ++i
) {
8911 k
= isl_basic_map_alloc_inequality(bmap
);
8914 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
8915 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
8916 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
8917 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
8918 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
8919 set
->p
[0]->div
[i
][0]);
8921 l
= isl_basic_map_alloc_inequality(bmap
);
8924 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
8925 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
8926 set
->p
[0]->div
[i
][0]);
8927 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
8931 bmap
= isl_basic_map_simplify(bmap
);
8932 bmap
= isl_basic_map_finalize(bmap
);
8933 return isl_map_from_basic_map(bmap
);
8936 isl_basic_map_free(bmap
);
8940 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
8948 dim
= isl_basic_set_total_dim(bset
);
8949 size
+= bset
->n_eq
* (1 + dim
);
8950 size
+= bset
->n_ineq
* (1 + dim
);
8951 size
+= bset
->n_div
* (2 + dim
);
8956 int isl_set_size(__isl_keep isl_set
*set
)
8964 for (i
= 0; i
< set
->n
; ++i
)
8965 size
+= isl_basic_set_size(set
->p
[i
]);
8970 /* Check if there is any lower bound (if lower == 0) and/or upper
8971 * bound (if upper == 0) on the specified dim.
8973 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8974 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
8981 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
8983 pos
+= isl_basic_map_offset(bmap
, type
);
8985 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8986 if (isl_int_is_zero(bmap
->div
[i
][0]))
8988 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
8992 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8993 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
8996 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8997 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9004 return lower
&& upper
;
9007 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9008 enum isl_dim_type type
, unsigned pos
)
9010 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9013 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9014 enum isl_dim_type type
, unsigned pos
)
9016 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9019 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9020 enum isl_dim_type type
, unsigned pos
)
9022 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9025 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9026 enum isl_dim_type type
, unsigned pos
)
9033 for (i
= 0; i
< map
->n
; ++i
) {
9035 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9036 if (bounded
< 0 || !bounded
)
9043 /* Return 1 if the specified dim is involved in both an upper bound
9044 * and a lower bound.
9046 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9047 enum isl_dim_type type
, unsigned pos
)
9049 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9052 static int has_any_bound(__isl_keep isl_map
*map
,
9053 enum isl_dim_type type
, unsigned pos
,
9054 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9055 enum isl_dim_type type
, unsigned pos
))
9062 for (i
= 0; i
< map
->n
; ++i
) {
9064 bounded
= fn(map
->p
[i
], type
, pos
);
9065 if (bounded
< 0 || bounded
)
9072 /* Return 1 if the specified dim is involved in any lower bound.
9074 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9075 enum isl_dim_type type
, unsigned pos
)
9077 return has_any_bound(set
, type
, pos
,
9078 &isl_basic_map_dim_has_lower_bound
);
9081 /* Return 1 if the specified dim is involved in any upper bound.
9083 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9084 enum isl_dim_type type
, unsigned pos
)
9086 return has_any_bound(set
, type
, pos
,
9087 &isl_basic_map_dim_has_upper_bound
);
9090 /* For each of the "n" variables starting at "first", determine
9091 * the sign of the variable and put the results in the first "n"
9092 * elements of the array "signs".
9094 * 1 means that the variable is non-negative
9095 * -1 means that the variable is non-positive
9096 * 0 means the variable attains both positive and negative values.
9098 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9099 unsigned first
, unsigned n
, int *signs
)
9101 isl_vec
*bound
= NULL
;
9102 struct isl_tab
*tab
= NULL
;
9103 struct isl_tab_undo
*snap
;
9106 if (!bset
|| !signs
)
9109 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9110 tab
= isl_tab_from_basic_set(bset
, 0);
9114 isl_seq_clr(bound
->el
, bound
->size
);
9115 isl_int_set_si(bound
->el
[0], -1);
9117 snap
= isl_tab_snap(tab
);
9118 for (i
= 0; i
< n
; ++i
) {
9121 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9122 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9125 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9126 if (isl_tab_rollback(tab
, snap
) < 0)
9134 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9135 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9138 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9139 if (isl_tab_rollback(tab
, snap
) < 0)
9142 signs
[i
] = empty
? -1 : 0;
9146 isl_vec_free(bound
);
9150 isl_vec_free(bound
);
9154 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9155 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9157 if (!bset
|| !signs
)
9159 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9162 first
+= pos(bset
->dim
, type
) - 1;
9163 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9166 /* Check if the given basic map is obviously single-valued.
9167 * In particular, for each output dimension, check that there is
9168 * an equality that defines the output dimension in terms of
9169 * earlier dimensions.
9171 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9181 total
= 1 + isl_basic_map_total_dim(bmap
);
9182 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9183 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9185 for (i
= 0; i
< n_out
; ++i
) {
9186 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9187 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9189 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9190 total
- (o_out
+ i
+ 1)) == -1)
9193 if (j
>= bmap
->n_eq
)
9200 /* Check if the given basic map is single-valued.
9205 * and check if the result is a subset of the identity mapping.
9207 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9210 isl_basic_map
*test
;
9214 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9218 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9219 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9221 space
= isl_basic_map_get_space(bmap
);
9222 space
= isl_space_map_from_set(isl_space_range(space
));
9223 id
= isl_basic_map_identity(space
);
9225 sv
= isl_basic_map_is_subset(test
, id
);
9227 isl_basic_map_free(test
);
9228 isl_basic_map_free(id
);
9233 /* Check if the given map is obviously single-valued.
9235 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9244 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9247 /* Check if the given map is single-valued.
9252 * and check if the result is a subset of the identity mapping.
9254 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9261 sv
= isl_map_plain_is_single_valued(map
);
9265 test
= isl_map_reverse(isl_map_copy(map
));
9266 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9268 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9269 id
= isl_map_identity(dim
);
9271 sv
= isl_map_is_subset(test
, id
);
9279 int isl_map_is_injective(__isl_keep isl_map
*map
)
9283 map
= isl_map_copy(map
);
9284 map
= isl_map_reverse(map
);
9285 in
= isl_map_is_single_valued(map
);
9291 /* Check if the given map is obviously injective.
9293 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9297 map
= isl_map_copy(map
);
9298 map
= isl_map_reverse(map
);
9299 in
= isl_map_plain_is_single_valued(map
);
9305 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9309 sv
= isl_map_is_single_valued(map
);
9313 return isl_map_is_injective(map
);
9316 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9318 return isl_map_is_single_valued((isl_map
*)set
);
9321 int isl_map_is_translation(__isl_keep isl_map
*map
)
9326 delta
= isl_map_deltas(isl_map_copy(map
));
9327 ok
= isl_set_is_singleton(delta
);
9328 isl_set_free(delta
);
9333 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9335 if (isl_seq_first_non_zero(p
, pos
) != -1)
9337 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9342 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9351 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9354 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9355 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9356 for (j
= 0; j
< nvar
; ++j
) {
9357 int lower
= 0, upper
= 0;
9358 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9359 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9361 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9367 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9368 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9370 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9372 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9377 if (!lower
|| !upper
)
9384 int isl_set_is_box(__isl_keep isl_set
*set
)
9391 return isl_basic_set_is_box(set
->p
[0]);
9394 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9399 return isl_space_is_wrapping(bset
->dim
);
9402 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9407 return isl_space_is_wrapping(set
->dim
);
9410 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9412 bmap
= isl_basic_map_cow(bmap
);
9416 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9420 bmap
= isl_basic_map_finalize(bmap
);
9422 return (isl_basic_set
*)bmap
;
9424 isl_basic_map_free(bmap
);
9428 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9432 map
= isl_map_cow(map
);
9436 for (i
= 0; i
< map
->n
; ++i
) {
9437 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9441 map
->dim
= isl_space_wrap(map
->dim
);
9445 return (isl_set
*)map
;
9451 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9453 bset
= isl_basic_set_cow(bset
);
9457 bset
->dim
= isl_space_unwrap(bset
->dim
);
9461 bset
= isl_basic_set_finalize(bset
);
9463 return (isl_basic_map
*)bset
;
9465 isl_basic_set_free(bset
);
9469 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9476 if (!isl_set_is_wrapping(set
))
9477 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9480 set
= isl_set_cow(set
);
9484 for (i
= 0; i
< set
->n
; ++i
) {
9485 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9490 set
->dim
= isl_space_unwrap(set
->dim
);
9494 return (isl_map
*)set
;
9500 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9501 enum isl_dim_type type
)
9506 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9509 bmap
= isl_basic_map_cow(bmap
);
9513 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9517 bmap
= isl_basic_map_finalize(bmap
);
9521 isl_basic_map_free(bmap
);
9525 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9526 enum isl_dim_type type
)
9533 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9536 map
= isl_map_cow(map
);
9540 for (i
= 0; i
< map
->n
; ++i
) {
9541 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9545 map
->dim
= isl_space_reset(map
->dim
, type
);
9555 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9560 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9563 bmap
= isl_basic_map_cow(bmap
);
9567 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9571 bmap
= isl_basic_map_finalize(bmap
);
9575 isl_basic_map_free(bmap
);
9579 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9581 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9584 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9585 __isl_take isl_basic_map
*bmap
)
9590 if (!bmap
->dim
->nested
[0])
9593 bmap
= isl_basic_map_cow(bmap
);
9597 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9601 bmap
= isl_basic_map_finalize(bmap
);
9605 isl_basic_map_free(bmap
);
9609 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9610 __isl_take isl_basic_map
*bmap
)
9615 if (!bmap
->dim
->nested
[1])
9618 bmap
= isl_basic_map_cow(bmap
);
9622 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9626 bmap
= isl_basic_map_finalize(bmap
);
9630 isl_basic_map_free(bmap
);
9634 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9641 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9644 map
= isl_map_cow(map
);
9648 for (i
= 0; i
< map
->n
; ++i
) {
9649 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9653 map
->dim
= isl_space_flatten(map
->dim
);
9663 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9665 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9668 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9670 isl_space
*dim
, *flat_dim
;
9673 dim
= isl_set_get_space(set
);
9674 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9675 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9676 map
= isl_map_intersect_domain(map
, set
);
9681 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9688 if (!map
->dim
->nested
[0])
9691 map
= isl_map_cow(map
);
9695 for (i
= 0; i
< map
->n
; ++i
) {
9696 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9700 map
->dim
= isl_space_flatten_domain(map
->dim
);
9710 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9717 if (!map
->dim
->nested
[1])
9720 map
= isl_map_cow(map
);
9724 for (i
= 0; i
< map
->n
; ++i
) {
9725 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9729 map
->dim
= isl_space_flatten_range(map
->dim
);
9739 /* Reorder the dimensions of "bmap" according to the given dim_map
9740 * and set the dimension specification to "dim".
9742 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9743 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9748 bmap
= isl_basic_map_cow(bmap
);
9749 if (!bmap
|| !dim
|| !dim_map
)
9752 flags
= bmap
->flags
;
9753 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
9754 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
9755 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
9756 res
= isl_basic_map_alloc_space(dim
,
9757 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9758 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9761 res
= isl_basic_map_finalize(res
);
9765 isl_basic_map_free(bmap
);
9766 isl_space_free(dim
);
9770 /* Reorder the dimensions of "map" according to given reordering.
9772 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9773 __isl_take isl_reordering
*r
)
9776 struct isl_dim_map
*dim_map
;
9778 map
= isl_map_cow(map
);
9779 dim_map
= isl_dim_map_from_reordering(r
);
9780 if (!map
|| !r
|| !dim_map
)
9783 for (i
= 0; i
< map
->n
; ++i
) {
9784 struct isl_dim_map
*dim_map_i
;
9786 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
9788 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
9789 isl_space_copy(r
->dim
), dim_map_i
);
9795 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
9797 isl_reordering_free(r
);
9803 isl_reordering_free(r
);
9807 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
9808 __isl_take isl_reordering
*r
)
9810 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
9813 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
9814 __isl_take isl_space
*model
)
9821 ctx
= isl_space_get_ctx(model
);
9822 if (!isl_space_has_named_params(model
))
9823 isl_die(ctx
, isl_error_invalid
,
9824 "model has unnamed parameters", goto error
);
9825 if (!isl_space_has_named_params(map
->dim
))
9826 isl_die(ctx
, isl_error_invalid
,
9827 "relation has unnamed parameters", goto error
);
9828 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
9829 isl_reordering
*exp
;
9831 model
= isl_space_drop_dims(model
, isl_dim_in
,
9832 0, isl_space_dim(model
, isl_dim_in
));
9833 model
= isl_space_drop_dims(model
, isl_dim_out
,
9834 0, isl_space_dim(model
, isl_dim_out
));
9835 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
9836 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
9837 map
= isl_map_realign(map
, exp
);
9840 isl_space_free(model
);
9843 isl_space_free(model
);
9848 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
9849 __isl_take isl_space
*model
)
9851 return isl_map_align_params(set
, model
);
9854 /* Align the parameters of "bmap" to those of "model", introducing
9855 * additional parameters if needed.
9857 __isl_give isl_basic_map
*isl_basic_map_align_params(
9858 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
9862 if (!bmap
|| !model
)
9865 ctx
= isl_space_get_ctx(model
);
9866 if (!isl_space_has_named_params(model
))
9867 isl_die(ctx
, isl_error_invalid
,
9868 "model has unnamed parameters", goto error
);
9869 if (!isl_space_has_named_params(bmap
->dim
))
9870 isl_die(ctx
, isl_error_invalid
,
9871 "relation has unnamed parameters", goto error
);
9872 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
9873 isl_reordering
*exp
;
9874 struct isl_dim_map
*dim_map
;
9876 model
= isl_space_drop_dims(model
, isl_dim_in
,
9877 0, isl_space_dim(model
, isl_dim_in
));
9878 model
= isl_space_drop_dims(model
, isl_dim_out
,
9879 0, isl_space_dim(model
, isl_dim_out
));
9880 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
9881 exp
= isl_reordering_extend_space(exp
,
9882 isl_basic_map_get_space(bmap
));
9883 dim_map
= isl_dim_map_from_reordering(exp
);
9884 bmap
= isl_basic_map_realign(bmap
,
9885 exp
? isl_space_copy(exp
->dim
) : NULL
,
9886 isl_dim_map_extend(dim_map
, bmap
));
9887 isl_reordering_free(exp
);
9891 isl_space_free(model
);
9894 isl_space_free(model
);
9895 isl_basic_map_free(bmap
);
9899 /* Align the parameters of "bset" to those of "model", introducing
9900 * additional parameters if needed.
9902 __isl_give isl_basic_set
*isl_basic_set_align_params(
9903 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
9905 return isl_basic_map_align_params(bset
, model
);
9908 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
9909 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9910 enum isl_dim_type c2
, enum isl_dim_type c3
,
9911 enum isl_dim_type c4
, enum isl_dim_type c5
)
9913 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9914 struct isl_mat
*mat
;
9920 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
9921 isl_basic_map_total_dim(bmap
) + 1);
9924 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9925 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9926 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9927 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9928 isl_int_set(mat
->row
[i
][pos
],
9929 bmap
->eq
[i
][off
+ k
]);
9937 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
9938 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9939 enum isl_dim_type c2
, enum isl_dim_type c3
,
9940 enum isl_dim_type c4
, enum isl_dim_type c5
)
9942 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9943 struct isl_mat
*mat
;
9949 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
9950 isl_basic_map_total_dim(bmap
) + 1);
9953 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
9954 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9955 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9956 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9957 isl_int_set(mat
->row
[i
][pos
],
9958 bmap
->ineq
[i
][off
+ k
]);
9966 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
9967 __isl_take isl_space
*dim
,
9968 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
9969 enum isl_dim_type c2
, enum isl_dim_type c3
,
9970 enum isl_dim_type c4
, enum isl_dim_type c5
)
9972 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9973 isl_basic_map
*bmap
;
9979 if (!dim
|| !eq
|| !ineq
)
9982 if (eq
->n_col
!= ineq
->n_col
)
9983 isl_die(dim
->ctx
, isl_error_invalid
,
9984 "equalities and inequalities matrices should have "
9985 "same number of columns", goto error
);
9987 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
9989 if (eq
->n_col
< total
)
9990 isl_die(dim
->ctx
, isl_error_invalid
,
9991 "number of columns too small", goto error
);
9993 extra
= eq
->n_col
- total
;
9995 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
9996 eq
->n_row
, ineq
->n_row
);
9999 for (i
= 0; i
< extra
; ++i
) {
10000 k
= isl_basic_map_alloc_div(bmap
);
10003 isl_int_set_si(bmap
->div
[k
][0], 0);
10005 for (i
= 0; i
< eq
->n_row
; ++i
) {
10006 l
= isl_basic_map_alloc_equality(bmap
);
10009 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10010 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10011 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10012 isl_int_set(bmap
->eq
[l
][off
+ k
],
10018 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10019 l
= isl_basic_map_alloc_inequality(bmap
);
10022 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10023 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10024 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10025 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10026 ineq
->row
[i
][pos
]);
10032 isl_space_free(dim
);
10034 isl_mat_free(ineq
);
10038 isl_space_free(dim
);
10040 isl_mat_free(ineq
);
10044 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10045 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10046 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10048 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10049 c1
, c2
, c3
, c4
, isl_dim_in
);
10052 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10053 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10054 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10056 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10057 c1
, c2
, c3
, c4
, isl_dim_in
);
10060 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10061 __isl_take isl_space
*dim
,
10062 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10063 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10065 return (isl_basic_set
*)
10066 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10067 c1
, c2
, c3
, c4
, isl_dim_in
);
10070 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10075 return isl_space_can_zip(bmap
->dim
);
10078 int isl_map_can_zip(__isl_keep isl_map
*map
)
10083 return isl_space_can_zip(map
->dim
);
10086 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10087 * (A -> C) -> (B -> D).
10089 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10098 if (!isl_basic_map_can_zip(bmap
))
10099 isl_die(bmap
->ctx
, isl_error_invalid
,
10100 "basic map cannot be zipped", goto error
);
10101 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10102 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10103 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10104 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10105 bmap
= isl_basic_map_cow(bmap
);
10106 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10109 bmap
->dim
= isl_space_zip(bmap
->dim
);
10114 isl_basic_map_free(bmap
);
10118 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10119 * (A -> C) -> (B -> D).
10121 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10128 if (!isl_map_can_zip(map
))
10129 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10132 map
= isl_map_cow(map
);
10136 for (i
= 0; i
< map
->n
; ++i
) {
10137 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10142 map
->dim
= isl_space_zip(map
->dim
);
10152 /* Can we apply isl_basic_map_curry to "bmap"?
10153 * That is, does it have a nested relation in its domain?
10155 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10160 return isl_space_can_curry(bmap
->dim
);
10163 /* Can we apply isl_map_curry to "map"?
10164 * That is, does it have a nested relation in its domain?
10166 int isl_map_can_curry(__isl_keep isl_map
*map
)
10171 return isl_space_can_curry(map
->dim
);
10174 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10177 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10183 if (!isl_basic_map_can_curry(bmap
))
10184 isl_die(bmap
->ctx
, isl_error_invalid
,
10185 "basic map cannot be curried", goto error
);
10186 bmap
->dim
= isl_space_curry(bmap
->dim
);
10191 isl_basic_map_free(bmap
);
10195 /* Given a map (A -> B) -> C, return the corresponding map
10198 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10205 if (!isl_map_can_curry(map
))
10206 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10209 map
= isl_map_cow(map
);
10213 for (i
= 0; i
< map
->n
; ++i
) {
10214 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10219 map
->dim
= isl_space_curry(map
->dim
);
10229 /* Construct a basic map mapping the domain of the affine expression
10230 * to a one-dimensional range prescribed by the affine expression.
10232 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10236 isl_local_space
*ls
;
10237 isl_basic_map
*bmap
;
10242 ls
= isl_aff_get_local_space(aff
);
10243 bmap
= isl_basic_map_from_local_space(ls
);
10244 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10245 k
= isl_basic_map_alloc_equality(bmap
);
10249 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10250 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10251 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10252 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10253 aff
->v
->size
- (pos
+ 1));
10256 bmap
= isl_basic_map_finalize(bmap
);
10260 isl_basic_map_free(bmap
);
10264 /* Construct a map mapping the domain of the affine expression
10265 * to a one-dimensional range prescribed by the affine expression.
10267 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10269 isl_basic_map
*bmap
;
10271 bmap
= isl_basic_map_from_aff(aff
);
10272 return isl_map_from_basic_map(bmap
);
10275 /* Construct a basic map mapping the domain the multi-affine expression
10276 * to its range, with each dimension in the range equated to the
10277 * corresponding affine expression.
10279 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10280 __isl_take isl_multi_aff
*maff
)
10284 isl_basic_map
*bmap
;
10289 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10290 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10291 "invalid space", return isl_multi_aff_free(maff
));
10293 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10294 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10296 for (i
= 0; i
< maff
->n
; ++i
) {
10298 isl_basic_map
*bmap_i
;
10300 aff
= isl_aff_copy(maff
->p
[i
]);
10301 bmap_i
= isl_basic_map_from_aff(aff
);
10303 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10306 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10308 isl_multi_aff_free(maff
);
10312 /* Construct a map mapping the domain the multi-affine expression
10313 * to its range, with each dimension in the range equated to the
10314 * corresponding affine expression.
10316 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10318 isl_basic_map
*bmap
;
10320 bmap
= isl_basic_map_from_multi_aff(maff
);
10321 return isl_map_from_basic_map(bmap
);
10324 /* Construct a basic map mapping a domain in the given space to
10325 * to an n-dimensional range, with n the number of elements in the list,
10326 * where each coordinate in the range is prescribed by the
10327 * corresponding affine expression.
10328 * The domains of all affine expressions in the list are assumed to match
10331 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10332 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10336 isl_basic_map
*bmap
;
10341 dim
= isl_space_from_domain(domain_dim
);
10342 bmap
= isl_basic_map_universe(dim
);
10344 for (i
= 0; i
< list
->n
; ++i
) {
10346 isl_basic_map
*bmap_i
;
10348 aff
= isl_aff_copy(list
->p
[i
]);
10349 bmap_i
= isl_basic_map_from_aff(aff
);
10351 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10354 isl_aff_list_free(list
);
10358 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10359 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10361 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10364 /* Construct a basic map where the given dimensions are equal to each other.
10366 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10367 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10369 isl_basic_map
*bmap
= NULL
;
10375 if (pos1
>= isl_space_dim(space
, type1
))
10376 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10377 "index out of bounds", goto error
);
10378 if (pos2
>= isl_space_dim(space
, type2
))
10379 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10380 "index out of bounds", goto error
);
10382 if (type1
== type2
&& pos1
== pos2
)
10383 return isl_basic_map_universe(space
);
10385 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10386 i
= isl_basic_map_alloc_equality(bmap
);
10389 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10390 pos1
+= isl_basic_map_offset(bmap
, type1
);
10391 pos2
+= isl_basic_map_offset(bmap
, type2
);
10392 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10393 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10394 bmap
= isl_basic_map_finalize(bmap
);
10395 isl_space_free(space
);
10398 isl_space_free(space
);
10399 isl_basic_map_free(bmap
);
10403 /* Add a constraint imposing that the given two dimensions are equal.
10405 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10406 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10410 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10412 bmap
= isl_basic_map_intersect(bmap
, eq
);
10417 /* Add a constraint imposing that the given two dimensions are equal.
10419 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10420 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10422 isl_basic_map
*bmap
;
10424 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10426 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10431 /* Add a constraint imposing that the given two dimensions have opposite values.
10433 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10434 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10436 isl_basic_map
*bmap
= NULL
;
10442 if (pos1
>= isl_map_dim(map
, type1
))
10443 isl_die(map
->ctx
, isl_error_invalid
,
10444 "index out of bounds", goto error
);
10445 if (pos2
>= isl_map_dim(map
, type2
))
10446 isl_die(map
->ctx
, isl_error_invalid
,
10447 "index out of bounds", goto error
);
10449 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10450 i
= isl_basic_map_alloc_equality(bmap
);
10453 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10454 pos1
+= isl_basic_map_offset(bmap
, type1
);
10455 pos2
+= isl_basic_map_offset(bmap
, type2
);
10456 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10457 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10458 bmap
= isl_basic_map_finalize(bmap
);
10460 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10464 isl_basic_map_free(bmap
);
10469 /* Add a constraint imposing that the value of the first dimension is
10470 * greater than or equal to that of the second.
10472 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
10473 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10476 isl_local_space
*ls
;
10481 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
10482 isl_die(bmap
->ctx
, isl_error_invalid
,
10483 "index out of bounds", return isl_basic_map_free(bmap
));
10484 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
10485 isl_die(bmap
->ctx
, isl_error_invalid
,
10486 "index out of bounds", return isl_basic_map_free(bmap
));
10488 if (type1
== type2
&& pos1
== pos2
)
10491 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
10492 c
= isl_inequality_alloc(ls
);
10493 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
10494 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
10495 bmap
= isl_basic_map_add_constraint(bmap
, c
);
10500 /* Add a constraint imposing that the value of the first dimension is
10501 * greater than that of the second.
10503 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10504 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10506 isl_basic_map
*bmap
= NULL
;
10512 if (pos1
>= isl_map_dim(map
, type1
))
10513 isl_die(map
->ctx
, isl_error_invalid
,
10514 "index out of bounds", goto error
);
10515 if (pos2
>= isl_map_dim(map
, type2
))
10516 isl_die(map
->ctx
, isl_error_invalid
,
10517 "index out of bounds", goto error
);
10519 if (type1
== type2
&& pos1
== pos2
) {
10520 isl_space
*space
= isl_map_get_space(map
);
10522 return isl_map_empty(space
);
10525 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
10526 i
= isl_basic_map_alloc_inequality(bmap
);
10529 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10530 pos1
+= isl_basic_map_offset(bmap
, type1
);
10531 pos2
+= isl_basic_map_offset(bmap
, type2
);
10532 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
10533 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
10534 isl_int_set_si(bmap
->ineq
[i
][0], -1);
10535 bmap
= isl_basic_map_finalize(bmap
);
10537 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10541 isl_basic_map_free(bmap
);
10546 /* Add a constraint imposing that the value of the first dimension is
10547 * smaller than that of the second.
10549 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
10550 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10552 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
10555 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
10559 isl_local_space
*ls
;
10564 if (!isl_basic_map_divs_known(bmap
))
10565 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
10566 "some divs are unknown", return NULL
);
10568 ls
= isl_basic_map_get_local_space(bmap
);
10569 div
= isl_local_space_get_div(ls
, pos
);
10570 isl_local_space_free(ls
);
10575 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
10578 return isl_basic_map_get_div(bset
, pos
);
10581 /* Plug in "subs" for dimension "type", "pos" of "bset".
10583 * Let i be the dimension to replace and let "subs" be of the form
10587 * Any integer division with a non-zero coefficient for i,
10589 * floor((a i + g)/m)
10593 * floor((a f + d g)/(m d))
10595 * Constraints of the form
10603 __isl_give isl_basic_set
*isl_basic_set_substitute(
10604 __isl_take isl_basic_set
*bset
,
10605 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10611 if (bset
&& isl_basic_set_plain_is_empty(bset
))
10614 bset
= isl_basic_set_cow(bset
);
10615 if (!bset
|| !subs
)
10618 ctx
= isl_basic_set_get_ctx(bset
);
10619 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
10620 isl_die(ctx
, isl_error_invalid
,
10621 "spaces don't match", goto error
);
10622 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
10623 isl_die(ctx
, isl_error_unsupported
,
10624 "cannot handle divs yet", goto error
);
10626 pos
+= isl_basic_set_offset(bset
, type
);
10630 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10631 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
10633 isl_int_set(v
, bset
->eq
[i
][pos
]);
10634 isl_int_set_si(bset
->eq
[i
][pos
], 0);
10635 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
10636 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10639 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10640 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
10642 isl_int_set(v
, bset
->ineq
[i
][pos
]);
10643 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
10644 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
10645 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10648 for (i
= 0; i
< bset
->n_div
; ++i
) {
10649 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
10651 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
10652 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
10653 isl_seq_combine(bset
->div
[i
] + 1,
10654 subs
->v
->el
[0], bset
->div
[i
] + 1,
10655 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10656 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
10661 bset
= isl_basic_set_simplify(bset
);
10662 return isl_basic_set_finalize(bset
);
10664 isl_basic_set_free(bset
);
10668 /* Plug in "subs" for dimension "type", "pos" of "set".
10670 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
10671 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10675 if (set
&& isl_set_plain_is_empty(set
))
10678 set
= isl_set_cow(set
);
10682 for (i
= set
->n
- 1; i
>= 0; --i
) {
10683 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
10684 if (remove_if_empty(set
, i
) < 0)