2 * Copyright 2010-2011 INRIA Saclay
3 * Copyright 2013-2014 Ecole Normale Superieure
4 * Copyright 2014 INRIA Rocquencourt
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
9 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
11 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
12 * B.P. 105 - 78153 Le Chesnay, France
16 #include <isl_map_private.h>
22 #include <isl_space_private.h>
23 #include <isl_union_map_private.h>
24 #include <isl/union_set.h>
25 #include <isl/deprecated/union_map_int.h>
27 /* Return the number of parameters of "umap", where "type"
28 * is required to be set to isl_dim_param.
30 unsigned isl_union_map_dim(__isl_keep isl_union_map
*umap
,
31 enum isl_dim_type type
)
36 if (type
!= isl_dim_param
)
37 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
38 "can only reference parameters", return 0);
40 return isl_space_dim(umap
->dim
, type
);
43 /* Return the number of parameters of "uset", where "type"
44 * is required to be set to isl_dim_param.
46 unsigned isl_union_set_dim(__isl_keep isl_union_set
*uset
,
47 enum isl_dim_type type
)
49 return isl_union_map_dim(uset
, type
);
52 /* Return the id of the specified dimension.
54 __isl_give isl_id
*isl_union_map_get_dim_id(__isl_keep isl_union_map
*umap
,
55 enum isl_dim_type type
, unsigned pos
)
60 if (type
!= isl_dim_param
)
61 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
62 "can only reference parameters", return NULL
);
64 return isl_space_get_dim_id(umap
->dim
, type
, pos
);
67 /* Is this union set a parameter domain?
69 int isl_union_set_is_params(__isl_keep isl_union_set
*uset
)
76 if (uset
->table
.n
!= 1)
79 set
= isl_set_from_union_set(isl_union_set_copy(uset
));
80 params
= isl_set_is_params(set
);
85 static __isl_give isl_union_map
*isl_union_map_alloc(
86 __isl_take isl_space
*space
, int size
)
90 space
= isl_space_params(space
);
94 umap
= isl_calloc_type(space
->ctx
, isl_union_map
);
96 isl_space_free(space
);
102 if (isl_hash_table_init(space
->ctx
, &umap
->table
, size
) < 0)
103 return isl_union_map_free(umap
);
108 __isl_give isl_union_map
*isl_union_map_empty(__isl_take isl_space
*dim
)
110 return isl_union_map_alloc(dim
, 16);
113 __isl_give isl_union_set
*isl_union_set_empty(__isl_take isl_space
*dim
)
115 return isl_union_map_empty(dim
);
118 isl_ctx
*isl_union_map_get_ctx(__isl_keep isl_union_map
*umap
)
120 return umap
? umap
->dim
->ctx
: NULL
;
123 isl_ctx
*isl_union_set_get_ctx(__isl_keep isl_union_set
*uset
)
125 return uset
? uset
->dim
->ctx
: NULL
;
128 __isl_give isl_space
*isl_union_map_get_space(__isl_keep isl_union_map
*umap
)
132 return isl_space_copy(umap
->dim
);
135 /* Return the position of the parameter with the given name
137 * Return -1 if no such dimension can be found.
139 int isl_union_map_find_dim_by_name(__isl_keep isl_union_map
*umap
,
140 enum isl_dim_type type
, const char *name
)
144 return isl_space_find_dim_by_name(umap
->dim
, type
, name
);
147 __isl_give isl_space
*isl_union_set_get_space(__isl_keep isl_union_set
*uset
)
149 return isl_union_map_get_space(uset
);
152 static int free_umap_entry(void **entry
, void *user
)
154 isl_map
*map
= *entry
;
159 static int add_map(__isl_take isl_map
*map
, void *user
)
161 isl_union_map
**umap
= (isl_union_map
**)user
;
163 *umap
= isl_union_map_add_map(*umap
, map
);
168 __isl_give isl_union_map
*isl_union_map_dup(__isl_keep isl_union_map
*umap
)
175 dup
= isl_union_map_empty(isl_space_copy(umap
->dim
));
176 if (isl_union_map_foreach_map(umap
, &add_map
, &dup
) < 0)
180 isl_union_map_free(dup
);
184 __isl_give isl_union_map
*isl_union_map_cow(__isl_take isl_union_map
*umap
)
192 return isl_union_map_dup(umap
);
195 struct isl_union_align
{
200 static int align_entry(void **entry
, void *user
)
202 isl_map
*map
= *entry
;
204 struct isl_union_align
*data
= user
;
206 exp
= isl_reordering_extend_space(isl_reordering_copy(data
->exp
),
207 isl_map_get_space(map
));
209 data
->res
= isl_union_map_add_map(data
->res
,
210 isl_map_realign(isl_map_copy(map
), exp
));
215 /* Align the parameters of umap along those of model.
216 * The result has the parameters of model first, in the same order
217 * as they appear in model, followed by any remaining parameters of
218 * umap that do not appear in model.
220 __isl_give isl_union_map
*isl_union_map_align_params(
221 __isl_take isl_union_map
*umap
, __isl_take isl_space
*model
)
223 struct isl_union_align data
= { NULL
, NULL
};
228 if (isl_space_match(umap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
229 isl_space_free(model
);
233 model
= isl_space_params(model
);
234 data
.exp
= isl_parameter_alignment_reordering(umap
->dim
, model
);
238 data
.res
= isl_union_map_alloc(isl_space_copy(data
.exp
->dim
),
240 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
241 &align_entry
, &data
) < 0)
244 isl_reordering_free(data
.exp
);
245 isl_union_map_free(umap
);
246 isl_space_free(model
);
249 isl_reordering_free(data
.exp
);
250 isl_union_map_free(umap
);
251 isl_union_map_free(data
.res
);
252 isl_space_free(model
);
256 __isl_give isl_union_set
*isl_union_set_align_params(
257 __isl_take isl_union_set
*uset
, __isl_take isl_space
*model
)
259 return isl_union_map_align_params(uset
, model
);
262 __isl_give isl_union_map
*isl_union_map_union(__isl_take isl_union_map
*umap1
,
263 __isl_take isl_union_map
*umap2
)
265 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
266 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
268 umap1
= isl_union_map_cow(umap1
);
270 if (!umap1
|| !umap2
)
273 if (isl_union_map_foreach_map(umap2
, &add_map
, &umap1
) < 0)
276 isl_union_map_free(umap2
);
280 isl_union_map_free(umap1
);
281 isl_union_map_free(umap2
);
285 __isl_give isl_union_set
*isl_union_set_union(__isl_take isl_union_set
*uset1
,
286 __isl_take isl_union_set
*uset2
)
288 return isl_union_map_union(uset1
, uset2
);
291 __isl_give isl_union_map
*isl_union_map_copy(__isl_keep isl_union_map
*umap
)
300 __isl_give isl_union_set
*isl_union_set_copy(__isl_keep isl_union_set
*uset
)
302 return isl_union_map_copy(uset
);
305 __isl_null isl_union_map
*isl_union_map_free(__isl_take isl_union_map
*umap
)
313 isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
314 &free_umap_entry
, NULL
);
315 isl_hash_table_clear(&umap
->table
);
316 isl_space_free(umap
->dim
);
321 __isl_null isl_union_set
*isl_union_set_free(__isl_take isl_union_set
*uset
)
323 return isl_union_map_free(uset
);
326 static int has_dim(const void *entry
, const void *val
)
328 isl_map
*map
= (isl_map
*)entry
;
329 isl_space
*dim
= (isl_space
*)val
;
331 return isl_space_is_equal(map
->dim
, dim
);
334 __isl_give isl_union_map
*isl_union_map_add_map(__isl_take isl_union_map
*umap
,
335 __isl_take isl_map
*map
)
338 struct isl_hash_table_entry
*entry
;
343 if (isl_map_plain_is_empty(map
)) {
348 if (!isl_space_match(map
->dim
, isl_dim_param
, umap
->dim
, isl_dim_param
)) {
349 umap
= isl_union_map_align_params(umap
, isl_map_get_space(map
));
350 map
= isl_map_align_params(map
, isl_union_map_get_space(umap
));
353 umap
= isl_union_map_cow(umap
);
358 hash
= isl_space_get_hash(map
->dim
);
359 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
360 &has_dim
, map
->dim
, 1);
367 entry
->data
= isl_map_union(entry
->data
, isl_map_copy(map
));
376 isl_union_map_free(umap
);
380 __isl_give isl_union_set
*isl_union_set_add_set(__isl_take isl_union_set
*uset
,
381 __isl_take isl_set
*set
)
383 return isl_union_map_add_map(uset
, (isl_map
*)set
);
386 __isl_give isl_union_map
*isl_union_map_from_map(__isl_take isl_map
*map
)
394 dim
= isl_map_get_space(map
);
395 dim
= isl_space_params(dim
);
396 umap
= isl_union_map_empty(dim
);
397 umap
= isl_union_map_add_map(umap
, map
);
402 __isl_give isl_union_set
*isl_union_set_from_set(__isl_take isl_set
*set
)
404 return isl_union_map_from_map((isl_map
*)set
);
407 __isl_give isl_union_map
*isl_union_map_from_basic_map(
408 __isl_take isl_basic_map
*bmap
)
410 return isl_union_map_from_map(isl_map_from_basic_map(bmap
));
413 __isl_give isl_union_set
*isl_union_set_from_basic_set(
414 __isl_take isl_basic_set
*bset
)
416 return isl_union_map_from_basic_map(bset
);
419 struct isl_union_map_foreach_data
421 int (*fn
)(__isl_take isl_map
*map
, void *user
);
425 static int call_on_copy(void **entry
, void *user
)
427 isl_map
*map
= *entry
;
428 struct isl_union_map_foreach_data
*data
;
429 data
= (struct isl_union_map_foreach_data
*)user
;
431 return data
->fn(isl_map_copy(map
), data
->user
);
434 int isl_union_map_n_map(__isl_keep isl_union_map
*umap
)
436 return umap
? umap
->table
.n
: 0;
439 int isl_union_set_n_set(__isl_keep isl_union_set
*uset
)
441 return uset
? uset
->table
.n
: 0;
444 int isl_union_map_foreach_map(__isl_keep isl_union_map
*umap
,
445 int (*fn
)(__isl_take isl_map
*map
, void *user
), void *user
)
447 struct isl_union_map_foreach_data data
= { fn
, user
};
452 return isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
453 &call_on_copy
, &data
);
456 static int copy_map(void **entry
, void *user
)
458 isl_map
*map
= *entry
;
459 isl_map
**map_p
= user
;
461 *map_p
= isl_map_copy(map
);
466 __isl_give isl_map
*isl_map_from_union_map(__isl_take isl_union_map
*umap
)
473 ctx
= isl_union_map_get_ctx(umap
);
474 if (umap
->table
.n
!= 1)
475 isl_die(ctx
, isl_error_invalid
,
476 "union map needs to contain elements in exactly "
477 "one space", goto error
);
479 isl_hash_table_foreach(ctx
, &umap
->table
, ©_map
, &map
);
481 isl_union_map_free(umap
);
485 isl_union_map_free(umap
);
489 __isl_give isl_set
*isl_set_from_union_set(__isl_take isl_union_set
*uset
)
491 return isl_map_from_union_map(uset
);
494 /* Extract the map in "umap" that lives in the given space (ignoring
497 __isl_give isl_map
*isl_union_map_extract_map(__isl_keep isl_union_map
*umap
,
498 __isl_take isl_space
*space
)
501 struct isl_hash_table_entry
*entry
;
503 space
= isl_space_drop_dims(space
, isl_dim_param
,
504 0, isl_space_dim(space
, isl_dim_param
));
505 space
= isl_space_align_params(space
, isl_union_map_get_space(umap
));
509 hash
= isl_space_get_hash(space
);
510 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
513 return isl_map_empty(space
);
514 isl_space_free(space
);
515 return isl_map_copy(entry
->data
);
517 isl_space_free(space
);
521 __isl_give isl_set
*isl_union_set_extract_set(__isl_keep isl_union_set
*uset
,
522 __isl_take isl_space
*dim
)
524 return (isl_set
*)isl_union_map_extract_map(uset
, dim
);
527 /* Check if umap contains a map in the given space.
529 __isl_give
int isl_union_map_contains(__isl_keep isl_union_map
*umap
,
530 __isl_keep isl_space
*dim
)
533 struct isl_hash_table_entry
*entry
;
538 hash
= isl_space_get_hash(dim
);
539 entry
= isl_hash_table_find(umap
->dim
->ctx
, &umap
->table
, hash
,
544 __isl_give
int isl_union_set_contains(__isl_keep isl_union_set
*uset
,
545 __isl_keep isl_space
*dim
)
547 return isl_union_map_contains(uset
, dim
);
550 int isl_union_set_foreach_set(__isl_keep isl_union_set
*uset
,
551 int (*fn
)(__isl_take isl_set
*set
, void *user
), void *user
)
553 return isl_union_map_foreach_map(uset
,
554 (int(*)(__isl_take isl_map
*, void*))fn
, user
);
557 struct isl_union_set_foreach_point_data
{
558 int (*fn
)(__isl_take isl_point
*pnt
, void *user
);
562 static int foreach_point(__isl_take isl_set
*set
, void *user
)
564 struct isl_union_set_foreach_point_data
*data
= user
;
567 r
= isl_set_foreach_point(set
, data
->fn
, data
->user
);
573 int isl_union_set_foreach_point(__isl_keep isl_union_set
*uset
,
574 int (*fn
)(__isl_take isl_point
*pnt
, void *user
), void *user
)
576 struct isl_union_set_foreach_point_data data
= { fn
, user
};
577 return isl_union_set_foreach_set(uset
, &foreach_point
, &data
);
580 struct isl_union_map_gen_bin_data
{
581 isl_union_map
*umap2
;
585 static int subtract_entry(void **entry
, void *user
)
587 struct isl_union_map_gen_bin_data
*data
= user
;
589 struct isl_hash_table_entry
*entry2
;
590 isl_map
*map
= *entry
;
592 hash
= isl_space_get_hash(map
->dim
);
593 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
594 hash
, &has_dim
, map
->dim
, 0);
595 map
= isl_map_copy(map
);
598 map
= isl_map_subtract(map
, isl_map_copy(entry2
->data
));
600 empty
= isl_map_is_empty(map
);
610 data
->res
= isl_union_map_add_map(data
->res
, map
);
615 static __isl_give isl_union_map
*gen_bin_op(__isl_take isl_union_map
*umap1
,
616 __isl_take isl_union_map
*umap2
, int (*fn
)(void **, void *))
618 struct isl_union_map_gen_bin_data data
= { NULL
, NULL
};
620 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
621 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
623 if (!umap1
|| !umap2
)
627 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
629 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
633 isl_union_map_free(umap1
);
634 isl_union_map_free(umap2
);
637 isl_union_map_free(umap1
);
638 isl_union_map_free(umap2
);
639 isl_union_map_free(data
.res
);
643 __isl_give isl_union_map
*isl_union_map_subtract(
644 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
646 return gen_bin_op(umap1
, umap2
, &subtract_entry
);
649 __isl_give isl_union_set
*isl_union_set_subtract(
650 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
652 return isl_union_map_subtract(uset1
, uset2
);
655 struct isl_union_map_gen_bin_set_data
{
660 static int intersect_params_entry(void **entry
, void *user
)
662 struct isl_union_map_gen_bin_set_data
*data
= user
;
663 isl_map
*map
= *entry
;
666 map
= isl_map_copy(map
);
667 map
= isl_map_intersect_params(map
, isl_set_copy(data
->set
));
669 empty
= isl_map_is_empty(map
);
675 data
->res
= isl_union_map_add_map(data
->res
, map
);
680 static __isl_give isl_union_map
*gen_bin_set_op(__isl_take isl_union_map
*umap
,
681 __isl_take isl_set
*set
, int (*fn
)(void **, void *))
683 struct isl_union_map_gen_bin_set_data data
= { NULL
, NULL
};
685 umap
= isl_union_map_align_params(umap
, isl_set_get_space(set
));
686 set
= isl_set_align_params(set
, isl_union_map_get_space(umap
));
692 data
.res
= isl_union_map_alloc(isl_space_copy(umap
->dim
),
694 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
698 isl_union_map_free(umap
);
702 isl_union_map_free(umap
);
704 isl_union_map_free(data
.res
);
708 __isl_give isl_union_map
*isl_union_map_intersect_params(
709 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
711 return gen_bin_set_op(umap
, set
, &intersect_params_entry
);
714 __isl_give isl_union_set
*isl_union_set_intersect_params(
715 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
717 return isl_union_map_intersect_params(uset
, set
);
720 static __isl_give isl_union_map
*union_map_intersect_params(
721 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
723 return isl_union_map_intersect_params(umap
,
724 isl_set_from_union_set(uset
));
727 static __isl_give isl_union_map
*union_map_gist_params(
728 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
730 return isl_union_map_gist_params(umap
, isl_set_from_union_set(uset
));
733 struct isl_union_map_match_bin_data
{
734 isl_union_map
*umap2
;
736 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*);
739 static int match_bin_entry(void **entry
, void *user
)
741 struct isl_union_map_match_bin_data
*data
= user
;
743 struct isl_hash_table_entry
*entry2
;
744 isl_map
*map
= *entry
;
747 hash
= isl_space_get_hash(map
->dim
);
748 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
749 hash
, &has_dim
, map
->dim
, 0);
753 map
= isl_map_copy(map
);
754 map
= data
->fn(map
, isl_map_copy(entry2
->data
));
756 empty
= isl_map_is_empty(map
);
766 data
->res
= isl_union_map_add_map(data
->res
, map
);
771 static __isl_give isl_union_map
*match_bin_op(__isl_take isl_union_map
*umap1
,
772 __isl_take isl_union_map
*umap2
,
773 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*, __isl_take isl_map
*))
775 struct isl_union_map_match_bin_data data
= { NULL
, NULL
, fn
};
777 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
778 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
780 if (!umap1
|| !umap2
)
784 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
786 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
787 &match_bin_entry
, &data
) < 0)
790 isl_union_map_free(umap1
);
791 isl_union_map_free(umap2
);
794 isl_union_map_free(umap1
);
795 isl_union_map_free(umap2
);
796 isl_union_map_free(data
.res
);
800 __isl_give isl_union_map
*isl_union_map_intersect(
801 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
803 return match_bin_op(umap1
, umap2
, &isl_map_intersect
);
806 /* Compute the intersection of the two union_sets.
807 * As a special case, if exactly one of the two union_sets
808 * is a parameter domain, then intersect the parameter domain
809 * of the other one with this set.
811 __isl_give isl_union_set
*isl_union_set_intersect(
812 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
816 p1
= isl_union_set_is_params(uset1
);
817 p2
= isl_union_set_is_params(uset2
);
818 if (p1
< 0 || p2
< 0)
821 return union_map_intersect_params(uset1
, uset2
);
823 return union_map_intersect_params(uset2
, uset1
);
824 return isl_union_map_intersect(uset1
, uset2
);
826 isl_union_set_free(uset1
);
827 isl_union_set_free(uset2
);
831 static int gist_params_entry(void **entry
, void *user
)
833 struct isl_union_map_gen_bin_set_data
*data
= user
;
834 isl_map
*map
= *entry
;
837 map
= isl_map_copy(map
);
838 map
= isl_map_gist_params(map
, isl_set_copy(data
->set
));
840 empty
= isl_map_is_empty(map
);
846 data
->res
= isl_union_map_add_map(data
->res
, map
);
851 __isl_give isl_union_map
*isl_union_map_gist_params(
852 __isl_take isl_union_map
*umap
, __isl_take isl_set
*set
)
854 return gen_bin_set_op(umap
, set
, &gist_params_entry
);
857 __isl_give isl_union_set
*isl_union_set_gist_params(
858 __isl_take isl_union_set
*uset
, __isl_take isl_set
*set
)
860 return isl_union_map_gist_params(uset
, set
);
863 __isl_give isl_union_map
*isl_union_map_gist(__isl_take isl_union_map
*umap
,
864 __isl_take isl_union_map
*context
)
866 return match_bin_op(umap
, context
, &isl_map_gist
);
869 __isl_give isl_union_set
*isl_union_set_gist(__isl_take isl_union_set
*uset
,
870 __isl_take isl_union_set
*context
)
872 if (isl_union_set_is_params(context
))
873 return union_map_gist_params(uset
, context
);
874 return isl_union_map_gist(uset
, context
);
877 static __isl_give isl_map
*lex_le_set(__isl_take isl_map
*set1
,
878 __isl_take isl_map
*set2
)
880 return isl_set_lex_le_set((isl_set
*)set1
, (isl_set
*)set2
);
883 static __isl_give isl_map
*lex_lt_set(__isl_take isl_map
*set1
,
884 __isl_take isl_map
*set2
)
886 return isl_set_lex_lt_set((isl_set
*)set1
, (isl_set
*)set2
);
889 __isl_give isl_union_map
*isl_union_set_lex_lt_union_set(
890 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
892 return match_bin_op(uset1
, uset2
, &lex_lt_set
);
895 __isl_give isl_union_map
*isl_union_set_lex_le_union_set(
896 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
898 return match_bin_op(uset1
, uset2
, &lex_le_set
);
901 __isl_give isl_union_map
*isl_union_set_lex_gt_union_set(
902 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
904 return isl_union_map_reverse(isl_union_set_lex_lt_union_set(uset2
, uset1
));
907 __isl_give isl_union_map
*isl_union_set_lex_ge_union_set(
908 __isl_take isl_union_set
*uset1
, __isl_take isl_union_set
*uset2
)
910 return isl_union_map_reverse(isl_union_set_lex_le_union_set(uset2
, uset1
));
913 __isl_give isl_union_map
*isl_union_map_lex_gt_union_map(
914 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
916 return isl_union_map_reverse(isl_union_map_lex_lt_union_map(umap2
, umap1
));
919 __isl_give isl_union_map
*isl_union_map_lex_ge_union_map(
920 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
922 return isl_union_map_reverse(isl_union_map_lex_le_union_map(umap2
, umap1
));
925 static int intersect_domain_entry(void **entry
, void *user
)
927 struct isl_union_map_gen_bin_data
*data
= user
;
929 struct isl_hash_table_entry
*entry2
;
931 isl_map
*map
= *entry
;
934 dim
= isl_map_get_space(map
);
935 dim
= isl_space_domain(dim
);
936 hash
= isl_space_get_hash(dim
);
937 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
938 hash
, &has_dim
, dim
, 0);
943 map
= isl_map_copy(map
);
944 map
= isl_map_intersect_domain(map
, isl_set_copy(entry2
->data
));
946 empty
= isl_map_is_empty(map
);
956 data
->res
= isl_union_map_add_map(data
->res
, map
);
961 /* Intersect the domain of "umap" with "uset".
962 * If "uset" is a parameters domain, then intersect the parameter
963 * domain of "umap" with this set.
965 __isl_give isl_union_map
*isl_union_map_intersect_domain(
966 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
968 if (isl_union_set_is_params(uset
))
969 return union_map_intersect_params(umap
, uset
);
970 return gen_bin_op(umap
, uset
, &intersect_domain_entry
);
973 /* Remove the elements of data->umap2 from the domain of *entry
974 * and add the result to data->res.
976 static int subtract_domain_entry(void **entry
, void *user
)
978 struct isl_union_map_gen_bin_data
*data
= user
;
980 struct isl_hash_table_entry
*entry2
;
982 isl_map
*map
= *entry
;
985 dim
= isl_map_get_space(map
);
986 dim
= isl_space_domain(dim
);
987 hash
= isl_space_get_hash(dim
);
988 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
989 hash
, &has_dim
, dim
, 0);
992 map
= isl_map_copy(map
);
995 data
->res
= isl_union_map_add_map(data
->res
, map
);
999 map
= isl_map_subtract_domain(map
, isl_set_copy(entry2
->data
));
1001 empty
= isl_map_is_empty(map
);
1011 data
->res
= isl_union_map_add_map(data
->res
, map
);
1016 /* Remove the elements of "uset" from the domain of "umap".
1018 __isl_give isl_union_map
*isl_union_map_subtract_domain(
1019 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*dom
)
1021 return gen_bin_op(umap
, dom
, &subtract_domain_entry
);
1024 /* Remove the elements of data->umap2 from the range of *entry
1025 * and add the result to data->res.
1027 static int subtract_range_entry(void **entry
, void *user
)
1029 struct isl_union_map_gen_bin_data
*data
= user
;
1031 struct isl_hash_table_entry
*entry2
;
1033 isl_map
*map
= *entry
;
1036 space
= isl_map_get_space(map
);
1037 space
= isl_space_range(space
);
1038 hash
= isl_space_get_hash(space
);
1039 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1040 hash
, &has_dim
, space
, 0);
1041 isl_space_free(space
);
1043 map
= isl_map_copy(map
);
1046 data
->res
= isl_union_map_add_map(data
->res
, map
);
1050 map
= isl_map_subtract_range(map
, isl_set_copy(entry2
->data
));
1052 empty
= isl_map_is_empty(map
);
1062 data
->res
= isl_union_map_add_map(data
->res
, map
);
1067 /* Remove the elements of "uset" from the range of "umap".
1069 __isl_give isl_union_map
*isl_union_map_subtract_range(
1070 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*dom
)
1072 return gen_bin_op(umap
, dom
, &subtract_range_entry
);
1075 static int gist_domain_entry(void **entry
, void *user
)
1077 struct isl_union_map_gen_bin_data
*data
= user
;
1079 struct isl_hash_table_entry
*entry2
;
1081 isl_map
*map
= *entry
;
1084 dim
= isl_map_get_space(map
);
1085 dim
= isl_space_domain(dim
);
1086 hash
= isl_space_get_hash(dim
);
1087 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1088 hash
, &has_dim
, dim
, 0);
1089 isl_space_free(dim
);
1093 map
= isl_map_copy(map
);
1094 map
= isl_map_gist_domain(map
, isl_set_copy(entry2
->data
));
1096 empty
= isl_map_is_empty(map
);
1102 data
->res
= isl_union_map_add_map(data
->res
, map
);
1107 /* Compute the gist of "umap" with respect to the domain "uset".
1108 * If "uset" is a parameters domain, then compute the gist
1109 * with respect to this parameter domain.
1111 __isl_give isl_union_map
*isl_union_map_gist_domain(
1112 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1114 if (isl_union_set_is_params(uset
))
1115 return union_map_gist_params(umap
, uset
);
1116 return gen_bin_op(umap
, uset
, &gist_domain_entry
);
1119 static int gist_range_entry(void **entry
, void *user
)
1121 struct isl_union_map_gen_bin_data
*data
= user
;
1123 struct isl_hash_table_entry
*entry2
;
1125 isl_map
*map
= *entry
;
1128 space
= isl_map_get_space(map
);
1129 space
= isl_space_range(space
);
1130 hash
= isl_space_get_hash(space
);
1131 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1132 hash
, &has_dim
, space
, 0);
1133 isl_space_free(space
);
1137 map
= isl_map_copy(map
);
1138 map
= isl_map_gist_range(map
, isl_set_copy(entry2
->data
));
1140 empty
= isl_map_is_empty(map
);
1146 data
->res
= isl_union_map_add_map(data
->res
, map
);
1151 /* Compute the gist of "umap" with respect to the range "uset".
1153 __isl_give isl_union_map
*isl_union_map_gist_range(
1154 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1156 return gen_bin_op(umap
, uset
, &gist_range_entry
);
1159 static int intersect_range_entry(void **entry
, void *user
)
1161 struct isl_union_map_gen_bin_data
*data
= user
;
1163 struct isl_hash_table_entry
*entry2
;
1165 isl_map
*map
= *entry
;
1168 dim
= isl_map_get_space(map
);
1169 dim
= isl_space_range(dim
);
1170 hash
= isl_space_get_hash(dim
);
1171 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1172 hash
, &has_dim
, dim
, 0);
1173 isl_space_free(dim
);
1177 map
= isl_map_copy(map
);
1178 map
= isl_map_intersect_range(map
, isl_set_copy(entry2
->data
));
1180 empty
= isl_map_is_empty(map
);
1190 data
->res
= isl_union_map_add_map(data
->res
, map
);
1195 __isl_give isl_union_map
*isl_union_map_intersect_range(
1196 __isl_take isl_union_map
*umap
, __isl_take isl_union_set
*uset
)
1198 return gen_bin_op(umap
, uset
, &intersect_range_entry
);
1201 struct isl_union_map_bin_data
{
1202 isl_union_map
*umap2
;
1205 int (*fn
)(void **entry
, void *user
);
1208 static int apply_range_entry(void **entry
, void *user
)
1210 struct isl_union_map_bin_data
*data
= user
;
1211 isl_map
*map2
= *entry
;
1214 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1215 map2
->dim
, isl_dim_in
))
1218 map2
= isl_map_apply_range(isl_map_copy(data
->map
), isl_map_copy(map2
));
1220 empty
= isl_map_is_empty(map2
);
1230 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1235 static int bin_entry(void **entry
, void *user
)
1237 struct isl_union_map_bin_data
*data
= user
;
1238 isl_map
*map
= *entry
;
1241 if (isl_hash_table_foreach(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
1242 data
->fn
, data
) < 0)
1248 static __isl_give isl_union_map
*bin_op(__isl_take isl_union_map
*umap1
,
1249 __isl_take isl_union_map
*umap2
, int (*fn
)(void **entry
, void *user
))
1251 struct isl_union_map_bin_data data
= { NULL
, NULL
, NULL
, fn
};
1253 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
1254 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
1256 if (!umap1
|| !umap2
)
1260 data
.res
= isl_union_map_alloc(isl_space_copy(umap1
->dim
),
1262 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
1263 &bin_entry
, &data
) < 0)
1266 isl_union_map_free(umap1
);
1267 isl_union_map_free(umap2
);
1270 isl_union_map_free(umap1
);
1271 isl_union_map_free(umap2
);
1272 isl_union_map_free(data
.res
);
1276 __isl_give isl_union_map
*isl_union_map_apply_range(
1277 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1279 return bin_op(umap1
, umap2
, &apply_range_entry
);
1282 __isl_give isl_union_map
*isl_union_map_apply_domain(
1283 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1285 umap1
= isl_union_map_reverse(umap1
);
1286 umap1
= isl_union_map_apply_range(umap1
, umap2
);
1287 return isl_union_map_reverse(umap1
);
1290 __isl_give isl_union_set
*isl_union_set_apply(
1291 __isl_take isl_union_set
*uset
, __isl_take isl_union_map
*umap
)
1293 return isl_union_map_apply_range(uset
, umap
);
1296 static int map_lex_lt_entry(void **entry
, void *user
)
1298 struct isl_union_map_bin_data
*data
= user
;
1299 isl_map
*map2
= *entry
;
1301 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1302 map2
->dim
, isl_dim_out
))
1305 map2
= isl_map_lex_lt_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1307 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1312 __isl_give isl_union_map
*isl_union_map_lex_lt_union_map(
1313 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1315 return bin_op(umap1
, umap2
, &map_lex_lt_entry
);
1318 static int map_lex_le_entry(void **entry
, void *user
)
1320 struct isl_union_map_bin_data
*data
= user
;
1321 isl_map
*map2
= *entry
;
1323 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1324 map2
->dim
, isl_dim_out
))
1327 map2
= isl_map_lex_le_map(isl_map_copy(data
->map
), isl_map_copy(map2
));
1329 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1334 __isl_give isl_union_map
*isl_union_map_lex_le_union_map(
1335 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1337 return bin_op(umap1
, umap2
, &map_lex_le_entry
);
1340 static int product_entry(void **entry
, void *user
)
1342 struct isl_union_map_bin_data
*data
= user
;
1343 isl_map
*map2
= *entry
;
1345 map2
= isl_map_product(isl_map_copy(data
->map
), isl_map_copy(map2
));
1347 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1352 __isl_give isl_union_map
*isl_union_map_product(__isl_take isl_union_map
*umap1
,
1353 __isl_take isl_union_map
*umap2
)
1355 return bin_op(umap1
, umap2
, &product_entry
);
1358 static int set_product_entry(void **entry
, void *user
)
1360 struct isl_union_map_bin_data
*data
= user
;
1361 isl_set
*set2
= *entry
;
1363 set2
= isl_set_product(isl_set_copy(data
->map
), isl_set_copy(set2
));
1365 data
->res
= isl_union_set_add_set(data
->res
, set2
);
1370 __isl_give isl_union_set
*isl_union_set_product(__isl_take isl_union_set
*uset1
,
1371 __isl_take isl_union_set
*uset2
)
1373 return bin_op(uset1
, uset2
, &set_product_entry
);
1376 static int domain_product_entry(void **entry
, void *user
)
1378 struct isl_union_map_bin_data
*data
= user
;
1379 isl_map
*map2
= *entry
;
1381 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1382 map2
->dim
, isl_dim_out
))
1385 map2
= isl_map_domain_product(isl_map_copy(data
->map
),
1386 isl_map_copy(map2
));
1388 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1393 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
1395 __isl_give isl_union_map
*isl_union_map_domain_product(
1396 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1398 return bin_op(umap1
, umap2
, &domain_product_entry
);
1401 static int range_product_entry(void **entry
, void *user
)
1403 struct isl_union_map_bin_data
*data
= user
;
1404 isl_map
*map2
= *entry
;
1406 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_in
,
1407 map2
->dim
, isl_dim_in
))
1410 map2
= isl_map_range_product(isl_map_copy(data
->map
),
1411 isl_map_copy(map2
));
1413 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1418 __isl_give isl_union_map
*isl_union_map_range_product(
1419 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1421 return bin_op(umap1
, umap2
, &range_product_entry
);
1424 /* If data->map A -> B and "map2" C -> D have the same range space,
1425 * then add (A, C) -> (B * D) to data->res.
1427 static int flat_domain_product_entry(void **entry
, void *user
)
1429 struct isl_union_map_bin_data
*data
= user
;
1430 isl_map
*map2
= *entry
;
1432 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_out
,
1433 map2
->dim
, isl_dim_out
))
1436 map2
= isl_map_flat_domain_product(isl_map_copy(data
->map
),
1437 isl_map_copy(map2
));
1439 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1444 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D).
1446 __isl_give isl_union_map
*isl_union_map_flat_domain_product(
1447 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1449 return bin_op(umap1
, umap2
, &flat_domain_product_entry
);
1452 static int flat_range_product_entry(void **entry
, void *user
)
1454 struct isl_union_map_bin_data
*data
= user
;
1455 isl_map
*map2
= *entry
;
1457 if (!isl_space_tuple_is_equal(data
->map
->dim
, isl_dim_in
,
1458 map2
->dim
, isl_dim_in
))
1461 map2
= isl_map_flat_range_product(isl_map_copy(data
->map
),
1462 isl_map_copy(map2
));
1464 data
->res
= isl_union_map_add_map(data
->res
, map2
);
1469 __isl_give isl_union_map
*isl_union_map_flat_range_product(
1470 __isl_take isl_union_map
*umap1
, __isl_take isl_union_map
*umap2
)
1472 return bin_op(umap1
, umap2
, &flat_range_product_entry
);
1475 static __isl_give isl_union_set
*cond_un_op(__isl_take isl_union_map
*umap
,
1476 int (*fn
)(void **, void *))
1483 res
= isl_union_map_alloc(isl_space_copy(umap
->dim
), umap
->table
.n
);
1484 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, &res
) < 0)
1487 isl_union_map_free(umap
);
1490 isl_union_map_free(umap
);
1491 isl_union_set_free(res
);
1495 static int from_range_entry(void **entry
, void *user
)
1497 isl_map
*set
= *entry
;
1498 isl_union_set
**res
= user
;
1500 *res
= isl_union_map_add_map(*res
,
1501 isl_map_from_range(isl_set_copy(set
)));
1506 __isl_give isl_union_map
*isl_union_map_from_range(
1507 __isl_take isl_union_set
*uset
)
1509 return cond_un_op(uset
, &from_range_entry
);
1512 __isl_give isl_union_map
*isl_union_map_from_domain(
1513 __isl_take isl_union_set
*uset
)
1515 return isl_union_map_reverse(isl_union_map_from_range(uset
));
1518 __isl_give isl_union_map
*isl_union_map_from_domain_and_range(
1519 __isl_take isl_union_set
*domain
, __isl_take isl_union_set
*range
)
1521 return isl_union_map_apply_range(isl_union_map_from_domain(domain
),
1522 isl_union_map_from_range(range
));
1525 static __isl_give isl_union_map
*un_op(__isl_take isl_union_map
*umap
,
1526 int (*fn
)(void **, void *))
1528 umap
= isl_union_map_cow(umap
);
1532 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
, fn
, NULL
) < 0)
1537 isl_union_map_free(umap
);
1541 static int affine_entry(void **entry
, void *user
)
1543 isl_map
**map
= (isl_map
**)entry
;
1545 *map
= isl_map_from_basic_map(isl_map_affine_hull(*map
));
1547 return *map
? 0 : -1;
1550 __isl_give isl_union_map
*isl_union_map_affine_hull(
1551 __isl_take isl_union_map
*umap
)
1553 return un_op(umap
, &affine_entry
);
1556 __isl_give isl_union_set
*isl_union_set_affine_hull(
1557 __isl_take isl_union_set
*uset
)
1559 return isl_union_map_affine_hull(uset
);
1562 static int polyhedral_entry(void **entry
, void *user
)
1564 isl_map
**map
= (isl_map
**)entry
;
1566 *map
= isl_map_from_basic_map(isl_map_polyhedral_hull(*map
));
1568 return *map
? 0 : -1;
1571 __isl_give isl_union_map
*isl_union_map_polyhedral_hull(
1572 __isl_take isl_union_map
*umap
)
1574 return un_op(umap
, &polyhedral_entry
);
1577 __isl_give isl_union_set
*isl_union_set_polyhedral_hull(
1578 __isl_take isl_union_set
*uset
)
1580 return isl_union_map_polyhedral_hull(uset
);
1583 static int simple_entry(void **entry
, void *user
)
1585 isl_map
**map
= (isl_map
**)entry
;
1587 *map
= isl_map_from_basic_map(isl_map_simple_hull(*map
));
1589 return *map
? 0 : -1;
1592 __isl_give isl_union_map
*isl_union_map_simple_hull(
1593 __isl_take isl_union_map
*umap
)
1595 return un_op(umap
, &simple_entry
);
1598 __isl_give isl_union_set
*isl_union_set_simple_hull(
1599 __isl_take isl_union_set
*uset
)
1601 return isl_union_map_simple_hull(uset
);
1604 static int inplace_entry(void **entry
, void *user
)
1606 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*);
1607 isl_map
**map
= (isl_map
**)entry
;
1610 fn
= *(__isl_give isl_map
*(**)(__isl_take isl_map
*)) user
;
1611 copy
= fn(isl_map_copy(*map
));
1621 static __isl_give isl_union_map
*inplace(__isl_take isl_union_map
*umap
,
1622 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*))
1627 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
1628 &inplace_entry
, &fn
) < 0)
1633 isl_union_map_free(umap
);
1637 __isl_give isl_union_map
*isl_union_map_coalesce(
1638 __isl_take isl_union_map
*umap
)
1640 return inplace(umap
, &isl_map_coalesce
);
1643 __isl_give isl_union_set
*isl_union_set_coalesce(
1644 __isl_take isl_union_set
*uset
)
1646 return isl_union_map_coalesce(uset
);
1649 __isl_give isl_union_map
*isl_union_map_detect_equalities(
1650 __isl_take isl_union_map
*umap
)
1652 return inplace(umap
, &isl_map_detect_equalities
);
1655 __isl_give isl_union_set
*isl_union_set_detect_equalities(
1656 __isl_take isl_union_set
*uset
)
1658 return isl_union_map_detect_equalities(uset
);
1661 __isl_give isl_union_map
*isl_union_map_compute_divs(
1662 __isl_take isl_union_map
*umap
)
1664 return inplace(umap
, &isl_map_compute_divs
);
1667 __isl_give isl_union_set
*isl_union_set_compute_divs(
1668 __isl_take isl_union_set
*uset
)
1670 return isl_union_map_compute_divs(uset
);
1673 static int lexmin_entry(void **entry
, void *user
)
1675 isl_map
**map
= (isl_map
**)entry
;
1677 *map
= isl_map_lexmin(*map
);
1679 return *map
? 0 : -1;
1682 __isl_give isl_union_map
*isl_union_map_lexmin(
1683 __isl_take isl_union_map
*umap
)
1685 return un_op(umap
, &lexmin_entry
);
1688 __isl_give isl_union_set
*isl_union_set_lexmin(
1689 __isl_take isl_union_set
*uset
)
1691 return isl_union_map_lexmin(uset
);
1694 static int lexmax_entry(void **entry
, void *user
)
1696 isl_map
**map
= (isl_map
**)entry
;
1698 *map
= isl_map_lexmax(*map
);
1700 return *map
? 0 : -1;
1703 __isl_give isl_union_map
*isl_union_map_lexmax(
1704 __isl_take isl_union_map
*umap
)
1706 return un_op(umap
, &lexmax_entry
);
1709 __isl_give isl_union_set
*isl_union_set_lexmax(
1710 __isl_take isl_union_set
*uset
)
1712 return isl_union_map_lexmax(uset
);
1715 static int universe_entry(void **entry
, void *user
)
1717 isl_map
*map
= *entry
;
1718 isl_union_map
**res
= user
;
1720 map
= isl_map_universe(isl_map_get_space(map
));
1721 *res
= isl_union_map_add_map(*res
, map
);
1726 __isl_give isl_union_map
*isl_union_map_universe(__isl_take isl_union_map
*umap
)
1728 return cond_un_op(umap
, &universe_entry
);
1731 __isl_give isl_union_set
*isl_union_set_universe(__isl_take isl_union_set
*uset
)
1733 return isl_union_map_universe(uset
);
1736 static int reverse_entry(void **entry
, void *user
)
1738 isl_map
*map
= *entry
;
1739 isl_union_map
**res
= user
;
1741 *res
= isl_union_map_add_map(*res
, isl_map_reverse(isl_map_copy(map
)));
1746 __isl_give isl_union_map
*isl_union_map_reverse(__isl_take isl_union_map
*umap
)
1748 return cond_un_op(umap
, &reverse_entry
);
1751 static int params_entry(void **entry
, void *user
)
1753 isl_map
*map
= *entry
;
1754 isl_union_set
**res
= user
;
1756 *res
= isl_union_set_add_set(*res
, isl_map_params(isl_map_copy(map
)));
1761 /* Compute the parameter domain of the given union map.
1763 __isl_give isl_set
*isl_union_map_params(__isl_take isl_union_map
*umap
)
1767 empty
= isl_union_map_is_empty(umap
);
1772 space
= isl_union_map_get_space(umap
);
1773 isl_union_map_free(umap
);
1774 return isl_set_empty(space
);
1776 return isl_set_from_union_set(cond_un_op(umap
, ¶ms_entry
));
1778 isl_union_map_free(umap
);
1782 /* Compute the parameter domain of the given union set.
1784 __isl_give isl_set
*isl_union_set_params(__isl_take isl_union_set
*uset
)
1786 return isl_union_map_params(uset
);
1789 static int domain_entry(void **entry
, void *user
)
1791 isl_map
*map
= *entry
;
1792 isl_union_set
**res
= user
;
1794 *res
= isl_union_set_add_set(*res
, isl_map_domain(isl_map_copy(map
)));
1799 __isl_give isl_union_set
*isl_union_map_domain(__isl_take isl_union_map
*umap
)
1801 return cond_un_op(umap
, &domain_entry
);
1804 static int range_entry(void **entry
, void *user
)
1806 isl_map
*map
= *entry
;
1807 isl_union_set
**res
= user
;
1809 *res
= isl_union_set_add_set(*res
, isl_map_range(isl_map_copy(map
)));
1814 __isl_give isl_union_set
*isl_union_map_range(__isl_take isl_union_map
*umap
)
1816 return cond_un_op(umap
, &range_entry
);
1819 static int domain_map_entry(void **entry
, void *user
)
1821 isl_map
*map
= *entry
;
1822 isl_union_set
**res
= user
;
1824 *res
= isl_union_map_add_map(*res
,
1825 isl_map_domain_map(isl_map_copy(map
)));
1830 __isl_give isl_union_map
*isl_union_map_domain_map(
1831 __isl_take isl_union_map
*umap
)
1833 return cond_un_op(umap
, &domain_map_entry
);
1836 static int range_map_entry(void **entry
, void *user
)
1838 isl_map
*map
= *entry
;
1839 isl_union_set
**res
= user
;
1841 *res
= isl_union_map_add_map(*res
,
1842 isl_map_range_map(isl_map_copy(map
)));
1847 __isl_give isl_union_map
*isl_union_map_range_map(
1848 __isl_take isl_union_map
*umap
)
1850 return cond_un_op(umap
, &range_map_entry
);
1853 /* Check if "set" is of the form A[B -> C].
1854 * If so, add A[B -> C] -> B to "res".
1856 static int wrapped_domain_map_entry(void **entry
, void *user
)
1858 isl_set
*set
= *entry
;
1859 isl_union_set
**res
= user
;
1862 wrapping
= isl_set_is_wrapping(set
);
1868 *res
= isl_union_map_add_map(*res
,
1869 isl_set_wrapped_domain_map(isl_set_copy(set
)));
1874 /* Given a collection of wrapped maps of the form A[B -> C],
1875 * return the collection of maps A[B -> C] -> B.
1877 __isl_give isl_union_map
*isl_union_set_wrapped_domain_map(
1878 __isl_take isl_union_set
*uset
)
1880 return cond_un_op(uset
, &wrapped_domain_map_entry
);
1883 static int deltas_entry(void **entry
, void *user
)
1885 isl_map
*map
= *entry
;
1886 isl_union_set
**res
= user
;
1888 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
1889 map
->dim
, isl_dim_out
))
1892 *res
= isl_union_set_add_set(*res
, isl_map_deltas(isl_map_copy(map
)));
1897 __isl_give isl_union_set
*isl_union_map_deltas(__isl_take isl_union_map
*umap
)
1899 return cond_un_op(umap
, &deltas_entry
);
1902 static int deltas_map_entry(void **entry
, void *user
)
1904 isl_map
*map
= *entry
;
1905 isl_union_map
**res
= user
;
1907 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
1908 map
->dim
, isl_dim_out
))
1911 *res
= isl_union_map_add_map(*res
,
1912 isl_map_deltas_map(isl_map_copy(map
)));
1917 __isl_give isl_union_map
*isl_union_map_deltas_map(
1918 __isl_take isl_union_map
*umap
)
1920 return cond_un_op(umap
, &deltas_map_entry
);
1923 static int identity_entry(void **entry
, void *user
)
1925 isl_set
*set
= *entry
;
1926 isl_union_map
**res
= user
;
1928 *res
= isl_union_map_add_map(*res
, isl_set_identity(isl_set_copy(set
)));
1933 __isl_give isl_union_map
*isl_union_set_identity(__isl_take isl_union_set
*uset
)
1935 return cond_un_op(uset
, &identity_entry
);
1938 /* If "map" is of the form [A -> B] -> C, then add A -> C to "res".
1940 static int domain_factor_domain_entry(void **entry
, void *user
)
1942 isl_map
*map
= *entry
;
1943 isl_union_map
**res
= user
;
1945 if (!isl_map_domain_is_wrapping(map
))
1948 *res
= isl_union_map_add_map(*res
,
1949 isl_map_domain_factor_domain(isl_map_copy(map
)));
1951 return *res
? 0 : -1;
1954 /* For each map in "umap" of the form [A -> B] -> C,
1955 * construct the map A -> C and collect the results.
1957 __isl_give isl_union_map
*isl_union_map_domain_factor_domain(
1958 __isl_take isl_union_map
*umap
)
1960 return cond_un_op(umap
, &domain_factor_domain_entry
);
1963 /* If "map" is of the form [A -> B] -> C, then add B -> C to "res".
1965 static int domain_factor_range_entry(void **entry
, void *user
)
1967 isl_map
*map
= *entry
;
1968 isl_union_map
**res
= user
;
1970 if (!isl_map_domain_is_wrapping(map
))
1973 *res
= isl_union_map_add_map(*res
,
1974 isl_map_domain_factor_range(isl_map_copy(map
)));
1976 return *res
? 0 : -1;
1979 /* For each map in "umap" of the form [A -> B] -> C,
1980 * construct the map B -> C and collect the results.
1982 __isl_give isl_union_map
*isl_union_map_domain_factor_range(
1983 __isl_take isl_union_map
*umap
)
1985 return cond_un_op(umap
, &domain_factor_range_entry
);
1988 /* If "map" is of the form A -> [B -> C], then add A -> C to "res".
1990 static int range_factor_range_entry(void **entry
, void *user
)
1992 isl_map
*map
= *entry
;
1993 isl_union_map
**res
= user
;
1995 if (!isl_map_range_is_wrapping(map
))
1998 *res
= isl_union_map_add_map(*res
,
1999 isl_map_range_factor_range(isl_map_copy(map
)));
2001 return *res
? 0 : -1;
2004 /* For each map in "umap" of the form A -> [B -> C],
2005 * construct the map A -> C and collect the results.
2007 __isl_give isl_union_map
*isl_union_map_range_factor_range(
2008 __isl_take isl_union_map
*umap
)
2010 return cond_un_op(umap
, &range_factor_range_entry
);
2013 /* If "map" is of the form [A -> B] -> [C -> D], then add A -> C to "res".
2015 static int factor_domain_entry(void **entry
, void *user
)
2017 isl_map
*map
= *entry
;
2018 isl_union_map
**res
= user
;
2020 if (!isl_map_domain_is_wrapping(map
) || !isl_map_range_is_wrapping(map
))
2023 *res
= isl_union_map_add_map(*res
,
2024 isl_map_factor_domain(isl_map_copy(map
)));
2026 return *res
? 0 : -1;
2029 /* For each map in "umap" of the form [A -> B] -> [C -> D],
2030 * construct the map A -> C and collect the results.
2032 __isl_give isl_union_map
*isl_union_map_factor_domain(
2033 __isl_take isl_union_map
*umap
)
2035 return cond_un_op(umap
, &factor_domain_entry
);
2038 /* If "map" is of the form [A -> B] -> [C -> D], then add B -> D to "res".
2040 static int factor_range_entry(void **entry
, void *user
)
2042 isl_map
*map
= *entry
;
2043 isl_union_map
**res
= user
;
2045 if (!isl_map_domain_is_wrapping(map
) || !isl_map_range_is_wrapping(map
))
2048 *res
= isl_union_map_add_map(*res
,
2049 isl_map_factor_range(isl_map_copy(map
)));
2051 return *res
? 0 : -1;
2054 /* For each map in "umap" of the form [A -> B] -> [C -> D],
2055 * construct the map B -> D and collect the results.
2057 __isl_give isl_union_map
*isl_union_map_factor_range(
2058 __isl_take isl_union_map
*umap
)
2060 return cond_un_op(umap
, &factor_range_entry
);
2063 static int unwrap_entry(void **entry
, void *user
)
2065 isl_set
*set
= *entry
;
2066 isl_union_set
**res
= user
;
2068 if (!isl_set_is_wrapping(set
))
2071 *res
= isl_union_map_add_map(*res
, isl_set_unwrap(isl_set_copy(set
)));
2076 __isl_give isl_union_map
*isl_union_set_unwrap(__isl_take isl_union_set
*uset
)
2078 return cond_un_op(uset
, &unwrap_entry
);
2081 static int wrap_entry(void **entry
, void *user
)
2083 isl_map
*map
= *entry
;
2084 isl_union_set
**res
= user
;
2086 *res
= isl_union_set_add_set(*res
, isl_map_wrap(isl_map_copy(map
)));
2091 __isl_give isl_union_set
*isl_union_map_wrap(__isl_take isl_union_map
*umap
)
2093 return cond_un_op(umap
, &wrap_entry
);
2096 struct isl_union_map_is_subset_data
{
2097 isl_union_map
*umap2
;
2101 static int is_subset_entry(void **entry
, void *user
)
2103 struct isl_union_map_is_subset_data
*data
= user
;
2105 struct isl_hash_table_entry
*entry2
;
2106 isl_map
*map
= *entry
;
2108 hash
= isl_space_get_hash(map
->dim
);
2109 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
2110 hash
, &has_dim
, map
->dim
, 0);
2112 int empty
= isl_map_is_empty(map
);
2117 data
->is_subset
= 0;
2121 data
->is_subset
= isl_map_is_subset(map
, entry2
->data
);
2122 if (data
->is_subset
< 0 || !data
->is_subset
)
2128 int isl_union_map_is_subset(__isl_keep isl_union_map
*umap1
,
2129 __isl_keep isl_union_map
*umap2
)
2131 struct isl_union_map_is_subset_data data
= { NULL
, 1 };
2133 umap1
= isl_union_map_copy(umap1
);
2134 umap2
= isl_union_map_copy(umap2
);
2135 umap1
= isl_union_map_align_params(umap1
, isl_union_map_get_space(umap2
));
2136 umap2
= isl_union_map_align_params(umap2
, isl_union_map_get_space(umap1
));
2138 if (!umap1
|| !umap2
)
2142 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
2143 &is_subset_entry
, &data
) < 0 &&
2147 isl_union_map_free(umap1
);
2148 isl_union_map_free(umap2
);
2150 return data
.is_subset
;
2152 isl_union_map_free(umap1
);
2153 isl_union_map_free(umap2
);
2157 int isl_union_set_is_subset(__isl_keep isl_union_set
*uset1
,
2158 __isl_keep isl_union_set
*uset2
)
2160 return isl_union_map_is_subset(uset1
, uset2
);
2163 int isl_union_map_is_equal(__isl_keep isl_union_map
*umap1
,
2164 __isl_keep isl_union_map
*umap2
)
2168 if (!umap1
|| !umap2
)
2170 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
2173 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
2177 int isl_union_set_is_equal(__isl_keep isl_union_set
*uset1
,
2178 __isl_keep isl_union_set
*uset2
)
2180 return isl_union_map_is_equal(uset1
, uset2
);
2183 int isl_union_map_is_strict_subset(__isl_keep isl_union_map
*umap1
,
2184 __isl_keep isl_union_map
*umap2
)
2188 if (!umap1
|| !umap2
)
2190 is_subset
= isl_union_map_is_subset(umap1
, umap2
);
2193 is_subset
= isl_union_map_is_subset(umap2
, umap1
);
2194 if (is_subset
== -1)
2199 int isl_union_set_is_strict_subset(__isl_keep isl_union_set
*uset1
,
2200 __isl_keep isl_union_set
*uset2
)
2202 return isl_union_map_is_strict_subset(uset1
, uset2
);
2205 /* Internal data structure for isl_union_map_is_disjoint.
2206 * umap2 is the union map with which we are comparing.
2207 * is_disjoint is initialized to 1 and is set to 0 as soon
2208 * as the union maps turn out not to be disjoint.
2210 struct isl_union_map_is_disjoint_data
{
2211 isl_union_map
*umap2
;
2215 /* Check if "map" is disjoint from data->umap2 and abort
2216 * the search if it is not.
2218 static int is_disjoint_entry(void **entry
, void *user
)
2220 struct isl_union_map_is_disjoint_data
*data
= user
;
2222 struct isl_hash_table_entry
*entry2
;
2223 isl_map
*map
= *entry
;
2225 hash
= isl_space_get_hash(map
->dim
);
2226 entry2
= isl_hash_table_find(data
->umap2
->dim
->ctx
, &data
->umap2
->table
,
2227 hash
, &has_dim
, map
->dim
, 0);
2231 data
->is_disjoint
= isl_map_is_disjoint(map
, entry2
->data
);
2232 if (data
->is_disjoint
< 0 || !data
->is_disjoint
)
2238 /* Are "umap1" and "umap2" disjoint?
2240 int isl_union_map_is_disjoint(__isl_keep isl_union_map
*umap1
,
2241 __isl_keep isl_union_map
*umap2
)
2243 struct isl_union_map_is_disjoint_data data
= { NULL
, 1 };
2245 umap1
= isl_union_map_copy(umap1
);
2246 umap2
= isl_union_map_copy(umap2
);
2247 umap1
= isl_union_map_align_params(umap1
,
2248 isl_union_map_get_space(umap2
));
2249 umap2
= isl_union_map_align_params(umap2
,
2250 isl_union_map_get_space(umap1
));
2252 if (!umap1
|| !umap2
)
2256 if (isl_hash_table_foreach(umap1
->dim
->ctx
, &umap1
->table
,
2257 &is_disjoint_entry
, &data
) < 0 &&
2261 isl_union_map_free(umap1
);
2262 isl_union_map_free(umap2
);
2264 return data
.is_disjoint
;
2266 isl_union_map_free(umap1
);
2267 isl_union_map_free(umap2
);
2271 /* Are "uset1" and "uset2" disjoint?
2273 int isl_union_set_is_disjoint(__isl_keep isl_union_set
*uset1
,
2274 __isl_keep isl_union_set
*uset2
)
2276 return isl_union_map_is_disjoint(uset1
, uset2
);
2279 static int sample_entry(void **entry
, void *user
)
2281 isl_basic_map
**sample
= (isl_basic_map
**)user
;
2282 isl_map
*map
= *entry
;
2284 *sample
= isl_map_sample(isl_map_copy(map
));
2287 if (!isl_basic_map_plain_is_empty(*sample
))
2292 __isl_give isl_basic_map
*isl_union_map_sample(__isl_take isl_union_map
*umap
)
2294 isl_basic_map
*sample
= NULL
;
2299 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2300 &sample_entry
, &sample
) < 0 &&
2305 sample
= isl_basic_map_empty(isl_union_map_get_space(umap
));
2307 isl_union_map_free(umap
);
2311 isl_union_map_free(umap
);
2315 __isl_give isl_basic_set
*isl_union_set_sample(__isl_take isl_union_set
*uset
)
2317 return (isl_basic_set
*)isl_union_map_sample(uset
);
2320 struct isl_forall_data
{
2322 int (*fn
)(__isl_keep isl_map
*map
);
2325 static int forall_entry(void **entry
, void *user
)
2327 struct isl_forall_data
*data
= user
;
2328 isl_map
*map
= *entry
;
2330 data
->res
= data
->fn(map
);
2340 static int union_map_forall(__isl_keep isl_union_map
*umap
,
2341 int (*fn
)(__isl_keep isl_map
*map
))
2343 struct isl_forall_data data
= { 1, fn
};
2348 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2349 &forall_entry
, &data
) < 0 && data
.res
)
2355 struct isl_forall_user_data
{
2357 int (*fn
)(__isl_keep isl_map
*map
, void *user
);
2361 static int forall_user_entry(void **entry
, void *user
)
2363 struct isl_forall_user_data
*data
= user
;
2364 isl_map
*map
= *entry
;
2366 data
->res
= data
->fn(map
, data
->user
);
2376 /* Check if fn(map, user) returns true for all maps "map" in umap.
2378 static int union_map_forall_user(__isl_keep isl_union_map
*umap
,
2379 int (*fn
)(__isl_keep isl_map
*map
, void *user
), void *user
)
2381 struct isl_forall_user_data data
= { 1, fn
, user
};
2386 if (isl_hash_table_foreach(umap
->dim
->ctx
, &umap
->table
,
2387 &forall_user_entry
, &data
) < 0 && data
.res
)
2393 int isl_union_map_is_empty(__isl_keep isl_union_map
*umap
)
2395 return union_map_forall(umap
, &isl_map_is_empty
);
2398 int isl_union_set_is_empty(__isl_keep isl_union_set
*uset
)
2400 return isl_union_map_is_empty(uset
);
2403 static int is_subset_of_identity(__isl_keep isl_map
*map
)
2412 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
2413 map
->dim
, isl_dim_out
))
2416 dim
= isl_map_get_space(map
);
2417 id
= isl_map_identity(dim
);
2419 is_subset
= isl_map_is_subset(map
, id
);
2426 /* Given an isl_union_map that consists of a single map, check
2427 * if it is single-valued.
2429 static int single_map_is_single_valued(__isl_keep isl_union_map
*umap
)
2434 umap
= isl_union_map_copy(umap
);
2435 map
= isl_map_from_union_map(umap
);
2436 sv
= isl_map_is_single_valued(map
);
2442 /* Internal data structure for single_valued_on_domain.
2444 * "umap" is the union map to be tested.
2445 * "sv" is set to 1 as long as "umap" may still be single-valued.
2447 struct isl_union_map_is_sv_data
{
2448 isl_union_map
*umap
;
2452 /* Check if the data->umap is single-valued on "set".
2454 * If data->umap consists of a single map on "set", then test it
2457 * Otherwise, compute
2461 * check if the result is a subset of the identity mapping and
2462 * store the result in data->sv.
2464 * Terminate as soon as data->umap has been determined not to
2467 static int single_valued_on_domain(__isl_take isl_set
*set
, void *user
)
2469 struct isl_union_map_is_sv_data
*data
= user
;
2470 isl_union_map
*umap
, *test
;
2472 umap
= isl_union_map_copy(data
->umap
);
2473 umap
= isl_union_map_intersect_domain(umap
,
2474 isl_union_set_from_set(set
));
2476 if (isl_union_map_n_map(umap
) == 1) {
2477 data
->sv
= single_map_is_single_valued(umap
);
2478 isl_union_map_free(umap
);
2480 test
= isl_union_map_reverse(isl_union_map_copy(umap
));
2481 test
= isl_union_map_apply_range(test
, umap
);
2483 data
->sv
= union_map_forall(test
, &is_subset_of_identity
);
2485 isl_union_map_free(test
);
2488 if (data
->sv
< 0 || !data
->sv
)
2493 /* Check if the given map is single-valued.
2495 * If the union map consists of a single map, then test it as an isl_map.
2496 * Otherwise, check if the union map is single-valued on each of its
2499 int isl_union_map_is_single_valued(__isl_keep isl_union_map
*umap
)
2501 isl_union_map
*universe
;
2502 isl_union_set
*domain
;
2503 struct isl_union_map_is_sv_data data
;
2505 if (isl_union_map_n_map(umap
) == 1)
2506 return single_map_is_single_valued(umap
);
2508 universe
= isl_union_map_universe(isl_union_map_copy(umap
));
2509 domain
= isl_union_map_domain(universe
);
2513 if (isl_union_set_foreach_set(domain
,
2514 &single_valued_on_domain
, &data
) < 0 && data
.sv
)
2516 isl_union_set_free(domain
);
2521 int isl_union_map_is_injective(__isl_keep isl_union_map
*umap
)
2525 umap
= isl_union_map_copy(umap
);
2526 umap
= isl_union_map_reverse(umap
);
2527 in
= isl_union_map_is_single_valued(umap
);
2528 isl_union_map_free(umap
);
2533 /* Represents a map that has a fixed value (v) for one of its
2535 * The map in this structure is not reference counted, so it
2536 * is only valid while the isl_union_map from which it was
2537 * obtained is still alive.
2539 struct isl_fixed_map
{
2544 static struct isl_fixed_map
*alloc_isl_fixed_map_array(isl_ctx
*ctx
,
2548 struct isl_fixed_map
*v
;
2550 v
= isl_calloc_array(ctx
, struct isl_fixed_map
, n
);
2553 for (i
= 0; i
< n
; ++i
)
2554 isl_int_init(v
[i
].v
);
2558 static void free_isl_fixed_map_array(struct isl_fixed_map
*v
, int n
)
2564 for (i
= 0; i
< n
; ++i
)
2565 isl_int_clear(v
[i
].v
);
2569 /* Compare the "v" field of two isl_fixed_map structs.
2571 static int qsort_fixed_map_cmp(const void *p1
, const void *p2
)
2573 const struct isl_fixed_map
*e1
= (const struct isl_fixed_map
*) p1
;
2574 const struct isl_fixed_map
*e2
= (const struct isl_fixed_map
*) p2
;
2576 return isl_int_cmp(e1
->v
, e2
->v
);
2579 /* Internal data structure used while checking whether all maps
2580 * in a union_map have a fixed value for a given output dimension.
2581 * v is the list of maps, with the fixed value for the dimension
2582 * n is the number of maps considered so far
2583 * pos is the output dimension under investigation
2585 struct isl_fixed_dim_data
{
2586 struct isl_fixed_map
*v
;
2591 static int fixed_at_pos(__isl_keep isl_map
*map
, void *user
)
2593 struct isl_fixed_dim_data
*data
= user
;
2595 data
->v
[data
->n
].map
= map
;
2596 return isl_map_plain_is_fixed(map
, isl_dim_out
, data
->pos
,
2597 &data
->v
[data
->n
++].v
);
2600 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
2601 int first
, int n_range
);
2603 /* Given a list of the maps, with their fixed values at output dimension "pos",
2604 * check whether the ranges of the maps form an obvious partition.
2606 * We first sort the maps according to their fixed values.
2607 * If all maps have a different value, then we know the ranges form
2609 * Otherwise, we collect the maps with the same fixed value and
2610 * check whether each such collection is obviously injective
2611 * based on later dimensions.
2613 static int separates(struct isl_fixed_map
*v
, int n
,
2614 __isl_take isl_space
*dim
, int pos
, int n_range
)
2621 qsort(v
, n
, sizeof(*v
), &qsort_fixed_map_cmp
);
2623 for (i
= 0; i
+ 1 < n
; ++i
) {
2625 isl_union_map
*part
;
2628 for (j
= i
+ 1; j
< n
; ++j
)
2629 if (isl_int_ne(v
[i
].v
, v
[j
].v
))
2635 part
= isl_union_map_alloc(isl_space_copy(dim
), j
- i
);
2636 for (k
= i
; k
< j
; ++k
)
2637 part
= isl_union_map_add_map(part
,
2638 isl_map_copy(v
[k
].map
));
2640 injective
= plain_injective_on_range(part
, pos
+ 1, n_range
);
2649 isl_space_free(dim
);
2650 free_isl_fixed_map_array(v
, n
);
2653 isl_space_free(dim
);
2654 free_isl_fixed_map_array(v
, n
);
2658 /* Check whether the maps in umap have obviously distinct ranges.
2659 * In particular, check for an output dimension in the range
2660 * [first,n_range) for which all maps have a fixed value
2661 * and then check if these values, possibly along with fixed values
2662 * at later dimensions, entail distinct ranges.
2664 static int plain_injective_on_range(__isl_take isl_union_map
*umap
,
2665 int first
, int n_range
)
2669 struct isl_fixed_dim_data data
= { NULL
};
2671 ctx
= isl_union_map_get_ctx(umap
);
2673 n
= isl_union_map_n_map(umap
);
2678 isl_union_map_free(umap
);
2682 if (first
>= n_range
) {
2683 isl_union_map_free(umap
);
2687 data
.v
= alloc_isl_fixed_map_array(ctx
, n
);
2691 for (data
.pos
= first
; data
.pos
< n_range
; ++data
.pos
) {
2697 fixed
= union_map_forall_user(umap
, &fixed_at_pos
, &data
);
2702 dim
= isl_union_map_get_space(umap
);
2703 injective
= separates(data
.v
, n
, dim
, data
.pos
, n_range
);
2704 isl_union_map_free(umap
);
2708 free_isl_fixed_map_array(data
.v
, n
);
2709 isl_union_map_free(umap
);
2713 free_isl_fixed_map_array(data
.v
, n
);
2714 isl_union_map_free(umap
);
2718 /* Check whether the maps in umap that map to subsets of "ran"
2719 * have obviously distinct ranges.
2721 static int plain_injective_on_range_wrap(__isl_keep isl_set
*ran
, void *user
)
2723 isl_union_map
*umap
= user
;
2725 umap
= isl_union_map_copy(umap
);
2726 umap
= isl_union_map_intersect_range(umap
,
2727 isl_union_set_from_set(isl_set_copy(ran
)));
2728 return plain_injective_on_range(umap
, 0, isl_set_dim(ran
, isl_dim_set
));
2731 /* Check if the given union_map is obviously injective.
2733 * In particular, we first check if all individual maps are obviously
2734 * injective and then check if all the ranges of these maps are
2735 * obviously disjoint.
2737 int isl_union_map_plain_is_injective(__isl_keep isl_union_map
*umap
)
2740 isl_union_map
*univ
;
2743 in
= union_map_forall(umap
, &isl_map_plain_is_injective
);
2749 univ
= isl_union_map_universe(isl_union_map_copy(umap
));
2750 ran
= isl_union_map_range(univ
);
2752 in
= union_map_forall_user(ran
, &plain_injective_on_range_wrap
, umap
);
2754 isl_union_set_free(ran
);
2759 int isl_union_map_is_bijective(__isl_keep isl_union_map
*umap
)
2763 sv
= isl_union_map_is_single_valued(umap
);
2767 return isl_union_map_is_injective(umap
);
2770 static int zip_entry(void **entry
, void *user
)
2772 isl_map
*map
= *entry
;
2773 isl_union_map
**res
= user
;
2775 if (!isl_map_can_zip(map
))
2778 *res
= isl_union_map_add_map(*res
, isl_map_zip(isl_map_copy(map
)));
2783 __isl_give isl_union_map
*isl_union_map_zip(__isl_take isl_union_map
*umap
)
2785 return cond_un_op(umap
, &zip_entry
);
2788 static int uncurry_entry(void **entry
, void *user
)
2790 isl_map
*map
= *entry
;
2791 isl_union_map
**res
= user
;
2793 if (!isl_map_can_uncurry(map
))
2796 *res
= isl_union_map_add_map(*res
, isl_map_uncurry(isl_map_copy(map
)));
2801 /* Given a union map, take the maps of the form A -> (B -> C) and
2802 * return the union of the corresponding maps (A -> B) -> C.
2804 __isl_give isl_union_map
*isl_union_map_uncurry(__isl_take isl_union_map
*umap
)
2806 return cond_un_op(umap
, &uncurry_entry
);
2809 static int curry_entry(void **entry
, void *user
)
2811 isl_map
*map
= *entry
;
2812 isl_union_map
**res
= user
;
2814 if (!isl_map_can_curry(map
))
2817 *res
= isl_union_map_add_map(*res
, isl_map_curry(isl_map_copy(map
)));
2822 /* Given a union map, take the maps of the form (A -> B) -> C and
2823 * return the union of the corresponding maps A -> (B -> C).
2825 __isl_give isl_union_map
*isl_union_map_curry(__isl_take isl_union_map
*umap
)
2827 return cond_un_op(umap
, &curry_entry
);
2830 static int lift_entry(void **entry
, void *user
)
2832 isl_set
*set
= *entry
;
2833 isl_union_set
**res
= user
;
2835 *res
= isl_union_set_add_set(*res
, isl_set_lift(isl_set_copy(set
)));
2840 __isl_give isl_union_set
*isl_union_set_lift(__isl_take isl_union_set
*uset
)
2842 return cond_un_op(uset
, &lift_entry
);
2845 static int coefficients_entry(void **entry
, void *user
)
2847 isl_set
*set
= *entry
;
2848 isl_union_set
**res
= user
;
2850 set
= isl_set_copy(set
);
2851 set
= isl_set_from_basic_set(isl_set_coefficients(set
));
2852 *res
= isl_union_set_add_set(*res
, set
);
2857 __isl_give isl_union_set
*isl_union_set_coefficients(
2858 __isl_take isl_union_set
*uset
)
2867 ctx
= isl_union_set_get_ctx(uset
);
2868 dim
= isl_space_set_alloc(ctx
, 0, 0);
2869 res
= isl_union_map_alloc(dim
, uset
->table
.n
);
2870 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
2871 &coefficients_entry
, &res
) < 0)
2874 isl_union_set_free(uset
);
2877 isl_union_set_free(uset
);
2878 isl_union_set_free(res
);
2882 static int solutions_entry(void **entry
, void *user
)
2884 isl_set
*set
= *entry
;
2885 isl_union_set
**res
= user
;
2887 set
= isl_set_copy(set
);
2888 set
= isl_set_from_basic_set(isl_set_solutions(set
));
2890 *res
= isl_union_set_from_set(set
);
2892 *res
= isl_union_set_add_set(*res
, set
);
2900 __isl_give isl_union_set
*isl_union_set_solutions(
2901 __isl_take isl_union_set
*uset
)
2903 isl_union_set
*res
= NULL
;
2908 if (uset
->table
.n
== 0) {
2909 res
= isl_union_set_empty(isl_union_set_get_space(uset
));
2910 isl_union_set_free(uset
);
2914 if (isl_hash_table_foreach(uset
->dim
->ctx
, &uset
->table
,
2915 &solutions_entry
, &res
) < 0)
2918 isl_union_set_free(uset
);
2921 isl_union_set_free(uset
);
2922 isl_union_set_free(res
);
2926 /* Is the domain space of "map" equal to "space"?
2928 static int domain_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
2930 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
2931 space
, isl_dim_out
);
2934 /* Is the range space of "map" equal to "space"?
2936 static int range_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
2938 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
2939 space
, isl_dim_out
);
2942 /* Is the set space of "map" equal to "space"?
2944 static int set_match(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
)
2946 return isl_space_tuple_is_equal(map
->dim
, isl_dim_set
,
2947 space
, isl_dim_out
);
2950 /* Internal data structure for preimage_pw_multi_aff.
2952 * "pma" is the function under which the preimage should be taken.
2953 * "space" is the space of "pma".
2954 * "res" collects the results.
2955 * "fn" computes the preimage for a given map.
2956 * "match" returns true if "fn" can be called.
2958 struct isl_union_map_preimage_data
{
2960 isl_pw_multi_aff
*pma
;
2962 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
);
2963 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
2964 __isl_take isl_pw_multi_aff
*pma
);
2967 /* Call data->fn to compute the preimage of the domain or range of *entry
2968 * under the function represented by data->pma, provided the domain/range
2969 * space of *entry matches the target space of data->pma
2970 * (as given by data->match), and add the result to data->res.
2972 static int preimage_entry(void **entry
, void *user
)
2975 isl_map
*map
= *entry
;
2976 struct isl_union_map_preimage_data
*data
= user
;
2979 m
= data
->match(map
, data
->space
);
2985 map
= isl_map_copy(map
);
2986 map
= data
->fn(map
, isl_pw_multi_aff_copy(data
->pma
));
2988 empty
= isl_map_is_empty(map
);
2989 if (empty
< 0 || empty
) {
2991 return empty
< 0 ? -1 : 0;
2994 data
->res
= isl_union_map_add_map(data
->res
, map
);
2999 /* Compute the preimage of the domain or range of "umap" under the function
3000 * represented by "pma".
3001 * In other words, plug in "pma" in the domain or range of "umap".
3002 * The function "fn" performs the actual preimage computation on a map,
3003 * while "match" determines to which maps the function should be applied.
3005 static __isl_give isl_union_map
*preimage_pw_multi_aff(
3006 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
,
3007 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
),
3008 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3009 __isl_take isl_pw_multi_aff
*pma
))
3013 struct isl_union_map_preimage_data data
;
3015 umap
= isl_union_map_align_params(umap
,
3016 isl_pw_multi_aff_get_space(pma
));
3017 pma
= isl_pw_multi_aff_align_params(pma
, isl_union_map_get_space(umap
));
3022 ctx
= isl_union_map_get_ctx(umap
);
3023 space
= isl_union_map_get_space(umap
);
3024 data
.space
= isl_pw_multi_aff_get_space(pma
);
3026 data
.res
= isl_union_map_alloc(space
, umap
->table
.n
);
3029 if (isl_hash_table_foreach(ctx
, &umap
->table
, &preimage_entry
,
3031 data
.res
= isl_union_map_free(data
.res
);
3033 isl_space_free(data
.space
);
3034 isl_union_map_free(umap
);
3035 isl_pw_multi_aff_free(pma
);
3038 isl_union_map_free(umap
);
3039 isl_pw_multi_aff_free(pma
);
3043 /* Compute the preimage of the domain of "umap" under the function
3044 * represented by "pma".
3045 * In other words, plug in "pma" in the domain of "umap".
3046 * The result contains maps that live in the same spaces as the maps of "umap"
3047 * with domain space equal to the target space of "pma",
3048 * except that the domain has been replaced by the domain space of "pma".
3050 __isl_give isl_union_map
*isl_union_map_preimage_domain_pw_multi_aff(
3051 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
)
3053 return preimage_pw_multi_aff(umap
, pma
, &domain_match
,
3054 &isl_map_preimage_domain_pw_multi_aff
);
3057 /* Compute the preimage of the range of "umap" under the function
3058 * represented by "pma".
3059 * In other words, plug in "pma" in the range of "umap".
3060 * The result contains maps that live in the same spaces as the maps of "umap"
3061 * with range space equal to the target space of "pma",
3062 * except that the range has been replaced by the domain space of "pma".
3064 __isl_give isl_union_map
*isl_union_map_preimage_range_pw_multi_aff(
3065 __isl_take isl_union_map
*umap
, __isl_take isl_pw_multi_aff
*pma
)
3067 return preimage_pw_multi_aff(umap
, pma
, &range_match
,
3068 &isl_map_preimage_range_pw_multi_aff
);
3071 /* Compute the preimage of "uset" under the function represented by "pma".
3072 * In other words, plug in "pma" in "uset".
3073 * The result contains sets that live in the same spaces as the sets of "uset"
3074 * with space equal to the target space of "pma",
3075 * except that the space has been replaced by the domain space of "pma".
3077 __isl_give isl_union_set
*isl_union_set_preimage_pw_multi_aff(
3078 __isl_take isl_union_set
*uset
, __isl_take isl_pw_multi_aff
*pma
)
3080 return preimage_pw_multi_aff(uset
, pma
, &set_match
,
3081 &isl_set_preimage_pw_multi_aff
);
3084 /* Compute the preimage of the domain of "umap" under the function
3085 * represented by "ma".
3086 * In other words, plug in "ma" in the domain of "umap".
3087 * The result contains maps that live in the same spaces as the maps of "umap"
3088 * with domain space equal to the target space of "ma",
3089 * except that the domain has been replaced by the domain space of "ma".
3091 __isl_give isl_union_map
*isl_union_map_preimage_domain_multi_aff(
3092 __isl_take isl_union_map
*umap
, __isl_take isl_multi_aff
*ma
)
3094 return isl_union_map_preimage_domain_pw_multi_aff(umap
,
3095 isl_pw_multi_aff_from_multi_aff(ma
));
3098 /* Compute the preimage of the range of "umap" under the function
3099 * represented by "ma".
3100 * In other words, plug in "ma" in the range of "umap".
3101 * The result contains maps that live in the same spaces as the maps of "umap"
3102 * with range space equal to the target space of "ma",
3103 * except that the range has been replaced by the domain space of "ma".
3105 __isl_give isl_union_map
*isl_union_map_preimage_range_multi_aff(
3106 __isl_take isl_union_map
*umap
, __isl_take isl_multi_aff
*ma
)
3108 return isl_union_map_preimage_range_pw_multi_aff(umap
,
3109 isl_pw_multi_aff_from_multi_aff(ma
));
3112 /* Compute the preimage of "uset" under the function represented by "ma".
3113 * In other words, plug in "ma" in "uset".
3114 * The result contains sets that live in the same spaces as the sets of "uset"
3115 * with space equal to the target space of "ma",
3116 * except that the space has been replaced by the domain space of "ma".
3118 __isl_give isl_union_map
*isl_union_set_preimage_multi_aff(
3119 __isl_take isl_union_set
*uset
, __isl_take isl_multi_aff
*ma
)
3121 return isl_union_set_preimage_pw_multi_aff(uset
,
3122 isl_pw_multi_aff_from_multi_aff(ma
));
3125 /* Internal data structure for preimage_multi_pw_aff.
3127 * "mpa" is the function under which the preimage should be taken.
3128 * "space" is the space of "mpa".
3129 * "res" collects the results.
3130 * "fn" computes the preimage for a given map.
3131 * "match" returns true if "fn" can be called.
3133 struct isl_union_map_preimage_mpa_data
{
3135 isl_multi_pw_aff
*mpa
;
3137 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
);
3138 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3139 __isl_take isl_multi_pw_aff
*mpa
);
3142 /* Call data->fn to compute the preimage of the domain or range of *entry
3143 * under the function represented by data->mpa, provided the domain/range
3144 * space of *entry matches the target space of data->mpa
3145 * (as given by data->match), and add the result to data->res.
3147 static int preimage_mpa_entry(void **entry
, void *user
)
3150 isl_map
*map
= *entry
;
3151 struct isl_union_map_preimage_mpa_data
*data
= user
;
3154 m
= data
->match(map
, data
->space
);
3160 map
= isl_map_copy(map
);
3161 map
= data
->fn(map
, isl_multi_pw_aff_copy(data
->mpa
));
3163 empty
= isl_map_is_empty(map
);
3164 if (empty
< 0 || empty
) {
3166 return empty
< 0 ? -1 : 0;
3169 data
->res
= isl_union_map_add_map(data
->res
, map
);
3174 /* Compute the preimage of the domain or range of "umap" under the function
3175 * represented by "mpa".
3176 * In other words, plug in "mpa" in the domain or range of "umap".
3177 * The function "fn" performs the actual preimage computation on a map,
3178 * while "match" determines to which maps the function should be applied.
3180 static __isl_give isl_union_map
*preimage_multi_pw_aff(
3181 __isl_take isl_union_map
*umap
, __isl_take isl_multi_pw_aff
*mpa
,
3182 int (*match
)(__isl_keep isl_map
*map
, __isl_keep isl_space
*space
),
3183 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map
,
3184 __isl_take isl_multi_pw_aff
*mpa
))
3188 struct isl_union_map_preimage_mpa_data data
;
3190 umap
= isl_union_map_align_params(umap
,
3191 isl_multi_pw_aff_get_space(mpa
));
3192 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_union_map_get_space(umap
));
3197 ctx
= isl_union_map_get_ctx(umap
);
3198 space
= isl_union_map_get_space(umap
);
3199 data
.space
= isl_multi_pw_aff_get_space(mpa
);
3201 data
.res
= isl_union_map_alloc(space
, umap
->table
.n
);
3204 if (isl_hash_table_foreach(ctx
, &umap
->table
, &preimage_mpa_entry
,
3206 data
.res
= isl_union_map_free(data
.res
);
3208 isl_space_free(data
.space
);
3209 isl_union_map_free(umap
);
3210 isl_multi_pw_aff_free(mpa
);
3213 isl_union_map_free(umap
);
3214 isl_multi_pw_aff_free(mpa
);
3218 /* Compute the preimage of the domain of "umap" under the function
3219 * represented by "mpa".
3220 * In other words, plug in "mpa" in the domain of "umap".
3221 * The result contains maps that live in the same spaces as the maps of "umap"
3222 * with domain space equal to the target space of "mpa",
3223 * except that the domain has been replaced by the domain space of "mpa".
3225 __isl_give isl_union_map
*isl_union_map_preimage_domain_multi_pw_aff(
3226 __isl_take isl_union_map
*umap
, __isl_take isl_multi_pw_aff
*mpa
)
3228 return preimage_multi_pw_aff(umap
, mpa
, &domain_match
,
3229 &isl_map_preimage_domain_multi_pw_aff
);
3232 /* Internal data structure for preimage_upma.
3234 * "umap" is the map of which the preimage should be computed.
3235 * "res" collects the results.
3236 * "fn" computes the preimage for a given piecewise multi-affine function.
3238 struct isl_union_map_preimage_upma_data
{
3239 isl_union_map
*umap
;
3241 __isl_give isl_union_map
*(*fn
)(__isl_take isl_union_map
*umap
,
3242 __isl_take isl_pw_multi_aff
*pma
);
3245 /* Call data->fn to compute the preimage of the domain or range of data->umap
3246 * under the function represented by pma and add the result to data->res.
3248 static int preimage_upma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
3250 struct isl_union_map_preimage_upma_data
*data
= user
;
3251 isl_union_map
*umap
;
3253 umap
= isl_union_map_copy(data
->umap
);
3254 umap
= data
->fn(umap
, pma
);
3255 data
->res
= isl_union_map_union(data
->res
, umap
);
3257 return data
->res
? 0 : -1;
3260 /* Compute the preimage of the domain or range of "umap" under the function
3261 * represented by "upma".
3262 * In other words, plug in "upma" in the domain or range of "umap".
3263 * The function "fn" performs the actual preimage computation
3264 * on a piecewise multi-affine function.
3266 static __isl_give isl_union_map
*preimage_union_pw_multi_aff(
3267 __isl_take isl_union_map
*umap
,
3268 __isl_take isl_union_pw_multi_aff
*upma
,
3269 __isl_give isl_union_map
*(*fn
)(__isl_take isl_union_map
*umap
,
3270 __isl_take isl_pw_multi_aff
*pma
))
3272 struct isl_union_map_preimage_upma_data data
;
3275 data
.res
= isl_union_map_empty(isl_union_map_get_space(umap
));
3277 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
3278 &preimage_upma
, &data
) < 0)
3279 data
.res
= isl_union_map_free(data
.res
);
3281 isl_union_map_free(umap
);
3282 isl_union_pw_multi_aff_free(upma
);
3287 /* Compute the preimage of the domain of "umap" under the function
3288 * represented by "upma".
3289 * In other words, plug in "upma" in the domain of "umap".
3290 * The result contains maps that live in the same spaces as the maps of "umap"
3291 * with domain space equal to one of the target spaces of "upma",
3292 * except that the domain has been replaced by one of the the domain spaces that
3293 * corresponds to that target space of "upma".
3295 __isl_give isl_union_map
*isl_union_map_preimage_domain_union_pw_multi_aff(
3296 __isl_take isl_union_map
*umap
,
3297 __isl_take isl_union_pw_multi_aff
*upma
)
3299 return preimage_union_pw_multi_aff(umap
, upma
,
3300 &isl_union_map_preimage_domain_pw_multi_aff
);
3303 /* Compute the preimage of the range of "umap" under the function
3304 * represented by "upma".
3305 * In other words, plug in "upma" in the range of "umap".
3306 * The result contains maps that live in the same spaces as the maps of "umap"
3307 * with range space equal to one of the target spaces of "upma",
3308 * except that the range has been replaced by one of the the domain spaces that
3309 * corresponds to that target space of "upma".
3311 __isl_give isl_union_map
*isl_union_map_preimage_range_union_pw_multi_aff(
3312 __isl_take isl_union_map
*umap
,
3313 __isl_take isl_union_pw_multi_aff
*upma
)
3315 return preimage_union_pw_multi_aff(umap
, upma
,
3316 &isl_union_map_preimage_range_pw_multi_aff
);
3319 /* Compute the preimage of "uset" under the function represented by "upma".
3320 * In other words, plug in "upma" in the range of "uset".
3321 * The result contains sets that live in the same spaces as the sets of "uset"
3322 * with space equal to one of the target spaces of "upma",
3323 * except that the space has been replaced by one of the the domain spaces that
3324 * corresponds to that target space of "upma".
3326 __isl_give isl_union_set
*isl_union_set_preimage_union_pw_multi_aff(
3327 __isl_take isl_union_set
*uset
,
3328 __isl_take isl_union_pw_multi_aff
*upma
)
3330 return preimage_union_pw_multi_aff(uset
, upma
,
3331 &isl_union_set_preimage_pw_multi_aff
);
3334 /* Reset the user pointer on all identifiers of parameters and tuples
3335 * of the space of *entry.
3337 static int reset_user(void **entry
, void *user
)
3339 isl_map
**map
= (isl_map
**)entry
;
3341 *map
= isl_map_reset_user(*map
);
3343 return *map
? 0 : -1;
3346 /* Reset the user pointer on all identifiers of parameters and tuples
3347 * of the spaces of "umap".
3349 __isl_give isl_union_map
*isl_union_map_reset_user(
3350 __isl_take isl_union_map
*umap
)
3352 umap
= isl_union_map_cow(umap
);
3355 umap
->dim
= isl_space_reset_user(umap
->dim
);
3357 return isl_union_map_free(umap
);
3358 umap
= un_op(umap
, &reset_user
);
3363 /* Reset the user pointer on all identifiers of parameters and tuples
3364 * of the spaces of "uset".
3366 __isl_give isl_union_set
*isl_union_set_reset_user(
3367 __isl_take isl_union_set
*uset
)
3369 return isl_union_map_reset_user(uset
);
3372 /* Internal data structure for isl_union_map_project_out.
3373 * "type", "first" and "n" are the arguments for the isl_map_project_out
3375 * "res" collects the results.
3377 struct isl_union_map_project_out_data
{
3378 enum isl_dim_type type
;
3385 /* Turn the data->n dimensions of type data->type, starting at data->first
3386 * into existentially quantified variables and add the result to data->res.
3388 static int project_out(__isl_take isl_map
*map
, void *user
)
3390 struct isl_union_map_project_out_data
*data
= user
;
3392 map
= isl_map_project_out(map
, data
->type
, data
->first
, data
->n
);
3393 data
->res
= isl_union_map_add_map(data
->res
, map
);
3398 /* Turn the "n" dimensions of type "type", starting at "first"
3399 * into existentially quantified variables.
3400 * Since the space of an isl_union_map only contains parameters,
3401 * type is required to be equal to isl_dim_param.
3403 __isl_give isl_union_map
*isl_union_map_project_out(
3404 __isl_take isl_union_map
*umap
,
3405 enum isl_dim_type type
, unsigned first
, unsigned n
)
3408 struct isl_union_map_project_out_data data
= { type
, first
, n
};
3413 if (type
!= isl_dim_param
)
3414 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
3415 "can only project out parameters",
3416 return isl_union_map_free(umap
));
3418 space
= isl_union_map_get_space(umap
);
3419 space
= isl_space_drop_dims(space
, type
, first
, n
);
3420 data
.res
= isl_union_map_empty(space
);
3421 if (isl_union_map_foreach_map(umap
, &project_out
, &data
) < 0)
3422 data
.res
= isl_union_map_free(data
.res
);
3424 isl_union_map_free(umap
);
3429 /* Turn the "n" dimensions of type "type", starting at "first"
3430 * into existentially quantified variables.
3431 * Since the space of an isl_union_set only contains parameters,
3432 * "type" is required to be equal to isl_dim_param.
3434 __isl_give isl_union_set
*isl_union_set_project_out(
3435 __isl_take isl_union_set
*uset
,
3436 enum isl_dim_type type
, unsigned first
, unsigned n
)
3438 return isl_union_map_project_out(uset
, type
, first
, n
);
3441 /* Internal data structure for isl_union_map_involves_dims.
3442 * "first" and "n" are the arguments for the isl_map_involves_dims calls.
3444 struct isl_union_map_involves_dims_data
{
3449 /* Does "map" _not_ involve the data->n parameters starting at data->first?
3451 static int map_excludes(__isl_keep isl_map
*map
, void *user
)
3453 struct isl_union_map_involves_dims_data
*data
= user
;
3456 involves
= isl_map_involves_dims(map
,
3457 isl_dim_param
, data
->first
, data
->n
);
3463 /* Does "umap" involve any of the n parameters starting at first?
3464 * "type" is required to be set to isl_dim_param.
3466 * "umap" involves any of those parameters if any of its maps
3467 * involve the parameters. In other words, "umap" does not
3468 * involve any of the parameters if all its maps to not
3469 * involve the parameters.
3471 int isl_union_map_involves_dims(__isl_keep isl_union_map
*umap
,
3472 enum isl_dim_type type
, unsigned first
, unsigned n
)
3474 struct isl_union_map_involves_dims_data data
= { first
, n
};
3477 if (type
!= isl_dim_param
)
3478 isl_die(isl_union_map_get_ctx(umap
), isl_error_invalid
,
3479 "can only reference parameters", return 0);
3481 excludes
= union_map_forall_user(umap
, &map_excludes
, &data
);