2 * Copyright 2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 Sven Verdoolaege
7 * Copyright 2018,2020 Cerebras Systems
8 * Copyright 2021 Sven Verdoolaege
10 * Use of this software is governed by the MIT license
12 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
13 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
15 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
17 * B.P. 105 - 78153 Le Chesnay, France
18 * and Cerebras Systems, 175 S San Antonio Rd, Los Altos, CA, USA
21 #include <isl_ctx_private.h>
22 #include <isl_map_private.h>
23 #include <isl_union_map_private.h>
24 #include <isl_aff_private.h>
25 #include <isl_space_private.h>
26 #include <isl_local_space_private.h>
27 #include <isl_vec_private.h>
28 #include <isl_mat_private.h>
29 #include <isl_id_private.h>
30 #include <isl/constraint.h>
33 #include <isl_val_private.h>
34 #include <isl_point_private.h>
35 #include <isl_config.h>
40 #include <isl_list_templ.c>
41 #include <isl_list_read_templ.c>
44 #define EL_BASE pw_aff
46 #include <isl_list_templ.c>
47 #include <isl_list_read_templ.c>
50 #define EL_BASE pw_multi_aff
52 #include <isl_list_templ.c>
53 #include <isl_list_read_templ.c>
56 #define EL_BASE union_pw_aff
58 #include <isl_list_templ.c>
59 #include <isl_list_read_templ.c>
62 #define EL_BASE union_pw_multi_aff
64 #include <isl_list_templ.c>
66 __isl_give isl_aff
*isl_aff_alloc_vec(__isl_take isl_local_space
*ls
,
67 __isl_take isl_vec
*v
)
74 aff
= isl_calloc_type(v
->ctx
, struct isl_aff
);
84 isl_local_space_free(ls
);
89 __isl_give isl_aff
*isl_aff_alloc(__isl_take isl_local_space
*ls
)
98 ctx
= isl_local_space_get_ctx(ls
);
99 if (!isl_local_space_divs_known(ls
))
100 isl_die(ctx
, isl_error_invalid
, "local space has unknown divs",
102 if (!isl_local_space_is_set(ls
))
103 isl_die(ctx
, isl_error_invalid
,
104 "domain of affine expression should be a set",
107 total
= isl_local_space_dim(ls
, isl_dim_all
);
110 v
= isl_vec_alloc(ctx
, 1 + 1 + total
);
111 return isl_aff_alloc_vec(ls
, v
);
113 isl_local_space_free(ls
);
117 __isl_give isl_aff
*isl_aff_copy(__isl_keep isl_aff
*aff
)
126 __isl_give isl_aff
*isl_aff_dup(__isl_keep isl_aff
*aff
)
131 return isl_aff_alloc_vec(isl_local_space_copy(aff
->ls
),
132 isl_vec_copy(aff
->v
));
135 __isl_give isl_aff
*isl_aff_cow(__isl_take isl_aff
*aff
)
143 return isl_aff_dup(aff
);
146 __isl_give isl_aff
*isl_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
150 aff
= isl_aff_alloc(ls
);
154 isl_int_set_si(aff
->v
->el
[0], 1);
155 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
160 /* Return an affine expression that is equal to zero on domain space "space".
162 __isl_give isl_aff
*isl_aff_zero_on_domain_space(__isl_take isl_space
*space
)
164 return isl_aff_zero_on_domain(isl_local_space_from_space(space
));
167 /* This function performs the same operation as isl_aff_zero_on_domain_space,
168 * but is considered as a function on an isl_space when exported.
170 __isl_give isl_aff
*isl_space_zero_aff_on_domain(__isl_take isl_space
*space
)
172 return isl_aff_zero_on_domain_space(space
);
175 /* Return a piecewise affine expression defined on the specified domain
176 * that is equal to zero.
178 __isl_give isl_pw_aff
*isl_pw_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
180 return isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls
));
183 /* Change "aff" into a NaN.
185 * Note that this function gets called from isl_aff_nan_on_domain,
186 * so "aff" may not have been initialized yet.
188 static __isl_give isl_aff
*isl_aff_set_nan(__isl_take isl_aff
*aff
)
190 aff
= isl_aff_cow(aff
);
194 aff
->v
= isl_vec_clr(aff
->v
);
196 return isl_aff_free(aff
);
201 /* Return an affine expression defined on the specified domain
202 * that represents NaN.
204 __isl_give isl_aff
*isl_aff_nan_on_domain(__isl_take isl_local_space
*ls
)
208 aff
= isl_aff_alloc(ls
);
209 return isl_aff_set_nan(aff
);
212 /* Return an affine expression defined on the specified domain space
213 * that represents NaN.
215 __isl_give isl_aff
*isl_aff_nan_on_domain_space(__isl_take isl_space
*space
)
217 return isl_aff_nan_on_domain(isl_local_space_from_space(space
));
220 /* Return a piecewise affine expression defined on the specified domain space
221 * that represents NaN.
223 __isl_give isl_pw_aff
*isl_pw_aff_nan_on_domain_space(
224 __isl_take isl_space
*space
)
226 return isl_pw_aff_from_aff(isl_aff_nan_on_domain_space(space
));
229 /* Return a piecewise affine expression defined on the specified domain
230 * that represents NaN.
232 __isl_give isl_pw_aff
*isl_pw_aff_nan_on_domain(__isl_take isl_local_space
*ls
)
234 return isl_pw_aff_from_aff(isl_aff_nan_on_domain(ls
));
237 /* Return an affine expression that is equal to "val" on
238 * domain local space "ls".
240 __isl_give isl_aff
*isl_aff_val_on_domain(__isl_take isl_local_space
*ls
,
241 __isl_take isl_val
*val
)
247 if (!isl_val_is_rat(val
))
248 isl_die(isl_val_get_ctx(val
), isl_error_invalid
,
249 "expecting rational value", goto error
);
251 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
255 isl_seq_clr(aff
->v
->el
+ 2, aff
->v
->size
- 2);
256 isl_int_set(aff
->v
->el
[1], val
->n
);
257 isl_int_set(aff
->v
->el
[0], val
->d
);
259 isl_local_space_free(ls
);
263 isl_local_space_free(ls
);
268 /* Return an affine expression that is equal to "val" on domain space "space".
270 __isl_give isl_aff
*isl_aff_val_on_domain_space(__isl_take isl_space
*space
,
271 __isl_take isl_val
*val
)
273 return isl_aff_val_on_domain(isl_local_space_from_space(space
), val
);
276 /* Return an affine expression that is equal to the specified dimension
279 __isl_give isl_aff
*isl_aff_var_on_domain(__isl_take isl_local_space
*ls
,
280 enum isl_dim_type type
, unsigned pos
)
288 space
= isl_local_space_get_space(ls
);
291 if (isl_space_is_map(space
))
292 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
293 "expecting (parameter) set space", goto error
);
294 if (isl_local_space_check_range(ls
, type
, pos
, 1) < 0)
297 isl_space_free(space
);
298 aff
= isl_aff_alloc(ls
);
302 pos
+= isl_local_space_offset(aff
->ls
, type
);
304 isl_int_set_si(aff
->v
->el
[0], 1);
305 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
306 isl_int_set_si(aff
->v
->el
[1 + pos
], 1);
310 isl_local_space_free(ls
);
311 isl_space_free(space
);
315 /* Return a piecewise affine expression that is equal to
316 * the specified dimension in "ls".
318 __isl_give isl_pw_aff
*isl_pw_aff_var_on_domain(__isl_take isl_local_space
*ls
,
319 enum isl_dim_type type
, unsigned pos
)
321 return isl_pw_aff_from_aff(isl_aff_var_on_domain(ls
, type
, pos
));
324 /* Return an affine expression that is equal to the parameter
325 * in the domain space "space" with identifier "id".
327 __isl_give isl_aff
*isl_aff_param_on_domain_space_id(
328 __isl_take isl_space
*space
, __isl_take isl_id
*id
)
335 pos
= isl_space_find_dim_by_id(space
, isl_dim_param
, id
);
337 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
338 "parameter not found in space", goto error
);
340 ls
= isl_local_space_from_space(space
);
341 return isl_aff_var_on_domain(ls
, isl_dim_param
, pos
);
343 isl_space_free(space
);
348 /* This function performs the same operation as
349 * isl_aff_param_on_domain_space_id,
350 * but is considered as a function on an isl_space when exported.
352 __isl_give isl_aff
*isl_space_param_aff_on_domain_id(
353 __isl_take isl_space
*space
, __isl_take isl_id
*id
)
355 return isl_aff_param_on_domain_space_id(space
, id
);
358 __isl_null isl_aff
*isl_aff_free(__isl_take isl_aff
*aff
)
366 isl_local_space_free(aff
->ls
);
367 isl_vec_free(aff
->v
);
374 isl_ctx
*isl_aff_get_ctx(__isl_keep isl_aff
*aff
)
376 return aff
? isl_local_space_get_ctx(aff
->ls
) : NULL
;
379 /* Return a hash value that digests "aff".
381 uint32_t isl_aff_get_hash(__isl_keep isl_aff
*aff
)
383 uint32_t hash
, ls_hash
, v_hash
;
388 hash
= isl_hash_init();
389 ls_hash
= isl_local_space_get_hash(aff
->ls
);
390 isl_hash_hash(hash
, ls_hash
);
391 v_hash
= isl_vec_get_hash(aff
->v
);
392 isl_hash_hash(hash
, v_hash
);
397 /* Return the domain local space of "aff".
399 static __isl_keep isl_local_space
*isl_aff_peek_domain_local_space(
400 __isl_keep isl_aff
*aff
)
402 return aff
? aff
->ls
: NULL
;
405 /* Return the number of variables of the given type in the domain of "aff".
407 isl_size
isl_aff_domain_dim(__isl_keep isl_aff
*aff
, enum isl_dim_type type
)
411 ls
= isl_aff_peek_domain_local_space(aff
);
412 return isl_local_space_dim(ls
, type
);
415 /* Externally, an isl_aff has a map space, but internally, the
416 * ls field corresponds to the domain of that space.
418 isl_size
isl_aff_dim(__isl_keep isl_aff
*aff
, enum isl_dim_type type
)
421 return isl_size_error
;
422 if (type
== isl_dim_out
)
424 if (type
== isl_dim_in
)
426 return isl_aff_domain_dim(aff
, type
);
429 /* Return the offset of the first coefficient of type "type" in
430 * the domain of "aff".
432 isl_size
isl_aff_domain_offset(__isl_keep isl_aff
*aff
, enum isl_dim_type type
)
436 ls
= isl_aff_peek_domain_local_space(aff
);
437 return isl_local_space_offset(ls
, type
);
440 /* Return the position of the dimension of the given type and name
442 * Return -1 if no such dimension can be found.
444 int isl_aff_find_dim_by_name(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
449 if (type
== isl_dim_out
)
451 if (type
== isl_dim_in
)
453 return isl_local_space_find_dim_by_name(aff
->ls
, type
, name
);
456 /* Return the domain space of "aff".
458 static __isl_keep isl_space
*isl_aff_peek_domain_space(__isl_keep isl_aff
*aff
)
460 return aff
? isl_local_space_peek_space(aff
->ls
) : NULL
;
463 __isl_give isl_space
*isl_aff_get_domain_space(__isl_keep isl_aff
*aff
)
465 return isl_space_copy(isl_aff_peek_domain_space(aff
));
468 __isl_give isl_space
*isl_aff_get_space(__isl_keep isl_aff
*aff
)
473 space
= isl_local_space_get_space(aff
->ls
);
474 space
= isl_space_from_domain(space
);
475 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
479 /* Return a copy of the domain space of "aff".
481 __isl_give isl_local_space
*isl_aff_get_domain_local_space(
482 __isl_keep isl_aff
*aff
)
484 return isl_local_space_copy(isl_aff_peek_domain_local_space(aff
));
487 __isl_give isl_local_space
*isl_aff_get_local_space(__isl_keep isl_aff
*aff
)
492 ls
= isl_local_space_copy(aff
->ls
);
493 ls
= isl_local_space_from_domain(ls
);
494 ls
= isl_local_space_add_dims(ls
, isl_dim_out
, 1);
498 /* Return the local space of the domain of "aff".
499 * This may be either a copy or the local space itself
500 * if there is only one reference to "aff".
501 * This allows the local space to be modified inplace
502 * if both the expression and its local space have only a single reference.
503 * The caller is not allowed to modify "aff" between this call and
504 * a subsequent call to isl_aff_restore_domain_local_space.
505 * The only exception is that isl_aff_free can be called instead.
507 __isl_give isl_local_space
*isl_aff_take_domain_local_space(
508 __isl_keep isl_aff
*aff
)
515 return isl_aff_get_domain_local_space(aff
);
521 /* Set the local space of the domain of "aff" to "ls",
522 * where the local space of "aff" may be missing
523 * due to a preceding call to isl_aff_take_domain_local_space.
524 * However, in this case, "aff" only has a single reference and
525 * then the call to isl_aff_cow has no effect.
527 __isl_give isl_aff
*isl_aff_restore_domain_local_space(
528 __isl_keep isl_aff
*aff
, __isl_take isl_local_space
*ls
)
534 isl_local_space_free(ls
);
538 aff
= isl_aff_cow(aff
);
541 isl_local_space_free(aff
->ls
);
547 isl_local_space_free(ls
);
551 /* Externally, an isl_aff has a map space, but internally, the
552 * ls field corresponds to the domain of that space.
554 const char *isl_aff_get_dim_name(__isl_keep isl_aff
*aff
,
555 enum isl_dim_type type
, unsigned pos
)
559 if (type
== isl_dim_out
)
561 if (type
== isl_dim_in
)
563 return isl_local_space_get_dim_name(aff
->ls
, type
, pos
);
566 __isl_give isl_aff
*isl_aff_reset_domain_space(__isl_take isl_aff
*aff
,
567 __isl_take isl_space
*space
)
569 aff
= isl_aff_cow(aff
);
573 aff
->ls
= isl_local_space_reset_space(aff
->ls
, space
);
575 return isl_aff_free(aff
);
580 isl_space_free(space
);
584 /* Reset the space of "aff". This function is called from isl_pw_templ.c
585 * and doesn't know if the space of an element object is represented
586 * directly or through its domain. It therefore passes along both.
588 __isl_give isl_aff
*isl_aff_reset_space_and_domain(__isl_take isl_aff
*aff
,
589 __isl_take isl_space
*space
, __isl_take isl_space
*domain
)
591 isl_space_free(space
);
592 return isl_aff_reset_domain_space(aff
, domain
);
595 /* Reorder the coefficients of the affine expression based
596 * on the given reordering.
597 * The reordering r is assumed to have been extended with the local
600 static __isl_give isl_vec
*vec_reorder(__isl_take isl_vec
*vec
,
601 __isl_take isl_reordering
*r
, int n_div
)
611 space
= isl_reordering_peek_space(r
);
612 dim
= isl_space_dim(space
, isl_dim_all
);
615 res
= isl_vec_alloc(vec
->ctx
, 2 + dim
+ n_div
);
618 isl_seq_cpy(res
->el
, vec
->el
, 2);
619 isl_seq_clr(res
->el
+ 2, res
->size
- 2);
620 for (i
= 0; i
< r
->len
; ++i
)
621 isl_int_set(res
->el
[2 + r
->pos
[i
]], vec
->el
[2 + i
]);
623 isl_reordering_free(r
);
628 isl_reordering_free(r
);
632 /* Reorder the dimensions of the domain of "aff" according
633 * to the given reordering.
635 __isl_give isl_aff
*isl_aff_realign_domain(__isl_take isl_aff
*aff
,
636 __isl_take isl_reordering
*r
)
638 aff
= isl_aff_cow(aff
);
642 r
= isl_reordering_extend(r
, aff
->ls
->div
->n_row
);
643 aff
->v
= vec_reorder(aff
->v
, isl_reordering_copy(r
),
644 aff
->ls
->div
->n_row
);
645 aff
->ls
= isl_local_space_realign(aff
->ls
, r
);
647 if (!aff
->v
|| !aff
->ls
)
648 return isl_aff_free(aff
);
653 isl_reordering_free(r
);
657 __isl_give isl_aff
*isl_aff_align_params(__isl_take isl_aff
*aff
,
658 __isl_take isl_space
*model
)
660 isl_bool equal_params
;
665 equal_params
= isl_space_has_equal_params(aff
->ls
->dim
, model
);
666 if (equal_params
< 0)
671 exp
= isl_parameter_alignment_reordering(aff
->ls
->dim
, model
);
672 exp
= isl_reordering_extend_space(exp
,
673 isl_aff_get_domain_space(aff
));
674 aff
= isl_aff_realign_domain(aff
, exp
);
677 isl_space_free(model
);
680 isl_space_free(model
);
687 #include "isl_unbind_params_templ.c"
689 /* Is "aff" obviously equal to zero?
691 * If the denominator is zero, then "aff" is not equal to zero.
693 isl_bool
isl_aff_plain_is_zero(__isl_keep isl_aff
*aff
)
698 return isl_bool_error
;
700 if (isl_int_is_zero(aff
->v
->el
[0]))
701 return isl_bool_false
;
702 pos
= isl_seq_first_non_zero(aff
->v
->el
+ 1, aff
->v
->size
- 1);
703 return isl_bool_ok(pos
< 0);
706 /* Does "aff" represent NaN?
708 isl_bool
isl_aff_is_nan(__isl_keep isl_aff
*aff
)
711 return isl_bool_error
;
713 return isl_bool_ok(isl_seq_first_non_zero(aff
->v
->el
, 2) < 0);
716 /* Are "aff1" and "aff2" obviously equal?
718 * NaN is not equal to anything, not even to another NaN.
720 isl_bool
isl_aff_plain_is_equal(__isl_keep isl_aff
*aff1
,
721 __isl_keep isl_aff
*aff2
)
726 return isl_bool_error
;
728 if (isl_aff_is_nan(aff1
) || isl_aff_is_nan(aff2
))
729 return isl_bool_false
;
731 equal
= isl_local_space_is_equal(aff1
->ls
, aff2
->ls
);
732 if (equal
< 0 || !equal
)
735 return isl_vec_is_equal(aff1
->v
, aff2
->v
);
738 /* Return the common denominator of "aff" in "v".
740 * We cannot return anything meaningful in case of a NaN.
742 isl_stat
isl_aff_get_denominator(__isl_keep isl_aff
*aff
, isl_int
*v
)
745 return isl_stat_error
;
746 if (isl_aff_is_nan(aff
))
747 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
748 "cannot get denominator of NaN", return isl_stat_error
);
749 isl_int_set(*v
, aff
->v
->el
[0]);
753 /* Return the common denominator of "aff".
755 __isl_give isl_val
*isl_aff_get_denominator_val(__isl_keep isl_aff
*aff
)
762 ctx
= isl_aff_get_ctx(aff
);
763 if (isl_aff_is_nan(aff
))
764 return isl_val_nan(ctx
);
765 return isl_val_int_from_isl_int(ctx
, aff
->v
->el
[0]);
768 /* Return the constant term of "aff".
770 __isl_give isl_val
*isl_aff_get_constant_val(__isl_keep isl_aff
*aff
)
778 ctx
= isl_aff_get_ctx(aff
);
779 if (isl_aff_is_nan(aff
))
780 return isl_val_nan(ctx
);
781 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1], aff
->v
->el
[0]);
782 return isl_val_normalize(v
);
785 /* Return the coefficient of the variable of type "type" at position "pos"
788 __isl_give isl_val
*isl_aff_get_coefficient_val(__isl_keep isl_aff
*aff
,
789 enum isl_dim_type type
, int pos
)
797 ctx
= isl_aff_get_ctx(aff
);
798 if (type
== isl_dim_out
)
799 isl_die(ctx
, isl_error_invalid
,
800 "output/set dimension does not have a coefficient",
802 if (type
== isl_dim_in
)
805 if (isl_local_space_check_range(aff
->ls
, type
, pos
, 1) < 0)
808 if (isl_aff_is_nan(aff
))
809 return isl_val_nan(ctx
);
810 pos
+= isl_local_space_offset(aff
->ls
, type
);
811 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1 + pos
], aff
->v
->el
[0]);
812 return isl_val_normalize(v
);
815 /* Return the sign of the coefficient of the variable of type "type"
816 * at position "pos" of "aff".
818 int isl_aff_coefficient_sgn(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
826 ctx
= isl_aff_get_ctx(aff
);
827 if (type
== isl_dim_out
)
828 isl_die(ctx
, isl_error_invalid
,
829 "output/set dimension does not have a coefficient",
831 if (type
== isl_dim_in
)
834 if (isl_local_space_check_range(aff
->ls
, type
, pos
, 1) < 0)
837 pos
+= isl_local_space_offset(aff
->ls
, type
);
838 return isl_int_sgn(aff
->v
->el
[1 + pos
]);
841 /* Replace the numerator of the constant term of "aff" by "v".
843 * A NaN is unaffected by this operation.
845 __isl_give isl_aff
*isl_aff_set_constant(__isl_take isl_aff
*aff
, isl_int v
)
849 if (isl_aff_is_nan(aff
))
851 aff
= isl_aff_cow(aff
);
855 aff
->v
= isl_vec_cow(aff
->v
);
857 return isl_aff_free(aff
);
859 isl_int_set(aff
->v
->el
[1], v
);
864 /* Replace the constant term of "aff" by "v".
866 * A NaN is unaffected by this operation.
868 __isl_give isl_aff
*isl_aff_set_constant_val(__isl_take isl_aff
*aff
,
869 __isl_take isl_val
*v
)
874 if (isl_aff_is_nan(aff
)) {
879 if (!isl_val_is_rat(v
))
880 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
881 "expecting rational value", goto error
);
883 if (isl_int_eq(aff
->v
->el
[1], v
->n
) &&
884 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
889 aff
= isl_aff_cow(aff
);
892 aff
->v
= isl_vec_cow(aff
->v
);
896 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
897 isl_int_set(aff
->v
->el
[1], v
->n
);
898 } else if (isl_int_is_one(v
->d
)) {
899 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
901 isl_seq_scale(aff
->v
->el
+ 1,
902 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
903 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
904 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
905 aff
->v
= isl_vec_normalize(aff
->v
);
918 /* Add "v" to the constant term of "aff".
920 * A NaN is unaffected by this operation.
922 __isl_give isl_aff
*isl_aff_add_constant(__isl_take isl_aff
*aff
, isl_int v
)
924 if (isl_int_is_zero(v
))
929 if (isl_aff_is_nan(aff
))
931 aff
= isl_aff_cow(aff
);
935 aff
->v
= isl_vec_cow(aff
->v
);
937 return isl_aff_free(aff
);
939 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
);
944 /* Add "v" to the constant term of "aff",
945 * in case "aff" is a rational expression.
947 static __isl_give isl_aff
*isl_aff_add_rat_constant_val(__isl_take isl_aff
*aff
,
948 __isl_take isl_val
*v
)
950 aff
= isl_aff_cow(aff
);
954 aff
->v
= isl_vec_cow(aff
->v
);
958 if (isl_int_is_one(v
->d
)) {
959 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
960 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
961 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
->n
);
962 aff
->v
= isl_vec_normalize(aff
->v
);
966 isl_seq_scale(aff
->v
->el
+ 1,
967 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
968 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
969 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
970 aff
->v
= isl_vec_normalize(aff
->v
);
983 /* Return the first argument and free the second.
985 static __isl_give isl_aff
*pick_free(__isl_take isl_aff
*aff
,
986 __isl_take isl_val
*v
)
992 /* Replace the first argument by NaN and free the second argument.
994 static __isl_give isl_aff
*set_nan_free_val(__isl_take isl_aff
*aff
,
995 __isl_take isl_val
*v
)
998 return isl_aff_set_nan(aff
);
1001 /* Add "v" to the constant term of "aff".
1003 * A NaN is unaffected by this operation.
1004 * Conversely, adding a NaN turns "aff" into a NaN.
1006 __isl_give isl_aff
*isl_aff_add_constant_val(__isl_take isl_aff
*aff
,
1007 __isl_take isl_val
*v
)
1009 isl_bool is_nan
, is_zero
, is_rat
;
1011 is_nan
= isl_aff_is_nan(aff
);
1012 is_zero
= isl_val_is_zero(v
);
1013 if (is_nan
< 0 || is_zero
< 0)
1015 if (is_nan
|| is_zero
)
1016 return pick_free(aff
, v
);
1018 is_nan
= isl_val_is_nan(v
);
1019 is_rat
= isl_val_is_rat(v
);
1020 if (is_nan
< 0 || is_rat
< 0)
1023 return set_nan_free_val(aff
, v
);
1025 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1026 "expecting rational value or NaN", goto error
);
1028 return isl_aff_add_rat_constant_val(aff
, v
);
1035 __isl_give isl_aff
*isl_aff_add_constant_si(__isl_take isl_aff
*aff
, int v
)
1040 isl_int_set_si(t
, v
);
1041 aff
= isl_aff_add_constant(aff
, t
);
1047 /* Add "v" to the numerator of the constant term of "aff".
1049 * A NaN is unaffected by this operation.
1051 __isl_give isl_aff
*isl_aff_add_constant_num(__isl_take isl_aff
*aff
, isl_int v
)
1053 if (isl_int_is_zero(v
))
1058 if (isl_aff_is_nan(aff
))
1060 aff
= isl_aff_cow(aff
);
1064 aff
->v
= isl_vec_cow(aff
->v
);
1066 return isl_aff_free(aff
);
1068 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
);
1073 /* Add "v" to the numerator of the constant term of "aff".
1075 * A NaN is unaffected by this operation.
1077 __isl_give isl_aff
*isl_aff_add_constant_num_si(__isl_take isl_aff
*aff
, int v
)
1085 isl_int_set_si(t
, v
);
1086 aff
= isl_aff_add_constant_num(aff
, t
);
1092 /* Replace the numerator of the constant term of "aff" by "v".
1094 * A NaN is unaffected by this operation.
1096 __isl_give isl_aff
*isl_aff_set_constant_si(__isl_take isl_aff
*aff
, int v
)
1100 if (isl_aff_is_nan(aff
))
1102 aff
= isl_aff_cow(aff
);
1106 aff
->v
= isl_vec_cow(aff
->v
);
1108 return isl_aff_free(aff
);
1110 isl_int_set_si(aff
->v
->el
[1], v
);
1115 /* Replace the numerator of the coefficient of the variable of type "type"
1116 * at position "pos" of "aff" by "v".
1118 * A NaN is unaffected by this operation.
1120 __isl_give isl_aff
*isl_aff_set_coefficient(__isl_take isl_aff
*aff
,
1121 enum isl_dim_type type
, int pos
, isl_int v
)
1126 if (type
== isl_dim_out
)
1127 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1128 "output/set dimension does not have a coefficient",
1129 return isl_aff_free(aff
));
1130 if (type
== isl_dim_in
)
1133 if (isl_local_space_check_range(aff
->ls
, type
, pos
, 1) < 0)
1134 return isl_aff_free(aff
);
1136 if (isl_aff_is_nan(aff
))
1138 aff
= isl_aff_cow(aff
);
1142 aff
->v
= isl_vec_cow(aff
->v
);
1144 return isl_aff_free(aff
);
1146 pos
+= isl_local_space_offset(aff
->ls
, type
);
1147 isl_int_set(aff
->v
->el
[1 + pos
], v
);
1152 /* Replace the numerator of the coefficient of the variable of type "type"
1153 * at position "pos" of "aff" by "v".
1155 * A NaN is unaffected by this operation.
1157 __isl_give isl_aff
*isl_aff_set_coefficient_si(__isl_take isl_aff
*aff
,
1158 enum isl_dim_type type
, int pos
, int v
)
1163 if (type
== isl_dim_out
)
1164 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1165 "output/set dimension does not have a coefficient",
1166 return isl_aff_free(aff
));
1167 if (type
== isl_dim_in
)
1170 if (isl_local_space_check_range(aff
->ls
, type
, pos
, 1) < 0)
1171 return isl_aff_free(aff
);
1173 if (isl_aff_is_nan(aff
))
1175 pos
+= isl_local_space_offset(aff
->ls
, type
);
1176 if (isl_int_cmp_si(aff
->v
->el
[1 + pos
], v
) == 0)
1179 aff
= isl_aff_cow(aff
);
1183 aff
->v
= isl_vec_cow(aff
->v
);
1185 return isl_aff_free(aff
);
1187 isl_int_set_si(aff
->v
->el
[1 + pos
], v
);
1192 /* Replace the coefficient of the variable of type "type" at position "pos"
1195 * A NaN is unaffected by this operation.
1197 __isl_give isl_aff
*isl_aff_set_coefficient_val(__isl_take isl_aff
*aff
,
1198 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1203 if (type
== isl_dim_out
)
1204 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1205 "output/set dimension does not have a coefficient",
1207 if (type
== isl_dim_in
)
1210 if (isl_local_space_check_range(aff
->ls
, type
, pos
, 1) < 0)
1211 return isl_aff_free(aff
);
1213 if (isl_aff_is_nan(aff
)) {
1217 if (!isl_val_is_rat(v
))
1218 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1219 "expecting rational value", goto error
);
1221 pos
+= isl_local_space_offset(aff
->ls
, type
);
1222 if (isl_int_eq(aff
->v
->el
[1 + pos
], v
->n
) &&
1223 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1228 aff
= isl_aff_cow(aff
);
1231 aff
->v
= isl_vec_cow(aff
->v
);
1235 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1236 isl_int_set(aff
->v
->el
[1 + pos
], v
->n
);
1237 } else if (isl_int_is_one(v
->d
)) {
1238 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1240 isl_seq_scale(aff
->v
->el
+ 1,
1241 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1242 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1243 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1244 aff
->v
= isl_vec_normalize(aff
->v
);
1257 /* Add "v" to the coefficient of the variable of type "type"
1258 * at position "pos" of "aff".
1260 * A NaN is unaffected by this operation.
1262 __isl_give isl_aff
*isl_aff_add_coefficient(__isl_take isl_aff
*aff
,
1263 enum isl_dim_type type
, int pos
, isl_int v
)
1268 if (type
== isl_dim_out
)
1269 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1270 "output/set dimension does not have a coefficient",
1271 return isl_aff_free(aff
));
1272 if (type
== isl_dim_in
)
1275 if (isl_local_space_check_range(aff
->ls
, type
, pos
, 1) < 0)
1276 return isl_aff_free(aff
);
1278 if (isl_aff_is_nan(aff
))
1280 aff
= isl_aff_cow(aff
);
1284 aff
->v
= isl_vec_cow(aff
->v
);
1286 return isl_aff_free(aff
);
1288 pos
+= isl_local_space_offset(aff
->ls
, type
);
1289 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
);
1294 /* Add "v" to the coefficient of the variable of type "type"
1295 * at position "pos" of "aff".
1297 * A NaN is unaffected by this operation.
1299 __isl_give isl_aff
*isl_aff_add_coefficient_val(__isl_take isl_aff
*aff
,
1300 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1305 if (isl_val_is_zero(v
)) {
1310 if (type
== isl_dim_out
)
1311 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1312 "output/set dimension does not have a coefficient",
1314 if (type
== isl_dim_in
)
1317 if (isl_local_space_check_range(aff
->ls
, type
, pos
, 1) < 0)
1320 if (isl_aff_is_nan(aff
)) {
1324 if (!isl_val_is_rat(v
))
1325 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1326 "expecting rational value", goto error
);
1328 aff
= isl_aff_cow(aff
);
1332 aff
->v
= isl_vec_cow(aff
->v
);
1336 pos
+= isl_local_space_offset(aff
->ls
, type
);
1337 if (isl_int_is_one(v
->d
)) {
1338 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1339 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1340 isl_int_add(aff
->v
->el
[1 + pos
], aff
->v
->el
[1 + pos
], v
->n
);
1341 aff
->v
= isl_vec_normalize(aff
->v
);
1345 isl_seq_scale(aff
->v
->el
+ 1,
1346 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1347 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1348 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1349 aff
->v
= isl_vec_normalize(aff
->v
);
1362 __isl_give isl_aff
*isl_aff_add_coefficient_si(__isl_take isl_aff
*aff
,
1363 enum isl_dim_type type
, int pos
, int v
)
1368 isl_int_set_si(t
, v
);
1369 aff
= isl_aff_add_coefficient(aff
, type
, pos
, t
);
1375 __isl_give isl_aff
*isl_aff_get_div(__isl_keep isl_aff
*aff
, int pos
)
1380 return isl_local_space_get_div(aff
->ls
, pos
);
1383 /* Return the negation of "aff".
1385 * As a special case, -NaN = NaN.
1387 __isl_give isl_aff
*isl_aff_neg(__isl_take isl_aff
*aff
)
1391 if (isl_aff_is_nan(aff
))
1393 aff
= isl_aff_cow(aff
);
1396 aff
->v
= isl_vec_cow(aff
->v
);
1398 return isl_aff_free(aff
);
1400 isl_seq_neg(aff
->v
->el
+ 1, aff
->v
->el
+ 1, aff
->v
->size
- 1);
1405 /* Remove divs from the local space that do not appear in the affine
1407 * We currently only remove divs at the end.
1408 * Some intermediate divs may also not appear directly in the affine
1409 * expression, but we would also need to check that no other divs are
1410 * defined in terms of them.
1412 __isl_give isl_aff
*isl_aff_remove_unused_divs(__isl_take isl_aff
*aff
)
1418 n
= isl_aff_domain_dim(aff
, isl_dim_div
);
1419 off
= isl_aff_domain_offset(aff
, isl_dim_div
);
1420 if (n
< 0 || off
< 0)
1421 return isl_aff_free(aff
);
1423 pos
= isl_seq_last_non_zero(aff
->v
->el
+ 1 + off
, n
) + 1;
1427 aff
= isl_aff_cow(aff
);
1431 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, isl_dim_div
, pos
, n
- pos
);
1432 aff
->v
= isl_vec_drop_els(aff
->v
, 1 + off
+ pos
, n
- pos
);
1433 if (!aff
->ls
|| !aff
->v
)
1434 return isl_aff_free(aff
);
1439 /* Look for any divs in the aff->ls with a denominator equal to one
1440 * and plug them into the affine expression and any subsequent divs
1441 * that may reference the div.
1443 static __isl_give isl_aff
*plug_in_integral_divs(__isl_take isl_aff
*aff
)
1450 isl_local_space
*ls
;
1453 n
= isl_aff_domain_dim(aff
, isl_dim_div
);
1454 off
= isl_aff_domain_offset(aff
, isl_dim_div
);
1455 if (n
< 0 || off
< 0)
1456 return isl_aff_free(aff
);
1458 for (i
= 0; i
< n
; ++i
) {
1459 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][0]))
1461 ls
= isl_local_space_copy(aff
->ls
);
1462 ls
= isl_local_space_substitute_seq(ls
, isl_dim_div
, i
,
1463 aff
->ls
->div
->row
[i
], len
, i
+ 1, n
- (i
+ 1));
1464 vec
= isl_vec_copy(aff
->v
);
1465 vec
= isl_vec_cow(vec
);
1471 isl_seq_substitute(vec
->el
, off
+ i
, aff
->ls
->div
->row
[i
],
1476 isl_vec_free(aff
->v
);
1478 isl_local_space_free(aff
->ls
);
1485 isl_local_space_free(ls
);
1486 return isl_aff_free(aff
);
1489 /* Look for any divs j that appear with a unit coefficient inside
1490 * the definitions of other divs i and plug them into the definitions
1493 * In particular, an expression of the form
1495 * floor((f(..) + floor(g(..)/n))/m)
1499 * floor((n * f(..) + g(..))/(n * m))
1501 * This simplification is correct because we can move the expression
1502 * f(..) into the inner floor in the original expression to obtain
1504 * floor(floor((n * f(..) + g(..))/n)/m)
1506 * from which we can derive the simplified expression.
1508 static __isl_give isl_aff
*plug_in_unit_divs(__isl_take isl_aff
*aff
)
1514 n
= isl_aff_domain_dim(aff
, isl_dim_div
);
1515 off
= isl_aff_domain_offset(aff
, isl_dim_div
);
1516 if (n
< 0 || off
< 0)
1517 return isl_aff_free(aff
);
1518 for (i
= 1; i
< n
; ++i
) {
1519 for (j
= 0; j
< i
; ++j
) {
1520 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][1 + off
+ j
]))
1522 aff
->ls
= isl_local_space_substitute_seq(aff
->ls
,
1523 isl_dim_div
, j
, aff
->ls
->div
->row
[j
],
1524 aff
->v
->size
, i
, 1);
1526 return isl_aff_free(aff
);
1533 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
1535 * Even though this function is only called on isl_affs with a single
1536 * reference, we are careful to only change aff->v and aff->ls together.
1538 static __isl_give isl_aff
*swap_div(__isl_take isl_aff
*aff
, int a
, int b
)
1540 isl_size off
= isl_aff_domain_offset(aff
, isl_dim_div
);
1541 isl_local_space
*ls
;
1545 return isl_aff_free(aff
);
1547 ls
= isl_local_space_copy(aff
->ls
);
1548 ls
= isl_local_space_swap_div(ls
, a
, b
);
1549 v
= isl_vec_copy(aff
->v
);
1554 isl_int_swap(v
->el
[1 + off
+ a
], v
->el
[1 + off
+ b
]);
1555 isl_vec_free(aff
->v
);
1557 isl_local_space_free(aff
->ls
);
1563 isl_local_space_free(ls
);
1564 return isl_aff_free(aff
);
1567 /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL.
1569 * We currently do not actually remove div "b", but simply add its
1570 * coefficient to that of "a" and then zero it out.
1572 static __isl_give isl_aff
*merge_divs(__isl_take isl_aff
*aff
, int a
, int b
)
1574 isl_size off
= isl_aff_domain_offset(aff
, isl_dim_div
);
1577 return isl_aff_free(aff
);
1579 if (isl_int_is_zero(aff
->v
->el
[1 + off
+ b
]))
1582 aff
->v
= isl_vec_cow(aff
->v
);
1584 return isl_aff_free(aff
);
1586 isl_int_add(aff
->v
->el
[1 + off
+ a
],
1587 aff
->v
->el
[1 + off
+ a
], aff
->v
->el
[1 + off
+ b
]);
1588 isl_int_set_si(aff
->v
->el
[1 + off
+ b
], 0);
1593 /* Sort the divs in the local space of "aff" according to
1594 * the comparison function "cmp_row" in isl_local_space.c,
1595 * combining the coefficients of identical divs.
1597 * Reordering divs does not change the semantics of "aff",
1598 * so there is no need to call isl_aff_cow.
1599 * Moreover, this function is currently only called on isl_affs
1600 * with a single reference.
1602 static __isl_give isl_aff
*sort_divs(__isl_take isl_aff
*aff
)
1607 n
= isl_aff_dim(aff
, isl_dim_div
);
1609 return isl_aff_free(aff
);
1610 for (i
= 1; i
< n
; ++i
) {
1611 for (j
= i
- 1; j
>= 0; --j
) {
1612 int cmp
= isl_mat_cmp_div(aff
->ls
->div
, j
, j
+ 1);
1616 aff
= merge_divs(aff
, j
, j
+ 1);
1618 aff
= swap_div(aff
, j
, j
+ 1);
1627 /* Normalize the representation of "aff".
1629 * This function should only be called on "new" isl_affs, i.e.,
1630 * with only a single reference. We therefore do not need to
1631 * worry about affecting other instances.
1633 __isl_give isl_aff
*isl_aff_normalize(__isl_take isl_aff
*aff
)
1637 aff
->v
= isl_vec_normalize(aff
->v
);
1639 return isl_aff_free(aff
);
1640 aff
= plug_in_integral_divs(aff
);
1641 aff
= plug_in_unit_divs(aff
);
1642 aff
= sort_divs(aff
);
1643 aff
= isl_aff_remove_unused_divs(aff
);
1647 /* Given f, return floor(f).
1648 * If f is an integer expression, then just return f.
1649 * If f is a constant, then return the constant floor(f).
1650 * Otherwise, if f = g/m, write g = q m + r,
1651 * create a new div d = [r/m] and return the expression q + d.
1652 * The coefficients in r are taken to lie between -m/2 and m/2.
1654 * reduce_div_coefficients performs the same normalization.
1656 * As a special case, floor(NaN) = NaN.
1658 __isl_give isl_aff
*isl_aff_floor(__isl_take isl_aff
*aff
)
1668 if (isl_aff_is_nan(aff
))
1670 if (isl_int_is_one(aff
->v
->el
[0]))
1673 aff
= isl_aff_cow(aff
);
1677 aff
->v
= isl_vec_cow(aff
->v
);
1679 return isl_aff_free(aff
);
1681 if (isl_aff_is_cst(aff
)) {
1682 isl_int_fdiv_q(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1683 isl_int_set_si(aff
->v
->el
[0], 1);
1687 div
= isl_vec_copy(aff
->v
);
1688 div
= isl_vec_cow(div
);
1690 return isl_aff_free(aff
);
1692 ctx
= isl_aff_get_ctx(aff
);
1693 isl_int_fdiv_q(aff
->v
->el
[0], aff
->v
->el
[0], ctx
->two
);
1694 for (i
= 1; i
< aff
->v
->size
; ++i
) {
1695 isl_int_fdiv_r(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1696 isl_int_fdiv_q(aff
->v
->el
[i
], aff
->v
->el
[i
], div
->el
[0]);
1697 if (isl_int_gt(div
->el
[i
], aff
->v
->el
[0])) {
1698 isl_int_sub(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1699 isl_int_add_ui(aff
->v
->el
[i
], aff
->v
->el
[i
], 1);
1703 aff
->ls
= isl_local_space_add_div(aff
->ls
, div
);
1705 return isl_aff_free(aff
);
1707 size
= aff
->v
->size
;
1708 aff
->v
= isl_vec_extend(aff
->v
, size
+ 1);
1710 return isl_aff_free(aff
);
1711 isl_int_set_si(aff
->v
->el
[0], 1);
1712 isl_int_set_si(aff
->v
->el
[size
], 1);
1714 aff
= isl_aff_normalize(aff
);
1721 * aff mod m = aff - m * floor(aff/m)
1723 * with m an integer value.
1725 __isl_give isl_aff
*isl_aff_mod_val(__isl_take isl_aff
*aff
,
1726 __isl_take isl_val
*m
)
1733 if (!isl_val_is_int(m
))
1734 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
1735 "expecting integer modulo", goto error
);
1737 res
= isl_aff_copy(aff
);
1738 aff
= isl_aff_scale_down_val(aff
, isl_val_copy(m
));
1739 aff
= isl_aff_floor(aff
);
1740 aff
= isl_aff_scale_val(aff
, m
);
1741 res
= isl_aff_sub(res
, aff
);
1752 * pwaff mod m = pwaff - m * floor(pwaff/m)
1754 __isl_give isl_pw_aff
*isl_pw_aff_mod(__isl_take isl_pw_aff
*pwaff
, isl_int m
)
1758 res
= isl_pw_aff_copy(pwaff
);
1759 pwaff
= isl_pw_aff_scale_down(pwaff
, m
);
1760 pwaff
= isl_pw_aff_floor(pwaff
);
1761 pwaff
= isl_pw_aff_scale(pwaff
, m
);
1762 res
= isl_pw_aff_sub(res
, pwaff
);
1769 * pa mod m = pa - m * floor(pa/m)
1771 * with m an integer value.
1773 __isl_give isl_pw_aff
*isl_pw_aff_mod_val(__isl_take isl_pw_aff
*pa
,
1774 __isl_take isl_val
*m
)
1778 if (!isl_val_is_int(m
))
1779 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
1780 "expecting integer modulo", goto error
);
1781 pa
= isl_pw_aff_mod(pa
, m
->n
);
1785 isl_pw_aff_free(pa
);
1790 /* Given f, return ceil(f).
1791 * If f is an integer expression, then just return f.
1792 * Otherwise, let f be the expression
1798 * floor((e + m - 1)/m)
1800 * As a special case, ceil(NaN) = NaN.
1802 __isl_give isl_aff
*isl_aff_ceil(__isl_take isl_aff
*aff
)
1807 if (isl_aff_is_nan(aff
))
1809 if (isl_int_is_one(aff
->v
->el
[0]))
1812 aff
= isl_aff_cow(aff
);
1815 aff
->v
= isl_vec_cow(aff
->v
);
1817 return isl_aff_free(aff
);
1819 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1820 isl_int_sub_ui(aff
->v
->el
[1], aff
->v
->el
[1], 1);
1821 aff
= isl_aff_floor(aff
);
1826 /* Apply the expansion computed by isl_merge_divs.
1827 * The expansion itself is given by "exp" while the resulting
1828 * list of divs is given by "div".
1830 __isl_give isl_aff
*isl_aff_expand_divs(__isl_take isl_aff
*aff
,
1831 __isl_take isl_mat
*div
, int *exp
)
1837 aff
= isl_aff_cow(aff
);
1839 offset
= isl_aff_domain_offset(aff
, isl_dim_div
);
1840 old_n_div
= isl_aff_domain_dim(aff
, isl_dim_div
);
1841 new_n_div
= isl_mat_rows(div
);
1842 if (offset
< 0 || old_n_div
< 0 || new_n_div
< 0)
1845 aff
->v
= isl_vec_expand(aff
->v
, 1 + offset
, old_n_div
, exp
, new_n_div
);
1846 aff
->ls
= isl_local_space_replace_divs(aff
->ls
, div
);
1847 if (!aff
->v
|| !aff
->ls
)
1848 return isl_aff_free(aff
);
1856 /* Add two affine expressions that live in the same local space.
1858 static __isl_give isl_aff
*add_expanded(__isl_take isl_aff
*aff1
,
1859 __isl_take isl_aff
*aff2
)
1863 aff1
= isl_aff_cow(aff1
);
1867 aff1
->v
= isl_vec_cow(aff1
->v
);
1873 isl_int_gcd(gcd
, aff1
->v
->el
[0], aff2
->v
->el
[0]);
1874 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1875 isl_seq_scale(aff1
->v
->el
+ 1, aff1
->v
->el
+ 1, f
, aff1
->v
->size
- 1);
1876 isl_int_divexact(f
, aff1
->v
->el
[0], gcd
);
1877 isl_seq_addmul(aff1
->v
->el
+ 1, f
, aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
1878 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1879 isl_int_mul(aff1
->v
->el
[0], aff1
->v
->el
[0], f
);
1884 aff1
= isl_aff_normalize(aff1
);
1892 /* Replace one of the arguments by a NaN and free the other one.
1894 static __isl_give isl_aff
*set_nan_free(__isl_take isl_aff
*aff1
,
1895 __isl_take isl_aff
*aff2
)
1898 return isl_aff_set_nan(aff1
);
1901 /* Return the sum of "aff1" and "aff2".
1903 * If either of the two is NaN, then the result is NaN.
1905 __isl_give isl_aff
*isl_aff_add(__isl_take isl_aff
*aff1
,
1906 __isl_take isl_aff
*aff2
)
1912 isl_size n_div1
, n_div2
;
1917 ctx
= isl_aff_get_ctx(aff1
);
1918 if (!isl_space_is_equal(aff1
->ls
->dim
, aff2
->ls
->dim
))
1919 isl_die(ctx
, isl_error_invalid
,
1920 "spaces don't match", goto error
);
1922 if (isl_aff_is_nan(aff1
)) {
1926 if (isl_aff_is_nan(aff2
)) {
1931 n_div1
= isl_aff_dim(aff1
, isl_dim_div
);
1932 n_div2
= isl_aff_dim(aff2
, isl_dim_div
);
1933 if (n_div1
< 0 || n_div2
< 0)
1935 if (n_div1
== 0 && n_div2
== 0)
1936 return add_expanded(aff1
, aff2
);
1938 exp1
= isl_alloc_array(ctx
, int, n_div1
);
1939 exp2
= isl_alloc_array(ctx
, int, n_div2
);
1940 if ((n_div1
&& !exp1
) || (n_div2
&& !exp2
))
1943 div
= isl_merge_divs(aff1
->ls
->div
, aff2
->ls
->div
, exp1
, exp2
);
1944 aff1
= isl_aff_expand_divs(aff1
, isl_mat_copy(div
), exp1
);
1945 aff2
= isl_aff_expand_divs(aff2
, div
, exp2
);
1949 return add_expanded(aff1
, aff2
);
1958 __isl_give isl_aff
*isl_aff_sub(__isl_take isl_aff
*aff1
,
1959 __isl_take isl_aff
*aff2
)
1961 return isl_aff_add(aff1
, isl_aff_neg(aff2
));
1964 /* Return the result of scaling "aff" by a factor of "f".
1966 * As a special case, f * NaN = NaN.
1968 __isl_give isl_aff
*isl_aff_scale(__isl_take isl_aff
*aff
, isl_int f
)
1974 if (isl_aff_is_nan(aff
))
1977 if (isl_int_is_one(f
))
1980 aff
= isl_aff_cow(aff
);
1983 aff
->v
= isl_vec_cow(aff
->v
);
1985 return isl_aff_free(aff
);
1987 if (isl_int_is_pos(f
) && isl_int_is_divisible_by(aff
->v
->el
[0], f
)) {
1988 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], f
);
1993 isl_int_gcd(gcd
, aff
->v
->el
[0], f
);
1994 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1995 isl_int_divexact(gcd
, f
, gcd
);
1996 isl_seq_scale(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
2002 /* Multiple "aff" by "v".
2004 __isl_give isl_aff
*isl_aff_scale_val(__isl_take isl_aff
*aff
,
2005 __isl_take isl_val
*v
)
2010 if (isl_val_is_one(v
)) {
2015 if (!isl_val_is_rat(v
))
2016 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2017 "expecting rational factor", goto error
);
2019 aff
= isl_aff_scale(aff
, v
->n
);
2020 aff
= isl_aff_scale_down(aff
, v
->d
);
2030 /* Return the result of scaling "aff" down by a factor of "f".
2032 * As a special case, NaN/f = NaN.
2034 __isl_give isl_aff
*isl_aff_scale_down(__isl_take isl_aff
*aff
, isl_int f
)
2040 if (isl_aff_is_nan(aff
))
2043 if (isl_int_is_one(f
))
2046 aff
= isl_aff_cow(aff
);
2050 if (isl_int_is_zero(f
))
2051 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2052 "cannot scale down by zero", return isl_aff_free(aff
));
2054 aff
->v
= isl_vec_cow(aff
->v
);
2056 return isl_aff_free(aff
);
2059 isl_seq_gcd(aff
->v
->el
+ 1, aff
->v
->size
- 1, &gcd
);
2060 isl_int_gcd(gcd
, gcd
, f
);
2061 isl_seq_scale_down(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
2062 isl_int_divexact(gcd
, f
, gcd
);
2063 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
2069 /* Divide "aff" by "v".
2071 __isl_give isl_aff
*isl_aff_scale_down_val(__isl_take isl_aff
*aff
,
2072 __isl_take isl_val
*v
)
2077 if (isl_val_is_one(v
)) {
2082 if (!isl_val_is_rat(v
))
2083 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2084 "expecting rational factor", goto error
);
2085 if (!isl_val_is_pos(v
))
2086 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2087 "factor needs to be positive", goto error
);
2089 aff
= isl_aff_scale(aff
, v
->d
);
2090 aff
= isl_aff_scale_down(aff
, v
->n
);
2100 __isl_give isl_aff
*isl_aff_scale_down_ui(__isl_take isl_aff
*aff
, unsigned f
)
2108 isl_int_set_ui(v
, f
);
2109 aff
= isl_aff_scale_down(aff
, v
);
2115 __isl_give isl_aff
*isl_aff_set_dim_name(__isl_take isl_aff
*aff
,
2116 enum isl_dim_type type
, unsigned pos
, const char *s
)
2118 aff
= isl_aff_cow(aff
);
2121 if (type
== isl_dim_out
)
2122 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2123 "cannot set name of output/set dimension",
2124 return isl_aff_free(aff
));
2125 if (type
== isl_dim_in
)
2127 aff
->ls
= isl_local_space_set_dim_name(aff
->ls
, type
, pos
, s
);
2129 return isl_aff_free(aff
);
2134 __isl_give isl_aff
*isl_aff_set_dim_id(__isl_take isl_aff
*aff
,
2135 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
2137 aff
= isl_aff_cow(aff
);
2140 if (type
== isl_dim_out
)
2141 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2142 "cannot set name of output/set dimension",
2144 if (type
== isl_dim_in
)
2146 aff
->ls
= isl_local_space_set_dim_id(aff
->ls
, type
, pos
, id
);
2148 return isl_aff_free(aff
);
2157 /* Replace the identifier of the input tuple of "aff" by "id".
2158 * type is currently required to be equal to isl_dim_in
2160 __isl_give isl_aff
*isl_aff_set_tuple_id(__isl_take isl_aff
*aff
,
2161 enum isl_dim_type type
, __isl_take isl_id
*id
)
2163 aff
= isl_aff_cow(aff
);
2166 if (type
!= isl_dim_in
)
2167 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2168 "cannot only set id of input tuple", goto error
);
2169 aff
->ls
= isl_local_space_set_tuple_id(aff
->ls
, isl_dim_set
, id
);
2171 return isl_aff_free(aff
);
2180 /* Exploit the equalities in "eq" to simplify the affine expression
2181 * and the expressions of the integer divisions in the local space.
2182 * The integer divisions in this local space are assumed to appear
2183 * as regular dimensions in "eq".
2185 static __isl_give isl_aff
*isl_aff_substitute_equalities_lifted(
2186 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
2194 if (eq
->n_eq
== 0) {
2195 isl_basic_set_free(eq
);
2199 aff
= isl_aff_cow(aff
);
2203 aff
->ls
= isl_local_space_substitute_equalities(aff
->ls
,
2204 isl_basic_set_copy(eq
));
2205 aff
->v
= isl_vec_cow(aff
->v
);
2206 if (!aff
->ls
|| !aff
->v
)
2209 o_div
= isl_basic_set_offset(eq
, isl_dim_div
);
2211 for (i
= 0; i
< eq
->n_eq
; ++i
) {
2212 j
= isl_seq_last_non_zero(eq
->eq
[i
], o_div
+ n_div
);
2213 if (j
< 0 || j
== 0 || j
>= o_div
)
2216 isl_seq_elim(aff
->v
->el
+ 1, eq
->eq
[i
], j
, o_div
,
2220 isl_basic_set_free(eq
);
2221 aff
= isl_aff_normalize(aff
);
2224 isl_basic_set_free(eq
);
2229 /* Exploit the equalities in "eq" to simplify the affine expression
2230 * and the expressions of the integer divisions in the local space.
2232 __isl_give isl_aff
*isl_aff_substitute_equalities(__isl_take isl_aff
*aff
,
2233 __isl_take isl_basic_set
*eq
)
2237 n_div
= isl_aff_domain_dim(aff
, isl_dim_div
);
2241 eq
= isl_basic_set_add_dims(eq
, isl_dim_set
, n_div
);
2242 return isl_aff_substitute_equalities_lifted(aff
, eq
);
2244 isl_basic_set_free(eq
);
2249 /* Look for equalities among the variables shared by context and aff
2250 * and the integer divisions of aff, if any.
2251 * The equalities are then used to eliminate coefficients and/or integer
2252 * divisions from aff.
2254 __isl_give isl_aff
*isl_aff_gist(__isl_take isl_aff
*aff
,
2255 __isl_take isl_set
*context
)
2257 isl_local_space
*ls
;
2258 isl_basic_set
*hull
;
2260 ls
= isl_aff_get_domain_local_space(aff
);
2261 context
= isl_local_space_lift_set(ls
, context
);
2263 hull
= isl_set_affine_hull(context
);
2264 return isl_aff_substitute_equalities_lifted(aff
, hull
);
2267 __isl_give isl_aff
*isl_aff_gist_params(__isl_take isl_aff
*aff
,
2268 __isl_take isl_set
*context
)
2270 isl_set
*dom_context
= isl_set_universe(isl_aff_get_domain_space(aff
));
2271 dom_context
= isl_set_intersect_params(dom_context
, context
);
2272 return isl_aff_gist(aff
, dom_context
);
2275 /* Return a basic set containing those elements in the space
2276 * of aff where it is positive. "rational" should not be set.
2278 * If "aff" is NaN, then it is not positive.
2280 static __isl_give isl_basic_set
*aff_pos_basic_set(__isl_take isl_aff
*aff
,
2281 int rational
, void *user
)
2283 isl_constraint
*ineq
;
2284 isl_basic_set
*bset
;
2289 if (isl_aff_is_nan(aff
)) {
2290 isl_space
*space
= isl_aff_get_domain_space(aff
);
2292 return isl_basic_set_empty(space
);
2295 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2296 "rational sets not supported", goto error
);
2298 ineq
= isl_inequality_from_aff(aff
);
2299 c
= isl_constraint_get_constant_val(ineq
);
2300 c
= isl_val_sub_ui(c
, 1);
2301 ineq
= isl_constraint_set_constant_val(ineq
, c
);
2303 bset
= isl_basic_set_from_constraint(ineq
);
2304 bset
= isl_basic_set_simplify(bset
);
2311 /* Return a basic set containing those elements in the space
2312 * of aff where it is non-negative.
2313 * If "rational" is set, then return a rational basic set.
2315 * If "aff" is NaN, then it is not non-negative (it's not negative either).
2317 static __isl_give isl_basic_set
*aff_nonneg_basic_set(
2318 __isl_take isl_aff
*aff
, int rational
, void *user
)
2320 isl_constraint
*ineq
;
2321 isl_basic_set
*bset
;
2325 if (isl_aff_is_nan(aff
)) {
2326 isl_space
*space
= isl_aff_get_domain_space(aff
);
2328 return isl_basic_set_empty(space
);
2331 ineq
= isl_inequality_from_aff(aff
);
2333 bset
= isl_basic_set_from_constraint(ineq
);
2335 bset
= isl_basic_set_set_rational(bset
);
2336 bset
= isl_basic_set_simplify(bset
);
2340 /* Return a basic set containing those elements in the space
2341 * of aff where it is non-negative.
2343 __isl_give isl_basic_set
*isl_aff_nonneg_basic_set(__isl_take isl_aff
*aff
)
2345 return aff_nonneg_basic_set(aff
, 0, NULL
);
2348 /* Return a basic set containing those elements in the domain space
2349 * of "aff" where it is positive.
2351 __isl_give isl_basic_set
*isl_aff_pos_basic_set(__isl_take isl_aff
*aff
)
2353 aff
= isl_aff_add_constant_num_si(aff
, -1);
2354 return isl_aff_nonneg_basic_set(aff
);
2357 /* Return a basic set containing those elements in the domain space
2358 * of aff where it is negative.
2360 __isl_give isl_basic_set
*isl_aff_neg_basic_set(__isl_take isl_aff
*aff
)
2362 aff
= isl_aff_neg(aff
);
2363 return isl_aff_pos_basic_set(aff
);
2366 /* Return a basic set containing those elements in the space
2367 * of aff where it is zero.
2368 * If "rational" is set, then return a rational basic set.
2370 * If "aff" is NaN, then it is not zero.
2372 static __isl_give isl_basic_set
*aff_zero_basic_set(__isl_take isl_aff
*aff
,
2373 int rational
, void *user
)
2375 isl_constraint
*ineq
;
2376 isl_basic_set
*bset
;
2380 if (isl_aff_is_nan(aff
)) {
2381 isl_space
*space
= isl_aff_get_domain_space(aff
);
2383 return isl_basic_set_empty(space
);
2386 ineq
= isl_equality_from_aff(aff
);
2388 bset
= isl_basic_set_from_constraint(ineq
);
2390 bset
= isl_basic_set_set_rational(bset
);
2391 bset
= isl_basic_set_simplify(bset
);
2395 /* Return a basic set containing those elements in the space
2396 * of aff where it is zero.
2398 __isl_give isl_basic_set
*isl_aff_zero_basic_set(__isl_take isl_aff
*aff
)
2400 return aff_zero_basic_set(aff
, 0, NULL
);
2403 /* Return a basic set containing those elements in the shared space
2404 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2406 __isl_give isl_basic_set
*isl_aff_ge_basic_set(__isl_take isl_aff
*aff1
,
2407 __isl_take isl_aff
*aff2
)
2409 aff1
= isl_aff_sub(aff1
, aff2
);
2411 return isl_aff_nonneg_basic_set(aff1
);
2414 /* Return a basic set containing those elements in the shared domain space
2415 * of "aff1" and "aff2" where "aff1" is greater than "aff2".
2417 __isl_give isl_basic_set
*isl_aff_gt_basic_set(__isl_take isl_aff
*aff1
,
2418 __isl_take isl_aff
*aff2
)
2420 aff1
= isl_aff_sub(aff1
, aff2
);
2422 return isl_aff_pos_basic_set(aff1
);
2425 /* Return a set containing those elements in the shared space
2426 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2428 __isl_give isl_set
*isl_aff_ge_set(__isl_take isl_aff
*aff1
,
2429 __isl_take isl_aff
*aff2
)
2431 return isl_set_from_basic_set(isl_aff_ge_basic_set(aff1
, aff2
));
2434 /* Return a set containing those elements in the shared domain space
2435 * of aff1 and aff2 where aff1 is greater than aff2.
2437 * If either of the two inputs is NaN, then the result is empty,
2438 * as comparisons with NaN always return false.
2440 __isl_give isl_set
*isl_aff_gt_set(__isl_take isl_aff
*aff1
,
2441 __isl_take isl_aff
*aff2
)
2443 return isl_set_from_basic_set(isl_aff_gt_basic_set(aff1
, aff2
));
2446 /* Return a basic set containing those elements in the shared space
2447 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2449 __isl_give isl_basic_set
*isl_aff_le_basic_set(__isl_take isl_aff
*aff1
,
2450 __isl_take isl_aff
*aff2
)
2452 return isl_aff_ge_basic_set(aff2
, aff1
);
2455 /* Return a basic set containing those elements in the shared domain space
2456 * of "aff1" and "aff2" where "aff1" is smaller than "aff2".
2458 __isl_give isl_basic_set
*isl_aff_lt_basic_set(__isl_take isl_aff
*aff1
,
2459 __isl_take isl_aff
*aff2
)
2461 return isl_aff_gt_basic_set(aff2
, aff1
);
2464 /* Return a set containing those elements in the shared space
2465 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2467 __isl_give isl_set
*isl_aff_le_set(__isl_take isl_aff
*aff1
,
2468 __isl_take isl_aff
*aff2
)
2470 return isl_aff_ge_set(aff2
, aff1
);
2473 /* Return a set containing those elements in the shared domain space
2474 * of "aff1" and "aff2" where "aff1" is smaller than "aff2".
2476 __isl_give isl_set
*isl_aff_lt_set(__isl_take isl_aff
*aff1
,
2477 __isl_take isl_aff
*aff2
)
2479 return isl_set_from_basic_set(isl_aff_lt_basic_set(aff1
, aff2
));
2482 /* Return a basic set containing those elements in the shared space
2483 * of aff1 and aff2 where aff1 and aff2 are equal.
2485 __isl_give isl_basic_set
*isl_aff_eq_basic_set(__isl_take isl_aff
*aff1
,
2486 __isl_take isl_aff
*aff2
)
2488 aff1
= isl_aff_sub(aff1
, aff2
);
2490 return isl_aff_zero_basic_set(aff1
);
2493 /* Return a set containing those elements in the shared space
2494 * of aff1 and aff2 where aff1 and aff2 are equal.
2496 __isl_give isl_set
*isl_aff_eq_set(__isl_take isl_aff
*aff1
,
2497 __isl_take isl_aff
*aff2
)
2499 return isl_set_from_basic_set(isl_aff_eq_basic_set(aff1
, aff2
));
2502 /* Return a set containing those elements in the shared domain space
2503 * of aff1 and aff2 where aff1 and aff2 are not equal.
2505 * If either of the two inputs is NaN, then the result is empty,
2506 * as comparisons with NaN always return false.
2508 __isl_give isl_set
*isl_aff_ne_set(__isl_take isl_aff
*aff1
,
2509 __isl_take isl_aff
*aff2
)
2511 isl_set
*set_lt
, *set_gt
;
2513 set_lt
= isl_aff_lt_set(isl_aff_copy(aff1
),
2514 isl_aff_copy(aff2
));
2515 set_gt
= isl_aff_gt_set(aff1
, aff2
);
2516 return isl_set_union_disjoint(set_lt
, set_gt
);
2519 __isl_give isl_aff
*isl_aff_add_on_domain(__isl_keep isl_set
*dom
,
2520 __isl_take isl_aff
*aff1
, __isl_take isl_aff
*aff2
)
2522 aff1
= isl_aff_add(aff1
, aff2
);
2523 aff1
= isl_aff_gist(aff1
, isl_set_copy(dom
));
2527 isl_bool
isl_aff_is_empty(__isl_keep isl_aff
*aff
)
2530 return isl_bool_error
;
2532 return isl_bool_false
;
2536 #define TYPE isl_aff
2538 #include "check_type_range_templ.c"
2540 /* Check whether the given affine expression has non-zero coefficient
2541 * for any dimension in the given range or if any of these dimensions
2542 * appear with non-zero coefficients in any of the integer divisions
2543 * involved in the affine expression.
2545 isl_bool
isl_aff_involves_dims(__isl_keep isl_aff
*aff
,
2546 enum isl_dim_type type
, unsigned first
, unsigned n
)
2550 isl_bool involves
= isl_bool_false
;
2553 return isl_bool_error
;
2555 return isl_bool_false
;
2556 if (isl_aff_check_range(aff
, type
, first
, n
) < 0)
2557 return isl_bool_error
;
2559 active
= isl_local_space_get_active(aff
->ls
, aff
->v
->el
+ 2);
2563 first
+= isl_local_space_offset(aff
->ls
, type
) - 1;
2564 for (i
= 0; i
< n
; ++i
)
2565 if (active
[first
+ i
]) {
2566 involves
= isl_bool_true
;
2575 return isl_bool_error
;
2578 /* Does "aff" involve any local variables, i.e., integer divisions?
2580 isl_bool
isl_aff_involves_locals(__isl_keep isl_aff
*aff
)
2584 n
= isl_aff_dim(aff
, isl_dim_div
);
2586 return isl_bool_error
;
2587 return isl_bool_ok(n
> 0);
2590 __isl_give isl_aff
*isl_aff_drop_dims(__isl_take isl_aff
*aff
,
2591 enum isl_dim_type type
, unsigned first
, unsigned n
)
2597 if (type
== isl_dim_out
)
2598 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2599 "cannot drop output/set dimension",
2600 return isl_aff_free(aff
));
2601 if (type
== isl_dim_in
)
2603 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2606 ctx
= isl_aff_get_ctx(aff
);
2607 if (isl_local_space_check_range(aff
->ls
, type
, first
, n
) < 0)
2608 return isl_aff_free(aff
);
2610 aff
= isl_aff_cow(aff
);
2614 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, type
, first
, n
);
2616 return isl_aff_free(aff
);
2618 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2619 aff
->v
= isl_vec_drop_els(aff
->v
, first
, n
);
2621 return isl_aff_free(aff
);
2626 /* Is the domain of "aff" a product?
2628 static isl_bool
isl_aff_domain_is_product(__isl_keep isl_aff
*aff
)
2630 return isl_space_is_product(isl_aff_peek_domain_space(aff
));
2634 #define TYPE isl_aff
2635 #include <isl_domain_factor_templ.c>
2637 /* Project the domain of the affine expression onto its parameter space.
2638 * The affine expression may not involve any of the domain dimensions.
2640 __isl_give isl_aff
*isl_aff_project_domain_on_params(__isl_take isl_aff
*aff
)
2645 n
= isl_aff_dim(aff
, isl_dim_in
);
2647 return isl_aff_free(aff
);
2648 aff
= isl_aff_drop_domain(aff
, 0, n
);
2649 space
= isl_aff_get_domain_space(aff
);
2650 space
= isl_space_params(space
);
2651 aff
= isl_aff_reset_domain_space(aff
, space
);
2655 /* Convert an affine expression defined over a parameter domain
2656 * into one that is defined over a zero-dimensional set.
2658 __isl_give isl_aff
*isl_aff_from_range(__isl_take isl_aff
*aff
)
2660 isl_local_space
*ls
;
2662 ls
= isl_aff_take_domain_local_space(aff
);
2663 ls
= isl_local_space_set_from_params(ls
);
2664 aff
= isl_aff_restore_domain_local_space(aff
, ls
);
2669 __isl_give isl_aff
*isl_aff_insert_dims(__isl_take isl_aff
*aff
,
2670 enum isl_dim_type type
, unsigned first
, unsigned n
)
2676 if (type
== isl_dim_out
)
2677 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2678 "cannot insert output/set dimensions",
2679 return isl_aff_free(aff
));
2680 if (type
== isl_dim_in
)
2682 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2685 ctx
= isl_aff_get_ctx(aff
);
2686 if (isl_local_space_check_range(aff
->ls
, type
, first
, 0) < 0)
2687 return isl_aff_free(aff
);
2689 aff
= isl_aff_cow(aff
);
2693 aff
->ls
= isl_local_space_insert_dims(aff
->ls
, type
, first
, n
);
2695 return isl_aff_free(aff
);
2697 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2698 aff
->v
= isl_vec_insert_zero_els(aff
->v
, first
, n
);
2700 return isl_aff_free(aff
);
2705 __isl_give isl_aff
*isl_aff_add_dims(__isl_take isl_aff
*aff
,
2706 enum isl_dim_type type
, unsigned n
)
2710 pos
= isl_aff_dim(aff
, type
);
2712 return isl_aff_free(aff
);
2714 return isl_aff_insert_dims(aff
, type
, pos
, n
);
2717 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "aff"
2718 * to dimensions of "dst_type" at "dst_pos".
2720 * We only support moving input dimensions to parameters and vice versa.
2722 __isl_give isl_aff
*isl_aff_move_dims(__isl_take isl_aff
*aff
,
2723 enum isl_dim_type dst_type
, unsigned dst_pos
,
2724 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2728 isl_size src_off
, dst_off
;
2733 !isl_local_space_is_named_or_nested(aff
->ls
, src_type
) &&
2734 !isl_local_space_is_named_or_nested(aff
->ls
, dst_type
))
2737 if (dst_type
== isl_dim_out
|| src_type
== isl_dim_out
)
2738 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2739 "cannot move output/set dimension",
2740 return isl_aff_free(aff
));
2741 if (dst_type
== isl_dim_div
|| src_type
== isl_dim_div
)
2742 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2743 "cannot move divs", return isl_aff_free(aff
));
2744 if (dst_type
== isl_dim_in
)
2745 dst_type
= isl_dim_set
;
2746 if (src_type
== isl_dim_in
)
2747 src_type
= isl_dim_set
;
2749 if (isl_local_space_check_range(aff
->ls
, src_type
, src_pos
, n
) < 0)
2750 return isl_aff_free(aff
);
2751 if (dst_type
== src_type
)
2752 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2753 "moving dims within the same type not supported",
2754 return isl_aff_free(aff
));
2756 aff
= isl_aff_cow(aff
);
2757 src_off
= isl_aff_domain_offset(aff
, src_type
);
2758 dst_off
= isl_aff_domain_offset(aff
, dst_type
);
2759 if (src_off
< 0 || dst_off
< 0)
2760 return isl_aff_free(aff
);
2762 g_src_pos
= 1 + src_off
+ src_pos
;
2763 g_dst_pos
= 1 + dst_off
+ dst_pos
;
2764 if (dst_type
> src_type
)
2767 aff
->v
= isl_vec_move_els(aff
->v
, g_dst_pos
, g_src_pos
, n
);
2768 aff
->ls
= isl_local_space_move_dims(aff
->ls
, dst_type
, dst_pos
,
2769 src_type
, src_pos
, n
);
2770 if (!aff
->v
|| !aff
->ls
)
2771 return isl_aff_free(aff
);
2773 aff
= sort_divs(aff
);
2778 /* Return a zero isl_aff in the given space.
2780 * This is a helper function for isl_pw_*_as_* that ensures a uniform
2781 * interface over all piecewise types.
2783 static __isl_give isl_aff
*isl_aff_zero_in_space(__isl_take isl_space
*space
)
2785 isl_local_space
*ls
;
2787 ls
= isl_local_space_from_space(isl_space_domain(space
));
2788 return isl_aff_zero_on_domain(ls
);
2791 #define isl_aff_involves_nan isl_aff_is_nan
2794 #define PW isl_pw_aff
2798 #define EL_IS_ZERO is_empty
2802 #define IS_ZERO is_empty
2805 #undef DEFAULT_IS_ZERO
2806 #define DEFAULT_IS_ZERO 0
2808 #include <isl_pw_templ.c>
2809 #include <isl_pw_un_op_templ.c>
2810 #include <isl_pw_add_constant_val_templ.c>
2811 #include <isl_pw_bind_domain_templ.c>
2812 #include <isl_pw_eval.c>
2813 #include <isl_pw_hash.c>
2814 #include <isl_pw_insert_dims_templ.c>
2815 #include <isl_pw_insert_domain_templ.c>
2816 #include <isl_pw_move_dims_templ.c>
2817 #include <isl_pw_neg_templ.c>
2818 #include <isl_pw_pullback_templ.c>
2819 #include <isl_pw_sub_templ.c>
2820 #include <isl_pw_union_opt.c>
2825 #include <isl_union_single.c>
2826 #include <isl_union_neg.c>
2831 #include <isl_union_pw_templ.c>
2833 /* Compute a piecewise quasi-affine expression with a domain that
2834 * is the union of those of pwaff1 and pwaff2 and such that on each
2835 * cell, the quasi-affine expression is the maximum of those of pwaff1
2836 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2837 * cell, then the associated expression is the defined one.
2839 __isl_give isl_pw_aff
*isl_pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2840 __isl_take isl_pw_aff
*pwaff2
)
2842 isl_pw_aff_align_params_bin(&pwaff1
, &pwaff2
);
2843 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_ge_set
);
2846 /* Compute a piecewise quasi-affine expression with a domain that
2847 * is the union of those of pwaff1 and pwaff2 and such that on each
2848 * cell, the quasi-affine expression is the minimum of those of pwaff1
2849 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2850 * cell, then the associated expression is the defined one.
2852 __isl_give isl_pw_aff
*isl_pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2853 __isl_take isl_pw_aff
*pwaff2
)
2855 isl_pw_aff_align_params_bin(&pwaff1
, &pwaff2
);
2856 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_le_set
);
2859 __isl_give isl_pw_aff
*isl_pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
2860 __isl_take isl_pw_aff
*pwaff2
, int max
)
2863 return isl_pw_aff_union_max(pwaff1
, pwaff2
);
2865 return isl_pw_aff_union_min(pwaff1
, pwaff2
);
2868 /* Is the domain of "pa" a product?
2870 static isl_bool
isl_pw_aff_domain_is_product(__isl_keep isl_pw_aff
*pa
)
2872 return isl_space_domain_is_wrapping(isl_pw_aff_peek_space(pa
));
2876 #define TYPE isl_pw_aff
2877 #include <isl_domain_factor_templ.c>
2879 /* Return a set containing those elements in the domain
2880 * of "pwaff" where it satisfies "fn" (if complement is 0) or
2881 * does not satisfy "fn" (if complement is 1).
2883 * The pieces with a NaN never belong to the result since
2884 * NaN does not satisfy any property.
2886 static __isl_give isl_set
*pw_aff_locus(__isl_take isl_pw_aff
*pwaff
,
2887 __isl_give isl_basic_set
*(*fn
)(__isl_take isl_aff
*aff
, int rational
,
2889 int complement
, void *user
)
2897 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
2899 for (i
= 0; i
< pwaff
->n
; ++i
) {
2900 isl_basic_set
*bset
;
2901 isl_set
*set_i
, *locus
;
2904 if (isl_aff_is_nan(pwaff
->p
[i
].aff
))
2907 rational
= isl_set_has_rational(pwaff
->p
[i
].set
);
2908 bset
= fn(isl_aff_copy(pwaff
->p
[i
].aff
), rational
, user
);
2909 locus
= isl_set_from_basic_set(bset
);
2910 set_i
= isl_set_copy(pwaff
->p
[i
].set
);
2912 set_i
= isl_set_subtract(set_i
, locus
);
2914 set_i
= isl_set_intersect(set_i
, locus
);
2915 set
= isl_set_union_disjoint(set
, set_i
);
2918 isl_pw_aff_free(pwaff
);
2923 /* Return a set containing those elements in the domain
2924 * of "pa" where it is positive.
2926 __isl_give isl_set
*isl_pw_aff_pos_set(__isl_take isl_pw_aff
*pa
)
2928 return pw_aff_locus(pa
, &aff_pos_basic_set
, 0, NULL
);
2931 /* Return a set containing those elements in the domain
2932 * of pwaff where it is non-negative.
2934 __isl_give isl_set
*isl_pw_aff_nonneg_set(__isl_take isl_pw_aff
*pwaff
)
2936 return pw_aff_locus(pwaff
, &aff_nonneg_basic_set
, 0, NULL
);
2939 /* Return a set containing those elements in the domain
2940 * of pwaff where it is zero.
2942 __isl_give isl_set
*isl_pw_aff_zero_set(__isl_take isl_pw_aff
*pwaff
)
2944 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 0, NULL
);
2947 /* Return a set containing those elements in the domain
2948 * of pwaff where it is not zero.
2950 __isl_give isl_set
*isl_pw_aff_non_zero_set(__isl_take isl_pw_aff
*pwaff
)
2952 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 1, NULL
);
2955 /* Bind the affine function "aff" to the parameter "id",
2956 * returning the elements in the domain where the affine expression
2957 * is equal to the parameter.
2959 __isl_give isl_basic_set
*isl_aff_bind_id(__isl_take isl_aff
*aff
,
2960 __isl_take isl_id
*id
)
2965 space
= isl_aff_get_domain_space(aff
);
2966 space
= isl_space_add_param_id(space
, isl_id_copy(id
));
2968 aff
= isl_aff_align_params(aff
, isl_space_copy(space
));
2969 aff_id
= isl_aff_param_on_domain_space_id(space
, id
);
2971 return isl_aff_eq_basic_set(aff
, aff_id
);
2974 /* Wrapper around isl_aff_bind_id for use as pw_aff_locus callback.
2975 * "rational" should not be set.
2977 static __isl_give isl_basic_set
*aff_bind_id(__isl_take isl_aff
*aff
,
2978 int rational
, void *user
)
2985 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2986 "rational binding not supported", goto error
);
2987 return isl_aff_bind_id(aff
, isl_id_copy(id
));
2993 /* Bind the piecewise affine function "pa" to the parameter "id",
2994 * returning the elements in the domain where the expression
2995 * is equal to the parameter.
2997 __isl_give isl_set
*isl_pw_aff_bind_id(__isl_take isl_pw_aff
*pa
,
2998 __isl_take isl_id
*id
)
3002 bound
= pw_aff_locus(pa
, &aff_bind_id
, 0, id
);
3008 /* Return a set containing those elements in the shared domain
3009 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
3011 * We compute the difference on the shared domain and then construct
3012 * the set of values where this difference is non-negative.
3013 * If strict is set, we first subtract 1 from the difference.
3014 * If equal is set, we only return the elements where pwaff1 and pwaff2
3017 static __isl_give isl_set
*pw_aff_gte_set(__isl_take isl_pw_aff
*pwaff1
,
3018 __isl_take isl_pw_aff
*pwaff2
, int strict
, int equal
)
3020 isl_set
*set1
, *set2
;
3022 set1
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
));
3023 set2
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
));
3024 set1
= isl_set_intersect(set1
, set2
);
3025 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, isl_set_copy(set1
));
3026 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, isl_set_copy(set1
));
3027 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_neg(pwaff2
));
3030 isl_space
*space
= isl_set_get_space(set1
);
3032 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(space
));
3033 aff
= isl_aff_add_constant_si(aff
, -1);
3034 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_alloc(set1
, aff
));
3039 return isl_pw_aff_zero_set(pwaff1
);
3040 return isl_pw_aff_nonneg_set(pwaff1
);
3043 /* Return a set containing those elements in the shared domain
3044 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
3046 __isl_give isl_set
*isl_pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
3047 __isl_take isl_pw_aff
*pwaff2
)
3049 isl_pw_aff_align_params_bin(&pwaff1
, &pwaff2
);
3050 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 1);
3053 /* Return a set containing those elements in the shared domain
3054 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
3056 __isl_give isl_set
*isl_pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
3057 __isl_take isl_pw_aff
*pwaff2
)
3059 isl_pw_aff_align_params_bin(&pwaff1
, &pwaff2
);
3060 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 0);
3063 /* Return a set containing those elements in the shared domain
3064 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
3066 __isl_give isl_set
*isl_pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
3067 __isl_take isl_pw_aff
*pwaff2
)
3069 isl_pw_aff_align_params_bin(&pwaff1
, &pwaff2
);
3070 return pw_aff_gte_set(pwaff1
, pwaff2
, 1, 0);
3073 __isl_give isl_set
*isl_pw_aff_le_set(__isl_take isl_pw_aff
*pwaff1
,
3074 __isl_take isl_pw_aff
*pwaff2
)
3076 return isl_pw_aff_ge_set(pwaff2
, pwaff1
);
3079 __isl_give isl_set
*isl_pw_aff_lt_set(__isl_take isl_pw_aff
*pwaff1
,
3080 __isl_take isl_pw_aff
*pwaff2
)
3082 return isl_pw_aff_gt_set(pwaff2
, pwaff1
);
3085 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3086 * where the function values are ordered in the same way as "order",
3087 * which returns a set in the shared domain of its two arguments.
3089 * Let "pa1" and "pa2" be defined on domains A and B respectively.
3090 * We first pull back the two functions such that they are defined on
3091 * the domain [A -> B]. Then we apply "order", resulting in a set
3092 * in the space [A -> B]. Finally, we unwrap this set to obtain
3093 * a map in the space A -> B.
3095 static __isl_give isl_map
*isl_pw_aff_order_map(
3096 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
3097 __isl_give isl_set
*(*order
)(__isl_take isl_pw_aff
*pa1
,
3098 __isl_take isl_pw_aff
*pa2
))
3100 isl_space
*space1
, *space2
;
3104 isl_pw_aff_align_params_bin(&pa1
, &pa2
);
3105 space1
= isl_space_domain(isl_pw_aff_get_space(pa1
));
3106 space2
= isl_space_domain(isl_pw_aff_get_space(pa2
));
3107 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
3108 ma
= isl_multi_aff_domain_map(isl_space_copy(space1
));
3109 pa1
= isl_pw_aff_pullback_multi_aff(pa1
, ma
);
3110 ma
= isl_multi_aff_range_map(space1
);
3111 pa2
= isl_pw_aff_pullback_multi_aff(pa2
, ma
);
3112 set
= order(pa1
, pa2
);
3114 return isl_set_unwrap(set
);
3117 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3118 * where the function values are equal.
3120 __isl_give isl_map
*isl_pw_aff_eq_map(__isl_take isl_pw_aff
*pa1
,
3121 __isl_take isl_pw_aff
*pa2
)
3123 return isl_pw_aff_order_map(pa1
, pa2
, &isl_pw_aff_eq_set
);
3126 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3127 * where the function value of "pa1" is less than or equal to
3128 * the function value of "pa2".
3130 __isl_give isl_map
*isl_pw_aff_le_map(__isl_take isl_pw_aff
*pa1
,
3131 __isl_take isl_pw_aff
*pa2
)
3133 return isl_pw_aff_order_map(pa1
, pa2
, &isl_pw_aff_le_set
);
3136 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3137 * where the function value of "pa1" is less than the function value of "pa2".
3139 __isl_give isl_map
*isl_pw_aff_lt_map(__isl_take isl_pw_aff
*pa1
,
3140 __isl_take isl_pw_aff
*pa2
)
3142 return isl_pw_aff_order_map(pa1
, pa2
, &isl_pw_aff_lt_set
);
3145 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3146 * where the function value of "pa1" is greater than or equal to
3147 * the function value of "pa2".
3149 __isl_give isl_map
*isl_pw_aff_ge_map(__isl_take isl_pw_aff
*pa1
,
3150 __isl_take isl_pw_aff
*pa2
)
3152 return isl_pw_aff_order_map(pa1
, pa2
, &isl_pw_aff_ge_set
);
3155 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3156 * where the function value of "pa1" is greater than the function value
3159 __isl_give isl_map
*isl_pw_aff_gt_map(__isl_take isl_pw_aff
*pa1
,
3160 __isl_take isl_pw_aff
*pa2
)
3162 return isl_pw_aff_order_map(pa1
, pa2
, &isl_pw_aff_gt_set
);
3165 /* Return a set containing those elements in the shared domain
3166 * of the elements of list1 and list2 where each element in list1
3167 * has the relation specified by "fn" with each element in list2.
3169 static __isl_give isl_set
*pw_aff_list_set(__isl_take isl_pw_aff_list
*list1
,
3170 __isl_take isl_pw_aff_list
*list2
,
3171 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3172 __isl_take isl_pw_aff
*pwaff2
))
3178 if (!list1
|| !list2
)
3181 ctx
= isl_pw_aff_list_get_ctx(list1
);
3182 if (list1
->n
< 1 || list2
->n
< 1)
3183 isl_die(ctx
, isl_error_invalid
,
3184 "list should contain at least one element", goto error
);
3186 set
= isl_set_universe(isl_pw_aff_get_domain_space(list1
->p
[0]));
3187 for (i
= 0; i
< list1
->n
; ++i
)
3188 for (j
= 0; j
< list2
->n
; ++j
) {
3191 set_ij
= fn(isl_pw_aff_copy(list1
->p
[i
]),
3192 isl_pw_aff_copy(list2
->p
[j
]));
3193 set
= isl_set_intersect(set
, set_ij
);
3196 isl_pw_aff_list_free(list1
);
3197 isl_pw_aff_list_free(list2
);
3200 isl_pw_aff_list_free(list1
);
3201 isl_pw_aff_list_free(list2
);
3205 /* Return a set containing those elements in the shared domain
3206 * of the elements of list1 and list2 where each element in list1
3207 * is equal to each element in list2.
3209 __isl_give isl_set
*isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list
*list1
,
3210 __isl_take isl_pw_aff_list
*list2
)
3212 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_eq_set
);
3215 __isl_give isl_set
*isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list
*list1
,
3216 __isl_take isl_pw_aff_list
*list2
)
3218 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ne_set
);
3221 /* Return a set containing those elements in the shared domain
3222 * of the elements of list1 and list2 where each element in list1
3223 * is less than or equal to each element in list2.
3225 __isl_give isl_set
*isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list
*list1
,
3226 __isl_take isl_pw_aff_list
*list2
)
3228 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_le_set
);
3231 __isl_give isl_set
*isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list
*list1
,
3232 __isl_take isl_pw_aff_list
*list2
)
3234 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_lt_set
);
3237 __isl_give isl_set
*isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list
*list1
,
3238 __isl_take isl_pw_aff_list
*list2
)
3240 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ge_set
);
3243 __isl_give isl_set
*isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list
*list1
,
3244 __isl_take isl_pw_aff_list
*list2
)
3246 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_gt_set
);
3250 /* Return a set containing those elements in the shared domain
3251 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
3253 __isl_give isl_set
*isl_pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3254 __isl_take isl_pw_aff
*pwaff2
)
3256 isl_set
*set_lt
, *set_gt
;
3258 isl_pw_aff_align_params_bin(&pwaff1
, &pwaff2
);
3259 set_lt
= isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1
),
3260 isl_pw_aff_copy(pwaff2
));
3261 set_gt
= isl_pw_aff_gt_set(pwaff1
, pwaff2
);
3262 return isl_set_union_disjoint(set_lt
, set_gt
);
3265 __isl_give isl_pw_aff
*isl_pw_aff_scale_down(__isl_take isl_pw_aff
*pwaff
,
3270 if (isl_int_is_one(v
))
3272 if (!isl_int_is_pos(v
))
3273 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
3274 "factor needs to be positive",
3275 return isl_pw_aff_free(pwaff
));
3276 pwaff
= isl_pw_aff_cow(pwaff
);
3282 for (i
= 0; i
< pwaff
->n
; ++i
) {
3283 pwaff
->p
[i
].aff
= isl_aff_scale_down(pwaff
->p
[i
].aff
, v
);
3284 if (!pwaff
->p
[i
].aff
)
3285 return isl_pw_aff_free(pwaff
);
3291 __isl_give isl_pw_aff
*isl_pw_aff_floor(__isl_take isl_pw_aff
*pwaff
)
3293 return isl_pw_aff_un_op(pwaff
, &isl_aff_floor
);
3296 __isl_give isl_pw_aff
*isl_pw_aff_ceil(__isl_take isl_pw_aff
*pwaff
)
3298 return isl_pw_aff_un_op(pwaff
, &isl_aff_ceil
);
3301 /* Assuming that "cond1" and "cond2" are disjoint,
3302 * return an affine expression that is equal to pwaff1 on cond1
3303 * and to pwaff2 on cond2.
3305 static __isl_give isl_pw_aff
*isl_pw_aff_select(
3306 __isl_take isl_set
*cond1
, __isl_take isl_pw_aff
*pwaff1
,
3307 __isl_take isl_set
*cond2
, __isl_take isl_pw_aff
*pwaff2
)
3309 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, cond1
);
3310 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, cond2
);
3312 return isl_pw_aff_add_disjoint(pwaff1
, pwaff2
);
3315 /* Return an affine expression that is equal to pwaff_true for elements
3316 * where "cond" is non-zero and to pwaff_false for elements where "cond"
3318 * That is, return cond ? pwaff_true : pwaff_false;
3320 * If "cond" involves and NaN, then we conservatively return a NaN
3321 * on its entire domain. In principle, we could consider the pieces
3322 * where it is NaN separately from those where it is not.
3324 * If "pwaff_true" and "pwaff_false" are obviously equal to each other,
3325 * then only use the domain of "cond" to restrict the domain.
3327 __isl_give isl_pw_aff
*isl_pw_aff_cond(__isl_take isl_pw_aff
*cond
,
3328 __isl_take isl_pw_aff
*pwaff_true
, __isl_take isl_pw_aff
*pwaff_false
)
3330 isl_set
*cond_true
, *cond_false
;
3335 if (isl_pw_aff_involves_nan(cond
)) {
3336 isl_space
*space
= isl_pw_aff_get_domain_space(cond
);
3337 isl_local_space
*ls
= isl_local_space_from_space(space
);
3338 isl_pw_aff_free(cond
);
3339 isl_pw_aff_free(pwaff_true
);
3340 isl_pw_aff_free(pwaff_false
);
3341 return isl_pw_aff_nan_on_domain(ls
);
3344 pwaff_true
= isl_pw_aff_align_params(pwaff_true
,
3345 isl_pw_aff_get_space(pwaff_false
));
3346 pwaff_false
= isl_pw_aff_align_params(pwaff_false
,
3347 isl_pw_aff_get_space(pwaff_true
));
3348 equal
= isl_pw_aff_plain_is_equal(pwaff_true
, pwaff_false
);
3354 dom
= isl_set_coalesce(isl_pw_aff_domain(cond
));
3355 isl_pw_aff_free(pwaff_false
);
3356 return isl_pw_aff_intersect_domain(pwaff_true
, dom
);
3359 cond_true
= isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond
));
3360 cond_false
= isl_pw_aff_zero_set(cond
);
3361 return isl_pw_aff_select(cond_true
, pwaff_true
,
3362 cond_false
, pwaff_false
);
3364 isl_pw_aff_free(cond
);
3365 isl_pw_aff_free(pwaff_true
);
3366 isl_pw_aff_free(pwaff_false
);
3370 isl_bool
isl_aff_is_cst(__isl_keep isl_aff
*aff
)
3375 return isl_bool_error
;
3377 pos
= isl_seq_first_non_zero(aff
->v
->el
+ 2, aff
->v
->size
- 2);
3378 return isl_bool_ok(pos
== -1);
3381 /* Check whether pwaff is a piecewise constant.
3383 isl_bool
isl_pw_aff_is_cst(__isl_keep isl_pw_aff
*pwaff
)
3388 return isl_bool_error
;
3390 for (i
= 0; i
< pwaff
->n
; ++i
) {
3391 isl_bool is_cst
= isl_aff_is_cst(pwaff
->p
[i
].aff
);
3392 if (is_cst
< 0 || !is_cst
)
3396 return isl_bool_true
;
3399 /* Return the product of "aff1" and "aff2".
3401 * If either of the two is NaN, then the result is NaN.
3403 * Otherwise, at least one of "aff1" or "aff2" needs to be a constant.
3405 __isl_give isl_aff
*isl_aff_mul(__isl_take isl_aff
*aff1
,
3406 __isl_take isl_aff
*aff2
)
3411 if (isl_aff_is_nan(aff1
)) {
3415 if (isl_aff_is_nan(aff2
)) {
3420 if (!isl_aff_is_cst(aff2
) && isl_aff_is_cst(aff1
))
3421 return isl_aff_mul(aff2
, aff1
);
3423 if (!isl_aff_is_cst(aff2
))
3424 isl_die(isl_aff_get_ctx(aff1
), isl_error_invalid
,
3425 "at least one affine expression should be constant",
3428 aff1
= isl_aff_cow(aff1
);
3432 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[1]);
3433 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[0]);
3443 /* Divide "aff1" by "aff2", assuming "aff2" is a constant.
3445 * If either of the two is NaN, then the result is NaN.
3446 * A division by zero also results in NaN.
3448 __isl_give isl_aff
*isl_aff_div(__isl_take isl_aff
*aff1
,
3449 __isl_take isl_aff
*aff2
)
3451 isl_bool is_cst
, is_zero
;
3457 if (isl_aff_is_nan(aff1
)) {
3461 if (isl_aff_is_nan(aff2
)) {
3466 is_cst
= isl_aff_is_cst(aff2
);
3470 isl_die(isl_aff_get_ctx(aff2
), isl_error_invalid
,
3471 "second argument should be a constant", goto error
);
3472 is_zero
= isl_aff_plain_is_zero(aff2
);
3476 return set_nan_free(aff1
, aff2
);
3478 neg
= isl_int_is_neg(aff2
->v
->el
[1]);
3480 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3481 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3484 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[0]);
3485 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[1]);
3488 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3489 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3500 __isl_give isl_pw_aff
*isl_pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3501 __isl_take isl_pw_aff
*pwaff2
)
3503 isl_pw_aff_align_params_bin(&pwaff1
, &pwaff2
);
3504 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_add
);
3507 __isl_give isl_pw_aff
*isl_pw_aff_union_add(__isl_take isl_pw_aff
*pwaff1
,
3508 __isl_take isl_pw_aff
*pwaff2
)
3510 return isl_pw_aff_union_add_(pwaff1
, pwaff2
);
3513 __isl_give isl_pw_aff
*isl_pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
3514 __isl_take isl_pw_aff
*pwaff2
)
3516 isl_pw_aff_align_params_bin(&pwaff1
, &pwaff2
);
3517 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_mul
);
3520 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
3522 __isl_give isl_pw_aff
*isl_pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3523 __isl_take isl_pw_aff
*pa2
)
3527 is_cst
= isl_pw_aff_is_cst(pa2
);
3531 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3532 "second argument should be a piecewise constant",
3534 isl_pw_aff_align_params_bin(&pa1
, &pa2
);
3535 return isl_pw_aff_on_shared_domain(pa1
, pa2
, &isl_aff_div
);
3537 isl_pw_aff_free(pa1
);
3538 isl_pw_aff_free(pa2
);
3542 /* Compute the quotient of the integer division of "pa1" by "pa2"
3543 * with rounding towards zero.
3544 * "pa2" is assumed to be a piecewise constant.
3546 * In particular, return
3548 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
3551 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_q(__isl_take isl_pw_aff
*pa1
,
3552 __isl_take isl_pw_aff
*pa2
)
3558 is_cst
= isl_pw_aff_is_cst(pa2
);
3562 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3563 "second argument should be a piecewise constant",
3566 pa1
= isl_pw_aff_div(pa1
, pa2
);
3568 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1
));
3569 f
= isl_pw_aff_floor(isl_pw_aff_copy(pa1
));
3570 c
= isl_pw_aff_ceil(pa1
);
3571 return isl_pw_aff_cond(isl_set_indicator_function(cond
), f
, c
);
3573 isl_pw_aff_free(pa1
);
3574 isl_pw_aff_free(pa2
);
3578 /* Compute the remainder of the integer division of "pa1" by "pa2"
3579 * with rounding towards zero.
3580 * "pa2" is assumed to be a piecewise constant.
3582 * In particular, return
3584 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
3587 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_r(__isl_take isl_pw_aff
*pa1
,
3588 __isl_take isl_pw_aff
*pa2
)
3593 is_cst
= isl_pw_aff_is_cst(pa2
);
3597 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3598 "second argument should be a piecewise constant",
3600 res
= isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1
), isl_pw_aff_copy(pa2
));
3601 res
= isl_pw_aff_mul(pa2
, res
);
3602 res
= isl_pw_aff_sub(pa1
, res
);
3605 isl_pw_aff_free(pa1
);
3606 isl_pw_aff_free(pa2
);
3610 /* Does either of "pa1" or "pa2" involve any NaN2?
3612 static isl_bool
either_involves_nan(__isl_keep isl_pw_aff
*pa1
,
3613 __isl_keep isl_pw_aff
*pa2
)
3617 has_nan
= isl_pw_aff_involves_nan(pa1
);
3618 if (has_nan
< 0 || has_nan
)
3620 return isl_pw_aff_involves_nan(pa2
);
3623 /* Replace "pa1" and "pa2" (at least one of which involves a NaN)
3624 * by a NaN on their shared domain.
3626 * In principle, the result could be refined to only being NaN
3627 * on the parts of this domain where at least one of "pa1" or "pa2" is NaN.
3629 static __isl_give isl_pw_aff
*replace_by_nan(__isl_take isl_pw_aff
*pa1
,
3630 __isl_take isl_pw_aff
*pa2
)
3632 isl_local_space
*ls
;
3636 dom
= isl_set_intersect(isl_pw_aff_domain(pa1
), isl_pw_aff_domain(pa2
));
3637 ls
= isl_local_space_from_space(isl_set_get_space(dom
));
3638 pa
= isl_pw_aff_nan_on_domain(ls
);
3639 pa
= isl_pw_aff_intersect_domain(pa
, dom
);
3644 static __isl_give isl_pw_aff
*pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3645 __isl_take isl_pw_aff
*pwaff2
)
3650 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3651 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3652 le
= isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1
),
3653 isl_pw_aff_copy(pwaff2
));
3654 dom
= isl_set_subtract(dom
, isl_set_copy(le
));
3655 return isl_pw_aff_select(le
, pwaff1
, dom
, pwaff2
);
3658 static __isl_give isl_pw_aff
*pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3659 __isl_take isl_pw_aff
*pwaff2
)
3664 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3665 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3666 ge
= isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1
),
3667 isl_pw_aff_copy(pwaff2
));
3668 dom
= isl_set_subtract(dom
, isl_set_copy(ge
));
3669 return isl_pw_aff_select(ge
, pwaff1
, dom
, pwaff2
);
3672 /* Return an expression for the minimum (if "max" is not set) or
3673 * the maximum (if "max" is set) of "pa1" and "pa2".
3674 * If either expression involves any NaN, then return a NaN
3675 * on the shared domain as result.
3677 static __isl_give isl_pw_aff
*pw_aff_min_max(__isl_take isl_pw_aff
*pa1
,
3678 __isl_take isl_pw_aff
*pa2
, int max
)
3682 has_nan
= either_involves_nan(pa1
, pa2
);
3684 pa1
= isl_pw_aff_free(pa1
);
3686 return replace_by_nan(pa1
, pa2
);
3688 isl_pw_aff_align_params_bin(&pa1
, &pa2
);
3690 return pw_aff_max(pa1
, pa2
);
3692 return pw_aff_min(pa1
, pa2
);
3695 /* Return an expression for the minimum of "pwaff1" and "pwaff2".
3697 __isl_give isl_pw_aff
*isl_pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3698 __isl_take isl_pw_aff
*pwaff2
)
3700 return pw_aff_min_max(pwaff1
, pwaff2
, 0);
3703 /* Return an expression for the maximum of "pwaff1" and "pwaff2".
3705 __isl_give isl_pw_aff
*isl_pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3706 __isl_take isl_pw_aff
*pwaff2
)
3708 return pw_aff_min_max(pwaff1
, pwaff2
, 1);
3711 static __isl_give isl_pw_aff
*pw_aff_list_reduce(
3712 __isl_take isl_pw_aff_list
*list
,
3713 __isl_give isl_pw_aff
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3714 __isl_take isl_pw_aff
*pwaff2
))
3723 ctx
= isl_pw_aff_list_get_ctx(list
);
3725 isl_die(ctx
, isl_error_invalid
,
3726 "list should contain at least one element", goto error
);
3728 res
= isl_pw_aff_copy(list
->p
[0]);
3729 for (i
= 1; i
< list
->n
; ++i
)
3730 res
= fn(res
, isl_pw_aff_copy(list
->p
[i
]));
3732 isl_pw_aff_list_free(list
);
3735 isl_pw_aff_list_free(list
);
3739 /* Return an isl_pw_aff that maps each element in the intersection of the
3740 * domains of the elements of list to the minimal corresponding affine
3743 __isl_give isl_pw_aff
*isl_pw_aff_list_min(__isl_take isl_pw_aff_list
*list
)
3745 return pw_aff_list_reduce(list
, &isl_pw_aff_min
);
3748 /* Return an isl_pw_aff that maps each element in the intersection of the
3749 * domains of the elements of list to the maximal corresponding affine
3752 __isl_give isl_pw_aff
*isl_pw_aff_list_max(__isl_take isl_pw_aff_list
*list
)
3754 return pw_aff_list_reduce(list
, &isl_pw_aff_max
);
3757 /* Mark the domains of "pwaff" as rational.
3759 __isl_give isl_pw_aff
*isl_pw_aff_set_rational(__isl_take isl_pw_aff
*pwaff
)
3763 pwaff
= isl_pw_aff_cow(pwaff
);
3769 for (i
= 0; i
< pwaff
->n
; ++i
) {
3770 pwaff
->p
[i
].set
= isl_set_set_rational(pwaff
->p
[i
].set
);
3771 if (!pwaff
->p
[i
].set
)
3772 return isl_pw_aff_free(pwaff
);
3778 /* Mark the domains of the elements of "list" as rational.
3780 __isl_give isl_pw_aff_list
*isl_pw_aff_list_set_rational(
3781 __isl_take isl_pw_aff_list
*list
)
3791 for (i
= 0; i
< n
; ++i
) {
3794 pa
= isl_pw_aff_list_get_pw_aff(list
, i
);
3795 pa
= isl_pw_aff_set_rational(pa
);
3796 list
= isl_pw_aff_list_set_pw_aff(list
, i
, pa
);
3802 /* Do the parameters of "aff" match those of "space"?
3804 isl_bool
isl_aff_matching_params(__isl_keep isl_aff
*aff
,
3805 __isl_keep isl_space
*space
)
3807 isl_space
*aff_space
;
3811 return isl_bool_error
;
3813 aff_space
= isl_aff_get_domain_space(aff
);
3815 match
= isl_space_has_equal_params(space
, aff_space
);
3817 isl_space_free(aff_space
);
3821 /* Check that the domain space of "aff" matches "space".
3823 isl_stat
isl_aff_check_match_domain_space(__isl_keep isl_aff
*aff
,
3824 __isl_keep isl_space
*space
)
3826 isl_space
*aff_space
;
3830 return isl_stat_error
;
3832 aff_space
= isl_aff_get_domain_space(aff
);
3834 match
= isl_space_has_equal_params(space
, aff_space
);
3838 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3839 "parameters don't match", goto error
);
3840 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
3841 aff_space
, isl_dim_set
);
3845 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3846 "domains don't match", goto error
);
3847 isl_space_free(aff_space
);
3850 isl_space_free(aff_space
);
3851 return isl_stat_error
;
3854 /* Return the shared (universe) domain of the elements of "ma".
3856 * Since an isl_multi_aff (and an isl_aff) is always total,
3857 * the domain is always the universe set in its domain space.
3858 * This is a helper function for use in the generic isl_multi_*_bind.
3860 static __isl_give isl_basic_set
*isl_multi_aff_domain(
3861 __isl_take isl_multi_aff
*ma
)
3865 space
= isl_multi_aff_get_space(ma
);
3866 isl_multi_aff_free(ma
);
3868 return isl_basic_set_universe(isl_space_domain(space
));
3874 #include <isl_multi_no_explicit_domain.c>
3875 #include <isl_multi_templ.c>
3876 #include <isl_multi_un_op_templ.c>
3877 #include <isl_multi_bin_val_templ.c>
3878 #include <isl_multi_add_constant_templ.c>
3879 #include <isl_multi_apply_set.c>
3880 #include <isl_multi_arith_templ.c>
3881 #include <isl_multi_bind_domain_templ.c>
3882 #include <isl_multi_cmp.c>
3883 #include <isl_multi_dim_id_templ.c>
3884 #include <isl_multi_dims.c>
3885 #include <isl_multi_floor.c>
3886 #include <isl_multi_from_base_templ.c>
3887 #include <isl_multi_identity_templ.c>
3888 #include <isl_multi_insert_domain_templ.c>
3889 #include <isl_multi_locals_templ.c>
3890 #include <isl_multi_move_dims_templ.c>
3891 #include <isl_multi_nan_templ.c>
3892 #include <isl_multi_product_templ.c>
3893 #include <isl_multi_splice_templ.c>
3894 #include <isl_multi_tuple_id_templ.c>
3895 #include <isl_multi_unbind_params_templ.c>
3896 #include <isl_multi_zero_templ.c>
3900 #include <isl_multi_gist.c>
3903 #define DOMBASE basic_set
3904 #include <isl_multi_bind_templ.c>
3906 /* Construct an isl_multi_aff living in "space" that corresponds
3907 * to the affine transformation matrix "mat".
3909 __isl_give isl_multi_aff
*isl_multi_aff_from_aff_mat(
3910 __isl_take isl_space
*space
, __isl_take isl_mat
*mat
)
3913 isl_local_space
*ls
= NULL
;
3914 isl_multi_aff
*ma
= NULL
;
3915 isl_size n_row
, n_col
, n_out
, total
;
3921 ctx
= isl_mat_get_ctx(mat
);
3923 n_row
= isl_mat_rows(mat
);
3924 n_col
= isl_mat_cols(mat
);
3925 n_out
= isl_space_dim(space
, isl_dim_out
);
3926 total
= isl_space_dim(space
, isl_dim_all
);
3927 if (n_row
< 0 || n_col
< 0 || n_out
< 0 || total
< 0)
3930 isl_die(ctx
, isl_error_invalid
,
3931 "insufficient number of rows", goto error
);
3933 isl_die(ctx
, isl_error_invalid
,
3934 "insufficient number of columns", goto error
);
3935 if (1 + n_out
!= n_row
|| 2 + total
!= n_row
+ n_col
)
3936 isl_die(ctx
, isl_error_invalid
,
3937 "dimension mismatch", goto error
);
3939 ma
= isl_multi_aff_zero(isl_space_copy(space
));
3940 space
= isl_space_domain(space
);
3941 ls
= isl_local_space_from_space(isl_space_copy(space
));
3943 for (i
= 0; i
< n_row
- 1; ++i
) {
3947 v
= isl_vec_alloc(ctx
, 1 + n_col
);
3950 isl_int_set(v
->el
[0], mat
->row
[0][0]);
3951 isl_seq_cpy(v
->el
+ 1, mat
->row
[1 + i
], n_col
);
3952 v
= isl_vec_normalize(v
);
3953 aff
= isl_aff_alloc_vec(isl_local_space_copy(ls
), v
);
3954 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3957 isl_space_free(space
);
3958 isl_local_space_free(ls
);
3962 isl_space_free(space
);
3963 isl_local_space_free(ls
);
3965 isl_multi_aff_free(ma
);
3969 /* Return the constant terms of the affine expressions of "ma".
3971 __isl_give isl_multi_val
*isl_multi_aff_get_constant_multi_val(
3972 __isl_keep isl_multi_aff
*ma
)
3979 n
= isl_multi_aff_size(ma
);
3982 space
= isl_space_range(isl_multi_aff_get_space(ma
));
3983 space
= isl_space_drop_all_params(space
);
3984 mv
= isl_multi_val_zero(space
);
3986 for (i
= 0; i
< n
; ++i
) {
3990 aff
= isl_multi_aff_get_at(ma
, i
);
3991 val
= isl_aff_get_constant_val(aff
);
3993 mv
= isl_multi_val_set_at(mv
, i
, val
);
3999 /* Remove any internal structure of the domain of "ma".
4000 * If there is any such internal structure in the input,
4001 * then the name of the corresponding space is also removed.
4003 __isl_give isl_multi_aff
*isl_multi_aff_flatten_domain(
4004 __isl_take isl_multi_aff
*ma
)
4011 if (!ma
->space
->nested
[0])
4014 space
= isl_multi_aff_get_space(ma
);
4015 space
= isl_space_flatten_domain(space
);
4016 ma
= isl_multi_aff_reset_space(ma
, space
);
4021 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
4022 * of the space to its domain.
4024 __isl_give isl_multi_aff
*isl_multi_aff_domain_map(__isl_take isl_space
*space
)
4028 isl_local_space
*ls
;
4033 if (!isl_space_is_map(space
))
4034 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
4035 "not a map space", goto error
);
4037 n_in
= isl_space_dim(space
, isl_dim_in
);
4040 space
= isl_space_domain_map(space
);
4042 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
4044 isl_space_free(space
);
4048 space
= isl_space_domain(space
);
4049 ls
= isl_local_space_from_space(space
);
4050 for (i
= 0; i
< n_in
; ++i
) {
4053 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4055 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4057 isl_local_space_free(ls
);
4060 isl_space_free(space
);
4064 /* This function performs the same operation as isl_multi_aff_domain_map,
4065 * but is considered as a function on an isl_space when exported.
4067 __isl_give isl_multi_aff
*isl_space_domain_map_multi_aff(
4068 __isl_take isl_space
*space
)
4070 return isl_multi_aff_domain_map(space
);
4073 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
4074 * of the space to its range.
4076 __isl_give isl_multi_aff
*isl_multi_aff_range_map(__isl_take isl_space
*space
)
4079 isl_size n_in
, n_out
;
4080 isl_local_space
*ls
;
4085 if (!isl_space_is_map(space
))
4086 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
4087 "not a map space", goto error
);
4089 n_in
= isl_space_dim(space
, isl_dim_in
);
4090 n_out
= isl_space_dim(space
, isl_dim_out
);
4091 if (n_in
< 0 || n_out
< 0)
4093 space
= isl_space_range_map(space
);
4095 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
4097 isl_space_free(space
);
4101 space
= isl_space_domain(space
);
4102 ls
= isl_local_space_from_space(space
);
4103 for (i
= 0; i
< n_out
; ++i
) {
4106 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4107 isl_dim_set
, n_in
+ i
);
4108 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4110 isl_local_space_free(ls
);
4113 isl_space_free(space
);
4117 /* This function performs the same operation as isl_multi_aff_range_map,
4118 * but is considered as a function on an isl_space when exported.
4120 __isl_give isl_multi_aff
*isl_space_range_map_multi_aff(
4121 __isl_take isl_space
*space
)
4123 return isl_multi_aff_range_map(space
);
4126 /* Given a map space, return an isl_pw_multi_aff that maps a wrapped copy
4127 * of the space to its domain.
4129 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_domain_map(
4130 __isl_take isl_space
*space
)
4132 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_domain_map(space
));
4135 /* This function performs the same operation as isl_pw_multi_aff_domain_map,
4136 * but is considered as a function on an isl_space when exported.
4138 __isl_give isl_pw_multi_aff
*isl_space_domain_map_pw_multi_aff(
4139 __isl_take isl_space
*space
)
4141 return isl_pw_multi_aff_domain_map(space
);
4144 /* Given a map space, return an isl_pw_multi_aff that maps a wrapped copy
4145 * of the space to its range.
4147 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_map(
4148 __isl_take isl_space
*space
)
4150 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_range_map(space
));
4153 /* This function performs the same operation as isl_pw_multi_aff_range_map,
4154 * but is considered as a function on an isl_space when exported.
4156 __isl_give isl_pw_multi_aff
*isl_space_range_map_pw_multi_aff(
4157 __isl_take isl_space
*space
)
4159 return isl_pw_multi_aff_range_map(space
);
4162 /* Given the space of a set and a range of set dimensions,
4163 * construct an isl_multi_aff that projects out those dimensions.
4165 __isl_give isl_multi_aff
*isl_multi_aff_project_out_map(
4166 __isl_take isl_space
*space
, enum isl_dim_type type
,
4167 unsigned first
, unsigned n
)
4171 isl_local_space
*ls
;
4176 if (!isl_space_is_set(space
))
4177 isl_die(isl_space_get_ctx(space
), isl_error_unsupported
,
4178 "expecting set space", goto error
);
4179 if (type
!= isl_dim_set
)
4180 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
4181 "only set dimensions can be projected out", goto error
);
4182 if (isl_space_check_range(space
, type
, first
, n
) < 0)
4185 dim
= isl_space_dim(space
, isl_dim_set
);
4189 space
= isl_space_from_domain(space
);
4190 space
= isl_space_add_dims(space
, isl_dim_out
, dim
- n
);
4193 return isl_multi_aff_alloc(space
);
4195 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
4196 space
= isl_space_domain(space
);
4197 ls
= isl_local_space_from_space(space
);
4199 for (i
= 0; i
< first
; ++i
) {
4202 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4204 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4207 for (i
= 0; i
< dim
- (first
+ n
); ++i
) {
4210 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4211 isl_dim_set
, first
+ n
+ i
);
4212 ma
= isl_multi_aff_set_aff(ma
, first
+ i
, aff
);
4215 isl_local_space_free(ls
);
4218 isl_space_free(space
);
4222 /* Given the space of a set and a range of set dimensions,
4223 * construct an isl_pw_multi_aff that projects out those dimensions.
4225 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_project_out_map(
4226 __isl_take isl_space
*space
, enum isl_dim_type type
,
4227 unsigned first
, unsigned n
)
4231 ma
= isl_multi_aff_project_out_map(space
, type
, first
, n
);
4232 return isl_pw_multi_aff_from_multi_aff(ma
);
4235 /* This function performs the same operation as isl_pw_multi_aff_from_multi_aff,
4236 * but is considered as a function on an isl_multi_aff when exported.
4238 __isl_give isl_pw_multi_aff
*isl_multi_aff_to_pw_multi_aff(
4239 __isl_take isl_multi_aff
*ma
)
4241 return isl_pw_multi_aff_from_multi_aff(ma
);
4244 /* Create a piecewise multi-affine expression in the given space that maps each
4245 * input dimension to the corresponding output dimension.
4247 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_identity(
4248 __isl_take isl_space
*space
)
4250 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space
));
4253 /* Create a piecewise multi expression that maps elements in the given space
4256 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_identity_on_domain_space(
4257 __isl_take isl_space
*space
)
4261 ma
= isl_multi_aff_identity_on_domain_space(space
);
4262 return isl_pw_multi_aff_from_multi_aff(ma
);
4265 /* This function performs the same operation as
4266 * isl_pw_multi_aff_identity_on_domain_space,
4267 * but is considered as a function on an isl_space when exported.
4269 __isl_give isl_pw_multi_aff
*isl_space_identity_pw_multi_aff_on_domain(
4270 __isl_take isl_space
*space
)
4272 return isl_pw_multi_aff_identity_on_domain_space(space
);
4275 /* Exploit the equalities in "eq" to simplify the affine expressions.
4277 static __isl_give isl_multi_aff
*isl_multi_aff_substitute_equalities(
4278 __isl_take isl_multi_aff
*maff
, __isl_take isl_basic_set
*eq
)
4283 n
= isl_multi_aff_size(maff
);
4287 for (i
= 0; i
< n
; ++i
) {
4290 aff
= isl_multi_aff_take_at(maff
, i
);
4291 aff
= isl_aff_substitute_equalities(aff
,
4292 isl_basic_set_copy(eq
));
4293 maff
= isl_multi_aff_restore_at(maff
, i
, aff
);
4296 isl_basic_set_free(eq
);
4299 isl_basic_set_free(eq
);
4300 isl_multi_aff_free(maff
);
4304 __isl_give isl_multi_aff
*isl_multi_aff_scale(__isl_take isl_multi_aff
*maff
,
4310 n
= isl_multi_aff_size(maff
);
4312 return isl_multi_aff_free(maff
);
4314 for (i
= 0; i
< n
; ++i
) {
4317 aff
= isl_multi_aff_take_at(maff
, i
);
4318 aff
= isl_aff_scale(aff
, f
);
4319 maff
= isl_multi_aff_restore_at(maff
, i
, aff
);
4325 __isl_give isl_multi_aff
*isl_multi_aff_add_on_domain(__isl_keep isl_set
*dom
,
4326 __isl_take isl_multi_aff
*maff1
, __isl_take isl_multi_aff
*maff2
)
4328 maff1
= isl_multi_aff_add(maff1
, maff2
);
4329 maff1
= isl_multi_aff_gist(maff1
, isl_set_copy(dom
));
4333 isl_bool
isl_multi_aff_is_empty(__isl_keep isl_multi_aff
*maff
)
4336 return isl_bool_error
;
4338 return isl_bool_false
;
4341 /* Return the set of domain elements where "ma1" is lexicographically
4342 * smaller than or equal to "ma2".
4344 __isl_give isl_set
*isl_multi_aff_lex_le_set(__isl_take isl_multi_aff
*ma1
,
4345 __isl_take isl_multi_aff
*ma2
)
4347 return isl_multi_aff_lex_ge_set(ma2
, ma1
);
4350 /* Return the set of domain elements where "ma1" is lexicographically
4351 * smaller than "ma2".
4353 __isl_give isl_set
*isl_multi_aff_lex_lt_set(__isl_take isl_multi_aff
*ma1
,
4354 __isl_take isl_multi_aff
*ma2
)
4356 return isl_multi_aff_lex_gt_set(ma2
, ma1
);
4359 /* Return the set of domain elements where "ma1" is lexicographically
4360 * greater than to "ma2". If "equal" is set, then include the domain
4361 * elements where they are equal.
4362 * Do this for the case where there are no entries.
4363 * In this case, "ma1" cannot be greater than "ma2",
4364 * but it is (greater than or) equal to "ma2".
4366 static __isl_give isl_set
*isl_multi_aff_lex_gte_set_0d(
4367 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
, int equal
)
4371 space
= isl_multi_aff_get_domain_space(ma1
);
4373 isl_multi_aff_free(ma1
);
4374 isl_multi_aff_free(ma2
);
4377 return isl_set_universe(space
);
4379 return isl_set_empty(space
);
4382 /* Return the set where entry "i" of "ma1" and "ma2"
4383 * satisfy the relation prescribed by "cmp".
4385 static __isl_give isl_set
*isl_multi_aff_order_at(__isl_keep isl_multi_aff
*ma1
,
4386 __isl_keep isl_multi_aff
*ma2
, int i
,
4387 __isl_give isl_set
*(*cmp
)(__isl_take isl_aff
*aff1
,
4388 __isl_take isl_aff
*aff2
))
4390 isl_aff
*aff1
, *aff2
;
4392 aff1
= isl_multi_aff_get_at(ma1
, i
);
4393 aff2
= isl_multi_aff_get_at(ma2
, i
);
4394 return cmp(aff1
, aff2
);
4397 /* Return the set of domain elements where "ma1" is lexicographically
4398 * greater than to "ma2". If "equal" is set, then include the domain
4399 * elements where they are equal.
4401 * In particular, for all but the final entry,
4402 * include the set of elements where this entry is strictly greater in "ma1"
4403 * and all previous entries are equal.
4404 * The final entry is also allowed to be equal in the two functions
4405 * if "equal" is set.
4407 * The case where there are no entries is handled separately.
4409 static __isl_give isl_set
*isl_multi_aff_lex_gte_set(
4410 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
, int equal
)
4419 if (isl_multi_aff_check_equal_space(ma1
, ma2
) < 0)
4421 n
= isl_multi_aff_size(ma1
);
4425 return isl_multi_aff_lex_gte_set_0d(ma1
, ma2
, equal
);
4427 space
= isl_multi_aff_get_domain_space(ma1
);
4428 res
= isl_set_empty(isl_space_copy(space
));
4429 equal_set
= isl_set_universe(space
);
4431 for (i
= 0; i
+ 1 < n
; ++i
) {
4435 gt
= isl_multi_aff_order_at(ma1
, ma2
, i
, &isl_aff_gt_set
);
4436 gt
= isl_set_intersect(gt
, isl_set_copy(equal_set
));
4437 res
= isl_set_union(res
, gt
);
4438 eq
= isl_multi_aff_order_at(ma1
, ma2
, i
, &isl_aff_eq_set
);
4439 equal_set
= isl_set_intersect(equal_set
, eq
);
4441 empty
= isl_set_is_empty(equal_set
);
4442 if (empty
>= 0 && empty
)
4447 gte
= isl_multi_aff_order_at(ma1
, ma2
, n
- 1, &isl_aff_ge_set
);
4449 gte
= isl_multi_aff_order_at(ma1
, ma2
, n
- 1, &isl_aff_gt_set
);
4450 isl_multi_aff_free(ma1
);
4451 isl_multi_aff_free(ma2
);
4453 gte
= isl_set_intersect(gte
, equal_set
);
4454 return isl_set_union(res
, gte
);
4456 isl_multi_aff_free(ma1
);
4457 isl_multi_aff_free(ma2
);
4461 /* Return the set of domain elements where "ma1" is lexicographically
4462 * greater than or equal to "ma2".
4464 __isl_give isl_set
*isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff
*ma1
,
4465 __isl_take isl_multi_aff
*ma2
)
4467 return isl_multi_aff_lex_gte_set(ma1
, ma2
, 1);
4470 /* Return the set of domain elements where "ma1" is lexicographically
4471 * greater than "ma2".
4473 __isl_give isl_set
*isl_multi_aff_lex_gt_set(__isl_take isl_multi_aff
*ma1
,
4474 __isl_take isl_multi_aff
*ma2
)
4476 return isl_multi_aff_lex_gte_set(ma1
, ma2
, 0);
4479 #define isl_multi_aff_zero_in_space isl_multi_aff_zero
4482 #define PW isl_pw_multi_aff
4484 #define BASE multi_aff
4486 #define EL_IS_ZERO is_empty
4490 #define IS_ZERO is_empty
4493 #undef DEFAULT_IS_ZERO
4494 #define DEFAULT_IS_ZERO 0
4496 #include <isl_pw_templ.c>
4497 #include <isl_pw_un_op_templ.c>
4498 #include <isl_pw_add_constant_multi_val_templ.c>
4499 #include <isl_pw_add_constant_val_templ.c>
4500 #include <isl_pw_bind_domain_templ.c>
4501 #include <isl_pw_insert_dims_templ.c>
4502 #include <isl_pw_insert_domain_templ.c>
4503 #include <isl_pw_locals_templ.c>
4504 #include <isl_pw_move_dims_templ.c>
4505 #include <isl_pw_neg_templ.c>
4506 #include <isl_pw_pullback_templ.c>
4507 #include <isl_pw_range_tuple_id_templ.c>
4508 #include <isl_pw_union_opt.c>
4511 #define BASE pw_multi_aff
4513 #include <isl_union_multi.c>
4514 #include "isl_union_locals_templ.c"
4515 #include <isl_union_neg.c>
4518 #define BASE multi_aff
4520 #include <isl_union_pw_templ.c>
4522 /* Generic function for extracting a factor from a product "pma".
4523 * "check_space" checks that the space is that of the right kind of product.
4524 * "space_factor" extracts the factor from the space.
4525 * "multi_aff_factor" extracts the factor from the constituent functions.
4527 static __isl_give isl_pw_multi_aff
*pw_multi_aff_factor(
4528 __isl_take isl_pw_multi_aff
*pma
,
4529 isl_stat (*check_space
)(__isl_keep isl_pw_multi_aff
*pma
),
4530 __isl_give isl_space
*(*space_factor
)(__isl_take isl_space
*space
),
4531 __isl_give isl_multi_aff
*(*multi_aff_factor
)(
4532 __isl_take isl_multi_aff
*ma
))
4537 if (check_space(pma
) < 0)
4538 return isl_pw_multi_aff_free(pma
);
4540 space
= isl_pw_multi_aff_take_space(pma
);
4541 space
= space_factor(space
);
4543 for (i
= 0; pma
&& i
< pma
->n
; ++i
) {
4546 ma
= isl_pw_multi_aff_take_base_at(pma
, i
);
4547 ma
= multi_aff_factor(ma
);
4548 pma
= isl_pw_multi_aff_restore_base_at(pma
, i
, ma
);
4551 pma
= isl_pw_multi_aff_restore_space(pma
, space
);
4556 /* Is the range of "pma" a wrapped relation?
4558 static isl_bool
isl_pw_multi_aff_range_is_wrapping(
4559 __isl_keep isl_pw_multi_aff
*pma
)
4561 return isl_space_range_is_wrapping(isl_pw_multi_aff_peek_space(pma
));
4564 /* Check that the range of "pma" is a product.
4566 static isl_stat
pw_multi_aff_check_range_product(
4567 __isl_keep isl_pw_multi_aff
*pma
)
4571 wraps
= isl_pw_multi_aff_range_is_wrapping(pma
);
4573 return isl_stat_error
;
4575 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
4576 "range is not a product", return isl_stat_error
);
4580 /* Given a function A -> [B -> C], extract the function A -> B.
4582 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_factor_domain(
4583 __isl_take isl_pw_multi_aff
*pma
)
4585 return pw_multi_aff_factor(pma
, &pw_multi_aff_check_range_product
,
4586 &isl_space_range_factor_domain
,
4587 &isl_multi_aff_range_factor_domain
);
4590 /* Given a function A -> [B -> C], extract the function A -> C.
4592 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_factor_range(
4593 __isl_take isl_pw_multi_aff
*pma
)
4595 return pw_multi_aff_factor(pma
, &pw_multi_aff_check_range_product
,
4596 &isl_space_range_factor_range
,
4597 &isl_multi_aff_range_factor_range
);
4600 /* Given two piecewise multi affine expressions, return a piecewise
4601 * multi-affine expression defined on the union of the definition domains
4602 * of the inputs that is equal to the lexicographic maximum of the two
4603 * inputs on each cell. If only one of the two inputs is defined on
4604 * a given cell, then it is considered to be the maximum.
4606 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmax(
4607 __isl_take isl_pw_multi_aff
*pma1
,
4608 __isl_take isl_pw_multi_aff
*pma2
)
4610 isl_pw_multi_aff_align_params_bin(&pma1
, &pma2
);
4611 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4612 &isl_multi_aff_lex_ge_set
);
4615 /* Given two piecewise multi affine expressions, return a piecewise
4616 * multi-affine expression defined on the union of the definition domains
4617 * of the inputs that is equal to the lexicographic minimum of the two
4618 * inputs on each cell. If only one of the two inputs is defined on
4619 * a given cell, then it is considered to be the minimum.
4621 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmin(
4622 __isl_take isl_pw_multi_aff
*pma1
,
4623 __isl_take isl_pw_multi_aff
*pma2
)
4625 isl_pw_multi_aff_align_params_bin(&pma1
, &pma2
);
4626 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4627 &isl_multi_aff_lex_le_set
);
4630 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_add(
4631 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4633 isl_pw_multi_aff_align_params_bin(&pma1
, &pma2
);
4634 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4635 &isl_multi_aff_add
);
4638 /* Subtract "pma2" from "pma1" and return the result.
4640 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_sub(
4641 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4643 isl_pw_multi_aff_align_params_bin(&pma1
, &pma2
);
4644 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4645 &isl_multi_aff_sub
);
4648 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_add(
4649 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4651 return isl_pw_multi_aff_union_add_(pma1
, pma2
);
4654 /* Compute the sum of "upa1" and "upa2" on the union of their domains,
4655 * with the actual sum on the shared domain and
4656 * the defined expression on the symmetric difference of the domains.
4658 __isl_give isl_union_pw_aff
*isl_union_pw_aff_union_add(
4659 __isl_take isl_union_pw_aff
*upa1
, __isl_take isl_union_pw_aff
*upa2
)
4661 return isl_union_pw_aff_union_add_(upa1
, upa2
);
4664 /* Compute the sum of "upma1" and "upma2" on the union of their domains,
4665 * with the actual sum on the shared domain and
4666 * the defined expression on the symmetric difference of the domains.
4668 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_union_add(
4669 __isl_take isl_union_pw_multi_aff
*upma1
,
4670 __isl_take isl_union_pw_multi_aff
*upma2
)
4672 return isl_union_pw_multi_aff_union_add_(upma1
, upma2
);
4675 /* Given two piecewise multi-affine expressions A -> B and C -> D,
4676 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
4678 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_product(
4679 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4683 isl_pw_multi_aff
*res
;
4685 if (isl_pw_multi_aff_align_params_bin(&pma1
, &pma2
) < 0)
4688 n
= pma1
->n
* pma2
->n
;
4689 space
= isl_space_product(isl_space_copy(pma1
->dim
),
4690 isl_space_copy(pma2
->dim
));
4691 res
= isl_pw_multi_aff_alloc_size(space
, n
);
4693 for (i
= 0; i
< pma1
->n
; ++i
) {
4694 for (j
= 0; j
< pma2
->n
; ++j
) {
4698 domain
= isl_set_product(isl_set_copy(pma1
->p
[i
].set
),
4699 isl_set_copy(pma2
->p
[j
].set
));
4700 ma
= isl_multi_aff_product(
4701 isl_multi_aff_copy(pma1
->p
[i
].maff
),
4702 isl_multi_aff_copy(pma2
->p
[j
].maff
));
4703 res
= isl_pw_multi_aff_add_piece(res
, domain
, ma
);
4707 isl_pw_multi_aff_free(pma1
);
4708 isl_pw_multi_aff_free(pma2
);
4711 isl_pw_multi_aff_free(pma1
);
4712 isl_pw_multi_aff_free(pma2
);
4716 /* Subtract the initial "n" elements in "ma" with coefficients in "c" and
4717 * denominator "denom".
4718 * "denom" is allowed to be negative, in which case the actual denominator
4719 * is -denom and the expressions are added instead.
4721 static __isl_give isl_aff
*subtract_initial(__isl_take isl_aff
*aff
,
4722 __isl_keep isl_multi_aff
*ma
, int n
, isl_int
*c
, isl_int denom
)
4728 first
= isl_seq_first_non_zero(c
, n
);
4732 sign
= isl_int_sgn(denom
);
4734 isl_int_abs(d
, denom
);
4735 for (i
= first
; i
< n
; ++i
) {
4738 if (isl_int_is_zero(c
[i
]))
4740 aff_i
= isl_multi_aff_get_aff(ma
, i
);
4741 aff_i
= isl_aff_scale(aff_i
, c
[i
]);
4742 aff_i
= isl_aff_scale_down(aff_i
, d
);
4744 aff
= isl_aff_sub(aff
, aff_i
);
4746 aff
= isl_aff_add(aff
, aff_i
);
4753 /* Extract an affine expression that expresses the output dimension "pos"
4754 * of "bmap" in terms of the parameters and input dimensions from
4756 * Note that this expression may involve integer divisions defined
4757 * in terms of parameters and input dimensions.
4758 * The equality may also involve references to earlier (but not later)
4759 * output dimensions. These are replaced by the corresponding elements
4762 * If the equality is of the form
4764 * f(i) + h(j) + a x + g(i) = 0,
4766 * with f(i) a linear combinations of the parameters and input dimensions,
4767 * g(i) a linear combination of integer divisions defined in terms of the same
4768 * and h(j) a linear combinations of earlier output dimensions,
4769 * then the affine expression is
4771 * (-f(i) - g(i))/a - h(j)/a
4773 * If the equality is of the form
4775 * f(i) + h(j) - a x + g(i) = 0,
4777 * then the affine expression is
4779 * (f(i) + g(i))/a - h(j)/(-a)
4782 * If "div" refers to an integer division (i.e., it is smaller than
4783 * the number of integer divisions), then the equality constraint
4784 * does involve an integer division (the one at position "div") that
4785 * is defined in terms of output dimensions. However, this integer
4786 * division can be eliminated by exploiting a pair of constraints
4787 * x >= l and x <= l + n, with n smaller than the coefficient of "div"
4788 * in the equality constraint. "ineq" refers to inequality x >= l, i.e.,
4790 * In particular, let
4792 * x = e(i) + m floor(...)
4794 * with e(i) the expression derived above and floor(...) the integer
4795 * division involving output dimensions.
4806 * e(i) + m floor(...) - l = (e(i) + m floor(...) - l) mod m
4807 * = (e(i) - l) mod m
4811 * x - l = (e(i) - l) mod m
4815 * x = ((e(i) - l) mod m) + l
4817 * The variable "shift" below contains the expression -l, which may
4818 * also involve a linear combination of earlier output dimensions.
4820 static __isl_give isl_aff
*extract_aff_from_equality(
4821 __isl_keep isl_basic_map
*bmap
, int pos
, int eq
, int div
, int ineq
,
4822 __isl_keep isl_multi_aff
*ma
)
4825 isl_size n_div
, n_out
;
4827 isl_local_space
*ls
;
4828 isl_aff
*aff
, *shift
;
4831 ctx
= isl_basic_map_get_ctx(bmap
);
4832 ls
= isl_basic_map_get_local_space(bmap
);
4833 ls
= isl_local_space_domain(ls
);
4834 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
4837 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
4838 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4839 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4840 if (n_out
< 0 || n_div
< 0)
4842 if (isl_int_is_neg(bmap
->eq
[eq
][o_out
+ pos
])) {
4843 isl_seq_cpy(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4844 isl_seq_cpy(aff
->v
->el
+ 1 + o_out
,
4845 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4847 isl_seq_neg(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4848 isl_seq_neg(aff
->v
->el
+ 1 + o_out
,
4849 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4852 isl_int_set_si(aff
->v
->el
[1 + o_out
+ div
], 0);
4853 isl_int_abs(aff
->v
->el
[0], bmap
->eq
[eq
][o_out
+ pos
]);
4854 aff
= subtract_initial(aff
, ma
, pos
, bmap
->eq
[eq
] + o_out
,
4855 bmap
->eq
[eq
][o_out
+ pos
]);
4857 shift
= isl_aff_alloc(isl_local_space_copy(ls
));
4860 isl_seq_cpy(shift
->v
->el
+ 1, bmap
->ineq
[ineq
], o_out
);
4861 isl_seq_cpy(shift
->v
->el
+ 1 + o_out
,
4862 bmap
->ineq
[ineq
] + o_out
+ n_out
, n_div
);
4863 isl_int_set_si(shift
->v
->el
[0], 1);
4864 shift
= subtract_initial(shift
, ma
, pos
,
4865 bmap
->ineq
[ineq
] + o_out
, ctx
->negone
);
4866 aff
= isl_aff_add(aff
, isl_aff_copy(shift
));
4867 mod
= isl_val_int_from_isl_int(ctx
,
4868 bmap
->eq
[eq
][o_out
+ n_out
+ div
]);
4869 mod
= isl_val_abs(mod
);
4870 aff
= isl_aff_mod_val(aff
, mod
);
4871 aff
= isl_aff_sub(aff
, shift
);
4874 isl_local_space_free(ls
);
4877 isl_local_space_free(ls
);
4882 /* Given a basic map with output dimensions defined
4883 * in terms of the parameters input dimensions and earlier
4884 * output dimensions using an equality (and possibly a pair on inequalities),
4885 * extract an isl_aff that expresses output dimension "pos" in terms
4886 * of the parameters and input dimensions.
4887 * Note that this expression may involve integer divisions defined
4888 * in terms of parameters and input dimensions.
4889 * "ma" contains the expressions corresponding to earlier output dimensions.
4891 * This function shares some similarities with
4892 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
4894 static __isl_give isl_aff
*extract_isl_aff_from_basic_map(
4895 __isl_keep isl_basic_map
*bmap
, int pos
, __isl_keep isl_multi_aff
*ma
)
4902 eq
= isl_basic_map_output_defining_equality(bmap
, pos
, &div
, &ineq
);
4903 if (eq
>= bmap
->n_eq
)
4904 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4905 "unable to find suitable equality", return NULL
);
4906 aff
= extract_aff_from_equality(bmap
, pos
, eq
, div
, ineq
, ma
);
4908 aff
= isl_aff_remove_unused_divs(aff
);
4912 /* Given a basic map where each output dimension is defined
4913 * in terms of the parameters and input dimensions using an equality,
4914 * extract an isl_multi_aff that expresses the output dimensions in terms
4915 * of the parameters and input dimensions.
4917 static __isl_give isl_multi_aff
*extract_isl_multi_aff_from_basic_map(
4918 __isl_take isl_basic_map
*bmap
)
4927 ma
= isl_multi_aff_alloc(isl_basic_map_get_space(bmap
));
4928 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4930 ma
= isl_multi_aff_free(ma
);
4932 for (i
= 0; i
< n_out
; ++i
) {
4935 aff
= extract_isl_aff_from_basic_map(bmap
, i
, ma
);
4936 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4939 isl_basic_map_free(bmap
);
4944 /* Given a basic set where each set dimension is defined
4945 * in terms of the parameters using an equality,
4946 * extract an isl_multi_aff that expresses the set dimensions in terms
4947 * of the parameters.
4949 __isl_give isl_multi_aff
*isl_multi_aff_from_basic_set_equalities(
4950 __isl_take isl_basic_set
*bset
)
4952 return extract_isl_multi_aff_from_basic_map(bset
);
4955 /* Create an isl_pw_multi_aff that is equivalent to
4956 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
4957 * The given basic map is such that each output dimension is defined
4958 * in terms of the parameters and input dimensions using an equality.
4960 * Since some applications expect the result of isl_pw_multi_aff_from_map
4961 * to only contain integer affine expressions, we compute the floor
4962 * of the expression before returning.
4964 * Remove all constraints involving local variables without
4965 * an explicit representation (resulting in the removal of those
4966 * local variables) prior to the actual extraction to ensure
4967 * that the local spaces in which the resulting affine expressions
4968 * are created do not contain any unknown local variables.
4969 * Removing such constraints is safe because constraints involving
4970 * unknown local variables are not used to determine whether
4971 * a basic map is obviously single-valued.
4973 static __isl_give isl_pw_multi_aff
*plain_pw_multi_aff_from_map(
4974 __isl_take isl_set
*domain
, __isl_take isl_basic_map
*bmap
)
4978 bmap
= isl_basic_map_drop_constraints_involving_unknown_divs(bmap
);
4979 ma
= extract_isl_multi_aff_from_basic_map(bmap
);
4980 ma
= isl_multi_aff_floor(ma
);
4981 return isl_pw_multi_aff_alloc(domain
, ma
);
4984 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4985 * This obviously only works if the input "map" is single-valued.
4986 * If so, we compute the lexicographic minimum of the image in the form
4987 * of an isl_pw_multi_aff. Since the image is unique, it is equal
4988 * to its lexicographic minimum.
4989 * If the input is not single-valued, we produce an error.
4991 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_base(
4992 __isl_take isl_map
*map
)
4996 isl_pw_multi_aff
*pma
;
4998 sv
= isl_map_is_single_valued(map
);
5002 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5003 "map is not single-valued", goto error
);
5004 map
= isl_map_make_disjoint(map
);
5008 pma
= isl_pw_multi_aff_empty(isl_map_get_space(map
));
5010 for (i
= 0; i
< map
->n
; ++i
) {
5011 isl_pw_multi_aff
*pma_i
;
5012 isl_basic_map
*bmap
;
5013 bmap
= isl_basic_map_copy(map
->p
[i
]);
5014 pma_i
= isl_basic_map_lexmin_pw_multi_aff(bmap
);
5015 pma
= isl_pw_multi_aff_add_disjoint(pma
, pma_i
);
5025 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
5026 * taking into account that the output dimension at position "d"
5027 * can be represented as
5029 * x = floor((e(...) + c1) / m)
5031 * given that constraint "i" is of the form
5033 * e(...) + c1 - m x >= 0
5036 * Let "map" be of the form
5040 * We construct a mapping
5042 * A -> [A -> x = floor(...)]
5044 * apply that to the map, obtaining
5046 * [A -> x = floor(...)] -> B
5048 * and equate dimension "d" to x.
5049 * We then compute a isl_pw_multi_aff representation of the resulting map
5050 * and plug in the mapping above.
5052 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_div(
5053 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
)
5056 isl_space
*space
= NULL
;
5057 isl_local_space
*ls
;
5065 isl_pw_multi_aff
*pma
;
5068 is_set
= isl_map_is_set(map
);
5072 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
5073 ctx
= isl_map_get_ctx(map
);
5074 space
= isl_space_domain(isl_map_get_space(map
));
5075 n_in
= isl_space_dim(space
, isl_dim_set
);
5076 n
= isl_space_dim(space
, isl_dim_all
);
5077 if (n_in
< 0 || n
< 0)
5080 v
= isl_vec_alloc(ctx
, 1 + 1 + n
);
5082 isl_int_neg(v
->el
[0], hull
->ineq
[i
][offset
+ d
]);
5083 isl_seq_cpy(v
->el
+ 1, hull
->ineq
[i
], 1 + n
);
5085 isl_basic_map_free(hull
);
5087 ls
= isl_local_space_from_space(isl_space_copy(space
));
5088 aff
= isl_aff_alloc_vec(ls
, v
);
5089 aff
= isl_aff_floor(aff
);
5091 isl_space_free(space
);
5092 ma
= isl_multi_aff_from_aff(aff
);
5094 ma
= isl_multi_aff_identity(isl_space_map_from_set(space
));
5095 ma
= isl_multi_aff_range_product(ma
,
5096 isl_multi_aff_from_aff(aff
));
5099 insert
= isl_map_from_multi_aff_internal(isl_multi_aff_copy(ma
));
5100 map
= isl_map_apply_domain(map
, insert
);
5101 map
= isl_map_equate(map
, isl_dim_in
, n_in
, isl_dim_out
, d
);
5102 pma
= isl_pw_multi_aff_from_map(map
);
5103 pma
= isl_pw_multi_aff_pullback_multi_aff(pma
, ma
);
5107 isl_space_free(space
);
5109 isl_basic_map_free(hull
);
5113 /* Is constraint "c" of the form
5115 * e(...) + c1 - m x >= 0
5119 * -e(...) + c2 + m x >= 0
5121 * where m > 1 and e only depends on parameters and input dimensions?
5123 * "offset" is the offset of the output dimensions
5124 * "pos" is the position of output dimension x.
5126 static int is_potential_div_constraint(isl_int
*c
, int offset
, int d
, int total
)
5128 if (isl_int_is_zero(c
[offset
+ d
]))
5130 if (isl_int_is_one(c
[offset
+ d
]))
5132 if (isl_int_is_negone(c
[offset
+ d
]))
5134 if (isl_seq_first_non_zero(c
+ offset
, d
) != -1)
5136 if (isl_seq_first_non_zero(c
+ offset
+ d
+ 1,
5137 total
- (offset
+ d
+ 1)) != -1)
5142 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
5144 * As a special case, we first check if there is any pair of constraints,
5145 * shared by all the basic maps in "map" that force a given dimension
5146 * to be equal to the floor of some affine combination of the input dimensions.
5148 * In particular, if we can find two constraints
5150 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
5154 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
5156 * where m > 1 and e only depends on parameters and input dimensions,
5159 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
5161 * then we know that we can take
5163 * x = floor((e(...) + c1) / m)
5165 * without having to perform any computation.
5167 * Note that we know that
5171 * If c1 + c2 were 0, then we would have detected an equality during
5172 * simplification. If c1 + c2 were negative, then we would have detected
5175 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_div(
5176 __isl_take isl_map
*map
)
5184 isl_basic_map
*hull
;
5186 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5187 dim
= isl_map_dim(map
, isl_dim_out
);
5188 total
= isl_basic_map_dim(hull
, isl_dim_all
);
5189 if (dim
< 0 || total
< 0)
5193 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
5195 for (d
= 0; d
< dim
; ++d
) {
5196 for (i
= 0; i
< n
; ++i
) {
5197 if (!is_potential_div_constraint(hull
->ineq
[i
],
5198 offset
, d
, 1 + total
))
5200 for (j
= i
+ 1; j
< n
; ++j
) {
5201 if (!isl_seq_is_neg(hull
->ineq
[i
] + 1,
5202 hull
->ineq
[j
] + 1, total
))
5204 isl_int_add(sum
, hull
->ineq
[i
][0],
5206 if (isl_int_abs_lt(sum
,
5207 hull
->ineq
[i
][offset
+ d
]))
5214 if (isl_int_is_pos(hull
->ineq
[j
][offset
+ d
]))
5216 return pw_multi_aff_from_map_div(map
, hull
, d
, j
);
5220 isl_basic_map_free(hull
);
5221 return pw_multi_aff_from_map_base(map
);
5224 isl_basic_map_free(hull
);
5228 /* Given an affine expression
5230 * [A -> B] -> f(A,B)
5232 * construct an isl_multi_aff
5236 * such that dimension "d" in B' is set to "aff" and the remaining
5237 * dimensions are set equal to the corresponding dimensions in B.
5238 * "n_in" is the dimension of the space A.
5239 * "n_out" is the dimension of the space B.
5241 * If "is_set" is set, then the affine expression is of the form
5245 * and we construct an isl_multi_aff
5249 static __isl_give isl_multi_aff
*range_map(__isl_take isl_aff
*aff
, int d
,
5250 unsigned n_in
, unsigned n_out
, int is_set
)
5254 isl_space
*space
, *space2
;
5255 isl_local_space
*ls
;
5257 space
= isl_aff_get_domain_space(aff
);
5258 ls
= isl_local_space_from_space(isl_space_copy(space
));
5259 space2
= isl_space_copy(space
);
5261 space2
= isl_space_range(isl_space_unwrap(space2
));
5262 space
= isl_space_map_from_domain_and_range(space
, space2
);
5263 ma
= isl_multi_aff_alloc(space
);
5264 ma
= isl_multi_aff_set_aff(ma
, d
, aff
);
5266 for (i
= 0; i
< n_out
; ++i
) {
5269 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
5270 isl_dim_set
, n_in
+ i
);
5271 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
5274 isl_local_space_free(ls
);
5279 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
5280 * taking into account that the dimension at position "d" can be written as
5282 * x = m a + f(..) (1)
5284 * where m is equal to "gcd".
5285 * "i" is the index of the equality in "hull" that defines f(..).
5286 * In particular, the equality is of the form
5288 * f(..) - x + m g(existentials) = 0
5292 * -f(..) + x + m g(existentials) = 0
5294 * We basically plug (1) into "map", resulting in a map with "a"
5295 * in the range instead of "x". The corresponding isl_pw_multi_aff
5296 * defining "a" is then plugged back into (1) to obtain a definition for "x".
5298 * Specifically, given the input map
5302 * We first wrap it into a set
5306 * and define (1) on top of the corresponding space, resulting in "aff".
5307 * We use this to create an isl_multi_aff that maps the output position "d"
5308 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
5309 * We plug this into the wrapped map, unwrap the result and compute the
5310 * corresponding isl_pw_multi_aff.
5311 * The result is an expression
5319 * so that we can plug that into "aff", after extending the latter to
5325 * If "map" is actually a set, then there is no "A" space, meaning
5326 * that we do not need to perform any wrapping, and that the result
5327 * of the recursive call is of the form
5331 * which is plugged into a mapping of the form
5335 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_stride(
5336 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
,
5341 isl_local_space
*ls
;
5344 isl_pw_multi_aff
*pma
, *id
;
5350 is_set
= isl_map_is_set(map
);
5354 n_in
= isl_basic_map_dim(hull
, isl_dim_in
);
5355 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5356 if (n_in
< 0 || n_out
< 0)
5358 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5363 set
= isl_map_wrap(map
);
5364 space
= isl_space_map_from_set(isl_set_get_space(set
));
5365 ma
= isl_multi_aff_identity(space
);
5366 ls
= isl_local_space_from_space(isl_set_get_space(set
));
5367 aff
= isl_aff_alloc(ls
);
5369 isl_int_set_si(aff
->v
->el
[0], 1);
5370 if (isl_int_is_one(hull
->eq
[i
][o_out
+ d
]))
5371 isl_seq_neg(aff
->v
->el
+ 1, hull
->eq
[i
],
5374 isl_seq_cpy(aff
->v
->el
+ 1, hull
->eq
[i
],
5376 isl_int_set(aff
->v
->el
[1 + o_out
+ d
], gcd
);
5378 ma
= isl_multi_aff_set_aff(ma
, n_in
+ d
, isl_aff_copy(aff
));
5379 set
= isl_set_preimage_multi_aff(set
, ma
);
5381 ma
= range_map(aff
, d
, n_in
, n_out
, is_set
);
5386 map
= isl_set_unwrap(set
);
5387 pma
= isl_pw_multi_aff_from_map(map
);
5390 space
= isl_pw_multi_aff_get_domain_space(pma
);
5391 space
= isl_space_map_from_set(space
);
5392 id
= isl_pw_multi_aff_identity(space
);
5393 pma
= isl_pw_multi_aff_range_product(id
, pma
);
5395 id
= isl_pw_multi_aff_from_multi_aff(ma
);
5396 pma
= isl_pw_multi_aff_pullback_pw_multi_aff(id
, pma
);
5398 isl_basic_map_free(hull
);
5402 isl_basic_map_free(hull
);
5406 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
5407 * "hull" contains the equalities valid for "map".
5409 * Check if any of the output dimensions is "strided".
5410 * That is, we check if it can be written as
5414 * with m greater than 1, a some combination of existentially quantified
5415 * variables and f an expression in the parameters and input dimensions.
5416 * If so, we remove the stride in pw_multi_aff_from_map_stride.
5418 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
5421 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_strides(
5422 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
)
5431 n_div
= isl_basic_map_dim(hull
, isl_dim_div
);
5432 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5433 if (n_div
< 0 || n_out
< 0)
5437 isl_basic_map_free(hull
);
5438 return pw_multi_aff_from_map_check_div(map
);
5443 o_div
= isl_basic_map_offset(hull
, isl_dim_div
);
5444 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5446 for (i
= 0; i
< n_out
; ++i
) {
5447 for (j
= 0; j
< hull
->n_eq
; ++j
) {
5448 isl_int
*eq
= hull
->eq
[j
];
5449 isl_pw_multi_aff
*res
;
5451 if (!isl_int_is_one(eq
[o_out
+ i
]) &&
5452 !isl_int_is_negone(eq
[o_out
+ i
]))
5454 if (isl_seq_first_non_zero(eq
+ o_out
, i
) != -1)
5456 if (isl_seq_first_non_zero(eq
+ o_out
+ i
+ 1,
5457 n_out
- (i
+ 1)) != -1)
5459 isl_seq_gcd(eq
+ o_div
, n_div
, &gcd
);
5460 if (isl_int_is_zero(gcd
))
5462 if (isl_int_is_one(gcd
))
5465 res
= pw_multi_aff_from_map_stride(map
, hull
,
5473 isl_basic_map_free(hull
);
5474 return pw_multi_aff_from_map_check_div(map
);
5477 isl_basic_map_free(hull
);
5481 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
5483 * As a special case, we first check if all output dimensions are uniquely
5484 * defined in terms of the parameters and input dimensions over the entire
5485 * domain. If so, we extract the desired isl_pw_multi_aff directly
5486 * from the affine hull of "map" and its domain.
5488 * Otherwise, continue with pw_multi_aff_from_map_check_strides for more
5491 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_map(__isl_take isl_map
*map
)
5495 isl_basic_map
*hull
;
5497 n
= isl_map_n_basic_map(map
);
5502 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5503 hull
= isl_basic_map_plain_affine_hull(hull
);
5504 sv
= isl_basic_map_plain_is_single_valued(hull
);
5506 return plain_pw_multi_aff_from_map(isl_map_domain(map
),
5508 isl_basic_map_free(hull
);
5510 map
= isl_map_detect_equalities(map
);
5511 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5512 sv
= isl_basic_map_plain_is_single_valued(hull
);
5514 return plain_pw_multi_aff_from_map(isl_map_domain(map
), hull
);
5516 return pw_multi_aff_from_map_check_strides(map
, hull
);
5517 isl_basic_map_free(hull
);
5523 /* This function performs the same operation as isl_pw_multi_aff_from_map,
5524 * but is considered as a function on an isl_map when exported.
5526 __isl_give isl_pw_multi_aff
*isl_map_as_pw_multi_aff(__isl_take isl_map
*map
)
5528 return isl_pw_multi_aff_from_map(map
);
5531 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_set(__isl_take isl_set
*set
)
5533 return isl_pw_multi_aff_from_map(set
);
5536 /* This function performs the same operation as isl_pw_multi_aff_from_set,
5537 * but is considered as a function on an isl_set when exported.
5539 __isl_give isl_pw_multi_aff
*isl_set_as_pw_multi_aff(__isl_take isl_set
*set
)
5541 return isl_pw_multi_aff_from_set(set
);
5544 /* Convert "map" into an isl_pw_multi_aff (if possible) and
5547 static isl_stat
pw_multi_aff_from_map(__isl_take isl_map
*map
, void *user
)
5549 isl_union_pw_multi_aff
**upma
= user
;
5550 isl_pw_multi_aff
*pma
;
5552 pma
= isl_pw_multi_aff_from_map(map
);
5553 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5555 return *upma
? isl_stat_ok
: isl_stat_error
;
5558 /* Create an isl_union_pw_multi_aff with the given isl_aff on a universe
5561 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_aff(
5562 __isl_take isl_aff
*aff
)
5565 isl_pw_multi_aff
*pma
;
5567 ma
= isl_multi_aff_from_aff(aff
);
5568 pma
= isl_pw_multi_aff_from_multi_aff(ma
);
5569 return isl_union_pw_multi_aff_from_pw_multi_aff(pma
);
5572 /* Try and create an isl_union_pw_multi_aff that is equivalent
5573 * to the given isl_union_map.
5574 * The isl_union_map is required to be single-valued in each space.
5575 * Otherwise, an error is produced.
5577 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_map(
5578 __isl_take isl_union_map
*umap
)
5581 isl_union_pw_multi_aff
*upma
;
5583 space
= isl_union_map_get_space(umap
);
5584 upma
= isl_union_pw_multi_aff_empty(space
);
5585 if (isl_union_map_foreach_map(umap
, &pw_multi_aff_from_map
, &upma
) < 0)
5586 upma
= isl_union_pw_multi_aff_free(upma
);
5587 isl_union_map_free(umap
);
5592 /* This function performs the same operation as
5593 * isl_union_pw_multi_aff_from_union_map,
5594 * but is considered as a function on an isl_union_map when exported.
5596 __isl_give isl_union_pw_multi_aff
*isl_union_map_as_union_pw_multi_aff(
5597 __isl_take isl_union_map
*umap
)
5599 return isl_union_pw_multi_aff_from_union_map(umap
);
5602 /* Try and create an isl_union_pw_multi_aff that is equivalent
5603 * to the given isl_union_set.
5604 * The isl_union_set is required to be a singleton in each space.
5605 * Otherwise, an error is produced.
5607 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_set(
5608 __isl_take isl_union_set
*uset
)
5610 return isl_union_pw_multi_aff_from_union_map(uset
);
5613 /* Return the piecewise affine expression "set ? 1 : 0".
5615 __isl_give isl_pw_aff
*isl_set_indicator_function(__isl_take isl_set
*set
)
5618 isl_space
*space
= isl_set_get_space(set
);
5619 isl_local_space
*ls
= isl_local_space_from_space(space
);
5620 isl_aff
*zero
= isl_aff_zero_on_domain(isl_local_space_copy(ls
));
5621 isl_aff
*one
= isl_aff_zero_on_domain(ls
);
5623 one
= isl_aff_add_constant_si(one
, 1);
5624 pa
= isl_pw_aff_alloc(isl_set_copy(set
), one
);
5625 set
= isl_set_complement(set
);
5626 pa
= isl_pw_aff_add_disjoint(pa
, isl_pw_aff_alloc(set
, zero
));
5631 /* Plug in "subs" for dimension "type", "pos" of "aff".
5633 * Let i be the dimension to replace and let "subs" be of the form
5637 * and "aff" of the form
5643 * (a f + d g')/(m d)
5645 * where g' is the result of plugging in "subs" in each of the integer
5648 __isl_give isl_aff
*isl_aff_substitute(__isl_take isl_aff
*aff
,
5649 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
5655 aff
= isl_aff_cow(aff
);
5657 return isl_aff_free(aff
);
5659 ctx
= isl_aff_get_ctx(aff
);
5660 if (!isl_space_is_equal(aff
->ls
->dim
, subs
->ls
->dim
))
5661 isl_die(ctx
, isl_error_invalid
,
5662 "spaces don't match", return isl_aff_free(aff
));
5663 n_div
= isl_aff_domain_dim(subs
, isl_dim_div
);
5665 return isl_aff_free(aff
);
5667 isl_die(ctx
, isl_error_unsupported
,
5668 "cannot handle divs yet", return isl_aff_free(aff
));
5670 aff
->ls
= isl_local_space_substitute(aff
->ls
, type
, pos
, subs
);
5672 return isl_aff_free(aff
);
5674 aff
->v
= isl_vec_cow(aff
->v
);
5676 return isl_aff_free(aff
);
5678 pos
+= isl_local_space_offset(aff
->ls
, type
);
5681 isl_seq_substitute(aff
->v
->el
, pos
, subs
->v
->el
,
5682 aff
->v
->size
, subs
->v
->size
, v
);
5688 /* Plug in "subs" for dimension "type", "pos" in each of the affine
5689 * expressions in "maff".
5691 __isl_give isl_multi_aff
*isl_multi_aff_substitute(
5692 __isl_take isl_multi_aff
*maff
, enum isl_dim_type type
, unsigned pos
,
5693 __isl_keep isl_aff
*subs
)
5698 n
= isl_multi_aff_size(maff
);
5700 return isl_multi_aff_free(maff
);
5702 if (type
== isl_dim_in
)
5705 for (i
= 0; i
< n
; ++i
) {
5708 aff
= isl_multi_aff_take_at(maff
, i
);
5709 aff
= isl_aff_substitute(aff
, type
, pos
, subs
);
5710 maff
= isl_multi_aff_restore_at(maff
, i
, aff
);
5716 /* Plug in "subs" for input dimension "pos" of "pma".
5718 * pma is of the form
5722 * while subs is of the form
5724 * v' = B_j(v) -> S_j
5726 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
5727 * has a contribution in the result, in particular
5729 * C_ij(S_j) -> M_i(S_j)
5731 * Note that plugging in S_j in C_ij may also result in an empty set
5732 * and this contribution should simply be discarded.
5734 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_substitute(
5735 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
5736 __isl_keep isl_pw_aff
*subs
)
5739 isl_pw_multi_aff
*res
;
5742 return isl_pw_multi_aff_free(pma
);
5744 n
= pma
->n
* subs
->n
;
5745 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma
->dim
), n
);
5747 for (i
= 0; i
< pma
->n
; ++i
) {
5748 for (j
= 0; j
< subs
->n
; ++j
) {
5750 isl_multi_aff
*res_ij
;
5753 common
= isl_set_intersect(
5754 isl_set_copy(pma
->p
[i
].set
),
5755 isl_set_copy(subs
->p
[j
].set
));
5756 common
= isl_set_substitute(common
,
5757 pos
, subs
->p
[j
].aff
);
5758 empty
= isl_set_plain_is_empty(common
);
5759 if (empty
< 0 || empty
) {
5760 isl_set_free(common
);
5766 res_ij
= isl_multi_aff_substitute(
5767 isl_multi_aff_copy(pma
->p
[i
].maff
),
5768 isl_dim_in
, pos
, subs
->p
[j
].aff
);
5770 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5774 isl_pw_multi_aff_free(pma
);
5777 isl_pw_multi_aff_free(pma
);
5778 isl_pw_multi_aff_free(res
);
5782 /* Compute the preimage of a range of dimensions in the affine expression "src"
5783 * under "ma" and put the result in "dst". The number of dimensions in "src"
5784 * that precede the range is given by "n_before". The number of dimensions
5785 * in the range is given by the number of output dimensions of "ma".
5786 * The number of dimensions that follow the range is given by "n_after".
5787 * If "has_denom" is set (to one),
5788 * then "src" and "dst" have an extra initial denominator.
5789 * "n_div_ma" is the number of existentials in "ma"
5790 * "n_div_bset" is the number of existentials in "src"
5791 * The resulting "dst" (which is assumed to have been allocated by
5792 * the caller) contains coefficients for both sets of existentials,
5793 * first those in "ma" and then those in "src".
5794 * f, c1, c2 and g are temporary objects that have been initialized
5797 * Let src represent the expression
5799 * (a(p) + f_u u + b v + f_w w + c(divs))/d
5801 * and let ma represent the expressions
5803 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
5805 * We start out with the following expression for dst:
5807 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
5809 * with the multiplication factor f initially equal to 1
5810 * and f \sum_i b_i v_i kept separately.
5811 * For each x_i that we substitute, we multiply the numerator
5812 * (and denominator) of dst by c_1 = m_i and add the numerator
5813 * of the x_i expression multiplied by c_2 = f b_i,
5814 * after removing the common factors of c_1 and c_2.
5815 * The multiplication factor f also needs to be multiplied by c_1
5816 * for the next x_j, j > i.
5818 isl_stat
isl_seq_preimage(isl_int
*dst
, isl_int
*src
,
5819 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
,
5820 int n_div_ma
, int n_div_bmap
,
5821 isl_int f
, isl_int c1
, isl_int c2
, isl_int g
, int has_denom
)
5824 isl_size n_param
, n_in
, n_out
;
5827 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
5828 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
5829 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
5830 if (n_param
< 0 || n_in
< 0 || n_out
< 0)
5831 return isl_stat_error
;
5833 isl_seq_cpy(dst
, src
, has_denom
+ 1 + n_param
+ n_before
);
5834 o_dst
= o_src
= has_denom
+ 1 + n_param
+ n_before
;
5835 isl_seq_clr(dst
+ o_dst
, n_in
);
5838 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_after
);
5841 isl_seq_clr(dst
+ o_dst
, n_div_ma
);
5843 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_div_bmap
);
5845 isl_int_set_si(f
, 1);
5847 for (i
= 0; i
< n_out
; ++i
) {
5848 int offset
= has_denom
+ 1 + n_param
+ n_before
+ i
;
5850 if (isl_int_is_zero(src
[offset
]))
5852 isl_int_set(c1
, ma
->u
.p
[i
]->v
->el
[0]);
5853 isl_int_mul(c2
, f
, src
[offset
]);
5854 isl_int_gcd(g
, c1
, c2
);
5855 isl_int_divexact(c1
, c1
, g
);
5856 isl_int_divexact(c2
, c2
, g
);
5858 isl_int_mul(f
, f
, c1
);
5861 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5862 c2
, ma
->u
.p
[i
]->v
->el
+ o_src
, 1 + n_param
);
5863 o_dst
+= 1 + n_param
;
5864 o_src
+= 1 + n_param
;
5865 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_before
);
5867 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5868 c2
, ma
->u
.p
[i
]->v
->el
+ o_src
, n_in
);
5871 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_after
);
5873 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5874 c2
, ma
->u
.p
[i
]->v
->el
+ o_src
, n_div_ma
);
5877 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_div_bmap
);
5879 isl_int_mul(dst
[0], dst
[0], c1
);
5885 /* Compute the pullback of "aff" by the function represented by "ma".
5886 * In other words, plug in "ma" in "aff". The result is an affine expression
5887 * defined over the domain space of "ma".
5889 * If "aff" is represented by
5891 * (a(p) + b x + c(divs))/d
5893 * and ma is represented by
5895 * x = D(p) + F(y) + G(divs')
5897 * then the result is
5899 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
5901 * The divs in the local space of the input are similarly adjusted
5902 * through a call to isl_local_space_preimage_multi_aff.
5904 __isl_give isl_aff
*isl_aff_pullback_multi_aff(__isl_take isl_aff
*aff
,
5905 __isl_take isl_multi_aff
*ma
)
5907 isl_aff
*res
= NULL
;
5908 isl_local_space
*ls
;
5909 isl_size n_div_aff
, n_div_ma
;
5910 isl_int f
, c1
, c2
, g
;
5912 ma
= isl_multi_aff_align_divs(ma
);
5916 n_div_aff
= isl_aff_dim(aff
, isl_dim_div
);
5917 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
5918 if (n_div_aff
< 0 || n_div_ma
< 0)
5921 ls
= isl_aff_get_domain_local_space(aff
);
5922 ls
= isl_local_space_preimage_multi_aff(ls
, isl_multi_aff_copy(ma
));
5923 res
= isl_aff_alloc(ls
);
5932 if (isl_seq_preimage(res
->v
->el
, aff
->v
->el
, ma
, 0, 0,
5933 n_div_ma
, n_div_aff
, f
, c1
, c2
, g
, 1) < 0)
5934 res
= isl_aff_free(res
);
5942 isl_multi_aff_free(ma
);
5943 res
= isl_aff_normalize(res
);
5947 isl_multi_aff_free(ma
);
5952 /* Compute the pullback of "aff1" by the function represented by "aff2".
5953 * In other words, plug in "aff2" in "aff1". The result is an affine expression
5954 * defined over the domain space of "aff1".
5956 * The domain of "aff1" should match the range of "aff2", which means
5957 * that it should be single-dimensional.
5959 __isl_give isl_aff
*isl_aff_pullback_aff(__isl_take isl_aff
*aff1
,
5960 __isl_take isl_aff
*aff2
)
5964 ma
= isl_multi_aff_from_aff(aff2
);
5965 return isl_aff_pullback_multi_aff(aff1
, ma
);
5968 /* Compute the pullback of "ma1" by the function represented by "ma2".
5969 * In other words, plug in "ma2" in "ma1".
5971 __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff(
5972 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5976 isl_space
*space
= NULL
;
5978 isl_multi_aff_align_params_bin(&ma1
, &ma2
);
5979 ma2
= isl_multi_aff_align_divs(ma2
);
5980 n
= isl_multi_aff_size(ma1
);
5984 space
= isl_space_join(isl_multi_aff_get_space(ma2
),
5985 isl_multi_aff_get_space(ma1
));
5987 for (i
= 0; i
< n
; ++i
) {
5990 aff
= isl_multi_aff_take_at(ma1
, i
);
5991 aff
= isl_aff_pullback_multi_aff(aff
, isl_multi_aff_copy(ma2
));
5992 ma1
= isl_multi_aff_restore_at(ma1
, i
, aff
);
5995 ma1
= isl_multi_aff_reset_space(ma1
, space
);
5996 isl_multi_aff_free(ma2
);
5999 isl_space_free(space
);
6000 isl_multi_aff_free(ma2
);
6001 isl_multi_aff_free(ma1
);
6005 /* Extend the local space of "dst" to include the divs
6006 * in the local space of "src".
6008 * If "src" does not have any divs or if the local spaces of "dst" and
6009 * "src" are the same, then no extension is required.
6011 __isl_give isl_aff
*isl_aff_align_divs(__isl_take isl_aff
*dst
,
6012 __isl_keep isl_aff
*src
)
6015 isl_size src_n_div
, dst_n_div
;
6022 return isl_aff_free(dst
);
6024 ctx
= isl_aff_get_ctx(src
);
6025 equal
= isl_local_space_has_equal_space(src
->ls
, dst
->ls
);
6027 return isl_aff_free(dst
);
6029 isl_die(ctx
, isl_error_invalid
,
6030 "spaces don't match", goto error
);
6032 src_n_div
= isl_aff_domain_dim(src
, isl_dim_div
);
6033 dst_n_div
= isl_aff_domain_dim(dst
, isl_dim_div
);
6036 equal
= isl_local_space_is_equal(src
->ls
, dst
->ls
);
6037 if (equal
< 0 || src_n_div
< 0 || dst_n_div
< 0)
6038 return isl_aff_free(dst
);
6042 exp1
= isl_alloc_array(ctx
, int, src_n_div
);
6043 exp2
= isl_alloc_array(ctx
, int, dst_n_div
);
6044 if (!exp1
|| (dst_n_div
&& !exp2
))
6047 div
= isl_merge_divs(src
->ls
->div
, dst
->ls
->div
, exp1
, exp2
);
6048 dst
= isl_aff_expand_divs(dst
, div
, exp2
);
6056 return isl_aff_free(dst
);
6059 /* Adjust the local spaces of the affine expressions in "maff"
6060 * such that they all have the save divs.
6062 __isl_give isl_multi_aff
*isl_multi_aff_align_divs(
6063 __isl_take isl_multi_aff
*maff
)
6069 n
= isl_multi_aff_size(maff
);
6071 return isl_multi_aff_free(maff
);
6075 aff_0
= isl_multi_aff_take_at(maff
, 0);
6076 for (i
= 1; i
< n
; ++i
) {
6079 aff_i
= isl_multi_aff_peek_at(maff
, i
);
6080 aff_0
= isl_aff_align_divs(aff_0
, aff_i
);
6082 maff
= isl_multi_aff_restore_at(maff
, 0, aff_0
);
6084 aff_0
= isl_multi_aff_peek_at(maff
, 0);
6085 for (i
= 1; i
< n
; ++i
) {
6088 aff_i
= isl_multi_aff_take_at(maff
, i
);
6089 aff_i
= isl_aff_align_divs(aff_i
, aff_0
);
6090 maff
= isl_multi_aff_restore_at(maff
, i
, aff_i
);
6096 __isl_give isl_aff
*isl_aff_lift(__isl_take isl_aff
*aff
)
6098 aff
= isl_aff_cow(aff
);
6102 aff
->ls
= isl_local_space_lift(aff
->ls
);
6104 return isl_aff_free(aff
);
6109 /* Lift "maff" to a space with extra dimensions such that the result
6110 * has no more existentially quantified variables.
6111 * If "ls" is not NULL, then *ls is assigned the local space that lies
6112 * at the basis of the lifting applied to "maff".
6114 __isl_give isl_multi_aff
*isl_multi_aff_lift(__isl_take isl_multi_aff
*maff
,
6115 __isl_give isl_local_space
**ls
)
6125 n
= isl_multi_aff_size(maff
);
6127 return isl_multi_aff_free(maff
);
6131 isl_space
*space
= isl_multi_aff_get_domain_space(maff
);
6132 *ls
= isl_local_space_from_space(space
);
6134 return isl_multi_aff_free(maff
);
6139 maff
= isl_multi_aff_align_divs(maff
);
6141 aff
= isl_multi_aff_peek_at(maff
, 0);
6142 n_div
= isl_aff_dim(aff
, isl_dim_div
);
6144 return isl_multi_aff_free(maff
);
6145 space
= isl_multi_aff_get_space(maff
);
6146 space
= isl_space_lift(isl_space_domain(space
), n_div
);
6147 space
= isl_space_extend_domain_with_range(space
,
6148 isl_multi_aff_get_space(maff
));
6149 maff
= isl_multi_aff_restore_space(maff
, space
);
6152 aff
= isl_multi_aff_peek_at(maff
, 0);
6153 *ls
= isl_aff_get_domain_local_space(aff
);
6155 return isl_multi_aff_free(maff
);
6158 for (i
= 0; i
< n
; ++i
) {
6159 aff
= isl_multi_aff_take_at(maff
, i
);
6160 aff
= isl_aff_lift(aff
);
6161 maff
= isl_multi_aff_restore_at(maff
, i
, aff
);
6168 #define TYPE isl_pw_multi_aff
6170 #include "check_type_range_templ.c"
6172 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
6174 __isl_give isl_pw_aff
*isl_pw_multi_aff_get_at(
6175 __isl_keep isl_pw_multi_aff
*pma
, int pos
)
6182 if (isl_pw_multi_aff_check_range(pma
, isl_dim_out
, pos
, 1) < 0)
6185 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
6189 space
= isl_pw_multi_aff_get_space(pma
);
6190 space
= isl_space_drop_dims(space
, isl_dim_out
,
6191 pos
+ 1, n_out
- pos
- 1);
6192 space
= isl_space_drop_dims(space
, isl_dim_out
, 0, pos
);
6194 pa
= isl_pw_aff_alloc_size(space
, pma
->n
);
6195 for (i
= 0; i
< pma
->n
; ++i
) {
6197 aff
= isl_multi_aff_get_aff(pma
->p
[i
].maff
, pos
);
6198 pa
= isl_pw_aff_add_piece(pa
, isl_set_copy(pma
->p
[i
].set
), aff
);
6204 /* This is an alternative name for the function above.
6206 __isl_give isl_pw_aff
*isl_pw_multi_aff_get_pw_aff(
6207 __isl_keep isl_pw_multi_aff
*pma
, int pos
)
6209 return isl_pw_multi_aff_get_at(pma
, pos
);
6212 /* Return an isl_pw_multi_aff with the given "set" as domain and
6213 * an unnamed zero-dimensional range.
6215 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_domain(
6216 __isl_take isl_set
*set
)
6221 space
= isl_set_get_space(set
);
6222 space
= isl_space_from_domain(space
);
6223 ma
= isl_multi_aff_zero(space
);
6224 return isl_pw_multi_aff_alloc(set
, ma
);
6227 /* Add an isl_pw_multi_aff with the given "set" as domain and
6228 * an unnamed zero-dimensional range to *user.
6230 static isl_stat
add_pw_multi_aff_from_domain(__isl_take isl_set
*set
,
6233 isl_union_pw_multi_aff
**upma
= user
;
6234 isl_pw_multi_aff
*pma
;
6236 pma
= isl_pw_multi_aff_from_domain(set
);
6237 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
6242 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
6243 * an unnamed zero-dimensional range.
6245 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_domain(
6246 __isl_take isl_union_set
*uset
)
6249 isl_union_pw_multi_aff
*upma
;
6254 space
= isl_union_set_get_space(uset
);
6255 upma
= isl_union_pw_multi_aff_empty(space
);
6257 if (isl_union_set_foreach_set(uset
,
6258 &add_pw_multi_aff_from_domain
, &upma
) < 0)
6261 isl_union_set_free(uset
);
6264 isl_union_set_free(uset
);
6265 isl_union_pw_multi_aff_free(upma
);
6269 /* Local data for bin_entry and the callback "fn".
6271 struct isl_union_pw_multi_aff_bin_data
{
6272 isl_union_pw_multi_aff
*upma2
;
6273 isl_union_pw_multi_aff
*res
;
6274 isl_pw_multi_aff
*pma
;
6275 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
);
6278 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
6279 * and call data->fn for each isl_pw_multi_aff in data->upma2.
6281 static isl_stat
bin_entry(__isl_take isl_pw_multi_aff
*pma
, void *user
)
6283 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
6287 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma2
,
6289 isl_pw_multi_aff_free(pma
);
6294 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
6295 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
6296 * passed as user field) and the isl_pw_multi_aff from upma2 is available
6297 * as *entry. The callback should adjust data->res if desired.
6299 static __isl_give isl_union_pw_multi_aff
*bin_op(
6300 __isl_take isl_union_pw_multi_aff
*upma1
,
6301 __isl_take isl_union_pw_multi_aff
*upma2
,
6302 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
))
6305 struct isl_union_pw_multi_aff_bin_data data
= { NULL
, NULL
, NULL
, fn
};
6307 space
= isl_union_pw_multi_aff_get_space(upma2
);
6308 upma1
= isl_union_pw_multi_aff_align_params(upma1
, space
);
6309 space
= isl_union_pw_multi_aff_get_space(upma1
);
6310 upma2
= isl_union_pw_multi_aff_align_params(upma2
, space
);
6312 if (!upma1
|| !upma2
)
6316 data
.res
= isl_union_pw_multi_aff_alloc_same_size(upma1
);
6317 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma1
,
6318 &bin_entry
, &data
) < 0)
6321 isl_union_pw_multi_aff_free(upma1
);
6322 isl_union_pw_multi_aff_free(upma2
);
6325 isl_union_pw_multi_aff_free(upma1
);
6326 isl_union_pw_multi_aff_free(upma2
);
6327 isl_union_pw_multi_aff_free(data
.res
);
6331 /* Given two isl_pw_multi_affs A -> B and C -> D,
6332 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
6334 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_product(
6335 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
6339 isl_pw_multi_aff_align_params_bin(&pma1
, &pma2
);
6340 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
6341 isl_pw_multi_aff_get_space(pma2
));
6342 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
6343 &isl_multi_aff_range_product
);
6346 /* Given two isl_pw_multi_affs A -> B and C -> D,
6347 * construct an isl_pw_multi_aff (A * C) -> (B, D).
6349 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_flat_range_product(
6350 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
6354 isl_pw_multi_aff_align_params_bin(&pma1
, &pma2
);
6355 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
6356 isl_pw_multi_aff_get_space(pma2
));
6357 space
= isl_space_flatten_range(space
);
6358 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
6359 &isl_multi_aff_flat_range_product
);
6362 /* If data->pma and "pma2" have the same domain space, then use "range_product"
6363 * to compute some form of range product and add the result to data->res.
6365 static isl_stat
gen_range_product_entry(__isl_take isl_pw_multi_aff
*pma2
,
6366 __isl_give isl_pw_multi_aff
*(*range_product
)(
6367 __isl_take isl_pw_multi_aff
*pma1
,
6368 __isl_take isl_pw_multi_aff
*pma2
),
6371 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
6373 isl_space
*space1
, *space2
;
6375 space1
= isl_pw_multi_aff_peek_space(data
->pma
);
6376 space2
= isl_pw_multi_aff_peek_space(pma2
);
6377 match
= isl_space_tuple_is_equal(space1
, isl_dim_in
,
6378 space2
, isl_dim_in
);
6379 if (match
< 0 || !match
) {
6380 isl_pw_multi_aff_free(pma2
);
6381 return match
< 0 ? isl_stat_error
: isl_stat_ok
;
6384 pma2
= range_product(isl_pw_multi_aff_copy(data
->pma
), pma2
);
6386 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
6391 /* If data->pma and "pma2" have the same domain space, then compute
6392 * their flat range product and add the result to data->res.
6394 static isl_stat
flat_range_product_entry(__isl_take isl_pw_multi_aff
*pma2
,
6397 return gen_range_product_entry(pma2
,
6398 &isl_pw_multi_aff_flat_range_product
, user
);
6401 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
6402 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
6404 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_flat_range_product(
6405 __isl_take isl_union_pw_multi_aff
*upma1
,
6406 __isl_take isl_union_pw_multi_aff
*upma2
)
6408 return bin_op(upma1
, upma2
, &flat_range_product_entry
);
6411 /* If data->pma and "pma2" have the same domain space, then compute
6412 * their range product and add the result to data->res.
6414 static isl_stat
range_product_entry(__isl_take isl_pw_multi_aff
*pma2
,
6417 return gen_range_product_entry(pma2
,
6418 &isl_pw_multi_aff_range_product
, user
);
6421 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
6422 * construct an isl_union_pw_multi_aff (A * C) -> [B -> D].
6424 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_range_product(
6425 __isl_take isl_union_pw_multi_aff
*upma1
,
6426 __isl_take isl_union_pw_multi_aff
*upma2
)
6428 return bin_op(upma1
, upma2
, &range_product_entry
);
6431 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6432 * The parameters are assumed to have been aligned.
6434 * The implementation essentially performs an isl_pw_*_on_shared_domain,
6435 * except that it works on two different isl_pw_* types.
6437 static __isl_give isl_pw_multi_aff
*pw_multi_aff_set_pw_aff(
6438 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6439 __isl_take isl_pw_aff
*pa
)
6442 isl_pw_multi_aff
*res
= NULL
;
6447 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_in
,
6448 pa
->dim
, isl_dim_in
))
6449 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6450 "domains don't match", goto error
);
6451 if (isl_pw_multi_aff_check_range(pma
, isl_dim_out
, pos
, 1) < 0)
6455 res
= isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma
), n
);
6457 for (i
= 0; i
< pma
->n
; ++i
) {
6458 for (j
= 0; j
< pa
->n
; ++j
) {
6460 isl_multi_aff
*res_ij
;
6463 common
= isl_set_intersect(isl_set_copy(pma
->p
[i
].set
),
6464 isl_set_copy(pa
->p
[j
].set
));
6465 empty
= isl_set_plain_is_empty(common
);
6466 if (empty
< 0 || empty
) {
6467 isl_set_free(common
);
6473 res_ij
= isl_multi_aff_set_aff(
6474 isl_multi_aff_copy(pma
->p
[i
].maff
), pos
,
6475 isl_aff_copy(pa
->p
[j
].aff
));
6476 res_ij
= isl_multi_aff_gist(res_ij
,
6477 isl_set_copy(common
));
6479 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
6483 isl_pw_multi_aff_free(pma
);
6484 isl_pw_aff_free(pa
);
6487 isl_pw_multi_aff_free(pma
);
6488 isl_pw_aff_free(pa
);
6489 return isl_pw_multi_aff_free(res
);
6492 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6494 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_set_pw_aff(
6495 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6496 __isl_take isl_pw_aff
*pa
)
6498 isl_bool equal_params
;
6502 equal_params
= isl_space_has_equal_params(pma
->dim
, pa
->dim
);
6503 if (equal_params
< 0)
6506 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6507 if (isl_pw_multi_aff_check_named_params(pma
) < 0 ||
6508 isl_pw_aff_check_named_params(pa
) < 0)
6510 pma
= isl_pw_multi_aff_align_params(pma
, isl_pw_aff_get_space(pa
));
6511 pa
= isl_pw_aff_align_params(pa
, isl_pw_multi_aff_get_space(pma
));
6512 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6514 isl_pw_multi_aff_free(pma
);
6515 isl_pw_aff_free(pa
);
6519 /* Do the parameters of "pa" match those of "space"?
6521 isl_bool
isl_pw_aff_matching_params(__isl_keep isl_pw_aff
*pa
,
6522 __isl_keep isl_space
*space
)
6524 isl_space
*pa_space
;
6528 return isl_bool_error
;
6530 pa_space
= isl_pw_aff_get_space(pa
);
6532 match
= isl_space_has_equal_params(space
, pa_space
);
6534 isl_space_free(pa_space
);
6538 /* Check that the domain space of "pa" matches "space".
6540 isl_stat
isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff
*pa
,
6541 __isl_keep isl_space
*space
)
6543 isl_space
*pa_space
;
6547 return isl_stat_error
;
6549 pa_space
= isl_pw_aff_get_space(pa
);
6551 match
= isl_space_has_equal_params(space
, pa_space
);
6555 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6556 "parameters don't match", goto error
);
6557 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
6558 pa_space
, isl_dim_in
);
6562 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6563 "domains don't match", goto error
);
6564 isl_space_free(pa_space
);
6567 isl_space_free(pa_space
);
6568 return isl_stat_error
;
6576 #include <isl_multi_explicit_domain.c>
6577 #include <isl_multi_pw_aff_explicit_domain.c>
6578 #include <isl_multi_templ.c>
6579 #include <isl_multi_un_op_templ.c>
6580 #include <isl_multi_bin_val_templ.c>
6581 #include <isl_multi_add_constant_templ.c>
6582 #include <isl_multi_apply_set.c>
6583 #include <isl_multi_arith_templ.c>
6584 #include <isl_multi_bind_templ.c>
6585 #include <isl_multi_bind_domain_templ.c>
6586 #include <isl_multi_coalesce.c>
6587 #include <isl_multi_domain_templ.c>
6588 #include <isl_multi_dim_id_templ.c>
6589 #include <isl_multi_dims.c>
6590 #include <isl_multi_from_base_templ.c>
6591 #include <isl_multi_gist.c>
6592 #include <isl_multi_hash.c>
6593 #include <isl_multi_identity_templ.c>
6594 #include <isl_multi_align_set.c>
6595 #include <isl_multi_insert_domain_templ.c>
6596 #include <isl_multi_intersect.c>
6597 #include <isl_multi_min_max_templ.c>
6598 #include <isl_multi_move_dims_templ.c>
6599 #include <isl_multi_nan_templ.c>
6600 #include <isl_multi_param_templ.c>
6601 #include <isl_multi_product_templ.c>
6602 #include <isl_multi_splice_templ.c>
6603 #include <isl_multi_tuple_id_templ.c>
6604 #include <isl_multi_union_add_templ.c>
6605 #include <isl_multi_zero_templ.c>
6606 #include <isl_multi_unbind_params_templ.c>
6608 /* Is every element of "mpa" defined over a single universe domain?
6610 isl_bool
isl_multi_pw_aff_isa_multi_aff(__isl_keep isl_multi_pw_aff
*mpa
)
6612 return isl_multi_pw_aff_every(mpa
, &isl_pw_aff_isa_aff
);
6615 /* Given that every element of "mpa" is defined over a single universe domain,
6616 * return the corresponding base expressions.
6618 __isl_give isl_multi_aff
*isl_multi_pw_aff_as_multi_aff(
6619 __isl_take isl_multi_pw_aff
*mpa
)
6625 n
= isl_multi_pw_aff_size(mpa
);
6627 mpa
= isl_multi_pw_aff_free(mpa
);
6628 ma
= isl_multi_aff_alloc(isl_multi_pw_aff_get_space(mpa
));
6629 for (i
= 0; i
< n
; ++i
) {
6632 aff
= isl_pw_aff_as_aff(isl_multi_pw_aff_get_at(mpa
, i
));
6633 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
6635 isl_multi_pw_aff_free(mpa
);
6639 /* If "mpa" has an explicit domain, then intersect the domain of "map"
6640 * with this explicit domain.
6642 __isl_give isl_map
*isl_map_intersect_multi_pw_aff_explicit_domain(
6643 __isl_take isl_map
*map
, __isl_keep isl_multi_pw_aff
*mpa
)
6647 if (!isl_multi_pw_aff_has_explicit_domain(mpa
))
6650 dom
= isl_multi_pw_aff_domain(isl_multi_pw_aff_copy(mpa
));
6651 map
= isl_map_intersect_domain(map
, dom
);
6656 /* Are all elements of "mpa" piecewise constants?
6658 isl_bool
isl_multi_pw_aff_is_cst(__isl_keep isl_multi_pw_aff
*mpa
)
6660 return isl_multi_pw_aff_every(mpa
, &isl_pw_aff_is_cst
);
6663 /* Does "mpa" have a non-trivial explicit domain?
6665 * The explicit domain, if present, is trivial if it represents
6666 * an (obviously) universe set.
6668 isl_bool
isl_multi_pw_aff_has_non_trivial_domain(
6669 __isl_keep isl_multi_pw_aff
*mpa
)
6672 return isl_bool_error
;
6673 if (!isl_multi_pw_aff_has_explicit_domain(mpa
))
6674 return isl_bool_false
;
6675 return isl_bool_not(isl_set_plain_is_universe(mpa
->u
.dom
));
6681 #include "isl_opt_mpa_templ.c"
6683 /* Compute the minima of the set dimensions as a function of the
6684 * parameters, but independently of the other set dimensions.
6686 __isl_give isl_multi_pw_aff
*isl_set_min_multi_pw_aff(__isl_take isl_set
*set
)
6688 return set_opt_mpa(set
, &isl_set_dim_min
);
6691 /* Compute the maxima of the set dimensions as a function of the
6692 * parameters, but independently of the other set dimensions.
6694 __isl_give isl_multi_pw_aff
*isl_set_max_multi_pw_aff(__isl_take isl_set
*set
)
6696 return set_opt_mpa(set
, &isl_set_dim_max
);
6702 #include "isl_opt_mpa_templ.c"
6704 /* Compute the minima of the output dimensions as a function of the
6705 * parameters and input dimensions, but independently of
6706 * the other output dimensions.
6708 __isl_give isl_multi_pw_aff
*isl_map_min_multi_pw_aff(__isl_take isl_map
*map
)
6710 return map_opt_mpa(map
, &isl_map_dim_min
);
6713 /* Compute the maxima of the output dimensions as a function of the
6714 * parameters and input dimensions, but independently of
6715 * the other output dimensions.
6717 __isl_give isl_multi_pw_aff
*isl_map_max_multi_pw_aff(__isl_take isl_map
*map
)
6719 return map_opt_mpa(map
, &isl_map_dim_max
);
6723 #define TYPE isl_pw_multi_aff
6724 #include "isl_type_check_match_range_multi_val.c"
6726 /* Apply "fn" to the base expressions of "pma" and "mv".
6728 static __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_op_multi_val(
6729 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
,
6730 __isl_give isl_multi_aff
*(*fn
)(__isl_take isl_multi_aff
*ma
,
6731 __isl_take isl_multi_val
*mv
))
6736 if (isl_pw_multi_aff_check_match_range_multi_val(pma
, mv
) < 0)
6739 n
= isl_pw_multi_aff_n_piece(pma
);
6743 for (i
= 0; i
< n
; ++i
) {
6746 ma
= isl_pw_multi_aff_take_base_at(pma
, i
);
6747 ma
= fn(ma
, isl_multi_val_copy(mv
));
6748 pma
= isl_pw_multi_aff_restore_base_at(pma
, i
, ma
);
6751 isl_multi_val_free(mv
);
6754 isl_multi_val_free(mv
);
6755 isl_pw_multi_aff_free(pma
);
6759 /* Scale the elements of "pma" by the corresponding elements of "mv".
6761 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_scale_multi_val(
6762 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
)
6764 return isl_pw_multi_aff_op_multi_val(pma
, mv
,
6765 &isl_multi_aff_scale_multi_val
);
6768 /* Scale the elements of "pma" down by the corresponding elements of "mv".
6770 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_scale_down_multi_val(
6771 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
)
6773 return isl_pw_multi_aff_op_multi_val(pma
, mv
,
6774 &isl_multi_aff_scale_down_multi_val
);
6777 /* This function is called for each entry of an isl_union_pw_multi_aff.
6778 * If the space of the entry matches that of data->mv,
6779 * then apply isl_pw_multi_aff_scale_multi_val and return the result.
6780 * Otherwise, return an empty isl_pw_multi_aff.
6782 static __isl_give isl_pw_multi_aff
*union_pw_multi_aff_scale_multi_val_entry(
6783 __isl_take isl_pw_multi_aff
*pma
, void *user
)
6786 isl_multi_val
*mv
= user
;
6788 equal
= isl_pw_multi_aff_match_range_multi_val(pma
, mv
);
6790 return isl_pw_multi_aff_free(pma
);
6792 isl_space
*space
= isl_pw_multi_aff_get_space(pma
);
6793 isl_pw_multi_aff_free(pma
);
6794 return isl_pw_multi_aff_empty(space
);
6797 return isl_pw_multi_aff_scale_multi_val(pma
, isl_multi_val_copy(mv
));
6800 /* Scale the elements of "upma" by the corresponding elements of "mv",
6801 * for those entries that match the space of "mv".
6803 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_scale_multi_val(
6804 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_multi_val
*mv
)
6806 struct isl_union_pw_multi_aff_transform_control control
= {
6807 .fn
= &union_pw_multi_aff_scale_multi_val_entry
,
6811 upma
= isl_union_pw_multi_aff_align_params(upma
,
6812 isl_multi_val_get_space(mv
));
6813 mv
= isl_multi_val_align_params(mv
,
6814 isl_union_pw_multi_aff_get_space(upma
));
6818 return isl_union_pw_multi_aff_transform(upma
, &control
);
6820 isl_multi_val_free(mv
);
6823 isl_multi_val_free(mv
);
6824 isl_union_pw_multi_aff_free(upma
);
6828 /* Construct and return a piecewise multi affine expression
6829 * in the given space with value zero in each of the output dimensions and
6830 * a universe domain.
6832 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_zero(__isl_take isl_space
*space
)
6834 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space
));
6837 /* Construct and return a piecewise multi affine expression
6838 * that is equal to the given piecewise affine expression.
6840 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_pw_aff(
6841 __isl_take isl_pw_aff
*pa
)
6845 isl_pw_multi_aff
*pma
;
6850 space
= isl_pw_aff_get_space(pa
);
6851 pma
= isl_pw_multi_aff_alloc_size(space
, pa
->n
);
6853 for (i
= 0; i
< pa
->n
; ++i
) {
6857 set
= isl_set_copy(pa
->p
[i
].set
);
6858 ma
= isl_multi_aff_from_aff(isl_aff_copy(pa
->p
[i
].aff
));
6859 pma
= isl_pw_multi_aff_add_piece(pma
, set
, ma
);
6862 isl_pw_aff_free(pa
);
6866 /* Construct and return a piecewise multi affine expression
6867 * that is equal to the given multi piecewise affine expression
6868 * on the shared domain of the piecewise affine expressions,
6869 * in the special case of a 0D multi piecewise affine expression.
6871 * Create a piecewise multi affine expression with the explicit domain of
6872 * the 0D multi piecewise affine expression as domain.
6874 static __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff_0D(
6875 __isl_take isl_multi_pw_aff
*mpa
)
6881 space
= isl_multi_pw_aff_get_space(mpa
);
6882 dom
= isl_multi_pw_aff_get_explicit_domain(mpa
);
6883 isl_multi_pw_aff_free(mpa
);
6885 ma
= isl_multi_aff_zero(space
);
6886 return isl_pw_multi_aff_alloc(dom
, ma
);
6889 /* Construct and return a piecewise multi affine expression
6890 * that is equal to the given multi piecewise affine expression
6891 * on the shared domain of the piecewise affine expressions.
6893 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff(
6894 __isl_take isl_multi_pw_aff
*mpa
)
6899 isl_pw_multi_aff
*pma
;
6905 return isl_pw_multi_aff_from_multi_pw_aff_0D(mpa
);
6907 space
= isl_multi_pw_aff_get_space(mpa
);
6908 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, 0);
6909 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
6911 for (i
= 1; i
< mpa
->n
; ++i
) {
6912 isl_pw_multi_aff
*pma_i
;
6914 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6915 pma_i
= isl_pw_multi_aff_from_pw_aff(pa
);
6916 pma
= isl_pw_multi_aff_range_product(pma
, pma_i
);
6919 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
6921 isl_multi_pw_aff_free(mpa
);
6925 /* Convenience function that constructs an isl_multi_pw_aff
6926 * directly from an isl_aff.
6928 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_aff(__isl_take isl_aff
*aff
)
6930 return isl_multi_pw_aff_from_pw_aff(isl_pw_aff_from_aff(aff
));
6933 /* Construct and return a multi piecewise affine expression
6934 * that is equal to the given multi affine expression.
6936 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_multi_aff(
6937 __isl_take isl_multi_aff
*ma
)
6941 isl_multi_pw_aff
*mpa
;
6943 n
= isl_multi_aff_dim(ma
, isl_dim_out
);
6945 ma
= isl_multi_aff_free(ma
);
6949 mpa
= isl_multi_pw_aff_alloc(isl_multi_aff_get_space(ma
));
6951 for (i
= 0; i
< n
; ++i
) {
6954 pa
= isl_pw_aff_from_aff(isl_multi_aff_get_aff(ma
, i
));
6955 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6958 isl_multi_aff_free(ma
);
6962 /* This function performs the same operation as isl_multi_pw_aff_from_multi_aff,
6963 * but is considered as a function on an isl_multi_aff when exported.
6965 __isl_give isl_multi_pw_aff
*isl_multi_aff_to_multi_pw_aff(
6966 __isl_take isl_multi_aff
*ma
)
6968 return isl_multi_pw_aff_from_multi_aff(ma
);
6971 /* Construct and return a multi piecewise affine expression
6972 * that is equal to the given piecewise multi affine expression.
6974 * If the resulting multi piecewise affine expression has
6975 * an explicit domain, then assign it the domain of the input.
6976 * In other cases, the domain is stored in the individual elements.
6978 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_pw_multi_aff(
6979 __isl_take isl_pw_multi_aff
*pma
)
6984 isl_multi_pw_aff
*mpa
;
6986 n
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
6988 pma
= isl_pw_multi_aff_free(pma
);
6989 space
= isl_pw_multi_aff_get_space(pma
);
6990 mpa
= isl_multi_pw_aff_alloc(space
);
6992 for (i
= 0; i
< n
; ++i
) {
6995 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
6996 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6998 if (isl_multi_pw_aff_has_explicit_domain(mpa
)) {
7001 dom
= isl_pw_multi_aff_domain(isl_pw_multi_aff_copy(pma
));
7002 mpa
= isl_multi_pw_aff_intersect_domain(mpa
, dom
);
7005 isl_pw_multi_aff_free(pma
);
7009 /* This function performs the same operation as
7010 * isl_multi_pw_aff_from_pw_multi_aff,
7011 * but is considered as a function on an isl_pw_multi_aff when exported.
7013 __isl_give isl_multi_pw_aff
*isl_pw_multi_aff_to_multi_pw_aff(
7014 __isl_take isl_pw_multi_aff
*pma
)
7016 return isl_multi_pw_aff_from_pw_multi_aff(pma
);
7019 /* Do "pa1" and "pa2" represent the same function?
7021 * We first check if they are obviously equal.
7022 * If not, we convert them to maps and check if those are equal.
7024 * If "pa1" or "pa2" contain any NaNs, then they are considered
7025 * not to be the same. A NaN is not equal to anything, not even
7028 isl_bool
isl_pw_aff_is_equal(__isl_keep isl_pw_aff
*pa1
,
7029 __isl_keep isl_pw_aff
*pa2
)
7033 isl_map
*map1
, *map2
;
7036 return isl_bool_error
;
7038 equal
= isl_pw_aff_plain_is_equal(pa1
, pa2
);
7039 if (equal
< 0 || equal
)
7041 has_nan
= either_involves_nan(pa1
, pa2
);
7043 return isl_bool_error
;
7045 return isl_bool_false
;
7047 map1
= isl_map_from_pw_aff_internal(isl_pw_aff_copy(pa1
));
7048 map2
= isl_map_from_pw_aff_internal(isl_pw_aff_copy(pa2
));
7049 equal
= isl_map_is_equal(map1
, map2
);
7056 /* Do "mpa1" and "mpa2" represent the same function?
7058 * Note that we cannot convert the entire isl_multi_pw_aff
7059 * to a map because the domains of the piecewise affine expressions
7060 * may not be the same.
7062 isl_bool
isl_multi_pw_aff_is_equal(__isl_keep isl_multi_pw_aff
*mpa1
,
7063 __isl_keep isl_multi_pw_aff
*mpa2
)
7066 isl_bool equal
, equal_params
;
7069 return isl_bool_error
;
7071 equal_params
= isl_space_has_equal_params(mpa1
->space
, mpa2
->space
);
7072 if (equal_params
< 0)
7073 return isl_bool_error
;
7074 if (!equal_params
) {
7075 if (!isl_space_has_named_params(mpa1
->space
))
7076 return isl_bool_false
;
7077 if (!isl_space_has_named_params(mpa2
->space
))
7078 return isl_bool_false
;
7079 mpa1
= isl_multi_pw_aff_copy(mpa1
);
7080 mpa2
= isl_multi_pw_aff_copy(mpa2
);
7081 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
7082 isl_multi_pw_aff_get_space(mpa2
));
7083 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
7084 isl_multi_pw_aff_get_space(mpa1
));
7085 equal
= isl_multi_pw_aff_is_equal(mpa1
, mpa2
);
7086 isl_multi_pw_aff_free(mpa1
);
7087 isl_multi_pw_aff_free(mpa2
);
7091 equal
= isl_space_is_equal(mpa1
->space
, mpa2
->space
);
7092 if (equal
< 0 || !equal
)
7095 for (i
= 0; i
< mpa1
->n
; ++i
) {
7096 equal
= isl_pw_aff_is_equal(mpa1
->u
.p
[i
], mpa2
->u
.p
[i
]);
7097 if (equal
< 0 || !equal
)
7101 return isl_bool_true
;
7104 /* Do "pma1" and "pma2" represent the same function?
7106 * First check if they are obviously equal.
7107 * If not, then convert them to maps and check if those are equal.
7109 * If "pa1" or "pa2" contain any NaNs, then they are considered
7110 * not to be the same. A NaN is not equal to anything, not even
7113 isl_bool
isl_pw_multi_aff_is_equal(__isl_keep isl_pw_multi_aff
*pma1
,
7114 __isl_keep isl_pw_multi_aff
*pma2
)
7118 isl_map
*map1
, *map2
;
7121 return isl_bool_error
;
7123 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
7124 if (equal
< 0 || equal
)
7126 has_nan
= isl_pw_multi_aff_involves_nan(pma1
);
7127 if (has_nan
>= 0 && !has_nan
)
7128 has_nan
= isl_pw_multi_aff_involves_nan(pma2
);
7129 if (has_nan
< 0 || has_nan
)
7130 return isl_bool_not(has_nan
);
7132 map1
= isl_map_from_pw_multi_aff_internal(isl_pw_multi_aff_copy(pma1
));
7133 map2
= isl_map_from_pw_multi_aff_internal(isl_pw_multi_aff_copy(pma2
));
7134 equal
= isl_map_is_equal(map1
, map2
);
7142 #define BASE multi_aff
7144 #include "isl_multi_pw_aff_pullback_templ.c"
7147 #define BASE pw_multi_aff
7149 #include "isl_multi_pw_aff_pullback_templ.c"
7151 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
7152 * with the domain of "aff". The domain of the result is the same
7154 * "mpa" and "aff" are assumed to have been aligned.
7156 * We first extract the parametric constant from "aff", defined
7157 * over the correct domain.
7158 * Then we add the appropriate combinations of the members of "mpa".
7159 * Finally, we add the integer divisions through recursive calls.
7161 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff_aligned(
7162 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
7165 isl_size n_in
, n_div
, n_mpa_in
;
7171 n_in
= isl_aff_dim(aff
, isl_dim_in
);
7172 n_div
= isl_aff_dim(aff
, isl_dim_div
);
7173 n_mpa_in
= isl_multi_pw_aff_dim(mpa
, isl_dim_in
);
7174 if (n_in
< 0 || n_div
< 0 || n_mpa_in
< 0)
7177 space
= isl_space_domain(isl_multi_pw_aff_get_space(mpa
));
7178 tmp
= isl_aff_copy(aff
);
7179 tmp
= isl_aff_drop_dims(tmp
, isl_dim_div
, 0, n_div
);
7180 tmp
= isl_aff_drop_dims(tmp
, isl_dim_in
, 0, n_in
);
7181 tmp
= isl_aff_add_dims(tmp
, isl_dim_in
, n_mpa_in
);
7182 tmp
= isl_aff_reset_domain_space(tmp
, space
);
7183 pa
= isl_pw_aff_from_aff(tmp
);
7185 for (i
= 0; i
< n_in
; ++i
) {
7188 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
7190 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
7191 pa_i
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
7192 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
7193 pa
= isl_pw_aff_add(pa
, pa_i
);
7196 for (i
= 0; i
< n_div
; ++i
) {
7200 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
7202 div
= isl_aff_get_div(aff
, i
);
7203 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
7204 isl_multi_pw_aff_copy(mpa
), div
);
7205 pa_i
= isl_pw_aff_floor(pa_i
);
7206 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
7207 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
7208 pa
= isl_pw_aff_add(pa
, pa_i
);
7211 isl_multi_pw_aff_free(mpa
);
7216 isl_multi_pw_aff_free(mpa
);
7221 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
7222 * with the domain of "aff". The domain of the result is the same
7225 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff(
7226 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
7228 isl_bool equal_params
;
7232 equal_params
= isl_space_has_equal_params(aff
->ls
->dim
, mpa
->space
);
7233 if (equal_params
< 0)
7236 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
7238 aff
= isl_aff_align_params(aff
, isl_multi_pw_aff_get_space(mpa
));
7239 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_aff_get_space(aff
));
7241 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
7244 isl_multi_pw_aff_free(mpa
);
7248 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
7249 * with the domain of "pa". The domain of the result is the same
7251 * "mpa" and "pa" are assumed to have been aligned.
7253 * We consider each piece in turn. Note that the domains of the
7254 * pieces are assumed to be disjoint and they remain disjoint
7255 * after taking the preimage (over the same function).
7257 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff_aligned(
7258 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
7267 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa
),
7268 isl_pw_aff_get_space(pa
));
7269 res
= isl_pw_aff_empty(space
);
7271 for (i
= 0; i
< pa
->n
; ++i
) {
7275 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
7276 isl_multi_pw_aff_copy(mpa
),
7277 isl_aff_copy(pa
->p
[i
].aff
));
7278 domain
= isl_set_copy(pa
->p
[i
].set
);
7279 domain
= isl_set_preimage_multi_pw_aff(domain
,
7280 isl_multi_pw_aff_copy(mpa
));
7281 pa_i
= isl_pw_aff_intersect_domain(pa_i
, domain
);
7282 res
= isl_pw_aff_add_disjoint(res
, pa_i
);
7285 isl_pw_aff_free(pa
);
7286 isl_multi_pw_aff_free(mpa
);
7289 isl_pw_aff_free(pa
);
7290 isl_multi_pw_aff_free(mpa
);
7294 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
7295 * with the domain of "pa". The domain of the result is the same
7298 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff(
7299 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
7301 isl_bool equal_params
;
7305 equal_params
= isl_space_has_equal_params(pa
->dim
, mpa
->space
);
7306 if (equal_params
< 0)
7309 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
7311 pa
= isl_pw_aff_align_params(pa
, isl_multi_pw_aff_get_space(mpa
));
7312 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_pw_aff_get_space(pa
));
7314 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
7316 isl_pw_aff_free(pa
);
7317 isl_multi_pw_aff_free(mpa
);
7321 /* Compute the pullback of "pa" by the function represented by "mpa".
7322 * In other words, plug in "mpa" in "pa".
7324 * The pullback is computed by applying "pa" to "mpa".
7326 __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff(
7327 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
7329 return isl_multi_pw_aff_apply_pw_aff(mpa
, pa
);
7333 #define BASE multi_pw_aff
7335 #include "isl_multi_pw_aff_pullback_templ.c"
7337 /* Align the parameters of "mpa1" and "mpa2", check that the ranges
7338 * of "mpa1" and "mpa2" live in the same space, construct map space
7339 * between the domain spaces of "mpa1" and "mpa2" and call "order"
7340 * with this map space as extract argument.
7342 static __isl_give isl_map
*isl_multi_pw_aff_order_map(
7343 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
7344 __isl_give isl_map
*(*order
)(__isl_keep isl_multi_pw_aff
*mpa1
,
7345 __isl_keep isl_multi_pw_aff
*mpa2
, __isl_take isl_space
*space
))
7348 isl_space
*space1
, *space2
;
7351 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
7352 isl_multi_pw_aff_get_space(mpa2
));
7353 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
7354 isl_multi_pw_aff_get_space(mpa1
));
7357 match
= isl_space_tuple_is_equal(mpa1
->space
, isl_dim_out
,
7358 mpa2
->space
, isl_dim_out
);
7362 isl_die(isl_multi_pw_aff_get_ctx(mpa1
), isl_error_invalid
,
7363 "range spaces don't match", goto error
);
7364 space1
= isl_space_domain(isl_multi_pw_aff_get_space(mpa1
));
7365 space2
= isl_space_domain(isl_multi_pw_aff_get_space(mpa2
));
7366 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
7368 res
= order(mpa1
, mpa2
, space1
);
7369 isl_multi_pw_aff_free(mpa1
);
7370 isl_multi_pw_aff_free(mpa2
);
7373 isl_multi_pw_aff_free(mpa1
);
7374 isl_multi_pw_aff_free(mpa2
);
7378 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7379 * where the function values are equal. "space" is the space of the result.
7380 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7382 * "mpa1" and "mpa2" are equal when each of the pairs of elements
7383 * in the sequences are equal.
7385 static __isl_give isl_map
*isl_multi_pw_aff_eq_map_on_space(
7386 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
7387 __isl_take isl_space
*space
)
7393 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
7395 space
= isl_space_free(space
);
7396 res
= isl_map_universe(space
);
7398 for (i
= 0; i
< n
; ++i
) {
7399 isl_pw_aff
*pa1
, *pa2
;
7402 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
7403 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
7404 map
= isl_pw_aff_eq_map(pa1
, pa2
);
7405 res
= isl_map_intersect(res
, map
);
7411 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7412 * where the function values are equal.
7414 __isl_give isl_map
*isl_multi_pw_aff_eq_map(__isl_take isl_multi_pw_aff
*mpa1
,
7415 __isl_take isl_multi_pw_aff
*mpa2
)
7417 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7418 &isl_multi_pw_aff_eq_map_on_space
);
7421 /* Intersect "map" with the result of applying "order"
7422 * on two copies of "mpa".
7424 static __isl_give isl_map
*isl_map_order_at_multi_pw_aff(
7425 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
,
7426 __isl_give isl_map
*(*order
)(__isl_take isl_multi_pw_aff
*mpa1
,
7427 __isl_take isl_multi_pw_aff
*mpa2
))
7429 return isl_map_intersect(map
, order(mpa
, isl_multi_pw_aff_copy(mpa
)));
7432 /* Return the subset of "map" where the domain and the range
7433 * have equal "mpa" values.
7435 __isl_give isl_map
*isl_map_eq_at_multi_pw_aff(__isl_take isl_map
*map
,
7436 __isl_take isl_multi_pw_aff
*mpa
)
7438 return isl_map_order_at_multi_pw_aff(map
, mpa
,
7439 &isl_multi_pw_aff_eq_map
);
7442 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7443 * where the function values of "mpa1" lexicographically satisfies
7444 * "strict_base"/"base" compared to that of "mpa2".
7445 * "space" is the space of the result.
7446 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7448 * "mpa1" lexicographically satisfies "strict_base"/"base" compared to "mpa2"
7449 * if, for some i, the i-th element of "mpa1" satisfies "strict_base"/"base"
7450 * when compared to the i-th element of "mpa2" while all previous elements are
7452 * In particular, if i corresponds to the final elements
7453 * then they need to satisfy "base", while "strict_base" needs to be satisfied
7454 * for other values of i.
7455 * If "base" is a strict order, then "base" and "strict_base" are the same.
7457 static __isl_give isl_map
*isl_multi_pw_aff_lex_map_on_space(
7458 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
7459 __isl_give isl_map
*(*strict_base
)(__isl_take isl_pw_aff
*pa1
,
7460 __isl_take isl_pw_aff
*pa2
),
7461 __isl_give isl_map
*(*base
)(__isl_take isl_pw_aff
*pa1
,
7462 __isl_take isl_pw_aff
*pa2
),
7463 __isl_take isl_space
*space
)
7467 isl_map
*res
, *rest
;
7469 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
7471 space
= isl_space_free(space
);
7472 res
= isl_map_empty(isl_space_copy(space
));
7473 rest
= isl_map_universe(space
);
7475 for (i
= 0; i
< n
; ++i
) {
7477 isl_pw_aff
*pa1
, *pa2
;
7482 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
7483 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
7484 map
= last
? base(pa1
, pa2
) : strict_base(pa1
, pa2
);
7485 map
= isl_map_intersect(map
, isl_map_copy(rest
));
7486 res
= isl_map_union(res
, map
);
7491 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
7492 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
7493 map
= isl_pw_aff_eq_map(pa1
, pa2
);
7494 rest
= isl_map_intersect(rest
, map
);
7504 #define STRICT_ORDER lt
7505 #include "isl_aff_lex_templ.c"
7510 #define STRICT_ORDER lt
7511 #include "isl_aff_lex_templ.c"
7516 #define STRICT_ORDER gt
7517 #include "isl_aff_lex_templ.c"
7522 #define STRICT_ORDER gt
7523 #include "isl_aff_lex_templ.c"
7525 /* Compare two isl_affs.
7527 * Return -1 if "aff1" is "smaller" than "aff2", 1 if "aff1" is "greater"
7528 * than "aff2" and 0 if they are equal.
7530 * The order is fairly arbitrary. We do consider expressions that only involve
7531 * earlier dimensions as "smaller".
7533 int isl_aff_plain_cmp(__isl_keep isl_aff
*aff1
, __isl_keep isl_aff
*aff2
)
7546 cmp
= isl_local_space_cmp(aff1
->ls
, aff2
->ls
);
7550 last1
= isl_seq_last_non_zero(aff1
->v
->el
+ 1, aff1
->v
->size
- 1);
7551 last2
= isl_seq_last_non_zero(aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
7553 return last1
- last2
;
7555 return isl_seq_cmp(aff1
->v
->el
, aff2
->v
->el
, aff1
->v
->size
);
7558 /* Compare two isl_pw_affs.
7560 * Return -1 if "pa1" is "smaller" than "pa2", 1 if "pa1" is "greater"
7561 * than "pa2" and 0 if they are equal.
7563 * The order is fairly arbitrary. We do consider expressions that only involve
7564 * earlier dimensions as "smaller".
7566 int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff
*pa1
,
7567 __isl_keep isl_pw_aff
*pa2
)
7580 cmp
= isl_space_cmp(pa1
->dim
, pa2
->dim
);
7584 if (pa1
->n
!= pa2
->n
)
7585 return pa1
->n
- pa2
->n
;
7587 for (i
= 0; i
< pa1
->n
; ++i
) {
7588 cmp
= isl_set_plain_cmp(pa1
->p
[i
].set
, pa2
->p
[i
].set
);
7591 cmp
= isl_aff_plain_cmp(pa1
->p
[i
].aff
, pa2
->p
[i
].aff
);
7599 /* Return a piecewise affine expression that is equal to "v" on "domain".
7601 __isl_give isl_pw_aff
*isl_pw_aff_val_on_domain(__isl_take isl_set
*domain
,
7602 __isl_take isl_val
*v
)
7605 isl_local_space
*ls
;
7608 space
= isl_set_get_space(domain
);
7609 ls
= isl_local_space_from_space(space
);
7610 aff
= isl_aff_val_on_domain(ls
, v
);
7612 return isl_pw_aff_alloc(domain
, aff
);
7615 /* Return a piecewise affine expression that is equal to the parameter
7616 * with identifier "id" on "domain".
7618 __isl_give isl_pw_aff
*isl_pw_aff_param_on_domain_id(
7619 __isl_take isl_set
*domain
, __isl_take isl_id
*id
)
7624 space
= isl_set_get_space(domain
);
7625 space
= isl_space_add_param_id(space
, isl_id_copy(id
));
7626 domain
= isl_set_align_params(domain
, isl_space_copy(space
));
7627 aff
= isl_aff_param_on_domain_space_id(space
, id
);
7629 return isl_pw_aff_alloc(domain
, aff
);
7632 /* This function performs the same operation as
7633 * isl_pw_aff_param_on_domain_id,
7634 * but is considered as a function on an isl_set when exported.
7636 __isl_give isl_pw_aff
*isl_set_param_pw_aff_on_domain_id(
7637 __isl_take isl_set
*domain
, __isl_take isl_id
*id
)
7639 return isl_pw_aff_param_on_domain_id(domain
, id
);
7642 /* Return a multi affine expression that is equal to "mv" on domain
7645 __isl_give isl_multi_aff
*isl_multi_aff_multi_val_on_domain_space(
7646 __isl_take isl_space
*space
, __isl_take isl_multi_val
*mv
)
7651 isl_local_space
*ls
;
7654 n
= isl_multi_val_dim(mv
, isl_dim_set
);
7655 if (!space
|| n
< 0)
7658 space2
= isl_multi_val_get_space(mv
);
7659 space2
= isl_space_align_params(space2
, isl_space_copy(space
));
7660 space
= isl_space_align_params(space
, isl_space_copy(space2
));
7661 space
= isl_space_map_from_domain_and_range(space
, space2
);
7662 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
7663 ls
= isl_local_space_from_space(isl_space_domain(space
));
7664 for (i
= 0; i
< n
; ++i
) {
7668 v
= isl_multi_val_get_val(mv
, i
);
7669 aff
= isl_aff_val_on_domain(isl_local_space_copy(ls
), v
);
7670 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
7672 isl_local_space_free(ls
);
7674 isl_multi_val_free(mv
);
7677 isl_space_free(space
);
7678 isl_multi_val_free(mv
);
7682 /* This is an alternative name for the function above.
7684 __isl_give isl_multi_aff
*isl_multi_aff_multi_val_on_space(
7685 __isl_take isl_space
*space
, __isl_take isl_multi_val
*mv
)
7687 return isl_multi_aff_multi_val_on_domain_space(space
, mv
);
7690 /* This function performs the same operation as
7691 * isl_multi_aff_multi_val_on_domain_space,
7692 * but is considered as a function on an isl_space when exported.
7694 __isl_give isl_multi_aff
*isl_space_multi_aff_on_domain_multi_val(
7695 __isl_take isl_space
*space
, __isl_take isl_multi_val
*mv
)
7697 return isl_multi_aff_multi_val_on_domain_space(space
, mv
);
7700 /* Return a piecewise multi-affine expression
7701 * that is equal to "mv" on "domain".
7703 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_multi_val_on_domain(
7704 __isl_take isl_set
*domain
, __isl_take isl_multi_val
*mv
)
7709 space
= isl_set_get_space(domain
);
7710 ma
= isl_multi_aff_multi_val_on_space(space
, mv
);
7712 return isl_pw_multi_aff_alloc(domain
, ma
);
7715 /* This function performs the same operation as
7716 * isl_pw_multi_aff_multi_val_on_domain,
7717 * but is considered as a function on an isl_set when exported.
7719 __isl_give isl_pw_multi_aff
*isl_set_pw_multi_aff_on_domain_multi_val(
7720 __isl_take isl_set
*domain
, __isl_take isl_multi_val
*mv
)
7722 return isl_pw_multi_aff_multi_val_on_domain(domain
, mv
);
7725 /* Internal data structure for isl_union_pw_multi_aff_multi_val_on_domain.
7726 * mv is the value that should be attained on each domain set
7727 * res collects the results
7729 struct isl_union_pw_multi_aff_multi_val_on_domain_data
{
7731 isl_union_pw_multi_aff
*res
;
7734 /* Create an isl_pw_multi_aff equal to data->mv on "domain"
7735 * and add it to data->res.
7737 static isl_stat
pw_multi_aff_multi_val_on_domain(__isl_take isl_set
*domain
,
7740 struct isl_union_pw_multi_aff_multi_val_on_domain_data
*data
= user
;
7741 isl_pw_multi_aff
*pma
;
7744 mv
= isl_multi_val_copy(data
->mv
);
7745 pma
= isl_pw_multi_aff_multi_val_on_domain(domain
, mv
);
7746 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
7748 return data
->res
? isl_stat_ok
: isl_stat_error
;
7751 /* Return a union piecewise multi-affine expression
7752 * that is equal to "mv" on "domain".
7754 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_multi_val_on_domain(
7755 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7757 struct isl_union_pw_multi_aff_multi_val_on_domain_data data
;
7760 space
= isl_union_set_get_space(domain
);
7761 data
.res
= isl_union_pw_multi_aff_empty(space
);
7763 if (isl_union_set_foreach_set(domain
,
7764 &pw_multi_aff_multi_val_on_domain
, &data
) < 0)
7765 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
7766 isl_union_set_free(domain
);
7767 isl_multi_val_free(mv
);
7771 /* Compute the pullback of data->pma by the function represented by "pma2",
7772 * provided the spaces match, and add the results to data->res.
7774 static isl_stat
pullback_entry(__isl_take isl_pw_multi_aff
*pma2
, void *user
)
7776 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
7778 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
7779 pma2
->dim
, isl_dim_out
)) {
7780 isl_pw_multi_aff_free(pma2
);
7784 pma2
= isl_pw_multi_aff_pullback_pw_multi_aff(
7785 isl_pw_multi_aff_copy(data
->pma
), pma2
);
7787 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
7789 return isl_stat_error
;
7794 /* Compute the pullback of "upma1" by the function represented by "upma2".
7796 __isl_give isl_union_pw_multi_aff
*
7797 isl_union_pw_multi_aff_pullback_union_pw_multi_aff(
7798 __isl_take isl_union_pw_multi_aff
*upma1
,
7799 __isl_take isl_union_pw_multi_aff
*upma2
)
7801 return bin_op(upma1
, upma2
, &pullback_entry
);
7804 /* Apply "upma2" to "upma1".
7806 * That is, compute the pullback of "upma2" by "upma1".
7808 __isl_give isl_union_pw_multi_aff
*
7809 isl_union_pw_multi_aff_apply_union_pw_multi_aff(
7810 __isl_take isl_union_pw_multi_aff
*upma1
,
7811 __isl_take isl_union_pw_multi_aff
*upma2
)
7813 return isl_union_pw_multi_aff_pullback_union_pw_multi_aff(upma2
, upma1
);
7817 #define TYPE isl_pw_multi_aff
7819 #include "isl_copy_tuple_id_templ.c"
7821 /* Given a function "pma1" of the form A[B -> C] -> D and
7822 * a function "pma2" of the form E -> B,
7823 * replace the domain of the wrapped relation inside the domain of "pma1"
7824 * by the preimage with respect to "pma2".
7825 * In other words, plug in "pma2" in this nested domain.
7826 * The result is of the form A[E -> C] -> D.
7828 * In particular, extend E -> B to A[E -> C] -> A[B -> C] and
7829 * plug that into "pma1".
7831 __isl_give isl_pw_multi_aff
*
7832 isl_pw_multi_aff_preimage_domain_wrapped_domain_pw_multi_aff(
7833 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
7835 isl_space
*pma1_space
, *pma2_space
;
7837 isl_pw_multi_aff
*id
;
7839 pma1_space
= isl_pw_multi_aff_peek_space(pma1
);
7840 pma2_space
= isl_pw_multi_aff_peek_space(pma2
);
7842 if (isl_space_check_domain_is_wrapping(pma1_space
) < 0)
7844 if (isl_space_check_wrapped_tuple_is_equal(pma1_space
,
7845 isl_dim_in
, isl_dim_in
, pma2_space
, isl_dim_out
) < 0)
7848 space
= isl_space_domain(isl_space_copy(pma1_space
));
7849 space
= isl_space_range(isl_space_unwrap(space
));
7850 id
= isl_pw_multi_aff_identity_on_domain_space(space
);
7851 pma2
= isl_pw_multi_aff_product(pma2
, id
);
7853 pma2
= isl_pw_multi_aff_copy_tuple_id(pma2
, isl_dim_in
,
7854 pma1_space
, isl_dim_in
);
7855 pma2
= isl_pw_multi_aff_copy_tuple_id(pma2
, isl_dim_out
,
7856 pma1_space
, isl_dim_in
);
7858 return isl_pw_multi_aff_pullback_pw_multi_aff(pma1
, pma2
);
7860 isl_pw_multi_aff_free(pma1
);
7861 isl_pw_multi_aff_free(pma2
);
7865 /* If data->pma and "pma2" are such that
7866 * data->pma is of the form A[B -> C] -> D and
7867 * "pma2" is of the form E -> B,
7868 * then replace the domain of the wrapped relation
7869 * inside the domain of data->pma by the preimage with respect to "pma2" and
7870 * add the result to data->res.
7872 static isl_stat
preimage_domain_wrapped_domain_entry(
7873 __isl_take isl_pw_multi_aff
*pma2
, void *user
)
7875 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
7876 isl_space
*pma1_space
, *pma2_space
;
7879 pma1_space
= isl_pw_multi_aff_peek_space(data
->pma
);
7880 pma2_space
= isl_pw_multi_aff_peek_space(pma2
);
7882 match
= isl_space_domain_is_wrapping(pma1_space
);
7883 if (match
>= 0 && match
)
7884 match
= isl_space_wrapped_tuple_is_equal(pma1_space
, isl_dim_in
,
7885 isl_dim_in
, pma2_space
, isl_dim_out
);
7886 if (match
< 0 || !match
) {
7887 isl_pw_multi_aff_free(pma2
);
7888 return match
< 0 ? isl_stat_error
: isl_stat_ok
;
7891 pma2
= isl_pw_multi_aff_preimage_domain_wrapped_domain_pw_multi_aff(
7892 isl_pw_multi_aff_copy(data
->pma
), pma2
);
7894 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
7896 return isl_stat_non_null(data
->res
);
7899 /* For each pair of functions A[B -> C] -> D in "upma1" and
7900 * E -> B in "upma2",
7901 * replace the domain of the wrapped relation inside the domain of the first
7902 * by the preimage with respect to the second and collect the results.
7903 * In other words, plug in the second function in this nested domain.
7904 * The results are of the form A[E -> C] -> D.
7906 __isl_give isl_union_pw_multi_aff
*
7907 isl_union_pw_multi_aff_preimage_domain_wrapped_domain_union_pw_multi_aff(
7908 __isl_take isl_union_pw_multi_aff
*upma1
,
7909 __isl_take isl_union_pw_multi_aff
*upma2
)
7911 return bin_op(upma1
, upma2
, &preimage_domain_wrapped_domain_entry
);
7914 /* Check that the domain space of "upa" matches "space".
7916 * This function is called from isl_multi_union_pw_aff_set_union_pw_aff and
7917 * can in principle never fail since the space "space" is that
7918 * of the isl_multi_union_pw_aff and is a set space such that
7919 * there is no domain space to match.
7921 * We check the parameters and double-check that "space" is
7922 * indeed that of a set.
7924 static isl_stat
isl_union_pw_aff_check_match_domain_space(
7925 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7927 isl_space
*upa_space
;
7931 return isl_stat_error
;
7933 match
= isl_space_is_set(space
);
7935 return isl_stat_error
;
7937 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7938 "expecting set space", return isl_stat_error
);
7940 upa_space
= isl_union_pw_aff_get_space(upa
);
7941 match
= isl_space_has_equal_params(space
, upa_space
);
7945 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7946 "parameters don't match", goto error
);
7948 isl_space_free(upa_space
);
7951 isl_space_free(upa_space
);
7952 return isl_stat_error
;
7955 /* Do the parameters of "upa" match those of "space"?
7957 static isl_bool
isl_union_pw_aff_matching_params(
7958 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7960 isl_space
*upa_space
;
7964 return isl_bool_error
;
7966 upa_space
= isl_union_pw_aff_get_space(upa
);
7968 match
= isl_space_has_equal_params(space
, upa_space
);
7970 isl_space_free(upa_space
);
7974 /* Internal data structure for isl_union_pw_aff_reset_domain_space.
7975 * space represents the new parameters.
7976 * res collects the results.
7978 struct isl_union_pw_aff_reset_params_data
{
7980 isl_union_pw_aff
*res
;
7983 /* Replace the parameters of "pa" by data->space and
7984 * add the result to data->res.
7986 static isl_stat
reset_params(__isl_take isl_pw_aff
*pa
, void *user
)
7988 struct isl_union_pw_aff_reset_params_data
*data
= user
;
7991 space
= isl_pw_aff_get_space(pa
);
7992 space
= isl_space_replace_params(space
, data
->space
);
7993 pa
= isl_pw_aff_reset_space(pa
, space
);
7994 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7996 return data
->res
? isl_stat_ok
: isl_stat_error
;
7999 /* Replace the domain space of "upa" by "space".
8000 * Since a union expression does not have a (single) domain space,
8001 * "space" is necessarily a parameter space.
8003 * Since the order and the names of the parameters determine
8004 * the hash value, we need to create a new hash table.
8006 static __isl_give isl_union_pw_aff
*isl_union_pw_aff_reset_domain_space(
8007 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_space
*space
)
8009 struct isl_union_pw_aff_reset_params_data data
= { space
};
8012 match
= isl_union_pw_aff_matching_params(upa
, space
);
8014 upa
= isl_union_pw_aff_free(upa
);
8016 isl_space_free(space
);
8020 data
.res
= isl_union_pw_aff_empty(isl_space_copy(space
));
8021 if (isl_union_pw_aff_foreach_pw_aff(upa
, &reset_params
, &data
) < 0)
8022 data
.res
= isl_union_pw_aff_free(data
.res
);
8024 isl_union_pw_aff_free(upa
);
8025 isl_space_free(space
);
8029 /* Return the floor of "pa".
8031 static __isl_give isl_pw_aff
*floor_entry(__isl_take isl_pw_aff
*pa
, void *user
)
8033 return isl_pw_aff_floor(pa
);
8036 /* Given f, return floor(f).
8038 __isl_give isl_union_pw_aff
*isl_union_pw_aff_floor(
8039 __isl_take isl_union_pw_aff
*upa
)
8041 return isl_union_pw_aff_transform_inplace(upa
, &floor_entry
, NULL
);
8046 * upa mod m = upa - m * floor(upa/m)
8048 * with m an integer value.
8050 __isl_give isl_union_pw_aff
*isl_union_pw_aff_mod_val(
8051 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_val
*m
)
8053 isl_union_pw_aff
*res
;
8058 if (!isl_val_is_int(m
))
8059 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
8060 "expecting integer modulo", goto error
);
8061 if (!isl_val_is_pos(m
))
8062 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
8063 "expecting positive modulo", goto error
);
8065 res
= isl_union_pw_aff_copy(upa
);
8066 upa
= isl_union_pw_aff_scale_down_val(upa
, isl_val_copy(m
));
8067 upa
= isl_union_pw_aff_floor(upa
);
8068 upa
= isl_union_pw_aff_scale_val(upa
, m
);
8069 res
= isl_union_pw_aff_sub(res
, upa
);
8074 isl_union_pw_aff_free(upa
);
8078 /* Internal data structure for isl_union_pw_multi_aff_get_union_pw_aff.
8079 * pos is the output position that needs to be extracted.
8080 * res collects the results.
8082 struct isl_union_pw_multi_aff_get_union_pw_aff_data
{
8084 isl_union_pw_aff
*res
;
8087 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma"
8088 * (assuming it has such a dimension) and add it to data->res.
8090 static isl_stat
get_union_pw_aff(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8092 struct isl_union_pw_multi_aff_get_union_pw_aff_data
*data
= user
;
8096 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
8098 return isl_stat_error
;
8099 if (data
->pos
>= n_out
) {
8100 isl_pw_multi_aff_free(pma
);
8104 pa
= isl_pw_multi_aff_get_pw_aff(pma
, data
->pos
);
8105 isl_pw_multi_aff_free(pma
);
8107 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
8109 return data
->res
? isl_stat_ok
: isl_stat_error
;
8112 /* Extract an isl_union_pw_aff corresponding to
8113 * output dimension "pos" of "upma".
8115 __isl_give isl_union_pw_aff
*isl_union_pw_multi_aff_get_union_pw_aff(
8116 __isl_keep isl_union_pw_multi_aff
*upma
, int pos
)
8118 struct isl_union_pw_multi_aff_get_union_pw_aff_data data
;
8125 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
8126 "cannot extract at negative position", return NULL
);
8128 space
= isl_union_pw_multi_aff_get_space(upma
);
8129 data
.res
= isl_union_pw_aff_empty(space
);
8131 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
8132 &get_union_pw_aff
, &data
) < 0)
8133 data
.res
= isl_union_pw_aff_free(data
.res
);
8138 /* Return a union piecewise affine expression
8139 * that is equal to "aff" on "domain".
8141 __isl_give isl_union_pw_aff
*isl_union_pw_aff_aff_on_domain(
8142 __isl_take isl_union_set
*domain
, __isl_take isl_aff
*aff
)
8146 pa
= isl_pw_aff_from_aff(aff
);
8147 return isl_union_pw_aff_pw_aff_on_domain(domain
, pa
);
8150 /* Return a union piecewise affine expression
8151 * that is equal to the parameter identified by "id" on "domain".
8153 * Make sure the parameter appears in the space passed to
8154 * isl_aff_param_on_domain_space_id.
8156 __isl_give isl_union_pw_aff
*isl_union_pw_aff_param_on_domain_id(
8157 __isl_take isl_union_set
*domain
, __isl_take isl_id
*id
)
8162 space
= isl_union_set_get_space(domain
);
8163 space
= isl_space_add_param_id(space
, isl_id_copy(id
));
8164 aff
= isl_aff_param_on_domain_space_id(space
, id
);
8165 return isl_union_pw_aff_aff_on_domain(domain
, aff
);
8168 /* Internal data structure for isl_union_pw_aff_pw_aff_on_domain.
8169 * "pa" is the piecewise symbolic value that the resulting isl_union_pw_aff
8171 * "res" collects the results.
8173 struct isl_union_pw_aff_pw_aff_on_domain_data
{
8175 isl_union_pw_aff
*res
;
8178 /* Construct a piecewise affine expression that is equal to data->pa
8179 * on "domain" and add the result to data->res.
8181 static isl_stat
pw_aff_on_domain(__isl_take isl_set
*domain
, void *user
)
8183 struct isl_union_pw_aff_pw_aff_on_domain_data
*data
= user
;
8187 pa
= isl_pw_aff_copy(data
->pa
);
8188 dim
= isl_set_dim(domain
, isl_dim_set
);
8190 pa
= isl_pw_aff_free(pa
);
8191 pa
= isl_pw_aff_from_range(pa
);
8192 pa
= isl_pw_aff_add_dims(pa
, isl_dim_in
, dim
);
8193 pa
= isl_pw_aff_reset_domain_space(pa
, isl_set_get_space(domain
));
8194 pa
= isl_pw_aff_intersect_domain(pa
, domain
);
8195 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
8197 return data
->res
? isl_stat_ok
: isl_stat_error
;
8200 /* Return a union piecewise affine expression
8201 * that is equal to "pa" on "domain", assuming "domain" and "pa"
8202 * have been aligned.
8204 * Construct an isl_pw_aff on each of the sets in "domain" and
8205 * collect the results.
8207 static __isl_give isl_union_pw_aff
*isl_union_pw_aff_pw_aff_on_domain_aligned(
8208 __isl_take isl_union_set
*domain
, __isl_take isl_pw_aff
*pa
)
8210 struct isl_union_pw_aff_pw_aff_on_domain_data data
;
8213 space
= isl_union_set_get_space(domain
);
8214 data
.res
= isl_union_pw_aff_empty(space
);
8216 if (isl_union_set_foreach_set(domain
, &pw_aff_on_domain
, &data
) < 0)
8217 data
.res
= isl_union_pw_aff_free(data
.res
);
8218 isl_union_set_free(domain
);
8219 isl_pw_aff_free(pa
);
8223 /* Return a union piecewise affine expression
8224 * that is equal to "pa" on "domain".
8226 * Check that "pa" is a parametric expression,
8227 * align the parameters if needed and call
8228 * isl_union_pw_aff_pw_aff_on_domain_aligned.
8230 __isl_give isl_union_pw_aff
*isl_union_pw_aff_pw_aff_on_domain(
8231 __isl_take isl_union_set
*domain
, __isl_take isl_pw_aff
*pa
)
8234 isl_bool equal_params
;
8235 isl_space
*domain_space
, *pa_space
;
8237 pa_space
= isl_pw_aff_peek_space(pa
);
8238 is_set
= isl_space_is_set(pa_space
);
8242 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8243 "expecting parametric expression", goto error
);
8245 domain_space
= isl_union_set_get_space(domain
);
8246 pa_space
= isl_pw_aff_get_space(pa
);
8247 equal_params
= isl_space_has_equal_params(domain_space
, pa_space
);
8248 if (equal_params
>= 0 && !equal_params
) {
8251 space
= isl_space_align_params(domain_space
, pa_space
);
8252 pa
= isl_pw_aff_align_params(pa
, isl_space_copy(space
));
8253 domain
= isl_union_set_align_params(domain
, space
);
8255 isl_space_free(domain_space
);
8256 isl_space_free(pa_space
);
8259 if (equal_params
< 0)
8261 return isl_union_pw_aff_pw_aff_on_domain_aligned(domain
, pa
);
8263 isl_union_set_free(domain
);
8264 isl_pw_aff_free(pa
);
8268 /* Internal data structure for isl_union_pw_aff_val_on_domain.
8269 * "v" is the value that the resulting isl_union_pw_aff needs to attain.
8270 * "res" collects the results.
8272 struct isl_union_pw_aff_val_on_domain_data
{
8274 isl_union_pw_aff
*res
;
8277 /* Construct a piecewise affine expression that is equal to data->v
8278 * on "domain" and add the result to data->res.
8280 static isl_stat
pw_aff_val_on_domain(__isl_take isl_set
*domain
, void *user
)
8282 struct isl_union_pw_aff_val_on_domain_data
*data
= user
;
8286 v
= isl_val_copy(data
->v
);
8287 pa
= isl_pw_aff_val_on_domain(domain
, v
);
8288 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
8290 return data
->res
? isl_stat_ok
: isl_stat_error
;
8293 /* Return a union piecewise affine expression
8294 * that is equal to "v" on "domain".
8296 * Construct an isl_pw_aff on each of the sets in "domain" and
8297 * collect the results.
8299 __isl_give isl_union_pw_aff
*isl_union_pw_aff_val_on_domain(
8300 __isl_take isl_union_set
*domain
, __isl_take isl_val
*v
)
8302 struct isl_union_pw_aff_val_on_domain_data data
;
8305 space
= isl_union_set_get_space(domain
);
8306 data
.res
= isl_union_pw_aff_empty(space
);
8308 if (isl_union_set_foreach_set(domain
, &pw_aff_val_on_domain
, &data
) < 0)
8309 data
.res
= isl_union_pw_aff_free(data
.res
);
8310 isl_union_set_free(domain
);
8315 /* Construct a piecewise multi affine expression
8316 * that is equal to "pa" and add it to upma.
8318 static isl_stat
pw_multi_aff_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
,
8321 isl_union_pw_multi_aff
**upma
= user
;
8322 isl_pw_multi_aff
*pma
;
8324 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
8325 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
8327 return *upma
? isl_stat_ok
: isl_stat_error
;
8330 /* Construct and return a union piecewise multi affine expression
8331 * that is equal to the given union piecewise affine expression.
8333 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_pw_aff(
8334 __isl_take isl_union_pw_aff
*upa
)
8337 isl_union_pw_multi_aff
*upma
;
8342 space
= isl_union_pw_aff_get_space(upa
);
8343 upma
= isl_union_pw_multi_aff_empty(space
);
8345 if (isl_union_pw_aff_foreach_pw_aff(upa
,
8346 &pw_multi_aff_from_pw_aff_entry
, &upma
) < 0)
8347 upma
= isl_union_pw_multi_aff_free(upma
);
8349 isl_union_pw_aff_free(upa
);
8353 /* Compute the set of elements in the domain of "pa" where it is zero and
8354 * add this set to "uset".
8356 static isl_stat
zero_union_set(__isl_take isl_pw_aff
*pa
, void *user
)
8358 isl_union_set
**uset
= (isl_union_set
**)user
;
8360 *uset
= isl_union_set_add_set(*uset
, isl_pw_aff_zero_set(pa
));
8362 return *uset
? isl_stat_ok
: isl_stat_error
;
8365 /* Return a union set containing those elements in the domain
8366 * of "upa" where it is zero.
8368 __isl_give isl_union_set
*isl_union_pw_aff_zero_union_set(
8369 __isl_take isl_union_pw_aff
*upa
)
8371 isl_union_set
*zero
;
8373 zero
= isl_union_set_empty(isl_union_pw_aff_get_space(upa
));
8374 if (isl_union_pw_aff_foreach_pw_aff(upa
, &zero_union_set
, &zero
) < 0)
8375 zero
= isl_union_set_free(zero
);
8377 isl_union_pw_aff_free(upa
);
8381 /* Internal data structure for isl_union_pw_aff_bind_id,
8382 * storing the parameter that needs to be bound and
8383 * the accumulated results.
8385 struct isl_bind_id_data
{
8387 isl_union_set
*bound
;
8390 /* Bind the piecewise affine function "pa" to the parameter data->id,
8391 * adding the resulting elements in the domain where the expression
8392 * is equal to the parameter to data->bound.
8394 static isl_stat
bind_id(__isl_take isl_pw_aff
*pa
, void *user
)
8396 struct isl_bind_id_data
*data
= user
;
8399 bound
= isl_pw_aff_bind_id(pa
, isl_id_copy(data
->id
));
8400 data
->bound
= isl_union_set_add_set(data
->bound
, bound
);
8402 return data
->bound
? isl_stat_ok
: isl_stat_error
;
8405 /* Bind the union piecewise affine function "upa" to the parameter "id",
8406 * returning the elements in the domain where the expression
8407 * is equal to the parameter.
8409 __isl_give isl_union_set
*isl_union_pw_aff_bind_id(
8410 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_id
*id
)
8412 struct isl_bind_id_data data
= { id
};
8414 data
.bound
= isl_union_set_empty(isl_union_pw_aff_get_space(upa
));
8415 if (isl_union_pw_aff_foreach_pw_aff(upa
, &bind_id
, &data
) < 0)
8416 data
.bound
= isl_union_set_free(data
.bound
);
8418 isl_union_pw_aff_free(upa
);
8423 /* Internal data structure for isl_union_pw_aff_pullback_union_pw_multi_aff.
8424 * upma is the function that is plugged in.
8425 * pa is the current part of the function in which upma is plugged in.
8426 * res collects the results.
8428 struct isl_union_pw_aff_pullback_upma_data
{
8429 isl_union_pw_multi_aff
*upma
;
8431 isl_union_pw_aff
*res
;
8434 /* Check if "pma" can be plugged into data->pa.
8435 * If so, perform the pullback and add the result to data->res.
8437 static isl_stat
pa_pb_pma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8439 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
8442 if (!isl_space_tuple_is_equal(data
->pa
->dim
, isl_dim_in
,
8443 pma
->dim
, isl_dim_out
)) {
8444 isl_pw_multi_aff_free(pma
);
8448 pa
= isl_pw_aff_copy(data
->pa
);
8449 pa
= isl_pw_aff_pullback_pw_multi_aff(pa
, pma
);
8451 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
8453 return data
->res
? isl_stat_ok
: isl_stat_error
;
8456 /* Check if any of the elements of data->upma can be plugged into pa,
8457 * add if so add the result to data->res.
8459 static isl_stat
upa_pb_upma(__isl_take isl_pw_aff
*pa
, void *user
)
8461 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
8465 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma
,
8467 isl_pw_aff_free(pa
);
8472 /* Compute the pullback of "upa" by the function represented by "upma".
8473 * In other words, plug in "upma" in "upa". The result contains
8474 * expressions defined over the domain space of "upma".
8476 * Run over all pairs of elements in "upa" and "upma", perform
8477 * the pullback when appropriate and collect the results.
8478 * If the hash value were based on the domain space rather than
8479 * the function space, then we could run through all elements
8480 * of "upma" and directly pick out the corresponding element of "upa".
8482 __isl_give isl_union_pw_aff
*isl_union_pw_aff_pullback_union_pw_multi_aff(
8483 __isl_take isl_union_pw_aff
*upa
,
8484 __isl_take isl_union_pw_multi_aff
*upma
)
8486 struct isl_union_pw_aff_pullback_upma_data data
= { NULL
, NULL
};
8489 space
= isl_union_pw_multi_aff_get_space(upma
);
8490 upa
= isl_union_pw_aff_align_params(upa
, space
);
8491 space
= isl_union_pw_aff_get_space(upa
);
8492 upma
= isl_union_pw_multi_aff_align_params(upma
, space
);
8498 data
.res
= isl_union_pw_aff_alloc_same_size(upa
);
8499 if (isl_union_pw_aff_foreach_pw_aff(upa
, &upa_pb_upma
, &data
) < 0)
8500 data
.res
= isl_union_pw_aff_free(data
.res
);
8502 isl_union_pw_aff_free(upa
);
8503 isl_union_pw_multi_aff_free(upma
);
8506 isl_union_pw_aff_free(upa
);
8507 isl_union_pw_multi_aff_free(upma
);
8512 #define BASE union_pw_aff
8514 #define DOMBASE union_set
8516 #include <isl_multi_explicit_domain.c>
8517 #include <isl_multi_union_pw_aff_explicit_domain.c>
8518 #include <isl_multi_templ.c>
8519 #include <isl_multi_un_op_templ.c>
8520 #include <isl_multi_bin_val_templ.c>
8521 #include <isl_multi_apply_set.c>
8522 #include <isl_multi_apply_union_set.c>
8523 #include <isl_multi_arith_templ.c>
8524 #include <isl_multi_bind_templ.c>
8525 #include <isl_multi_coalesce.c>
8526 #include <isl_multi_dim_id_templ.c>
8527 #include <isl_multi_floor.c>
8528 #include <isl_multi_from_base_templ.c>
8529 #include <isl_multi_gist.c>
8530 #include <isl_multi_align_set.c>
8531 #include <isl_multi_align_union_set.c>
8532 #include <isl_multi_intersect.c>
8533 #include <isl_multi_nan_templ.c>
8534 #include <isl_multi_tuple_id_templ.c>
8535 #include <isl_multi_union_add_templ.c>
8536 #include <isl_multi_zero_space_templ.c>
8538 /* Does "mupa" have a non-trivial explicit domain?
8540 * The explicit domain, if present, is trivial if it represents
8541 * an (obviously) universe parameter set.
8543 isl_bool
isl_multi_union_pw_aff_has_non_trivial_domain(
8544 __isl_keep isl_multi_union_pw_aff
*mupa
)
8546 isl_bool is_params
, trivial
;
8550 return isl_bool_error
;
8551 if (!isl_multi_union_pw_aff_has_explicit_domain(mupa
))
8552 return isl_bool_false
;
8553 is_params
= isl_union_set_is_params(mupa
->u
.dom
);
8554 if (is_params
< 0 || !is_params
)
8555 return isl_bool_not(is_params
);
8556 set
= isl_set_from_union_set(isl_union_set_copy(mupa
->u
.dom
));
8557 trivial
= isl_set_plain_is_universe(set
);
8559 return isl_bool_not(trivial
);
8562 /* Construct a multiple union piecewise affine expression
8563 * in the given space with value zero in each of the output dimensions.
8565 * Since there is no canonical zero value for
8566 * a union piecewise affine expression, we can only construct
8567 * a zero-dimensional "zero" value.
8569 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_zero(
8570 __isl_take isl_space
*space
)
8578 params
= isl_space_is_params(space
);
8582 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
8583 "expecting proper set space", goto error
);
8584 if (!isl_space_is_set(space
))
8585 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
8586 "expecting set space", goto error
);
8587 dim
= isl_space_dim(space
, isl_dim_out
);
8591 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
8592 "expecting 0D space", goto error
);
8594 return isl_multi_union_pw_aff_alloc(space
);
8596 isl_space_free(space
);
8600 /* Construct and return a multi union piecewise affine expression
8601 * that is equal to the given multi affine expression.
8603 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_aff(
8604 __isl_take isl_multi_aff
*ma
)
8606 isl_multi_pw_aff
*mpa
;
8608 mpa
= isl_multi_pw_aff_from_multi_aff(ma
);
8609 return isl_multi_union_pw_aff_from_multi_pw_aff(mpa
);
8612 /* This function performs the same operation as
8613 * isl_multi_union_pw_aff_from_multi_aff, but is considered as a function on an
8614 * isl_multi_aff when exported.
8616 __isl_give isl_multi_union_pw_aff
*isl_multi_aff_to_multi_union_pw_aff(
8617 __isl_take isl_multi_aff
*ma
)
8619 return isl_multi_union_pw_aff_from_multi_aff(ma
);
8622 /* Construct and return a multi union piecewise affine expression
8623 * that is equal to the given multi piecewise affine expression.
8625 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_pw_aff(
8626 __isl_take isl_multi_pw_aff
*mpa
)
8631 isl_multi_union_pw_aff
*mupa
;
8633 n
= isl_multi_pw_aff_dim(mpa
, isl_dim_out
);
8635 mpa
= isl_multi_pw_aff_free(mpa
);
8639 space
= isl_multi_pw_aff_get_space(mpa
);
8640 space
= isl_space_range(space
);
8641 mupa
= isl_multi_union_pw_aff_alloc(space
);
8643 for (i
= 0; i
< n
; ++i
) {
8645 isl_union_pw_aff
*upa
;
8647 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
8648 upa
= isl_union_pw_aff_from_pw_aff(pa
);
8649 mupa
= isl_multi_union_pw_aff_restore_check_space(mupa
, i
, upa
);
8652 isl_multi_pw_aff_free(mpa
);
8657 /* Extract the range space of "pma" and assign it to *space.
8658 * If *space has already been set (through a previous call to this function),
8659 * then check that the range space is the same.
8661 static isl_stat
extract_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8663 isl_space
**space
= user
;
8664 isl_space
*pma_space
;
8667 pma_space
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
8668 isl_pw_multi_aff_free(pma
);
8671 return isl_stat_error
;
8677 equal
= isl_space_is_equal(pma_space
, *space
);
8678 isl_space_free(pma_space
);
8681 return isl_stat_error
;
8683 isl_die(isl_space_get_ctx(*space
), isl_error_invalid
,
8684 "range spaces not the same", return isl_stat_error
);
8688 /* Construct and return a multi union piecewise affine expression
8689 * that is equal to the given union piecewise multi affine expression.
8691 * In order to be able to perform the conversion, the input
8692 * needs to be non-empty and may only involve a single range space.
8694 * If the resulting multi union piecewise affine expression has
8695 * an explicit domain, then assign it the domain of the input.
8696 * In other cases, the domain is stored in the individual elements.
8698 __isl_give isl_multi_union_pw_aff
*
8699 isl_multi_union_pw_aff_from_union_pw_multi_aff(
8700 __isl_take isl_union_pw_multi_aff
*upma
)
8702 isl_space
*space
= NULL
;
8703 isl_multi_union_pw_aff
*mupa
;
8707 n
= isl_union_pw_multi_aff_n_pw_multi_aff(upma
);
8711 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
8712 "cannot extract range space from empty input",
8714 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
, &extract_space
,
8721 n
= isl_space_dim(space
, isl_dim_set
);
8723 space
= isl_space_free(space
);
8724 mupa
= isl_multi_union_pw_aff_alloc(space
);
8726 for (i
= 0; i
< n
; ++i
) {
8727 isl_union_pw_aff
*upa
;
8729 upa
= isl_union_pw_multi_aff_get_union_pw_aff(upma
, i
);
8730 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8732 if (isl_multi_union_pw_aff_has_explicit_domain(mupa
)) {
8734 isl_union_pw_multi_aff
*copy
;
8736 copy
= isl_union_pw_multi_aff_copy(upma
);
8737 dom
= isl_union_pw_multi_aff_domain(copy
);
8738 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, dom
);
8741 isl_union_pw_multi_aff_free(upma
);
8744 isl_space_free(space
);
8745 isl_union_pw_multi_aff_free(upma
);
8749 /* This function performs the same operation as
8750 * isl_multi_union_pw_aff_from_union_pw_multi_aff,
8751 * but is considered as a function on an isl_union_pw_multi_aff when exported.
8753 __isl_give isl_multi_union_pw_aff
*
8754 isl_union_pw_multi_aff_as_multi_union_pw_aff(
8755 __isl_take isl_union_pw_multi_aff
*upma
)
8757 return isl_multi_union_pw_aff_from_union_pw_multi_aff(upma
);
8760 /* Try and create an isl_multi_union_pw_aff that is equivalent
8761 * to the given isl_union_map.
8762 * The isl_union_map is required to be single-valued in each space.
8763 * Moreover, it cannot be empty and all range spaces need to be the same.
8764 * Otherwise, an error is produced.
8766 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_union_map(
8767 __isl_take isl_union_map
*umap
)
8769 isl_union_pw_multi_aff
*upma
;
8771 upma
= isl_union_pw_multi_aff_from_union_map(umap
);
8772 return isl_multi_union_pw_aff_from_union_pw_multi_aff(upma
);
8775 /* This function performs the same operation as
8776 * isl_multi_union_pw_aff_from_union_map,
8777 * but is considered as a function on an isl_union_map when exported.
8779 __isl_give isl_multi_union_pw_aff
*isl_union_map_as_multi_union_pw_aff(
8780 __isl_take isl_union_map
*umap
)
8782 return isl_multi_union_pw_aff_from_union_map(umap
);
8785 /* Return a multiple union piecewise affine expression
8786 * that is equal to "mv" on "domain", assuming "domain" and "mv"
8787 * have been aligned.
8789 * If the resulting multi union piecewise affine expression has
8790 * an explicit domain, then assign it the input domain.
8791 * In other cases, the domain is stored in the individual elements.
8793 static __isl_give isl_multi_union_pw_aff
*
8794 isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8795 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8800 isl_multi_union_pw_aff
*mupa
;
8802 n
= isl_multi_val_dim(mv
, isl_dim_set
);
8803 if (!domain
|| n
< 0)
8806 space
= isl_multi_val_get_space(mv
);
8807 mupa
= isl_multi_union_pw_aff_alloc(space
);
8808 for (i
= 0; i
< n
; ++i
) {
8810 isl_union_pw_aff
*upa
;
8812 v
= isl_multi_val_get_val(mv
, i
);
8813 upa
= isl_union_pw_aff_val_on_domain(isl_union_set_copy(domain
),
8815 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8817 if (isl_multi_union_pw_aff_has_explicit_domain(mupa
))
8818 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
,
8819 isl_union_set_copy(domain
));
8821 isl_union_set_free(domain
);
8822 isl_multi_val_free(mv
);
8825 isl_union_set_free(domain
);
8826 isl_multi_val_free(mv
);
8830 /* Return a multiple union piecewise affine expression
8831 * that is equal to "mv" on "domain".
8833 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_val_on_domain(
8834 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8836 isl_bool equal_params
;
8840 equal_params
= isl_space_has_equal_params(domain
->dim
, mv
->space
);
8841 if (equal_params
< 0)
8844 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8846 domain
= isl_union_set_align_params(domain
,
8847 isl_multi_val_get_space(mv
));
8848 mv
= isl_multi_val_align_params(mv
, isl_union_set_get_space(domain
));
8849 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(domain
, mv
);
8851 isl_union_set_free(domain
);
8852 isl_multi_val_free(mv
);
8856 /* Return a multiple union piecewise affine expression
8857 * that is equal to "ma" on "domain".
8859 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_aff_on_domain(
8860 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8862 isl_pw_multi_aff
*pma
;
8864 pma
= isl_pw_multi_aff_from_multi_aff(ma
);
8865 return isl_multi_union_pw_aff_pw_multi_aff_on_domain(domain
, pma
);
8868 /* Return a multiple union piecewise affine expression
8869 * that is equal to "pma" on "domain", assuming "domain" and "pma"
8870 * have been aligned.
8872 * If the resulting multi union piecewise affine expression has
8873 * an explicit domain, then assign it the input domain.
8874 * In other cases, the domain is stored in the individual elements.
8876 static __isl_give isl_multi_union_pw_aff
*
8877 isl_multi_union_pw_aff_pw_multi_aff_on_domain_aligned(
8878 __isl_take isl_union_set
*domain
, __isl_take isl_pw_multi_aff
*pma
)
8883 isl_multi_union_pw_aff
*mupa
;
8885 n
= isl_pw_multi_aff_dim(pma
, isl_dim_set
);
8886 if (!domain
|| n
< 0)
8888 space
= isl_pw_multi_aff_get_space(pma
);
8889 mupa
= isl_multi_union_pw_aff_alloc(space
);
8890 for (i
= 0; i
< n
; ++i
) {
8892 isl_union_pw_aff
*upa
;
8894 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
8895 upa
= isl_union_pw_aff_pw_aff_on_domain(
8896 isl_union_set_copy(domain
), pa
);
8897 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8899 if (isl_multi_union_pw_aff_has_explicit_domain(mupa
))
8900 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
,
8901 isl_union_set_copy(domain
));
8903 isl_union_set_free(domain
);
8904 isl_pw_multi_aff_free(pma
);
8907 isl_union_set_free(domain
);
8908 isl_pw_multi_aff_free(pma
);
8912 /* Return a multiple union piecewise affine expression
8913 * that is equal to "pma" on "domain".
8915 __isl_give isl_multi_union_pw_aff
*
8916 isl_multi_union_pw_aff_pw_multi_aff_on_domain(__isl_take isl_union_set
*domain
,
8917 __isl_take isl_pw_multi_aff
*pma
)
8919 isl_bool equal_params
;
8922 space
= isl_pw_multi_aff_peek_space(pma
);
8923 equal_params
= isl_union_set_space_has_equal_params(domain
, space
);
8924 if (equal_params
< 0)
8927 return isl_multi_union_pw_aff_pw_multi_aff_on_domain_aligned(
8929 domain
= isl_union_set_align_params(domain
,
8930 isl_pw_multi_aff_get_space(pma
));
8931 pma
= isl_pw_multi_aff_align_params(pma
,
8932 isl_union_set_get_space(domain
));
8933 return isl_multi_union_pw_aff_pw_multi_aff_on_domain_aligned(domain
,
8936 isl_union_set_free(domain
);
8937 isl_pw_multi_aff_free(pma
);
8941 /* Return a union set containing those elements in the domains
8942 * of the elements of "mupa" where they are all zero.
8944 * If there are no elements, then simply return the entire domain.
8946 __isl_give isl_union_set
*isl_multi_union_pw_aff_zero_union_set(
8947 __isl_take isl_multi_union_pw_aff
*mupa
)
8951 isl_union_pw_aff
*upa
;
8952 isl_union_set
*zero
;
8954 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8956 mupa
= isl_multi_union_pw_aff_free(mupa
);
8961 return isl_multi_union_pw_aff_domain(mupa
);
8963 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8964 zero
= isl_union_pw_aff_zero_union_set(upa
);
8966 for (i
= 1; i
< n
; ++i
) {
8967 isl_union_set
*zero_i
;
8969 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8970 zero_i
= isl_union_pw_aff_zero_union_set(upa
);
8972 zero
= isl_union_set_intersect(zero
, zero_i
);
8975 isl_multi_union_pw_aff_free(mupa
);
8979 /* Construct a union map mapping the shared domain
8980 * of the union piecewise affine expressions to the range of "mupa"
8981 * in the special case of a 0D multi union piecewise affine expression.
8983 * Construct a map between the explicit domain of "mupa" and
8985 * Note that this assumes that the domain consists of explicit elements.
8987 static __isl_give isl_union_map
*isl_union_map_from_multi_union_pw_aff_0D(
8988 __isl_take isl_multi_union_pw_aff
*mupa
)
8992 isl_union_set
*dom
, *ran
;
8994 space
= isl_multi_union_pw_aff_get_space(mupa
);
8995 dom
= isl_multi_union_pw_aff_domain(mupa
);
8996 ran
= isl_union_set_from_set(isl_set_universe(space
));
8998 is_params
= isl_union_set_is_params(dom
);
9000 dom
= isl_union_set_free(dom
);
9002 isl_die(isl_union_set_get_ctx(dom
), isl_error_invalid
,
9003 "cannot create union map from expression without "
9004 "explicit domain elements",
9005 dom
= isl_union_set_free(dom
));
9007 return isl_union_map_from_domain_and_range(dom
, ran
);
9010 /* Construct a union map mapping the shared domain
9011 * of the union piecewise affine expressions to the range of "mupa"
9012 * with each dimension in the range equated to the
9013 * corresponding union piecewise affine expression.
9015 * If the input is zero-dimensional, then construct a mapping
9016 * from its explicit domain.
9018 __isl_give isl_union_map
*isl_union_map_from_multi_union_pw_aff(
9019 __isl_take isl_multi_union_pw_aff
*mupa
)
9024 isl_union_map
*umap
;
9025 isl_union_pw_aff
*upa
;
9027 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
9029 mupa
= isl_multi_union_pw_aff_free(mupa
);
9034 return isl_union_map_from_multi_union_pw_aff_0D(mupa
);
9036 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
9037 umap
= isl_union_map_from_union_pw_aff(upa
);
9039 for (i
= 1; i
< n
; ++i
) {
9040 isl_union_map
*umap_i
;
9042 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
9043 umap_i
= isl_union_map_from_union_pw_aff(upa
);
9044 umap
= isl_union_map_flat_range_product(umap
, umap_i
);
9047 space
= isl_multi_union_pw_aff_get_space(mupa
);
9048 umap
= isl_union_map_reset_range_space(umap
, space
);
9050 isl_multi_union_pw_aff_free(mupa
);
9054 /* Internal data structure for isl_union_pw_multi_aff_reset_range_space.
9055 * "range" is the space from which to set the range space.
9056 * "res" collects the results.
9058 struct isl_union_pw_multi_aff_reset_range_space_data
{
9060 isl_union_pw_multi_aff
*res
;
9063 /* Replace the range space of "pma" by the range space of data->range and
9064 * add the result to data->res.
9066 static isl_stat
reset_range_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
9068 struct isl_union_pw_multi_aff_reset_range_space_data
*data
= user
;
9071 space
= isl_pw_multi_aff_get_space(pma
);
9072 space
= isl_space_domain(space
);
9073 space
= isl_space_extend_domain_with_range(space
,
9074 isl_space_copy(data
->range
));
9075 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
9076 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
9078 return data
->res
? isl_stat_ok
: isl_stat_error
;
9081 /* Replace the range space of all the piecewise affine expressions in "upma" by
9082 * the range space of "space".
9084 * This assumes that all these expressions have the same output dimension.
9086 * Since the spaces of the expressions change, so do their hash values.
9087 * We therefore need to create a new isl_union_pw_multi_aff.
9088 * Note that the hash value is currently computed based on the entire
9089 * space even though there can only be a single expression with a given
9092 static __isl_give isl_union_pw_multi_aff
*
9093 isl_union_pw_multi_aff_reset_range_space(
9094 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_space
*space
)
9096 struct isl_union_pw_multi_aff_reset_range_space_data data
= { space
};
9097 isl_space
*space_upma
;
9099 space_upma
= isl_union_pw_multi_aff_get_space(upma
);
9100 data
.res
= isl_union_pw_multi_aff_empty(space_upma
);
9101 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
9102 &reset_range_space
, &data
) < 0)
9103 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
9105 isl_space_free(space
);
9106 isl_union_pw_multi_aff_free(upma
);
9110 /* Construct and return a union piecewise multi affine expression
9111 * that is equal to the given multi union piecewise affine expression,
9112 * in the special case of a 0D multi union piecewise affine expression.
9114 * Construct a union piecewise multi affine expression
9115 * on top of the explicit domain of the input.
9117 __isl_give isl_union_pw_multi_aff
*
9118 isl_union_pw_multi_aff_from_multi_union_pw_aff_0D(
9119 __isl_take isl_multi_union_pw_aff
*mupa
)
9123 isl_union_set
*domain
;
9125 space
= isl_multi_union_pw_aff_get_space(mupa
);
9126 mv
= isl_multi_val_zero(space
);
9127 domain
= isl_multi_union_pw_aff_domain(mupa
);
9128 return isl_union_pw_multi_aff_multi_val_on_domain(domain
, mv
);
9131 /* Construct and return a union piecewise multi affine expression
9132 * that is equal to the given multi union piecewise affine expression.
9134 * If the input is zero-dimensional, then
9135 * construct a union piecewise multi affine expression
9136 * on top of the explicit domain of the input.
9138 __isl_give isl_union_pw_multi_aff
*
9139 isl_union_pw_multi_aff_from_multi_union_pw_aff(
9140 __isl_take isl_multi_union_pw_aff
*mupa
)
9145 isl_union_pw_multi_aff
*upma
;
9146 isl_union_pw_aff
*upa
;
9148 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
9150 mupa
= isl_multi_union_pw_aff_free(mupa
);
9155 return isl_union_pw_multi_aff_from_multi_union_pw_aff_0D(mupa
);
9157 space
= isl_multi_union_pw_aff_get_space(mupa
);
9158 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
9159 upma
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
9161 for (i
= 1; i
< n
; ++i
) {
9162 isl_union_pw_multi_aff
*upma_i
;
9164 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
9165 upma_i
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
9166 upma
= isl_union_pw_multi_aff_flat_range_product(upma
, upma_i
);
9169 upma
= isl_union_pw_multi_aff_reset_range_space(upma
, space
);
9171 isl_multi_union_pw_aff_free(mupa
);
9175 /* Intersect the range of "mupa" with "range",
9176 * in the special case where "mupa" is 0D.
9178 * Intersect the domain of "mupa" with the constraints on the parameters
9181 static __isl_give isl_multi_union_pw_aff
*mupa_intersect_range_0D(
9182 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_set
*range
)
9184 range
= isl_set_params(range
);
9185 mupa
= isl_multi_union_pw_aff_intersect_params(mupa
, range
);
9189 /* Intersect the range of "mupa" with "range".
9190 * That is, keep only those domain elements that have a function value
9193 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_intersect_range(
9194 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_set
*range
)
9196 isl_union_pw_multi_aff
*upma
;
9197 isl_union_set
*domain
;
9202 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
9203 if (n
< 0 || !range
)
9206 space
= isl_set_get_space(range
);
9207 match
= isl_space_tuple_is_equal(mupa
->space
, isl_dim_set
,
9208 space
, isl_dim_set
);
9209 isl_space_free(space
);
9213 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
9214 "space don't match", goto error
);
9216 return mupa_intersect_range_0D(mupa
, range
);
9218 upma
= isl_union_pw_multi_aff_from_multi_union_pw_aff(
9219 isl_multi_union_pw_aff_copy(mupa
));
9220 domain
= isl_union_set_from_set(range
);
9221 domain
= isl_union_set_preimage_union_pw_multi_aff(domain
, upma
);
9222 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, domain
);
9226 isl_multi_union_pw_aff_free(mupa
);
9227 isl_set_free(range
);
9231 /* Return the shared domain of the elements of "mupa",
9232 * in the special case where "mupa" is zero-dimensional.
9234 * Return the explicit domain of "mupa".
9235 * Note that this domain may be a parameter set, either
9236 * because "mupa" is meant to live in a set space or
9237 * because no explicit domain has been set.
9239 __isl_give isl_union_set
*isl_multi_union_pw_aff_domain_0D(
9240 __isl_take isl_multi_union_pw_aff
*mupa
)
9244 dom
= isl_multi_union_pw_aff_get_explicit_domain(mupa
);
9245 isl_multi_union_pw_aff_free(mupa
);
9250 /* Return the shared domain of the elements of "mupa".
9252 * If "mupa" is zero-dimensional, then return its explicit domain.
9254 __isl_give isl_union_set
*isl_multi_union_pw_aff_domain(
9255 __isl_take isl_multi_union_pw_aff
*mupa
)
9259 isl_union_pw_aff
*upa
;
9262 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
9264 mupa
= isl_multi_union_pw_aff_free(mupa
);
9269 return isl_multi_union_pw_aff_domain_0D(mupa
);
9271 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
9272 dom
= isl_union_pw_aff_domain(upa
);
9273 for (i
= 1; i
< n
; ++i
) {
9274 isl_union_set
*dom_i
;
9276 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
9277 dom_i
= isl_union_pw_aff_domain(upa
);
9278 dom
= isl_union_set_intersect(dom
, dom_i
);
9281 isl_multi_union_pw_aff_free(mupa
);
9285 /* Apply "aff" to "mupa". The space of "mupa" is equal to the domain of "aff".
9286 * In particular, the spaces have been aligned.
9287 * The result is defined over the shared domain of the elements of "mupa"
9289 * We first extract the parametric constant part of "aff" and
9290 * define that over the shared domain.
9291 * Then we iterate over all input dimensions of "aff" and add the corresponding
9292 * multiples of the elements of "mupa".
9293 * Finally, we consider the integer divisions, calling the function
9294 * recursively to obtain an isl_union_pw_aff corresponding to the
9295 * integer division argument.
9297 static __isl_give isl_union_pw_aff
*multi_union_pw_aff_apply_aff(
9298 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
9301 isl_size n_in
, n_div
;
9302 isl_union_pw_aff
*upa
;
9303 isl_union_set
*uset
;
9307 n_in
= isl_aff_dim(aff
, isl_dim_in
);
9308 n_div
= isl_aff_dim(aff
, isl_dim_div
);
9309 if (n_in
< 0 || n_div
< 0)
9312 uset
= isl_multi_union_pw_aff_domain(isl_multi_union_pw_aff_copy(mupa
));
9313 cst
= isl_aff_copy(aff
);
9314 cst
= isl_aff_drop_dims(cst
, isl_dim_div
, 0, n_div
);
9315 cst
= isl_aff_drop_dims(cst
, isl_dim_in
, 0, n_in
);
9316 cst
= isl_aff_project_domain_on_params(cst
);
9317 upa
= isl_union_pw_aff_aff_on_domain(uset
, cst
);
9319 for (i
= 0; i
< n_in
; ++i
) {
9320 isl_union_pw_aff
*upa_i
;
9322 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
9324 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
9325 upa_i
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
9326 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
9327 upa
= isl_union_pw_aff_add(upa
, upa_i
);
9330 for (i
= 0; i
< n_div
; ++i
) {
9332 isl_union_pw_aff
*upa_i
;
9334 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
9336 div
= isl_aff_get_div(aff
, i
);
9337 upa_i
= multi_union_pw_aff_apply_aff(
9338 isl_multi_union_pw_aff_copy(mupa
), div
);
9339 upa_i
= isl_union_pw_aff_floor(upa_i
);
9340 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
9341 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
9342 upa
= isl_union_pw_aff_add(upa
, upa_i
);
9345 isl_multi_union_pw_aff_free(mupa
);
9350 isl_multi_union_pw_aff_free(mupa
);
9355 /* Apply "aff" to "mupa". The space of "mupa" needs to be compatible
9356 * with the domain of "aff".
9357 * Furthermore, the dimension of this space needs to be greater than zero.
9358 * The result is defined over the shared domain of the elements of "mupa"
9360 * We perform these checks and then hand over control to
9361 * multi_union_pw_aff_apply_aff.
9363 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_aff(
9364 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
9367 isl_space
*space1
, *space2
;
9370 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
9371 isl_aff_get_space(aff
));
9372 aff
= isl_aff_align_params(aff
, isl_multi_union_pw_aff_get_space(mupa
));
9376 space1
= isl_multi_union_pw_aff_get_space(mupa
);
9377 space2
= isl_aff_get_domain_space(aff
);
9378 equal
= isl_space_is_equal(space1
, space2
);
9379 isl_space_free(space1
);
9380 isl_space_free(space2
);
9384 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
9385 "spaces don't match", goto error
);
9386 dim
= isl_aff_dim(aff
, isl_dim_in
);
9390 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
9391 "cannot determine domains", goto error
);
9393 return multi_union_pw_aff_apply_aff(mupa
, aff
);
9395 isl_multi_union_pw_aff_free(mupa
);
9400 /* Apply "ma" to "mupa", in the special case where "mupa" is 0D.
9401 * The space of "mupa" is known to be compatible with the domain of "ma".
9403 * Construct an isl_multi_union_pw_aff that is equal to "ma"
9404 * on the domain of "mupa".
9406 static __isl_give isl_multi_union_pw_aff
*mupa_apply_multi_aff_0D(
9407 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_multi_aff
*ma
)
9411 dom
= isl_multi_union_pw_aff_domain(mupa
);
9412 ma
= isl_multi_aff_project_domain_on_params(ma
);
9414 return isl_multi_union_pw_aff_multi_aff_on_domain(dom
, ma
);
9417 /* Apply "ma" to "mupa". The space of "mupa" needs to be compatible
9418 * with the domain of "ma".
9419 * The result is defined over the shared domain of the elements of "mupa"
9421 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_multi_aff(
9422 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_multi_aff
*ma
)
9424 isl_space
*space1
, *space2
;
9425 isl_multi_union_pw_aff
*res
;
9428 isl_size n_in
, n_out
;
9430 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
9431 isl_multi_aff_get_space(ma
));
9432 ma
= isl_multi_aff_align_params(ma
,
9433 isl_multi_union_pw_aff_get_space(mupa
));
9434 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
9435 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
9436 if (!mupa
|| n_in
< 0 || n_out
< 0)
9439 space1
= isl_multi_union_pw_aff_get_space(mupa
);
9440 space2
= isl_multi_aff_get_domain_space(ma
);
9441 equal
= isl_space_is_equal(space1
, space2
);
9442 isl_space_free(space1
);
9443 isl_space_free(space2
);
9447 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
9448 "spaces don't match", goto error
);
9450 return mupa_apply_multi_aff_0D(mupa
, ma
);
9452 space1
= isl_space_range(isl_multi_aff_get_space(ma
));
9453 res
= isl_multi_union_pw_aff_alloc(space1
);
9455 for (i
= 0; i
< n_out
; ++i
) {
9457 isl_union_pw_aff
*upa
;
9459 aff
= isl_multi_aff_get_aff(ma
, i
);
9460 upa
= multi_union_pw_aff_apply_aff(
9461 isl_multi_union_pw_aff_copy(mupa
), aff
);
9462 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
9465 isl_multi_aff_free(ma
);
9466 isl_multi_union_pw_aff_free(mupa
);
9469 isl_multi_union_pw_aff_free(mupa
);
9470 isl_multi_aff_free(ma
);
9474 /* Apply "pa" to "mupa", in the special case where "mupa" is 0D.
9475 * The space of "mupa" is known to be compatible with the domain of "pa".
9477 * Construct an isl_multi_union_pw_aff that is equal to "pa"
9478 * on the domain of "mupa".
9480 static __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_aff_0D(
9481 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_pw_aff
*pa
)
9485 dom
= isl_multi_union_pw_aff_domain(mupa
);
9486 pa
= isl_pw_aff_project_domain_on_params(pa
);
9488 return isl_union_pw_aff_pw_aff_on_domain(dom
, pa
);
9491 /* Apply "pa" to "mupa". The space of "mupa" needs to be compatible
9492 * with the domain of "pa".
9493 * Furthermore, the dimension of this space needs to be greater than zero.
9494 * The result is defined over the shared domain of the elements of "mupa"
9496 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_aff(
9497 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_pw_aff
*pa
)
9502 isl_space
*space
, *space2
;
9503 isl_union_pw_aff
*upa
;
9505 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
9506 isl_pw_aff_get_space(pa
));
9507 pa
= isl_pw_aff_align_params(pa
,
9508 isl_multi_union_pw_aff_get_space(mupa
));
9512 space
= isl_multi_union_pw_aff_get_space(mupa
);
9513 space2
= isl_pw_aff_get_domain_space(pa
);
9514 equal
= isl_space_is_equal(space
, space2
);
9515 isl_space_free(space
);
9516 isl_space_free(space2
);
9520 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
9521 "spaces don't match", goto error
);
9522 n_in
= isl_pw_aff_dim(pa
, isl_dim_in
);
9526 return isl_multi_union_pw_aff_apply_pw_aff_0D(mupa
, pa
);
9528 space
= isl_space_params(isl_multi_union_pw_aff_get_space(mupa
));
9529 upa
= isl_union_pw_aff_empty(space
);
9531 for (i
= 0; i
< pa
->n
; ++i
) {
9534 isl_multi_union_pw_aff
*mupa_i
;
9535 isl_union_pw_aff
*upa_i
;
9537 mupa_i
= isl_multi_union_pw_aff_copy(mupa
);
9538 domain
= isl_set_copy(pa
->p
[i
].set
);
9539 mupa_i
= isl_multi_union_pw_aff_intersect_range(mupa_i
, domain
);
9540 aff
= isl_aff_copy(pa
->p
[i
].aff
);
9541 upa_i
= multi_union_pw_aff_apply_aff(mupa_i
, aff
);
9542 upa
= isl_union_pw_aff_union_add(upa
, upa_i
);
9545 isl_multi_union_pw_aff_free(mupa
);
9546 isl_pw_aff_free(pa
);
9549 isl_multi_union_pw_aff_free(mupa
);
9550 isl_pw_aff_free(pa
);
9554 /* Apply "pma" to "mupa", in the special case where "mupa" is 0D.
9555 * The space of "mupa" is known to be compatible with the domain of "pma".
9557 * Construct an isl_multi_union_pw_aff that is equal to "pma"
9558 * on the domain of "mupa".
9560 static __isl_give isl_multi_union_pw_aff
*mupa_apply_pw_multi_aff_0D(
9561 __isl_take isl_multi_union_pw_aff
*mupa
,
9562 __isl_take isl_pw_multi_aff
*pma
)
9566 dom
= isl_multi_union_pw_aff_domain(mupa
);
9567 pma
= isl_pw_multi_aff_project_domain_on_params(pma
);
9569 return isl_multi_union_pw_aff_pw_multi_aff_on_domain(dom
, pma
);
9572 /* Apply "pma" to "mupa". The space of "mupa" needs to be compatible
9573 * with the domain of "pma".
9574 * The result is defined over the shared domain of the elements of "mupa"
9576 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_multi_aff(
9577 __isl_take isl_multi_union_pw_aff
*mupa
,
9578 __isl_take isl_pw_multi_aff
*pma
)
9580 isl_space
*space1
, *space2
;
9581 isl_multi_union_pw_aff
*res
;
9584 isl_size n_in
, n_out
;
9586 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
9587 isl_pw_multi_aff_get_space(pma
));
9588 pma
= isl_pw_multi_aff_align_params(pma
,
9589 isl_multi_union_pw_aff_get_space(mupa
));
9593 space1
= isl_multi_union_pw_aff_get_space(mupa
);
9594 space2
= isl_pw_multi_aff_get_domain_space(pma
);
9595 equal
= isl_space_is_equal(space1
, space2
);
9596 isl_space_free(space1
);
9597 isl_space_free(space2
);
9601 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
9602 "spaces don't match", goto error
);
9603 n_in
= isl_pw_multi_aff_dim(pma
, isl_dim_in
);
9604 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
9605 if (n_in
< 0 || n_out
< 0)
9608 return mupa_apply_pw_multi_aff_0D(mupa
, pma
);
9610 space1
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
9611 res
= isl_multi_union_pw_aff_alloc(space1
);
9613 for (i
= 0; i
< n_out
; ++i
) {
9615 isl_union_pw_aff
*upa
;
9617 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
9618 upa
= isl_multi_union_pw_aff_apply_pw_aff(
9619 isl_multi_union_pw_aff_copy(mupa
), pa
);
9620 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
9623 isl_pw_multi_aff_free(pma
);
9624 isl_multi_union_pw_aff_free(mupa
);
9627 isl_multi_union_pw_aff_free(mupa
);
9628 isl_pw_multi_aff_free(pma
);
9632 /* Replace the explicit domain of "mupa" by its preimage under "upma".
9633 * If the explicit domain only keeps track of constraints on the parameters,
9634 * then only update those constraints.
9636 static __isl_give isl_multi_union_pw_aff
*preimage_explicit_domain(
9637 __isl_take isl_multi_union_pw_aff
*mupa
,
9638 __isl_keep isl_union_pw_multi_aff
*upma
)
9642 if (isl_multi_union_pw_aff_check_has_explicit_domain(mupa
) < 0)
9643 return isl_multi_union_pw_aff_free(mupa
);
9645 mupa
= isl_multi_union_pw_aff_cow(mupa
);
9649 is_params
= isl_union_set_is_params(mupa
->u
.dom
);
9651 return isl_multi_union_pw_aff_free(mupa
);
9653 upma
= isl_union_pw_multi_aff_copy(upma
);
9655 mupa
->u
.dom
= isl_union_set_intersect_params(mupa
->u
.dom
,
9656 isl_union_set_params(isl_union_pw_multi_aff_domain(upma
)));
9658 mupa
->u
.dom
= isl_union_set_preimage_union_pw_multi_aff(
9661 return isl_multi_union_pw_aff_free(mupa
);
9665 /* Compute the pullback of "mupa" by the function represented by "upma".
9666 * In other words, plug in "upma" in "mupa". The result contains
9667 * expressions defined over the domain space of "upma".
9669 * Run over all elements of "mupa" and plug in "upma" in each of them.
9671 * If "mupa" has an explicit domain, then it is this domain
9672 * that needs to undergo a pullback instead, i.e., a preimage.
9674 __isl_give isl_multi_union_pw_aff
*
9675 isl_multi_union_pw_aff_pullback_union_pw_multi_aff(
9676 __isl_take isl_multi_union_pw_aff
*mupa
,
9677 __isl_take isl_union_pw_multi_aff
*upma
)
9682 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
9683 isl_union_pw_multi_aff_get_space(upma
));
9684 upma
= isl_union_pw_multi_aff_align_params(upma
,
9685 isl_multi_union_pw_aff_get_space(mupa
));
9686 mupa
= isl_multi_union_pw_aff_cow(mupa
);
9687 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
9691 for (i
= 0; i
< n
; ++i
) {
9692 isl_union_pw_aff
*upa
;
9694 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
9695 upa
= isl_union_pw_aff_pullback_union_pw_multi_aff(upa
,
9696 isl_union_pw_multi_aff_copy(upma
));
9697 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
9700 if (isl_multi_union_pw_aff_has_explicit_domain(mupa
))
9701 mupa
= preimage_explicit_domain(mupa
, upma
);
9703 isl_union_pw_multi_aff_free(upma
);
9706 isl_multi_union_pw_aff_free(mupa
);
9707 isl_union_pw_multi_aff_free(upma
);
9711 /* Extract the sequence of elements in "mupa" with domain space "space"
9712 * (ignoring parameters).
9714 * For the elements of "mupa" that are not defined on the specified space,
9715 * the corresponding element in the result is empty.
9717 __isl_give isl_multi_pw_aff
*isl_multi_union_pw_aff_extract_multi_pw_aff(
9718 __isl_keep isl_multi_union_pw_aff
*mupa
, __isl_take isl_space
*space
)
9722 isl_space
*space_mpa
;
9723 isl_multi_pw_aff
*mpa
;
9725 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
9726 if (n
< 0 || !space
)
9729 space_mpa
= isl_multi_union_pw_aff_get_space(mupa
);
9730 space
= isl_space_replace_params(space
, space_mpa
);
9731 space_mpa
= isl_space_map_from_domain_and_range(isl_space_copy(space
),
9733 mpa
= isl_multi_pw_aff_alloc(space_mpa
);
9735 space
= isl_space_from_domain(space
);
9736 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
9737 for (i
= 0; i
< n
; ++i
) {
9738 isl_union_pw_aff
*upa
;
9741 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
9742 pa
= isl_union_pw_aff_extract_pw_aff(upa
,
9743 isl_space_copy(space
));
9744 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
9745 isl_union_pw_aff_free(upa
);
9748 isl_space_free(space
);
9751 isl_space_free(space
);
9755 /* Data structure that specifies how isl_union_pw_multi_aff_un_op
9756 * should modify the base expressions in the input.
9758 * If "filter" is not NULL, then only the base expressions that satisfy "filter"
9759 * are taken into account.
9760 * "fn" is applied to each entry in the input.
9762 struct isl_union_pw_multi_aff_un_op_control
{
9763 isl_bool (*filter
)(__isl_keep isl_pw_multi_aff
*part
);
9764 __isl_give isl_pw_multi_aff
*(*fn
)(__isl_take isl_pw_multi_aff
*pma
);
9767 /* Wrapper for isl_union_pw_multi_aff_un_op filter functions (which do not take
9768 * a second argument) for use as an isl_union_pw_multi_aff_transform
9769 * filter function (which does take a second argument).
9770 * Simply call control->filter without the second argument.
9772 static isl_bool
isl_union_pw_multi_aff_un_op_filter_drop_user(
9773 __isl_take isl_pw_multi_aff
*pma
, void *user
)
9775 struct isl_union_pw_multi_aff_un_op_control
*control
= user
;
9777 return control
->filter(pma
);
9780 /* Wrapper for isl_union_pw_multi_aff_un_op base functions (which do not take
9781 * a second argument) for use as an isl_union_pw_multi_aff_transform
9782 * base function (which does take a second argument).
9783 * Simply call control->fn without the second argument.
9785 static __isl_give isl_pw_multi_aff
*isl_union_pw_multi_aff_un_op_drop_user(
9786 __isl_take isl_pw_multi_aff
*pma
, void *user
)
9788 struct isl_union_pw_multi_aff_un_op_control
*control
= user
;
9790 return control
->fn(pma
);
9793 /* Construct an isl_union_pw_multi_aff that is obtained by
9794 * modifying "upma" according to "control".
9796 * isl_union_pw_multi_aff_transform performs essentially
9797 * the same operation, but takes a filter and a callback function
9798 * of a different form (with an extra argument).
9799 * Call isl_union_pw_multi_aff_transform with wrappers
9800 * that remove this extra argument.
9802 static __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_un_op(
9803 __isl_take isl_union_pw_multi_aff
*upma
,
9804 struct isl_union_pw_multi_aff_un_op_control
*control
)
9806 struct isl_union_pw_multi_aff_transform_control t_control
= {
9807 .filter
= &isl_union_pw_multi_aff_un_op_filter_drop_user
,
9808 .filter_user
= control
,
9809 .fn
= &isl_union_pw_multi_aff_un_op_drop_user
,
9813 return isl_union_pw_multi_aff_transform(upma
, &t_control
);
9816 /* For each function in "upma" of the form A -> [B -> C],
9817 * extract the function A -> B and collect the results.
9819 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_range_factor_domain(
9820 __isl_take isl_union_pw_multi_aff
*upma
)
9822 struct isl_union_pw_multi_aff_un_op_control control
= {
9823 .filter
= &isl_pw_multi_aff_range_is_wrapping
,
9824 .fn
= &isl_pw_multi_aff_range_factor_domain
,
9826 return isl_union_pw_multi_aff_un_op(upma
, &control
);
9829 /* For each function in "upma" of the form A -> [B -> C],
9830 * extract the function A -> C and collect the results.
9832 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_range_factor_range(
9833 __isl_take isl_union_pw_multi_aff
*upma
)
9835 struct isl_union_pw_multi_aff_un_op_control control
= {
9836 .filter
= &isl_pw_multi_aff_range_is_wrapping
,
9837 .fn
= &isl_pw_multi_aff_range_factor_range
,
9839 return isl_union_pw_multi_aff_un_op(upma
, &control
);
9842 /* Evaluate the affine function "aff" in the void point "pnt".
9843 * In particular, return the value NaN.
9845 static __isl_give isl_val
*eval_void(__isl_take isl_aff
*aff
,
9846 __isl_take isl_point
*pnt
)
9850 ctx
= isl_point_get_ctx(pnt
);
9852 isl_point_free(pnt
);
9853 return isl_val_nan(ctx
);
9856 /* Evaluate the affine expression "aff"
9857 * in the coordinates (with denominator) "pnt".
9859 static __isl_give isl_val
*eval(__isl_keep isl_vec
*aff
,
9860 __isl_keep isl_vec
*pnt
)
9869 ctx
= isl_vec_get_ctx(aff
);
9872 isl_seq_inner_product(aff
->el
+ 1, pnt
->el
, pnt
->size
, &n
);
9873 isl_int_mul(d
, aff
->el
[0], pnt
->el
[0]);
9874 v
= isl_val_rat_from_isl_int(ctx
, n
, d
);
9875 v
= isl_val_normalize(v
);
9882 /* Check that the domain space of "aff" is equal to "space".
9884 static isl_stat
isl_aff_check_has_domain_space(__isl_keep isl_aff
*aff
,
9885 __isl_keep isl_space
*space
)
9889 ok
= isl_space_is_equal(isl_aff_peek_domain_space(aff
), space
);
9891 return isl_stat_error
;
9893 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
9894 "incompatible spaces", return isl_stat_error
);
9898 /* Evaluate the affine function "aff" in "pnt".
9900 __isl_give isl_val
*isl_aff_eval(__isl_take isl_aff
*aff
,
9901 __isl_take isl_point
*pnt
)
9905 isl_local_space
*ls
;
9907 if (isl_aff_check_has_domain_space(aff
, isl_point_peek_space(pnt
)) < 0)
9909 is_void
= isl_point_is_void(pnt
);
9913 return eval_void(aff
, pnt
);
9915 ls
= isl_aff_get_domain_local_space(aff
);
9916 pnt
= isl_local_space_lift_point(ls
, pnt
);
9918 v
= eval(aff
->v
, isl_point_peek_vec(pnt
));
9921 isl_point_free(pnt
);
9926 isl_point_free(pnt
);