2 * Copyright 2010-2011 INRIA Saclay
3 * Copyright 2013-2014 Ecole Normale Superieure
5 * Use of this software is governed by the MIT license
7 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
8 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
13 #include <isl_map_private.h>
19 #include <isl_space_private.h>
20 #include <isl_union_map_private.h>
21 #include <isl/union_set.h>
22 #include <isl/deprecated/union_map_int.h>
24 /* Return the number of parameters of "umap", where "type"
25 * is required to be set to isl_dim_param.
27 unsigned isl_union_map_dim(__isl_keep isl_union_map
*umap
,
28 enum isl_dim_type type
)
33 if (type
!= isl_dim_param
)
34 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
35 "can only reference parameters", return 0);
37 return isl_space_dim(umap
->dim
, type
);
40 /* Return the id of the specified dimension.
42 __isl_give isl_id
*isl_union_map_get_dim_id(__isl_keep isl_union_map
*umap
,
43 enum isl_dim_type type
, unsigned pos
)
48 if (type
!= isl_dim_param
)
49 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
50 "can only reference parameters", return NULL
);
52 return isl_space_get_dim_id(umap
->dim
, type
, pos
);
55 /* Is this union set a parameter domain?
57 int isl_union_set_is_params(__isl_keep isl_union_set
*uset
)
64 if (uset
->table
.n
!= 1)
67 set
= isl_set_from_union_set(isl_union_set_copy(uset
));
68 params
= isl_set_is_params(set
);
73 static __isl_give isl_union_map
*isl_union_map_alloc(
74 __isl_take isl_space
*space
, int size
)
78 space
= isl_space_params(space
);
82 umap
= isl_calloc_type(space
->ctx
, isl_union_map
);
84 isl_space_free(space
);
90 if (isl_hash_table_init(space
->ctx
, &umap
->table
, size
) < 0)
91 return isl_union_map_free(umap
);
96 __isl_give isl_union_map
*isl_union_map_empty(__isl_take isl_space
*dim
)
98 return isl_union_map_alloc(dim
, 16);
101 __isl_give isl_union_set
*isl_union_set_empty(__isl_take isl_space
*dim
)
103 return isl_union_map_empty(dim
);
106 isl_ctx
*isl_union_map_get_ctx(__isl_keep isl_union_map
*umap
)
108 return umap
? umap
->dim
->ctx
: NULL
;
111 isl_ctx
*isl_union_set_get_ctx(__isl_keep isl_union_set
*uset
)
113 return uset
? uset
->dim
->ctx
: NULL
;
116 __isl_give isl_space
*isl_union_map_get_space(__isl_keep isl_union_map
*umap
)
120 return isl_space_copy(umap
->dim
);
123 __isl_give isl_space
*isl_union_set_get_space(__isl_keep isl_union_set
*uset
)
125 return isl_union_map_get_space(uset
);
128 static int free_umap_entry(void **entry
, void *user
)
130 isl_map
*map
= *entry
;
135 static int add_map(__isl_take isl_map
*map
, void *user
)
137 isl_union_map
**umap
= (isl_union_map
**)user
;
139 *umap
= isl_union_map_add_map(*umap
, map
);
144 __isl_give isl_union_map
*isl_union_map_dup(__isl_keep isl_union_map
*umap
)
151 dup
= isl_union_map_empty(isl_space_copy(umap
->dim
));
152 if (isl_union_map_foreach_map(umap
, &add_map
, &dup
) < 0)
156 isl_union_map_free(dup
);
160 __isl_give isl_union_map
*isl_union_map_cow(__isl_take isl_union_map
*umap
)
168 return isl_union_map_dup(umap
);
171 struct isl_union_align
{
176 static int align_entry(void **entry
, void *user
)
178 isl_map
*map
= *entry
;
180 struct isl_union_align
*data
= user
;
182 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
183 isl_map_get_space(map
));
185 data
->res
= isl_union_map_add_map(data
->res
,
186 isl_map_realign(isl_map_copy(map
), exp
));
191 /* Align the parameters of umap along those of model.
192 * The result has the parameters of model first, in the same order
193 * as they appear in model, followed by any remaining parameters of
194 * umap that do not appear in model.
196 __isl_give isl_union_map
*isl_union_map_align_params(
197 __isl_take isl_union_map
*umap
, __isl_take isl_space
*model
)
199 struct isl_union_align data
= { NULL
, NULL
};
204 if (isl_space_match(umap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
205 isl_space_free(model
);
209 model
= isl_space_params(model
);
210 data
.exp
= isl_parameter_alignment_reordering(umap
->dim
, model
);
214 data
.res
= isl_union_map_alloc(isl_space_copy(data
.exp
->dim
),
216 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
217 &align_entry
, &data
) < 0)
220 isl_reordering_free(data
.exp
);
221 isl_union_map_free(umap
);
222 isl_space_free(model
);
225 isl_reordering_free(data
.exp
);
226 isl_union_map_free(umap
);
227 isl_union_map_free(data
.res
);
228 isl_space_free(model
);
232 __isl_give isl_union_set
*isl_union_set_align_params(
233 __isl_take isl_union_set
*uset
, __isl_take isl_space
*model
)
235 return isl_union_map_align_params(uset
, model
);
238 __isl_give isl_union_map
*isl_union_map_union(__isl_take isl_union_map
*umap1
,
239 __isl_take isl_union_map
*umap2
)
241 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
242 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
244 umap1
= isl_union_map_cow(umap1
);
246 if (!umap1
|| !umap2
)
249 if (isl_union_map_foreach_map(umap2
, &add_map
, &umap1
) < 0)
252 isl_union_map_free(umap2
);
256 isl_union_map_free(umap1
);
257 isl_union_map_free(umap2
);
261 __isl_give isl_union_set
*isl_union_set_union(__isl_take isl_union_set
*uset1
,
262 __isl_take isl_union_set
*uset2
)
264 return isl_union_map_union(uset1
, uset2
);
267 __isl_give isl_union_map
*isl_union_map_copy(__isl_keep isl_union_map
*umap
)
276 __isl_give isl_union_set
*isl_union_set_copy(__isl_keep isl_union_set
*uset
)
278 return isl_union_map_copy(uset
);
281 __isl_null isl_union_map
*isl_union_map_free(__isl_take isl_union_map
*umap
)
289 isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
290 &free_umap_entry
, NULL
);
291 isl_hash_table_clear(&umap
->table
);
292 isl_space_free(umap
->dim
);
297 __isl_null isl_union_set
*isl_union_set_free(__isl_take isl_union_set
*uset
)
299 return isl_union_map_free(uset
);
302 static int has_dim(const void *entry
, const void *val
)
304 isl_map
*map
= (isl_map
*)entry
;
305 isl_space
*dim
= (isl_space
*)val
;
307 return isl_space_is_equal(map
->dim
, dim
);
310 __isl_give isl_union_map
*isl_union_map_add_map(__isl_take isl_union_map
*umap
,
311 __isl_take isl_map
*map
)
314 struct isl_hash_table_entry
*entry
;
319 if (isl_map_plain_is_empty(map
)) {
324 if (!isl_space_match(map
->dim
, isl_dim_param
, umap
->dim
, isl_dim_param
)) {
325 umap
= isl_union_map_align_params(umap
, isl_map_get_space(map
));
326 map
= isl_map_align_params(map
, isl_union_map_get_space(umap
));
329 umap
= isl_union_map_cow(umap
);
334 hash
= isl_space_get_hash(map
->dim
);
335 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
336 &has_dim
, map
->dim
, 1);
343 entry
->data
= isl_map_union(entry
->data
, isl_map_copy(map
));
352 isl_union_map_free(umap
);
356 __isl_give isl_union_set
*isl_union_set_add_set(__isl_take isl_union_set
*uset
,
357 __isl_take isl_set
*set
)
359 return isl_union_map_add_map(uset
, (isl_map
*)set
);
362 __isl_give isl_union_map
*isl_union_map_from_map(__isl_take isl_map
*map
)
370 dim
= isl_map_get_space(map
);
371 dim
= isl_space_params(dim
);
372 umap
= isl_union_map_empty(dim
);
373 umap
= isl_union_map_add_map(umap
, map
);
378 __isl_give isl_union_set
*isl_union_set_from_set(__isl_take isl_set
*set
)
380 return isl_union_map_from_map((isl_map
*)set
);
383 __isl_give isl_union_map
*isl_union_map_from_basic_map(
384 __isl_take isl_basic_map
*bmap
)
386 return isl_union_map_from_map(isl_map_from_basic_map(bmap
));
389 __isl_give isl_union_set
*isl_union_set_from_basic_set(
390 __isl_take isl_basic_set
*bset
)
392 return isl_union_map_from_basic_map(bset
);
395 struct isl_union_map_foreach_data
397 int (*fn
)(__isl_take isl_map
*map
, void *user
);
401 static int call_on_copy(void **entry
, void *user
)
403 isl_map
*map
= *entry
;
404 struct isl_union_map_foreach_data
*data
;
405 data
= (struct isl_union_map_foreach_data
*)user
;
407 return data
->fn(isl_map_copy(map
), data
->user
);
410 int isl_union_map_n_map(__isl_keep isl_union_map
*umap
)
412 return umap
? umap
->table
.n
: 0;
415 int isl_union_set_n_set(__isl_keep isl_union_set
*uset
)
417 return uset
? uset
->table
.n
: 0;
420 int isl_union_map_foreach_map(__isl_keep isl_union_map
*umap
,
421 int (*fn
)(__isl_take isl_map
*map
, void *user
), void *user
)
423 struct isl_union_map_foreach_data data
= { fn
, user
};
428 return isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
429 &call_on_copy
, &data
);
432 static int copy_map(void **entry
, void *user
)
434 isl_map
*map
= *entry
;
435 isl_map
**map_p
= user
;
437 *map_p
= isl_map_copy(map
);
442 __isl_give isl_map
*isl_map_from_union_map(__isl_take isl_union_map
*umap
)
449 ctx
= isl_union_map_get_ctx(umap
);
450 if (umap
->table
.n
!= 1)
451 isl_die(ctx
, isl_error_invalid
,
452 "union map needs to contain elements in exactly "
453 "one space", goto error
);
455 isl_hash_table_foreach(ctx
, &umap
->table
, ©_map
, &map
);
457 isl_union_map_free(umap
);
461 isl_union_map_free(umap
);
465 __isl_give isl_set
*isl_set_from_union_set(__isl_take isl_union_set
*uset
)
467 return isl_map_from_union_map(uset
);
470 /* Extract the map in "umap" that lives in the given space (ignoring
473 __isl_give isl_map
*isl_union_map_extract_map(__isl_keep isl_union_map
*umap
,
474 __isl_take isl_space
*space
)
477 struct isl_hash_table_entry
*entry
;
479 space
= isl_space_drop_dims(space
, isl_dim_param
,
480 0, isl_space_dim(space
, isl_dim_param
));
481 space
= isl_space_align_params(space
, isl_union_map_get_space(umap
));
485 hash
= isl_space_get_hash(space
);
486 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
489 return isl_map_empty(space
);
490 isl_space_free(space
);
491 return isl_map_copy(entry
->data
);
493 isl_space_free(space
);
497 __isl_give isl_set
*isl_union_set_extract_set(__isl_keep isl_union_set
*uset
,
498 __isl_take isl_space
*dim
)
500 return (isl_set
*)isl_union_map_extract_map(uset
, dim
);
503 /* Check if umap contains a map in the given space.
505 __isl_give
int isl_union_map_contains(__isl_keep isl_union_map
*umap
,
506 __isl_keep isl_space
*dim
)
509 struct isl_hash_table_entry
*entry
;
514 hash
= isl_space_get_hash(dim
);
515 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
520 __isl_give
int isl_union_set_contains(__isl_keep isl_union_set
*uset
,
521 __isl_keep isl_space
*dim
)
523 return isl_union_map_contains(uset
, dim
);
526 int isl_union_set_foreach_set(__isl_keep isl_union_set
*uset
,
527 int (*fn
)(__isl_take isl_set
*set
, void *user
), void *user
)
529 return isl_union_map_foreach_map(uset
,
530 (int(*)(__isl_take isl_map
*, void*))fn
, user
);
533 struct isl_union_set_foreach_point_data
{
534 int (*fn
)(__isl_take isl_point
*pnt
, void *user
);
538 static int foreach_point(__isl_take isl_set
*set
, void *user
)
540 struct isl_union_set_foreach_point_data
*data
= user
;
543 r
= isl_set_foreach_point(set
, data
->fn
, data
->user
);
549 int isl_union_set_foreach_point(__isl_keep isl_union_set
*uset
,
550 int (*fn
)(__isl_take isl_point
*pnt
, void *user
), void *user
)
552 struct isl_union_set_foreach_point_data data
= { fn
, user
};
553 return isl_union_set_foreach_set(uset
, &foreach_point
, &data
);
556 struct isl_union_map_gen_bin_data
{
557 isl_union_map
*umap2
;
561 static int subtract_entry(void **entry
, void *user
)
563 struct isl_union_map_gen_bin_data
*data
= user
;
565 struct isl_hash_table_entry
*entry2
;
566 isl_map
*map
= *entry
;
568 hash
= isl_space_get_hash(map
->dim
);
569 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
570 hash
, &has_dim
, map
->dim
, 0);
571 map
= isl_map_copy(map
);
574 map
= isl_map_subtract(map
, isl_map_copy(entry2
->data
));
576 empty
= isl_map_is_empty(map
);
586 data
->res
= isl_union_map_add_map(data
->res
, map
);
591 static __isl_give isl_union_map
*gen_bin_op(__isl_take isl_union_map
*umap1
,
592 __isl_take isl_union_map
*umap2
, int (*fn
)(void **, void *))
594 struct isl_union_map_gen_bin_data data
= { NULL
, NULL
};
596 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
597 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
599 if (!umap1
|| !umap2
)
603 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
605 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
609 isl_union_map_free(umap1
);
610 isl_union_map_free(umap2
);
613 isl_union_map_free(umap1
);
614 isl_union_map_free(umap2
);
615 isl_union_map_free(data
.res
);
619 __isl_give isl_union_map
*isl_union_map_subtract(
620 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
622 return gen_bin_op(umap1
, umap2
, &subtract_entry
);
625 __isl_give isl_union_set
*isl_union_set_subtract(
626 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
628 return isl_union_map_subtract(uset1
, uset2
);
631 struct isl_union_map_gen_bin_set_data
{
636 static int intersect_params_entry(void **entry
, void *user
)
638 struct isl_union_map_gen_bin_set_data
*data
= user
;
639 isl_map
*map
= *entry
;
642 map
= isl_map_copy(map
);
643 map
= isl_map_intersect_params(map
, isl_set_copy(data
->set
));
645 empty
= isl_map_is_empty(map
);
651 data
->res
= isl_union_map_add_map(data
->res
, map
);
656 static __isl_give isl_union_map
*gen_bin_set_op(__isl_take isl_union_map
*umap
,
657 __isl_take isl_set
*set
, int (*fn
)(void **, void *))
659 struct isl_union_map_gen_bin_set_data data
= { NULL
, NULL
};
661 umap
= isl_union_map_align_params(umap
, isl_set_get_space(set
));
662 set
= isl_set_align_params(set
, isl_union_map_get_space(umap
));
668 data
.res
= isl_union_map_alloc(isl_space_copy(umap
->dim
),
670 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
674 isl_union_map_free(umap
);
678 isl_union_map_free(umap
);
680 isl_union_map_free(data
.res
);
684 __isl_give isl_union_map
*isl_union_map_intersect_params(
685 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
687 return gen_bin_set_op(umap
, set
, &intersect_params_entry
);
690 __isl_give isl_union_set
*isl_union_set_intersect_params(
691 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
693 return isl_union_map_intersect_params(uset
, set
);
696 static __isl_give isl_union_map
*union_map_intersect_params(
697 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
699 return isl_union_map_intersect_params(umap
,
700 isl_set_from_union_set(uset
));
703 static __isl_give isl_union_map
*union_map_gist_params(
704 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
706 return isl_union_map_gist_params(umap
, isl_set_from_union_set(uset
));
709 struct isl_union_map_match_bin_data
{
710 isl_union_map
*umap2
;
712 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*);
715 static int match_bin_entry(void **entry
, void *user
)
717 struct isl_union_map_match_bin_data
*data
= user
;
719 struct isl_hash_table_entry
*entry2
;
720 isl_map
*map
= *entry
;
723 hash
= isl_space_get_hash(map
->dim
);
724 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
725 hash
, &has_dim
, map
->dim
, 0);
729 map
= isl_map_copy(map
);
730 map
= data
->fn(map
, isl_map_copy(entry2
->data
));
732 empty
= isl_map_is_empty(map
);
742 data
->res
= isl_union_map_add_map(data
->res
, map
);
747 static __isl_give isl_union_map
*match_bin_op(__isl_take isl_union_map
*umap1
,
748 __isl_take isl_union_map
*umap2
,
749 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*))
751 struct isl_union_map_match_bin_data data
= { NULL
, NULL
, fn
};
753 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
754 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
756 if (!umap1
|| !umap2
)
760 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
762 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
763 &match_bin_entry
, &data
) < 0)
766 isl_union_map_free(umap1
);
767 isl_union_map_free(umap2
);
770 isl_union_map_free(umap1
);
771 isl_union_map_free(umap2
);
772 isl_union_map_free(data
.res
);
776 __isl_give isl_union_map
*isl_union_map_intersect(
777 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
779 return match_bin_op(umap1
, umap2
, &isl_map_intersect
);
782 /* Compute the intersection of the two union_sets.
783 * As a special case, if exactly one of the two union_sets
784 * is a parameter domain, then intersect the parameter domain
785 * of the other one with this set.
787 __isl_give isl_union_set
*isl_union_set_intersect(
788 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
792 p1
= isl_union_set_is_params(uset1
);
793 p2
= isl_union_set_is_params(uset2
);
794 if (p1
< 0 || p2
< 0)
797 return union_map_intersect_params(uset1
, uset2
);
799 return union_map_intersect_params(uset2
, uset1
);
800 return isl_union_map_intersect(uset1
, uset2
);
802 isl_union_set_free(uset1
);
803 isl_union_set_free(uset2
);
807 static int gist_params_entry(void **entry
, void *user
)
809 struct isl_union_map_gen_bin_set_data
*data
= user
;
810 isl_map
*map
= *entry
;
813 map
= isl_map_copy(map
);
814 map
= isl_map_gist_params(map
, isl_set_copy(data
->set
));
816 empty
= isl_map_is_empty(map
);
822 data
->res
= isl_union_map_add_map(data
->res
, map
);
827 __isl_give isl_union_map
*isl_union_map_gist_params(
828 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
830 return gen_bin_set_op(umap
, set
, &gist_params_entry
);
833 __isl_give isl_union_set
*isl_union_set_gist_params(
834 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
836 return isl_union_map_gist_params(uset
, set
);
839 __isl_give isl_union_map
*isl_union_map_gist(__isl_take isl_union_map
*umap
,
840 __isl_take isl_union_map
*context
)
842 return match_bin_op(umap
, context
, &isl_map_gist
);
845 __isl_give isl_union_set
*isl_union_set_gist(__isl_take isl_union_set
*uset
,
846 __isl_take isl_union_set
*context
)
848 if (isl_union_set_is_params(context
))
849 return union_map_gist_params(uset
, context
);
850 return isl_union_map_gist(uset
, context
);
853 static __isl_give isl_map
*lex_le_set(__isl_take isl_map
*set1
,
854 __isl_take isl_map
*set2
)
856 return isl_set_lex_le_set((isl_set
*)set1
, (isl_set
*)set2
);
859 static __isl_give isl_map
*lex_lt_set(__isl_take isl_map
*set1
,
860 __isl_take isl_map
*set2
)
862 return isl_set_lex_lt_set((isl_set
*)set1
, (isl_set
*)set2
);
865 __isl_give isl_union_map
*isl_union_set_lex_lt_union_set(
866 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
868 return match_bin_op(uset1
, uset2
, &lex_lt_set
);
871 __isl_give isl_union_map
*isl_union_set_lex_le_union_set(
872 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
874 return match_bin_op(uset1
, uset2
, &lex_le_set
);
877 __isl_give isl_union_map
*isl_union_set_lex_gt_union_set(
878 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
880 return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2
, uset1
));
883 __isl_give isl_union_map
*isl_union_set_lex_ge_union_set(
884 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
886 return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2
, uset1
));
889 __isl_give isl_union_map
*isl_union_map_lex_gt_union_map(
890 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
892 return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2
, umap1
));
895 __isl_give isl_union_map
*isl_union_map_lex_ge_union_map(
896 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
898 return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2
, umap1
));
901 static int intersect_domain_entry(void **entry
, void *user
)
903 struct isl_union_map_gen_bin_data
*data
= user
;
905 struct isl_hash_table_entry
*entry2
;
907 isl_map
*map
= *entry
;
910 dim
= isl_map_get_space(map
);
911 dim
= isl_space_domain(dim
);
912 hash
= isl_space_get_hash(dim
);
913 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
914 hash
, &has_dim
, dim
, 0);
919 map
= isl_map_copy(map
);
920 map
= isl_map_intersect_domain(map
, isl_set_copy(entry2
->data
));
922 empty
= isl_map_is_empty(map
);
932 data
->res
= isl_union_map_add_map(data
->res
, map
);
937 /* Intersect the domain of "umap" with "uset".
938 * If "uset" is a parameters domain, then intersect the parameter
939 * domain of "umap" with this set.
941 __isl_give isl_union_map
*isl_union_map_intersect_domain(
942 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
944 if (isl_union_set_is_params(uset
))
945 return union_map_intersect_params(umap
, uset
);
946 return gen_bin_op(umap
, uset
, &intersect_domain_entry
);
949 /* Remove the elements of data->umap2 from the domain of *entry
950 * and add the result to data->res.
952 static int subtract_domain_entry(void **entry
, void *user
)
954 struct isl_union_map_gen_bin_data
*data
= user
;
956 struct isl_hash_table_entry
*entry2
;
958 isl_map
*map
= *entry
;
961 dim
= isl_map_get_space(map
);
962 dim
= isl_space_domain(dim
);
963 hash
= isl_space_get_hash(dim
);
964 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
965 hash
, &has_dim
, dim
, 0);
968 map
= isl_map_copy(map
);
971 data
->res
= isl_union_map_add_map(data
->res
, map
);
975 map
= isl_map_subtract_domain(map
, isl_set_copy(entry2
->data
));
977 empty
= isl_map_is_empty(map
);
987 data
->res
= isl_union_map_add_map(data
->res
, map
);
992 /* Remove the elements of "uset" from the domain of "umap".
994 __isl_give isl_union_map
*isl_union_map_subtract_domain(
995 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*dom
)
997 return gen_bin_op(umap
, dom
, &subtract_domain_entry
);
1000 /* Remove the elements of data->umap2 from the range of *entry
1001 * and add the result to data->res.
1003 static int subtract_range_entry(void **entry
, void *user
)
1005 struct isl_union_map_gen_bin_data
*data
= user
;
1007 struct isl_hash_table_entry
*entry2
;
1009 isl_map
*map
= *entry
;
1012 space
= isl_map_get_space(map
);
1013 space
= isl_space_range(space
);
1014 hash
= isl_space_get_hash(space
);
1015 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1016 hash
, &has_dim
, space
, 0);
1017 isl_space_free(space
);
1019 map
= isl_map_copy(map
);
1022 data
->res
= isl_union_map_add_map(data
->res
, map
);
1026 map
= isl_map_subtract_range(map
, isl_set_copy(entry2
->data
));
1028 empty
= isl_map_is_empty(map
);
1038 data
->res
= isl_union_map_add_map(data
->res
, map
);
1043 /* Remove the elements of "uset" from the range of "umap".
1045 __isl_give isl_union_map
*isl_union_map_subtract_range(
1046 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*dom
)
1048 return gen_bin_op(umap
, dom
, &subtract_range_entry
);
1051 static int gist_domain_entry(void **entry
, void *user
)
1053 struct isl_union_map_gen_bin_data
*data
= user
;
1055 struct isl_hash_table_entry
*entry2
;
1057 isl_map
*map
= *entry
;
1060 dim
= isl_map_get_space(map
);
1061 dim
= isl_space_domain(dim
);
1062 hash
= isl_space_get_hash(dim
);
1063 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1064 hash
, &has_dim
, dim
, 0);
1065 isl_space_free(dim
);
1069 map
= isl_map_copy(map
);
1070 map
= isl_map_gist_domain(map
, isl_set_copy(entry2
->data
));
1072 empty
= isl_map_is_empty(map
);
1078 data
->res
= isl_union_map_add_map(data
->res
, map
);
1083 /* Compute the gist of "umap" with respect to the domain "uset".
1084 * If "uset" is a parameters domain, then compute the gist
1085 * with respect to this parameter domain.
1087 __isl_give isl_union_map
*isl_union_map_gist_domain(
1088 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1090 if (isl_union_set_is_params(uset
))
1091 return union_map_gist_params(umap
, uset
);
1092 return gen_bin_op(umap
, uset
, &gist_domain_entry
);
1095 static int gist_range_entry(void **entry
, void *user
)
1097 struct isl_union_map_gen_bin_data
*data
= user
;
1099 struct isl_hash_table_entry
*entry2
;
1101 isl_map
*map
= *entry
;
1104 space
= isl_map_get_space(map
);
1105 space
= isl_space_range(space
);
1106 hash
= isl_space_get_hash(space
);
1107 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1108 hash
, &has_dim
, space
, 0);
1109 isl_space_free(space
);
1113 map
= isl_map_copy(map
);
1114 map
= isl_map_gist_range(map
, isl_set_copy(entry2
->data
));
1116 empty
= isl_map_is_empty(map
);
1122 data
->res
= isl_union_map_add_map(data
->res
, map
);
1127 /* Compute the gist of "umap" with respect to the range "uset".
1129 __isl_give isl_union_map
*isl_union_map_gist_range(
1130 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1132 return gen_bin_op(umap
, uset
, &gist_range_entry
);
1135 static int intersect_range_entry(void **entry
, void *user
)
1137 struct isl_union_map_gen_bin_data
*data
= user
;
1139 struct isl_hash_table_entry
*entry2
;
1141 isl_map
*map
= *entry
;
1144 dim
= isl_map_get_space(map
);
1145 dim
= isl_space_range(dim
);
1146 hash
= isl_space_get_hash(dim
);
1147 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1148 hash
, &has_dim
, dim
, 0);
1149 isl_space_free(dim
);
1153 map
= isl_map_copy(map
);
1154 map
= isl_map_intersect_range(map
, isl_set_copy(entry2
->data
));
1156 empty
= isl_map_is_empty(map
);
1166 data
->res
= isl_union_map_add_map(data
->res
, map
);
1171 __isl_give isl_union_map
*isl_union_map_intersect_range(
1172 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1174 return gen_bin_op(umap
, uset
, &intersect_range_entry
);
1177 struct isl_union_map_bin_data
{
1178 isl_union_map
*umap2
;
1181 int (*fn
)(void **entry
, void *user
);
1184 static int apply_range_entry(void **entry
, void *user
)
1186 struct isl_union_map_bin_data
*data
= user
;
1187 isl_map
*map2
= *entry
;
1190 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
1191 map2
->dim
, isl_dim_in
))
1194 map2
= isl_map_apply_range(isl_map_copy(data
->map
), isl_map_copy(map2
));
1196 empty
= isl_map_is_empty(map2
);
1206 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1211 static int bin_entry(void **entry
, void *user
)
1213 struct isl_union_map_bin_data
*data
= user
;
1214 isl_map
*map
= *entry
;
1217 if (isl_hash_table_foreach(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1218 data
->fn
, data
) < 0)
1224 static __isl_give isl_union_map
*bin_op(__isl_take isl_union_map
*umap1
,
1225 __isl_take isl_union_map
*umap2
, int (*fn
)(void **entry
, void *user
))
1227 struct isl_union_map_bin_data data
= { NULL
, NULL
, NULL
, fn
};
1229 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
1230 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1232 if (!umap1
|| !umap2
)
1236 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
1238 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1239 &bin_entry
, &data
) < 0)
1242 isl_union_map_free(umap1
);
1243 isl_union_map_free(umap2
);
1246 isl_union_map_free(umap1
);
1247 isl_union_map_free(umap2
);
1248 isl_union_map_free(data
.res
);
1252 __isl_give isl_union_map
*isl_union_map_apply_range(
1253 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1255 return bin_op(umap1
, umap2
, &apply_range_entry
);
1258 __isl_give isl_union_map
*isl_union_map_apply_domain(
1259 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1261 umap1
= isl_union_map_reverse(umap1
);
1262 umap1
= isl_union_map_apply_range(umap1
, umap2
);
1263 return isl_union_map_reverse(umap1
);
1266 __isl_give isl_union_set
*isl_union_set_apply(
1267 __isl_take isl_union_set
*uset
, __isl_take isl_union_map
*umap
)
1269 return isl_union_map_apply_range(uset
, umap
);
1272 static int map_lex_lt_entry(void **entry
, void *user
)
1274 struct isl_union_map_bin_data
*data
= user
;
1275 isl_map
*map2
= *entry
;
1277 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
1278 map2
->dim
, isl_dim_out
))
1281 map2
= isl_map_lex_lt_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1283 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1288 __isl_give isl_union_map
*isl_union_map_lex_lt_union_map(
1289 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1291 return bin_op(umap1
, umap2
, &map_lex_lt_entry
);
1294 static int map_lex_le_entry(void **entry
, void *user
)
1296 struct isl_union_map_bin_data
*data
= user
;
1297 isl_map
*map2
= *entry
;
1299 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
1300 map2
->dim
, isl_dim_out
))
1303 map2
= isl_map_lex_le_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1305 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1310 __isl_give isl_union_map
*isl_union_map_lex_le_union_map(
1311 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1313 return bin_op(umap1
, umap2
, &map_lex_le_entry
);
1316 static int product_entry(void **entry
, void *user
)
1318 struct isl_union_map_bin_data
*data
= user
;
1319 isl_map
*map2
= *entry
;
1321 map2
= isl_map_product(isl_map_copy(data
->map
), isl_map_copy(map2
));
1323 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1328 __isl_give isl_union_map
*isl_union_map_product(__isl_take isl_union_map
*umap1
,
1329 __isl_take isl_union_map
*umap2
)
1331 return bin_op(umap1
, umap2
, &product_entry
);
1334 static int set_product_entry(void **entry
, void *user
)
1336 struct isl_union_map_bin_data
*data
= user
;
1337 isl_set
*set2
= *entry
;
1339 set2
= isl_set_product(isl_set_copy(data
->map
), isl_set_copy(set2
));
1341 data
->res
= isl_union_set_add_set(data
->res
, set2
);
1346 __isl_give isl_union_set
*isl_union_set_product(__isl_take isl_union_set
*uset1
,
1347 __isl_take isl_union_set
*uset2
)
1349 return bin_op(uset1
, uset2
, &set_product_entry
);
1352 static int domain_product_entry(void **entry
, void *user
)
1354 struct isl_union_map_bin_data
*data
= user
;
1355 isl_map
*map2
= *entry
;
1357 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_out
,
1358 map2
->dim
, isl_dim_out
))
1361 map2
= isl_map_domain_product(isl_map_copy(data
->map
),
1362 isl_map_copy(map2
));
1364 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1369 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
1371 __isl_give isl_union_map
*isl_union_map_domain_product(
1372 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1374 return bin_op(umap1
, umap2
, &domain_product_entry
);
1377 static int range_product_entry(void **entry
, void *user
)
1379 struct isl_union_map_bin_data
*data
= user
;
1380 isl_map
*map2
= *entry
;
1382 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_in
,
1383 map2
->dim
, isl_dim_in
))
1386 map2
= isl_map_range_product(isl_map_copy(data
->map
),
1387 isl_map_copy(map2
));
1389 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1394 __isl_give isl_union_map
*isl_union_map_range_product(
1395 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1397 return bin_op(umap1
, umap2
, &range_product_entry
);
1400 static int flat_range_product_entry(void **entry
, void *user
)
1402 struct isl_union_map_bin_data
*data
= user
;
1403 isl_map
*map2
= *entry
;
1405 if (!isl_space_tuple_match(data
->map
->dim
, isl_dim_in
,
1406 map2
->dim
, isl_dim_in
))
1409 map2
= isl_map_flat_range_product(isl_map_copy(data
->map
),
1410 isl_map_copy(map2
));
1412 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1417 __isl_give isl_union_map
*isl_union_map_flat_range_product(
1418 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1420 return bin_op(umap1
, umap2
, &flat_range_product_entry
);
1423 static __isl_give isl_union_set
*cond_un_op(__isl_take isl_union_map
*umap
,
1424 int (*fn
)(void **, void *))
1431 res
= isl_union_map_alloc(isl_space_copy(umap
->dim
), umap
->table
.n
);
1432 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, &res
) < 0)
1435 isl_union_map_free(umap
);
1438 isl_union_map_free(umap
);
1439 isl_union_set_free(res
);
1443 static int from_range_entry(void **entry
, void *user
)
1445 isl_map
*set
= *entry
;
1446 isl_union_set
**res
= user
;
1448 *res
= isl_union_map_add_map(*res
,
1449 isl_map_from_range(isl_set_copy(set
)));
1454 __isl_give isl_union_map
*isl_union_map_from_range(
1455 __isl_take isl_union_set
*uset
)
1457 return cond_un_op(uset
, &from_range_entry
);
1460 __isl_give isl_union_map
*isl_union_map_from_domain(
1461 __isl_take isl_union_set
*uset
)
1463 return isl_union_map_reverse(isl_union_map_from_range(uset
));
1466 __isl_give isl_union_map
*isl_union_map_from_domain_and_range(
1467 __isl_take isl_union_set
*domain
, __isl_take isl_union_set
*range
)
1469 return isl_union_map_apply_range(isl_union_map_from_domain(domain
),
1470 isl_union_map_from_range(range
));
1473 static __isl_give isl_union_map
*un_op(__isl_take isl_union_map
*umap
,
1474 int (*fn
)(void **, void *))
1476 umap
= isl_union_map_cow(umap
);
1480 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, NULL
) < 0)
1485 isl_union_map_free(umap
);
1489 static int affine_entry(void **entry
, void *user
)
1491 isl_map
**map
= (isl_map
**)entry
;
1493 *map
= isl_map_from_basic_map(isl_map_affine_hull(*map
));
1495 return *map
? 0 : -1;
1498 __isl_give isl_union_map
*isl_union_map_affine_hull(
1499 __isl_take isl_union_map
*umap
)
1501 return un_op(umap
, &affine_entry
);
1504 __isl_give isl_union_set
*isl_union_set_affine_hull(
1505 __isl_take isl_union_set
*uset
)
1507 return isl_union_map_affine_hull(uset
);
1510 static int polyhedral_entry(void **entry
, void *user
)
1512 isl_map
**map
= (isl_map
**)entry
;
1514 *map
= isl_map_from_basic_map(isl_map_polyhedral_hull(*map
));
1516 return *map
? 0 : -1;
1519 __isl_give isl_union_map
*isl_union_map_polyhedral_hull(
1520 __isl_take isl_union_map
*umap
)
1522 return un_op(umap
, &polyhedral_entry
);
1525 __isl_give isl_union_set
*isl_union_set_polyhedral_hull(
1526 __isl_take isl_union_set
*uset
)
1528 return isl_union_map_polyhedral_hull(uset
);
1531 static int simple_entry(void **entry
, void *user
)
1533 isl_map
**map
= (isl_map
**)entry
;
1535 *map
= isl_map_from_basic_map(isl_map_simple_hull(*map
));
1537 return *map
? 0 : -1;
1540 __isl_give isl_union_map
*isl_union_map_simple_hull(
1541 __isl_take isl_union_map
*umap
)
1543 return un_op(umap
, &simple_entry
);
1546 __isl_give isl_union_set
*isl_union_set_simple_hull(
1547 __isl_take isl_union_set
*uset
)
1549 return isl_union_map_simple_hull(uset
);
1552 static int inplace_entry(void **entry
, void *user
)
1554 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*);
1555 isl_map
**map
= (isl_map
**)entry
;
1558 fn
= *(__isl_give isl_map
*(**)(__isl_take isl_map
*)) user
;
1559 copy
= fn(isl_map_copy(*map
));
1569 static __isl_give isl_union_map
*inplace(__isl_take isl_union_map
*umap
,
1570 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*))
1575 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1576 &inplace_entry
, &fn
) < 0)
1581 isl_union_map_free(umap
);
1585 __isl_give isl_union_map
*isl_union_map_coalesce(
1586 __isl_take isl_union_map
*umap
)
1588 return inplace(umap
, &isl_map_coalesce
);
1591 __isl_give isl_union_set
*isl_union_set_coalesce(
1592 __isl_take isl_union_set
*uset
)
1594 return isl_union_map_coalesce(uset
);
1597 __isl_give isl_union_map
*isl_union_map_detect_equalities(
1598 __isl_take isl_union_map
*umap
)
1600 return inplace(umap
, &isl_map_detect_equalities
);
1603 __isl_give isl_union_set
*isl_union_set_detect_equalities(
1604 __isl_take isl_union_set
*uset
)
1606 return isl_union_map_detect_equalities(uset
);
1609 __isl_give isl_union_map
*isl_union_map_compute_divs(
1610 __isl_take isl_union_map
*umap
)
1612 return inplace(umap
, &isl_map_compute_divs
);
1615 __isl_give isl_union_set
*isl_union_set_compute_divs(
1616 __isl_take isl_union_set
*uset
)
1618 return isl_union_map_compute_divs(uset
);
1621 static int lexmin_entry(void **entry
, void *user
)
1623 isl_map
**map
= (isl_map
**)entry
;
1625 *map
= isl_map_lexmin(*map
);
1627 return *map
? 0 : -1;
1630 __isl_give isl_union_map
*isl_union_map_lexmin(
1631 __isl_take isl_union_map
*umap
)
1633 return un_op(umap
, &lexmin_entry
);
1636 __isl_give isl_union_set
*isl_union_set_lexmin(
1637 __isl_take isl_union_set
*uset
)
1639 return isl_union_map_lexmin(uset
);
1642 static int lexmax_entry(void **entry
, void *user
)
1644 isl_map
**map
= (isl_map
**)entry
;
1646 *map
= isl_map_lexmax(*map
);
1648 return *map
? 0 : -1;
1651 __isl_give isl_union_map
*isl_union_map_lexmax(
1652 __isl_take isl_union_map
*umap
)
1654 return un_op(umap
, &lexmax_entry
);
1657 __isl_give isl_union_set
*isl_union_set_lexmax(
1658 __isl_take isl_union_set
*uset
)
1660 return isl_union_map_lexmax(uset
);
1663 static int universe_entry(void **entry
, void *user
)
1665 isl_map
*map
= *entry
;
1666 isl_union_map
**res
= user
;
1668 map
= isl_map_universe(isl_map_get_space(map
));
1669 *res
= isl_union_map_add_map(*res
, map
);
1674 __isl_give isl_union_map
*isl_union_map_universe(__isl_take isl_union_map
*umap
)
1676 return cond_un_op(umap
, &universe_entry
);
1679 __isl_give isl_union_set
*isl_union_set_universe(__isl_take isl_union_set
*uset
)
1681 return isl_union_map_universe(uset
);
1684 static int reverse_entry(void **entry
, void *user
)
1686 isl_map
*map
= *entry
;
1687 isl_union_map
**res
= user
;
1689 *res
= isl_union_map_add_map(*res
, isl_map_reverse(isl_map_copy(map
)));
1694 __isl_give isl_union_map
*isl_union_map_reverse(__isl_take isl_union_map
*umap
)
1696 return cond_un_op(umap
, &reverse_entry
);
1699 static int params_entry(void **entry
, void *user
)
1701 isl_map
*map
= *entry
;
1702 isl_union_set
**res
= user
;
1704 *res
= isl_union_set_add_set(*res
, isl_map_params(isl_map_copy(map
)));
1709 /* Compute the parameter domain of the given union map.
1711 __isl_give isl_set
*isl_union_map_params(__isl_take isl_union_map
*umap
)
1715 empty
= isl_union_map_is_empty(umap
);
1720 space
= isl_union_map_get_space(umap
);
1721 isl_union_map_free(umap
);
1722 return isl_set_empty(space
);
1724 return isl_set_from_union_set(cond_un_op(umap
, ¶ms_entry
));
1726 isl_union_map_free(umap
);
1730 /* Compute the parameter domain of the given union set.
1732 __isl_give isl_set
*isl_union_set_params(__isl_take isl_union_set
*uset
)
1734 return isl_union_map_params(uset
);
1737 static int domain_entry(void **entry
, void *user
)
1739 isl_map
*map
= *entry
;
1740 isl_union_set
**res
= user
;
1742 *res
= isl_union_set_add_set(*res
, isl_map_domain(isl_map_copy(map
)));
1747 __isl_give isl_union_set
*isl_union_map_domain(__isl_take isl_union_map
*umap
)
1749 return cond_un_op(umap
, &domain_entry
);
1752 static int range_entry(void **entry
, void *user
)
1754 isl_map
*map
= *entry
;
1755 isl_union_set
**res
= user
;
1757 *res
= isl_union_set_add_set(*res
, isl_map_range(isl_map_copy(map
)));
1762 __isl_give isl_union_set
*isl_union_map_range(__isl_take isl_union_map
*umap
)
1764 return cond_un_op(umap
, &range_entry
);
1767 static int domain_map_entry(void **entry
, void *user
)
1769 isl_map
*map
= *entry
;
1770 isl_union_set
**res
= user
;
1772 *res
= isl_union_map_add_map(*res
,
1773 isl_map_domain_map(isl_map_copy(map
)));
1778 __isl_give isl_union_map
*isl_union_map_domain_map(
1779 __isl_take isl_union_map
*umap
)
1781 return cond_un_op(umap
, &domain_map_entry
);
1784 static int range_map_entry(void **entry
, void *user
)
1786 isl_map
*map
= *entry
;
1787 isl_union_set
**res
= user
;
1789 *res
= isl_union_map_add_map(*res
,
1790 isl_map_range_map(isl_map_copy(map
)));
1795 __isl_give isl_union_map
*isl_union_map_range_map(
1796 __isl_take isl_union_map
*umap
)
1798 return cond_un_op(umap
, &range_map_entry
);
1801 static int deltas_entry(void **entry
, void *user
)
1803 isl_map
*map
= *entry
;
1804 isl_union_set
**res
= user
;
1806 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1809 *res
= isl_union_set_add_set(*res
, isl_map_deltas(isl_map_copy(map
)));
1814 __isl_give isl_union_set
*isl_union_map_deltas(__isl_take isl_union_map
*umap
)
1816 return cond_un_op(umap
, &deltas_entry
);
1819 static int deltas_map_entry(void **entry
, void *user
)
1821 isl_map
*map
= *entry
;
1822 isl_union_map
**res
= user
;
1824 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
1827 *res
= isl_union_map_add_map(*res
,
1828 isl_map_deltas_map(isl_map_copy(map
)));
1833 __isl_give isl_union_map
*isl_union_map_deltas_map(
1834 __isl_take isl_union_map
*umap
)
1836 return cond_un_op(umap
, &deltas_map_entry
);
1839 static int identity_entry(void **entry
, void *user
)
1841 isl_set
*set
= *entry
;
1842 isl_union_map
**res
= user
;
1844 *res
= isl_union_map_add_map(*res
, isl_set_identity(isl_set_copy(set
)));
1849 __isl_give isl_union_map
*isl_union_set_identity(__isl_take isl_union_set
*uset
)
1851 return cond_un_op(uset
, &identity_entry
);
1854 static int unwrap_entry(void **entry
, void *user
)
1856 isl_set
*set
= *entry
;
1857 isl_union_set
**res
= user
;
1859 if (!isl_set_is_wrapping(set
))
1862 *res
= isl_union_map_add_map(*res
, isl_set_unwrap(isl_set_copy(set
)));
1867 __isl_give isl_union_map
*isl_union_set_unwrap(__isl_take isl_union_set
*uset
)
1869 return cond_un_op(uset
, &unwrap_entry
);
1872 static int wrap_entry(void **entry
, void *user
)
1874 isl_map
*map
= *entry
;
1875 isl_union_set
**res
= user
;
1877 *res
= isl_union_set_add_set(*res
, isl_map_wrap(isl_map_copy(map
)));
1882 __isl_give isl_union_set
*isl_union_map_wrap(__isl_take isl_union_map
*umap
)
1884 return cond_un_op(umap
, &wrap_entry
);
1887 struct isl_union_map_is_subset_data
{
1888 isl_union_map
*umap2
;
1892 static int is_subset_entry(void **entry
, void *user
)
1894 struct isl_union_map_is_subset_data
*data
= user
;
1896 struct isl_hash_table_entry
*entry2
;
1897 isl_map
*map
= *entry
;
1899 hash
= isl_space_get_hash(map
->dim
);
1900 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1901 hash
, &has_dim
, map
->dim
, 0);
1903 int empty
= isl_map_is_empty(map
);
1908 data
->is_subset
= 0;
1912 data
->is_subset
= isl_map_is_subset(map
, entry2
->data
);
1913 if (data
->is_subset
< 0 || !data
->is_subset
)
1919 int isl_union_map_is_subset(__isl_keep isl_union_map
*umap1
,
1920 __isl_keep isl_union_map
*umap2
)
1922 struct isl_union_map_is_subset_data data
= { NULL
, 1 };
1924 umap1
= isl_union_map_copy(umap1
);
1925 umap2
= isl_union_map_copy(umap2
);
1926 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
1927 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1929 if (!umap1
|| !umap2
)
1933 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1934 &is_subset_entry
, &data
) < 0 &&
1938 isl_union_map_free(umap1
);
1939 isl_union_map_free(umap2
);
1941 return data
.is_subset
;
1943 isl_union_map_free(umap1
);
1944 isl_union_map_free(umap2
);
1948 int isl_union_set_is_subset(__isl_keep isl_union_set
*uset1
,
1949 __isl_keep isl_union_set
*uset2
)
1951 return isl_union_map_is_subset(uset1
, uset2
);
1954 int isl_union_map_is_equal(__isl_keep isl_union_map
*umap1
,
1955 __isl_keep isl_union_map
*umap2
)
1959 if (!umap1
|| !umap2
)
1961 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
1964 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
1968 int isl_union_set_is_equal(__isl_keep isl_union_set
*uset1
,
1969 __isl_keep isl_union_set
*uset2
)
1971 return isl_union_map_is_equal(uset1
, uset2
);
1974 int isl_union_map_is_strict_subset(__isl_keep isl_union_map
*umap1
,
1975 __isl_keep isl_union_map
*umap2
)
1979 if (!umap1
|| !umap2
)
1981 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
1984 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
1985 if (is_subset
== -1)
1990 int isl_union_set_is_strict_subset(__isl_keep isl_union_set
*uset1
,
1991 __isl_keep isl_union_set
*uset2
)
1993 return isl_union_map_is_strict_subset(uset1
, uset2
);
1996 static int sample_entry(void **entry
, void *user
)
1998 isl_basic_map
**sample
= (isl_basic_map
**)user
;
1999 isl_map
*map
= *entry
;
2001 *sample
= isl_map_sample(isl_map_copy(map
));
2004 if (!isl_basic_map_plain_is_empty(*sample
))
2009 __isl_give isl_basic_map
*isl_union_map_sample(__isl_take isl_union_map
*umap
)
2011 isl_basic_map
*sample
= NULL
;
2016 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2017 &sample_entry
, &sample
) < 0 &&
2022 sample
= isl_basic_map_empty(isl_union_map_get_space(umap
));
2024 isl_union_map_free(umap
);
2028 isl_union_map_free(umap
);
2032 __isl_give isl_basic_set
*isl_union_set_sample(__isl_take isl_union_set
*uset
)
2034 return (isl_basic_set
*)isl_union_map_sample(uset
);
2037 struct isl_forall_data
{
2039 int (*fn
)(__isl_keep isl_map
*map
);
2042 static int forall_entry(void **entry
, void *user
)
2044 struct isl_forall_data
*data
= user
;
2045 isl_map
*map
= *entry
;
2047 data
->res
= data
->fn(map
);
2057 static int union_map_forall(__isl_keep isl_union_map
*umap
,
2058 int (*fn
)(__isl_keep isl_map
*map
))
2060 struct isl_forall_data data
= { 1, fn
};
2065 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2066 &forall_entry
, &data
) < 0 && data
.res
)
2072 struct isl_forall_user_data
{
2074 int (*fn
)(__isl_keep isl_map
*map
, void *user
);
2078 static int forall_user_entry(void **entry
, void *user
)
2080 struct isl_forall_user_data
*data
= user
;
2081 isl_map
*map
= *entry
;
2083 data
->res
= data
->fn(map
, data
->user
);
2093 /* Check if fn(map, user) returns true for all maps "map" in umap.
2095 static int union_map_forall_user(__isl_keep isl_union_map
*umap
,
2096 int (*fn
)(__isl_keep isl_map
*map
, void *user
), void *user
)
2098 struct isl_forall_user_data data
= { 1, fn
, user
};
2103 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2104 &forall_user_entry
, &data
) < 0 && data
.res
)
2110 int isl_union_map_is_empty(__isl_keep isl_union_map
*umap
)
2112 return union_map_forall(umap
, &isl_map_is_empty
);
2115 int isl_union_set_is_empty(__isl_keep isl_union_set
*uset
)
2117 return isl_union_map_is_empty(uset
);
2120 static int is_subset_of_identity(__isl_keep isl_map
*map
)
2129 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
2132 dim
= isl_map_get_space(map
);
2133 id
= isl_map_identity(dim
);
2135 is_subset
= isl_map_is_subset(map
, id
);
2142 /* Given an isl_union_map that consists of a single map, check
2143 * if it is single-valued.
2145 static int single_map_is_single_valued(__isl_keep isl_union_map
*umap
)
2150 umap
= isl_union_map_copy(umap
);
2151 map
= isl_map_from_union_map(umap
);
2152 sv
= isl_map_is_single_valued(map
);
2158 /* Check if the given map is single-valued.
2163 * and check if the result is a subset of the identity mapping.
2165 int isl_union_map_is_single_valued(__isl_keep isl_union_map
*umap
)
2167 isl_union_map
*test
;
2170 if (isl_union_map_n_map(umap
) == 1)
2171 return single_map_is_single_valued(umap
);
2173 test
= isl_union_map_reverse(isl_union_map_copy(umap
));
2174 test
= isl_union_map_apply_range(test
, isl_union_map_copy(umap
));
2176 sv
= union_map_forall(test
, &is_subset_of_identity
);
2178 isl_union_map_free(test
);
2183 int isl_union_map_is_injective(__isl_keep isl_union_map
*umap
)
2187 umap
= isl_union_map_copy(umap
);
2188 umap
= isl_union_map_reverse(umap
);
2189 in
= isl_union_map_is_single_valued(umap
);
2190 isl_union_map_free(umap
);
2195 /* Represents a map that has a fixed value (v) for one of its
2197 * The map in this structure is not reference counted, so it
2198 * is only valid while the isl_union_map from which it was
2199 * obtained is still alive.
2201 struct isl_fixed_map
{
2206 static struct isl_fixed_map
*alloc_isl_fixed_map_array(isl_ctx
*ctx
,
2210 struct isl_fixed_map
*v
;
2212 v
= isl_calloc_array(ctx
, struct isl_fixed_map
, n
);
2215 for (i
= 0; i
< n
; ++i
)
2216 isl_int_init(v
[i
].v
);
2220 static void free_isl_fixed_map_array(struct isl_fixed_map
*v
, int n
)
2226 for (i
= 0; i
< n
; ++i
)
2227 isl_int_clear(v
[i
].v
);
2231 /* Compare the "v" field of two isl_fixed_map structs.
2233 static int qsort_fixed_map_cmp(const void *p1
, const void *p2
)
2235 const struct isl_fixed_map
*e1
= (const struct isl_fixed_map
*) p1
;
2236 const struct isl_fixed_map
*e2
= (const struct isl_fixed_map
*) p2
;
2238 return isl_int_cmp(e1
->v
, e2
->v
);
2241 /* Internal data structure used while checking whether all maps
2242 * in a union_map have a fixed value for a given output dimension.
2243 * v is the list of maps, with the fixed value for the dimension
2244 * n is the number of maps considered so far
2245 * pos is the output dimension under investigation
2247 struct isl_fixed_dim_data
{
2248 struct isl_fixed_map
*v
;
2253 static int fixed_at_pos(__isl_keep isl_map
*map
, void *user
)
2255 struct isl_fixed_dim_data
*data
= user
;
2257 data
->v
[data
->n
].map
= map
;
2258 return isl_map_plain_is_fixed(map
, isl_dim_out
, data
->pos
,
2259 &data
->v
[data
->n
++].v
);
2262 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
2263 int first
, int n_range
);
2265 /* Given a list of the maps, with their fixed values at output dimension "pos",
2266 * check whether the ranges of the maps form an obvious partition.
2268 * We first sort the maps according to their fixed values.
2269 * If all maps have a different value, then we know the ranges form
2271 * Otherwise, we collect the maps with the same fixed value and
2272 * check whether each such collection is obviously injective
2273 * based on later dimensions.
2275 static int separates(struct isl_fixed_map
*v
, int n
,
2276 __isl_take isl_space
*dim
, int pos
, int n_range
)
2283 qsort(v
, n
, sizeof(*v
), &qsort_fixed_map_cmp
);
2285 for (i
= 0; i
+ 1 < n
; ++i
) {
2287 isl_union_map
*part
;
2290 for (j
= i
+ 1; j
< n
; ++j
)
2291 if (isl_int_ne(v
[i
].v
, v
[j
].v
))
2297 part
= isl_union_map_alloc(isl_space_copy(dim
), j
- i
);
2298 for (k
= i
; k
< j
; ++k
)
2299 part
= isl_union_map_add_map(part
,
2300 isl_map_copy(v
[k
].map
));
2302 injective
= plain_injective_on_range(part
, pos
+ 1, n_range
);
2311 isl_space_free(dim
);
2312 free_isl_fixed_map_array(v
, n
);
2315 isl_space_free(dim
);
2316 free_isl_fixed_map_array(v
, n
);
2320 /* Check whether the maps in umap have obviously distinct ranges.
2321 * In particular, check for an output dimension in the range
2322 * [first,n_range) for which all maps have a fixed value
2323 * and then check if these values, possibly along with fixed values
2324 * at later dimensions, entail distinct ranges.
2326 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
2327 int first
, int n_range
)
2331 struct isl_fixed_dim_data data
= { NULL
};
2333 ctx
= isl_union_map_get_ctx(umap
);
2335 n
= isl_union_map_n_map(umap
);
2340 isl_union_map_free(umap
);
2344 if (first
>= n_range
) {
2345 isl_union_map_free(umap
);
2349 data
.v
= alloc_isl_fixed_map_array(ctx
, n
);
2353 for (data
.pos
= first
; data
.pos
< n_range
; ++data
.pos
) {
2359 fixed
= union_map_forall_user(umap
, &fixed_at_pos
, &data
);
2364 dim
= isl_union_map_get_space(umap
);
2365 injective
= separates(data
.v
, n
, dim
, data
.pos
, n_range
);
2366 isl_union_map_free(umap
);
2370 free_isl_fixed_map_array(data
.v
, n
);
2371 isl_union_map_free(umap
);
2375 free_isl_fixed_map_array(data
.v
, n
);
2376 isl_union_map_free(umap
);
2380 /* Check whether the maps in umap that map to subsets of "ran"
2381 * have obviously distinct ranges.
2383 static int plain_injective_on_range_wrap(__isl_keep isl_set
*ran
, void *user
)
2385 isl_union_map
*umap
= user
;
2387 umap
= isl_union_map_copy(umap
);
2388 umap
= isl_union_map_intersect_range(umap
,
2389 isl_union_set_from_set(isl_set_copy(ran
)));
2390 return plain_injective_on_range(umap
, 0, isl_set_dim(ran
, isl_dim_set
));
2393 /* Check if the given union_map is obviously injective.
2395 * In particular, we first check if all individual maps are obviously
2396 * injective and then check if all the ranges of these maps are
2397 * obviously disjoint.
2399 int isl_union_map_plain_is_injective(__isl_keep isl_union_map
*umap
)
2402 isl_union_map
*univ
;
2405 in
= union_map_forall(umap
, &isl_map_plain_is_injective
);
2411 univ
= isl_union_map_universe(isl_union_map_copy(umap
));
2412 ran
= isl_union_map_range(univ
);
2414 in
= union_map_forall_user(ran
, &plain_injective_on_range_wrap
, umap
);
2416 isl_union_set_free(ran
);
2421 int isl_union_map_is_bijective(__isl_keep isl_union_map
*umap
)
2425 sv
= isl_union_map_is_single_valued(umap
);
2429 return isl_union_map_is_injective(umap
);
2432 static int zip_entry(void **entry
, void *user
)
2434 isl_map
*map
= *entry
;
2435 isl_union_map
**res
= user
;
2437 if (!isl_map_can_zip(map
))
2440 *res
= isl_union_map_add_map(*res
, isl_map_zip(isl_map_copy(map
)));
2445 __isl_give isl_union_map
*isl_union_map_zip(__isl_take isl_union_map
*umap
)
2447 return cond_un_op(umap
, &zip_entry
);
2450 static int uncurry_entry(void **entry
, void *user
)
2452 isl_map
*map
= *entry
;
2453 isl_union_map
**res
= user
;
2455 if (!isl_map_can_uncurry(map
))
2458 *res
= isl_union_map_add_map(*res
, isl_map_uncurry(isl_map_copy(map
)));
2463 /* Given a union map, take the maps of the form A -> (B -> C) and
2464 * return the union of the corresponding maps (A -> B) -> C.
2466 __isl_give isl_union_map
*isl_union_map_uncurry(__isl_take isl_union_map
*umap
)
2468 return cond_un_op(umap
, &uncurry_entry
);
2471 static int curry_entry(void **entry
, void *user
)
2473 isl_map
*map
= *entry
;
2474 isl_union_map
**res
= user
;
2476 if (!isl_map_can_curry(map
))
2479 *res
= isl_union_map_add_map(*res
, isl_map_curry(isl_map_copy(map
)));
2484 /* Given a union map, take the maps of the form (A -> B) -> C and
2485 * return the union of the corresponding maps A -> (B -> C).
2487 __isl_give isl_union_map
*isl_union_map_curry(__isl_take isl_union_map
*umap
)
2489 return cond_un_op(umap
, &curry_entry
);
2492 static int lift_entry(void **entry
, void *user
)
2494 isl_set
*set
= *entry
;
2495 isl_union_set
**res
= user
;
2497 *res
= isl_union_set_add_set(*res
, isl_set_lift(isl_set_copy(set
)));
2502 __isl_give isl_union_set
*isl_union_set_lift(__isl_take isl_union_set
*uset
)
2504 return cond_un_op(uset
, &lift_entry
);
2507 static int coefficients_entry(void **entry
, void *user
)
2509 isl_set
*set
= *entry
;
2510 isl_union_set
**res
= user
;
2512 set
= isl_set_copy(set
);
2513 set
= isl_set_from_basic_set(isl_set_coefficients(set
));
2514 *res
= isl_union_set_add_set(*res
, set
);
2519 __isl_give isl_union_set
*isl_union_set_coefficients(
2520 __isl_take isl_union_set
*uset
)
2529 ctx
= isl_union_set_get_ctx(uset
);
2530 dim
= isl_space_set_alloc(ctx
, 0, 0);
2531 res
= isl_union_map_alloc(dim
, uset
->table
.n
);
2532 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
2533 &coefficients_entry
, &res
) < 0)
2536 isl_union_set_free(uset
);
2539 isl_union_set_free(uset
);
2540 isl_union_set_free(res
);
2544 static int solutions_entry(void **entry
, void *user
)
2546 isl_set
*set
= *entry
;
2547 isl_union_set
**res
= user
;
2549 set
= isl_set_copy(set
);
2550 set
= isl_set_from_basic_set(isl_set_solutions(set
));
2552 *res
= isl_union_set_from_set(set
);
2554 *res
= isl_union_set_add_set(*res
, set
);
2562 __isl_give isl_union_set
*isl_union_set_solutions(
2563 __isl_take isl_union_set
*uset
)
2565 isl_union_set
*res
= NULL
;
2570 if (uset
->table
.n
== 0) {
2571 res
= isl_union_set_empty(isl_union_set_get_space(uset
));
2572 isl_union_set_free(uset
);
2576 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
2577 &solutions_entry
, &res
) < 0)
2580 isl_union_set_free(uset
);
2583 isl_union_set_free(uset
);
2584 isl_union_set_free(res
);
2588 /* Is the domain space of "map" equal to "space"?
2590 static int domain_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
2592 return isl_space_tuple_match(map
->dim
, isl_dim_in
, space
, isl_dim_out
);
2595 /* Is the range space of "map" equal to "space"?
2597 static int range_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
2599 return isl_space_tuple_match(map
->dim
, isl_dim_out
, space
, isl_dim_out
);
2602 /* Is the set space of "map" equal to "space"?
2604 static int set_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
2606 return isl_space_tuple_match(map
->dim
, isl_dim_set
, space
, isl_dim_out
);
2609 /* Internal data structure for preimage_pw_multi_aff.
2611 * "pma" is the function under which the preimage should be taken.
2612 * "space" is the space of "pma".
2613 * "res" collects the results.
2614 * "fn" computes the preimage for a given map.
2615 * "match" returns true if "fn" can be called.
2617 struct isl_union_map_preimage_data
{
2619 isl_pw_multi_aff
*pma
;
2621 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
);
2622 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
2623 __isl_take isl_pw_multi_aff
*pma
);
2626 /* Call data->fn to compute the preimage of the domain or range of *entry
2627 * under the function represented by data->pma, provided the domain/range
2628 * space of *entry matches the target space of data->pma
2629 * (as given by data->match), and add the result to data->res.
2631 static int preimage_entry(void **entry
, void *user
)
2634 isl_map
*map
= *entry
;
2635 struct isl_union_map_preimage_data
*data
= user
;
2638 m
= data
->match(map
, data
->space
);
2644 map
= isl_map_copy(map
);
2645 map
= data
->fn(map
, isl_pw_multi_aff_copy(data
->pma
));
2647 empty
= isl_map_is_empty(map
);
2648 if (empty
< 0 || empty
) {
2650 return empty
< 0 ? -1 : 0;
2653 data
->res
= isl_union_map_add_map(data
->res
, map
);
2658 /* Compute the preimage of the domain or range of "umap" under the function
2659 * represented by "pma".
2660 * In other words, plug in "pma" in the domain or range of "umap".
2661 * The function "fn" performs the actual preimage computation on a map,
2662 * while "match" determines to which maps the function should be applied.
2664 static __isl_give isl_union_map
*preimage_pw_multi_aff(
2665 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
,
2666 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
),
2667 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
2668 __isl_take isl_pw_multi_aff
*pma
))
2672 struct isl_union_map_preimage_data data
;
2674 umap
= isl_union_map_align_params(umap
,
2675 isl_pw_multi_aff_get_space(pma
));
2676 pma
= isl_pw_multi_aff_align_params(pma
, isl_union_map_get_space(umap
));
2681 ctx
= isl_union_map_get_ctx(umap
);
2682 space
= isl_union_map_get_space(umap
);
2683 data
.space
= isl_pw_multi_aff_get_space(pma
);
2685 data
.res
= isl_union_map_alloc(space
, umap
->table
.n
);
2688 if (isl_hash_table_foreach(ctx
, &umap
->table
, &preimage_entry
,
2690 data
.res
= isl_union_map_free(data
.res
);
2692 isl_space_free(data
.space
);
2693 isl_union_map_free(umap
);
2694 isl_pw_multi_aff_free(pma
);
2697 isl_union_map_free(umap
);
2698 isl_pw_multi_aff_free(pma
);
2702 /* Compute the preimage of the domain of "umap" under the function
2703 * represented by "pma".
2704 * In other words, plug in "pma" in the domain of "umap".
2705 * The result contains maps that live in the same spaces as the maps of "umap"
2706 * with domain space equal to the target space of "pma",
2707 * except that the domain has been replaced by the domain space of "pma".
2709 __isl_give isl_union_map
*isl_union_map_preimage_domain_pw_multi_aff(
2710 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
)
2712 return preimage_pw_multi_aff(umap
, pma
, &domain_match
,
2713 &isl_map_preimage_domain_pw_multi_aff
);
2716 /* Compute the preimage of the range of "umap" under the function
2717 * represented by "pma".
2718 * In other words, plug in "pma" in the range of "umap".
2719 * The result contains maps that live in the same spaces as the maps of "umap"
2720 * with range space equal to the target space of "pma",
2721 * except that the range has been replaced by the domain space of "pma".
2723 __isl_give isl_union_map
*isl_union_map_preimage_range_pw_multi_aff(
2724 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
)
2726 return preimage_pw_multi_aff(umap
, pma
, &range_match
,
2727 &isl_map_preimage_range_pw_multi_aff
);
2730 /* Compute the preimage of "uset" under the function represented by "pma".
2731 * In other words, plug in "pma" in "uset".
2732 * The result contains sets that live in the same spaces as the sets of "uset"
2733 * with space equal to the target space of "pma",
2734 * except that the space has been replaced by the domain space of "pma".
2736 __isl_give isl_union_set
*isl_union_set_preimage_pw_multi_aff(
2737 __isl_take isl_union_set
*uset
, __isl_take isl_pw_multi_aff
*pma
)
2739 return preimage_pw_multi_aff(uset
, pma
, &set_match
,
2740 &isl_set_preimage_pw_multi_aff
);
2743 /* Compute the preimage of the domain of "umap" under the function
2744 * represented by "ma".
2745 * In other words, plug in "ma" in the domain of "umap".
2746 * The result contains maps that live in the same spaces as the maps of "umap"
2747 * with domain space equal to the target space of "ma",
2748 * except that the domain has been replaced by the domain space of "ma".
2750 __isl_give isl_union_map
*isl_union_map_preimage_domain_multi_aff(
2751 __isl_take isl_union_map
*umap
, __isl_take isl_multi_aff
*ma
)
2753 return isl_union_map_preimage_domain_pw_multi_aff(umap
,
2754 isl_pw_multi_aff_from_multi_aff(ma
));
2757 /* Compute the preimage of the range of "umap" under the function
2758 * represented by "ma".
2759 * In other words, plug in "ma" in the range of "umap".
2760 * The result contains maps that live in the same spaces as the maps of "umap"
2761 * with range space equal to the target space of "ma",
2762 * except that the range has been replaced by the domain space of "ma".
2764 __isl_give isl_union_map
*isl_union_map_preimage_range_multi_aff(
2765 __isl_take isl_union_map
*umap
, __isl_take isl_multi_aff
*ma
)
2767 return isl_union_map_preimage_range_pw_multi_aff(umap
,
2768 isl_pw_multi_aff_from_multi_aff(ma
));
2771 /* Compute the preimage of "uset" under the function represented by "ma".
2772 * In other words, plug in "ma" in "uset".
2773 * The result contains sets that live in the same spaces as the sets of "uset"
2774 * with space equal to the target space of "ma",
2775 * except that the space has been replaced by the domain space of "ma".
2777 __isl_give isl_union_map
*isl_union_set_preimage_multi_aff(
2778 __isl_take isl_union_set
*uset
, __isl_take isl_multi_aff
*ma
)
2780 return isl_union_set_preimage_pw_multi_aff(uset
,
2781 isl_pw_multi_aff_from_multi_aff(ma
));
2784 /* Internal data structure for preimage_multi_pw_aff.
2786 * "mpa" is the function under which the preimage should be taken.
2787 * "space" is the space of "mpa".
2788 * "res" collects the results.
2789 * "fn" computes the preimage for a given map.
2790 * "match" returns true if "fn" can be called.
2792 struct isl_union_map_preimage_mpa_data
{
2794 isl_multi_pw_aff
*mpa
;
2796 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
);
2797 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
2798 __isl_take isl_multi_pw_aff
*mpa
);
2801 /* Call data->fn to compute the preimage of the domain or range of *entry
2802 * under the function represented by data->mpa, provided the domain/range
2803 * space of *entry matches the target space of data->mpa
2804 * (as given by data->match), and add the result to data->res.
2806 static int preimage_mpa_entry(void **entry
, void *user
)
2809 isl_map
*map
= *entry
;
2810 struct isl_union_map_preimage_mpa_data
*data
= user
;
2813 m
= data
->match(map
, data
->space
);
2819 map
= isl_map_copy(map
);
2820 map
= data
->fn(map
, isl_multi_pw_aff_copy(data
->mpa
));
2822 empty
= isl_map_is_empty(map
);
2823 if (empty
< 0 || empty
) {
2825 return empty
< 0 ? -1 : 0;
2828 data
->res
= isl_union_map_add_map(data
->res
, map
);
2833 /* Compute the preimage of the domain or range of "umap" under the function
2834 * represented by "mpa".
2835 * In other words, plug in "mpa" in the domain or range of "umap".
2836 * The function "fn" performs the actual preimage computation on a map,
2837 * while "match" determines to which maps the function should be applied.
2839 static __isl_give isl_union_map
*preimage_multi_pw_aff(
2840 __isl_take isl_union_map
*umap
, __isl_take isl_multi_pw_aff
*mpa
,
2841 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
),
2842 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
2843 __isl_take isl_multi_pw_aff
*mpa
))
2847 struct isl_union_map_preimage_mpa_data data
;
2849 umap
= isl_union_map_align_params(umap
,
2850 isl_multi_pw_aff_get_space(mpa
));
2851 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_union_map_get_space(umap
));
2856 ctx
= isl_union_map_get_ctx(umap
);
2857 space
= isl_union_map_get_space(umap
);
2858 data
.space
= isl_multi_pw_aff_get_space(mpa
);
2860 data
.res
= isl_union_map_alloc(space
, umap
->table
.n
);
2863 if (isl_hash_table_foreach(ctx
, &umap
->table
, &preimage_mpa_entry
,
2865 data
.res
= isl_union_map_free(data
.res
);
2867 isl_space_free(data
.space
);
2868 isl_union_map_free(umap
);
2869 isl_multi_pw_aff_free(mpa
);
2872 isl_union_map_free(umap
);
2873 isl_multi_pw_aff_free(mpa
);
2877 /* Compute the preimage of the domain of "umap" under the function
2878 * represented by "mpa".
2879 * In other words, plug in "mpa" in the domain of "umap".
2880 * The result contains maps that live in the same spaces as the maps of "umap"
2881 * with domain space equal to the target space of "mpa",
2882 * except that the domain has been replaced by the domain space of "mpa".
2884 __isl_give isl_union_map
*isl_union_map_preimage_domain_multi_pw_aff(
2885 __isl_take isl_union_map
*umap
, __isl_take isl_multi_pw_aff
*mpa
)
2887 return preimage_multi_pw_aff(umap
, mpa
, &domain_match
,
2888 &isl_map_preimage_domain_multi_pw_aff
);
2891 /* Internal data structure for preimage_upma.
2893 * "umap" is the map of which the preimage should be computed.
2894 * "res" collects the results.
2895 * "fn" computes the preimage for a given piecewise multi-affine function.
2897 struct isl_union_map_preimage_upma_data
{
2898 isl_union_map
*umap
;
2900 __isl_give isl_union_map
*(*fn
)(__isl_take isl_union_map
*umap
,
2901 __isl_take isl_pw_multi_aff
*pma
);
2904 /* Call data->fn to compute the preimage of the domain or range of data->umap
2905 * under the function represented by pma and add the result to data->res.
2907 static int preimage_upma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
2909 struct isl_union_map_preimage_upma_data
*data
= user
;
2910 isl_union_map
*umap
;
2912 umap
= isl_union_map_copy(data
->umap
);
2913 umap
= data
->fn(umap
, pma
);
2914 data
->res
= isl_union_map_union(data
->res
, umap
);
2916 return data
->res
? 0 : -1;
2919 /* Compute the preimage of the domain or range of "umap" under the function
2920 * represented by "upma".
2921 * In other words, plug in "upma" in the domain or range of "umap".
2922 * The function "fn" performs the actual preimage computation
2923 * on a piecewise multi-affine function.
2925 static __isl_give isl_union_map
*preimage_union_pw_multi_aff(
2926 __isl_take isl_union_map
*umap
,
2927 __isl_take isl_union_pw_multi_aff
*upma
,
2928 __isl_give isl_union_map
*(*fn
)(__isl_take isl_union_map
*umap
,
2929 __isl_take isl_pw_multi_aff
*pma
))
2931 struct isl_union_map_preimage_upma_data data
;
2934 data
.res
= isl_union_map_empty(isl_union_map_get_space(umap
));
2936 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
2937 &preimage_upma
, &data
) < 0)
2938 data
.res
= isl_union_map_free(data
.res
);
2940 isl_union_map_free(umap
);
2941 isl_union_pw_multi_aff_free(upma
);
2946 /* Compute the preimage of the domain of "umap" under the function
2947 * represented by "upma".
2948 * In other words, plug in "upma" in the domain of "umap".
2949 * The result contains maps that live in the same spaces as the maps of "umap"
2950 * with domain space equal to one of the target spaces of "upma",
2951 * except that the domain has been replaced by one of the the domain spaces that
2952 * corresponds to that target space of "upma".
2954 __isl_give isl_union_map
*isl_union_map_preimage_domain_union_pw_multi_aff(
2955 __isl_take isl_union_map
*umap
,
2956 __isl_take isl_union_pw_multi_aff
*upma
)
2958 return preimage_union_pw_multi_aff(umap
, upma
,
2959 &isl_union_map_preimage_domain_pw_multi_aff
);
2962 /* Compute the preimage of the range of "umap" under the function
2963 * represented by "upma".
2964 * In other words, plug in "upma" in the range of "umap".
2965 * The result contains maps that live in the same spaces as the maps of "umap"
2966 * with range space equal to one of the target spaces of "upma",
2967 * except that the range has been replaced by one of the the domain spaces that
2968 * corresponds to that target space of "upma".
2970 __isl_give isl_union_map
*isl_union_map_preimage_range_union_pw_multi_aff(
2971 __isl_take isl_union_map
*umap
,
2972 __isl_take isl_union_pw_multi_aff
*upma
)
2974 return preimage_union_pw_multi_aff(umap
, upma
,
2975 &isl_union_map_preimage_range_pw_multi_aff
);
2978 /* Compute the preimage of "uset" under the function represented by "upma".
2979 * In other words, plug in "upma" in the range of "uset".
2980 * The result contains sets that live in the same spaces as the sets of "uset"
2981 * with space equal to one of the target spaces of "upma",
2982 * except that the space has been replaced by one of the the domain spaces that
2983 * corresponds to that target space of "upma".
2985 __isl_give isl_union_set
*isl_union_set_preimage_union_pw_multi_aff(
2986 __isl_take isl_union_set
*uset
,
2987 __isl_take isl_union_pw_multi_aff
*upma
)
2989 return preimage_union_pw_multi_aff(uset
, upma
,
2990 &isl_union_set_preimage_pw_multi_aff
);
2993 /* Reset the user pointer on all identifiers of parameters and tuples
2994 * of the space of *entry.
2996 static int reset_user(void **entry
, void *user
)
2998 isl_map
**map
= (isl_map
**)entry
;
3000 *map
= isl_map_reset_user(*map
);
3002 return *map
? 0 : -1;
3005 /* Reset the user pointer on all identifiers of parameters and tuples
3006 * of the spaces of "umap".
3008 __isl_give isl_union_map
*isl_union_map_reset_user(
3009 __isl_take isl_union_map
*umap
)
3011 umap
= isl_union_map_cow(umap
);
3014 umap
->dim
= isl_space_reset_user(umap
->dim
);
3016 return isl_union_map_free(umap
);
3017 umap
= un_op(umap
, &reset_user
);
3022 /* Reset the user pointer on all identifiers of parameters and tuples
3023 * of the spaces of "uset".
3025 __isl_give isl_union_set
*isl_union_set_reset_user(
3026 __isl_take isl_union_set
*uset
)
3028 return isl_union_map_reset_user(uset
);
3031 /* Internal data structure for isl_union_map_project_out.
3032 * "type", "first" and "n" are the arguments for the isl_map_project_out
3034 * "res" collects the results.
3036 struct isl_union_map_project_out_data
{
3037 enum isl_dim_type type
;
3044 /* Turn the data->n dimensions of type data->type, starting at data->first
3045 * into existentially quantified variables and add the result to data->res.
3047 static int project_out(__isl_take isl_map
*map
, void *user
)
3049 struct isl_union_map_project_out_data
*data
= user
;
3051 map
= isl_map_project_out(map
, data
->type
, data
->first
, data
->n
);
3052 data
->res
= isl_union_map_add_map(data
->res
, map
);
3057 /* Turn the "n" dimensions of type "type", starting at "first"
3058 * into existentially quantified variables.
3059 * Since the space of an isl_union_map only contains parameters,
3060 * type is required to be equal to isl_dim_param.
3062 __isl_give isl_union_map
*isl_union_map_project_out(
3063 __isl_take isl_union_map
*umap
,
3064 enum isl_dim_type type
, unsigned first
, unsigned n
)
3067 struct isl_union_map_project_out_data data
= { type
, first
, n
};
3072 if (type
!= isl_dim_param
)
3073 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
3074 "can only project out parameters",
3075 return isl_union_map_free(umap
));
3077 space
= isl_union_map_get_space(umap
);
3078 space
= isl_space_drop_dims(space
, type
, first
, n
);
3079 data
.res
= isl_union_map_empty(space
);
3080 if (isl_union_map_foreach_map(umap
, &project_out
, &data
) < 0)
3081 data
.res
= isl_union_map_free(data
.res
);
3083 isl_union_map_free(umap
);