2 * Copyright 2010-2011 INRIA Saclay
3 * Copyright 2013-2014 Ecole Normale Superieure
4 * Copyright 2014 INRIA Rocquencourt
5 * Copyright 2016 Sven Verdoolaege
7 * Use of this software is governed by the MIT license
9 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
10 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
12 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
13 * B.P. 105 - 78153 Le Chesnay, France
17 #include <isl_map_private.h>
18 #include <isl_union_map_private.h>
24 #include <isl_space_private.h>
25 #include <isl/union_set.h>
26 #include <isl/deprecated/union_map_int.h>
28 #include <bset_from_bmap.c>
29 #include <set_to_map.c>
30 #include <set_from_map.c>
32 /* Return the number of parameters of "umap", where "type"
33 * is required to be set to isl_dim_param.
35 unsigned isl_union_map_dim(__isl_keep isl_union_map
*umap
,
36 enum isl_dim_type type
)
41 if (type
!= isl_dim_param
)
42 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
43 "can only reference parameters", return 0);
45 return isl_space_dim(umap
->dim
, type
);
48 /* Return the number of parameters of "uset", where "type"
49 * is required to be set to isl_dim_param.
51 unsigned isl_union_set_dim(__isl_keep isl_union_set
*uset
,
52 enum isl_dim_type type
)
54 return isl_union_map_dim(uset
, type
);
57 /* Return the id of the specified dimension.
59 __isl_give isl_id
*isl_union_map_get_dim_id(__isl_keep isl_union_map
*umap
,
60 enum isl_dim_type type
, unsigned pos
)
65 if (type
!= isl_dim_param
)
66 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
67 "can only reference parameters", return NULL
);
69 return isl_space_get_dim_id(umap
->dim
, type
, pos
);
72 /* Is this union set a parameter domain?
74 isl_bool
isl_union_set_is_params(__isl_keep isl_union_set
*uset
)
80 return isl_bool_error
;
81 if (uset
->table
.n
!= 1)
82 return isl_bool_false
;
84 set
= isl_set_from_union_set(isl_union_set_copy(uset
));
85 params
= isl_set_is_params(set
);
90 static __isl_give isl_union_map
*isl_union_map_alloc(
91 __isl_take isl_space
*space
, int size
)
95 space
= isl_space_params(space
);
99 umap
= isl_calloc_type(space
->ctx
, isl_union_map
);
101 isl_space_free(space
);
107 if (isl_hash_table_init(space
->ctx
, &umap
->table
, size
) < 0)
108 return isl_union_map_free(umap
);
113 __isl_give isl_union_map
*isl_union_map_empty(__isl_take isl_space
*dim
)
115 return isl_union_map_alloc(dim
, 16);
118 __isl_give isl_union_set
*isl_union_set_empty(__isl_take isl_space
*dim
)
120 return isl_union_map_empty(dim
);
123 isl_ctx
*isl_union_map_get_ctx(__isl_keep isl_union_map
*umap
)
125 return umap
? umap
->dim
->ctx
: NULL
;
128 isl_ctx
*isl_union_set_get_ctx(__isl_keep isl_union_set
*uset
)
130 return uset
? uset
->dim
->ctx
: NULL
;
133 /* Return the space of "umap".
135 __isl_keep isl_space
*isl_union_map_peek_space(__isl_keep isl_union_map
*umap
)
137 return umap
? umap
->dim
: NULL
;
140 __isl_give isl_space
*isl_union_map_get_space(__isl_keep isl_union_map
*umap
)
142 return isl_space_copy(isl_union_map_peek_space(umap
));
145 /* Return the position of the parameter with the given name
147 * Return -1 if no such dimension can be found.
149 int isl_union_map_find_dim_by_name(__isl_keep isl_union_map
*umap
,
150 enum isl_dim_type type
, const char *name
)
154 return isl_space_find_dim_by_name(umap
->dim
, type
, name
);
157 __isl_give isl_space
*isl_union_set_get_space(__isl_keep isl_union_set
*uset
)
159 return isl_union_map_get_space(uset
);
162 static isl_stat
free_umap_entry(void **entry
, void *user
)
164 isl_map
*map
= *entry
;
169 static isl_stat
add_map(__isl_take isl_map
*map
, void *user
)
171 isl_union_map
**umap
= (isl_union_map
**)user
;
173 *umap
= isl_union_map_add_map(*umap
, map
);
178 __isl_give isl_union_map
*isl_union_map_dup(__isl_keep isl_union_map
*umap
)
185 dup
= isl_union_map_empty(isl_space_copy(umap
->dim
));
186 if (isl_union_map_foreach_map(umap
, &add_map
, &dup
) < 0)
190 isl_union_map_free(dup
);
194 __isl_give isl_union_map
*isl_union_map_cow(__isl_take isl_union_map
*umap
)
202 return isl_union_map_dup(umap
);
205 struct isl_union_align
{
210 static isl_stat
align_entry(void **entry
, void *user
)
212 isl_map
*map
= *entry
;
214 struct isl_union_align
*data
= user
;
216 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
217 isl_map_get_space(map
));
219 data
->res
= isl_union_map_add_map(data
->res
,
220 isl_map_realign(isl_map_copy(map
), exp
));
225 /* Align the parameters of umap along those of model.
226 * The result has the parameters of model first, in the same order
227 * as they appear in model, followed by any remaining parameters of
228 * umap that do not appear in model.
230 __isl_give isl_union_map
*isl_union_map_align_params(
231 __isl_take isl_union_map
*umap
, __isl_take isl_space
*model
)
233 struct isl_union_align data
= { NULL
, NULL
};
234 isl_bool equal_params
;
239 equal_params
= isl_space_has_equal_params(umap
->dim
, model
);
240 if (equal_params
< 0)
243 isl_space_free(model
);
247 model
= isl_space_params(model
);
248 data
.exp
= isl_parameter_alignment_reordering(umap
->dim
, model
);
252 data
.res
= isl_union_map_alloc(isl_space_copy(data
.exp
->dim
),
254 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
255 &align_entry
, &data
) < 0)
258 isl_reordering_free(data
.exp
);
259 isl_union_map_free(umap
);
260 isl_space_free(model
);
263 isl_reordering_free(data
.exp
);
264 isl_union_map_free(umap
);
265 isl_union_map_free(data
.res
);
266 isl_space_free(model
);
270 __isl_give isl_union_set
*isl_union_set_align_params(
271 __isl_take isl_union_set
*uset
, __isl_take isl_space
*model
)
273 return isl_union_map_align_params(uset
, model
);
276 __isl_give isl_union_map
*isl_union_map_union(__isl_take isl_union_map
*umap1
,
277 __isl_take isl_union_map
*umap2
)
279 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
280 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
282 umap1
= isl_union_map_cow(umap1
);
284 if (!umap1
|| !umap2
)
287 if (isl_union_map_foreach_map(umap2
, &add_map
, &umap1
) < 0)
290 isl_union_map_free(umap2
);
294 isl_union_map_free(umap1
);
295 isl_union_map_free(umap2
);
299 __isl_give isl_union_set
*isl_union_set_union(__isl_take isl_union_set
*uset1
,
300 __isl_take isl_union_set
*uset2
)
302 return isl_union_map_union(uset1
, uset2
);
305 __isl_give isl_union_map
*isl_union_map_copy(__isl_keep isl_union_map
*umap
)
314 __isl_give isl_union_set
*isl_union_set_copy(__isl_keep isl_union_set
*uset
)
316 return isl_union_map_copy(uset
);
319 __isl_null isl_union_map
*isl_union_map_free(__isl_take isl_union_map
*umap
)
327 isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
328 &free_umap_entry
, NULL
);
329 isl_hash_table_clear(&umap
->table
);
330 isl_space_free(umap
->dim
);
335 __isl_null isl_union_set
*isl_union_set_free(__isl_take isl_union_set
*uset
)
337 return isl_union_map_free(uset
);
340 /* Do "umap" and "space" have the same parameters?
342 isl_bool
isl_union_map_space_has_equal_params(__isl_keep isl_union_map
*umap
,
343 __isl_keep isl_space
*space
)
345 isl_space
*umap_space
;
347 umap_space
= isl_union_map_peek_space(umap
);
348 return isl_space_has_equal_params(umap_space
, space
);
351 static int has_dim(const void *entry
, const void *val
)
353 isl_map
*map
= (isl_map
*)entry
;
354 isl_space
*dim
= (isl_space
*)val
;
356 return isl_space_is_equal(map
->dim
, dim
);
359 __isl_give isl_union_map
*isl_union_map_add_map(__isl_take isl_union_map
*umap
,
360 __isl_take isl_map
*map
)
363 struct isl_hash_table_entry
*entry
;
369 if (isl_map_plain_is_empty(map
)) {
374 aligned
= isl_map_space_has_equal_params(map
, umap
->dim
);
378 umap
= isl_union_map_align_params(umap
, isl_map_get_space(map
));
379 map
= isl_map_align_params(map
, isl_union_map_get_space(umap
));
382 umap
= isl_union_map_cow(umap
);
387 hash
= isl_space_get_hash(map
->dim
);
388 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
389 &has_dim
, map
->dim
, 1);
396 entry
->data
= isl_map_union(entry
->data
, isl_map_copy(map
));
405 isl_union_map_free(umap
);
409 __isl_give isl_union_set
*isl_union_set_add_set(__isl_take isl_union_set
*uset
,
410 __isl_take isl_set
*set
)
412 return isl_union_map_add_map(uset
, set_to_map(set
));
415 __isl_give isl_union_map
*isl_union_map_from_map(__isl_take isl_map
*map
)
423 dim
= isl_map_get_space(map
);
424 dim
= isl_space_params(dim
);
425 umap
= isl_union_map_empty(dim
);
426 umap
= isl_union_map_add_map(umap
, map
);
431 __isl_give isl_union_set
*isl_union_set_from_set(__isl_take isl_set
*set
)
433 return isl_union_map_from_map(set_to_map(set
));
436 __isl_give isl_union_map
*isl_union_map_from_basic_map(
437 __isl_take isl_basic_map
*bmap
)
439 return isl_union_map_from_map(isl_map_from_basic_map(bmap
));
442 __isl_give isl_union_set
*isl_union_set_from_basic_set(
443 __isl_take isl_basic_set
*bset
)
445 return isl_union_map_from_basic_map(bset
);
448 struct isl_union_map_foreach_data
450 isl_stat (*fn
)(__isl_take isl_map
*map
, void *user
);
454 static isl_stat
call_on_copy(void **entry
, void *user
)
456 isl_map
*map
= *entry
;
457 struct isl_union_map_foreach_data
*data
;
458 data
= (struct isl_union_map_foreach_data
*)user
;
460 return data
->fn(isl_map_copy(map
), data
->user
);
463 int isl_union_map_n_map(__isl_keep isl_union_map
*umap
)
465 return umap
? umap
->table
.n
: 0;
468 int isl_union_set_n_set(__isl_keep isl_union_set
*uset
)
470 return uset
? uset
->table
.n
: 0;
473 isl_stat
isl_union_map_foreach_map(__isl_keep isl_union_map
*umap
,
474 isl_stat (*fn
)(__isl_take isl_map
*map
, void *user
), void *user
)
476 struct isl_union_map_foreach_data data
= { fn
, user
};
479 return isl_stat_error
;
481 return isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
482 &call_on_copy
, &data
);
485 static isl_stat
copy_map(void **entry
, void *user
)
487 isl_map
*map
= *entry
;
488 isl_map
**map_p
= user
;
490 *map_p
= isl_map_copy(map
);
492 return isl_stat_error
;
495 __isl_give isl_map
*isl_map_from_union_map(__isl_take isl_union_map
*umap
)
502 ctx
= isl_union_map_get_ctx(umap
);
503 if (umap
->table
.n
!= 1)
504 isl_die(ctx
, isl_error_invalid
,
505 "union map needs to contain elements in exactly "
506 "one space", goto error
);
508 isl_hash_table_foreach(ctx
, &umap
->table
, ©_map
, &map
);
510 isl_union_map_free(umap
);
514 isl_union_map_free(umap
);
518 __isl_give isl_set
*isl_set_from_union_set(__isl_take isl_union_set
*uset
)
520 return isl_map_from_union_map(uset
);
523 /* Extract the map in "umap" that lives in the given space (ignoring
526 __isl_give isl_map
*isl_union_map_extract_map(__isl_keep isl_union_map
*umap
,
527 __isl_take isl_space
*space
)
530 struct isl_hash_table_entry
*entry
;
532 space
= isl_space_drop_dims(space
, isl_dim_param
,
533 0, isl_space_dim(space
, isl_dim_param
));
534 space
= isl_space_align_params(space
, isl_union_map_get_space(umap
));
538 hash
= isl_space_get_hash(space
);
539 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
542 return isl_map_empty(space
);
543 isl_space_free(space
);
544 return isl_map_copy(entry
->data
);
546 isl_space_free(space
);
550 __isl_give isl_set
*isl_union_set_extract_set(__isl_keep isl_union_set
*uset
,
551 __isl_take isl_space
*dim
)
553 return set_from_map(isl_union_map_extract_map(uset
, dim
));
556 /* Check if umap contains a map in the given space.
558 isl_bool
isl_union_map_contains(__isl_keep isl_union_map
*umap
,
559 __isl_keep isl_space
*space
)
562 struct isl_hash_table_entry
*entry
;
565 return isl_bool_error
;
567 hash
= isl_space_get_hash(space
);
568 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
573 isl_bool
isl_union_set_contains(__isl_keep isl_union_set
*uset
,
574 __isl_keep isl_space
*space
)
576 return isl_union_map_contains(uset
, space
);
579 isl_stat
isl_union_set_foreach_set(__isl_keep isl_union_set
*uset
,
580 isl_stat (*fn
)(__isl_take isl_set
*set
, void *user
), void *user
)
582 return isl_union_map_foreach_map(uset
,
583 (isl_stat(*)(__isl_take isl_map
*, void*))fn
, user
);
586 struct isl_union_set_foreach_point_data
{
587 isl_stat (*fn
)(__isl_take isl_point
*pnt
, void *user
);
591 static isl_stat
foreach_point(__isl_take isl_set
*set
, void *user
)
593 struct isl_union_set_foreach_point_data
*data
= user
;
596 r
= isl_set_foreach_point(set
, data
->fn
, data
->user
);
602 isl_stat
isl_union_set_foreach_point(__isl_keep isl_union_set
*uset
,
603 isl_stat (*fn
)(__isl_take isl_point
*pnt
, void *user
), void *user
)
605 struct isl_union_set_foreach_point_data data
= { fn
, user
};
606 return isl_union_set_foreach_set(uset
, &foreach_point
, &data
);
609 struct isl_union_map_gen_bin_data
{
610 isl_union_map
*umap2
;
614 static isl_stat
subtract_entry(void **entry
, void *user
)
616 struct isl_union_map_gen_bin_data
*data
= user
;
618 struct isl_hash_table_entry
*entry2
;
619 isl_map
*map
= *entry
;
621 hash
= isl_space_get_hash(map
->dim
);
622 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
623 hash
, &has_dim
, map
->dim
, 0);
624 map
= isl_map_copy(map
);
627 map
= isl_map_subtract(map
, isl_map_copy(entry2
->data
));
629 empty
= isl_map_is_empty(map
);
632 return isl_stat_error
;
639 data
->res
= isl_union_map_add_map(data
->res
, map
);
644 static __isl_give isl_union_map
*gen_bin_op(__isl_take isl_union_map
*umap1
,
645 __isl_take isl_union_map
*umap2
, isl_stat (*fn
)(void **, void *))
647 struct isl_union_map_gen_bin_data data
= { NULL
, NULL
};
649 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
650 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
652 if (!umap1
|| !umap2
)
656 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
658 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
662 isl_union_map_free(umap1
);
663 isl_union_map_free(umap2
);
666 isl_union_map_free(umap1
);
667 isl_union_map_free(umap2
);
668 isl_union_map_free(data
.res
);
672 __isl_give isl_union_map
*isl_union_map_subtract(
673 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
675 return gen_bin_op(umap1
, umap2
, &subtract_entry
);
678 __isl_give isl_union_set
*isl_union_set_subtract(
679 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
681 return isl_union_map_subtract(uset1
, uset2
);
684 struct isl_union_map_gen_bin_set_data
{
689 static isl_stat
intersect_params_entry(void **entry
, void *user
)
691 struct isl_union_map_gen_bin_set_data
*data
= user
;
692 isl_map
*map
= *entry
;
695 map
= isl_map_copy(map
);
696 map
= isl_map_intersect_params(map
, isl_set_copy(data
->set
));
698 empty
= isl_map_is_empty(map
);
701 return isl_stat_error
;
704 data
->res
= isl_union_map_add_map(data
->res
, map
);
709 static __isl_give isl_union_map
*gen_bin_set_op(__isl_take isl_union_map
*umap
,
710 __isl_take isl_set
*set
, isl_stat (*fn
)(void **, void *))
712 struct isl_union_map_gen_bin_set_data data
= { NULL
, NULL
};
714 umap
= isl_union_map_align_params(umap
, isl_set_get_space(set
));
715 set
= isl_set_align_params(set
, isl_union_map_get_space(umap
));
721 data
.res
= isl_union_map_alloc(isl_space_copy(umap
->dim
),
723 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
727 isl_union_map_free(umap
);
731 isl_union_map_free(umap
);
733 isl_union_map_free(data
.res
);
737 /* Intersect "umap" with the parameter domain "set".
739 * If "set" does not have any constraints, then we can return immediately.
741 __isl_give isl_union_map
*isl_union_map_intersect_params(
742 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
746 is_universe
= isl_set_plain_is_universe(set
);
754 return gen_bin_set_op(umap
, set
, &intersect_params_entry
);
756 isl_union_map_free(umap
);
761 __isl_give isl_union_set
*isl_union_set_intersect_params(
762 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
764 return isl_union_map_intersect_params(uset
, set
);
767 static __isl_give isl_union_map
*union_map_intersect_params(
768 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
770 return isl_union_map_intersect_params(umap
,
771 isl_set_from_union_set(uset
));
774 static __isl_give isl_union_map
*union_map_gist_params(
775 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
777 return isl_union_map_gist_params(umap
, isl_set_from_union_set(uset
));
780 struct isl_union_map_match_bin_data
{
781 isl_union_map
*umap2
;
783 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*);
786 static isl_stat
match_bin_entry(void **entry
, void *user
)
788 struct isl_union_map_match_bin_data
*data
= user
;
790 struct isl_hash_table_entry
*entry2
;
791 isl_map
*map
= *entry
;
794 hash
= isl_space_get_hash(map
->dim
);
795 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
796 hash
, &has_dim
, map
->dim
, 0);
800 map
= isl_map_copy(map
);
801 map
= data
->fn(map
, isl_map_copy(entry2
->data
));
803 empty
= isl_map_is_empty(map
);
806 return isl_stat_error
;
813 data
->res
= isl_union_map_add_map(data
->res
, map
);
818 static __isl_give isl_union_map
*match_bin_op(__isl_take isl_union_map
*umap1
,
819 __isl_take isl_union_map
*umap2
,
820 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*))
822 struct isl_union_map_match_bin_data data
= { NULL
, NULL
, fn
};
824 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
825 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
827 if (!umap1
|| !umap2
)
831 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
833 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
834 &match_bin_entry
, &data
) < 0)
837 isl_union_map_free(umap1
);
838 isl_union_map_free(umap2
);
841 isl_union_map_free(umap1
);
842 isl_union_map_free(umap2
);
843 isl_union_map_free(data
.res
);
847 __isl_give isl_union_map
*isl_union_map_intersect(
848 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
850 return match_bin_op(umap1
, umap2
, &isl_map_intersect
);
853 /* Compute the intersection of the two union_sets.
854 * As a special case, if exactly one of the two union_sets
855 * is a parameter domain, then intersect the parameter domain
856 * of the other one with this set.
858 __isl_give isl_union_set
*isl_union_set_intersect(
859 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
863 p1
= isl_union_set_is_params(uset1
);
864 p2
= isl_union_set_is_params(uset2
);
865 if (p1
< 0 || p2
< 0)
868 return union_map_intersect_params(uset1
, uset2
);
870 return union_map_intersect_params(uset2
, uset1
);
871 return isl_union_map_intersect(uset1
, uset2
);
873 isl_union_set_free(uset1
);
874 isl_union_set_free(uset2
);
878 static isl_stat
gist_params_entry(void **entry
, void *user
)
880 struct isl_union_map_gen_bin_set_data
*data
= user
;
881 isl_map
*map
= *entry
;
884 map
= isl_map_copy(map
);
885 map
= isl_map_gist_params(map
, isl_set_copy(data
->set
));
887 empty
= isl_map_is_empty(map
);
890 return isl_stat_error
;
893 data
->res
= isl_union_map_add_map(data
->res
, map
);
898 __isl_give isl_union_map
*isl_union_map_gist_params(
899 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
901 return gen_bin_set_op(umap
, set
, &gist_params_entry
);
904 __isl_give isl_union_set
*isl_union_set_gist_params(
905 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
907 return isl_union_map_gist_params(uset
, set
);
910 __isl_give isl_union_map
*isl_union_map_gist(__isl_take isl_union_map
*umap
,
911 __isl_take isl_union_map
*context
)
913 return match_bin_op(umap
, context
, &isl_map_gist
);
916 __isl_give isl_union_set
*isl_union_set_gist(__isl_take isl_union_set
*uset
,
917 __isl_take isl_union_set
*context
)
919 if (isl_union_set_is_params(context
))
920 return union_map_gist_params(uset
, context
);
921 return isl_union_map_gist(uset
, context
);
924 static __isl_give isl_map
*lex_le_set(__isl_take isl_map
*set1
,
925 __isl_take isl_map
*set2
)
927 return isl_set_lex_le_set(set_from_map(set1
), set_from_map(set2
));
930 static __isl_give isl_map
*lex_lt_set(__isl_take isl_map
*set1
,
931 __isl_take isl_map
*set2
)
933 return isl_set_lex_lt_set(set_from_map(set1
), set_from_map(set2
));
936 __isl_give isl_union_map
*isl_union_set_lex_lt_union_set(
937 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
939 return match_bin_op(uset1
, uset2
, &lex_lt_set
);
942 __isl_give isl_union_map
*isl_union_set_lex_le_union_set(
943 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
945 return match_bin_op(uset1
, uset2
, &lex_le_set
);
948 __isl_give isl_union_map
*isl_union_set_lex_gt_union_set(
949 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
951 return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2
, uset1
));
954 __isl_give isl_union_map
*isl_union_set_lex_ge_union_set(
955 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
957 return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2
, uset1
));
960 __isl_give isl_union_map
*isl_union_map_lex_gt_union_map(
961 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
963 return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2
, umap1
));
966 __isl_give isl_union_map
*isl_union_map_lex_ge_union_map(
967 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
969 return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2
, umap1
));
972 static isl_stat
intersect_domain_entry(void **entry
, void *user
)
974 struct isl_union_map_gen_bin_data
*data
= user
;
976 struct isl_hash_table_entry
*entry2
;
978 isl_map
*map
= *entry
;
981 dim
= isl_map_get_space(map
);
982 dim
= isl_space_domain(dim
);
983 hash
= isl_space_get_hash(dim
);
984 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
985 hash
, &has_dim
, dim
, 0);
990 map
= isl_map_copy(map
);
991 map
= isl_map_intersect_domain(map
, isl_set_copy(entry2
->data
));
993 empty
= isl_map_is_empty(map
);
996 return isl_stat_error
;
1003 data
->res
= isl_union_map_add_map(data
->res
, map
);
1008 /* Intersect the domain of "umap" with "uset".
1009 * If "uset" is a parameters domain, then intersect the parameter
1010 * domain of "umap" with this set.
1012 __isl_give isl_union_map
*isl_union_map_intersect_domain(
1013 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1015 if (isl_union_set_is_params(uset
))
1016 return union_map_intersect_params(umap
, uset
);
1017 return gen_bin_op(umap
, uset
, &intersect_domain_entry
);
1020 /* Remove the elements of data->umap2 from the domain of *entry
1021 * and add the result to data->res.
1023 static isl_stat
subtract_domain_entry(void **entry
, void *user
)
1025 struct isl_union_map_gen_bin_data
*data
= user
;
1027 struct isl_hash_table_entry
*entry2
;
1029 isl_map
*map
= *entry
;
1032 dim
= isl_map_get_space(map
);
1033 dim
= isl_space_domain(dim
);
1034 hash
= isl_space_get_hash(dim
);
1035 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1036 hash
, &has_dim
, dim
, 0);
1037 isl_space_free(dim
);
1039 map
= isl_map_copy(map
);
1042 data
->res
= isl_union_map_add_map(data
->res
, map
);
1046 map
= isl_map_subtract_domain(map
, isl_set_copy(entry2
->data
));
1048 empty
= isl_map_is_empty(map
);
1051 return isl_stat_error
;
1058 data
->res
= isl_union_map_add_map(data
->res
, map
);
1063 /* Remove the elements of "uset" from the domain of "umap".
1065 __isl_give isl_union_map
*isl_union_map_subtract_domain(
1066 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*dom
)
1068 return gen_bin_op(umap
, dom
, &subtract_domain_entry
);
1071 /* Remove the elements of data->umap2 from the range of *entry
1072 * and add the result to data->res.
1074 static isl_stat
subtract_range_entry(void **entry
, void *user
)
1076 struct isl_union_map_gen_bin_data
*data
= user
;
1078 struct isl_hash_table_entry
*entry2
;
1080 isl_map
*map
= *entry
;
1083 space
= isl_map_get_space(map
);
1084 space
= isl_space_range(space
);
1085 hash
= isl_space_get_hash(space
);
1086 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1087 hash
, &has_dim
, space
, 0);
1088 isl_space_free(space
);
1090 map
= isl_map_copy(map
);
1093 data
->res
= isl_union_map_add_map(data
->res
, map
);
1097 map
= isl_map_subtract_range(map
, isl_set_copy(entry2
->data
));
1099 empty
= isl_map_is_empty(map
);
1102 return isl_stat_error
;
1109 data
->res
= isl_union_map_add_map(data
->res
, map
);
1114 /* Remove the elements of "uset" from the range of "umap".
1116 __isl_give isl_union_map
*isl_union_map_subtract_range(
1117 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*dom
)
1119 return gen_bin_op(umap
, dom
, &subtract_range_entry
);
1122 static isl_stat
gist_domain_entry(void **entry
, void *user
)
1124 struct isl_union_map_gen_bin_data
*data
= user
;
1126 struct isl_hash_table_entry
*entry2
;
1128 isl_map
*map
= *entry
;
1131 dim
= isl_map_get_space(map
);
1132 dim
= isl_space_domain(dim
);
1133 hash
= isl_space_get_hash(dim
);
1134 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1135 hash
, &has_dim
, dim
, 0);
1136 isl_space_free(dim
);
1140 map
= isl_map_copy(map
);
1141 map
= isl_map_gist_domain(map
, isl_set_copy(entry2
->data
));
1143 empty
= isl_map_is_empty(map
);
1146 return isl_stat_error
;
1149 data
->res
= isl_union_map_add_map(data
->res
, map
);
1154 /* Compute the gist of "umap" with respect to the domain "uset".
1155 * If "uset" is a parameters domain, then compute the gist
1156 * with respect to this parameter domain.
1158 __isl_give isl_union_map
*isl_union_map_gist_domain(
1159 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1161 if (isl_union_set_is_params(uset
))
1162 return union_map_gist_params(umap
, uset
);
1163 return gen_bin_op(umap
, uset
, &gist_domain_entry
);
1166 static isl_stat
gist_range_entry(void **entry
, void *user
)
1168 struct isl_union_map_gen_bin_data
*data
= user
;
1170 struct isl_hash_table_entry
*entry2
;
1172 isl_map
*map
= *entry
;
1175 space
= isl_map_get_space(map
);
1176 space
= isl_space_range(space
);
1177 hash
= isl_space_get_hash(space
);
1178 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1179 hash
, &has_dim
, space
, 0);
1180 isl_space_free(space
);
1184 map
= isl_map_copy(map
);
1185 map
= isl_map_gist_range(map
, isl_set_copy(entry2
->data
));
1187 empty
= isl_map_is_empty(map
);
1190 return isl_stat_error
;
1193 data
->res
= isl_union_map_add_map(data
->res
, map
);
1198 /* Compute the gist of "umap" with respect to the range "uset".
1200 __isl_give isl_union_map
*isl_union_map_gist_range(
1201 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1203 return gen_bin_op(umap
, uset
, &gist_range_entry
);
1206 static isl_stat
intersect_range_entry(void **entry
, void *user
)
1208 struct isl_union_map_gen_bin_data
*data
= user
;
1210 struct isl_hash_table_entry
*entry2
;
1212 isl_map
*map
= *entry
;
1215 dim
= isl_map_get_space(map
);
1216 dim
= isl_space_range(dim
);
1217 hash
= isl_space_get_hash(dim
);
1218 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1219 hash
, &has_dim
, dim
, 0);
1220 isl_space_free(dim
);
1224 map
= isl_map_copy(map
);
1225 map
= isl_map_intersect_range(map
, isl_set_copy(entry2
->data
));
1227 empty
= isl_map_is_empty(map
);
1230 return isl_stat_error
;
1237 data
->res
= isl_union_map_add_map(data
->res
, map
);
1242 __isl_give isl_union_map
*isl_union_map_intersect_range(
1243 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1245 return gen_bin_op(umap
, uset
, &intersect_range_entry
);
1248 struct isl_union_map_bin_data
{
1249 isl_union_map
*umap2
;
1252 isl_stat (*fn
)(void **entry
, void *user
);
1255 static isl_stat
apply_range_entry(void **entry
, void *user
)
1257 struct isl_union_map_bin_data
*data
= user
;
1258 isl_map
*map2
= *entry
;
1261 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1262 map2
->dim
, isl_dim_in
))
1265 map2
= isl_map_apply_range(isl_map_copy(data
->map
), isl_map_copy(map2
));
1267 empty
= isl_map_is_empty(map2
);
1270 return isl_stat_error
;
1277 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1282 static isl_stat
bin_entry(void **entry
, void *user
)
1284 struct isl_union_map_bin_data
*data
= user
;
1285 isl_map
*map
= *entry
;
1288 if (isl_hash_table_foreach(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1289 data
->fn
, data
) < 0)
1290 return isl_stat_error
;
1295 static __isl_give isl_union_map
*bin_op(__isl_take isl_union_map
*umap1
,
1296 __isl_take isl_union_map
*umap2
,
1297 isl_stat (*fn
)(void **entry
, void *user
))
1299 struct isl_union_map_bin_data data
= { NULL
, NULL
, NULL
, fn
};
1301 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
1302 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1304 if (!umap1
|| !umap2
)
1308 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
1310 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1311 &bin_entry
, &data
) < 0)
1314 isl_union_map_free(umap1
);
1315 isl_union_map_free(umap2
);
1318 isl_union_map_free(umap1
);
1319 isl_union_map_free(umap2
);
1320 isl_union_map_free(data
.res
);
1324 __isl_give isl_union_map
*isl_union_map_apply_range(
1325 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1327 return bin_op(umap1
, umap2
, &apply_range_entry
);
1330 __isl_give isl_union_map
*isl_union_map_apply_domain(
1331 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1333 umap1
= isl_union_map_reverse(umap1
);
1334 umap1
= isl_union_map_apply_range(umap1
, umap2
);
1335 return isl_union_map_reverse(umap1
);
1338 __isl_give isl_union_set
*isl_union_set_apply(
1339 __isl_take isl_union_set
*uset
, __isl_take isl_union_map
*umap
)
1341 return isl_union_map_apply_range(uset
, umap
);
1344 static isl_stat
map_lex_lt_entry(void **entry
, void *user
)
1346 struct isl_union_map_bin_data
*data
= user
;
1347 isl_map
*map2
= *entry
;
1349 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1350 map2
->dim
, isl_dim_out
))
1353 map2
= isl_map_lex_lt_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1355 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1360 __isl_give isl_union_map
*isl_union_map_lex_lt_union_map(
1361 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1363 return bin_op(umap1
, umap2
, &map_lex_lt_entry
);
1366 static isl_stat
map_lex_le_entry(void **entry
, void *user
)
1368 struct isl_union_map_bin_data
*data
= user
;
1369 isl_map
*map2
= *entry
;
1371 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1372 map2
->dim
, isl_dim_out
))
1375 map2
= isl_map_lex_le_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1377 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1382 __isl_give isl_union_map
*isl_union_map_lex_le_union_map(
1383 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1385 return bin_op(umap1
, umap2
, &map_lex_le_entry
);
1388 static isl_stat
product_entry(void **entry
, void *user
)
1390 struct isl_union_map_bin_data
*data
= user
;
1391 isl_map
*map2
= *entry
;
1393 map2
= isl_map_product(isl_map_copy(data
->map
), isl_map_copy(map2
));
1395 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1400 __isl_give isl_union_map
*isl_union_map_product(__isl_take isl_union_map
*umap1
,
1401 __isl_take isl_union_map
*umap2
)
1403 return bin_op(umap1
, umap2
, &product_entry
);
1406 static isl_stat
set_product_entry(void **entry
, void *user
)
1408 struct isl_union_map_bin_data
*data
= user
;
1409 isl_set
*set2
= *entry
;
1411 set2
= isl_set_product(isl_set_copy(data
->map
), isl_set_copy(set2
));
1413 data
->res
= isl_union_set_add_set(data
->res
, set2
);
1418 __isl_give isl_union_set
*isl_union_set_product(__isl_take isl_union_set
*uset1
,
1419 __isl_take isl_union_set
*uset2
)
1421 return bin_op(uset1
, uset2
, &set_product_entry
);
1424 static isl_stat
domain_product_entry(void **entry
, void *user
)
1426 struct isl_union_map_bin_data
*data
= user
;
1427 isl_map
*map2
= *entry
;
1429 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1430 map2
->dim
, isl_dim_out
))
1433 map2
= isl_map_domain_product(isl_map_copy(data
->map
),
1434 isl_map_copy(map2
));
1436 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1441 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
1443 __isl_give isl_union_map
*isl_union_map_domain_product(
1444 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1446 return bin_op(umap1
, umap2
, &domain_product_entry
);
1449 static isl_stat
range_product_entry(void **entry
, void *user
)
1451 struct isl_union_map_bin_data
*data
= user
;
1452 isl_map
*map2
= *entry
;
1454 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_in
,
1455 map2
->dim
, isl_dim_in
))
1458 map2
= isl_map_range_product(isl_map_copy(data
->map
),
1459 isl_map_copy(map2
));
1461 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1466 __isl_give isl_union_map
*isl_union_map_range_product(
1467 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1469 return bin_op(umap1
, umap2
, &range_product_entry
);
1472 /* If data->map A -> B and "map2" C -> D have the same range space,
1473 * then add (A, C) -> (B * D) to data->res.
1475 static isl_stat
flat_domain_product_entry(void **entry
, void *user
)
1477 struct isl_union_map_bin_data
*data
= user
;
1478 isl_map
*map2
= *entry
;
1480 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1481 map2
->dim
, isl_dim_out
))
1484 map2
= isl_map_flat_domain_product(isl_map_copy(data
->map
),
1485 isl_map_copy(map2
));
1487 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1492 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D).
1494 __isl_give isl_union_map
*isl_union_map_flat_domain_product(
1495 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1497 return bin_op(umap1
, umap2
, &flat_domain_product_entry
);
1500 static isl_stat
flat_range_product_entry(void **entry
, void *user
)
1502 struct isl_union_map_bin_data
*data
= user
;
1503 isl_map
*map2
= *entry
;
1505 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_in
,
1506 map2
->dim
, isl_dim_in
))
1509 map2
= isl_map_flat_range_product(isl_map_copy(data
->map
),
1510 isl_map_copy(map2
));
1512 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1517 __isl_give isl_union_map
*isl_union_map_flat_range_product(
1518 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1520 return bin_op(umap1
, umap2
, &flat_range_product_entry
);
1523 static __isl_give isl_union_set
*cond_un_op(__isl_take isl_union_map
*umap
,
1524 isl_stat (*fn
)(void **, void *))
1531 res
= isl_union_map_alloc(isl_space_copy(umap
->dim
), umap
->table
.n
);
1532 if (isl_hash_table_foreach(isl_union_map_get_ctx(umap
),
1533 &umap
->table
, fn
, &res
) < 0)
1536 isl_union_map_free(umap
);
1539 isl_union_map_free(umap
);
1540 isl_union_set_free(res
);
1544 static isl_stat
from_range_entry(void **entry
, void *user
)
1546 isl_map
*set
= *entry
;
1547 isl_union_set
**res
= user
;
1549 *res
= isl_union_map_add_map(*res
,
1550 isl_map_from_range(isl_set_copy(set
)));
1555 __isl_give isl_union_map
*isl_union_map_from_range(
1556 __isl_take isl_union_set
*uset
)
1558 return cond_un_op(uset
, &from_range_entry
);
1561 __isl_give isl_union_map
*isl_union_map_from_domain(
1562 __isl_take isl_union_set
*uset
)
1564 return isl_union_map_reverse(isl_union_map_from_range(uset
));
1567 __isl_give isl_union_map
*isl_union_map_from_domain_and_range(
1568 __isl_take isl_union_set
*domain
, __isl_take isl_union_set
*range
)
1570 return isl_union_map_apply_range(isl_union_map_from_domain(domain
),
1571 isl_union_map_from_range(range
));
1574 static __isl_give isl_union_map
*un_op(__isl_take isl_union_map
*umap
,
1575 isl_stat (*fn
)(void **, void *))
1577 umap
= isl_union_map_cow(umap
);
1581 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, NULL
) < 0)
1586 isl_union_map_free(umap
);
1590 static isl_stat
affine_entry(void **entry
, void *user
)
1592 isl_map
**map
= (isl_map
**)entry
;
1594 *map
= isl_map_from_basic_map(isl_map_affine_hull(*map
));
1596 return *map
? isl_stat_ok
: isl_stat_error
;
1599 __isl_give isl_union_map
*isl_union_map_affine_hull(
1600 __isl_take isl_union_map
*umap
)
1602 return un_op(umap
, &affine_entry
);
1605 __isl_give isl_union_set
*isl_union_set_affine_hull(
1606 __isl_take isl_union_set
*uset
)
1608 return isl_union_map_affine_hull(uset
);
1611 static isl_stat
polyhedral_entry(void **entry
, void *user
)
1613 isl_map
**map
= (isl_map
**)entry
;
1615 *map
= isl_map_from_basic_map(isl_map_polyhedral_hull(*map
));
1617 return *map
? isl_stat_ok
: isl_stat_error
;
1620 __isl_give isl_union_map
*isl_union_map_polyhedral_hull(
1621 __isl_take isl_union_map
*umap
)
1623 return un_op(umap
, &polyhedral_entry
);
1626 __isl_give isl_union_set
*isl_union_set_polyhedral_hull(
1627 __isl_take isl_union_set
*uset
)
1629 return isl_union_map_polyhedral_hull(uset
);
1632 static isl_stat
simple_entry(void **entry
, void *user
)
1634 isl_map
**map
= (isl_map
**)entry
;
1636 *map
= isl_map_from_basic_map(isl_map_simple_hull(*map
));
1638 return *map
? isl_stat_ok
: isl_stat_error
;
1641 __isl_give isl_union_map
*isl_union_map_simple_hull(
1642 __isl_take isl_union_map
*umap
)
1644 return un_op(umap
, &simple_entry
);
1647 __isl_give isl_union_set
*isl_union_set_simple_hull(
1648 __isl_take isl_union_set
*uset
)
1650 return isl_union_map_simple_hull(uset
);
1653 static isl_stat
inplace_entry(void **entry
, void *user
)
1655 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*);
1656 isl_map
**map
= (isl_map
**)entry
;
1659 fn
= *(__isl_give isl_map
*(**)(__isl_take isl_map
*)) user
;
1660 copy
= fn(isl_map_copy(*map
));
1662 return isl_stat_error
;
1670 static __isl_give isl_union_map
*inplace(__isl_take isl_union_map
*umap
,
1671 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*))
1676 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1677 &inplace_entry
, &fn
) < 0)
1682 isl_union_map_free(umap
);
1686 /* Remove redundant constraints in each of the basic maps of "umap".
1687 * Since removing redundant constraints does not change the meaning
1688 * or the space, the operation can be performed in-place.
1690 __isl_give isl_union_map
*isl_union_map_remove_redundancies(
1691 __isl_take isl_union_map
*umap
)
1693 return inplace(umap
, &isl_map_remove_redundancies
);
1696 /* Remove redundant constraints in each of the basic sets of "uset".
1698 __isl_give isl_union_set
*isl_union_set_remove_redundancies(
1699 __isl_take isl_union_set
*uset
)
1701 return isl_union_map_remove_redundancies(uset
);
1704 __isl_give isl_union_map
*isl_union_map_coalesce(
1705 __isl_take isl_union_map
*umap
)
1707 return inplace(umap
, &isl_map_coalesce
);
1710 __isl_give isl_union_set
*isl_union_set_coalesce(
1711 __isl_take isl_union_set
*uset
)
1713 return isl_union_map_coalesce(uset
);
1716 __isl_give isl_union_map
*isl_union_map_detect_equalities(
1717 __isl_take isl_union_map
*umap
)
1719 return inplace(umap
, &isl_map_detect_equalities
);
1722 __isl_give isl_union_set
*isl_union_set_detect_equalities(
1723 __isl_take isl_union_set
*uset
)
1725 return isl_union_map_detect_equalities(uset
);
1728 __isl_give isl_union_map
*isl_union_map_compute_divs(
1729 __isl_take isl_union_map
*umap
)
1731 return inplace(umap
, &isl_map_compute_divs
);
1734 __isl_give isl_union_set
*isl_union_set_compute_divs(
1735 __isl_take isl_union_set
*uset
)
1737 return isl_union_map_compute_divs(uset
);
1740 static isl_stat
lexmin_entry(void **entry
, void *user
)
1742 isl_map
**map
= (isl_map
**)entry
;
1744 *map
= isl_map_lexmin(*map
);
1746 return *map
? isl_stat_ok
: isl_stat_error
;
1749 __isl_give isl_union_map
*isl_union_map_lexmin(
1750 __isl_take isl_union_map
*umap
)
1752 return un_op(umap
, &lexmin_entry
);
1755 __isl_give isl_union_set
*isl_union_set_lexmin(
1756 __isl_take isl_union_set
*uset
)
1758 return isl_union_map_lexmin(uset
);
1761 static isl_stat
lexmax_entry(void **entry
, void *user
)
1763 isl_map
**map
= (isl_map
**)entry
;
1765 *map
= isl_map_lexmax(*map
);
1767 return *map
? isl_stat_ok
: isl_stat_error
;
1770 __isl_give isl_union_map
*isl_union_map_lexmax(
1771 __isl_take isl_union_map
*umap
)
1773 return un_op(umap
, &lexmax_entry
);
1776 __isl_give isl_union_set
*isl_union_set_lexmax(
1777 __isl_take isl_union_set
*uset
)
1779 return isl_union_map_lexmax(uset
);
1782 static isl_stat
universe_entry(void **entry
, void *user
)
1784 isl_map
*map
= *entry
;
1785 isl_union_map
**res
= user
;
1787 map
= isl_map_universe(isl_map_get_space(map
));
1788 *res
= isl_union_map_add_map(*res
, map
);
1793 __isl_give isl_union_map
*isl_union_map_universe(__isl_take isl_union_map
*umap
)
1795 return cond_un_op(umap
, &universe_entry
);
1798 __isl_give isl_union_set
*isl_union_set_universe(__isl_take isl_union_set
*uset
)
1800 return isl_union_map_universe(uset
);
1803 static isl_stat
reverse_entry(void **entry
, void *user
)
1805 isl_map
*map
= *entry
;
1806 isl_union_map
**res
= user
;
1808 *res
= isl_union_map_add_map(*res
, isl_map_reverse(isl_map_copy(map
)));
1813 __isl_give isl_union_map
*isl_union_map_reverse(__isl_take isl_union_map
*umap
)
1815 return cond_un_op(umap
, &reverse_entry
);
1818 static isl_stat
params_entry(void **entry
, void *user
)
1820 isl_map
*map
= *entry
;
1821 isl_union_set
**res
= user
;
1823 *res
= isl_union_set_add_set(*res
, isl_map_params(isl_map_copy(map
)));
1828 /* Compute the parameter domain of the given union map.
1830 __isl_give isl_set
*isl_union_map_params(__isl_take isl_union_map
*umap
)
1834 empty
= isl_union_map_is_empty(umap
);
1839 space
= isl_union_map_get_space(umap
);
1840 isl_union_map_free(umap
);
1841 return isl_set_empty(space
);
1843 return isl_set_from_union_set(cond_un_op(umap
, ¶ms_entry
));
1845 isl_union_map_free(umap
);
1849 /* Compute the parameter domain of the given union set.
1851 __isl_give isl_set
*isl_union_set_params(__isl_take isl_union_set
*uset
)
1853 return isl_union_map_params(uset
);
1856 static isl_stat
domain_entry(void **entry
, void *user
)
1858 isl_map
*map
= *entry
;
1859 isl_union_set
**res
= user
;
1861 *res
= isl_union_set_add_set(*res
, isl_map_domain(isl_map_copy(map
)));
1866 __isl_give isl_union_set
*isl_union_map_domain(__isl_take isl_union_map
*umap
)
1868 return cond_un_op(umap
, &domain_entry
);
1871 static isl_stat
range_entry(void **entry
, void *user
)
1873 isl_map
*map
= *entry
;
1874 isl_union_set
**res
= user
;
1876 *res
= isl_union_set_add_set(*res
, isl_map_range(isl_map_copy(map
)));
1881 __isl_give isl_union_set
*isl_union_map_range(__isl_take isl_union_map
*umap
)
1883 return cond_un_op(umap
, &range_entry
);
1886 static isl_stat
domain_map_entry(void **entry
, void *user
)
1888 isl_map
*map
= *entry
;
1889 isl_union_set
**res
= user
;
1891 *res
= isl_union_map_add_map(*res
,
1892 isl_map_domain_map(isl_map_copy(map
)));
1897 __isl_give isl_union_map
*isl_union_map_domain_map(
1898 __isl_take isl_union_map
*umap
)
1900 return cond_un_op(umap
, &domain_map_entry
);
1903 /* Construct an isl_pw_multi_aff that maps "map" to its domain and
1904 * add the result to "res".
1906 static isl_stat
domain_map_upma(__isl_take isl_map
*map
, void *user
)
1908 isl_union_pw_multi_aff
**res
= user
;
1910 isl_pw_multi_aff
*pma
;
1912 ma
= isl_multi_aff_domain_map(isl_map_get_space(map
));
1913 pma
= isl_pw_multi_aff_alloc(isl_map_wrap(map
), ma
);
1914 *res
= isl_union_pw_multi_aff_add_pw_multi_aff(*res
, pma
);
1916 return *res
? isl_stat_ok
: isl_stat_error
;
1920 /* Return an isl_union_pw_multi_aff that maps a wrapped copy of "umap"
1923 __isl_give isl_union_pw_multi_aff
*isl_union_map_domain_map_union_pw_multi_aff(
1924 __isl_take isl_union_map
*umap
)
1926 isl_union_pw_multi_aff
*res
;
1928 res
= isl_union_pw_multi_aff_empty(isl_union_map_get_space(umap
));
1929 if (isl_union_map_foreach_map(umap
, &domain_map_upma
, &res
) < 0)
1930 res
= isl_union_pw_multi_aff_free(res
);
1932 isl_union_map_free(umap
);
1936 static isl_stat
range_map_entry(void **entry
, void *user
)
1938 isl_map
*map
= *entry
;
1939 isl_union_set
**res
= user
;
1941 *res
= isl_union_map_add_map(*res
,
1942 isl_map_range_map(isl_map_copy(map
)));
1947 __isl_give isl_union_map
*isl_union_map_range_map(
1948 __isl_take isl_union_map
*umap
)
1950 return cond_un_op(umap
, &range_map_entry
);
1953 /* Check if "set" is of the form A[B -> C].
1954 * If so, add A[B -> C] -> B to "res".
1956 static isl_stat
wrapped_domain_map_entry(void **entry
, void *user
)
1958 isl_set
*set
= *entry
;
1959 isl_union_set
**res
= user
;
1962 wrapping
= isl_set_is_wrapping(set
);
1964 return isl_stat_error
;
1968 *res
= isl_union_map_add_map(*res
,
1969 isl_set_wrapped_domain_map(isl_set_copy(set
)));
1974 /* Given a collection of wrapped maps of the form A[B -> C],
1975 * return the collection of maps A[B -> C] -> B.
1977 __isl_give isl_union_map
*isl_union_set_wrapped_domain_map(
1978 __isl_take isl_union_set
*uset
)
1980 return cond_un_op(uset
, &wrapped_domain_map_entry
);
1983 static isl_stat
deltas_entry(void **entry
, void *user
)
1985 isl_map
*map
= *entry
;
1986 isl_union_set
**res
= user
;
1988 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
1989 map
->dim
, isl_dim_out
))
1992 *res
= isl_union_set_add_set(*res
, isl_map_deltas(isl_map_copy(map
)));
1997 __isl_give isl_union_set
*isl_union_map_deltas(__isl_take isl_union_map
*umap
)
1999 return cond_un_op(umap
, &deltas_entry
);
2002 static isl_stat
deltas_map_entry(void **entry
, void *user
)
2004 isl_map
*map
= *entry
;
2005 isl_union_map
**res
= user
;
2007 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
2008 map
->dim
, isl_dim_out
))
2011 *res
= isl_union_map_add_map(*res
,
2012 isl_map_deltas_map(isl_map_copy(map
)));
2017 __isl_give isl_union_map
*isl_union_map_deltas_map(
2018 __isl_take isl_union_map
*umap
)
2020 return cond_un_op(umap
, &deltas_map_entry
);
2023 static isl_stat
identity_entry(void **entry
, void *user
)
2025 isl_set
*set
= *entry
;
2026 isl_union_map
**res
= user
;
2028 *res
= isl_union_map_add_map(*res
, isl_set_identity(isl_set_copy(set
)));
2033 __isl_give isl_union_map
*isl_union_set_identity(__isl_take isl_union_set
*uset
)
2035 return cond_un_op(uset
, &identity_entry
);
2038 /* Construct an identity isl_pw_multi_aff on "set" and add it to *res.
2040 static isl_stat
identity_upma(__isl_take isl_set
*set
, void *user
)
2042 isl_union_pw_multi_aff
**res
= user
;
2044 isl_pw_multi_aff
*pma
;
2046 space
= isl_space_map_from_set(isl_set_get_space(set
));
2047 pma
= isl_pw_multi_aff_identity(space
);
2048 pma
= isl_pw_multi_aff_intersect_domain(pma
, set
);
2049 *res
= isl_union_pw_multi_aff_add_pw_multi_aff(*res
, pma
);
2051 return *res
? isl_stat_ok
: isl_stat_error
;
2054 /* Return an identity function on "uset" in the form
2055 * of an isl_union_pw_multi_aff.
2057 __isl_give isl_union_pw_multi_aff
*isl_union_set_identity_union_pw_multi_aff(
2058 __isl_take isl_union_set
*uset
)
2060 isl_union_pw_multi_aff
*res
;
2062 res
= isl_union_pw_multi_aff_empty(isl_union_set_get_space(uset
));
2063 if (isl_union_set_foreach_set(uset
, &identity_upma
, &res
) < 0)
2064 res
= isl_union_pw_multi_aff_free(res
);
2066 isl_union_set_free(uset
);
2070 /* If "map" is of the form [A -> B] -> C, then add A -> C to "res".
2072 static isl_stat
domain_factor_domain_entry(void **entry
, void *user
)
2074 isl_map
*map
= *entry
;
2075 isl_union_map
**res
= user
;
2077 if (!isl_map_domain_is_wrapping(map
))
2080 *res
= isl_union_map_add_map(*res
,
2081 isl_map_domain_factor_domain(isl_map_copy(map
)));
2083 return *res
? isl_stat_ok
: isl_stat_error
;
2086 /* For each map in "umap" of the form [A -> B] -> C,
2087 * construct the map A -> C and collect the results.
2089 __isl_give isl_union_map
*isl_union_map_domain_factor_domain(
2090 __isl_take isl_union_map
*umap
)
2092 return cond_un_op(umap
, &domain_factor_domain_entry
);
2095 /* If "map" is of the form [A -> B] -> C, then add B -> C to "res".
2097 static isl_stat
domain_factor_range_entry(void **entry
, void *user
)
2099 isl_map
*map
= *entry
;
2100 isl_union_map
**res
= user
;
2102 if (!isl_map_domain_is_wrapping(map
))
2105 *res
= isl_union_map_add_map(*res
,
2106 isl_map_domain_factor_range(isl_map_copy(map
)));
2108 return *res
? isl_stat_ok
: isl_stat_error
;
2111 /* For each map in "umap" of the form [A -> B] -> C,
2112 * construct the map B -> C and collect the results.
2114 __isl_give isl_union_map
*isl_union_map_domain_factor_range(
2115 __isl_take isl_union_map
*umap
)
2117 return cond_un_op(umap
, &domain_factor_range_entry
);
2120 /* If "map" is of the form A -> [B -> C], then add A -> B to "res".
2122 static isl_stat
range_factor_domain_entry(void **entry
, void *user
)
2124 isl_map
*map
= *entry
;
2125 isl_union_map
**res
= user
;
2127 if (!isl_map_range_is_wrapping(map
))
2130 *res
= isl_union_map_add_map(*res
,
2131 isl_map_range_factor_domain(isl_map_copy(map
)));
2133 return *res
? isl_stat_ok
: isl_stat_error
;
2136 /* For each map in "umap" of the form A -> [B -> C],
2137 * construct the map A -> B and collect the results.
2139 __isl_give isl_union_map
*isl_union_map_range_factor_domain(
2140 __isl_take isl_union_map
*umap
)
2142 return cond_un_op(umap
, &range_factor_domain_entry
);
2145 /* If "map" is of the form A -> [B -> C], then add A -> C to "res".
2147 static isl_stat
range_factor_range_entry(void **entry
, void *user
)
2149 isl_map
*map
= *entry
;
2150 isl_union_map
**res
= user
;
2152 if (!isl_map_range_is_wrapping(map
))
2155 *res
= isl_union_map_add_map(*res
,
2156 isl_map_range_factor_range(isl_map_copy(map
)));
2158 return *res
? isl_stat_ok
: isl_stat_error
;
2161 /* For each map in "umap" of the form A -> [B -> C],
2162 * construct the map A -> C and collect the results.
2164 __isl_give isl_union_map
*isl_union_map_range_factor_range(
2165 __isl_take isl_union_map
*umap
)
2167 return cond_un_op(umap
, &range_factor_range_entry
);
2170 /* If "map" is of the form [A -> B] -> [C -> D], then add A -> C to "res".
2172 static isl_stat
factor_domain_entry(void **entry
, void *user
)
2174 isl_map
*map
= *entry
;
2175 isl_union_map
**res
= user
;
2177 if (!isl_map_is_product(map
))
2180 *res
= isl_union_map_add_map(*res
,
2181 isl_map_factor_domain(isl_map_copy(map
)));
2183 return *res
? isl_stat_ok
: isl_stat_error
;
2186 /* For each map in "umap" of the form [A -> B] -> [C -> D],
2187 * construct the map A -> C and collect the results.
2189 __isl_give isl_union_map
*isl_union_map_factor_domain(
2190 __isl_take isl_union_map
*umap
)
2192 return cond_un_op(umap
, &factor_domain_entry
);
2195 /* If "map" is of the form [A -> B] -> [C -> D], then add B -> D to "res".
2197 static isl_stat
factor_range_entry(void **entry
, void *user
)
2199 isl_map
*map
= *entry
;
2200 isl_union_map
**res
= user
;
2202 if (!isl_map_is_product(map
))
2205 *res
= isl_union_map_add_map(*res
,
2206 isl_map_factor_range(isl_map_copy(map
)));
2208 return *res
? isl_stat_ok
: isl_stat_error
;
2211 /* For each map in "umap" of the form [A -> B] -> [C -> D],
2212 * construct the map B -> D and collect the results.
2214 __isl_give isl_union_map
*isl_union_map_factor_range(
2215 __isl_take isl_union_map
*umap
)
2217 return cond_un_op(umap
, &factor_range_entry
);
2220 static isl_stat
unwrap_entry(void **entry
, void *user
)
2222 isl_set
*set
= *entry
;
2223 isl_union_set
**res
= user
;
2225 if (!isl_set_is_wrapping(set
))
2228 *res
= isl_union_map_add_map(*res
, isl_set_unwrap(isl_set_copy(set
)));
2233 __isl_give isl_union_map
*isl_union_set_unwrap(__isl_take isl_union_set
*uset
)
2235 return cond_un_op(uset
, &unwrap_entry
);
2238 static isl_stat
wrap_entry(void **entry
, void *user
)
2240 isl_map
*map
= *entry
;
2241 isl_union_set
**res
= user
;
2243 *res
= isl_union_set_add_set(*res
, isl_map_wrap(isl_map_copy(map
)));
2248 __isl_give isl_union_set
*isl_union_map_wrap(__isl_take isl_union_map
*umap
)
2250 return cond_un_op(umap
, &wrap_entry
);
2253 struct isl_union_map_is_subset_data
{
2254 isl_union_map
*umap2
;
2258 static isl_stat
is_subset_entry(void **entry
, void *user
)
2260 struct isl_union_map_is_subset_data
*data
= user
;
2262 struct isl_hash_table_entry
*entry2
;
2263 isl_map
*map
= *entry
;
2265 hash
= isl_space_get_hash(map
->dim
);
2266 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
2267 hash
, &has_dim
, map
->dim
, 0);
2269 int empty
= isl_map_is_empty(map
);
2271 return isl_stat_error
;
2274 data
->is_subset
= 0;
2275 return isl_stat_error
;
2278 data
->is_subset
= isl_map_is_subset(map
, entry2
->data
);
2279 if (data
->is_subset
< 0 || !data
->is_subset
)
2280 return isl_stat_error
;
2285 isl_bool
isl_union_map_is_subset(__isl_keep isl_union_map
*umap1
,
2286 __isl_keep isl_union_map
*umap2
)
2288 struct isl_union_map_is_subset_data data
= { NULL
, isl_bool_true
};
2290 umap1
= isl_union_map_copy(umap1
);
2291 umap2
= isl_union_map_copy(umap2
);
2292 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
2293 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
2295 if (!umap1
|| !umap2
)
2299 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
2300 &is_subset_entry
, &data
) < 0 &&
2304 isl_union_map_free(umap1
);
2305 isl_union_map_free(umap2
);
2307 return data
.is_subset
;
2309 isl_union_map_free(umap1
);
2310 isl_union_map_free(umap2
);
2311 return isl_bool_error
;
2314 isl_bool
isl_union_set_is_subset(__isl_keep isl_union_set
*uset1
,
2315 __isl_keep isl_union_set
*uset2
)
2317 return isl_union_map_is_subset(uset1
, uset2
);
2320 isl_bool
isl_union_map_is_equal(__isl_keep isl_union_map
*umap1
,
2321 __isl_keep isl_union_map
*umap2
)
2325 if (!umap1
|| !umap2
)
2326 return isl_bool_error
;
2327 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
2328 if (is_subset
!= isl_bool_true
)
2330 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
2334 isl_bool
isl_union_set_is_equal(__isl_keep isl_union_set
*uset1
,
2335 __isl_keep isl_union_set
*uset2
)
2337 return isl_union_map_is_equal(uset1
, uset2
);
2340 isl_bool
isl_union_map_is_strict_subset(__isl_keep isl_union_map
*umap1
,
2341 __isl_keep isl_union_map
*umap2
)
2345 if (!umap1
|| !umap2
)
2346 return isl_bool_error
;
2347 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
2348 if (is_subset
!= isl_bool_true
)
2350 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
2351 if (is_subset
== isl_bool_error
)
2356 isl_bool
isl_union_set_is_strict_subset(__isl_keep isl_union_set
*uset1
,
2357 __isl_keep isl_union_set
*uset2
)
2359 return isl_union_map_is_strict_subset(uset1
, uset2
);
2362 /* Internal data structure for isl_union_map_is_disjoint.
2363 * umap2 is the union map with which we are comparing.
2364 * is_disjoint is initialized to 1 and is set to 0 as soon
2365 * as the union maps turn out not to be disjoint.
2367 struct isl_union_map_is_disjoint_data
{
2368 isl_union_map
*umap2
;
2369 isl_bool is_disjoint
;
2372 /* Check if "map" is disjoint from data->umap2 and abort
2373 * the search if it is not.
2375 static isl_stat
is_disjoint_entry(void **entry
, void *user
)
2377 struct isl_union_map_is_disjoint_data
*data
= user
;
2379 struct isl_hash_table_entry
*entry2
;
2380 isl_map
*map
= *entry
;
2382 hash
= isl_space_get_hash(map
->dim
);
2383 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
2384 hash
, &has_dim
, map
->dim
, 0);
2388 data
->is_disjoint
= isl_map_is_disjoint(map
, entry2
->data
);
2389 if (data
->is_disjoint
< 0 || !data
->is_disjoint
)
2390 return isl_stat_error
;
2395 /* Are "umap1" and "umap2" disjoint?
2397 isl_bool
isl_union_map_is_disjoint(__isl_keep isl_union_map
*umap1
,
2398 __isl_keep isl_union_map
*umap2
)
2400 struct isl_union_map_is_disjoint_data data
= { NULL
, isl_bool_true
};
2402 umap1
= isl_union_map_copy(umap1
);
2403 umap2
= isl_union_map_copy(umap2
);
2404 umap1
= isl_union_map_align_params(umap1
,
2405 isl_union_map_get_space(umap2
));
2406 umap2
= isl_union_map_align_params(umap2
,
2407 isl_union_map_get_space(umap1
));
2409 if (!umap1
|| !umap2
)
2413 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
2414 &is_disjoint_entry
, &data
) < 0 &&
2418 isl_union_map_free(umap1
);
2419 isl_union_map_free(umap2
);
2421 return data
.is_disjoint
;
2423 isl_union_map_free(umap1
);
2424 isl_union_map_free(umap2
);
2425 return isl_bool_error
;
2428 /* Are "uset1" and "uset2" disjoint?
2430 isl_bool
isl_union_set_is_disjoint(__isl_keep isl_union_set
*uset1
,
2431 __isl_keep isl_union_set
*uset2
)
2433 return isl_union_map_is_disjoint(uset1
, uset2
);
2436 static isl_stat
sample_entry(void **entry
, void *user
)
2438 isl_basic_map
**sample
= (isl_basic_map
**)user
;
2439 isl_map
*map
= *entry
;
2441 *sample
= isl_map_sample(isl_map_copy(map
));
2443 return isl_stat_error
;
2444 if (!isl_basic_map_plain_is_empty(*sample
))
2445 return isl_stat_error
;
2449 __isl_give isl_basic_map
*isl_union_map_sample(__isl_take isl_union_map
*umap
)
2451 isl_basic_map
*sample
= NULL
;
2456 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2457 &sample_entry
, &sample
) < 0 &&
2462 sample
= isl_basic_map_empty(isl_union_map_get_space(umap
));
2464 isl_union_map_free(umap
);
2468 isl_union_map_free(umap
);
2472 __isl_give isl_basic_set
*isl_union_set_sample(__isl_take isl_union_set
*uset
)
2474 return bset_from_bmap(isl_union_map_sample(uset
));
2477 /* Return an element in "uset" in the form of an isl_point.
2478 * Return a void isl_point if "uset" is empty.
2480 __isl_give isl_point
*isl_union_set_sample_point(__isl_take isl_union_set
*uset
)
2482 return isl_basic_set_sample_point(isl_union_set_sample(uset
));
2485 struct isl_forall_data
{
2487 isl_bool (*fn
)(__isl_keep isl_map
*map
);
2490 static isl_stat
forall_entry(void **entry
, void *user
)
2492 struct isl_forall_data
*data
= user
;
2493 isl_map
*map
= *entry
;
2495 data
->res
= data
->fn(map
);
2497 return isl_stat_error
;
2500 return isl_stat_error
;
2505 static isl_bool
union_map_forall(__isl_keep isl_union_map
*umap
,
2506 isl_bool (*fn
)(__isl_keep isl_map
*map
))
2508 struct isl_forall_data data
= { isl_bool_true
, fn
};
2511 return isl_bool_error
;
2513 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2514 &forall_entry
, &data
) < 0 && data
.res
)
2515 return isl_bool_error
;
2520 struct isl_forall_user_data
{
2522 isl_bool (*fn
)(__isl_keep isl_map
*map
, void *user
);
2526 static isl_stat
forall_user_entry(void **entry
, void *user
)
2528 struct isl_forall_user_data
*data
= user
;
2529 isl_map
*map
= *entry
;
2531 data
->res
= data
->fn(map
, data
->user
);
2533 return isl_stat_error
;
2536 return isl_stat_error
;
2541 /* Check if fn(map, user) returns true for all maps "map" in umap.
2543 static isl_bool
union_map_forall_user(__isl_keep isl_union_map
*umap
,
2544 isl_bool (*fn
)(__isl_keep isl_map
*map
, void *user
), void *user
)
2546 struct isl_forall_user_data data
= { isl_bool_true
, fn
, user
};
2549 return isl_bool_error
;
2551 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2552 &forall_user_entry
, &data
) < 0 && data
.res
)
2553 return isl_bool_error
;
2558 isl_bool
isl_union_map_is_empty(__isl_keep isl_union_map
*umap
)
2560 return union_map_forall(umap
, &isl_map_is_empty
);
2563 isl_bool
isl_union_set_is_empty(__isl_keep isl_union_set
*uset
)
2565 return isl_union_map_is_empty(uset
);
2568 static isl_bool
is_subset_of_identity(__isl_keep isl_map
*map
)
2575 return isl_bool_error
;
2577 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
2578 map
->dim
, isl_dim_out
))
2579 return isl_bool_false
;
2581 dim
= isl_map_get_space(map
);
2582 id
= isl_map_identity(dim
);
2584 is_subset
= isl_map_is_subset(map
, id
);
2591 /* Given an isl_union_map that consists of a single map, check
2592 * if it is single-valued.
2594 static isl_bool
single_map_is_single_valued(__isl_keep isl_union_map
*umap
)
2599 umap
= isl_union_map_copy(umap
);
2600 map
= isl_map_from_union_map(umap
);
2601 sv
= isl_map_is_single_valued(map
);
2607 /* Internal data structure for single_valued_on_domain.
2609 * "umap" is the union map to be tested.
2610 * "sv" is set to 1 as long as "umap" may still be single-valued.
2612 struct isl_union_map_is_sv_data
{
2613 isl_union_map
*umap
;
2617 /* Check if the data->umap is single-valued on "set".
2619 * If data->umap consists of a single map on "set", then test it
2622 * Otherwise, compute
2626 * check if the result is a subset of the identity mapping and
2627 * store the result in data->sv.
2629 * Terminate as soon as data->umap has been determined not to
2632 static isl_stat
single_valued_on_domain(__isl_take isl_set
*set
, void *user
)
2634 struct isl_union_map_is_sv_data
*data
= user
;
2635 isl_union_map
*umap
, *test
;
2637 umap
= isl_union_map_copy(data
->umap
);
2638 umap
= isl_union_map_intersect_domain(umap
,
2639 isl_union_set_from_set(set
));
2641 if (isl_union_map_n_map(umap
) == 1) {
2642 data
->sv
= single_map_is_single_valued(umap
);
2643 isl_union_map_free(umap
);
2645 test
= isl_union_map_reverse(isl_union_map_copy(umap
));
2646 test
= isl_union_map_apply_range(test
, umap
);
2648 data
->sv
= union_map_forall(test
, &is_subset_of_identity
);
2650 isl_union_map_free(test
);
2653 if (data
->sv
< 0 || !data
->sv
)
2654 return isl_stat_error
;
2658 /* Check if the given map is single-valued.
2660 * If the union map consists of a single map, then test it as an isl_map.
2661 * Otherwise, check if the union map is single-valued on each of its
2664 isl_bool
isl_union_map_is_single_valued(__isl_keep isl_union_map
*umap
)
2666 isl_union_map
*universe
;
2667 isl_union_set
*domain
;
2668 struct isl_union_map_is_sv_data data
;
2670 if (isl_union_map_n_map(umap
) == 1)
2671 return single_map_is_single_valued(umap
);
2673 universe
= isl_union_map_universe(isl_union_map_copy(umap
));
2674 domain
= isl_union_map_domain(universe
);
2676 data
.sv
= isl_bool_true
;
2678 if (isl_union_set_foreach_set(domain
,
2679 &single_valued_on_domain
, &data
) < 0 && data
.sv
)
2680 data
.sv
= isl_bool_error
;
2681 isl_union_set_free(domain
);
2686 isl_bool
isl_union_map_is_injective(__isl_keep isl_union_map
*umap
)
2690 umap
= isl_union_map_copy(umap
);
2691 umap
= isl_union_map_reverse(umap
);
2692 in
= isl_union_map_is_single_valued(umap
);
2693 isl_union_map_free(umap
);
2698 /* Is "map" obviously not an identity relation because
2699 * it maps elements from one space to another space?
2700 * Update *non_identity accordingly.
2702 * In particular, if the domain and range spaces are the same,
2703 * then the map is not considered to obviously not be an identity relation.
2704 * Otherwise, the map is considered to obviously not be an identity relation
2705 * if it is is non-empty.
2707 * If "map" is determined to obviously not be an identity relation,
2708 * then the search is aborted.
2710 static isl_stat
map_plain_is_not_identity(__isl_take isl_map
*map
, void *user
)
2712 isl_bool
*non_identity
= user
;
2716 space
= isl_map_get_space(map
);
2717 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
2718 if (equal
>= 0 && !equal
)
2719 *non_identity
= isl_bool_not(isl_map_is_empty(map
));
2721 *non_identity
= isl_bool_not(equal
);
2722 isl_space_free(space
);
2725 if (*non_identity
< 0 || *non_identity
)
2726 return isl_stat_error
;
2731 /* Is "umap" obviously not an identity relation because
2732 * it maps elements from one space to another space?
2734 * As soon as a map has been found that maps elements to a different space,
2735 * non_identity is changed and the search is aborted.
2737 static isl_bool
isl_union_map_plain_is_not_identity(
2738 __isl_keep isl_union_map
*umap
)
2740 isl_bool non_identity
;
2742 non_identity
= isl_bool_false
;
2743 if (isl_union_map_foreach_map(umap
, &map_plain_is_not_identity
,
2744 &non_identity
) < 0 &&
2745 non_identity
== isl_bool_false
)
2746 return isl_bool_error
;
2748 return non_identity
;
2751 /* Does "map" only map elements to themselves?
2752 * Update *identity accordingly.
2754 * If "map" is determined not to be an identity relation,
2755 * then the search is aborted.
2757 static isl_stat
map_is_identity(__isl_take isl_map
*map
, void *user
)
2759 isl_bool
*identity
= user
;
2761 *identity
= isl_map_is_identity(map
);
2764 if (*identity
< 0 || !*identity
)
2765 return isl_stat_error
;
2770 /* Does "umap" only map elements to themselves?
2772 * First check if there are any maps that map elements to different spaces.
2773 * If not, then check that all the maps (between identical spaces)
2774 * are identity relations.
2776 isl_bool
isl_union_map_is_identity(__isl_keep isl_union_map
*umap
)
2778 isl_bool non_identity
;
2781 non_identity
= isl_union_map_plain_is_not_identity(umap
);
2782 if (non_identity
< 0 || non_identity
)
2783 return isl_bool_not(non_identity
);
2785 identity
= isl_bool_true
;
2786 if (isl_union_map_foreach_map(umap
, &map_is_identity
, &identity
) < 0 &&
2787 identity
== isl_bool_true
)
2788 return isl_bool_error
;
2793 /* Represents a map that has a fixed value (v) for one of its
2795 * The map in this structure is not reference counted, so it
2796 * is only valid while the isl_union_map from which it was
2797 * obtained is still alive.
2799 struct isl_fixed_map
{
2804 static struct isl_fixed_map
*alloc_isl_fixed_map_array(isl_ctx
*ctx
,
2808 struct isl_fixed_map
*v
;
2810 v
= isl_calloc_array(ctx
, struct isl_fixed_map
, n
);
2813 for (i
= 0; i
< n
; ++i
)
2814 isl_int_init(v
[i
].v
);
2818 static void free_isl_fixed_map_array(struct isl_fixed_map
*v
, int n
)
2824 for (i
= 0; i
< n
; ++i
)
2825 isl_int_clear(v
[i
].v
);
2829 /* Compare the "v" field of two isl_fixed_map structs.
2831 static int qsort_fixed_map_cmp(const void *p1
, const void *p2
)
2833 const struct isl_fixed_map
*e1
= (const struct isl_fixed_map
*) p1
;
2834 const struct isl_fixed_map
*e2
= (const struct isl_fixed_map
*) p2
;
2836 return isl_int_cmp(e1
->v
, e2
->v
);
2839 /* Internal data structure used while checking whether all maps
2840 * in a union_map have a fixed value for a given output dimension.
2841 * v is the list of maps, with the fixed value for the dimension
2842 * n is the number of maps considered so far
2843 * pos is the output dimension under investigation
2845 struct isl_fixed_dim_data
{
2846 struct isl_fixed_map
*v
;
2851 static isl_bool
fixed_at_pos(__isl_keep isl_map
*map
, void *user
)
2853 struct isl_fixed_dim_data
*data
= user
;
2855 data
->v
[data
->n
].map
= map
;
2856 return isl_map_plain_is_fixed(map
, isl_dim_out
, data
->pos
,
2857 &data
->v
[data
->n
++].v
);
2860 static isl_bool
plain_injective_on_range(__isl_take isl_union_map
*umap
,
2861 int first
, int n_range
);
2863 /* Given a list of the maps, with their fixed values at output dimension "pos",
2864 * check whether the ranges of the maps form an obvious partition.
2866 * We first sort the maps according to their fixed values.
2867 * If all maps have a different value, then we know the ranges form
2869 * Otherwise, we collect the maps with the same fixed value and
2870 * check whether each such collection is obviously injective
2871 * based on later dimensions.
2873 static int separates(struct isl_fixed_map
*v
, int n
,
2874 __isl_take isl_space
*dim
, int pos
, int n_range
)
2881 qsort(v
, n
, sizeof(*v
), &qsort_fixed_map_cmp
);
2883 for (i
= 0; i
+ 1 < n
; ++i
) {
2885 isl_union_map
*part
;
2888 for (j
= i
+ 1; j
< n
; ++j
)
2889 if (isl_int_ne(v
[i
].v
, v
[j
].v
))
2895 part
= isl_union_map_alloc(isl_space_copy(dim
), j
- i
);
2896 for (k
= i
; k
< j
; ++k
)
2897 part
= isl_union_map_add_map(part
,
2898 isl_map_copy(v
[k
].map
));
2900 injective
= plain_injective_on_range(part
, pos
+ 1, n_range
);
2909 isl_space_free(dim
);
2910 free_isl_fixed_map_array(v
, n
);
2913 isl_space_free(dim
);
2914 free_isl_fixed_map_array(v
, n
);
2918 /* Check whether the maps in umap have obviously distinct ranges.
2919 * In particular, check for an output dimension in the range
2920 * [first,n_range) for which all maps have a fixed value
2921 * and then check if these values, possibly along with fixed values
2922 * at later dimensions, entail distinct ranges.
2924 static isl_bool
plain_injective_on_range(__isl_take isl_union_map
*umap
,
2925 int first
, int n_range
)
2929 struct isl_fixed_dim_data data
= { NULL
};
2931 ctx
= isl_union_map_get_ctx(umap
);
2933 n
= isl_union_map_n_map(umap
);
2938 isl_union_map_free(umap
);
2939 return isl_bool_true
;
2942 if (first
>= n_range
) {
2943 isl_union_map_free(umap
);
2944 return isl_bool_false
;
2947 data
.v
= alloc_isl_fixed_map_array(ctx
, n
);
2951 for (data
.pos
= first
; data
.pos
< n_range
; ++data
.pos
) {
2957 fixed
= union_map_forall_user(umap
, &fixed_at_pos
, &data
);
2962 dim
= isl_union_map_get_space(umap
);
2963 injective
= separates(data
.v
, n
, dim
, data
.pos
, n_range
);
2964 isl_union_map_free(umap
);
2968 free_isl_fixed_map_array(data
.v
, n
);
2969 isl_union_map_free(umap
);
2971 return isl_bool_false
;
2973 free_isl_fixed_map_array(data
.v
, n
);
2974 isl_union_map_free(umap
);
2975 return isl_bool_error
;
2978 /* Check whether the maps in umap that map to subsets of "ran"
2979 * have obviously distinct ranges.
2981 static isl_bool
plain_injective_on_range_wrap(__isl_keep isl_set
*ran
,
2984 isl_union_map
*umap
= user
;
2986 umap
= isl_union_map_copy(umap
);
2987 umap
= isl_union_map_intersect_range(umap
,
2988 isl_union_set_from_set(isl_set_copy(ran
)));
2989 return plain_injective_on_range(umap
, 0, isl_set_dim(ran
, isl_dim_set
));
2992 /* Check if the given union_map is obviously injective.
2994 * In particular, we first check if all individual maps are obviously
2995 * injective and then check if all the ranges of these maps are
2996 * obviously disjoint.
2998 isl_bool
isl_union_map_plain_is_injective(__isl_keep isl_union_map
*umap
)
3001 isl_union_map
*univ
;
3004 in
= union_map_forall(umap
, &isl_map_plain_is_injective
);
3006 return isl_bool_error
;
3008 return isl_bool_false
;
3010 univ
= isl_union_map_universe(isl_union_map_copy(umap
));
3011 ran
= isl_union_map_range(univ
);
3013 in
= union_map_forall_user(ran
, &plain_injective_on_range_wrap
, umap
);
3015 isl_union_set_free(ran
);
3020 isl_bool
isl_union_map_is_bijective(__isl_keep isl_union_map
*umap
)
3024 sv
= isl_union_map_is_single_valued(umap
);
3028 return isl_union_map_is_injective(umap
);
3031 static isl_stat
zip_entry(void **entry
, void *user
)
3033 isl_map
*map
= *entry
;
3034 isl_union_map
**res
= user
;
3036 if (!isl_map_can_zip(map
))
3039 *res
= isl_union_map_add_map(*res
, isl_map_zip(isl_map_copy(map
)));
3044 __isl_give isl_union_map
*isl_union_map_zip(__isl_take isl_union_map
*umap
)
3046 return cond_un_op(umap
, &zip_entry
);
3049 static isl_stat
uncurry_entry(void **entry
, void *user
)
3051 isl_map
*map
= *entry
;
3052 isl_union_map
**res
= user
;
3054 if (!isl_map_can_uncurry(map
))
3057 *res
= isl_union_map_add_map(*res
, isl_map_uncurry(isl_map_copy(map
)));
3062 /* Given a union map, take the maps of the form A -> (B -> C) and
3063 * return the union of the corresponding maps (A -> B) -> C.
3065 __isl_give isl_union_map
*isl_union_map_uncurry(__isl_take isl_union_map
*umap
)
3067 return cond_un_op(umap
, &uncurry_entry
);
3070 static isl_stat
curry_entry(void **entry
, void *user
)
3072 isl_map
*map
= *entry
;
3073 isl_union_map
**res
= user
;
3075 if (!isl_map_can_curry(map
))
3078 *res
= isl_union_map_add_map(*res
, isl_map_curry(isl_map_copy(map
)));
3083 /* Given a union map, take the maps of the form (A -> B) -> C and
3084 * return the union of the corresponding maps A -> (B -> C).
3086 __isl_give isl_union_map
*isl_union_map_curry(__isl_take isl_union_map
*umap
)
3088 return cond_un_op(umap
, &curry_entry
);
3091 /* If *entry is of the form A -> ((B -> C) -> D), then apply
3092 * isl_map_range_curry to it and add the result to *res.
3094 static isl_stat
range_curry_entry(void **entry
, void *user
)
3096 isl_map
*map
= *entry
;
3097 isl_union_map
**res
= user
;
3099 if (!isl_map_can_range_curry(map
))
3102 map
= isl_map_range_curry(isl_map_copy(map
));
3103 *res
= isl_union_map_add_map(*res
, map
);
3108 /* Given a union map, take the maps of the form A -> ((B -> C) -> D) and
3109 * return the union of the corresponding maps A -> (B -> (C -> D)).
3111 __isl_give isl_union_map
*isl_union_map_range_curry(
3112 __isl_take isl_union_map
*umap
)
3114 return cond_un_op(umap
, &range_curry_entry
);
3117 static isl_stat
lift_entry(void **entry
, void *user
)
3119 isl_set
*set
= *entry
;
3120 isl_union_set
**res
= user
;
3122 *res
= isl_union_set_add_set(*res
, isl_set_lift(isl_set_copy(set
)));
3127 __isl_give isl_union_set
*isl_union_set_lift(__isl_take isl_union_set
*uset
)
3129 return cond_un_op(uset
, &lift_entry
);
3132 static isl_stat
coefficients_entry(void **entry
, void *user
)
3134 isl_set
*set
= *entry
;
3135 isl_union_set
**res
= user
;
3137 set
= isl_set_copy(set
);
3138 set
= isl_set_from_basic_set(isl_set_coefficients(set
));
3139 *res
= isl_union_set_add_set(*res
, set
);
3144 __isl_give isl_union_set
*isl_union_set_coefficients(
3145 __isl_take isl_union_set
*uset
)
3154 ctx
= isl_union_set_get_ctx(uset
);
3155 dim
= isl_space_set_alloc(ctx
, 0, 0);
3156 res
= isl_union_map_alloc(dim
, uset
->table
.n
);
3157 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
3158 &coefficients_entry
, &res
) < 0)
3161 isl_union_set_free(uset
);
3164 isl_union_set_free(uset
);
3165 isl_union_set_free(res
);
3169 static isl_stat
solutions_entry(void **entry
, void *user
)
3171 isl_set
*set
= *entry
;
3172 isl_union_set
**res
= user
;
3174 set
= isl_set_copy(set
);
3175 set
= isl_set_from_basic_set(isl_set_solutions(set
));
3177 *res
= isl_union_set_from_set(set
);
3179 *res
= isl_union_set_add_set(*res
, set
);
3182 return isl_stat_error
;
3187 __isl_give isl_union_set
*isl_union_set_solutions(
3188 __isl_take isl_union_set
*uset
)
3190 isl_union_set
*res
= NULL
;
3195 if (uset
->table
.n
== 0) {
3196 res
= isl_union_set_empty(isl_union_set_get_space(uset
));
3197 isl_union_set_free(uset
);
3201 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
3202 &solutions_entry
, &res
) < 0)
3205 isl_union_set_free(uset
);
3208 isl_union_set_free(uset
);
3209 isl_union_set_free(res
);
3213 /* Is the domain space of "map" equal to "space"?
3215 static int domain_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
3217 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
3218 space
, isl_dim_out
);
3221 /* Is the range space of "map" equal to "space"?
3223 static int range_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
3225 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
3226 space
, isl_dim_out
);
3229 /* Is the set space of "map" equal to "space"?
3231 static int set_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
3233 return isl_space_tuple_is_equal(map
->dim
, isl_dim_set
,
3234 space
, isl_dim_out
);
3237 /* Internal data structure for preimage_pw_multi_aff.
3239 * "pma" is the function under which the preimage should be taken.
3240 * "space" is the space of "pma".
3241 * "res" collects the results.
3242 * "fn" computes the preimage for a given map.
3243 * "match" returns true if "fn" can be called.
3245 struct isl_union_map_preimage_data
{
3247 isl_pw_multi_aff
*pma
;
3249 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
);
3250 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3251 __isl_take isl_pw_multi_aff
*pma
);
3254 /* Call data->fn to compute the preimage of the domain or range of *entry
3255 * under the function represented by data->pma, provided the domain/range
3256 * space of *entry matches the target space of data->pma
3257 * (as given by data->match), and add the result to data->res.
3259 static isl_stat
preimage_entry(void **entry
, void *user
)
3262 isl_map
*map
= *entry
;
3263 struct isl_union_map_preimage_data
*data
= user
;
3266 m
= data
->match(map
, data
->space
);
3268 return isl_stat_error
;
3272 map
= isl_map_copy(map
);
3273 map
= data
->fn(map
, isl_pw_multi_aff_copy(data
->pma
));
3275 empty
= isl_map_is_empty(map
);
3276 if (empty
< 0 || empty
) {
3278 return empty
< 0 ? isl_stat_error
: isl_stat_ok
;
3281 data
->res
= isl_union_map_add_map(data
->res
, map
);
3286 /* Compute the preimage of the domain or range of "umap" under the function
3287 * represented by "pma".
3288 * In other words, plug in "pma" in the domain or range of "umap".
3289 * The function "fn" performs the actual preimage computation on a map,
3290 * while "match" determines to which maps the function should be applied.
3292 static __isl_give isl_union_map
*preimage_pw_multi_aff(
3293 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
,
3294 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
),
3295 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3296 __isl_take isl_pw_multi_aff
*pma
))
3300 struct isl_union_map_preimage_data data
;
3302 umap
= isl_union_map_align_params(umap
,
3303 isl_pw_multi_aff_get_space(pma
));
3304 pma
= isl_pw_multi_aff_align_params(pma
, isl_union_map_get_space(umap
));
3309 ctx
= isl_union_map_get_ctx(umap
);
3310 space
= isl_union_map_get_space(umap
);
3311 data
.space
= isl_pw_multi_aff_get_space(pma
);
3313 data
.res
= isl_union_map_alloc(space
, umap
->table
.n
);
3316 if (isl_hash_table_foreach(ctx
, &umap
->table
, &preimage_entry
,
3318 data
.res
= isl_union_map_free(data
.res
);
3320 isl_space_free(data
.space
);
3321 isl_union_map_free(umap
);
3322 isl_pw_multi_aff_free(pma
);
3325 isl_union_map_free(umap
);
3326 isl_pw_multi_aff_free(pma
);
3330 /* Compute the preimage of the domain of "umap" under the function
3331 * represented by "pma".
3332 * In other words, plug in "pma" in the domain of "umap".
3333 * The result contains maps that live in the same spaces as the maps of "umap"
3334 * with domain space equal to the target space of "pma",
3335 * except that the domain has been replaced by the domain space of "pma".
3337 __isl_give isl_union_map
*isl_union_map_preimage_domain_pw_multi_aff(
3338 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
)
3340 return preimage_pw_multi_aff(umap
, pma
, &domain_match
,
3341 &isl_map_preimage_domain_pw_multi_aff
);
3344 /* Compute the preimage of the range of "umap" under the function
3345 * represented by "pma".
3346 * In other words, plug in "pma" in the range of "umap".
3347 * The result contains maps that live in the same spaces as the maps of "umap"
3348 * with range space equal to the target space of "pma",
3349 * except that the range has been replaced by the domain space of "pma".
3351 __isl_give isl_union_map
*isl_union_map_preimage_range_pw_multi_aff(
3352 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
)
3354 return preimage_pw_multi_aff(umap
, pma
, &range_match
,
3355 &isl_map_preimage_range_pw_multi_aff
);
3358 /* Compute the preimage of "uset" under the function represented by "pma".
3359 * In other words, plug in "pma" in "uset".
3360 * The result contains sets that live in the same spaces as the sets of "uset"
3361 * with space equal to the target space of "pma",
3362 * except that the space has been replaced by the domain space of "pma".
3364 __isl_give isl_union_set
*isl_union_set_preimage_pw_multi_aff(
3365 __isl_take isl_union_set
*uset
, __isl_take isl_pw_multi_aff
*pma
)
3367 return preimage_pw_multi_aff(uset
, pma
, &set_match
,
3368 &isl_set_preimage_pw_multi_aff
);
3371 /* Compute the preimage of the domain of "umap" under the function
3372 * represented by "ma".
3373 * In other words, plug in "ma" in the domain of "umap".
3374 * The result contains maps that live in the same spaces as the maps of "umap"
3375 * with domain space equal to the target space of "ma",
3376 * except that the domain has been replaced by the domain space of "ma".
3378 __isl_give isl_union_map
*isl_union_map_preimage_domain_multi_aff(
3379 __isl_take isl_union_map
*umap
, __isl_take isl_multi_aff
*ma
)
3381 return isl_union_map_preimage_domain_pw_multi_aff(umap
,
3382 isl_pw_multi_aff_from_multi_aff(ma
));
3385 /* Compute the preimage of the range of "umap" under the function
3386 * represented by "ma".
3387 * In other words, plug in "ma" in the range of "umap".
3388 * The result contains maps that live in the same spaces as the maps of "umap"
3389 * with range space equal to the target space of "ma",
3390 * except that the range has been replaced by the domain space of "ma".
3392 __isl_give isl_union_map
*isl_union_map_preimage_range_multi_aff(
3393 __isl_take isl_union_map
*umap
, __isl_take isl_multi_aff
*ma
)
3395 return isl_union_map_preimage_range_pw_multi_aff(umap
,
3396 isl_pw_multi_aff_from_multi_aff(ma
));
3399 /* Compute the preimage of "uset" under the function represented by "ma".
3400 * In other words, plug in "ma" in "uset".
3401 * The result contains sets that live in the same spaces as the sets of "uset"
3402 * with space equal to the target space of "ma",
3403 * except that the space has been replaced by the domain space of "ma".
3405 __isl_give isl_union_map
*isl_union_set_preimage_multi_aff(
3406 __isl_take isl_union_set
*uset
, __isl_take isl_multi_aff
*ma
)
3408 return isl_union_set_preimage_pw_multi_aff(uset
,
3409 isl_pw_multi_aff_from_multi_aff(ma
));
3412 /* Internal data structure for preimage_multi_pw_aff.
3414 * "mpa" is the function under which the preimage should be taken.
3415 * "space" is the space of "mpa".
3416 * "res" collects the results.
3417 * "fn" computes the preimage for a given map.
3418 * "match" returns true if "fn" can be called.
3420 struct isl_union_map_preimage_mpa_data
{
3422 isl_multi_pw_aff
*mpa
;
3424 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
);
3425 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3426 __isl_take isl_multi_pw_aff
*mpa
);
3429 /* Call data->fn to compute the preimage of the domain or range of *entry
3430 * under the function represented by data->mpa, provided the domain/range
3431 * space of *entry matches the target space of data->mpa
3432 * (as given by data->match), and add the result to data->res.
3434 static isl_stat
preimage_mpa_entry(void **entry
, void *user
)
3437 isl_map
*map
= *entry
;
3438 struct isl_union_map_preimage_mpa_data
*data
= user
;
3441 m
= data
->match(map
, data
->space
);
3443 return isl_stat_error
;
3447 map
= isl_map_copy(map
);
3448 map
= data
->fn(map
, isl_multi_pw_aff_copy(data
->mpa
));
3450 empty
= isl_map_is_empty(map
);
3451 if (empty
< 0 || empty
) {
3453 return empty
< 0 ? isl_stat_error
: isl_stat_ok
;
3456 data
->res
= isl_union_map_add_map(data
->res
, map
);
3461 /* Compute the preimage of the domain or range of "umap" under the function
3462 * represented by "mpa".
3463 * In other words, plug in "mpa" in the domain or range of "umap".
3464 * The function "fn" performs the actual preimage computation on a map,
3465 * while "match" determines to which maps the function should be applied.
3467 static __isl_give isl_union_map
*preimage_multi_pw_aff(
3468 __isl_take isl_union_map
*umap
, __isl_take isl_multi_pw_aff
*mpa
,
3469 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
),
3470 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3471 __isl_take isl_multi_pw_aff
*mpa
))
3475 struct isl_union_map_preimage_mpa_data data
;
3477 umap
= isl_union_map_align_params(umap
,
3478 isl_multi_pw_aff_get_space(mpa
));
3479 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_union_map_get_space(umap
));
3484 ctx
= isl_union_map_get_ctx(umap
);
3485 space
= isl_union_map_get_space(umap
);
3486 data
.space
= isl_multi_pw_aff_get_space(mpa
);
3488 data
.res
= isl_union_map_alloc(space
, umap
->table
.n
);
3491 if (isl_hash_table_foreach(ctx
, &umap
->table
, &preimage_mpa_entry
,
3493 data
.res
= isl_union_map_free(data
.res
);
3495 isl_space_free(data
.space
);
3496 isl_union_map_free(umap
);
3497 isl_multi_pw_aff_free(mpa
);
3500 isl_union_map_free(umap
);
3501 isl_multi_pw_aff_free(mpa
);
3505 /* Compute the preimage of the domain of "umap" under the function
3506 * represented by "mpa".
3507 * In other words, plug in "mpa" in the domain of "umap".
3508 * The result contains maps that live in the same spaces as the maps of "umap"
3509 * with domain space equal to the target space of "mpa",
3510 * except that the domain has been replaced by the domain space of "mpa".
3512 __isl_give isl_union_map
*isl_union_map_preimage_domain_multi_pw_aff(
3513 __isl_take isl_union_map
*umap
, __isl_take isl_multi_pw_aff
*mpa
)
3515 return preimage_multi_pw_aff(umap
, mpa
, &domain_match
,
3516 &isl_map_preimage_domain_multi_pw_aff
);
3519 /* Internal data structure for preimage_upma.
3521 * "umap" is the map of which the preimage should be computed.
3522 * "res" collects the results.
3523 * "fn" computes the preimage for a given piecewise multi-affine function.
3525 struct isl_union_map_preimage_upma_data
{
3526 isl_union_map
*umap
;
3528 __isl_give isl_union_map
*(*fn
)(__isl_take isl_union_map
*umap
,
3529 __isl_take isl_pw_multi_aff
*pma
);
3532 /* Call data->fn to compute the preimage of the domain or range of data->umap
3533 * under the function represented by pma and add the result to data->res.
3535 static isl_stat
preimage_upma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
3537 struct isl_union_map_preimage_upma_data
*data
= user
;
3538 isl_union_map
*umap
;
3540 umap
= isl_union_map_copy(data
->umap
);
3541 umap
= data
->fn(umap
, pma
);
3542 data
->res
= isl_union_map_union(data
->res
, umap
);
3544 return data
->res
? isl_stat_ok
: isl_stat_error
;
3547 /* Compute the preimage of the domain or range of "umap" under the function
3548 * represented by "upma".
3549 * In other words, plug in "upma" in the domain or range of "umap".
3550 * The function "fn" performs the actual preimage computation
3551 * on a piecewise multi-affine function.
3553 static __isl_give isl_union_map
*preimage_union_pw_multi_aff(
3554 __isl_take isl_union_map
*umap
,
3555 __isl_take isl_union_pw_multi_aff
*upma
,
3556 __isl_give isl_union_map
*(*fn
)(__isl_take isl_union_map
*umap
,
3557 __isl_take isl_pw_multi_aff
*pma
))
3559 struct isl_union_map_preimage_upma_data data
;
3562 data
.res
= isl_union_map_empty(isl_union_map_get_space(umap
));
3564 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
3565 &preimage_upma
, &data
) < 0)
3566 data
.res
= isl_union_map_free(data
.res
);
3568 isl_union_map_free(umap
);
3569 isl_union_pw_multi_aff_free(upma
);
3574 /* Compute the preimage of the domain of "umap" under the function
3575 * represented by "upma".
3576 * In other words, plug in "upma" in the domain of "umap".
3577 * The result contains maps that live in the same spaces as the maps of "umap"
3578 * with domain space equal to one of the target spaces of "upma",
3579 * except that the domain has been replaced by one of the the domain spaces that
3580 * corresponds to that target space of "upma".
3582 __isl_give isl_union_map
*isl_union_map_preimage_domain_union_pw_multi_aff(
3583 __isl_take isl_union_map
*umap
,
3584 __isl_take isl_union_pw_multi_aff
*upma
)
3586 return preimage_union_pw_multi_aff(umap
, upma
,
3587 &isl_union_map_preimage_domain_pw_multi_aff
);
3590 /* Compute the preimage of the range of "umap" under the function
3591 * represented by "upma".
3592 * In other words, plug in "upma" in the range of "umap".
3593 * The result contains maps that live in the same spaces as the maps of "umap"
3594 * with range space equal to one of the target spaces of "upma",
3595 * except that the range has been replaced by one of the the domain spaces that
3596 * corresponds to that target space of "upma".
3598 __isl_give isl_union_map
*isl_union_map_preimage_range_union_pw_multi_aff(
3599 __isl_take isl_union_map
*umap
,
3600 __isl_take isl_union_pw_multi_aff
*upma
)
3602 return preimage_union_pw_multi_aff(umap
, upma
,
3603 &isl_union_map_preimage_range_pw_multi_aff
);
3606 /* Compute the preimage of "uset" under the function represented by "upma".
3607 * In other words, plug in "upma" in the range of "uset".
3608 * The result contains sets that live in the same spaces as the sets of "uset"
3609 * with space equal to one of the target spaces of "upma",
3610 * except that the space has been replaced by one of the the domain spaces that
3611 * corresponds to that target space of "upma".
3613 __isl_give isl_union_set
*isl_union_set_preimage_union_pw_multi_aff(
3614 __isl_take isl_union_set
*uset
,
3615 __isl_take isl_union_pw_multi_aff
*upma
)
3617 return preimage_union_pw_multi_aff(uset
, upma
,
3618 &isl_union_set_preimage_pw_multi_aff
);
3621 /* Reset the user pointer on all identifiers of parameters and tuples
3622 * of the space of *entry.
3624 static isl_stat
reset_user(void **entry
, void *user
)
3626 isl_map
**map
= (isl_map
**)entry
;
3628 *map
= isl_map_reset_user(*map
);
3630 return *map
? isl_stat_ok
: isl_stat_error
;
3633 /* Reset the user pointer on all identifiers of parameters and tuples
3634 * of the spaces of "umap".
3636 __isl_give isl_union_map
*isl_union_map_reset_user(
3637 __isl_take isl_union_map
*umap
)
3639 umap
= isl_union_map_cow(umap
);
3642 umap
->dim
= isl_space_reset_user(umap
->dim
);
3644 return isl_union_map_free(umap
);
3645 umap
= un_op(umap
, &reset_user
);
3650 /* Reset the user pointer on all identifiers of parameters and tuples
3651 * of the spaces of "uset".
3653 __isl_give isl_union_set
*isl_union_set_reset_user(
3654 __isl_take isl_union_set
*uset
)
3656 return isl_union_map_reset_user(uset
);
3659 /* Internal data structure for isl_union_map_project_out.
3660 * "type", "first" and "n" are the arguments for the isl_map_project_out
3662 * "res" collects the results.
3664 struct isl_union_map_project_out_data
{
3665 enum isl_dim_type type
;
3672 /* Turn the data->n dimensions of type data->type, starting at data->first
3673 * into existentially quantified variables and add the result to data->res.
3675 static isl_stat
project_out(__isl_take isl_map
*map
, void *user
)
3677 struct isl_union_map_project_out_data
*data
= user
;
3679 map
= isl_map_project_out(map
, data
->type
, data
->first
, data
->n
);
3680 data
->res
= isl_union_map_add_map(data
->res
, map
);
3685 /* Turn the "n" dimensions of type "type", starting at "first"
3686 * into existentially quantified variables.
3687 * Since the space of an isl_union_map only contains parameters,
3688 * type is required to be equal to isl_dim_param.
3690 __isl_give isl_union_map
*isl_union_map_project_out(
3691 __isl_take isl_union_map
*umap
,
3692 enum isl_dim_type type
, unsigned first
, unsigned n
)
3695 struct isl_union_map_project_out_data data
= { type
, first
, n
};
3700 if (type
!= isl_dim_param
)
3701 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
3702 "can only project out parameters",
3703 return isl_union_map_free(umap
));
3705 space
= isl_union_map_get_space(umap
);
3706 space
= isl_space_drop_dims(space
, type
, first
, n
);
3707 data
.res
= isl_union_map_empty(space
);
3708 if (isl_union_map_foreach_map(umap
, &project_out
, &data
) < 0)
3709 data
.res
= isl_union_map_free(data
.res
);
3711 isl_union_map_free(umap
);
3716 /* Turn the "n" dimensions of type "type", starting at "first"
3717 * into existentially quantified variables.
3718 * Since the space of an isl_union_set only contains parameters,
3719 * "type" is required to be equal to isl_dim_param.
3721 __isl_give isl_union_set
*isl_union_set_project_out(
3722 __isl_take isl_union_set
*uset
,
3723 enum isl_dim_type type
, unsigned first
, unsigned n
)
3725 return isl_union_map_project_out(uset
, type
, first
, n
);
3728 /* Internal data structure for isl_union_map_involves_dims.
3729 * "first" and "n" are the arguments for the isl_map_involves_dims calls.
3731 struct isl_union_map_involves_dims_data
{
3736 /* Does "map" _not_ involve the data->n parameters starting at data->first?
3738 static isl_bool
map_excludes(__isl_keep isl_map
*map
, void *user
)
3740 struct isl_union_map_involves_dims_data
*data
= user
;
3743 involves
= isl_map_involves_dims(map
,
3744 isl_dim_param
, data
->first
, data
->n
);
3746 return isl_bool_error
;
3750 /* Does "umap" involve any of the n parameters starting at first?
3751 * "type" is required to be set to isl_dim_param.
3753 * "umap" involves any of those parameters if any of its maps
3754 * involve the parameters. In other words, "umap" does not
3755 * involve any of the parameters if all its maps to not
3756 * involve the parameters.
3758 isl_bool
isl_union_map_involves_dims(__isl_keep isl_union_map
*umap
,
3759 enum isl_dim_type type
, unsigned first
, unsigned n
)
3761 struct isl_union_map_involves_dims_data data
= { first
, n
};
3764 if (type
!= isl_dim_param
)
3765 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
3766 "can only reference parameters", return isl_bool_error
);
3768 excludes
= union_map_forall_user(umap
, &map_excludes
, &data
);
3771 return isl_bool_error
;
3776 /* Internal data structure for isl_union_map_reset_range_space.
3777 * "range" is the space from which to set the range space.
3778 * "res" collects the results.
3780 struct isl_union_map_reset_range_space_data
{
3785 /* Replace the range space of "map" by the range space of data->range and
3786 * add the result to data->res.
3788 static isl_stat
reset_range_space(__isl_take isl_map
*map
, void *user
)
3790 struct isl_union_map_reset_range_space_data
*data
= user
;
3793 space
= isl_map_get_space(map
);
3794 space
= isl_space_domain(space
);
3795 space
= isl_space_extend_domain_with_range(space
,
3796 isl_space_copy(data
->range
));
3797 map
= isl_map_reset_space(map
, space
);
3798 data
->res
= isl_union_map_add_map(data
->res
, map
);
3800 return data
->res
? isl_stat_ok
: isl_stat_error
;
3803 /* Replace the range space of all the maps in "umap" by
3804 * the range space of "space".
3806 * This assumes that all maps have the same output dimension.
3807 * This function should therefore not be made publicly available.
3809 * Since the spaces of the maps change, so do their hash value.
3810 * We therefore need to create a new isl_union_map.
3812 __isl_give isl_union_map
*isl_union_map_reset_range_space(
3813 __isl_take isl_union_map
*umap
, __isl_take isl_space
*space
)
3815 struct isl_union_map_reset_range_space_data data
= { space
};
3817 data
.res
= isl_union_map_empty(isl_union_map_get_space(umap
));
3818 if (isl_union_map_foreach_map(umap
, &reset_range_space
, &data
) < 0)
3819 data
.res
= isl_union_map_free(data
.res
);
3821 isl_space_free(space
);
3822 isl_union_map_free(umap
);
3826 /* Internal data structure for isl_union_map_order_at_multi_union_pw_aff.
3827 * "mupa" is the function from which the isl_multi_pw_affs are extracted.
3828 * "order" is applied to the extracted isl_multi_pw_affs that correspond
3829 * to the domain and the range of each map.
3830 * "res" collects the results.
3832 struct isl_union_order_at_data
{
3833 isl_multi_union_pw_aff
*mupa
;
3834 __isl_give isl_map
*(*order
)(__isl_take isl_multi_pw_aff
*mpa1
,
3835 __isl_take isl_multi_pw_aff
*mpa2
);
3839 /* Intersect "map" with the result of applying data->order to
3840 * the functions in data->mupa that apply to the domain and the range
3841 * of "map" and add the result to data->res.
3843 static isl_stat
order_at(__isl_take isl_map
*map
, void *user
)
3845 struct isl_union_order_at_data
*data
= user
;
3847 isl_multi_pw_aff
*mpa1
, *mpa2
;
3850 space
= isl_space_domain(isl_map_get_space(map
));
3851 mpa1
= isl_multi_union_pw_aff_extract_multi_pw_aff(data
->mupa
, space
);
3852 space
= isl_space_range(isl_map_get_space(map
));
3853 mpa2
= isl_multi_union_pw_aff_extract_multi_pw_aff(data
->mupa
, space
);
3854 order
= data
->order(mpa1
, mpa2
);
3855 map
= isl_map_intersect(map
, order
);
3856 data
->res
= isl_union_map_add_map(data
->res
, map
);
3858 return data
->res
? isl_stat_ok
: isl_stat_error
;
3861 /* Intersect each map in "umap" with the result of calling "order"
3862 * on the functions is "mupa" that apply to the domain and the range
3865 static __isl_give isl_union_map
*isl_union_map_order_at_multi_union_pw_aff(
3866 __isl_take isl_union_map
*umap
, __isl_take isl_multi_union_pw_aff
*mupa
,
3867 __isl_give isl_map
*(*order
)(__isl_take isl_multi_pw_aff
*mpa1
,
3868 __isl_take isl_multi_pw_aff
*mpa2
))
3870 struct isl_union_order_at_data data
;
3872 umap
= isl_union_map_align_params(umap
,
3873 isl_multi_union_pw_aff_get_space(mupa
));
3874 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
3875 isl_union_map_get_space(umap
));
3878 data
.res
= isl_union_map_empty(isl_union_map_get_space(umap
));
3879 if (isl_union_map_foreach_map(umap
, &order_at
, &data
) < 0)
3880 data
.res
= isl_union_map_free(data
.res
);
3882 isl_multi_union_pw_aff_free(mupa
);
3883 isl_union_map_free(umap
);
3887 /* Return the subset of "umap" where the domain and the range
3888 * have equal "mupa" values.
3890 __isl_give isl_union_map
*isl_union_map_eq_at_multi_union_pw_aff(
3891 __isl_take isl_union_map
*umap
,
3892 __isl_take isl_multi_union_pw_aff
*mupa
)
3894 return isl_union_map_order_at_multi_union_pw_aff(umap
, mupa
,
3895 &isl_multi_pw_aff_eq_map
);
3898 /* Return the subset of "umap" where the domain has a lexicographically
3899 * smaller "mupa" value than the range.
3901 __isl_give isl_union_map
*isl_union_map_lex_lt_at_multi_union_pw_aff(
3902 __isl_take isl_union_map
*umap
,
3903 __isl_take isl_multi_union_pw_aff
*mupa
)
3905 return isl_union_map_order_at_multi_union_pw_aff(umap
, mupa
,
3906 &isl_multi_pw_aff_lex_lt_map
);
3909 /* Return the subset of "umap" where the domain has a lexicographically
3910 * greater "mupa" value than the range.
3912 __isl_give isl_union_map
*isl_union_map_lex_gt_at_multi_union_pw_aff(
3913 __isl_take isl_union_map
*umap
,
3914 __isl_take isl_multi_union_pw_aff
*mupa
)
3916 return isl_union_map_order_at_multi_union_pw_aff(umap
, mupa
,
3917 &isl_multi_pw_aff_lex_gt_map
);
3920 /* Return the union of the elements in the list "list".
3922 __isl_give isl_union_set
*isl_union_set_list_union(
3923 __isl_take isl_union_set_list
*list
)
3933 ctx
= isl_union_set_list_get_ctx(list
);
3934 space
= isl_space_params_alloc(ctx
, 0);
3935 res
= isl_union_set_empty(space
);
3937 n
= isl_union_set_list_n_union_set(list
);
3938 for (i
= 0; i
< n
; ++i
) {
3939 isl_union_set
*uset_i
;
3941 uset_i
= isl_union_set_list_get_union_set(list
, i
);
3942 res
= isl_union_set_union(res
, uset_i
);
3945 isl_union_set_list_free(list
);
3949 /* Update *hash with the hash value of "map".
3951 static isl_stat
add_hash(__isl_take isl_map
*map
, void *user
)
3953 uint32_t *hash
= user
;
3956 map_hash
= isl_map_get_hash(map
);
3957 isl_hash_hash(*hash
, map_hash
);
3963 /* Return a hash value that digests "umap".
3965 uint32_t isl_union_map_get_hash(__isl_keep isl_union_map
*umap
)
3972 hash
= isl_hash_init();
3973 if (isl_union_map_foreach_map(umap
, &add_hash
, &hash
) < 0)
3979 /* Return a hash value that digests "uset".
3981 uint32_t isl_union_set_get_hash(__isl_keep isl_union_set
*uset
)
3983 return isl_union_map_get_hash(uset
);