2 * Copyright 2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
7 * Use of this software is governed by the MIT license
9 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
10 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
13 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
14 * B.P. 105 - 78153 Le Chesnay, France
17 #include <isl_ctx_private.h>
18 #include <isl_map_private.h>
19 #include <isl_union_map_private.h>
20 #include <isl_aff_private.h>
21 #include <isl_space_private.h>
22 #include <isl_local_space_private.h>
23 #include <isl_vec_private.h>
24 #include <isl_mat_private.h>
26 #include <isl/constraint.h>
29 #include <isl_val_private.h>
30 #include <isl_point_private.h>
31 #include <isl_config.h>
36 #include <isl_list_templ.c>
41 #include <isl_list_templ.c>
44 #define BASE pw_multi_aff
46 #include <isl_list_templ.c>
49 #define BASE union_pw_aff
51 #include <isl_list_templ.c>
54 #define BASE union_pw_multi_aff
56 #include <isl_list_templ.c>
58 __isl_give isl_aff
*isl_aff_alloc_vec(__isl_take isl_local_space
*ls
,
59 __isl_take isl_vec
*v
)
66 aff
= isl_calloc_type(v
->ctx
, struct isl_aff
);
76 isl_local_space_free(ls
);
81 __isl_give isl_aff
*isl_aff_alloc(__isl_take isl_local_space
*ls
)
90 ctx
= isl_local_space_get_ctx(ls
);
91 if (!isl_local_space_divs_known(ls
))
92 isl_die(ctx
, isl_error_invalid
, "local space has unknown divs",
94 if (!isl_local_space_is_set(ls
))
95 isl_die(ctx
, isl_error_invalid
,
96 "domain of affine expression should be a set",
99 total
= isl_local_space_dim(ls
, isl_dim_all
);
100 v
= isl_vec_alloc(ctx
, 1 + 1 + total
);
101 return isl_aff_alloc_vec(ls
, v
);
103 isl_local_space_free(ls
);
107 __isl_give isl_aff
*isl_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
111 aff
= isl_aff_alloc(ls
);
115 isl_int_set_si(aff
->v
->el
[0], 1);
116 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
121 /* Return a piecewise affine expression defined on the specified domain
122 * that is equal to zero.
124 __isl_give isl_pw_aff
*isl_pw_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
126 return isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls
));
129 /* Return an affine expression defined on the specified domain
130 * that represents NaN.
132 __isl_give isl_aff
*isl_aff_nan_on_domain(__isl_take isl_local_space
*ls
)
136 aff
= isl_aff_alloc(ls
);
140 isl_seq_clr(aff
->v
->el
, aff
->v
->size
);
145 /* Return a piecewise affine expression defined on the specified domain
146 * that represents NaN.
148 __isl_give isl_pw_aff
*isl_pw_aff_nan_on_domain(__isl_take isl_local_space
*ls
)
150 return isl_pw_aff_from_aff(isl_aff_nan_on_domain(ls
));
153 /* Return an affine expression that is equal to "val" on
154 * domain local space "ls".
156 __isl_give isl_aff
*isl_aff_val_on_domain(__isl_take isl_local_space
*ls
,
157 __isl_take isl_val
*val
)
163 if (!isl_val_is_rat(val
))
164 isl_die(isl_val_get_ctx(val
), isl_error_invalid
,
165 "expecting rational value", goto error
);
167 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
171 isl_seq_clr(aff
->v
->el
+ 2, aff
->v
->size
- 2);
172 isl_int_set(aff
->v
->el
[1], val
->n
);
173 isl_int_set(aff
->v
->el
[0], val
->d
);
175 isl_local_space_free(ls
);
179 isl_local_space_free(ls
);
184 /* Return an affine expression that is equal to the specified dimension
187 __isl_give isl_aff
*isl_aff_var_on_domain(__isl_take isl_local_space
*ls
,
188 enum isl_dim_type type
, unsigned pos
)
196 space
= isl_local_space_get_space(ls
);
199 if (isl_space_is_map(space
))
200 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
201 "expecting (parameter) set space", goto error
);
202 if (pos
>= isl_local_space_dim(ls
, type
))
203 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
204 "position out of bounds", goto error
);
206 isl_space_free(space
);
207 aff
= isl_aff_alloc(ls
);
211 pos
+= isl_local_space_offset(aff
->ls
, type
);
213 isl_int_set_si(aff
->v
->el
[0], 1);
214 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
215 isl_int_set_si(aff
->v
->el
[1 + pos
], 1);
219 isl_local_space_free(ls
);
220 isl_space_free(space
);
224 /* Return a piecewise affine expression that is equal to
225 * the specified dimension in "ls".
227 __isl_give isl_pw_aff
*isl_pw_aff_var_on_domain(__isl_take isl_local_space
*ls
,
228 enum isl_dim_type type
, unsigned pos
)
230 return isl_pw_aff_from_aff(isl_aff_var_on_domain(ls
, type
, pos
));
233 /* Return an affine expression that is equal to the parameter
234 * in the domain space "space" with identifier "id".
236 __isl_give isl_aff
*isl_aff_param_on_domain_space_id(
237 __isl_take isl_space
*space
, __isl_take isl_id
*id
)
244 pos
= isl_space_find_dim_by_id(space
, isl_dim_param
, id
);
246 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
247 "parameter not found in space", goto error
);
249 ls
= isl_local_space_from_space(space
);
250 return isl_aff_var_on_domain(ls
, isl_dim_param
, pos
);
252 isl_space_free(space
);
257 __isl_give isl_aff
*isl_aff_copy(__isl_keep isl_aff
*aff
)
266 __isl_give isl_aff
*isl_aff_dup(__isl_keep isl_aff
*aff
)
271 return isl_aff_alloc_vec(isl_local_space_copy(aff
->ls
),
272 isl_vec_copy(aff
->v
));
275 __isl_give isl_aff
*isl_aff_cow(__isl_take isl_aff
*aff
)
283 return isl_aff_dup(aff
);
286 __isl_null isl_aff
*isl_aff_free(__isl_take isl_aff
*aff
)
294 isl_local_space_free(aff
->ls
);
295 isl_vec_free(aff
->v
);
302 isl_ctx
*isl_aff_get_ctx(__isl_keep isl_aff
*aff
)
304 return aff
? isl_local_space_get_ctx(aff
->ls
) : NULL
;
307 /* Return a hash value that digests "aff".
309 uint32_t isl_aff_get_hash(__isl_keep isl_aff
*aff
)
311 uint32_t hash
, ls_hash
, v_hash
;
316 hash
= isl_hash_init();
317 ls_hash
= isl_local_space_get_hash(aff
->ls
);
318 isl_hash_hash(hash
, ls_hash
);
319 v_hash
= isl_vec_get_hash(aff
->v
);
320 isl_hash_hash(hash
, v_hash
);
325 /* Externally, an isl_aff has a map space, but internally, the
326 * ls field corresponds to the domain of that space.
328 int isl_aff_dim(__isl_keep isl_aff
*aff
, enum isl_dim_type type
)
332 if (type
== isl_dim_out
)
334 if (type
== isl_dim_in
)
336 return isl_local_space_dim(aff
->ls
, type
);
339 /* Return the position of the dimension of the given type and name
341 * Return -1 if no such dimension can be found.
343 int isl_aff_find_dim_by_name(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
348 if (type
== isl_dim_out
)
350 if (type
== isl_dim_in
)
352 return isl_local_space_find_dim_by_name(aff
->ls
, type
, name
);
355 /* Return the domain space of "aff".
357 static __isl_keep isl_space
*isl_aff_peek_domain_space(__isl_keep isl_aff
*aff
)
359 return aff
? isl_local_space_peek_space(aff
->ls
) : NULL
;
362 __isl_give isl_space
*isl_aff_get_domain_space(__isl_keep isl_aff
*aff
)
364 return isl_space_copy(isl_aff_peek_domain_space(aff
));
367 __isl_give isl_space
*isl_aff_get_space(__isl_keep isl_aff
*aff
)
372 space
= isl_local_space_get_space(aff
->ls
);
373 space
= isl_space_from_domain(space
);
374 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
378 __isl_give isl_local_space
*isl_aff_get_domain_local_space(
379 __isl_keep isl_aff
*aff
)
381 return aff
? isl_local_space_copy(aff
->ls
) : NULL
;
384 __isl_give isl_local_space
*isl_aff_get_local_space(__isl_keep isl_aff
*aff
)
389 ls
= isl_local_space_copy(aff
->ls
);
390 ls
= isl_local_space_from_domain(ls
);
391 ls
= isl_local_space_add_dims(ls
, isl_dim_out
, 1);
395 /* Return the local space of the domain of "aff".
396 * This may be either a copy or the local space itself
397 * if there is only one reference to "aff".
398 * This allows the local space to be modified inplace
399 * if both the expression and its local space have only a single reference.
400 * The caller is not allowed to modify "aff" between this call and
401 * a subsequent call to isl_aff_restore_domain_local_space.
402 * The only exception is that isl_aff_free can be called instead.
404 __isl_give isl_local_space
*isl_aff_take_domain_local_space(
405 __isl_keep isl_aff
*aff
)
412 return isl_aff_get_domain_local_space(aff
);
418 /* Set the local space of the domain of "aff" to "ls",
419 * where the local space of "aff" may be missing
420 * due to a preceding call to isl_aff_take_domain_local_space.
421 * However, in this case, "aff" only has a single reference and
422 * then the call to isl_aff_cow has no effect.
424 __isl_give isl_aff
*isl_aff_restore_domain_local_space(
425 __isl_keep isl_aff
*aff
, __isl_take isl_local_space
*ls
)
431 isl_local_space_free(ls
);
435 aff
= isl_aff_cow(aff
);
438 isl_local_space_free(aff
->ls
);
444 isl_local_space_free(ls
);
448 /* Externally, an isl_aff has a map space, but internally, the
449 * ls field corresponds to the domain of that space.
451 const char *isl_aff_get_dim_name(__isl_keep isl_aff
*aff
,
452 enum isl_dim_type type
, unsigned pos
)
456 if (type
== isl_dim_out
)
458 if (type
== isl_dim_in
)
460 return isl_local_space_get_dim_name(aff
->ls
, type
, pos
);
463 __isl_give isl_aff
*isl_aff_reset_domain_space(__isl_take isl_aff
*aff
,
464 __isl_take isl_space
*dim
)
466 aff
= isl_aff_cow(aff
);
470 aff
->ls
= isl_local_space_reset_space(aff
->ls
, dim
);
472 return isl_aff_free(aff
);
481 /* Reset the space of "aff". This function is called from isl_pw_templ.c
482 * and doesn't know if the space of an element object is represented
483 * directly or through its domain. It therefore passes along both.
485 __isl_give isl_aff
*isl_aff_reset_space_and_domain(__isl_take isl_aff
*aff
,
486 __isl_take isl_space
*space
, __isl_take isl_space
*domain
)
488 isl_space_free(space
);
489 return isl_aff_reset_domain_space(aff
, domain
);
492 /* Reorder the coefficients of the affine expression based
493 * on the given reordering.
494 * The reordering r is assumed to have been extended with the local
497 static __isl_give isl_vec
*vec_reorder(__isl_take isl_vec
*vec
,
498 __isl_take isl_reordering
*r
, int n_div
)
507 space
= isl_reordering_peek_space(r
);
508 res
= isl_vec_alloc(vec
->ctx
,
509 2 + isl_space_dim(space
, isl_dim_all
) + n_div
);
512 isl_seq_cpy(res
->el
, vec
->el
, 2);
513 isl_seq_clr(res
->el
+ 2, res
->size
- 2);
514 for (i
= 0; i
< r
->len
; ++i
)
515 isl_int_set(res
->el
[2 + r
->pos
[i
]], vec
->el
[2 + i
]);
517 isl_reordering_free(r
);
522 isl_reordering_free(r
);
526 /* Reorder the dimensions of the domain of "aff" according
527 * to the given reordering.
529 __isl_give isl_aff
*isl_aff_realign_domain(__isl_take isl_aff
*aff
,
530 __isl_take isl_reordering
*r
)
532 aff
= isl_aff_cow(aff
);
536 r
= isl_reordering_extend(r
, aff
->ls
->div
->n_row
);
537 aff
->v
= vec_reorder(aff
->v
, isl_reordering_copy(r
),
538 aff
->ls
->div
->n_row
);
539 aff
->ls
= isl_local_space_realign(aff
->ls
, r
);
541 if (!aff
->v
|| !aff
->ls
)
542 return isl_aff_free(aff
);
547 isl_reordering_free(r
);
551 __isl_give isl_aff
*isl_aff_align_params(__isl_take isl_aff
*aff
,
552 __isl_take isl_space
*model
)
554 isl_bool equal_params
;
559 equal_params
= isl_space_has_equal_params(aff
->ls
->dim
, model
);
560 if (equal_params
< 0)
565 exp
= isl_parameter_alignment_reordering(aff
->ls
->dim
, model
);
566 exp
= isl_reordering_extend_space(exp
,
567 isl_aff_get_domain_space(aff
));
568 aff
= isl_aff_realign_domain(aff
, exp
);
571 isl_space_free(model
);
574 isl_space_free(model
);
579 /* Is "aff" obviously equal to zero?
581 * If the denominator is zero, then "aff" is not equal to zero.
583 isl_bool
isl_aff_plain_is_zero(__isl_keep isl_aff
*aff
)
586 return isl_bool_error
;
588 if (isl_int_is_zero(aff
->v
->el
[0]))
589 return isl_bool_false
;
590 return isl_seq_first_non_zero(aff
->v
->el
+ 1, aff
->v
->size
- 1) < 0;
593 /* Does "aff" represent NaN?
595 isl_bool
isl_aff_is_nan(__isl_keep isl_aff
*aff
)
598 return isl_bool_error
;
600 return isl_seq_first_non_zero(aff
->v
->el
, 2) < 0;
603 /* Are "aff1" and "aff2" obviously equal?
605 * NaN is not equal to anything, not even to another NaN.
607 isl_bool
isl_aff_plain_is_equal(__isl_keep isl_aff
*aff1
,
608 __isl_keep isl_aff
*aff2
)
613 return isl_bool_error
;
615 if (isl_aff_is_nan(aff1
) || isl_aff_is_nan(aff2
))
616 return isl_bool_false
;
618 equal
= isl_local_space_is_equal(aff1
->ls
, aff2
->ls
);
619 if (equal
< 0 || !equal
)
622 return isl_vec_is_equal(aff1
->v
, aff2
->v
);
625 /* Return the common denominator of "aff" in "v".
627 * We cannot return anything meaningful in case of a NaN.
629 isl_stat
isl_aff_get_denominator(__isl_keep isl_aff
*aff
, isl_int
*v
)
632 return isl_stat_error
;
633 if (isl_aff_is_nan(aff
))
634 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
635 "cannot get denominator of NaN", return isl_stat_error
);
636 isl_int_set(*v
, aff
->v
->el
[0]);
640 /* Return the common denominator of "aff".
642 __isl_give isl_val
*isl_aff_get_denominator_val(__isl_keep isl_aff
*aff
)
649 ctx
= isl_aff_get_ctx(aff
);
650 if (isl_aff_is_nan(aff
))
651 return isl_val_nan(ctx
);
652 return isl_val_int_from_isl_int(ctx
, aff
->v
->el
[0]);
655 /* Return the constant term of "aff".
657 __isl_give isl_val
*isl_aff_get_constant_val(__isl_keep isl_aff
*aff
)
665 ctx
= isl_aff_get_ctx(aff
);
666 if (isl_aff_is_nan(aff
))
667 return isl_val_nan(ctx
);
668 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1], aff
->v
->el
[0]);
669 return isl_val_normalize(v
);
672 /* Return the coefficient of the variable of type "type" at position "pos"
675 __isl_give isl_val
*isl_aff_get_coefficient_val(__isl_keep isl_aff
*aff
,
676 enum isl_dim_type type
, int pos
)
684 ctx
= isl_aff_get_ctx(aff
);
685 if (type
== isl_dim_out
)
686 isl_die(ctx
, isl_error_invalid
,
687 "output/set dimension does not have a coefficient",
689 if (type
== isl_dim_in
)
692 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
693 isl_die(ctx
, isl_error_invalid
,
694 "position out of bounds", return NULL
);
696 if (isl_aff_is_nan(aff
))
697 return isl_val_nan(ctx
);
698 pos
+= isl_local_space_offset(aff
->ls
, type
);
699 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1 + pos
], aff
->v
->el
[0]);
700 return isl_val_normalize(v
);
703 /* Return the sign of the coefficient of the variable of type "type"
704 * at position "pos" of "aff".
706 int isl_aff_coefficient_sgn(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
714 ctx
= isl_aff_get_ctx(aff
);
715 if (type
== isl_dim_out
)
716 isl_die(ctx
, isl_error_invalid
,
717 "output/set dimension does not have a coefficient",
719 if (type
== isl_dim_in
)
722 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
723 isl_die(ctx
, isl_error_invalid
,
724 "position out of bounds", return 0);
726 pos
+= isl_local_space_offset(aff
->ls
, type
);
727 return isl_int_sgn(aff
->v
->el
[1 + pos
]);
730 /* Replace the numerator of the constant term of "aff" by "v".
732 * A NaN is unaffected by this operation.
734 __isl_give isl_aff
*isl_aff_set_constant(__isl_take isl_aff
*aff
, isl_int v
)
738 if (isl_aff_is_nan(aff
))
740 aff
= isl_aff_cow(aff
);
744 aff
->v
= isl_vec_cow(aff
->v
);
746 return isl_aff_free(aff
);
748 isl_int_set(aff
->v
->el
[1], v
);
753 /* Replace the constant term of "aff" by "v".
755 * A NaN is unaffected by this operation.
757 __isl_give isl_aff
*isl_aff_set_constant_val(__isl_take isl_aff
*aff
,
758 __isl_take isl_val
*v
)
763 if (isl_aff_is_nan(aff
)) {
768 if (!isl_val_is_rat(v
))
769 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
770 "expecting rational value", goto error
);
772 if (isl_int_eq(aff
->v
->el
[1], v
->n
) &&
773 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
778 aff
= isl_aff_cow(aff
);
781 aff
->v
= isl_vec_cow(aff
->v
);
785 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
786 isl_int_set(aff
->v
->el
[1], v
->n
);
787 } else if (isl_int_is_one(v
->d
)) {
788 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
790 isl_seq_scale(aff
->v
->el
+ 1,
791 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
792 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
793 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
794 aff
->v
= isl_vec_normalize(aff
->v
);
807 /* Add "v" to the constant term of "aff".
809 * A NaN is unaffected by this operation.
811 __isl_give isl_aff
*isl_aff_add_constant(__isl_take isl_aff
*aff
, isl_int v
)
813 if (isl_int_is_zero(v
))
818 if (isl_aff_is_nan(aff
))
820 aff
= isl_aff_cow(aff
);
824 aff
->v
= isl_vec_cow(aff
->v
);
826 return isl_aff_free(aff
);
828 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
);
833 /* Add "v" to the constant term of "aff".
835 * A NaN is unaffected by this operation.
837 __isl_give isl_aff
*isl_aff_add_constant_val(__isl_take isl_aff
*aff
,
838 __isl_take isl_val
*v
)
843 if (isl_aff_is_nan(aff
) || isl_val_is_zero(v
)) {
848 if (!isl_val_is_rat(v
))
849 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
850 "expecting rational value", goto error
);
852 aff
= isl_aff_cow(aff
);
856 aff
->v
= isl_vec_cow(aff
->v
);
860 if (isl_int_is_one(v
->d
)) {
861 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
862 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
863 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
->n
);
864 aff
->v
= isl_vec_normalize(aff
->v
);
868 isl_seq_scale(aff
->v
->el
+ 1,
869 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
870 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
871 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
872 aff
->v
= isl_vec_normalize(aff
->v
);
885 __isl_give isl_aff
*isl_aff_add_constant_si(__isl_take isl_aff
*aff
, int v
)
890 isl_int_set_si(t
, v
);
891 aff
= isl_aff_add_constant(aff
, t
);
897 /* Add "v" to the numerator of the constant term of "aff".
899 * A NaN is unaffected by this operation.
901 __isl_give isl_aff
*isl_aff_add_constant_num(__isl_take isl_aff
*aff
, isl_int v
)
903 if (isl_int_is_zero(v
))
908 if (isl_aff_is_nan(aff
))
910 aff
= isl_aff_cow(aff
);
914 aff
->v
= isl_vec_cow(aff
->v
);
916 return isl_aff_free(aff
);
918 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
);
923 /* Add "v" to the numerator of the constant term of "aff".
925 * A NaN is unaffected by this operation.
927 __isl_give isl_aff
*isl_aff_add_constant_num_si(__isl_take isl_aff
*aff
, int v
)
935 isl_int_set_si(t
, v
);
936 aff
= isl_aff_add_constant_num(aff
, t
);
942 /* Replace the numerator of the constant term of "aff" by "v".
944 * A NaN is unaffected by this operation.
946 __isl_give isl_aff
*isl_aff_set_constant_si(__isl_take isl_aff
*aff
, int v
)
950 if (isl_aff_is_nan(aff
))
952 aff
= isl_aff_cow(aff
);
956 aff
->v
= isl_vec_cow(aff
->v
);
958 return isl_aff_free(aff
);
960 isl_int_set_si(aff
->v
->el
[1], v
);
965 /* Replace the numerator of the coefficient of the variable of type "type"
966 * at position "pos" of "aff" by "v".
968 * A NaN is unaffected by this operation.
970 __isl_give isl_aff
*isl_aff_set_coefficient(__isl_take isl_aff
*aff
,
971 enum isl_dim_type type
, int pos
, isl_int v
)
976 if (type
== isl_dim_out
)
977 isl_die(aff
->v
->ctx
, isl_error_invalid
,
978 "output/set dimension does not have a coefficient",
979 return isl_aff_free(aff
));
980 if (type
== isl_dim_in
)
983 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
984 isl_die(aff
->v
->ctx
, isl_error_invalid
,
985 "position out of bounds", return isl_aff_free(aff
));
987 if (isl_aff_is_nan(aff
))
989 aff
= isl_aff_cow(aff
);
993 aff
->v
= isl_vec_cow(aff
->v
);
995 return isl_aff_free(aff
);
997 pos
+= isl_local_space_offset(aff
->ls
, type
);
998 isl_int_set(aff
->v
->el
[1 + pos
], v
);
1003 /* Replace the numerator of the coefficient of the variable of type "type"
1004 * at position "pos" of "aff" by "v".
1006 * A NaN is unaffected by this operation.
1008 __isl_give isl_aff
*isl_aff_set_coefficient_si(__isl_take isl_aff
*aff
,
1009 enum isl_dim_type type
, int pos
, int v
)
1014 if (type
== isl_dim_out
)
1015 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1016 "output/set dimension does not have a coefficient",
1017 return isl_aff_free(aff
));
1018 if (type
== isl_dim_in
)
1021 if (pos
< 0 || pos
>= isl_local_space_dim(aff
->ls
, type
))
1022 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1023 "position out of bounds", return isl_aff_free(aff
));
1025 if (isl_aff_is_nan(aff
))
1027 pos
+= isl_local_space_offset(aff
->ls
, type
);
1028 if (isl_int_cmp_si(aff
->v
->el
[1 + pos
], v
) == 0)
1031 aff
= isl_aff_cow(aff
);
1035 aff
->v
= isl_vec_cow(aff
->v
);
1037 return isl_aff_free(aff
);
1039 isl_int_set_si(aff
->v
->el
[1 + pos
], v
);
1044 /* Replace the coefficient of the variable of type "type" at position "pos"
1047 * A NaN is unaffected by this operation.
1049 __isl_give isl_aff
*isl_aff_set_coefficient_val(__isl_take isl_aff
*aff
,
1050 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1055 if (type
== isl_dim_out
)
1056 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1057 "output/set dimension does not have a coefficient",
1059 if (type
== isl_dim_in
)
1062 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1063 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1064 "position out of bounds", goto error
);
1066 if (isl_aff_is_nan(aff
)) {
1070 if (!isl_val_is_rat(v
))
1071 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1072 "expecting rational value", goto error
);
1074 pos
+= isl_local_space_offset(aff
->ls
, type
);
1075 if (isl_int_eq(aff
->v
->el
[1 + pos
], v
->n
) &&
1076 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1081 aff
= isl_aff_cow(aff
);
1084 aff
->v
= isl_vec_cow(aff
->v
);
1088 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1089 isl_int_set(aff
->v
->el
[1 + pos
], v
->n
);
1090 } else if (isl_int_is_one(v
->d
)) {
1091 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1093 isl_seq_scale(aff
->v
->el
+ 1,
1094 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1095 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1096 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1097 aff
->v
= isl_vec_normalize(aff
->v
);
1110 /* Add "v" to the coefficient of the variable of type "type"
1111 * at position "pos" of "aff".
1113 * A NaN is unaffected by this operation.
1115 __isl_give isl_aff
*isl_aff_add_coefficient(__isl_take isl_aff
*aff
,
1116 enum isl_dim_type type
, int pos
, isl_int v
)
1121 if (type
== isl_dim_out
)
1122 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1123 "output/set dimension does not have a coefficient",
1124 return isl_aff_free(aff
));
1125 if (type
== isl_dim_in
)
1128 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1129 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1130 "position out of bounds", return isl_aff_free(aff
));
1132 if (isl_aff_is_nan(aff
))
1134 aff
= isl_aff_cow(aff
);
1138 aff
->v
= isl_vec_cow(aff
->v
);
1140 return isl_aff_free(aff
);
1142 pos
+= isl_local_space_offset(aff
->ls
, type
);
1143 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
);
1148 /* Add "v" to the coefficient of the variable of type "type"
1149 * at position "pos" of "aff".
1151 * A NaN is unaffected by this operation.
1153 __isl_give isl_aff
*isl_aff_add_coefficient_val(__isl_take isl_aff
*aff
,
1154 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1159 if (isl_val_is_zero(v
)) {
1164 if (type
== isl_dim_out
)
1165 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1166 "output/set dimension does not have a coefficient",
1168 if (type
== isl_dim_in
)
1171 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1172 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1173 "position out of bounds", goto error
);
1175 if (isl_aff_is_nan(aff
)) {
1179 if (!isl_val_is_rat(v
))
1180 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1181 "expecting rational value", goto error
);
1183 aff
= isl_aff_cow(aff
);
1187 aff
->v
= isl_vec_cow(aff
->v
);
1191 pos
+= isl_local_space_offset(aff
->ls
, type
);
1192 if (isl_int_is_one(v
->d
)) {
1193 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1194 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1195 isl_int_add(aff
->v
->el
[1 + pos
], aff
->v
->el
[1 + pos
], v
->n
);
1196 aff
->v
= isl_vec_normalize(aff
->v
);
1200 isl_seq_scale(aff
->v
->el
+ 1,
1201 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1202 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1203 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1204 aff
->v
= isl_vec_normalize(aff
->v
);
1217 __isl_give isl_aff
*isl_aff_add_coefficient_si(__isl_take isl_aff
*aff
,
1218 enum isl_dim_type type
, int pos
, int v
)
1223 isl_int_set_si(t
, v
);
1224 aff
= isl_aff_add_coefficient(aff
, type
, pos
, t
);
1230 __isl_give isl_aff
*isl_aff_get_div(__isl_keep isl_aff
*aff
, int pos
)
1235 return isl_local_space_get_div(aff
->ls
, pos
);
1238 /* Return the negation of "aff".
1240 * As a special case, -NaN = NaN.
1242 __isl_give isl_aff
*isl_aff_neg(__isl_take isl_aff
*aff
)
1246 if (isl_aff_is_nan(aff
))
1248 aff
= isl_aff_cow(aff
);
1251 aff
->v
= isl_vec_cow(aff
->v
);
1253 return isl_aff_free(aff
);
1255 isl_seq_neg(aff
->v
->el
+ 1, aff
->v
->el
+ 1, aff
->v
->size
- 1);
1260 /* Remove divs from the local space that do not appear in the affine
1262 * We currently only remove divs at the end.
1263 * Some intermediate divs may also not appear directly in the affine
1264 * expression, but we would also need to check that no other divs are
1265 * defined in terms of them.
1267 __isl_give isl_aff
*isl_aff_remove_unused_divs(__isl_take isl_aff
*aff
)
1276 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1277 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1279 pos
= isl_seq_last_non_zero(aff
->v
->el
+ 1 + off
, n
) + 1;
1283 aff
= isl_aff_cow(aff
);
1287 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, isl_dim_div
, pos
, n
- pos
);
1288 aff
->v
= isl_vec_drop_els(aff
->v
, 1 + off
+ pos
, n
- pos
);
1289 if (!aff
->ls
|| !aff
->v
)
1290 return isl_aff_free(aff
);
1295 /* Look for any divs in the aff->ls with a denominator equal to one
1296 * and plug them into the affine expression and any subsequent divs
1297 * that may reference the div.
1299 static __isl_give isl_aff
*plug_in_integral_divs(__isl_take isl_aff
*aff
)
1305 isl_local_space
*ls
;
1311 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1313 for (i
= 0; i
< n
; ++i
) {
1314 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][0]))
1316 ls
= isl_local_space_copy(aff
->ls
);
1317 ls
= isl_local_space_substitute_seq(ls
, isl_dim_div
, i
,
1318 aff
->ls
->div
->row
[i
], len
, i
+ 1, n
- (i
+ 1));
1319 vec
= isl_vec_copy(aff
->v
);
1320 vec
= isl_vec_cow(vec
);
1326 pos
= isl_local_space_offset(aff
->ls
, isl_dim_div
) + i
;
1327 isl_seq_substitute(vec
->el
, pos
, aff
->ls
->div
->row
[i
],
1332 isl_vec_free(aff
->v
);
1334 isl_local_space_free(aff
->ls
);
1341 isl_local_space_free(ls
);
1342 return isl_aff_free(aff
);
1345 /* Look for any divs j that appear with a unit coefficient inside
1346 * the definitions of other divs i and plug them into the definitions
1349 * In particular, an expression of the form
1351 * floor((f(..) + floor(g(..)/n))/m)
1355 * floor((n * f(..) + g(..))/(n * m))
1357 * This simplification is correct because we can move the expression
1358 * f(..) into the inner floor in the original expression to obtain
1360 * floor(floor((n * f(..) + g(..))/n)/m)
1362 * from which we can derive the simplified expression.
1364 static __isl_give isl_aff
*plug_in_unit_divs(__isl_take isl_aff
*aff
)
1372 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1373 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1374 for (i
= 1; i
< n
; ++i
) {
1375 for (j
= 0; j
< i
; ++j
) {
1376 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][1 + off
+ j
]))
1378 aff
->ls
= isl_local_space_substitute_seq(aff
->ls
,
1379 isl_dim_div
, j
, aff
->ls
->div
->row
[j
],
1380 aff
->v
->size
, i
, 1);
1382 return isl_aff_free(aff
);
1389 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
1391 * Even though this function is only called on isl_affs with a single
1392 * reference, we are careful to only change aff->v and aff->ls together.
1394 static __isl_give isl_aff
*swap_div(__isl_take isl_aff
*aff
, int a
, int b
)
1396 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1397 isl_local_space
*ls
;
1400 ls
= isl_local_space_copy(aff
->ls
);
1401 ls
= isl_local_space_swap_div(ls
, a
, b
);
1402 v
= isl_vec_copy(aff
->v
);
1407 isl_int_swap(v
->el
[1 + off
+ a
], v
->el
[1 + off
+ b
]);
1408 isl_vec_free(aff
->v
);
1410 isl_local_space_free(aff
->ls
);
1416 isl_local_space_free(ls
);
1417 return isl_aff_free(aff
);
1420 /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL.
1422 * We currently do not actually remove div "b", but simply add its
1423 * coefficient to that of "a" and then zero it out.
1425 static __isl_give isl_aff
*merge_divs(__isl_take isl_aff
*aff
, int a
, int b
)
1427 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1429 if (isl_int_is_zero(aff
->v
->el
[1 + off
+ b
]))
1432 aff
->v
= isl_vec_cow(aff
->v
);
1434 return isl_aff_free(aff
);
1436 isl_int_add(aff
->v
->el
[1 + off
+ a
],
1437 aff
->v
->el
[1 + off
+ a
], aff
->v
->el
[1 + off
+ b
]);
1438 isl_int_set_si(aff
->v
->el
[1 + off
+ b
], 0);
1443 /* Sort the divs in the local space of "aff" according to
1444 * the comparison function "cmp_row" in isl_local_space.c,
1445 * combining the coefficients of identical divs.
1447 * Reordering divs does not change the semantics of "aff",
1448 * so there is no need to call isl_aff_cow.
1449 * Moreover, this function is currently only called on isl_affs
1450 * with a single reference.
1452 static __isl_give isl_aff
*sort_divs(__isl_take isl_aff
*aff
)
1459 n
= isl_aff_dim(aff
, isl_dim_div
);
1460 for (i
= 1; i
< n
; ++i
) {
1461 for (j
= i
- 1; j
>= 0; --j
) {
1462 int cmp
= isl_mat_cmp_div(aff
->ls
->div
, j
, j
+ 1);
1466 aff
= merge_divs(aff
, j
, j
+ 1);
1468 aff
= swap_div(aff
, j
, j
+ 1);
1477 /* Normalize the representation of "aff".
1479 * This function should only be called of "new" isl_affs, i.e.,
1480 * with only a single reference. We therefore do not need to
1481 * worry about affecting other instances.
1483 __isl_give isl_aff
*isl_aff_normalize(__isl_take isl_aff
*aff
)
1487 aff
->v
= isl_vec_normalize(aff
->v
);
1489 return isl_aff_free(aff
);
1490 aff
= plug_in_integral_divs(aff
);
1491 aff
= plug_in_unit_divs(aff
);
1492 aff
= sort_divs(aff
);
1493 aff
= isl_aff_remove_unused_divs(aff
);
1497 /* Given f, return floor(f).
1498 * If f is an integer expression, then just return f.
1499 * If f is a constant, then return the constant floor(f).
1500 * Otherwise, if f = g/m, write g = q m + r,
1501 * create a new div d = [r/m] and return the expression q + d.
1502 * The coefficients in r are taken to lie between -m/2 and m/2.
1504 * reduce_div_coefficients performs the same normalization.
1506 * As a special case, floor(NaN) = NaN.
1508 __isl_give isl_aff
*isl_aff_floor(__isl_take isl_aff
*aff
)
1518 if (isl_aff_is_nan(aff
))
1520 if (isl_int_is_one(aff
->v
->el
[0]))
1523 aff
= isl_aff_cow(aff
);
1527 aff
->v
= isl_vec_cow(aff
->v
);
1529 return isl_aff_free(aff
);
1531 if (isl_aff_is_cst(aff
)) {
1532 isl_int_fdiv_q(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1533 isl_int_set_si(aff
->v
->el
[0], 1);
1537 div
= isl_vec_copy(aff
->v
);
1538 div
= isl_vec_cow(div
);
1540 return isl_aff_free(aff
);
1542 ctx
= isl_aff_get_ctx(aff
);
1543 isl_int_fdiv_q(aff
->v
->el
[0], aff
->v
->el
[0], ctx
->two
);
1544 for (i
= 1; i
< aff
->v
->size
; ++i
) {
1545 isl_int_fdiv_r(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1546 isl_int_fdiv_q(aff
->v
->el
[i
], aff
->v
->el
[i
], div
->el
[0]);
1547 if (isl_int_gt(div
->el
[i
], aff
->v
->el
[0])) {
1548 isl_int_sub(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1549 isl_int_add_ui(aff
->v
->el
[i
], aff
->v
->el
[i
], 1);
1553 aff
->ls
= isl_local_space_add_div(aff
->ls
, div
);
1555 return isl_aff_free(aff
);
1557 size
= aff
->v
->size
;
1558 aff
->v
= isl_vec_extend(aff
->v
, size
+ 1);
1560 return isl_aff_free(aff
);
1561 isl_int_set_si(aff
->v
->el
[0], 1);
1562 isl_int_set_si(aff
->v
->el
[size
], 1);
1564 aff
= isl_aff_normalize(aff
);
1571 * aff mod m = aff - m * floor(aff/m)
1573 * with m an integer value.
1575 __isl_give isl_aff
*isl_aff_mod_val(__isl_take isl_aff
*aff
,
1576 __isl_take isl_val
*m
)
1583 if (!isl_val_is_int(m
))
1584 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
1585 "expecting integer modulo", goto error
);
1587 res
= isl_aff_copy(aff
);
1588 aff
= isl_aff_scale_down_val(aff
, isl_val_copy(m
));
1589 aff
= isl_aff_floor(aff
);
1590 aff
= isl_aff_scale_val(aff
, m
);
1591 res
= isl_aff_sub(res
, aff
);
1602 * pwaff mod m = pwaff - m * floor(pwaff/m)
1604 __isl_give isl_pw_aff
*isl_pw_aff_mod(__isl_take isl_pw_aff
*pwaff
, isl_int m
)
1608 res
= isl_pw_aff_copy(pwaff
);
1609 pwaff
= isl_pw_aff_scale_down(pwaff
, m
);
1610 pwaff
= isl_pw_aff_floor(pwaff
);
1611 pwaff
= isl_pw_aff_scale(pwaff
, m
);
1612 res
= isl_pw_aff_sub(res
, pwaff
);
1619 * pa mod m = pa - m * floor(pa/m)
1621 * with m an integer value.
1623 __isl_give isl_pw_aff
*isl_pw_aff_mod_val(__isl_take isl_pw_aff
*pa
,
1624 __isl_take isl_val
*m
)
1628 if (!isl_val_is_int(m
))
1629 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
1630 "expecting integer modulo", goto error
);
1631 pa
= isl_pw_aff_mod(pa
, m
->n
);
1635 isl_pw_aff_free(pa
);
1640 /* Given f, return ceil(f).
1641 * If f is an integer expression, then just return f.
1642 * Otherwise, let f be the expression
1648 * floor((e + m - 1)/m)
1650 * As a special case, ceil(NaN) = NaN.
1652 __isl_give isl_aff
*isl_aff_ceil(__isl_take isl_aff
*aff
)
1657 if (isl_aff_is_nan(aff
))
1659 if (isl_int_is_one(aff
->v
->el
[0]))
1662 aff
= isl_aff_cow(aff
);
1665 aff
->v
= isl_vec_cow(aff
->v
);
1667 return isl_aff_free(aff
);
1669 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1670 isl_int_sub_ui(aff
->v
->el
[1], aff
->v
->el
[1], 1);
1671 aff
= isl_aff_floor(aff
);
1676 /* Apply the expansion computed by isl_merge_divs.
1677 * The expansion itself is given by "exp" while the resulting
1678 * list of divs is given by "div".
1680 __isl_give isl_aff
*isl_aff_expand_divs(__isl_take isl_aff
*aff
,
1681 __isl_take isl_mat
*div
, int *exp
)
1687 aff
= isl_aff_cow(aff
);
1691 old_n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1692 new_n_div
= isl_mat_rows(div
);
1693 offset
= 1 + isl_local_space_offset(aff
->ls
, isl_dim_div
);
1695 aff
->v
= isl_vec_expand(aff
->v
, offset
, old_n_div
, exp
, new_n_div
);
1696 aff
->ls
= isl_local_space_replace_divs(aff
->ls
, div
);
1697 if (!aff
->v
|| !aff
->ls
)
1698 return isl_aff_free(aff
);
1706 /* Add two affine expressions that live in the same local space.
1708 static __isl_give isl_aff
*add_expanded(__isl_take isl_aff
*aff1
,
1709 __isl_take isl_aff
*aff2
)
1713 aff1
= isl_aff_cow(aff1
);
1717 aff1
->v
= isl_vec_cow(aff1
->v
);
1723 isl_int_gcd(gcd
, aff1
->v
->el
[0], aff2
->v
->el
[0]);
1724 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1725 isl_seq_scale(aff1
->v
->el
+ 1, aff1
->v
->el
+ 1, f
, aff1
->v
->size
- 1);
1726 isl_int_divexact(f
, aff1
->v
->el
[0], gcd
);
1727 isl_seq_addmul(aff1
->v
->el
+ 1, f
, aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
1728 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1729 isl_int_mul(aff1
->v
->el
[0], aff1
->v
->el
[0], f
);
1741 /* Return the sum of "aff1" and "aff2".
1743 * If either of the two is NaN, then the result is NaN.
1745 __isl_give isl_aff
*isl_aff_add(__isl_take isl_aff
*aff1
,
1746 __isl_take isl_aff
*aff2
)
1757 ctx
= isl_aff_get_ctx(aff1
);
1758 if (!isl_space_is_equal(aff1
->ls
->dim
, aff2
->ls
->dim
))
1759 isl_die(ctx
, isl_error_invalid
,
1760 "spaces don't match", goto error
);
1762 if (isl_aff_is_nan(aff1
)) {
1766 if (isl_aff_is_nan(aff2
)) {
1771 n_div1
= isl_aff_dim(aff1
, isl_dim_div
);
1772 n_div2
= isl_aff_dim(aff2
, isl_dim_div
);
1773 if (n_div1
== 0 && n_div2
== 0)
1774 return add_expanded(aff1
, aff2
);
1776 exp1
= isl_alloc_array(ctx
, int, n_div1
);
1777 exp2
= isl_alloc_array(ctx
, int, n_div2
);
1778 if ((n_div1
&& !exp1
) || (n_div2
&& !exp2
))
1781 div
= isl_merge_divs(aff1
->ls
->div
, aff2
->ls
->div
, exp1
, exp2
);
1782 aff1
= isl_aff_expand_divs(aff1
, isl_mat_copy(div
), exp1
);
1783 aff2
= isl_aff_expand_divs(aff2
, div
, exp2
);
1787 return add_expanded(aff1
, aff2
);
1796 __isl_give isl_aff
*isl_aff_sub(__isl_take isl_aff
*aff1
,
1797 __isl_take isl_aff
*aff2
)
1799 return isl_aff_add(aff1
, isl_aff_neg(aff2
));
1802 /* Return the result of scaling "aff" by a factor of "f".
1804 * As a special case, f * NaN = NaN.
1806 __isl_give isl_aff
*isl_aff_scale(__isl_take isl_aff
*aff
, isl_int f
)
1812 if (isl_aff_is_nan(aff
))
1815 if (isl_int_is_one(f
))
1818 aff
= isl_aff_cow(aff
);
1821 aff
->v
= isl_vec_cow(aff
->v
);
1823 return isl_aff_free(aff
);
1825 if (isl_int_is_pos(f
) && isl_int_is_divisible_by(aff
->v
->el
[0], f
)) {
1826 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], f
);
1831 isl_int_gcd(gcd
, aff
->v
->el
[0], f
);
1832 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1833 isl_int_divexact(gcd
, f
, gcd
);
1834 isl_seq_scale(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1840 /* Multiple "aff" by "v".
1842 __isl_give isl_aff
*isl_aff_scale_val(__isl_take isl_aff
*aff
,
1843 __isl_take isl_val
*v
)
1848 if (isl_val_is_one(v
)) {
1853 if (!isl_val_is_rat(v
))
1854 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1855 "expecting rational factor", goto error
);
1857 aff
= isl_aff_scale(aff
, v
->n
);
1858 aff
= isl_aff_scale_down(aff
, v
->d
);
1868 /* Return the result of scaling "aff" down by a factor of "f".
1870 * As a special case, NaN/f = NaN.
1872 __isl_give isl_aff
*isl_aff_scale_down(__isl_take isl_aff
*aff
, isl_int f
)
1878 if (isl_aff_is_nan(aff
))
1881 if (isl_int_is_one(f
))
1884 aff
= isl_aff_cow(aff
);
1888 if (isl_int_is_zero(f
))
1889 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1890 "cannot scale down by zero", return isl_aff_free(aff
));
1892 aff
->v
= isl_vec_cow(aff
->v
);
1894 return isl_aff_free(aff
);
1897 isl_seq_gcd(aff
->v
->el
+ 1, aff
->v
->size
- 1, &gcd
);
1898 isl_int_gcd(gcd
, gcd
, f
);
1899 isl_seq_scale_down(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1900 isl_int_divexact(gcd
, f
, gcd
);
1901 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1907 /* Divide "aff" by "v".
1909 __isl_give isl_aff
*isl_aff_scale_down_val(__isl_take isl_aff
*aff
,
1910 __isl_take isl_val
*v
)
1915 if (isl_val_is_one(v
)) {
1920 if (!isl_val_is_rat(v
))
1921 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1922 "expecting rational factor", goto error
);
1923 if (!isl_val_is_pos(v
))
1924 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1925 "factor needs to be positive", goto error
);
1927 aff
= isl_aff_scale(aff
, v
->d
);
1928 aff
= isl_aff_scale_down(aff
, v
->n
);
1938 __isl_give isl_aff
*isl_aff_scale_down_ui(__isl_take isl_aff
*aff
, unsigned f
)
1946 isl_int_set_ui(v
, f
);
1947 aff
= isl_aff_scale_down(aff
, v
);
1953 __isl_give isl_aff
*isl_aff_set_dim_name(__isl_take isl_aff
*aff
,
1954 enum isl_dim_type type
, unsigned pos
, const char *s
)
1956 aff
= isl_aff_cow(aff
);
1959 if (type
== isl_dim_out
)
1960 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1961 "cannot set name of output/set dimension",
1962 return isl_aff_free(aff
));
1963 if (type
== isl_dim_in
)
1965 aff
->ls
= isl_local_space_set_dim_name(aff
->ls
, type
, pos
, s
);
1967 return isl_aff_free(aff
);
1972 __isl_give isl_aff
*isl_aff_set_dim_id(__isl_take isl_aff
*aff
,
1973 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
1975 aff
= isl_aff_cow(aff
);
1978 if (type
== isl_dim_out
)
1979 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1980 "cannot set name of output/set dimension",
1982 if (type
== isl_dim_in
)
1984 aff
->ls
= isl_local_space_set_dim_id(aff
->ls
, type
, pos
, id
);
1986 return isl_aff_free(aff
);
1995 /* Replace the identifier of the input tuple of "aff" by "id".
1996 * type is currently required to be equal to isl_dim_in
1998 __isl_give isl_aff
*isl_aff_set_tuple_id(__isl_take isl_aff
*aff
,
1999 enum isl_dim_type type
, __isl_take isl_id
*id
)
2001 aff
= isl_aff_cow(aff
);
2004 if (type
!= isl_dim_in
)
2005 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2006 "cannot only set id of input tuple", goto error
);
2007 aff
->ls
= isl_local_space_set_tuple_id(aff
->ls
, isl_dim_set
, id
);
2009 return isl_aff_free(aff
);
2018 /* Exploit the equalities in "eq" to simplify the affine expression
2019 * and the expressions of the integer divisions in the local space.
2020 * The integer divisions in this local space are assumed to appear
2021 * as regular dimensions in "eq".
2023 static __isl_give isl_aff
*isl_aff_substitute_equalities_lifted(
2024 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
2032 if (eq
->n_eq
== 0) {
2033 isl_basic_set_free(eq
);
2037 aff
= isl_aff_cow(aff
);
2041 aff
->ls
= isl_local_space_substitute_equalities(aff
->ls
,
2042 isl_basic_set_copy(eq
));
2043 aff
->v
= isl_vec_cow(aff
->v
);
2044 if (!aff
->ls
|| !aff
->v
)
2047 total
= 1 + isl_space_dim(eq
->dim
, isl_dim_all
);
2049 for (i
= 0; i
< eq
->n_eq
; ++i
) {
2050 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
2051 if (j
< 0 || j
== 0 || j
>= total
)
2054 isl_seq_elim(aff
->v
->el
+ 1, eq
->eq
[i
], j
, total
,
2058 isl_basic_set_free(eq
);
2059 aff
= isl_aff_normalize(aff
);
2062 isl_basic_set_free(eq
);
2067 /* Exploit the equalities in "eq" to simplify the affine expression
2068 * and the expressions of the integer divisions in the local space.
2070 __isl_give isl_aff
*isl_aff_substitute_equalities(__isl_take isl_aff
*aff
,
2071 __isl_take isl_basic_set
*eq
)
2077 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2079 eq
= isl_basic_set_add_dims(eq
, isl_dim_set
, n_div
);
2080 return isl_aff_substitute_equalities_lifted(aff
, eq
);
2082 isl_basic_set_free(eq
);
2087 /* Look for equalities among the variables shared by context and aff
2088 * and the integer divisions of aff, if any.
2089 * The equalities are then used to eliminate coefficients and/or integer
2090 * divisions from aff.
2092 __isl_give isl_aff
*isl_aff_gist(__isl_take isl_aff
*aff
,
2093 __isl_take isl_set
*context
)
2095 isl_basic_set
*hull
;
2100 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2102 isl_basic_set
*bset
;
2103 isl_local_space
*ls
;
2104 context
= isl_set_add_dims(context
, isl_dim_set
, n_div
);
2105 ls
= isl_aff_get_domain_local_space(aff
);
2106 bset
= isl_basic_set_from_local_space(ls
);
2107 bset
= isl_basic_set_lift(bset
);
2108 bset
= isl_basic_set_flatten(bset
);
2109 context
= isl_set_intersect(context
,
2110 isl_set_from_basic_set(bset
));
2113 hull
= isl_set_affine_hull(context
);
2114 return isl_aff_substitute_equalities_lifted(aff
, hull
);
2117 isl_set_free(context
);
2121 __isl_give isl_aff
*isl_aff_gist_params(__isl_take isl_aff
*aff
,
2122 __isl_take isl_set
*context
)
2124 isl_set
*dom_context
= isl_set_universe(isl_aff_get_domain_space(aff
));
2125 dom_context
= isl_set_intersect_params(dom_context
, context
);
2126 return isl_aff_gist(aff
, dom_context
);
2129 /* Return a basic set containing those elements in the space
2130 * of aff where it is positive. "rational" should not be set.
2132 * If "aff" is NaN, then it is not positive.
2134 static __isl_give isl_basic_set
*aff_pos_basic_set(__isl_take isl_aff
*aff
,
2137 isl_constraint
*ineq
;
2138 isl_basic_set
*bset
;
2143 if (isl_aff_is_nan(aff
)) {
2144 isl_space
*space
= isl_aff_get_domain_space(aff
);
2146 return isl_basic_set_empty(space
);
2149 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2150 "rational sets not supported", goto error
);
2152 ineq
= isl_inequality_from_aff(aff
);
2153 c
= isl_constraint_get_constant_val(ineq
);
2154 c
= isl_val_sub_ui(c
, 1);
2155 ineq
= isl_constraint_set_constant_val(ineq
, c
);
2157 bset
= isl_basic_set_from_constraint(ineq
);
2158 bset
= isl_basic_set_simplify(bset
);
2165 /* Return a basic set containing those elements in the space
2166 * of aff where it is non-negative.
2167 * If "rational" is set, then return a rational basic set.
2169 * If "aff" is NaN, then it is not non-negative (it's not negative either).
2171 static __isl_give isl_basic_set
*aff_nonneg_basic_set(
2172 __isl_take isl_aff
*aff
, int rational
)
2174 isl_constraint
*ineq
;
2175 isl_basic_set
*bset
;
2179 if (isl_aff_is_nan(aff
)) {
2180 isl_space
*space
= isl_aff_get_domain_space(aff
);
2182 return isl_basic_set_empty(space
);
2185 ineq
= isl_inequality_from_aff(aff
);
2187 bset
= isl_basic_set_from_constraint(ineq
);
2189 bset
= isl_basic_set_set_rational(bset
);
2190 bset
= isl_basic_set_simplify(bset
);
2194 /* Return a basic set containing those elements in the space
2195 * of aff where it is non-negative.
2197 __isl_give isl_basic_set
*isl_aff_nonneg_basic_set(__isl_take isl_aff
*aff
)
2199 return aff_nonneg_basic_set(aff
, 0);
2202 /* Return a basic set containing those elements in the domain space
2203 * of "aff" where it is positive.
2205 __isl_give isl_basic_set
*isl_aff_pos_basic_set(__isl_take isl_aff
*aff
)
2207 aff
= isl_aff_add_constant_num_si(aff
, -1);
2208 return isl_aff_nonneg_basic_set(aff
);
2211 /* Return a basic set containing those elements in the domain space
2212 * of aff where it is negative.
2214 __isl_give isl_basic_set
*isl_aff_neg_basic_set(__isl_take isl_aff
*aff
)
2216 aff
= isl_aff_neg(aff
);
2217 return isl_aff_pos_basic_set(aff
);
2220 /* Return a basic set containing those elements in the space
2221 * of aff where it is zero.
2222 * If "rational" is set, then return a rational basic set.
2224 * If "aff" is NaN, then it is not zero.
2226 static __isl_give isl_basic_set
*aff_zero_basic_set(__isl_take isl_aff
*aff
,
2229 isl_constraint
*ineq
;
2230 isl_basic_set
*bset
;
2234 if (isl_aff_is_nan(aff
)) {
2235 isl_space
*space
= isl_aff_get_domain_space(aff
);
2237 return isl_basic_set_empty(space
);
2240 ineq
= isl_equality_from_aff(aff
);
2242 bset
= isl_basic_set_from_constraint(ineq
);
2244 bset
= isl_basic_set_set_rational(bset
);
2245 bset
= isl_basic_set_simplify(bset
);
2249 /* Return a basic set containing those elements in the space
2250 * of aff where it is zero.
2252 __isl_give isl_basic_set
*isl_aff_zero_basic_set(__isl_take isl_aff
*aff
)
2254 return aff_zero_basic_set(aff
, 0);
2257 /* Return a basic set containing those elements in the shared space
2258 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2260 __isl_give isl_basic_set
*isl_aff_ge_basic_set(__isl_take isl_aff
*aff1
,
2261 __isl_take isl_aff
*aff2
)
2263 aff1
= isl_aff_sub(aff1
, aff2
);
2265 return isl_aff_nonneg_basic_set(aff1
);
2268 /* Return a basic set containing those elements in the shared domain space
2269 * of "aff1" and "aff2" where "aff1" is greater than "aff2".
2271 __isl_give isl_basic_set
*isl_aff_gt_basic_set(__isl_take isl_aff
*aff1
,
2272 __isl_take isl_aff
*aff2
)
2274 aff1
= isl_aff_sub(aff1
, aff2
);
2276 return isl_aff_pos_basic_set(aff1
);
2279 /* Return a set containing those elements in the shared space
2280 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2282 __isl_give isl_set
*isl_aff_ge_set(__isl_take isl_aff
*aff1
,
2283 __isl_take isl_aff
*aff2
)
2285 return isl_set_from_basic_set(isl_aff_ge_basic_set(aff1
, aff2
));
2288 /* Return a set containing those elements in the shared domain space
2289 * of aff1 and aff2 where aff1 is greater than aff2.
2291 * If either of the two inputs is NaN, then the result is empty,
2292 * as comparisons with NaN always return false.
2294 __isl_give isl_set
*isl_aff_gt_set(__isl_take isl_aff
*aff1
,
2295 __isl_take isl_aff
*aff2
)
2297 return isl_set_from_basic_set(isl_aff_gt_basic_set(aff1
, aff2
));
2300 /* Return a basic set containing those elements in the shared space
2301 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2303 __isl_give isl_basic_set
*isl_aff_le_basic_set(__isl_take isl_aff
*aff1
,
2304 __isl_take isl_aff
*aff2
)
2306 return isl_aff_ge_basic_set(aff2
, aff1
);
2309 /* Return a basic set containing those elements in the shared domain space
2310 * of "aff1" and "aff2" where "aff1" is smaller than "aff2".
2312 __isl_give isl_basic_set
*isl_aff_lt_basic_set(__isl_take isl_aff
*aff1
,
2313 __isl_take isl_aff
*aff2
)
2315 return isl_aff_gt_basic_set(aff2
, aff1
);
2318 /* Return a set containing those elements in the shared space
2319 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2321 __isl_give isl_set
*isl_aff_le_set(__isl_take isl_aff
*aff1
,
2322 __isl_take isl_aff
*aff2
)
2324 return isl_aff_ge_set(aff2
, aff1
);
2327 /* Return a set containing those elements in the shared domain space
2328 * of "aff1" and "aff2" where "aff1" is smaller than "aff2".
2330 __isl_give isl_set
*isl_aff_lt_set(__isl_take isl_aff
*aff1
,
2331 __isl_take isl_aff
*aff2
)
2333 return isl_set_from_basic_set(isl_aff_lt_basic_set(aff1
, aff2
));
2336 /* Return a basic set containing those elements in the shared space
2337 * of aff1 and aff2 where aff1 and aff2 are equal.
2339 __isl_give isl_basic_set
*isl_aff_eq_basic_set(__isl_take isl_aff
*aff1
,
2340 __isl_take isl_aff
*aff2
)
2342 aff1
= isl_aff_sub(aff1
, aff2
);
2344 return isl_aff_zero_basic_set(aff1
);
2347 /* Return a set containing those elements in the shared space
2348 * of aff1 and aff2 where aff1 and aff2 are equal.
2350 __isl_give isl_set
*isl_aff_eq_set(__isl_take isl_aff
*aff1
,
2351 __isl_take isl_aff
*aff2
)
2353 return isl_set_from_basic_set(isl_aff_eq_basic_set(aff1
, aff2
));
2356 /* Return a set containing those elements in the shared domain space
2357 * of aff1 and aff2 where aff1 and aff2 are not equal.
2359 * If either of the two inputs is NaN, then the result is empty,
2360 * as comparisons with NaN always return false.
2362 __isl_give isl_set
*isl_aff_ne_set(__isl_take isl_aff
*aff1
,
2363 __isl_take isl_aff
*aff2
)
2365 isl_set
*set_lt
, *set_gt
;
2367 set_lt
= isl_aff_lt_set(isl_aff_copy(aff1
),
2368 isl_aff_copy(aff2
));
2369 set_gt
= isl_aff_gt_set(aff1
, aff2
);
2370 return isl_set_union_disjoint(set_lt
, set_gt
);
2373 __isl_give isl_aff
*isl_aff_add_on_domain(__isl_keep isl_set
*dom
,
2374 __isl_take isl_aff
*aff1
, __isl_take isl_aff
*aff2
)
2376 aff1
= isl_aff_add(aff1
, aff2
);
2377 aff1
= isl_aff_gist(aff1
, isl_set_copy(dom
));
2381 int isl_aff_is_empty(__isl_keep isl_aff
*aff
)
2389 /* Check whether the given affine expression has non-zero coefficient
2390 * for any dimension in the given range or if any of these dimensions
2391 * appear with non-zero coefficients in any of the integer divisions
2392 * involved in the affine expression.
2394 isl_bool
isl_aff_involves_dims(__isl_keep isl_aff
*aff
,
2395 enum isl_dim_type type
, unsigned first
, unsigned n
)
2400 isl_bool involves
= isl_bool_false
;
2403 return isl_bool_error
;
2405 return isl_bool_false
;
2407 ctx
= isl_aff_get_ctx(aff
);
2408 if (first
+ n
> isl_aff_dim(aff
, type
))
2409 isl_die(ctx
, isl_error_invalid
,
2410 "range out of bounds", return isl_bool_error
);
2412 active
= isl_local_space_get_active(aff
->ls
, aff
->v
->el
+ 2);
2416 first
+= isl_local_space_offset(aff
->ls
, type
) - 1;
2417 for (i
= 0; i
< n
; ++i
)
2418 if (active
[first
+ i
]) {
2419 involves
= isl_bool_true
;
2428 return isl_bool_error
;
2431 __isl_give isl_aff
*isl_aff_drop_dims(__isl_take isl_aff
*aff
,
2432 enum isl_dim_type type
, unsigned first
, unsigned n
)
2438 if (type
== isl_dim_out
)
2439 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2440 "cannot drop output/set dimension",
2441 return isl_aff_free(aff
));
2442 if (type
== isl_dim_in
)
2444 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2447 ctx
= isl_aff_get_ctx(aff
);
2448 if (first
+ n
> isl_local_space_dim(aff
->ls
, type
))
2449 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
2450 return isl_aff_free(aff
));
2452 aff
= isl_aff_cow(aff
);
2456 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, type
, first
, n
);
2458 return isl_aff_free(aff
);
2460 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2461 aff
->v
= isl_vec_drop_els(aff
->v
, first
, n
);
2463 return isl_aff_free(aff
);
2468 /* Drop the "n" domain dimensions starting at "first" from "aff",
2469 * after checking that they do not appear in the affine expression.
2471 static __isl_give isl_aff
*drop_domain(__isl_take isl_aff
*aff
, unsigned first
,
2476 involves
= isl_aff_involves_dims(aff
, isl_dim_in
, first
, n
);
2478 return isl_aff_free(aff
);
2480 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2481 "affine expression involves some of the domain dimensions",
2482 return isl_aff_free(aff
));
2483 return isl_aff_drop_dims(aff
, isl_dim_in
, first
, n
);
2486 /* Project the domain of the affine expression onto its parameter space.
2487 * The affine expression may not involve any of the domain dimensions.
2489 __isl_give isl_aff
*isl_aff_project_domain_on_params(__isl_take isl_aff
*aff
)
2494 n
= isl_aff_dim(aff
, isl_dim_in
);
2495 aff
= drop_domain(aff
, 0, n
);
2496 space
= isl_aff_get_domain_space(aff
);
2497 space
= isl_space_params(space
);
2498 aff
= isl_aff_reset_domain_space(aff
, space
);
2502 /* Check that the domain of "aff" is a product.
2504 static isl_stat
check_domain_product(__isl_keep isl_aff
*aff
)
2506 isl_bool is_product
;
2508 is_product
= isl_space_is_product(isl_aff_peek_domain_space(aff
));
2510 return isl_stat_error
;
2512 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2513 "domain is not a product", return isl_stat_error
);
2517 /* Given an affine function with a domain of the form [A -> B] that
2518 * does not depend on B, return the same function on domain A.
2520 __isl_give isl_aff
*isl_aff_domain_factor_domain(__isl_take isl_aff
*aff
)
2525 if (check_domain_product(aff
) < 0)
2526 return isl_aff_free(aff
);
2527 space
= isl_aff_get_domain_space(aff
);
2528 n
= isl_space_dim(space
, isl_dim_set
);
2529 space
= isl_space_factor_domain(space
);
2530 n_in
= isl_space_dim(space
, isl_dim_set
);
2531 aff
= drop_domain(aff
, n_in
, n
- n_in
);
2532 aff
= isl_aff_reset_domain_space(aff
, space
);
2536 /* Convert an affine expression defined over a parameter domain
2537 * into one that is defined over a zero-dimensional set.
2539 __isl_give isl_aff
*isl_aff_from_range(__isl_take isl_aff
*aff
)
2541 isl_local_space
*ls
;
2543 ls
= isl_aff_take_domain_local_space(aff
);
2544 ls
= isl_local_space_set_from_params(ls
);
2545 aff
= isl_aff_restore_domain_local_space(aff
, ls
);
2550 __isl_give isl_aff
*isl_aff_insert_dims(__isl_take isl_aff
*aff
,
2551 enum isl_dim_type type
, unsigned first
, unsigned n
)
2557 if (type
== isl_dim_out
)
2558 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2559 "cannot insert output/set dimensions",
2560 return isl_aff_free(aff
));
2561 if (type
== isl_dim_in
)
2563 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2566 ctx
= isl_aff_get_ctx(aff
);
2567 if (first
> isl_local_space_dim(aff
->ls
, type
))
2568 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
2569 return isl_aff_free(aff
));
2571 aff
= isl_aff_cow(aff
);
2575 aff
->ls
= isl_local_space_insert_dims(aff
->ls
, type
, first
, n
);
2577 return isl_aff_free(aff
);
2579 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2580 aff
->v
= isl_vec_insert_zero_els(aff
->v
, first
, n
);
2582 return isl_aff_free(aff
);
2587 __isl_give isl_aff
*isl_aff_add_dims(__isl_take isl_aff
*aff
,
2588 enum isl_dim_type type
, unsigned n
)
2592 pos
= isl_aff_dim(aff
, type
);
2594 return isl_aff_insert_dims(aff
, type
, pos
, n
);
2597 __isl_give isl_pw_aff
*isl_pw_aff_add_dims(__isl_take isl_pw_aff
*pwaff
,
2598 enum isl_dim_type type
, unsigned n
)
2602 pos
= isl_pw_aff_dim(pwaff
, type
);
2604 return isl_pw_aff_insert_dims(pwaff
, type
, pos
, n
);
2607 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "aff"
2608 * to dimensions of "dst_type" at "dst_pos".
2610 * We only support moving input dimensions to parameters and vice versa.
2612 __isl_give isl_aff
*isl_aff_move_dims(__isl_take isl_aff
*aff
,
2613 enum isl_dim_type dst_type
, unsigned dst_pos
,
2614 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2622 !isl_local_space_is_named_or_nested(aff
->ls
, src_type
) &&
2623 !isl_local_space_is_named_or_nested(aff
->ls
, dst_type
))
2626 if (dst_type
== isl_dim_out
|| src_type
== isl_dim_out
)
2627 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2628 "cannot move output/set dimension",
2629 return isl_aff_free(aff
));
2630 if (dst_type
== isl_dim_div
|| src_type
== isl_dim_div
)
2631 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2632 "cannot move divs", return isl_aff_free(aff
));
2633 if (dst_type
== isl_dim_in
)
2634 dst_type
= isl_dim_set
;
2635 if (src_type
== isl_dim_in
)
2636 src_type
= isl_dim_set
;
2638 if (src_pos
+ n
> isl_local_space_dim(aff
->ls
, src_type
))
2639 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2640 "range out of bounds", return isl_aff_free(aff
));
2641 if (dst_type
== src_type
)
2642 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2643 "moving dims within the same type not supported",
2644 return isl_aff_free(aff
));
2646 aff
= isl_aff_cow(aff
);
2650 g_src_pos
= 1 + isl_local_space_offset(aff
->ls
, src_type
) + src_pos
;
2651 g_dst_pos
= 1 + isl_local_space_offset(aff
->ls
, dst_type
) + dst_pos
;
2652 if (dst_type
> src_type
)
2655 aff
->v
= isl_vec_move_els(aff
->v
, g_dst_pos
, g_src_pos
, n
);
2656 aff
->ls
= isl_local_space_move_dims(aff
->ls
, dst_type
, dst_pos
,
2657 src_type
, src_pos
, n
);
2658 if (!aff
->v
|| !aff
->ls
)
2659 return isl_aff_free(aff
);
2661 aff
= sort_divs(aff
);
2666 __isl_give isl_pw_aff
*isl_pw_aff_from_aff(__isl_take isl_aff
*aff
)
2668 isl_set
*dom
= isl_set_universe(isl_aff_get_domain_space(aff
));
2669 return isl_pw_aff_alloc(dom
, aff
);
2672 #define isl_aff_involves_nan isl_aff_is_nan
2675 #define PW isl_pw_aff
2679 #define EL_IS_ZERO is_empty
2683 #define IS_ZERO is_empty
2686 #undef DEFAULT_IS_ZERO
2687 #define DEFAULT_IS_ZERO 0
2693 #include <isl_pw_templ.c>
2694 #include <isl_pw_eval.c>
2695 #include <isl_pw_hash.c>
2696 #include <isl_pw_union_opt.c>
2701 #include <isl_union_single.c>
2702 #include <isl_union_neg.c>
2704 static __isl_give isl_set
*align_params_pw_pw_set_and(
2705 __isl_take isl_pw_aff
*pwaff1
, __isl_take isl_pw_aff
*pwaff2
,
2706 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
2707 __isl_take isl_pw_aff
*pwaff2
))
2709 isl_bool equal_params
;
2711 if (!pwaff1
|| !pwaff2
)
2713 equal_params
= isl_space_has_equal_params(pwaff1
->dim
, pwaff2
->dim
);
2714 if (equal_params
< 0)
2717 return fn(pwaff1
, pwaff2
);
2718 if (isl_pw_aff_check_named_params(pwaff1
) < 0 ||
2719 isl_pw_aff_check_named_params(pwaff2
) < 0)
2721 pwaff1
= isl_pw_aff_align_params(pwaff1
, isl_pw_aff_get_space(pwaff2
));
2722 pwaff2
= isl_pw_aff_align_params(pwaff2
, isl_pw_aff_get_space(pwaff1
));
2723 return fn(pwaff1
, pwaff2
);
2725 isl_pw_aff_free(pwaff1
);
2726 isl_pw_aff_free(pwaff2
);
2730 /* Align the parameters of the to isl_pw_aff arguments and
2731 * then apply a function "fn" on them that returns an isl_map.
2733 static __isl_give isl_map
*align_params_pw_pw_map_and(
2734 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
2735 __isl_give isl_map
*(*fn
)(__isl_take isl_pw_aff
*pa1
,
2736 __isl_take isl_pw_aff
*pa2
))
2738 isl_bool equal_params
;
2742 equal_params
= isl_space_has_equal_params(pa1
->dim
, pa2
->dim
);
2743 if (equal_params
< 0)
2746 return fn(pa1
, pa2
);
2747 if (isl_pw_aff_check_named_params(pa1
) < 0 ||
2748 isl_pw_aff_check_named_params(pa2
) < 0)
2750 pa1
= isl_pw_aff_align_params(pa1
, isl_pw_aff_get_space(pa2
));
2751 pa2
= isl_pw_aff_align_params(pa2
, isl_pw_aff_get_space(pa1
));
2752 return fn(pa1
, pa2
);
2754 isl_pw_aff_free(pa1
);
2755 isl_pw_aff_free(pa2
);
2759 /* Compute a piecewise quasi-affine expression with a domain that
2760 * is the union of those of pwaff1 and pwaff2 and such that on each
2761 * cell, the quasi-affine expression is the maximum of those of pwaff1
2762 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2763 * cell, then the associated expression is the defined one.
2765 static __isl_give isl_pw_aff
*pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2766 __isl_take isl_pw_aff
*pwaff2
)
2768 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_ge_set
);
2771 __isl_give isl_pw_aff
*isl_pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2772 __isl_take isl_pw_aff
*pwaff2
)
2774 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2778 /* Compute a piecewise quasi-affine expression with a domain that
2779 * is the union of those of pwaff1 and pwaff2 and such that on each
2780 * cell, the quasi-affine expression is the minimum of those of pwaff1
2781 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2782 * cell, then the associated expression is the defined one.
2784 static __isl_give isl_pw_aff
*pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2785 __isl_take isl_pw_aff
*pwaff2
)
2787 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_le_set
);
2790 __isl_give isl_pw_aff
*isl_pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2791 __isl_take isl_pw_aff
*pwaff2
)
2793 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2797 __isl_give isl_pw_aff
*isl_pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
2798 __isl_take isl_pw_aff
*pwaff2
, int max
)
2801 return isl_pw_aff_union_max(pwaff1
, pwaff2
);
2803 return isl_pw_aff_union_min(pwaff1
, pwaff2
);
2806 /* Return a set containing those elements in the domain
2807 * of "pwaff" where it satisfies "fn" (if complement is 0) or
2808 * does not satisfy "fn" (if complement is 1).
2810 * The pieces with a NaN never belong to the result since
2811 * NaN does not satisfy any property.
2813 static __isl_give isl_set
*pw_aff_locus(__isl_take isl_pw_aff
*pwaff
,
2814 __isl_give isl_basic_set
*(*fn
)(__isl_take isl_aff
*aff
, int rational
),
2823 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
2825 for (i
= 0; i
< pwaff
->n
; ++i
) {
2826 isl_basic_set
*bset
;
2827 isl_set
*set_i
, *locus
;
2830 if (isl_aff_is_nan(pwaff
->p
[i
].aff
))
2833 rational
= isl_set_has_rational(pwaff
->p
[i
].set
);
2834 bset
= fn(isl_aff_copy(pwaff
->p
[i
].aff
), rational
);
2835 locus
= isl_set_from_basic_set(bset
);
2836 set_i
= isl_set_copy(pwaff
->p
[i
].set
);
2838 set_i
= isl_set_subtract(set_i
, locus
);
2840 set_i
= isl_set_intersect(set_i
, locus
);
2841 set
= isl_set_union_disjoint(set
, set_i
);
2844 isl_pw_aff_free(pwaff
);
2849 /* Return a set containing those elements in the domain
2850 * of "pa" where it is positive.
2852 __isl_give isl_set
*isl_pw_aff_pos_set(__isl_take isl_pw_aff
*pa
)
2854 return pw_aff_locus(pa
, &aff_pos_basic_set
, 0);
2857 /* Return a set containing those elements in the domain
2858 * of pwaff where it is non-negative.
2860 __isl_give isl_set
*isl_pw_aff_nonneg_set(__isl_take isl_pw_aff
*pwaff
)
2862 return pw_aff_locus(pwaff
, &aff_nonneg_basic_set
, 0);
2865 /* Return a set containing those elements in the domain
2866 * of pwaff where it is zero.
2868 __isl_give isl_set
*isl_pw_aff_zero_set(__isl_take isl_pw_aff
*pwaff
)
2870 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 0);
2873 /* Return a set containing those elements in the domain
2874 * of pwaff where it is not zero.
2876 __isl_give isl_set
*isl_pw_aff_non_zero_set(__isl_take isl_pw_aff
*pwaff
)
2878 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 1);
2881 /* Return a set containing those elements in the shared domain
2882 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
2884 * We compute the difference on the shared domain and then construct
2885 * the set of values where this difference is non-negative.
2886 * If strict is set, we first subtract 1 from the difference.
2887 * If equal is set, we only return the elements where pwaff1 and pwaff2
2890 static __isl_give isl_set
*pw_aff_gte_set(__isl_take isl_pw_aff
*pwaff1
,
2891 __isl_take isl_pw_aff
*pwaff2
, int strict
, int equal
)
2893 isl_set
*set1
, *set2
;
2895 set1
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
));
2896 set2
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
));
2897 set1
= isl_set_intersect(set1
, set2
);
2898 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, isl_set_copy(set1
));
2899 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, isl_set_copy(set1
));
2900 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_neg(pwaff2
));
2903 isl_space
*dim
= isl_set_get_space(set1
);
2905 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2906 aff
= isl_aff_add_constant_si(aff
, -1);
2907 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_alloc(set1
, aff
));
2912 return isl_pw_aff_zero_set(pwaff1
);
2913 return isl_pw_aff_nonneg_set(pwaff1
);
2916 /* Return a set containing those elements in the shared domain
2917 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
2919 static __isl_give isl_set
*pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2920 __isl_take isl_pw_aff
*pwaff2
)
2922 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 1);
2925 __isl_give isl_set
*isl_pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2926 __isl_take isl_pw_aff
*pwaff2
)
2928 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_eq_set
);
2931 /* Return a set containing those elements in the shared domain
2932 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
2934 static __isl_give isl_set
*pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2935 __isl_take isl_pw_aff
*pwaff2
)
2937 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 0);
2940 __isl_give isl_set
*isl_pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2941 __isl_take isl_pw_aff
*pwaff2
)
2943 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ge_set
);
2946 /* Return a set containing those elements in the shared domain
2947 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
2949 static __isl_give isl_set
*pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2950 __isl_take isl_pw_aff
*pwaff2
)
2952 return pw_aff_gte_set(pwaff1
, pwaff2
, 1, 0);
2955 __isl_give isl_set
*isl_pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2956 __isl_take isl_pw_aff
*pwaff2
)
2958 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_gt_set
);
2961 __isl_give isl_set
*isl_pw_aff_le_set(__isl_take isl_pw_aff
*pwaff1
,
2962 __isl_take isl_pw_aff
*pwaff2
)
2964 return isl_pw_aff_ge_set(pwaff2
, pwaff1
);
2967 __isl_give isl_set
*isl_pw_aff_lt_set(__isl_take isl_pw_aff
*pwaff1
,
2968 __isl_take isl_pw_aff
*pwaff2
)
2970 return isl_pw_aff_gt_set(pwaff2
, pwaff1
);
2973 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2974 * where the function values are ordered in the same way as "order",
2975 * which returns a set in the shared domain of its two arguments.
2976 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
2978 * Let "pa1" and "pa2" be defined on domains A and B respectively.
2979 * We first pull back the two functions such that they are defined on
2980 * the domain [A -> B]. Then we apply "order", resulting in a set
2981 * in the space [A -> B]. Finally, we unwrap this set to obtain
2982 * a map in the space A -> B.
2984 static __isl_give isl_map
*isl_pw_aff_order_map_aligned(
2985 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
2986 __isl_give isl_set
*(*order
)(__isl_take isl_pw_aff
*pa1
,
2987 __isl_take isl_pw_aff
*pa2
))
2989 isl_space
*space1
, *space2
;
2993 space1
= isl_space_domain(isl_pw_aff_get_space(pa1
));
2994 space2
= isl_space_domain(isl_pw_aff_get_space(pa2
));
2995 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
2996 ma
= isl_multi_aff_domain_map(isl_space_copy(space1
));
2997 pa1
= isl_pw_aff_pullback_multi_aff(pa1
, ma
);
2998 ma
= isl_multi_aff_range_map(space1
);
2999 pa2
= isl_pw_aff_pullback_multi_aff(pa2
, ma
);
3000 set
= order(pa1
, pa2
);
3002 return isl_set_unwrap(set
);
3005 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3006 * where the function values are equal.
3007 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3009 static __isl_give isl_map
*isl_pw_aff_eq_map_aligned(__isl_take isl_pw_aff
*pa1
,
3010 __isl_take isl_pw_aff
*pa2
)
3012 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_eq_set
);
3015 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3016 * where the function values are equal.
3018 __isl_give isl_map
*isl_pw_aff_eq_map(__isl_take isl_pw_aff
*pa1
,
3019 __isl_take isl_pw_aff
*pa2
)
3021 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_eq_map_aligned
);
3024 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3025 * where the function value of "pa1" is less than the function value of "pa2".
3026 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3028 static __isl_give isl_map
*isl_pw_aff_lt_map_aligned(__isl_take isl_pw_aff
*pa1
,
3029 __isl_take isl_pw_aff
*pa2
)
3031 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_lt_set
);
3034 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3035 * where the function value of "pa1" is less than the function value of "pa2".
3037 __isl_give isl_map
*isl_pw_aff_lt_map(__isl_take isl_pw_aff
*pa1
,
3038 __isl_take isl_pw_aff
*pa2
)
3040 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_lt_map_aligned
);
3043 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3044 * where the function value of "pa1" is greater than the function value
3046 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3048 static __isl_give isl_map
*isl_pw_aff_gt_map_aligned(__isl_take isl_pw_aff
*pa1
,
3049 __isl_take isl_pw_aff
*pa2
)
3051 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_gt_set
);
3054 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3055 * where the function value of "pa1" is greater than the function value
3058 __isl_give isl_map
*isl_pw_aff_gt_map(__isl_take isl_pw_aff
*pa1
,
3059 __isl_take isl_pw_aff
*pa2
)
3061 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_gt_map_aligned
);
3064 /* Return a set containing those elements in the shared domain
3065 * of the elements of list1 and list2 where each element in list1
3066 * has the relation specified by "fn" with each element in list2.
3068 static __isl_give isl_set
*pw_aff_list_set(__isl_take isl_pw_aff_list
*list1
,
3069 __isl_take isl_pw_aff_list
*list2
,
3070 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3071 __isl_take isl_pw_aff
*pwaff2
))
3077 if (!list1
|| !list2
)
3080 ctx
= isl_pw_aff_list_get_ctx(list1
);
3081 if (list1
->n
< 1 || list2
->n
< 1)
3082 isl_die(ctx
, isl_error_invalid
,
3083 "list should contain at least one element", goto error
);
3085 set
= isl_set_universe(isl_pw_aff_get_domain_space(list1
->p
[0]));
3086 for (i
= 0; i
< list1
->n
; ++i
)
3087 for (j
= 0; j
< list2
->n
; ++j
) {
3090 set_ij
= fn(isl_pw_aff_copy(list1
->p
[i
]),
3091 isl_pw_aff_copy(list2
->p
[j
]));
3092 set
= isl_set_intersect(set
, set_ij
);
3095 isl_pw_aff_list_free(list1
);
3096 isl_pw_aff_list_free(list2
);
3099 isl_pw_aff_list_free(list1
);
3100 isl_pw_aff_list_free(list2
);
3104 /* Return a set containing those elements in the shared domain
3105 * of the elements of list1 and list2 where each element in list1
3106 * is equal to each element in list2.
3108 __isl_give isl_set
*isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list
*list1
,
3109 __isl_take isl_pw_aff_list
*list2
)
3111 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_eq_set
);
3114 __isl_give isl_set
*isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list
*list1
,
3115 __isl_take isl_pw_aff_list
*list2
)
3117 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ne_set
);
3120 /* Return a set containing those elements in the shared domain
3121 * of the elements of list1 and list2 where each element in list1
3122 * is less than or equal to each element in list2.
3124 __isl_give isl_set
*isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list
*list1
,
3125 __isl_take isl_pw_aff_list
*list2
)
3127 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_le_set
);
3130 __isl_give isl_set
*isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list
*list1
,
3131 __isl_take isl_pw_aff_list
*list2
)
3133 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_lt_set
);
3136 __isl_give isl_set
*isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list
*list1
,
3137 __isl_take isl_pw_aff_list
*list2
)
3139 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ge_set
);
3142 __isl_give isl_set
*isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list
*list1
,
3143 __isl_take isl_pw_aff_list
*list2
)
3145 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_gt_set
);
3149 /* Return a set containing those elements in the shared domain
3150 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
3152 static __isl_give isl_set
*pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3153 __isl_take isl_pw_aff
*pwaff2
)
3155 isl_set
*set_lt
, *set_gt
;
3157 set_lt
= isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1
),
3158 isl_pw_aff_copy(pwaff2
));
3159 set_gt
= isl_pw_aff_gt_set(pwaff1
, pwaff2
);
3160 return isl_set_union_disjoint(set_lt
, set_gt
);
3163 __isl_give isl_set
*isl_pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3164 __isl_take isl_pw_aff
*pwaff2
)
3166 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ne_set
);
3169 __isl_give isl_pw_aff
*isl_pw_aff_scale_down(__isl_take isl_pw_aff
*pwaff
,
3174 if (isl_int_is_one(v
))
3176 if (!isl_int_is_pos(v
))
3177 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
3178 "factor needs to be positive",
3179 return isl_pw_aff_free(pwaff
));
3180 pwaff
= isl_pw_aff_cow(pwaff
);
3186 for (i
= 0; i
< pwaff
->n
; ++i
) {
3187 pwaff
->p
[i
].aff
= isl_aff_scale_down(pwaff
->p
[i
].aff
, v
);
3188 if (!pwaff
->p
[i
].aff
)
3189 return isl_pw_aff_free(pwaff
);
3195 __isl_give isl_pw_aff
*isl_pw_aff_floor(__isl_take isl_pw_aff
*pwaff
)
3199 pwaff
= isl_pw_aff_cow(pwaff
);
3205 for (i
= 0; i
< pwaff
->n
; ++i
) {
3206 pwaff
->p
[i
].aff
= isl_aff_floor(pwaff
->p
[i
].aff
);
3207 if (!pwaff
->p
[i
].aff
)
3208 return isl_pw_aff_free(pwaff
);
3214 __isl_give isl_pw_aff
*isl_pw_aff_ceil(__isl_take isl_pw_aff
*pwaff
)
3218 pwaff
= isl_pw_aff_cow(pwaff
);
3224 for (i
= 0; i
< pwaff
->n
; ++i
) {
3225 pwaff
->p
[i
].aff
= isl_aff_ceil(pwaff
->p
[i
].aff
);
3226 if (!pwaff
->p
[i
].aff
)
3227 return isl_pw_aff_free(pwaff
);
3233 /* Assuming that "cond1" and "cond2" are disjoint,
3234 * return an affine expression that is equal to pwaff1 on cond1
3235 * and to pwaff2 on cond2.
3237 static __isl_give isl_pw_aff
*isl_pw_aff_select(
3238 __isl_take isl_set
*cond1
, __isl_take isl_pw_aff
*pwaff1
,
3239 __isl_take isl_set
*cond2
, __isl_take isl_pw_aff
*pwaff2
)
3241 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, cond1
);
3242 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, cond2
);
3244 return isl_pw_aff_add_disjoint(pwaff1
, pwaff2
);
3247 /* Return an affine expression that is equal to pwaff_true for elements
3248 * where "cond" is non-zero and to pwaff_false for elements where "cond"
3250 * That is, return cond ? pwaff_true : pwaff_false;
3252 * If "cond" involves and NaN, then we conservatively return a NaN
3253 * on its entire domain. In principle, we could consider the pieces
3254 * where it is NaN separately from those where it is not.
3256 * If "pwaff_true" and "pwaff_false" are obviously equal to each other,
3257 * then only use the domain of "cond" to restrict the domain.
3259 __isl_give isl_pw_aff
*isl_pw_aff_cond(__isl_take isl_pw_aff
*cond
,
3260 __isl_take isl_pw_aff
*pwaff_true
, __isl_take isl_pw_aff
*pwaff_false
)
3262 isl_set
*cond_true
, *cond_false
;
3267 if (isl_pw_aff_involves_nan(cond
)) {
3268 isl_space
*space
= isl_pw_aff_get_domain_space(cond
);
3269 isl_local_space
*ls
= isl_local_space_from_space(space
);
3270 isl_pw_aff_free(cond
);
3271 isl_pw_aff_free(pwaff_true
);
3272 isl_pw_aff_free(pwaff_false
);
3273 return isl_pw_aff_nan_on_domain(ls
);
3276 pwaff_true
= isl_pw_aff_align_params(pwaff_true
,
3277 isl_pw_aff_get_space(pwaff_false
));
3278 pwaff_false
= isl_pw_aff_align_params(pwaff_false
,
3279 isl_pw_aff_get_space(pwaff_true
));
3280 equal
= isl_pw_aff_plain_is_equal(pwaff_true
, pwaff_false
);
3286 dom
= isl_set_coalesce(isl_pw_aff_domain(cond
));
3287 isl_pw_aff_free(pwaff_false
);
3288 return isl_pw_aff_intersect_domain(pwaff_true
, dom
);
3291 cond_true
= isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond
));
3292 cond_false
= isl_pw_aff_zero_set(cond
);
3293 return isl_pw_aff_select(cond_true
, pwaff_true
,
3294 cond_false
, pwaff_false
);
3296 isl_pw_aff_free(cond
);
3297 isl_pw_aff_free(pwaff_true
);
3298 isl_pw_aff_free(pwaff_false
);
3302 isl_bool
isl_aff_is_cst(__isl_keep isl_aff
*aff
)
3305 return isl_bool_error
;
3307 return isl_seq_first_non_zero(aff
->v
->el
+ 2, aff
->v
->size
- 2) == -1;
3310 /* Check whether pwaff is a piecewise constant.
3312 isl_bool
isl_pw_aff_is_cst(__isl_keep isl_pw_aff
*pwaff
)
3317 return isl_bool_error
;
3319 for (i
= 0; i
< pwaff
->n
; ++i
) {
3320 isl_bool is_cst
= isl_aff_is_cst(pwaff
->p
[i
].aff
);
3321 if (is_cst
< 0 || !is_cst
)
3325 return isl_bool_true
;
3328 /* Are all elements of "mpa" piecewise constants?
3330 isl_bool
isl_multi_pw_aff_is_cst(__isl_keep isl_multi_pw_aff
*mpa
)
3335 return isl_bool_error
;
3337 for (i
= 0; i
< mpa
->n
; ++i
) {
3338 isl_bool is_cst
= isl_pw_aff_is_cst(mpa
->u
.p
[i
]);
3339 if (is_cst
< 0 || !is_cst
)
3343 return isl_bool_true
;
3346 /* Return the product of "aff1" and "aff2".
3348 * If either of the two is NaN, then the result is NaN.
3350 * Otherwise, at least one of "aff1" or "aff2" needs to be a constant.
3352 __isl_give isl_aff
*isl_aff_mul(__isl_take isl_aff
*aff1
,
3353 __isl_take isl_aff
*aff2
)
3358 if (isl_aff_is_nan(aff1
)) {
3362 if (isl_aff_is_nan(aff2
)) {
3367 if (!isl_aff_is_cst(aff2
) && isl_aff_is_cst(aff1
))
3368 return isl_aff_mul(aff2
, aff1
);
3370 if (!isl_aff_is_cst(aff2
))
3371 isl_die(isl_aff_get_ctx(aff1
), isl_error_invalid
,
3372 "at least one affine expression should be constant",
3375 aff1
= isl_aff_cow(aff1
);
3379 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[1]);
3380 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[0]);
3390 /* Divide "aff1" by "aff2", assuming "aff2" is a constant.
3392 * If either of the two is NaN, then the result is NaN.
3394 __isl_give isl_aff
*isl_aff_div(__isl_take isl_aff
*aff1
,
3395 __isl_take isl_aff
*aff2
)
3403 if (isl_aff_is_nan(aff1
)) {
3407 if (isl_aff_is_nan(aff2
)) {
3412 is_cst
= isl_aff_is_cst(aff2
);
3416 isl_die(isl_aff_get_ctx(aff2
), isl_error_invalid
,
3417 "second argument should be a constant", goto error
);
3422 neg
= isl_int_is_neg(aff2
->v
->el
[1]);
3424 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3425 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3428 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[0]);
3429 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[1]);
3432 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3433 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3444 static __isl_give isl_pw_aff
*pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3445 __isl_take isl_pw_aff
*pwaff2
)
3447 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_add
);
3450 __isl_give isl_pw_aff
*isl_pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3451 __isl_take isl_pw_aff
*pwaff2
)
3453 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_add
);
3456 __isl_give isl_pw_aff
*isl_pw_aff_union_add(__isl_take isl_pw_aff
*pwaff1
,
3457 __isl_take isl_pw_aff
*pwaff2
)
3459 return isl_pw_aff_union_add_(pwaff1
, pwaff2
);
3462 static __isl_give isl_pw_aff
*pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
3463 __isl_take isl_pw_aff
*pwaff2
)
3465 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_mul
);
3468 __isl_give isl_pw_aff
*isl_pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
3469 __isl_take isl_pw_aff
*pwaff2
)
3471 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_mul
);
3474 static __isl_give isl_pw_aff
*pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3475 __isl_take isl_pw_aff
*pa2
)
3477 return isl_pw_aff_on_shared_domain(pa1
, pa2
, &isl_aff_div
);
3480 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
3482 __isl_give isl_pw_aff
*isl_pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3483 __isl_take isl_pw_aff
*pa2
)
3487 is_cst
= isl_pw_aff_is_cst(pa2
);
3491 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3492 "second argument should be a piecewise constant",
3494 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_div
);
3496 isl_pw_aff_free(pa1
);
3497 isl_pw_aff_free(pa2
);
3501 /* Compute the quotient of the integer division of "pa1" by "pa2"
3502 * with rounding towards zero.
3503 * "pa2" is assumed to be a piecewise constant.
3505 * In particular, return
3507 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
3510 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_q(__isl_take isl_pw_aff
*pa1
,
3511 __isl_take isl_pw_aff
*pa2
)
3517 is_cst
= isl_pw_aff_is_cst(pa2
);
3521 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3522 "second argument should be a piecewise constant",
3525 pa1
= isl_pw_aff_div(pa1
, pa2
);
3527 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1
));
3528 f
= isl_pw_aff_floor(isl_pw_aff_copy(pa1
));
3529 c
= isl_pw_aff_ceil(pa1
);
3530 return isl_pw_aff_cond(isl_set_indicator_function(cond
), f
, c
);
3532 isl_pw_aff_free(pa1
);
3533 isl_pw_aff_free(pa2
);
3537 /* Compute the remainder of the integer division of "pa1" by "pa2"
3538 * with rounding towards zero.
3539 * "pa2" is assumed to be a piecewise constant.
3541 * In particular, return
3543 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
3546 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_r(__isl_take isl_pw_aff
*pa1
,
3547 __isl_take isl_pw_aff
*pa2
)
3552 is_cst
= isl_pw_aff_is_cst(pa2
);
3556 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3557 "second argument should be a piecewise constant",
3559 res
= isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1
), isl_pw_aff_copy(pa2
));
3560 res
= isl_pw_aff_mul(pa2
, res
);
3561 res
= isl_pw_aff_sub(pa1
, res
);
3564 isl_pw_aff_free(pa1
);
3565 isl_pw_aff_free(pa2
);
3569 /* Does either of "pa1" or "pa2" involve any NaN2?
3571 static isl_bool
either_involves_nan(__isl_keep isl_pw_aff
*pa1
,
3572 __isl_keep isl_pw_aff
*pa2
)
3576 has_nan
= isl_pw_aff_involves_nan(pa1
);
3577 if (has_nan
< 0 || has_nan
)
3579 return isl_pw_aff_involves_nan(pa2
);
3582 /* Replace "pa1" and "pa2" (at least one of which involves a NaN)
3583 * by a NaN on their shared domain.
3585 * In principle, the result could be refined to only being NaN
3586 * on the parts of this domain where at least one of "pa1" or "pa2" is NaN.
3588 static __isl_give isl_pw_aff
*replace_by_nan(__isl_take isl_pw_aff
*pa1
,
3589 __isl_take isl_pw_aff
*pa2
)
3591 isl_local_space
*ls
;
3595 dom
= isl_set_intersect(isl_pw_aff_domain(pa1
), isl_pw_aff_domain(pa2
));
3596 ls
= isl_local_space_from_space(isl_set_get_space(dom
));
3597 pa
= isl_pw_aff_nan_on_domain(ls
);
3598 pa
= isl_pw_aff_intersect_domain(pa
, dom
);
3603 static __isl_give isl_pw_aff
*pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3604 __isl_take isl_pw_aff
*pwaff2
)
3609 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3610 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3611 le
= isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1
),
3612 isl_pw_aff_copy(pwaff2
));
3613 dom
= isl_set_subtract(dom
, isl_set_copy(le
));
3614 return isl_pw_aff_select(le
, pwaff1
, dom
, pwaff2
);
3617 static __isl_give isl_pw_aff
*pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3618 __isl_take isl_pw_aff
*pwaff2
)
3623 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3624 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3625 ge
= isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1
),
3626 isl_pw_aff_copy(pwaff2
));
3627 dom
= isl_set_subtract(dom
, isl_set_copy(ge
));
3628 return isl_pw_aff_select(ge
, pwaff1
, dom
, pwaff2
);
3631 /* Return an expression for the minimum (if "max" is not set) or
3632 * the maximum (if "max" is set) of "pa1" and "pa2".
3633 * If either expression involves any NaN, then return a NaN
3634 * on the shared domain as result.
3636 static __isl_give isl_pw_aff
*pw_aff_min_max(__isl_take isl_pw_aff
*pa1
,
3637 __isl_take isl_pw_aff
*pa2
, int max
)
3641 has_nan
= either_involves_nan(pa1
, pa2
);
3643 pa1
= isl_pw_aff_free(pa1
);
3645 return replace_by_nan(pa1
, pa2
);
3648 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_max
);
3650 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_min
);
3653 /* Return an expression for the minimum of "pwaff1" and "pwaff2".
3655 __isl_give isl_pw_aff
*isl_pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3656 __isl_take isl_pw_aff
*pwaff2
)
3658 return pw_aff_min_max(pwaff1
, pwaff2
, 0);
3661 /* Return an expression for the maximum of "pwaff1" and "pwaff2".
3663 __isl_give isl_pw_aff
*isl_pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3664 __isl_take isl_pw_aff
*pwaff2
)
3666 return pw_aff_min_max(pwaff1
, pwaff2
, 1);
3669 static __isl_give isl_pw_aff
*pw_aff_list_reduce(
3670 __isl_take isl_pw_aff_list
*list
,
3671 __isl_give isl_pw_aff
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3672 __isl_take isl_pw_aff
*pwaff2
))
3681 ctx
= isl_pw_aff_list_get_ctx(list
);
3683 isl_die(ctx
, isl_error_invalid
,
3684 "list should contain at least one element", goto error
);
3686 res
= isl_pw_aff_copy(list
->p
[0]);
3687 for (i
= 1; i
< list
->n
; ++i
)
3688 res
= fn(res
, isl_pw_aff_copy(list
->p
[i
]));
3690 isl_pw_aff_list_free(list
);
3693 isl_pw_aff_list_free(list
);
3697 /* Return an isl_pw_aff that maps each element in the intersection of the
3698 * domains of the elements of list to the minimal corresponding affine
3701 __isl_give isl_pw_aff
*isl_pw_aff_list_min(__isl_take isl_pw_aff_list
*list
)
3703 return pw_aff_list_reduce(list
, &isl_pw_aff_min
);
3706 /* Return an isl_pw_aff that maps each element in the intersection of the
3707 * domains of the elements of list to the maximal corresponding affine
3710 __isl_give isl_pw_aff
*isl_pw_aff_list_max(__isl_take isl_pw_aff_list
*list
)
3712 return pw_aff_list_reduce(list
, &isl_pw_aff_max
);
3715 /* Mark the domains of "pwaff" as rational.
3717 __isl_give isl_pw_aff
*isl_pw_aff_set_rational(__isl_take isl_pw_aff
*pwaff
)
3721 pwaff
= isl_pw_aff_cow(pwaff
);
3727 for (i
= 0; i
< pwaff
->n
; ++i
) {
3728 pwaff
->p
[i
].set
= isl_set_set_rational(pwaff
->p
[i
].set
);
3729 if (!pwaff
->p
[i
].set
)
3730 return isl_pw_aff_free(pwaff
);
3736 /* Mark the domains of the elements of "list" as rational.
3738 __isl_give isl_pw_aff_list
*isl_pw_aff_list_set_rational(
3739 __isl_take isl_pw_aff_list
*list
)
3749 for (i
= 0; i
< n
; ++i
) {
3752 pa
= isl_pw_aff_list_get_pw_aff(list
, i
);
3753 pa
= isl_pw_aff_set_rational(pa
);
3754 list
= isl_pw_aff_list_set_pw_aff(list
, i
, pa
);
3760 /* Do the parameters of "aff" match those of "space"?
3762 isl_bool
isl_aff_matching_params(__isl_keep isl_aff
*aff
,
3763 __isl_keep isl_space
*space
)
3765 isl_space
*aff_space
;
3769 return isl_bool_error
;
3771 aff_space
= isl_aff_get_domain_space(aff
);
3773 match
= isl_space_has_equal_params(space
, aff_space
);
3775 isl_space_free(aff_space
);
3779 /* Check that the domain space of "aff" matches "space".
3781 isl_stat
isl_aff_check_match_domain_space(__isl_keep isl_aff
*aff
,
3782 __isl_keep isl_space
*space
)
3784 isl_space
*aff_space
;
3788 return isl_stat_error
;
3790 aff_space
= isl_aff_get_domain_space(aff
);
3792 match
= isl_space_has_equal_params(space
, aff_space
);
3796 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3797 "parameters don't match", goto error
);
3798 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
3799 aff_space
, isl_dim_set
);
3803 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3804 "domains don't match", goto error
);
3805 isl_space_free(aff_space
);
3808 isl_space_free(aff_space
);
3809 return isl_stat_error
;
3818 #include <isl_multi_no_explicit_domain.c>
3819 #include <isl_multi_templ.c>
3820 #include <isl_multi_apply_set.c>
3821 #include <isl_multi_cmp.c>
3822 #include <isl_multi_dims.c>
3823 #include <isl_multi_floor.c>
3824 #include <isl_multi_gist.c>
3828 /* Construct an isl_multi_aff living in "space" that corresponds
3829 * to the affine transformation matrix "mat".
3831 __isl_give isl_multi_aff
*isl_multi_aff_from_aff_mat(
3832 __isl_take isl_space
*space
, __isl_take isl_mat
*mat
)
3835 isl_local_space
*ls
= NULL
;
3836 isl_multi_aff
*ma
= NULL
;
3837 int n_row
, n_col
, n_out
, total
;
3843 ctx
= isl_mat_get_ctx(mat
);
3845 n_row
= isl_mat_rows(mat
);
3846 n_col
= isl_mat_cols(mat
);
3848 isl_die(ctx
, isl_error_invalid
,
3849 "insufficient number of rows", goto error
);
3851 isl_die(ctx
, isl_error_invalid
,
3852 "insufficient number of columns", goto error
);
3853 n_out
= isl_space_dim(space
, isl_dim_out
);
3854 total
= isl_space_dim(space
, isl_dim_all
);
3855 if (1 + n_out
!= n_row
|| 2 + total
!= n_row
+ n_col
)
3856 isl_die(ctx
, isl_error_invalid
,
3857 "dimension mismatch", goto error
);
3859 ma
= isl_multi_aff_zero(isl_space_copy(space
));
3860 ls
= isl_local_space_from_space(isl_space_domain(space
));
3862 for (i
= 0; i
< n_row
- 1; ++i
) {
3866 v
= isl_vec_alloc(ctx
, 1 + n_col
);
3869 isl_int_set(v
->el
[0], mat
->row
[0][0]);
3870 isl_seq_cpy(v
->el
+ 1, mat
->row
[1 + i
], n_col
);
3871 v
= isl_vec_normalize(v
);
3872 aff
= isl_aff_alloc_vec(isl_local_space_copy(ls
), v
);
3873 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3876 isl_local_space_free(ls
);
3880 isl_local_space_free(ls
);
3882 isl_multi_aff_free(ma
);
3886 /* Remove any internal structure of the domain of "ma".
3887 * If there is any such internal structure in the input,
3888 * then the name of the corresponding space is also removed.
3890 __isl_give isl_multi_aff
*isl_multi_aff_flatten_domain(
3891 __isl_take isl_multi_aff
*ma
)
3898 if (!ma
->space
->nested
[0])
3901 space
= isl_multi_aff_get_space(ma
);
3902 space
= isl_space_flatten_domain(space
);
3903 ma
= isl_multi_aff_reset_space(ma
, space
);
3908 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3909 * of the space to its domain.
3911 __isl_give isl_multi_aff
*isl_multi_aff_domain_map(__isl_take isl_space
*space
)
3914 isl_local_space
*ls
;
3919 if (!isl_space_is_map(space
))
3920 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3921 "not a map space", goto error
);
3923 n_in
= isl_space_dim(space
, isl_dim_in
);
3924 space
= isl_space_domain_map(space
);
3926 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3928 isl_space_free(space
);
3932 space
= isl_space_domain(space
);
3933 ls
= isl_local_space_from_space(space
);
3934 for (i
= 0; i
< n_in
; ++i
) {
3937 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3939 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3941 isl_local_space_free(ls
);
3944 isl_space_free(space
);
3948 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3949 * of the space to its range.
3951 __isl_give isl_multi_aff
*isl_multi_aff_range_map(__isl_take isl_space
*space
)
3954 isl_local_space
*ls
;
3959 if (!isl_space_is_map(space
))
3960 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3961 "not a map space", goto error
);
3963 n_in
= isl_space_dim(space
, isl_dim_in
);
3964 n_out
= isl_space_dim(space
, isl_dim_out
);
3965 space
= isl_space_range_map(space
);
3967 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3969 isl_space_free(space
);
3973 space
= isl_space_domain(space
);
3974 ls
= isl_local_space_from_space(space
);
3975 for (i
= 0; i
< n_out
; ++i
) {
3978 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3979 isl_dim_set
, n_in
+ i
);
3980 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3982 isl_local_space_free(ls
);
3985 isl_space_free(space
);
3989 /* Given a map space, return an isl_pw_multi_aff that maps a wrapped copy
3990 * of the space to its range.
3992 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_map(
3993 __isl_take isl_space
*space
)
3995 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_range_map(space
));
3998 /* Given the space of a set and a range of set dimensions,
3999 * construct an isl_multi_aff that projects out those dimensions.
4001 __isl_give isl_multi_aff
*isl_multi_aff_project_out_map(
4002 __isl_take isl_space
*space
, enum isl_dim_type type
,
4003 unsigned first
, unsigned n
)
4006 isl_local_space
*ls
;
4011 if (!isl_space_is_set(space
))
4012 isl_die(isl_space_get_ctx(space
), isl_error_unsupported
,
4013 "expecting set space", goto error
);
4014 if (type
!= isl_dim_set
)
4015 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
4016 "only set dimensions can be projected out", goto error
);
4018 dim
= isl_space_dim(space
, isl_dim_set
);
4019 if (first
+ n
> dim
)
4020 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
4021 "range out of bounds", goto error
);
4023 space
= isl_space_from_domain(space
);
4024 space
= isl_space_add_dims(space
, isl_dim_out
, dim
- n
);
4027 return isl_multi_aff_alloc(space
);
4029 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
4030 space
= isl_space_domain(space
);
4031 ls
= isl_local_space_from_space(space
);
4033 for (i
= 0; i
< first
; ++i
) {
4036 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4038 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4041 for (i
= 0; i
< dim
- (first
+ n
); ++i
) {
4044 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4045 isl_dim_set
, first
+ n
+ i
);
4046 ma
= isl_multi_aff_set_aff(ma
, first
+ i
, aff
);
4049 isl_local_space_free(ls
);
4052 isl_space_free(space
);
4056 /* Given the space of a set and a range of set dimensions,
4057 * construct an isl_pw_multi_aff that projects out those dimensions.
4059 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_project_out_map(
4060 __isl_take isl_space
*space
, enum isl_dim_type type
,
4061 unsigned first
, unsigned n
)
4065 ma
= isl_multi_aff_project_out_map(space
, type
, first
, n
);
4066 return isl_pw_multi_aff_from_multi_aff(ma
);
4069 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
4072 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_aff(
4073 __isl_take isl_multi_aff
*ma
)
4075 isl_set
*dom
= isl_set_universe(isl_multi_aff_get_domain_space(ma
));
4076 return isl_pw_multi_aff_alloc(dom
, ma
);
4079 /* Create a piecewise multi-affine expression in the given space that maps each
4080 * input dimension to the corresponding output dimension.
4082 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_identity(
4083 __isl_take isl_space
*space
)
4085 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space
));
4088 /* Exploit the equalities in "eq" to simplify the affine expressions.
4090 static __isl_give isl_multi_aff
*isl_multi_aff_substitute_equalities(
4091 __isl_take isl_multi_aff
*maff
, __isl_take isl_basic_set
*eq
)
4095 maff
= isl_multi_aff_cow(maff
);
4099 for (i
= 0; i
< maff
->n
; ++i
) {
4100 maff
->u
.p
[i
] = isl_aff_substitute_equalities(maff
->u
.p
[i
],
4101 isl_basic_set_copy(eq
));
4106 isl_basic_set_free(eq
);
4109 isl_basic_set_free(eq
);
4110 isl_multi_aff_free(maff
);
4114 __isl_give isl_multi_aff
*isl_multi_aff_scale(__isl_take isl_multi_aff
*maff
,
4119 maff
= isl_multi_aff_cow(maff
);
4123 for (i
= 0; i
< maff
->n
; ++i
) {
4124 maff
->u
.p
[i
] = isl_aff_scale(maff
->u
.p
[i
], f
);
4126 return isl_multi_aff_free(maff
);
4132 __isl_give isl_multi_aff
*isl_multi_aff_add_on_domain(__isl_keep isl_set
*dom
,
4133 __isl_take isl_multi_aff
*maff1
, __isl_take isl_multi_aff
*maff2
)
4135 maff1
= isl_multi_aff_add(maff1
, maff2
);
4136 maff1
= isl_multi_aff_gist(maff1
, isl_set_copy(dom
));
4140 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff
*maff
)
4148 /* Return the set of domain elements where "ma1" is lexicographically
4149 * smaller than or equal to "ma2".
4151 __isl_give isl_set
*isl_multi_aff_lex_le_set(__isl_take isl_multi_aff
*ma1
,
4152 __isl_take isl_multi_aff
*ma2
)
4154 return isl_multi_aff_lex_ge_set(ma2
, ma1
);
4157 /* Return the set of domain elements where "ma1" is lexicographically
4158 * smaller than "ma2".
4160 __isl_give isl_set
*isl_multi_aff_lex_lt_set(__isl_take isl_multi_aff
*ma1
,
4161 __isl_take isl_multi_aff
*ma2
)
4163 return isl_multi_aff_lex_gt_set(ma2
, ma1
);
4166 /* Return the set of domain elements where "ma1" and "ma2"
4169 static __isl_give isl_set
*isl_multi_aff_order_set(
4170 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
,
4171 __isl_give isl_map
*order(__isl_take isl_space
*set_space
))
4174 isl_map
*map1
, *map2
;
4177 map1
= isl_map_from_multi_aff_internal(ma1
);
4178 map2
= isl_map_from_multi_aff_internal(ma2
);
4179 map
= isl_map_range_product(map1
, map2
);
4180 space
= isl_space_range(isl_map_get_space(map
));
4181 space
= isl_space_domain(isl_space_unwrap(space
));
4183 map
= isl_map_intersect_range(map
, isl_map_wrap(ge
));
4185 return isl_map_domain(map
);
4188 /* Return the set of domain elements where "ma1" is lexicographically
4189 * greater than or equal to "ma2".
4191 __isl_give isl_set
*isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff
*ma1
,
4192 __isl_take isl_multi_aff
*ma2
)
4194 return isl_multi_aff_order_set(ma1
, ma2
, &isl_map_lex_ge
);
4197 /* Return the set of domain elements where "ma1" is lexicographically
4198 * greater than "ma2".
4200 __isl_give isl_set
*isl_multi_aff_lex_gt_set(__isl_take isl_multi_aff
*ma1
,
4201 __isl_take isl_multi_aff
*ma2
)
4203 return isl_multi_aff_order_set(ma1
, ma2
, &isl_map_lex_gt
);
4207 #define PW isl_pw_multi_aff
4209 #define EL isl_multi_aff
4211 #define EL_IS_ZERO is_empty
4215 #define IS_ZERO is_empty
4218 #undef DEFAULT_IS_ZERO
4219 #define DEFAULT_IS_ZERO 0
4223 #define NO_INSERT_DIMS
4227 #include <isl_pw_templ.c>
4228 #include <isl_pw_union_opt.c>
4233 #define BASE pw_multi_aff
4235 #include <isl_union_multi.c>
4236 #include <isl_union_neg.c>
4238 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmax(
4239 __isl_take isl_pw_multi_aff
*pma1
,
4240 __isl_take isl_pw_multi_aff
*pma2
)
4242 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4243 &isl_multi_aff_lex_ge_set
);
4246 /* Given two piecewise multi affine expressions, return a piecewise
4247 * multi-affine expression defined on the union of the definition domains
4248 * of the inputs that is equal to the lexicographic maximum of the two
4249 * inputs on each cell. If only one of the two inputs is defined on
4250 * a given cell, then it is considered to be the maximum.
4252 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmax(
4253 __isl_take isl_pw_multi_aff
*pma1
,
4254 __isl_take isl_pw_multi_aff
*pma2
)
4256 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4257 &pw_multi_aff_union_lexmax
);
4260 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmin(
4261 __isl_take isl_pw_multi_aff
*pma1
,
4262 __isl_take isl_pw_multi_aff
*pma2
)
4264 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4265 &isl_multi_aff_lex_le_set
);
4268 /* Given two piecewise multi affine expressions, return a piecewise
4269 * multi-affine expression defined on the union of the definition domains
4270 * of the inputs that is equal to the lexicographic minimum of the two
4271 * inputs on each cell. If only one of the two inputs is defined on
4272 * a given cell, then it is considered to be the minimum.
4274 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmin(
4275 __isl_take isl_pw_multi_aff
*pma1
,
4276 __isl_take isl_pw_multi_aff
*pma2
)
4278 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4279 &pw_multi_aff_union_lexmin
);
4282 static __isl_give isl_pw_multi_aff
*pw_multi_aff_add(
4283 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4285 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4286 &isl_multi_aff_add
);
4289 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_add(
4290 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4292 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4296 static __isl_give isl_pw_multi_aff
*pw_multi_aff_sub(
4297 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4299 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4300 &isl_multi_aff_sub
);
4303 /* Subtract "pma2" from "pma1" and return the result.
4305 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_sub(
4306 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4308 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4312 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_add(
4313 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4315 return isl_pw_multi_aff_union_add_(pma1
, pma2
);
4318 /* Compute the sum of "upa1" and "upa2" on the union of their domains,
4319 * with the actual sum on the shared domain and
4320 * the defined expression on the symmetric difference of the domains.
4322 __isl_give isl_union_pw_aff
*isl_union_pw_aff_union_add(
4323 __isl_take isl_union_pw_aff
*upa1
, __isl_take isl_union_pw_aff
*upa2
)
4325 return isl_union_pw_aff_union_add_(upa1
, upa2
);
4328 /* Compute the sum of "upma1" and "upma2" on the union of their domains,
4329 * with the actual sum on the shared domain and
4330 * the defined expression on the symmetric difference of the domains.
4332 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_union_add(
4333 __isl_take isl_union_pw_multi_aff
*upma1
,
4334 __isl_take isl_union_pw_multi_aff
*upma2
)
4336 return isl_union_pw_multi_aff_union_add_(upma1
, upma2
);
4339 /* Given two piecewise multi-affine expressions A -> B and C -> D,
4340 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
4342 static __isl_give isl_pw_multi_aff
*pw_multi_aff_product(
4343 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4347 isl_pw_multi_aff
*res
;
4352 n
= pma1
->n
* pma2
->n
;
4353 space
= isl_space_product(isl_space_copy(pma1
->dim
),
4354 isl_space_copy(pma2
->dim
));
4355 res
= isl_pw_multi_aff_alloc_size(space
, n
);
4357 for (i
= 0; i
< pma1
->n
; ++i
) {
4358 for (j
= 0; j
< pma2
->n
; ++j
) {
4362 domain
= isl_set_product(isl_set_copy(pma1
->p
[i
].set
),
4363 isl_set_copy(pma2
->p
[j
].set
));
4364 ma
= isl_multi_aff_product(
4365 isl_multi_aff_copy(pma1
->p
[i
].maff
),
4366 isl_multi_aff_copy(pma2
->p
[j
].maff
));
4367 res
= isl_pw_multi_aff_add_piece(res
, domain
, ma
);
4371 isl_pw_multi_aff_free(pma1
);
4372 isl_pw_multi_aff_free(pma2
);
4375 isl_pw_multi_aff_free(pma1
);
4376 isl_pw_multi_aff_free(pma2
);
4380 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_product(
4381 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4383 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4384 &pw_multi_aff_product
);
4387 /* Subtract the initial "n" elements in "ma" with coefficients in "c" and
4388 * denominator "denom".
4389 * "denom" is allowed to be negative, in which case the actual denominator
4390 * is -denom and the expressions are added instead.
4392 static __isl_give isl_aff
*subtract_initial(__isl_take isl_aff
*aff
,
4393 __isl_keep isl_multi_aff
*ma
, int n
, isl_int
*c
, isl_int denom
)
4399 first
= isl_seq_first_non_zero(c
, n
);
4403 sign
= isl_int_sgn(denom
);
4405 isl_int_abs(d
, denom
);
4406 for (i
= first
; i
< n
; ++i
) {
4409 if (isl_int_is_zero(c
[i
]))
4411 aff_i
= isl_multi_aff_get_aff(ma
, i
);
4412 aff_i
= isl_aff_scale(aff_i
, c
[i
]);
4413 aff_i
= isl_aff_scale_down(aff_i
, d
);
4415 aff
= isl_aff_sub(aff
, aff_i
);
4417 aff
= isl_aff_add(aff
, aff_i
);
4424 /* Extract an affine expression that expresses the output dimension "pos"
4425 * of "bmap" in terms of the parameters and input dimensions from
4427 * Note that this expression may involve integer divisions defined
4428 * in terms of parameters and input dimensions.
4429 * The equality may also involve references to earlier (but not later)
4430 * output dimensions. These are replaced by the corresponding elements
4433 * If the equality is of the form
4435 * f(i) + h(j) + a x + g(i) = 0,
4437 * with f(i) a linear combinations of the parameters and input dimensions,
4438 * g(i) a linear combination of integer divisions defined in terms of the same
4439 * and h(j) a linear combinations of earlier output dimensions,
4440 * then the affine expression is
4442 * (-f(i) - g(i))/a - h(j)/a
4444 * If the equality is of the form
4446 * f(i) + h(j) - a x + g(i) = 0,
4448 * then the affine expression is
4450 * (f(i) + g(i))/a - h(j)/(-a)
4453 * If "div" refers to an integer division (i.e., it is smaller than
4454 * the number of integer divisions), then the equality constraint
4455 * does involve an integer division (the one at position "div") that
4456 * is defined in terms of output dimensions. However, this integer
4457 * division can be eliminated by exploiting a pair of constraints
4458 * x >= l and x <= l + n, with n smaller than the coefficient of "div"
4459 * in the equality constraint. "ineq" refers to inequality x >= l, i.e.,
4461 * In particular, let
4463 * x = e(i) + m floor(...)
4465 * with e(i) the expression derived above and floor(...) the integer
4466 * division involving output dimensions.
4477 * e(i) + m floor(...) - l = (e(i) + m floor(...) - l) mod m
4478 * = (e(i) - l) mod m
4482 * x - l = (e(i) - l) mod m
4486 * x = ((e(i) - l) mod m) + l
4488 * The variable "shift" below contains the expression -l, which may
4489 * also involve a linear combination of earlier output dimensions.
4491 static __isl_give isl_aff
*extract_aff_from_equality(
4492 __isl_keep isl_basic_map
*bmap
, int pos
, int eq
, int div
, int ineq
,
4493 __isl_keep isl_multi_aff
*ma
)
4496 unsigned n_div
, n_out
;
4498 isl_local_space
*ls
;
4499 isl_aff
*aff
, *shift
;
4502 ctx
= isl_basic_map_get_ctx(bmap
);
4503 ls
= isl_basic_map_get_local_space(bmap
);
4504 ls
= isl_local_space_domain(ls
);
4505 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
4508 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
4509 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4510 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4511 if (isl_int_is_neg(bmap
->eq
[eq
][o_out
+ pos
])) {
4512 isl_seq_cpy(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4513 isl_seq_cpy(aff
->v
->el
+ 1 + o_out
,
4514 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4516 isl_seq_neg(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4517 isl_seq_neg(aff
->v
->el
+ 1 + o_out
,
4518 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4521 isl_int_set_si(aff
->v
->el
[1 + o_out
+ div
], 0);
4522 isl_int_abs(aff
->v
->el
[0], bmap
->eq
[eq
][o_out
+ pos
]);
4523 aff
= subtract_initial(aff
, ma
, pos
, bmap
->eq
[eq
] + o_out
,
4524 bmap
->eq
[eq
][o_out
+ pos
]);
4526 shift
= isl_aff_alloc(isl_local_space_copy(ls
));
4529 isl_seq_cpy(shift
->v
->el
+ 1, bmap
->ineq
[ineq
], o_out
);
4530 isl_seq_cpy(shift
->v
->el
+ 1 + o_out
,
4531 bmap
->ineq
[ineq
] + o_out
+ n_out
, n_div
);
4532 isl_int_set_si(shift
->v
->el
[0], 1);
4533 shift
= subtract_initial(shift
, ma
, pos
,
4534 bmap
->ineq
[ineq
] + o_out
, ctx
->negone
);
4535 aff
= isl_aff_add(aff
, isl_aff_copy(shift
));
4536 mod
= isl_val_int_from_isl_int(ctx
,
4537 bmap
->eq
[eq
][o_out
+ n_out
+ div
]);
4538 mod
= isl_val_abs(mod
);
4539 aff
= isl_aff_mod_val(aff
, mod
);
4540 aff
= isl_aff_sub(aff
, shift
);
4543 isl_local_space_free(ls
);
4546 isl_local_space_free(ls
);
4551 /* Given a basic map with output dimensions defined
4552 * in terms of the parameters input dimensions and earlier
4553 * output dimensions using an equality (and possibly a pair on inequalities),
4554 * extract an isl_aff that expresses output dimension "pos" in terms
4555 * of the parameters and input dimensions.
4556 * Note that this expression may involve integer divisions defined
4557 * in terms of parameters and input dimensions.
4558 * "ma" contains the expressions corresponding to earlier output dimensions.
4560 * This function shares some similarities with
4561 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
4563 static __isl_give isl_aff
*extract_isl_aff_from_basic_map(
4564 __isl_keep isl_basic_map
*bmap
, int pos
, __isl_keep isl_multi_aff
*ma
)
4571 eq
= isl_basic_map_output_defining_equality(bmap
, pos
, &div
, &ineq
);
4572 if (eq
>= bmap
->n_eq
)
4573 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4574 "unable to find suitable equality", return NULL
);
4575 aff
= extract_aff_from_equality(bmap
, pos
, eq
, div
, ineq
, ma
);
4577 aff
= isl_aff_remove_unused_divs(aff
);
4581 /* Given a basic map where each output dimension is defined
4582 * in terms of the parameters and input dimensions using an equality,
4583 * extract an isl_multi_aff that expresses the output dimensions in terms
4584 * of the parameters and input dimensions.
4586 static __isl_give isl_multi_aff
*extract_isl_multi_aff_from_basic_map(
4587 __isl_take isl_basic_map
*bmap
)
4596 ma
= isl_multi_aff_alloc(isl_basic_map_get_space(bmap
));
4597 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4599 for (i
= 0; i
< n_out
; ++i
) {
4602 aff
= extract_isl_aff_from_basic_map(bmap
, i
, ma
);
4603 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4606 isl_basic_map_free(bmap
);
4611 /* Given a basic set where each set dimension is defined
4612 * in terms of the parameters using an equality,
4613 * extract an isl_multi_aff that expresses the set dimensions in terms
4614 * of the parameters.
4616 __isl_give isl_multi_aff
*isl_multi_aff_from_basic_set_equalities(
4617 __isl_take isl_basic_set
*bset
)
4619 return extract_isl_multi_aff_from_basic_map(bset
);
4622 /* Create an isl_pw_multi_aff that is equivalent to
4623 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
4624 * The given basic map is such that each output dimension is defined
4625 * in terms of the parameters and input dimensions using an equality.
4627 * Since some applications expect the result of isl_pw_multi_aff_from_map
4628 * to only contain integer affine expressions, we compute the floor
4629 * of the expression before returning.
4631 * Remove all constraints involving local variables without
4632 * an explicit representation (resulting in the removal of those
4633 * local variables) prior to the actual extraction to ensure
4634 * that the local spaces in which the resulting affine expressions
4635 * are created do not contain any unknown local variables.
4636 * Removing such constraints is safe because constraints involving
4637 * unknown local variables are not used to determine whether
4638 * a basic map is obviously single-valued.
4640 static __isl_give isl_pw_multi_aff
*plain_pw_multi_aff_from_map(
4641 __isl_take isl_set
*domain
, __isl_take isl_basic_map
*bmap
)
4645 bmap
= isl_basic_map_drop_constraint_involving_unknown_divs(bmap
);
4646 ma
= extract_isl_multi_aff_from_basic_map(bmap
);
4647 ma
= isl_multi_aff_floor(ma
);
4648 return isl_pw_multi_aff_alloc(domain
, ma
);
4651 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4652 * This obviously only works if the input "map" is single-valued.
4653 * If so, we compute the lexicographic minimum of the image in the form
4654 * of an isl_pw_multi_aff. Since the image is unique, it is equal
4655 * to its lexicographic minimum.
4656 * If the input is not single-valued, we produce an error.
4658 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_base(
4659 __isl_take isl_map
*map
)
4663 isl_pw_multi_aff
*pma
;
4665 sv
= isl_map_is_single_valued(map
);
4669 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
4670 "map is not single-valued", goto error
);
4671 map
= isl_map_make_disjoint(map
);
4675 pma
= isl_pw_multi_aff_empty(isl_map_get_space(map
));
4677 for (i
= 0; i
< map
->n
; ++i
) {
4678 isl_pw_multi_aff
*pma_i
;
4679 isl_basic_map
*bmap
;
4680 bmap
= isl_basic_map_copy(map
->p
[i
]);
4681 pma_i
= isl_basic_map_lexmin_pw_multi_aff(bmap
);
4682 pma
= isl_pw_multi_aff_add_disjoint(pma
, pma_i
);
4692 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4693 * taking into account that the output dimension at position "d"
4694 * can be represented as
4696 * x = floor((e(...) + c1) / m)
4698 * given that constraint "i" is of the form
4700 * e(...) + c1 - m x >= 0
4703 * Let "map" be of the form
4707 * We construct a mapping
4709 * A -> [A -> x = floor(...)]
4711 * apply that to the map, obtaining
4713 * [A -> x = floor(...)] -> B
4715 * and equate dimension "d" to x.
4716 * We then compute a isl_pw_multi_aff representation of the resulting map
4717 * and plug in the mapping above.
4719 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_div(
4720 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
)
4724 isl_local_space
*ls
;
4732 isl_pw_multi_aff
*pma
;
4735 is_set
= isl_map_is_set(map
);
4739 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4740 ctx
= isl_map_get_ctx(map
);
4741 space
= isl_space_domain(isl_map_get_space(map
));
4742 n_in
= isl_space_dim(space
, isl_dim_set
);
4743 n
= isl_space_dim(space
, isl_dim_all
);
4745 v
= isl_vec_alloc(ctx
, 1 + 1 + n
);
4747 isl_int_neg(v
->el
[0], hull
->ineq
[i
][offset
+ d
]);
4748 isl_seq_cpy(v
->el
+ 1, hull
->ineq
[i
], 1 + n
);
4750 isl_basic_map_free(hull
);
4752 ls
= isl_local_space_from_space(isl_space_copy(space
));
4753 aff
= isl_aff_alloc_vec(ls
, v
);
4754 aff
= isl_aff_floor(aff
);
4756 isl_space_free(space
);
4757 ma
= isl_multi_aff_from_aff(aff
);
4759 ma
= isl_multi_aff_identity(isl_space_map_from_set(space
));
4760 ma
= isl_multi_aff_range_product(ma
,
4761 isl_multi_aff_from_aff(aff
));
4764 insert
= isl_map_from_multi_aff_internal(isl_multi_aff_copy(ma
));
4765 map
= isl_map_apply_domain(map
, insert
);
4766 map
= isl_map_equate(map
, isl_dim_in
, n_in
, isl_dim_out
, d
);
4767 pma
= isl_pw_multi_aff_from_map(map
);
4768 pma
= isl_pw_multi_aff_pullback_multi_aff(pma
, ma
);
4773 isl_basic_map_free(hull
);
4777 /* Is constraint "c" of the form
4779 * e(...) + c1 - m x >= 0
4783 * -e(...) + c2 + m x >= 0
4785 * where m > 1 and e only depends on parameters and input dimemnsions?
4787 * "offset" is the offset of the output dimensions
4788 * "pos" is the position of output dimension x.
4790 static int is_potential_div_constraint(isl_int
*c
, int offset
, int d
, int total
)
4792 if (isl_int_is_zero(c
[offset
+ d
]))
4794 if (isl_int_is_one(c
[offset
+ d
]))
4796 if (isl_int_is_negone(c
[offset
+ d
]))
4798 if (isl_seq_first_non_zero(c
+ offset
, d
) != -1)
4800 if (isl_seq_first_non_zero(c
+ offset
+ d
+ 1,
4801 total
- (offset
+ d
+ 1)) != -1)
4806 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4808 * As a special case, we first check if there is any pair of constraints,
4809 * shared by all the basic maps in "map" that force a given dimension
4810 * to be equal to the floor of some affine combination of the input dimensions.
4812 * In particular, if we can find two constraints
4814 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
4818 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
4820 * where m > 1 and e only depends on parameters and input dimemnsions,
4823 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
4825 * then we know that we can take
4827 * x = floor((e(...) + c1) / m)
4829 * without having to perform any computation.
4831 * Note that we know that
4835 * If c1 + c2 were 0, then we would have detected an equality during
4836 * simplification. If c1 + c2 were negative, then we would have detected
4839 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_div(
4840 __isl_take isl_map
*map
)
4846 isl_basic_map
*hull
;
4848 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
4853 dim
= isl_map_dim(map
, isl_dim_out
);
4854 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4855 total
= 1 + isl_basic_map_total_dim(hull
);
4857 for (d
= 0; d
< dim
; ++d
) {
4858 for (i
= 0; i
< n
; ++i
) {
4859 if (!is_potential_div_constraint(hull
->ineq
[i
],
4862 for (j
= i
+ 1; j
< n
; ++j
) {
4863 if (!isl_seq_is_neg(hull
->ineq
[i
] + 1,
4864 hull
->ineq
[j
] + 1, total
- 1))
4866 isl_int_add(sum
, hull
->ineq
[i
][0],
4868 if (isl_int_abs_lt(sum
,
4869 hull
->ineq
[i
][offset
+ d
]))
4876 if (isl_int_is_pos(hull
->ineq
[j
][offset
+ d
]))
4878 return pw_multi_aff_from_map_div(map
, hull
, d
, j
);
4882 isl_basic_map_free(hull
);
4883 return pw_multi_aff_from_map_base(map
);
4886 isl_basic_map_free(hull
);
4890 /* Given an affine expression
4892 * [A -> B] -> f(A,B)
4894 * construct an isl_multi_aff
4898 * such that dimension "d" in B' is set to "aff" and the remaining
4899 * dimensions are set equal to the corresponding dimensions in B.
4900 * "n_in" is the dimension of the space A.
4901 * "n_out" is the dimension of the space B.
4903 * If "is_set" is set, then the affine expression is of the form
4907 * and we construct an isl_multi_aff
4911 static __isl_give isl_multi_aff
*range_map(__isl_take isl_aff
*aff
, int d
,
4912 unsigned n_in
, unsigned n_out
, int is_set
)
4916 isl_space
*space
, *space2
;
4917 isl_local_space
*ls
;
4919 space
= isl_aff_get_domain_space(aff
);
4920 ls
= isl_local_space_from_space(isl_space_copy(space
));
4921 space2
= isl_space_copy(space
);
4923 space2
= isl_space_range(isl_space_unwrap(space2
));
4924 space
= isl_space_map_from_domain_and_range(space
, space2
);
4925 ma
= isl_multi_aff_alloc(space
);
4926 ma
= isl_multi_aff_set_aff(ma
, d
, aff
);
4928 for (i
= 0; i
< n_out
; ++i
) {
4931 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4932 isl_dim_set
, n_in
+ i
);
4933 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4936 isl_local_space_free(ls
);
4941 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4942 * taking into account that the dimension at position "d" can be written as
4944 * x = m a + f(..) (1)
4946 * where m is equal to "gcd".
4947 * "i" is the index of the equality in "hull" that defines f(..).
4948 * In particular, the equality is of the form
4950 * f(..) - x + m g(existentials) = 0
4954 * -f(..) + x + m g(existentials) = 0
4956 * We basically plug (1) into "map", resulting in a map with "a"
4957 * in the range instead of "x". The corresponding isl_pw_multi_aff
4958 * defining "a" is then plugged back into (1) to obtain a definition for "x".
4960 * Specifically, given the input map
4964 * We first wrap it into a set
4968 * and define (1) on top of the corresponding space, resulting in "aff".
4969 * We use this to create an isl_multi_aff that maps the output position "d"
4970 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
4971 * We plug this into the wrapped map, unwrap the result and compute the
4972 * corresponding isl_pw_multi_aff.
4973 * The result is an expression
4981 * so that we can plug that into "aff", after extending the latter to
4987 * If "map" is actually a set, then there is no "A" space, meaning
4988 * that we do not need to perform any wrapping, and that the result
4989 * of the recursive call is of the form
4993 * which is plugged into a mapping of the form
4997 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_stride(
4998 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
,
5003 isl_local_space
*ls
;
5006 isl_pw_multi_aff
*pma
, *id
;
5012 is_set
= isl_map_is_set(map
);
5016 n_in
= isl_basic_map_dim(hull
, isl_dim_in
);
5017 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5018 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5023 set
= isl_map_wrap(map
);
5024 space
= isl_space_map_from_set(isl_set_get_space(set
));
5025 ma
= isl_multi_aff_identity(space
);
5026 ls
= isl_local_space_from_space(isl_set_get_space(set
));
5027 aff
= isl_aff_alloc(ls
);
5029 isl_int_set_si(aff
->v
->el
[0], 1);
5030 if (isl_int_is_one(hull
->eq
[i
][o_out
+ d
]))
5031 isl_seq_neg(aff
->v
->el
+ 1, hull
->eq
[i
],
5034 isl_seq_cpy(aff
->v
->el
+ 1, hull
->eq
[i
],
5036 isl_int_set(aff
->v
->el
[1 + o_out
+ d
], gcd
);
5038 ma
= isl_multi_aff_set_aff(ma
, n_in
+ d
, isl_aff_copy(aff
));
5039 set
= isl_set_preimage_multi_aff(set
, ma
);
5041 ma
= range_map(aff
, d
, n_in
, n_out
, is_set
);
5046 map
= isl_set_unwrap(set
);
5047 pma
= isl_pw_multi_aff_from_map(map
);
5050 space
= isl_pw_multi_aff_get_domain_space(pma
);
5051 space
= isl_space_map_from_set(space
);
5052 id
= isl_pw_multi_aff_identity(space
);
5053 pma
= isl_pw_multi_aff_range_product(id
, pma
);
5055 id
= isl_pw_multi_aff_from_multi_aff(ma
);
5056 pma
= isl_pw_multi_aff_pullback_pw_multi_aff(id
, pma
);
5058 isl_basic_map_free(hull
);
5062 isl_basic_map_free(hull
);
5066 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
5067 * "hull" contains the equalities valid for "map".
5069 * Check if any of the output dimensions is "strided".
5070 * That is, we check if it can be written as
5074 * with m greater than 1, a some combination of existentially quantified
5075 * variables and f an expression in the parameters and input dimensions.
5076 * If so, we remove the stride in pw_multi_aff_from_map_stride.
5078 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
5081 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_strides(
5082 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
)
5091 n_div
= isl_basic_map_dim(hull
, isl_dim_div
);
5092 o_div
= isl_basic_map_offset(hull
, isl_dim_div
);
5095 isl_basic_map_free(hull
);
5096 return pw_multi_aff_from_map_check_div(map
);
5101 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5102 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5104 for (i
= 0; i
< n_out
; ++i
) {
5105 for (j
= 0; j
< hull
->n_eq
; ++j
) {
5106 isl_int
*eq
= hull
->eq
[j
];
5107 isl_pw_multi_aff
*res
;
5109 if (!isl_int_is_one(eq
[o_out
+ i
]) &&
5110 !isl_int_is_negone(eq
[o_out
+ i
]))
5112 if (isl_seq_first_non_zero(eq
+ o_out
, i
) != -1)
5114 if (isl_seq_first_non_zero(eq
+ o_out
+ i
+ 1,
5115 n_out
- (i
+ 1)) != -1)
5117 isl_seq_gcd(eq
+ o_div
, n_div
, &gcd
);
5118 if (isl_int_is_zero(gcd
))
5120 if (isl_int_is_one(gcd
))
5123 res
= pw_multi_aff_from_map_stride(map
, hull
,
5131 isl_basic_map_free(hull
);
5132 return pw_multi_aff_from_map_check_div(map
);
5135 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
5137 * As a special case, we first check if all output dimensions are uniquely
5138 * defined in terms of the parameters and input dimensions over the entire
5139 * domain. If so, we extract the desired isl_pw_multi_aff directly
5140 * from the affine hull of "map" and its domain.
5142 * Otherwise, continue with pw_multi_aff_from_map_check_strides for more
5145 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_map(__isl_take isl_map
*map
)
5148 isl_basic_map
*hull
;
5153 if (isl_map_n_basic_map(map
) == 1) {
5154 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5155 hull
= isl_basic_map_plain_affine_hull(hull
);
5156 sv
= isl_basic_map_plain_is_single_valued(hull
);
5158 return plain_pw_multi_aff_from_map(isl_map_domain(map
),
5160 isl_basic_map_free(hull
);
5162 map
= isl_map_detect_equalities(map
);
5163 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5164 sv
= isl_basic_map_plain_is_single_valued(hull
);
5166 return plain_pw_multi_aff_from_map(isl_map_domain(map
), hull
);
5168 return pw_multi_aff_from_map_check_strides(map
, hull
);
5169 isl_basic_map_free(hull
);
5174 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_set(__isl_take isl_set
*set
)
5176 return isl_pw_multi_aff_from_map(set
);
5179 /* Convert "map" into an isl_pw_multi_aff (if possible) and
5182 static isl_stat
pw_multi_aff_from_map(__isl_take isl_map
*map
, void *user
)
5184 isl_union_pw_multi_aff
**upma
= user
;
5185 isl_pw_multi_aff
*pma
;
5187 pma
= isl_pw_multi_aff_from_map(map
);
5188 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5190 return *upma
? isl_stat_ok
: isl_stat_error
;
5193 /* Create an isl_union_pw_multi_aff with the given isl_aff on a universe
5196 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_aff(
5197 __isl_take isl_aff
*aff
)
5200 isl_pw_multi_aff
*pma
;
5202 ma
= isl_multi_aff_from_aff(aff
);
5203 pma
= isl_pw_multi_aff_from_multi_aff(ma
);
5204 return isl_union_pw_multi_aff_from_pw_multi_aff(pma
);
5207 /* Try and create an isl_union_pw_multi_aff that is equivalent
5208 * to the given isl_union_map.
5209 * The isl_union_map is required to be single-valued in each space.
5210 * Otherwise, an error is produced.
5212 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_map(
5213 __isl_take isl_union_map
*umap
)
5216 isl_union_pw_multi_aff
*upma
;
5218 space
= isl_union_map_get_space(umap
);
5219 upma
= isl_union_pw_multi_aff_empty(space
);
5220 if (isl_union_map_foreach_map(umap
, &pw_multi_aff_from_map
, &upma
) < 0)
5221 upma
= isl_union_pw_multi_aff_free(upma
);
5222 isl_union_map_free(umap
);
5227 /* Try and create an isl_union_pw_multi_aff that is equivalent
5228 * to the given isl_union_set.
5229 * The isl_union_set is required to be a singleton in each space.
5230 * Otherwise, an error is produced.
5232 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_set(
5233 __isl_take isl_union_set
*uset
)
5235 return isl_union_pw_multi_aff_from_union_map(uset
);
5238 /* Return the piecewise affine expression "set ? 1 : 0".
5240 __isl_give isl_pw_aff
*isl_set_indicator_function(__isl_take isl_set
*set
)
5243 isl_space
*space
= isl_set_get_space(set
);
5244 isl_local_space
*ls
= isl_local_space_from_space(space
);
5245 isl_aff
*zero
= isl_aff_zero_on_domain(isl_local_space_copy(ls
));
5246 isl_aff
*one
= isl_aff_zero_on_domain(ls
);
5248 one
= isl_aff_add_constant_si(one
, 1);
5249 pa
= isl_pw_aff_alloc(isl_set_copy(set
), one
);
5250 set
= isl_set_complement(set
);
5251 pa
= isl_pw_aff_add_disjoint(pa
, isl_pw_aff_alloc(set
, zero
));
5256 /* Plug in "subs" for dimension "type", "pos" of "aff".
5258 * Let i be the dimension to replace and let "subs" be of the form
5262 * and "aff" of the form
5268 * (a f + d g')/(m d)
5270 * where g' is the result of plugging in "subs" in each of the integer
5273 __isl_give isl_aff
*isl_aff_substitute(__isl_take isl_aff
*aff
,
5274 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
5279 aff
= isl_aff_cow(aff
);
5281 return isl_aff_free(aff
);
5283 ctx
= isl_aff_get_ctx(aff
);
5284 if (!isl_space_is_equal(aff
->ls
->dim
, subs
->ls
->dim
))
5285 isl_die(ctx
, isl_error_invalid
,
5286 "spaces don't match", return isl_aff_free(aff
));
5287 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
5288 isl_die(ctx
, isl_error_unsupported
,
5289 "cannot handle divs yet", return isl_aff_free(aff
));
5291 aff
->ls
= isl_local_space_substitute(aff
->ls
, type
, pos
, subs
);
5293 return isl_aff_free(aff
);
5295 aff
->v
= isl_vec_cow(aff
->v
);
5297 return isl_aff_free(aff
);
5299 pos
+= isl_local_space_offset(aff
->ls
, type
);
5302 isl_seq_substitute(aff
->v
->el
, pos
, subs
->v
->el
,
5303 aff
->v
->size
, subs
->v
->size
, v
);
5309 /* Plug in "subs" for dimension "type", "pos" in each of the affine
5310 * expressions in "maff".
5312 __isl_give isl_multi_aff
*isl_multi_aff_substitute(
5313 __isl_take isl_multi_aff
*maff
, enum isl_dim_type type
, unsigned pos
,
5314 __isl_keep isl_aff
*subs
)
5318 maff
= isl_multi_aff_cow(maff
);
5320 return isl_multi_aff_free(maff
);
5322 if (type
== isl_dim_in
)
5325 for (i
= 0; i
< maff
->n
; ++i
) {
5326 maff
->u
.p
[i
] = isl_aff_substitute(maff
->u
.p
[i
],
5329 return isl_multi_aff_free(maff
);
5335 /* Plug in "subs" for dimension "type", "pos" of "pma".
5337 * pma is of the form
5341 * while subs is of the form
5343 * v' = B_j(v) -> S_j
5345 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
5346 * has a contribution in the result, in particular
5348 * C_ij(S_j) -> M_i(S_j)
5350 * Note that plugging in S_j in C_ij may also result in an empty set
5351 * and this contribution should simply be discarded.
5353 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_substitute(
5354 __isl_take isl_pw_multi_aff
*pma
, enum isl_dim_type type
, unsigned pos
,
5355 __isl_keep isl_pw_aff
*subs
)
5358 isl_pw_multi_aff
*res
;
5361 return isl_pw_multi_aff_free(pma
);
5363 n
= pma
->n
* subs
->n
;
5364 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma
->dim
), n
);
5366 for (i
= 0; i
< pma
->n
; ++i
) {
5367 for (j
= 0; j
< subs
->n
; ++j
) {
5369 isl_multi_aff
*res_ij
;
5372 common
= isl_set_intersect(
5373 isl_set_copy(pma
->p
[i
].set
),
5374 isl_set_copy(subs
->p
[j
].set
));
5375 common
= isl_set_substitute(common
,
5376 type
, pos
, subs
->p
[j
].aff
);
5377 empty
= isl_set_plain_is_empty(common
);
5378 if (empty
< 0 || empty
) {
5379 isl_set_free(common
);
5385 res_ij
= isl_multi_aff_substitute(
5386 isl_multi_aff_copy(pma
->p
[i
].maff
),
5387 type
, pos
, subs
->p
[j
].aff
);
5389 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5393 isl_pw_multi_aff_free(pma
);
5396 isl_pw_multi_aff_free(pma
);
5397 isl_pw_multi_aff_free(res
);
5401 /* Compute the preimage of a range of dimensions in the affine expression "src"
5402 * under "ma" and put the result in "dst". The number of dimensions in "src"
5403 * that precede the range is given by "n_before". The number of dimensions
5404 * in the range is given by the number of output dimensions of "ma".
5405 * The number of dimensions that follow the range is given by "n_after".
5406 * If "has_denom" is set (to one),
5407 * then "src" and "dst" have an extra initial denominator.
5408 * "n_div_ma" is the number of existentials in "ma"
5409 * "n_div_bset" is the number of existentials in "src"
5410 * The resulting "dst" (which is assumed to have been allocated by
5411 * the caller) contains coefficients for both sets of existentials,
5412 * first those in "ma" and then those in "src".
5413 * f, c1, c2 and g are temporary objects that have been initialized
5416 * Let src represent the expression
5418 * (a(p) + f_u u + b v + f_w w + c(divs))/d
5420 * and let ma represent the expressions
5422 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
5424 * We start out with the following expression for dst:
5426 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
5428 * with the multiplication factor f initially equal to 1
5429 * and f \sum_i b_i v_i kept separately.
5430 * For each x_i that we substitute, we multiply the numerator
5431 * (and denominator) of dst by c_1 = m_i and add the numerator
5432 * of the x_i expression multiplied by c_2 = f b_i,
5433 * after removing the common factors of c_1 and c_2.
5434 * The multiplication factor f also needs to be multiplied by c_1
5435 * for the next x_j, j > i.
5437 void isl_seq_preimage(isl_int
*dst
, isl_int
*src
,
5438 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
,
5439 int n_div_ma
, int n_div_bmap
,
5440 isl_int f
, isl_int c1
, isl_int c2
, isl_int g
, int has_denom
)
5443 int n_param
, n_in
, n_out
;
5446 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
5447 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
5448 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
5450 isl_seq_cpy(dst
, src
, has_denom
+ 1 + n_param
+ n_before
);
5451 o_dst
= o_src
= has_denom
+ 1 + n_param
+ n_before
;
5452 isl_seq_clr(dst
+ o_dst
, n_in
);
5455 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_after
);
5458 isl_seq_clr(dst
+ o_dst
, n_div_ma
);
5460 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_div_bmap
);
5462 isl_int_set_si(f
, 1);
5464 for (i
= 0; i
< n_out
; ++i
) {
5465 int offset
= has_denom
+ 1 + n_param
+ n_before
+ i
;
5467 if (isl_int_is_zero(src
[offset
]))
5469 isl_int_set(c1
, ma
->u
.p
[i
]->v
->el
[0]);
5470 isl_int_mul(c2
, f
, src
[offset
]);
5471 isl_int_gcd(g
, c1
, c2
);
5472 isl_int_divexact(c1
, c1
, g
);
5473 isl_int_divexact(c2
, c2
, g
);
5475 isl_int_mul(f
, f
, c1
);
5478 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5479 c2
, ma
->u
.p
[i
]->v
->el
+ o_src
, 1 + n_param
);
5480 o_dst
+= 1 + n_param
;
5481 o_src
+= 1 + n_param
;
5482 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_before
);
5484 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5485 c2
, ma
->u
.p
[i
]->v
->el
+ o_src
, n_in
);
5488 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_after
);
5490 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5491 c2
, ma
->u
.p
[i
]->v
->el
+ o_src
, n_div_ma
);
5494 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_div_bmap
);
5496 isl_int_mul(dst
[0], dst
[0], c1
);
5500 /* Compute the pullback of "aff" by the function represented by "ma".
5501 * In other words, plug in "ma" in "aff". The result is an affine expression
5502 * defined over the domain space of "ma".
5504 * If "aff" is represented by
5506 * (a(p) + b x + c(divs))/d
5508 * and ma is represented by
5510 * x = D(p) + F(y) + G(divs')
5512 * then the result is
5514 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
5516 * The divs in the local space of the input are similarly adjusted
5517 * through a call to isl_local_space_preimage_multi_aff.
5519 __isl_give isl_aff
*isl_aff_pullback_multi_aff(__isl_take isl_aff
*aff
,
5520 __isl_take isl_multi_aff
*ma
)
5522 isl_aff
*res
= NULL
;
5523 isl_local_space
*ls
;
5524 int n_div_aff
, n_div_ma
;
5525 isl_int f
, c1
, c2
, g
;
5527 ma
= isl_multi_aff_align_divs(ma
);
5531 n_div_aff
= isl_aff_dim(aff
, isl_dim_div
);
5532 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
5534 ls
= isl_aff_get_domain_local_space(aff
);
5535 ls
= isl_local_space_preimage_multi_aff(ls
, isl_multi_aff_copy(ma
));
5536 res
= isl_aff_alloc(ls
);
5545 isl_seq_preimage(res
->v
->el
, aff
->v
->el
, ma
, 0, 0, n_div_ma
, n_div_aff
,
5554 isl_multi_aff_free(ma
);
5555 res
= isl_aff_normalize(res
);
5559 isl_multi_aff_free(ma
);
5564 /* Compute the pullback of "aff1" by the function represented by "aff2".
5565 * In other words, plug in "aff2" in "aff1". The result is an affine expression
5566 * defined over the domain space of "aff1".
5568 * The domain of "aff1" should match the range of "aff2", which means
5569 * that it should be single-dimensional.
5571 __isl_give isl_aff
*isl_aff_pullback_aff(__isl_take isl_aff
*aff1
,
5572 __isl_take isl_aff
*aff2
)
5576 ma
= isl_multi_aff_from_aff(aff2
);
5577 return isl_aff_pullback_multi_aff(aff1
, ma
);
5580 /* Compute the pullback of "ma1" by the function represented by "ma2".
5581 * In other words, plug in "ma2" in "ma1".
5583 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
5585 static __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff_aligned(
5586 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5589 isl_space
*space
= NULL
;
5591 ma2
= isl_multi_aff_align_divs(ma2
);
5592 ma1
= isl_multi_aff_cow(ma1
);
5596 space
= isl_space_join(isl_multi_aff_get_space(ma2
),
5597 isl_multi_aff_get_space(ma1
));
5599 for (i
= 0; i
< ma1
->n
; ++i
) {
5600 ma1
->u
.p
[i
] = isl_aff_pullback_multi_aff(ma1
->u
.p
[i
],
5601 isl_multi_aff_copy(ma2
));
5606 ma1
= isl_multi_aff_reset_space(ma1
, space
);
5607 isl_multi_aff_free(ma2
);
5610 isl_space_free(space
);
5611 isl_multi_aff_free(ma2
);
5612 isl_multi_aff_free(ma1
);
5616 /* Compute the pullback of "ma1" by the function represented by "ma2".
5617 * In other words, plug in "ma2" in "ma1".
5619 __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff(
5620 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5622 return isl_multi_aff_align_params_multi_multi_and(ma1
, ma2
,
5623 &isl_multi_aff_pullback_multi_aff_aligned
);
5626 /* Extend the local space of "dst" to include the divs
5627 * in the local space of "src".
5629 * If "src" does not have any divs or if the local spaces of "dst" and
5630 * "src" are the same, then no extension is required.
5632 __isl_give isl_aff
*isl_aff_align_divs(__isl_take isl_aff
*dst
,
5633 __isl_keep isl_aff
*src
)
5636 int src_n_div
, dst_n_div
;
5643 return isl_aff_free(dst
);
5645 ctx
= isl_aff_get_ctx(src
);
5646 equal
= isl_local_space_has_equal_space(src
->ls
, dst
->ls
);
5648 return isl_aff_free(dst
);
5650 isl_die(ctx
, isl_error_invalid
,
5651 "spaces don't match", goto error
);
5653 src_n_div
= isl_local_space_dim(src
->ls
, isl_dim_div
);
5656 equal
= isl_local_space_is_equal(src
->ls
, dst
->ls
);
5658 return isl_aff_free(dst
);
5662 dst_n_div
= isl_local_space_dim(dst
->ls
, isl_dim_div
);
5663 exp1
= isl_alloc_array(ctx
, int, src_n_div
);
5664 exp2
= isl_alloc_array(ctx
, int, dst_n_div
);
5665 if (!exp1
|| (dst_n_div
&& !exp2
))
5668 div
= isl_merge_divs(src
->ls
->div
, dst
->ls
->div
, exp1
, exp2
);
5669 dst
= isl_aff_expand_divs(dst
, div
, exp2
);
5677 return isl_aff_free(dst
);
5680 /* Adjust the local spaces of the affine expressions in "maff"
5681 * such that they all have the save divs.
5683 __isl_give isl_multi_aff
*isl_multi_aff_align_divs(
5684 __isl_take isl_multi_aff
*maff
)
5692 maff
= isl_multi_aff_cow(maff
);
5696 for (i
= 1; i
< maff
->n
; ++i
)
5697 maff
->u
.p
[0] = isl_aff_align_divs(maff
->u
.p
[0], maff
->u
.p
[i
]);
5698 for (i
= 1; i
< maff
->n
; ++i
) {
5699 maff
->u
.p
[i
] = isl_aff_align_divs(maff
->u
.p
[i
], maff
->u
.p
[0]);
5701 return isl_multi_aff_free(maff
);
5707 __isl_give isl_aff
*isl_aff_lift(__isl_take isl_aff
*aff
)
5709 aff
= isl_aff_cow(aff
);
5713 aff
->ls
= isl_local_space_lift(aff
->ls
);
5715 return isl_aff_free(aff
);
5720 /* Lift "maff" to a space with extra dimensions such that the result
5721 * has no more existentially quantified variables.
5722 * If "ls" is not NULL, then *ls is assigned the local space that lies
5723 * at the basis of the lifting applied to "maff".
5725 __isl_give isl_multi_aff
*isl_multi_aff_lift(__isl_take isl_multi_aff
*maff
,
5726 __isl_give isl_local_space
**ls
)
5740 isl_space
*space
= isl_multi_aff_get_domain_space(maff
);
5741 *ls
= isl_local_space_from_space(space
);
5743 return isl_multi_aff_free(maff
);
5748 maff
= isl_multi_aff_cow(maff
);
5749 maff
= isl_multi_aff_align_divs(maff
);
5753 n_div
= isl_aff_dim(maff
->u
.p
[0], isl_dim_div
);
5754 space
= isl_multi_aff_get_space(maff
);
5755 space
= isl_space_lift(isl_space_domain(space
), n_div
);
5756 space
= isl_space_extend_domain_with_range(space
,
5757 isl_multi_aff_get_space(maff
));
5759 return isl_multi_aff_free(maff
);
5760 isl_space_free(maff
->space
);
5761 maff
->space
= space
;
5764 *ls
= isl_aff_get_domain_local_space(maff
->u
.p
[0]);
5766 return isl_multi_aff_free(maff
);
5769 for (i
= 0; i
< maff
->n
; ++i
) {
5770 maff
->u
.p
[i
] = isl_aff_lift(maff
->u
.p
[i
]);
5778 isl_local_space_free(*ls
);
5779 return isl_multi_aff_free(maff
);
5783 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
5785 __isl_give isl_pw_aff
*isl_pw_multi_aff_get_pw_aff(
5786 __isl_keep isl_pw_multi_aff
*pma
, int pos
)
5796 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
5797 if (pos
< 0 || pos
>= n_out
)
5798 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5799 "index out of bounds", return NULL
);
5801 space
= isl_pw_multi_aff_get_space(pma
);
5802 space
= isl_space_drop_dims(space
, isl_dim_out
,
5803 pos
+ 1, n_out
- pos
- 1);
5804 space
= isl_space_drop_dims(space
, isl_dim_out
, 0, pos
);
5806 pa
= isl_pw_aff_alloc_size(space
, pma
->n
);
5807 for (i
= 0; i
< pma
->n
; ++i
) {
5809 aff
= isl_multi_aff_get_aff(pma
->p
[i
].maff
, pos
);
5810 pa
= isl_pw_aff_add_piece(pa
, isl_set_copy(pma
->p
[i
].set
), aff
);
5816 /* Return an isl_pw_multi_aff with the given "set" as domain and
5817 * an unnamed zero-dimensional range.
5819 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_domain(
5820 __isl_take isl_set
*set
)
5825 space
= isl_set_get_space(set
);
5826 space
= isl_space_from_domain(space
);
5827 ma
= isl_multi_aff_zero(space
);
5828 return isl_pw_multi_aff_alloc(set
, ma
);
5831 /* Add an isl_pw_multi_aff with the given "set" as domain and
5832 * an unnamed zero-dimensional range to *user.
5834 static isl_stat
add_pw_multi_aff_from_domain(__isl_take isl_set
*set
,
5837 isl_union_pw_multi_aff
**upma
= user
;
5838 isl_pw_multi_aff
*pma
;
5840 pma
= isl_pw_multi_aff_from_domain(set
);
5841 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5846 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
5847 * an unnamed zero-dimensional range.
5849 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_domain(
5850 __isl_take isl_union_set
*uset
)
5853 isl_union_pw_multi_aff
*upma
;
5858 space
= isl_union_set_get_space(uset
);
5859 upma
= isl_union_pw_multi_aff_empty(space
);
5861 if (isl_union_set_foreach_set(uset
,
5862 &add_pw_multi_aff_from_domain
, &upma
) < 0)
5865 isl_union_set_free(uset
);
5868 isl_union_set_free(uset
);
5869 isl_union_pw_multi_aff_free(upma
);
5873 /* Local data for bin_entry and the callback "fn".
5875 struct isl_union_pw_multi_aff_bin_data
{
5876 isl_union_pw_multi_aff
*upma2
;
5877 isl_union_pw_multi_aff
*res
;
5878 isl_pw_multi_aff
*pma
;
5879 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
);
5882 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
5883 * and call data->fn for each isl_pw_multi_aff in data->upma2.
5885 static isl_stat
bin_entry(__isl_take isl_pw_multi_aff
*pma
, void *user
)
5887 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5891 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma2
,
5893 isl_pw_multi_aff_free(pma
);
5898 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
5899 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
5900 * passed as user field) and the isl_pw_multi_aff from upma2 is available
5901 * as *entry. The callback should adjust data->res if desired.
5903 static __isl_give isl_union_pw_multi_aff
*bin_op(
5904 __isl_take isl_union_pw_multi_aff
*upma1
,
5905 __isl_take isl_union_pw_multi_aff
*upma2
,
5906 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
))
5909 struct isl_union_pw_multi_aff_bin_data data
= { NULL
, NULL
, NULL
, fn
};
5911 space
= isl_union_pw_multi_aff_get_space(upma2
);
5912 upma1
= isl_union_pw_multi_aff_align_params(upma1
, space
);
5913 space
= isl_union_pw_multi_aff_get_space(upma1
);
5914 upma2
= isl_union_pw_multi_aff_align_params(upma2
, space
);
5916 if (!upma1
|| !upma2
)
5920 data
.res
= isl_union_pw_multi_aff_alloc_same_size(upma1
);
5921 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma1
,
5922 &bin_entry
, &data
) < 0)
5925 isl_union_pw_multi_aff_free(upma1
);
5926 isl_union_pw_multi_aff_free(upma2
);
5929 isl_union_pw_multi_aff_free(upma1
);
5930 isl_union_pw_multi_aff_free(upma2
);
5931 isl_union_pw_multi_aff_free(data
.res
);
5935 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5936 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5938 static __isl_give isl_pw_multi_aff
*pw_multi_aff_range_product(
5939 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5943 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5944 isl_pw_multi_aff_get_space(pma2
));
5945 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5946 &isl_multi_aff_range_product
);
5949 /* Given two isl_pw_multi_affs A -> B and C -> D,
5950 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5952 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_product(
5953 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5955 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5956 &pw_multi_aff_range_product
);
5959 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5960 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5962 static __isl_give isl_pw_multi_aff
*pw_multi_aff_flat_range_product(
5963 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5967 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5968 isl_pw_multi_aff_get_space(pma2
));
5969 space
= isl_space_flatten_range(space
);
5970 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5971 &isl_multi_aff_flat_range_product
);
5974 /* Given two isl_pw_multi_affs A -> B and C -> D,
5975 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5977 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_flat_range_product(
5978 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5980 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5981 &pw_multi_aff_flat_range_product
);
5984 /* If data->pma and "pma2" have the same domain space, then compute
5985 * their flat range product and the result to data->res.
5987 static isl_stat
flat_range_product_entry(__isl_take isl_pw_multi_aff
*pma2
,
5990 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5992 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
5993 pma2
->dim
, isl_dim_in
)) {
5994 isl_pw_multi_aff_free(pma2
);
5998 pma2
= isl_pw_multi_aff_flat_range_product(
5999 isl_pw_multi_aff_copy(data
->pma
), pma2
);
6001 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
6006 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
6007 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
6009 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_flat_range_product(
6010 __isl_take isl_union_pw_multi_aff
*upma1
,
6011 __isl_take isl_union_pw_multi_aff
*upma2
)
6013 return bin_op(upma1
, upma2
, &flat_range_product_entry
);
6016 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6017 * The parameters are assumed to have been aligned.
6019 * The implementation essentially performs an isl_pw_*_on_shared_domain,
6020 * except that it works on two different isl_pw_* types.
6022 static __isl_give isl_pw_multi_aff
*pw_multi_aff_set_pw_aff(
6023 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6024 __isl_take isl_pw_aff
*pa
)
6027 isl_pw_multi_aff
*res
= NULL
;
6032 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_in
,
6033 pa
->dim
, isl_dim_in
))
6034 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6035 "domains don't match", goto error
);
6036 if (pos
>= isl_pw_multi_aff_dim(pma
, isl_dim_out
))
6037 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6038 "index out of bounds", goto error
);
6041 res
= isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma
), n
);
6043 for (i
= 0; i
< pma
->n
; ++i
) {
6044 for (j
= 0; j
< pa
->n
; ++j
) {
6046 isl_multi_aff
*res_ij
;
6049 common
= isl_set_intersect(isl_set_copy(pma
->p
[i
].set
),
6050 isl_set_copy(pa
->p
[j
].set
));
6051 empty
= isl_set_plain_is_empty(common
);
6052 if (empty
< 0 || empty
) {
6053 isl_set_free(common
);
6059 res_ij
= isl_multi_aff_set_aff(
6060 isl_multi_aff_copy(pma
->p
[i
].maff
), pos
,
6061 isl_aff_copy(pa
->p
[j
].aff
));
6062 res_ij
= isl_multi_aff_gist(res_ij
,
6063 isl_set_copy(common
));
6065 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
6069 isl_pw_multi_aff_free(pma
);
6070 isl_pw_aff_free(pa
);
6073 isl_pw_multi_aff_free(pma
);
6074 isl_pw_aff_free(pa
);
6075 return isl_pw_multi_aff_free(res
);
6078 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6080 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_set_pw_aff(
6081 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6082 __isl_take isl_pw_aff
*pa
)
6084 isl_bool equal_params
;
6088 equal_params
= isl_space_has_equal_params(pma
->dim
, pa
->dim
);
6089 if (equal_params
< 0)
6092 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6093 if (isl_pw_multi_aff_check_named_params(pma
) < 0 ||
6094 isl_pw_aff_check_named_params(pa
) < 0)
6096 pma
= isl_pw_multi_aff_align_params(pma
, isl_pw_aff_get_space(pa
));
6097 pa
= isl_pw_aff_align_params(pa
, isl_pw_multi_aff_get_space(pma
));
6098 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6100 isl_pw_multi_aff_free(pma
);
6101 isl_pw_aff_free(pa
);
6105 /* Do the parameters of "pa" match those of "space"?
6107 isl_bool
isl_pw_aff_matching_params(__isl_keep isl_pw_aff
*pa
,
6108 __isl_keep isl_space
*space
)
6110 isl_space
*pa_space
;
6114 return isl_bool_error
;
6116 pa_space
= isl_pw_aff_get_space(pa
);
6118 match
= isl_space_has_equal_params(space
, pa_space
);
6120 isl_space_free(pa_space
);
6124 /* Check that the domain space of "pa" matches "space".
6126 isl_stat
isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff
*pa
,
6127 __isl_keep isl_space
*space
)
6129 isl_space
*pa_space
;
6133 return isl_stat_error
;
6135 pa_space
= isl_pw_aff_get_space(pa
);
6137 match
= isl_space_has_equal_params(space
, pa_space
);
6141 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6142 "parameters don't match", goto error
);
6143 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
6144 pa_space
, isl_dim_in
);
6148 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6149 "domains don't match", goto error
);
6150 isl_space_free(pa_space
);
6153 isl_space_free(pa_space
);
6154 return isl_stat_error
;
6162 #include <isl_multi_explicit_domain.c>
6163 #include <isl_multi_pw_aff_explicit_domain.c>
6164 #include <isl_multi_templ.c>
6165 #include <isl_multi_apply_set.c>
6166 #include <isl_multi_coalesce.c>
6167 #include <isl_multi_dims.c>
6168 #include <isl_multi_gist.c>
6169 #include <isl_multi_hash.c>
6170 #include <isl_multi_align_set.c>
6171 #include <isl_multi_intersect.c>
6173 /* Does "mpa" have a non-trivial explicit domain?
6175 * The explicit domain, if present, is trivial if it represents
6176 * an (obviously) universe set.
6178 isl_bool
isl_multi_pw_aff_has_non_trivial_domain(
6179 __isl_keep isl_multi_pw_aff
*mpa
)
6182 return isl_bool_error
;
6183 if (!isl_multi_pw_aff_has_explicit_domain(mpa
))
6184 return isl_bool_false
;
6185 return isl_bool_not(isl_set_plain_is_universe(mpa
->u
.dom
));
6188 /* Scale the elements of "pma" by the corresponding elements of "mv".
6190 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_scale_multi_val(
6191 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
)
6194 isl_bool equal_params
;
6196 pma
= isl_pw_multi_aff_cow(pma
);
6199 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6200 mv
->space
, isl_dim_set
))
6201 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6202 "spaces don't match", goto error
);
6203 equal_params
= isl_space_has_equal_params(pma
->dim
, mv
->space
);
6204 if (equal_params
< 0)
6206 if (!equal_params
) {
6207 pma
= isl_pw_multi_aff_align_params(pma
,
6208 isl_multi_val_get_space(mv
));
6209 mv
= isl_multi_val_align_params(mv
,
6210 isl_pw_multi_aff_get_space(pma
));
6215 for (i
= 0; i
< pma
->n
; ++i
) {
6216 pma
->p
[i
].maff
= isl_multi_aff_scale_multi_val(pma
->p
[i
].maff
,
6217 isl_multi_val_copy(mv
));
6218 if (!pma
->p
[i
].maff
)
6222 isl_multi_val_free(mv
);
6225 isl_multi_val_free(mv
);
6226 isl_pw_multi_aff_free(pma
);
6230 /* This function is called for each entry of an isl_union_pw_multi_aff.
6231 * If the space of the entry matches that of data->mv,
6232 * then apply isl_pw_multi_aff_scale_multi_val and return the result.
6233 * Otherwise, return an empty isl_pw_multi_aff.
6235 static __isl_give isl_pw_multi_aff
*union_pw_multi_aff_scale_multi_val_entry(
6236 __isl_take isl_pw_multi_aff
*pma
, void *user
)
6238 isl_multi_val
*mv
= user
;
6242 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6243 mv
->space
, isl_dim_set
)) {
6244 isl_space
*space
= isl_pw_multi_aff_get_space(pma
);
6245 isl_pw_multi_aff_free(pma
);
6246 return isl_pw_multi_aff_empty(space
);
6249 return isl_pw_multi_aff_scale_multi_val(pma
, isl_multi_val_copy(mv
));
6252 /* Scale the elements of "upma" by the corresponding elements of "mv",
6253 * for those entries that match the space of "mv".
6255 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_scale_multi_val(
6256 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_multi_val
*mv
)
6258 upma
= isl_union_pw_multi_aff_align_params(upma
,
6259 isl_multi_val_get_space(mv
));
6260 mv
= isl_multi_val_align_params(mv
,
6261 isl_union_pw_multi_aff_get_space(upma
));
6265 return isl_union_pw_multi_aff_transform(upma
,
6266 &union_pw_multi_aff_scale_multi_val_entry
, mv
);
6268 isl_multi_val_free(mv
);
6271 isl_multi_val_free(mv
);
6272 isl_union_pw_multi_aff_free(upma
);
6276 /* Construct and return a piecewise multi affine expression
6277 * in the given space with value zero in each of the output dimensions and
6278 * a universe domain.
6280 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_zero(__isl_take isl_space
*space
)
6282 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space
));
6285 /* Construct and return a piecewise multi affine expression
6286 * that is equal to the given piecewise affine expression.
6288 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_pw_aff(
6289 __isl_take isl_pw_aff
*pa
)
6293 isl_pw_multi_aff
*pma
;
6298 space
= isl_pw_aff_get_space(pa
);
6299 pma
= isl_pw_multi_aff_alloc_size(space
, pa
->n
);
6301 for (i
= 0; i
< pa
->n
; ++i
) {
6305 set
= isl_set_copy(pa
->p
[i
].set
);
6306 ma
= isl_multi_aff_from_aff(isl_aff_copy(pa
->p
[i
].aff
));
6307 pma
= isl_pw_multi_aff_add_piece(pma
, set
, ma
);
6310 isl_pw_aff_free(pa
);
6314 /* Construct and return a piecewise multi affine expression
6315 * that is equal to the given multi piecewise affine expression
6316 * on the shared domain of the piecewise affine expressions,
6317 * in the special case of a 0D multi piecewise affine expression.
6319 * Create a piecewise multi affine expression with the explicit domain of
6320 * the 0D multi piecewise affine expression as domain.
6322 static __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff_0D(
6323 __isl_take isl_multi_pw_aff
*mpa
)
6329 space
= isl_multi_pw_aff_get_space(mpa
);
6330 dom
= isl_multi_pw_aff_get_explicit_domain(mpa
);
6331 isl_multi_pw_aff_free(mpa
);
6333 ma
= isl_multi_aff_zero(space
);
6334 return isl_pw_multi_aff_alloc(dom
, ma
);
6337 /* Construct and return a piecewise multi affine expression
6338 * that is equal to the given multi piecewise affine expression
6339 * on the shared domain of the piecewise affine expressions.
6341 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff(
6342 __isl_take isl_multi_pw_aff
*mpa
)
6347 isl_pw_multi_aff
*pma
;
6353 return isl_pw_multi_aff_from_multi_pw_aff_0D(mpa
);
6355 space
= isl_multi_pw_aff_get_space(mpa
);
6356 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, 0);
6357 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
6359 for (i
= 1; i
< mpa
->n
; ++i
) {
6360 isl_pw_multi_aff
*pma_i
;
6362 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6363 pma_i
= isl_pw_multi_aff_from_pw_aff(pa
);
6364 pma
= isl_pw_multi_aff_range_product(pma
, pma_i
);
6367 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
6369 isl_multi_pw_aff_free(mpa
);
6373 /* Construct and return a multi piecewise affine expression
6374 * that is equal to the given multi affine expression.
6376 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_multi_aff(
6377 __isl_take isl_multi_aff
*ma
)
6380 isl_multi_pw_aff
*mpa
;
6385 n
= isl_multi_aff_dim(ma
, isl_dim_out
);
6386 mpa
= isl_multi_pw_aff_alloc(isl_multi_aff_get_space(ma
));
6388 for (i
= 0; i
< n
; ++i
) {
6391 pa
= isl_pw_aff_from_aff(isl_multi_aff_get_aff(ma
, i
));
6392 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6395 isl_multi_aff_free(ma
);
6399 /* Construct and return a multi piecewise affine expression
6400 * that is equal to the given piecewise multi affine expression.
6402 * If the resulting multi piecewise affine expression has
6403 * an explicit domain, then assign it the domain of the input.
6404 * In other cases, the domain is stored in the individual elements.
6406 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_pw_multi_aff(
6407 __isl_take isl_pw_multi_aff
*pma
)
6411 isl_multi_pw_aff
*mpa
;
6416 n
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
6417 space
= isl_pw_multi_aff_get_space(pma
);
6418 mpa
= isl_multi_pw_aff_alloc(space
);
6420 for (i
= 0; i
< n
; ++i
) {
6423 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
6424 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6426 if (isl_multi_pw_aff_has_explicit_domain(mpa
)) {
6429 dom
= isl_pw_multi_aff_domain(isl_pw_multi_aff_copy(pma
));
6430 mpa
= isl_multi_pw_aff_intersect_domain(mpa
, dom
);
6433 isl_pw_multi_aff_free(pma
);
6437 /* Do "pa1" and "pa2" represent the same function?
6439 * We first check if they are obviously equal.
6440 * If not, we convert them to maps and check if those are equal.
6442 * If "pa1" or "pa2" contain any NaNs, then they are considered
6443 * not to be the same. A NaN is not equal to anything, not even
6446 isl_bool
isl_pw_aff_is_equal(__isl_keep isl_pw_aff
*pa1
,
6447 __isl_keep isl_pw_aff
*pa2
)
6451 isl_map
*map1
, *map2
;
6454 return isl_bool_error
;
6456 equal
= isl_pw_aff_plain_is_equal(pa1
, pa2
);
6457 if (equal
< 0 || equal
)
6459 has_nan
= either_involves_nan(pa1
, pa2
);
6461 return isl_bool_error
;
6463 return isl_bool_false
;
6465 map1
= isl_map_from_pw_aff_internal(isl_pw_aff_copy(pa1
));
6466 map2
= isl_map_from_pw_aff_internal(isl_pw_aff_copy(pa2
));
6467 equal
= isl_map_is_equal(map1
, map2
);
6474 /* Do "mpa1" and "mpa2" represent the same function?
6476 * Note that we cannot convert the entire isl_multi_pw_aff
6477 * to a map because the domains of the piecewise affine expressions
6478 * may not be the same.
6480 isl_bool
isl_multi_pw_aff_is_equal(__isl_keep isl_multi_pw_aff
*mpa1
,
6481 __isl_keep isl_multi_pw_aff
*mpa2
)
6484 isl_bool equal
, equal_params
;
6487 return isl_bool_error
;
6489 equal_params
= isl_space_has_equal_params(mpa1
->space
, mpa2
->space
);
6490 if (equal_params
< 0)
6491 return isl_bool_error
;
6492 if (!equal_params
) {
6493 if (!isl_space_has_named_params(mpa1
->space
))
6494 return isl_bool_false
;
6495 if (!isl_space_has_named_params(mpa2
->space
))
6496 return isl_bool_false
;
6497 mpa1
= isl_multi_pw_aff_copy(mpa1
);
6498 mpa2
= isl_multi_pw_aff_copy(mpa2
);
6499 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6500 isl_multi_pw_aff_get_space(mpa2
));
6501 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6502 isl_multi_pw_aff_get_space(mpa1
));
6503 equal
= isl_multi_pw_aff_is_equal(mpa1
, mpa2
);
6504 isl_multi_pw_aff_free(mpa1
);
6505 isl_multi_pw_aff_free(mpa2
);
6509 equal
= isl_space_is_equal(mpa1
->space
, mpa2
->space
);
6510 if (equal
< 0 || !equal
)
6513 for (i
= 0; i
< mpa1
->n
; ++i
) {
6514 equal
= isl_pw_aff_is_equal(mpa1
->u
.p
[i
], mpa2
->u
.p
[i
]);
6515 if (equal
< 0 || !equal
)
6519 return isl_bool_true
;
6522 /* Do "pma1" and "pma2" represent the same function?
6524 * First check if they are obviously equal.
6525 * If not, then convert them to maps and check if those are equal.
6527 * If "pa1" or "pa2" contain any NaNs, then they are considered
6528 * not to be the same. A NaN is not equal to anything, not even
6531 isl_bool
isl_pw_multi_aff_is_equal(__isl_keep isl_pw_multi_aff
*pma1
,
6532 __isl_keep isl_pw_multi_aff
*pma2
)
6536 isl_map
*map1
, *map2
;
6539 return isl_bool_error
;
6541 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
6542 if (equal
< 0 || equal
)
6544 has_nan
= isl_pw_multi_aff_involves_nan(pma1
);
6545 if (has_nan
>= 0 && !has_nan
)
6546 has_nan
= isl_pw_multi_aff_involves_nan(pma2
);
6547 if (has_nan
< 0 || has_nan
)
6548 return isl_bool_not(has_nan
);
6550 map1
= isl_map_from_pw_multi_aff(isl_pw_multi_aff_copy(pma1
));
6551 map2
= isl_map_from_pw_multi_aff(isl_pw_multi_aff_copy(pma2
));
6552 equal
= isl_map_is_equal(map1
, map2
);
6559 /* Compute the pullback of "mpa" by the function represented by "ma".
6560 * In other words, plug in "ma" in "mpa".
6562 * The parameters of "mpa" and "ma" are assumed to have been aligned.
6564 * If "mpa" has an explicit domain, then it is this domain
6565 * that needs to undergo a pullback, i.e., a preimage.
6567 static __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff_aligned(
6568 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6571 isl_space
*space
= NULL
;
6573 mpa
= isl_multi_pw_aff_cow(mpa
);
6577 space
= isl_space_join(isl_multi_aff_get_space(ma
),
6578 isl_multi_pw_aff_get_space(mpa
));
6582 for (i
= 0; i
< mpa
->n
; ++i
) {
6583 mpa
->u
.p
[i
] = isl_pw_aff_pullback_multi_aff(mpa
->u
.p
[i
],
6584 isl_multi_aff_copy(ma
));
6588 if (isl_multi_pw_aff_has_explicit_domain(mpa
)) {
6589 mpa
->u
.dom
= isl_set_preimage_multi_aff(mpa
->u
.dom
,
6590 isl_multi_aff_copy(ma
));
6595 isl_multi_aff_free(ma
);
6596 isl_space_free(mpa
->space
);
6600 isl_space_free(space
);
6601 isl_multi_pw_aff_free(mpa
);
6602 isl_multi_aff_free(ma
);
6606 /* Compute the pullback of "mpa" by the function represented by "ma".
6607 * In other words, plug in "ma" in "mpa".
6609 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff(
6610 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6612 isl_bool equal_params
;
6616 equal_params
= isl_space_has_equal_params(mpa
->space
, ma
->space
);
6617 if (equal_params
< 0)
6620 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6621 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_multi_aff_get_space(ma
));
6622 ma
= isl_multi_aff_align_params(ma
, isl_multi_pw_aff_get_space(mpa
));
6623 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6625 isl_multi_pw_aff_free(mpa
);
6626 isl_multi_aff_free(ma
);
6630 /* Compute the pullback of "mpa" by the function represented by "pma".
6631 * In other words, plug in "pma" in "mpa".
6633 * The parameters of "mpa" and "mpa" are assumed to have been aligned.
6635 * If "mpa" has an explicit domain, then it is this domain
6636 * that needs to undergo a pullback, i.e., a preimage.
6638 static __isl_give isl_multi_pw_aff
*
6639 isl_multi_pw_aff_pullback_pw_multi_aff_aligned(
6640 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6643 isl_space
*space
= NULL
;
6645 mpa
= isl_multi_pw_aff_cow(mpa
);
6649 space
= isl_space_join(isl_pw_multi_aff_get_space(pma
),
6650 isl_multi_pw_aff_get_space(mpa
));
6652 for (i
= 0; i
< mpa
->n
; ++i
) {
6653 mpa
->u
.p
[i
] = isl_pw_aff_pullback_pw_multi_aff_aligned(
6654 mpa
->u
.p
[i
], isl_pw_multi_aff_copy(pma
));
6658 if (isl_multi_pw_aff_has_explicit_domain(mpa
)) {
6659 mpa
->u
.dom
= isl_set_preimage_pw_multi_aff(mpa
->u
.dom
,
6660 isl_pw_multi_aff_copy(pma
));
6665 isl_pw_multi_aff_free(pma
);
6666 isl_space_free(mpa
->space
);
6670 isl_space_free(space
);
6671 isl_multi_pw_aff_free(mpa
);
6672 isl_pw_multi_aff_free(pma
);
6676 /* Compute the pullback of "mpa" by the function represented by "pma".
6677 * In other words, plug in "pma" in "mpa".
6679 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_pw_multi_aff(
6680 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6682 isl_bool equal_params
;
6686 equal_params
= isl_space_has_equal_params(mpa
->space
, pma
->dim
);
6687 if (equal_params
< 0)
6690 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6691 mpa
= isl_multi_pw_aff_align_params(mpa
,
6692 isl_pw_multi_aff_get_space(pma
));
6693 pma
= isl_pw_multi_aff_align_params(pma
,
6694 isl_multi_pw_aff_get_space(mpa
));
6695 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6697 isl_multi_pw_aff_free(mpa
);
6698 isl_pw_multi_aff_free(pma
);
6702 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6703 * with the domain of "aff". The domain of the result is the same
6705 * "mpa" and "aff" are assumed to have been aligned.
6707 * We first extract the parametric constant from "aff", defined
6708 * over the correct domain.
6709 * Then we add the appropriate combinations of the members of "mpa".
6710 * Finally, we add the integer divisions through recursive calls.
6712 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff_aligned(
6713 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6721 n_in
= isl_aff_dim(aff
, isl_dim_in
);
6722 n_div
= isl_aff_dim(aff
, isl_dim_div
);
6724 space
= isl_space_domain(isl_multi_pw_aff_get_space(mpa
));
6725 tmp
= isl_aff_copy(aff
);
6726 tmp
= isl_aff_drop_dims(tmp
, isl_dim_div
, 0, n_div
);
6727 tmp
= isl_aff_drop_dims(tmp
, isl_dim_in
, 0, n_in
);
6728 tmp
= isl_aff_add_dims(tmp
, isl_dim_in
,
6729 isl_space_dim(space
, isl_dim_set
));
6730 tmp
= isl_aff_reset_domain_space(tmp
, space
);
6731 pa
= isl_pw_aff_from_aff(tmp
);
6733 for (i
= 0; i
< n_in
; ++i
) {
6736 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
6738 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
6739 pa_i
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6740 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6741 pa
= isl_pw_aff_add(pa
, pa_i
);
6744 for (i
= 0; i
< n_div
; ++i
) {
6748 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
6750 div
= isl_aff_get_div(aff
, i
);
6751 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6752 isl_multi_pw_aff_copy(mpa
), div
);
6753 pa_i
= isl_pw_aff_floor(pa_i
);
6754 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
6755 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6756 pa
= isl_pw_aff_add(pa
, pa_i
);
6759 isl_multi_pw_aff_free(mpa
);
6765 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6766 * with the domain of "aff". The domain of the result is the same
6769 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff(
6770 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6772 isl_bool equal_params
;
6776 equal_params
= isl_space_has_equal_params(aff
->ls
->dim
, mpa
->space
);
6777 if (equal_params
< 0)
6780 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6782 aff
= isl_aff_align_params(aff
, isl_multi_pw_aff_get_space(mpa
));
6783 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_aff_get_space(aff
));
6785 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6788 isl_multi_pw_aff_free(mpa
);
6792 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6793 * with the domain of "pa". The domain of the result is the same
6795 * "mpa" and "pa" are assumed to have been aligned.
6797 * We consider each piece in turn. Note that the domains of the
6798 * pieces are assumed to be disjoint and they remain disjoint
6799 * after taking the preimage (over the same function).
6801 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff_aligned(
6802 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6811 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa
),
6812 isl_pw_aff_get_space(pa
));
6813 res
= isl_pw_aff_empty(space
);
6815 for (i
= 0; i
< pa
->n
; ++i
) {
6819 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6820 isl_multi_pw_aff_copy(mpa
),
6821 isl_aff_copy(pa
->p
[i
].aff
));
6822 domain
= isl_set_copy(pa
->p
[i
].set
);
6823 domain
= isl_set_preimage_multi_pw_aff(domain
,
6824 isl_multi_pw_aff_copy(mpa
));
6825 pa_i
= isl_pw_aff_intersect_domain(pa_i
, domain
);
6826 res
= isl_pw_aff_add_disjoint(res
, pa_i
);
6829 isl_pw_aff_free(pa
);
6830 isl_multi_pw_aff_free(mpa
);
6833 isl_pw_aff_free(pa
);
6834 isl_multi_pw_aff_free(mpa
);
6838 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6839 * with the domain of "pa". The domain of the result is the same
6842 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff(
6843 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6845 isl_bool equal_params
;
6849 equal_params
= isl_space_has_equal_params(pa
->dim
, mpa
->space
);
6850 if (equal_params
< 0)
6853 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6855 pa
= isl_pw_aff_align_params(pa
, isl_multi_pw_aff_get_space(mpa
));
6856 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_pw_aff_get_space(pa
));
6858 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6860 isl_pw_aff_free(pa
);
6861 isl_multi_pw_aff_free(mpa
);
6865 /* Compute the pullback of "pa" by the function represented by "mpa".
6866 * In other words, plug in "mpa" in "pa".
6867 * "pa" and "mpa" are assumed to have been aligned.
6869 * The pullback is computed by applying "pa" to "mpa".
6871 static __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff_aligned(
6872 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6874 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6877 /* Compute the pullback of "pa" by the function represented by "mpa".
6878 * In other words, plug in "mpa" in "pa".
6880 * The pullback is computed by applying "pa" to "mpa".
6882 __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff(
6883 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6885 return isl_multi_pw_aff_apply_pw_aff(mpa
, pa
);
6888 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6889 * In other words, plug in "mpa2" in "mpa1".
6891 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6893 * We pullback each member of "mpa1" in turn.
6895 * If "mpa1" has an explicit domain, then it is this domain
6896 * that needs to undergo a pullback instead, i.e., a preimage.
6898 static __isl_give isl_multi_pw_aff
*
6899 isl_multi_pw_aff_pullback_multi_pw_aff_aligned(
6900 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6903 isl_space
*space
= NULL
;
6905 mpa1
= isl_multi_pw_aff_cow(mpa1
);
6909 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa2
),
6910 isl_multi_pw_aff_get_space(mpa1
));
6912 for (i
= 0; i
< mpa1
->n
; ++i
) {
6913 mpa1
->u
.p
[i
] = isl_pw_aff_pullback_multi_pw_aff_aligned(
6914 mpa1
->u
.p
[i
], isl_multi_pw_aff_copy(mpa2
));
6919 if (isl_multi_pw_aff_has_explicit_domain(mpa1
)) {
6920 mpa1
->u
.dom
= isl_set_preimage_multi_pw_aff(mpa1
->u
.dom
,
6921 isl_multi_pw_aff_copy(mpa2
));
6925 mpa1
= isl_multi_pw_aff_reset_space(mpa1
, space
);
6927 isl_multi_pw_aff_free(mpa2
);
6930 isl_space_free(space
);
6931 isl_multi_pw_aff_free(mpa1
);
6932 isl_multi_pw_aff_free(mpa2
);
6936 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6937 * In other words, plug in "mpa2" in "mpa1".
6939 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_pw_aff(
6940 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6942 return isl_multi_pw_aff_align_params_multi_multi_and(mpa1
, mpa2
,
6943 &isl_multi_pw_aff_pullback_multi_pw_aff_aligned
);
6946 /* Align the parameters of "mpa1" and "mpa2", check that the ranges
6947 * of "mpa1" and "mpa2" live in the same space, construct map space
6948 * between the domain spaces of "mpa1" and "mpa2" and call "order"
6949 * with this map space as extract argument.
6951 static __isl_give isl_map
*isl_multi_pw_aff_order_map(
6952 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6953 __isl_give isl_map
*(*order
)(__isl_keep isl_multi_pw_aff
*mpa1
,
6954 __isl_keep isl_multi_pw_aff
*mpa2
, __isl_take isl_space
*space
))
6957 isl_space
*space1
, *space2
;
6960 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6961 isl_multi_pw_aff_get_space(mpa2
));
6962 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6963 isl_multi_pw_aff_get_space(mpa1
));
6966 match
= isl_space_tuple_is_equal(mpa1
->space
, isl_dim_out
,
6967 mpa2
->space
, isl_dim_out
);
6971 isl_die(isl_multi_pw_aff_get_ctx(mpa1
), isl_error_invalid
,
6972 "range spaces don't match", goto error
);
6973 space1
= isl_space_domain(isl_multi_pw_aff_get_space(mpa1
));
6974 space2
= isl_space_domain(isl_multi_pw_aff_get_space(mpa2
));
6975 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
6977 res
= order(mpa1
, mpa2
, space1
);
6978 isl_multi_pw_aff_free(mpa1
);
6979 isl_multi_pw_aff_free(mpa2
);
6982 isl_multi_pw_aff_free(mpa1
);
6983 isl_multi_pw_aff_free(mpa2
);
6987 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6988 * where the function values are equal. "space" is the space of the result.
6989 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6991 * "mpa1" and "mpa2" are equal when each of the pairs of elements
6992 * in the sequences are equal.
6994 static __isl_give isl_map
*isl_multi_pw_aff_eq_map_on_space(
6995 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
6996 __isl_take isl_space
*space
)
7001 res
= isl_map_universe(space
);
7003 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
7004 for (i
= 0; i
< n
; ++i
) {
7005 isl_pw_aff
*pa1
, *pa2
;
7008 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
7009 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
7010 map
= isl_pw_aff_eq_map(pa1
, pa2
);
7011 res
= isl_map_intersect(res
, map
);
7017 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7018 * where the function values are equal.
7020 __isl_give isl_map
*isl_multi_pw_aff_eq_map(__isl_take isl_multi_pw_aff
*mpa1
,
7021 __isl_take isl_multi_pw_aff
*mpa2
)
7023 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7024 &isl_multi_pw_aff_eq_map_on_space
);
7027 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7028 * where the function values of "mpa1" is lexicographically satisfies "base"
7029 * compared to that of "mpa2". "space" is the space of the result.
7030 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7032 * "mpa1" lexicographically satisfies "base" compared to "mpa2"
7033 * if its i-th element satisfies "base" when compared to
7034 * the i-th element of "mpa2" while all previous elements are
7037 static __isl_give isl_map
*isl_multi_pw_aff_lex_map_on_space(
7038 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
7039 __isl_give isl_map
*(*base
)(__isl_take isl_pw_aff
*pa1
,
7040 __isl_take isl_pw_aff
*pa2
),
7041 __isl_take isl_space
*space
)
7044 isl_map
*res
, *rest
;
7046 res
= isl_map_empty(isl_space_copy(space
));
7047 rest
= isl_map_universe(space
);
7049 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
7050 for (i
= 0; i
< n
; ++i
) {
7051 isl_pw_aff
*pa1
, *pa2
;
7054 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
7055 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
7056 map
= base(pa1
, pa2
);
7057 map
= isl_map_intersect(map
, isl_map_copy(rest
));
7058 res
= isl_map_union(res
, map
);
7063 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
7064 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
7065 map
= isl_pw_aff_eq_map(pa1
, pa2
);
7066 rest
= isl_map_intersect(rest
, map
);
7073 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7074 * where the function value of "mpa1" is lexicographically less than that
7075 * of "mpa2". "space" is the space of the result.
7076 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7078 * "mpa1" is less than "mpa2" if its i-th element is smaller
7079 * than the i-th element of "mpa2" while all previous elements are
7082 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map_on_space(
7083 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
7084 __isl_take isl_space
*space
)
7086 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
7087 &isl_pw_aff_lt_map
, space
);
7090 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7091 * where the function value of "mpa1" is lexicographically less than that
7094 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map(
7095 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
7097 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7098 &isl_multi_pw_aff_lex_lt_map_on_space
);
7101 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7102 * where the function value of "mpa1" is lexicographically greater than that
7103 * of "mpa2". "space" is the space of the result.
7104 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7106 * "mpa1" is greater than "mpa2" if its i-th element is greater
7107 * than the i-th element of "mpa2" while all previous elements are
7110 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map_on_space(
7111 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
7112 __isl_take isl_space
*space
)
7114 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
7115 &isl_pw_aff_gt_map
, space
);
7118 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7119 * where the function value of "mpa1" is lexicographically greater than that
7122 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map(
7123 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
7125 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7126 &isl_multi_pw_aff_lex_gt_map_on_space
);
7129 /* Compare two isl_affs.
7131 * Return -1 if "aff1" is "smaller" than "aff2", 1 if "aff1" is "greater"
7132 * than "aff2" and 0 if they are equal.
7134 * The order is fairly arbitrary. We do consider expressions that only involve
7135 * earlier dimensions as "smaller".
7137 int isl_aff_plain_cmp(__isl_keep isl_aff
*aff1
, __isl_keep isl_aff
*aff2
)
7150 cmp
= isl_local_space_cmp(aff1
->ls
, aff2
->ls
);
7154 last1
= isl_seq_last_non_zero(aff1
->v
->el
+ 1, aff1
->v
->size
- 1);
7155 last2
= isl_seq_last_non_zero(aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
7157 return last1
- last2
;
7159 return isl_seq_cmp(aff1
->v
->el
, aff2
->v
->el
, aff1
->v
->size
);
7162 /* Compare two isl_pw_affs.
7164 * Return -1 if "pa1" is "smaller" than "pa2", 1 if "pa1" is "greater"
7165 * than "pa2" and 0 if they are equal.
7167 * The order is fairly arbitrary. We do consider expressions that only involve
7168 * earlier dimensions as "smaller".
7170 int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff
*pa1
,
7171 __isl_keep isl_pw_aff
*pa2
)
7184 cmp
= isl_space_cmp(pa1
->dim
, pa2
->dim
);
7188 if (pa1
->n
!= pa2
->n
)
7189 return pa1
->n
- pa2
->n
;
7191 for (i
= 0; i
< pa1
->n
; ++i
) {
7192 cmp
= isl_set_plain_cmp(pa1
->p
[i
].set
, pa2
->p
[i
].set
);
7195 cmp
= isl_aff_plain_cmp(pa1
->p
[i
].aff
, pa2
->p
[i
].aff
);
7203 /* Return a piecewise affine expression that is equal to "v" on "domain".
7205 __isl_give isl_pw_aff
*isl_pw_aff_val_on_domain(__isl_take isl_set
*domain
,
7206 __isl_take isl_val
*v
)
7209 isl_local_space
*ls
;
7212 space
= isl_set_get_space(domain
);
7213 ls
= isl_local_space_from_space(space
);
7214 aff
= isl_aff_val_on_domain(ls
, v
);
7216 return isl_pw_aff_alloc(domain
, aff
);
7219 /* Return a multi affine expression that is equal to "mv" on domain
7222 __isl_give isl_multi_aff
*isl_multi_aff_multi_val_on_space(
7223 __isl_take isl_space
*space
, __isl_take isl_multi_val
*mv
)
7227 isl_local_space
*ls
;
7233 n
= isl_multi_val_dim(mv
, isl_dim_set
);
7234 space2
= isl_multi_val_get_space(mv
);
7235 space2
= isl_space_align_params(space2
, isl_space_copy(space
));
7236 space
= isl_space_align_params(space
, isl_space_copy(space2
));
7237 space
= isl_space_map_from_domain_and_range(space
, space2
);
7238 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
7239 ls
= isl_local_space_from_space(isl_space_domain(space
));
7240 for (i
= 0; i
< n
; ++i
) {
7244 v
= isl_multi_val_get_val(mv
, i
);
7245 aff
= isl_aff_val_on_domain(isl_local_space_copy(ls
), v
);
7246 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
7248 isl_local_space_free(ls
);
7250 isl_multi_val_free(mv
);
7253 isl_space_free(space
);
7254 isl_multi_val_free(mv
);
7258 /* Return a piecewise multi-affine expression
7259 * that is equal to "mv" on "domain".
7261 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_multi_val_on_domain(
7262 __isl_take isl_set
*domain
, __isl_take isl_multi_val
*mv
)
7267 space
= isl_set_get_space(domain
);
7268 ma
= isl_multi_aff_multi_val_on_space(space
, mv
);
7270 return isl_pw_multi_aff_alloc(domain
, ma
);
7273 /* Internal data structure for isl_union_pw_multi_aff_multi_val_on_domain.
7274 * mv is the value that should be attained on each domain set
7275 * res collects the results
7277 struct isl_union_pw_multi_aff_multi_val_on_domain_data
{
7279 isl_union_pw_multi_aff
*res
;
7282 /* Create an isl_pw_multi_aff equal to data->mv on "domain"
7283 * and add it to data->res.
7285 static isl_stat
pw_multi_aff_multi_val_on_domain(__isl_take isl_set
*domain
,
7288 struct isl_union_pw_multi_aff_multi_val_on_domain_data
*data
= user
;
7289 isl_pw_multi_aff
*pma
;
7292 mv
= isl_multi_val_copy(data
->mv
);
7293 pma
= isl_pw_multi_aff_multi_val_on_domain(domain
, mv
);
7294 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
7296 return data
->res
? isl_stat_ok
: isl_stat_error
;
7299 /* Return a union piecewise multi-affine expression
7300 * that is equal to "mv" on "domain".
7302 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_multi_val_on_domain(
7303 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7305 struct isl_union_pw_multi_aff_multi_val_on_domain_data data
;
7308 space
= isl_union_set_get_space(domain
);
7309 data
.res
= isl_union_pw_multi_aff_empty(space
);
7311 if (isl_union_set_foreach_set(domain
,
7312 &pw_multi_aff_multi_val_on_domain
, &data
) < 0)
7313 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
7314 isl_union_set_free(domain
);
7315 isl_multi_val_free(mv
);
7319 /* Compute the pullback of data->pma by the function represented by "pma2",
7320 * provided the spaces match, and add the results to data->res.
7322 static isl_stat
pullback_entry(__isl_take isl_pw_multi_aff
*pma2
, void *user
)
7324 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
7326 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
7327 pma2
->dim
, isl_dim_out
)) {
7328 isl_pw_multi_aff_free(pma2
);
7332 pma2
= isl_pw_multi_aff_pullback_pw_multi_aff(
7333 isl_pw_multi_aff_copy(data
->pma
), pma2
);
7335 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
7337 return isl_stat_error
;
7342 /* Compute the pullback of "upma1" by the function represented by "upma2".
7344 __isl_give isl_union_pw_multi_aff
*
7345 isl_union_pw_multi_aff_pullback_union_pw_multi_aff(
7346 __isl_take isl_union_pw_multi_aff
*upma1
,
7347 __isl_take isl_union_pw_multi_aff
*upma2
)
7349 return bin_op(upma1
, upma2
, &pullback_entry
);
7352 /* Check that the domain space of "upa" matches "space".
7354 * This function is called from isl_multi_union_pw_aff_set_union_pw_aff and
7355 * can in principle never fail since the space "space" is that
7356 * of the isl_multi_union_pw_aff and is a set space such that
7357 * there is no domain space to match.
7359 * We check the parameters and double-check that "space" is
7360 * indeed that of a set.
7362 static isl_stat
isl_union_pw_aff_check_match_domain_space(
7363 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7365 isl_space
*upa_space
;
7369 return isl_stat_error
;
7371 match
= isl_space_is_set(space
);
7373 return isl_stat_error
;
7375 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7376 "expecting set space", return isl_stat_error
);
7378 upa_space
= isl_union_pw_aff_get_space(upa
);
7379 match
= isl_space_has_equal_params(space
, upa_space
);
7383 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7384 "parameters don't match", goto error
);
7386 isl_space_free(upa_space
);
7389 isl_space_free(upa_space
);
7390 return isl_stat_error
;
7393 /* Do the parameters of "upa" match those of "space"?
7395 static isl_bool
isl_union_pw_aff_matching_params(
7396 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7398 isl_space
*upa_space
;
7402 return isl_bool_error
;
7404 upa_space
= isl_union_pw_aff_get_space(upa
);
7406 match
= isl_space_has_equal_params(space
, upa_space
);
7408 isl_space_free(upa_space
);
7412 /* Internal data structure for isl_union_pw_aff_reset_domain_space.
7413 * space represents the new parameters.
7414 * res collects the results.
7416 struct isl_union_pw_aff_reset_params_data
{
7418 isl_union_pw_aff
*res
;
7421 /* Replace the parameters of "pa" by data->space and
7422 * add the result to data->res.
7424 static isl_stat
reset_params(__isl_take isl_pw_aff
*pa
, void *user
)
7426 struct isl_union_pw_aff_reset_params_data
*data
= user
;
7429 space
= isl_pw_aff_get_space(pa
);
7430 space
= isl_space_replace_params(space
, data
->space
);
7431 pa
= isl_pw_aff_reset_space(pa
, space
);
7432 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7434 return data
->res
? isl_stat_ok
: isl_stat_error
;
7437 /* Replace the domain space of "upa" by "space".
7438 * Since a union expression does not have a (single) domain space,
7439 * "space" is necessarily a parameter space.
7441 * Since the order and the names of the parameters determine
7442 * the hash value, we need to create a new hash table.
7444 static __isl_give isl_union_pw_aff
*isl_union_pw_aff_reset_domain_space(
7445 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_space
*space
)
7447 struct isl_union_pw_aff_reset_params_data data
= { space
};
7450 match
= isl_union_pw_aff_matching_params(upa
, space
);
7452 upa
= isl_union_pw_aff_free(upa
);
7454 isl_space_free(space
);
7458 data
.res
= isl_union_pw_aff_empty(isl_space_copy(space
));
7459 if (isl_union_pw_aff_foreach_pw_aff(upa
, &reset_params
, &data
) < 0)
7460 data
.res
= isl_union_pw_aff_free(data
.res
);
7462 isl_union_pw_aff_free(upa
);
7463 isl_space_free(space
);
7467 /* Return the floor of "pa".
7469 static __isl_give isl_pw_aff
*floor_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7471 return isl_pw_aff_floor(pa
);
7474 /* Given f, return floor(f).
7476 __isl_give isl_union_pw_aff
*isl_union_pw_aff_floor(
7477 __isl_take isl_union_pw_aff
*upa
)
7479 return isl_union_pw_aff_transform_inplace(upa
, &floor_entry
, NULL
);
7484 * upa mod m = upa - m * floor(upa/m)
7486 * with m an integer value.
7488 __isl_give isl_union_pw_aff
*isl_union_pw_aff_mod_val(
7489 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_val
*m
)
7491 isl_union_pw_aff
*res
;
7496 if (!isl_val_is_int(m
))
7497 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7498 "expecting integer modulo", goto error
);
7499 if (!isl_val_is_pos(m
))
7500 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7501 "expecting positive modulo", goto error
);
7503 res
= isl_union_pw_aff_copy(upa
);
7504 upa
= isl_union_pw_aff_scale_down_val(upa
, isl_val_copy(m
));
7505 upa
= isl_union_pw_aff_floor(upa
);
7506 upa
= isl_union_pw_aff_scale_val(upa
, m
);
7507 res
= isl_union_pw_aff_sub(res
, upa
);
7512 isl_union_pw_aff_free(upa
);
7516 /* Internal data structure for isl_union_pw_multi_aff_get_union_pw_aff.
7517 * pos is the output position that needs to be extracted.
7518 * res collects the results.
7520 struct isl_union_pw_multi_aff_get_union_pw_aff_data
{
7522 isl_union_pw_aff
*res
;
7525 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma"
7526 * (assuming it has such a dimension) and add it to data->res.
7528 static isl_stat
get_union_pw_aff(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7530 struct isl_union_pw_multi_aff_get_union_pw_aff_data
*data
= user
;
7535 return isl_stat_error
;
7537 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
7538 if (data
->pos
>= n_out
) {
7539 isl_pw_multi_aff_free(pma
);
7543 pa
= isl_pw_multi_aff_get_pw_aff(pma
, data
->pos
);
7544 isl_pw_multi_aff_free(pma
);
7546 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7548 return data
->res
? isl_stat_ok
: isl_stat_error
;
7551 /* Extract an isl_union_pw_aff corresponding to
7552 * output dimension "pos" of "upma".
7554 __isl_give isl_union_pw_aff
*isl_union_pw_multi_aff_get_union_pw_aff(
7555 __isl_keep isl_union_pw_multi_aff
*upma
, int pos
)
7557 struct isl_union_pw_multi_aff_get_union_pw_aff_data data
;
7564 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7565 "cannot extract at negative position", return NULL
);
7567 space
= isl_union_pw_multi_aff_get_space(upma
);
7568 data
.res
= isl_union_pw_aff_empty(space
);
7570 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
7571 &get_union_pw_aff
, &data
) < 0)
7572 data
.res
= isl_union_pw_aff_free(data
.res
);
7577 /* Return a union piecewise affine expression
7578 * that is equal to "aff" on "domain".
7580 __isl_give isl_union_pw_aff
*isl_union_pw_aff_aff_on_domain(
7581 __isl_take isl_union_set
*domain
, __isl_take isl_aff
*aff
)
7585 pa
= isl_pw_aff_from_aff(aff
);
7586 return isl_union_pw_aff_pw_aff_on_domain(domain
, pa
);
7589 /* Return a union piecewise affine expression
7590 * that is equal to the parameter identified by "id" on "domain".
7592 * Make sure the parameter appears in the space passed to
7593 * isl_aff_param_on_domain_space_id.
7595 __isl_give isl_union_pw_aff
*isl_union_pw_aff_param_on_domain_id(
7596 __isl_take isl_union_set
*domain
, __isl_take isl_id
*id
)
7601 space
= isl_union_set_get_space(domain
);
7602 space
= isl_space_add_param_id(space
, isl_id_copy(id
));
7603 aff
= isl_aff_param_on_domain_space_id(space
, id
);
7604 return isl_union_pw_aff_aff_on_domain(domain
, aff
);
7607 /* Internal data structure for isl_union_pw_aff_pw_aff_on_domain.
7608 * "pa" is the piecewise symbolic value that the resulting isl_union_pw_aff
7610 * "res" collects the results.
7612 struct isl_union_pw_aff_pw_aff_on_domain_data
{
7614 isl_union_pw_aff
*res
;
7617 /* Construct a piecewise affine expression that is equal to data->pa
7618 * on "domain" and add the result to data->res.
7620 static isl_stat
pw_aff_on_domain(__isl_take isl_set
*domain
, void *user
)
7622 struct isl_union_pw_aff_pw_aff_on_domain_data
*data
= user
;
7626 pa
= isl_pw_aff_copy(data
->pa
);
7627 dim
= isl_set_dim(domain
, isl_dim_set
);
7628 pa
= isl_pw_aff_from_range(pa
);
7629 pa
= isl_pw_aff_add_dims(pa
, isl_dim_in
, dim
);
7630 pa
= isl_pw_aff_reset_domain_space(pa
, isl_set_get_space(domain
));
7631 pa
= isl_pw_aff_intersect_domain(pa
, domain
);
7632 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7634 return data
->res
? isl_stat_ok
: isl_stat_error
;
7637 /* Return a union piecewise affine expression
7638 * that is equal to "pa" on "domain", assuming "domain" and "pa"
7639 * have been aligned.
7641 * Construct an isl_pw_aff on each of the sets in "domain" and
7642 * collect the results.
7644 static __isl_give isl_union_pw_aff
*isl_union_pw_aff_pw_aff_on_domain_aligned(
7645 __isl_take isl_union_set
*domain
, __isl_take isl_pw_aff
*pa
)
7647 struct isl_union_pw_aff_pw_aff_on_domain_data data
;
7650 space
= isl_union_set_get_space(domain
);
7651 data
.res
= isl_union_pw_aff_empty(space
);
7653 if (isl_union_set_foreach_set(domain
, &pw_aff_on_domain
, &data
) < 0)
7654 data
.res
= isl_union_pw_aff_free(data
.res
);
7655 isl_union_set_free(domain
);
7656 isl_pw_aff_free(pa
);
7660 /* Return a union piecewise affine expression
7661 * that is equal to "pa" on "domain".
7663 * Check that "pa" is a parametric expression,
7664 * align the parameters if needed and call
7665 * isl_union_pw_aff_pw_aff_on_domain_aligned.
7667 __isl_give isl_union_pw_aff
*isl_union_pw_aff_pw_aff_on_domain(
7668 __isl_take isl_union_set
*domain
, __isl_take isl_pw_aff
*pa
)
7671 isl_bool equal_params
;
7672 isl_space
*domain_space
, *pa_space
;
7674 pa_space
= isl_pw_aff_peek_space(pa
);
7675 is_set
= isl_space_is_set(pa_space
);
7679 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
7680 "expecting parametric expression", goto error
);
7682 domain_space
= isl_union_set_get_space(domain
);
7683 pa_space
= isl_pw_aff_get_space(pa
);
7684 equal_params
= isl_space_has_equal_params(domain_space
, pa_space
);
7685 if (equal_params
>= 0 && !equal_params
) {
7688 space
= isl_space_align_params(domain_space
, pa_space
);
7689 pa
= isl_pw_aff_align_params(pa
, isl_space_copy(space
));
7690 domain
= isl_union_set_align_params(domain
, space
);
7692 isl_space_free(domain_space
);
7693 isl_space_free(pa_space
);
7696 if (equal_params
< 0)
7698 return isl_union_pw_aff_pw_aff_on_domain_aligned(domain
, pa
);
7700 isl_union_set_free(domain
);
7701 isl_pw_aff_free(pa
);
7705 /* Internal data structure for isl_union_pw_aff_val_on_domain.
7706 * "v" is the value that the resulting isl_union_pw_aff needs to attain.
7707 * "res" collects the results.
7709 struct isl_union_pw_aff_val_on_domain_data
{
7711 isl_union_pw_aff
*res
;
7714 /* Construct a piecewise affine expression that is equal to data->v
7715 * on "domain" and add the result to data->res.
7717 static isl_stat
pw_aff_val_on_domain(__isl_take isl_set
*domain
, void *user
)
7719 struct isl_union_pw_aff_val_on_domain_data
*data
= user
;
7723 v
= isl_val_copy(data
->v
);
7724 pa
= isl_pw_aff_val_on_domain(domain
, v
);
7725 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7727 return data
->res
? isl_stat_ok
: isl_stat_error
;
7730 /* Return a union piecewise affine expression
7731 * that is equal to "v" on "domain".
7733 * Construct an isl_pw_aff on each of the sets in "domain" and
7734 * collect the results.
7736 __isl_give isl_union_pw_aff
*isl_union_pw_aff_val_on_domain(
7737 __isl_take isl_union_set
*domain
, __isl_take isl_val
*v
)
7739 struct isl_union_pw_aff_val_on_domain_data data
;
7742 space
= isl_union_set_get_space(domain
);
7743 data
.res
= isl_union_pw_aff_empty(space
);
7745 if (isl_union_set_foreach_set(domain
, &pw_aff_val_on_domain
, &data
) < 0)
7746 data
.res
= isl_union_pw_aff_free(data
.res
);
7747 isl_union_set_free(domain
);
7752 /* Construct a piecewise multi affine expression
7753 * that is equal to "pa" and add it to upma.
7755 static isl_stat
pw_multi_aff_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
,
7758 isl_union_pw_multi_aff
**upma
= user
;
7759 isl_pw_multi_aff
*pma
;
7761 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
7762 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
7764 return *upma
? isl_stat_ok
: isl_stat_error
;
7767 /* Construct and return a union piecewise multi affine expression
7768 * that is equal to the given union piecewise affine expression.
7770 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_pw_aff(
7771 __isl_take isl_union_pw_aff
*upa
)
7774 isl_union_pw_multi_aff
*upma
;
7779 space
= isl_union_pw_aff_get_space(upa
);
7780 upma
= isl_union_pw_multi_aff_empty(space
);
7782 if (isl_union_pw_aff_foreach_pw_aff(upa
,
7783 &pw_multi_aff_from_pw_aff_entry
, &upma
) < 0)
7784 upma
= isl_union_pw_multi_aff_free(upma
);
7786 isl_union_pw_aff_free(upa
);
7790 /* Compute the set of elements in the domain of "pa" where it is zero and
7791 * add this set to "uset".
7793 static isl_stat
zero_union_set(__isl_take isl_pw_aff
*pa
, void *user
)
7795 isl_union_set
**uset
= (isl_union_set
**)user
;
7797 *uset
= isl_union_set_add_set(*uset
, isl_pw_aff_zero_set(pa
));
7799 return *uset
? isl_stat_ok
: isl_stat_error
;
7802 /* Return a union set containing those elements in the domain
7803 * of "upa" where it is zero.
7805 __isl_give isl_union_set
*isl_union_pw_aff_zero_union_set(
7806 __isl_take isl_union_pw_aff
*upa
)
7808 isl_union_set
*zero
;
7810 zero
= isl_union_set_empty(isl_union_pw_aff_get_space(upa
));
7811 if (isl_union_pw_aff_foreach_pw_aff(upa
, &zero_union_set
, &zero
) < 0)
7812 zero
= isl_union_set_free(zero
);
7814 isl_union_pw_aff_free(upa
);
7818 /* Internal data structure for isl_union_pw_aff_pullback_union_pw_multi_aff.
7819 * upma is the function that is plugged in.
7820 * pa is the current part of the function in which upma is plugged in.
7821 * res collects the results.
7823 struct isl_union_pw_aff_pullback_upma_data
{
7824 isl_union_pw_multi_aff
*upma
;
7826 isl_union_pw_aff
*res
;
7829 /* Check if "pma" can be plugged into data->pa.
7830 * If so, perform the pullback and add the result to data->res.
7832 static isl_stat
pa_pb_pma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7834 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7837 if (!isl_space_tuple_is_equal(data
->pa
->dim
, isl_dim_in
,
7838 pma
->dim
, isl_dim_out
)) {
7839 isl_pw_multi_aff_free(pma
);
7843 pa
= isl_pw_aff_copy(data
->pa
);
7844 pa
= isl_pw_aff_pullback_pw_multi_aff(pa
, pma
);
7846 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7848 return data
->res
? isl_stat_ok
: isl_stat_error
;
7851 /* Check if any of the elements of data->upma can be plugged into pa,
7852 * add if so add the result to data->res.
7854 static isl_stat
upa_pb_upma(__isl_take isl_pw_aff
*pa
, void *user
)
7856 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7860 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma
,
7862 isl_pw_aff_free(pa
);
7867 /* Compute the pullback of "upa" by the function represented by "upma".
7868 * In other words, plug in "upma" in "upa". The result contains
7869 * expressions defined over the domain space of "upma".
7871 * Run over all pairs of elements in "upa" and "upma", perform
7872 * the pullback when appropriate and collect the results.
7873 * If the hash value were based on the domain space rather than
7874 * the function space, then we could run through all elements
7875 * of "upma" and directly pick out the corresponding element of "upa".
7877 __isl_give isl_union_pw_aff
*isl_union_pw_aff_pullback_union_pw_multi_aff(
7878 __isl_take isl_union_pw_aff
*upa
,
7879 __isl_take isl_union_pw_multi_aff
*upma
)
7881 struct isl_union_pw_aff_pullback_upma_data data
= { NULL
, NULL
};
7884 space
= isl_union_pw_multi_aff_get_space(upma
);
7885 upa
= isl_union_pw_aff_align_params(upa
, space
);
7886 space
= isl_union_pw_aff_get_space(upa
);
7887 upma
= isl_union_pw_multi_aff_align_params(upma
, space
);
7893 data
.res
= isl_union_pw_aff_alloc_same_size(upa
);
7894 if (isl_union_pw_aff_foreach_pw_aff(upa
, &upa_pb_upma
, &data
) < 0)
7895 data
.res
= isl_union_pw_aff_free(data
.res
);
7897 isl_union_pw_aff_free(upa
);
7898 isl_union_pw_multi_aff_free(upma
);
7901 isl_union_pw_aff_free(upa
);
7902 isl_union_pw_multi_aff_free(upma
);
7907 #define BASE union_pw_aff
7909 #define DOMBASE union_set
7911 #define NO_MOVE_DIMS
7918 #include <isl_multi_explicit_domain.c>
7919 #include <isl_multi_union_pw_aff_explicit_domain.c>
7920 #include <isl_multi_templ.c>
7921 #include <isl_multi_apply_set.c>
7922 #include <isl_multi_apply_union_set.c>
7923 #include <isl_multi_coalesce.c>
7924 #include <isl_multi_floor.c>
7925 #include <isl_multi_gist.c>
7926 #include <isl_multi_align_set.c>
7927 #include <isl_multi_align_union_set.c>
7928 #include <isl_multi_intersect.c>
7930 /* Does "mupa" have a non-trivial explicit domain?
7932 * The explicit domain, if present, is trivial if it represents
7933 * an (obviously) universe parameter set.
7935 isl_bool
isl_multi_union_pw_aff_has_non_trivial_domain(
7936 __isl_keep isl_multi_union_pw_aff
*mupa
)
7938 isl_bool is_params
, trivial
;
7942 return isl_bool_error
;
7943 if (!isl_multi_union_pw_aff_has_explicit_domain(mupa
))
7944 return isl_bool_false
;
7945 is_params
= isl_union_set_is_params(mupa
->u
.dom
);
7946 if (is_params
< 0 || !is_params
)
7947 return isl_bool_not(is_params
);
7948 set
= isl_set_from_union_set(isl_union_set_copy(mupa
->u
.dom
));
7949 trivial
= isl_set_plain_is_universe(set
);
7951 return isl_bool_not(trivial
);
7954 /* Construct a multiple union piecewise affine expression
7955 * in the given space with value zero in each of the output dimensions.
7957 * Since there is no canonical zero value for
7958 * a union piecewise affine expression, we can only construct
7959 * a zero-dimensional "zero" value.
7961 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_zero(
7962 __isl_take isl_space
*space
)
7969 params
= isl_space_is_params(space
);
7973 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7974 "expecting proper set space", goto error
);
7975 if (!isl_space_is_set(space
))
7976 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7977 "expecting set space", goto error
);
7978 if (isl_space_dim(space
, isl_dim_out
) != 0)
7979 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7980 "expecting 0D space", goto error
);
7982 return isl_multi_union_pw_aff_alloc(space
);
7984 isl_space_free(space
);
7988 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
7989 * with the actual sum on the shared domain and
7990 * the defined expression on the symmetric difference of the domains.
7992 * We simply iterate over the elements in both arguments and
7993 * call isl_union_pw_aff_union_add on each of them, if there is
7994 * at least one element.
7996 * Otherwise, the two expressions have an explicit domain and
7997 * the union of these explicit domains is computed.
7998 * This assumes that the explicit domains are either both in terms
7999 * of specific domains elements or both in terms of parameters.
8000 * However, if one of the expressions does not have any constraints
8001 * on its explicit domain, then this is allowed as well and the result
8002 * is the expression with no constraints on its explicit domain.
8004 static __isl_give isl_multi_union_pw_aff
*
8005 isl_multi_union_pw_aff_union_add_aligned(
8006 __isl_take isl_multi_union_pw_aff
*mupa1
,
8007 __isl_take isl_multi_union_pw_aff
*mupa2
)
8009 isl_bool has_domain
, is_params1
, is_params2
;
8011 if (isl_multi_union_pw_aff_check_equal_space(mupa1
, mupa2
) < 0)
8014 return isl_multi_union_pw_aff_bin_op(mupa1
, mupa2
,
8015 &isl_union_pw_aff_union_add
);
8016 if (isl_multi_union_pw_aff_check_has_explicit_domain(mupa1
) < 0 ||
8017 isl_multi_union_pw_aff_check_has_explicit_domain(mupa2
) < 0)
8020 has_domain
= isl_multi_union_pw_aff_has_non_trivial_domain(mupa1
);
8024 isl_multi_union_pw_aff_free(mupa2
);
8027 has_domain
= isl_multi_union_pw_aff_has_non_trivial_domain(mupa2
);
8031 isl_multi_union_pw_aff_free(mupa1
);
8035 is_params1
= isl_union_set_is_params(mupa1
->u
.dom
);
8036 is_params2
= isl_union_set_is_params(mupa2
->u
.dom
);
8037 if (is_params1
< 0 || is_params2
< 0)
8039 if (is_params1
!= is_params2
)
8040 isl_die(isl_multi_union_pw_aff_get_ctx(mupa1
),
8042 "cannot compute union of concrete domain and "
8043 "parameter constraints", goto error
);
8044 mupa1
= isl_multi_union_pw_aff_cow(mupa1
);
8047 mupa1
->u
.dom
= isl_union_set_union(mupa1
->u
.dom
,
8048 isl_union_set_copy(mupa2
->u
.dom
));
8051 isl_multi_union_pw_aff_free(mupa2
);
8054 isl_multi_union_pw_aff_free(mupa1
);
8055 isl_multi_union_pw_aff_free(mupa2
);
8059 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
8060 * with the actual sum on the shared domain and
8061 * the defined expression on the symmetric difference of the domains.
8063 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_union_add(
8064 __isl_take isl_multi_union_pw_aff
*mupa1
,
8065 __isl_take isl_multi_union_pw_aff
*mupa2
)
8067 return isl_multi_union_pw_aff_align_params_multi_multi_and(mupa1
, mupa2
,
8068 &isl_multi_union_pw_aff_union_add_aligned
);
8071 /* Construct and return a multi union piecewise affine expression
8072 * that is equal to the given multi affine expression.
8074 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_aff(
8075 __isl_take isl_multi_aff
*ma
)
8077 isl_multi_pw_aff
*mpa
;
8079 mpa
= isl_multi_pw_aff_from_multi_aff(ma
);
8080 return isl_multi_union_pw_aff_from_multi_pw_aff(mpa
);
8083 /* Construct and return a multi union piecewise affine expression
8084 * that is equal to the given multi piecewise affine expression.
8086 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_pw_aff(
8087 __isl_take isl_multi_pw_aff
*mpa
)
8091 isl_multi_union_pw_aff
*mupa
;
8096 space
= isl_multi_pw_aff_get_space(mpa
);
8097 space
= isl_space_range(space
);
8098 mupa
= isl_multi_union_pw_aff_alloc(space
);
8100 n
= isl_multi_pw_aff_dim(mpa
, isl_dim_out
);
8101 for (i
= 0; i
< n
; ++i
) {
8103 isl_union_pw_aff
*upa
;
8105 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
8106 upa
= isl_union_pw_aff_from_pw_aff(pa
);
8107 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8110 isl_multi_pw_aff_free(mpa
);
8115 /* Extract the range space of "pma" and assign it to *space.
8116 * If *space has already been set (through a previous call to this function),
8117 * then check that the range space is the same.
8119 static isl_stat
extract_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8121 isl_space
**space
= user
;
8122 isl_space
*pma_space
;
8125 pma_space
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
8126 isl_pw_multi_aff_free(pma
);
8129 return isl_stat_error
;
8135 equal
= isl_space_is_equal(pma_space
, *space
);
8136 isl_space_free(pma_space
);
8139 return isl_stat_error
;
8141 isl_die(isl_space_get_ctx(*space
), isl_error_invalid
,
8142 "range spaces not the same", return isl_stat_error
);
8146 /* Construct and return a multi union piecewise affine expression
8147 * that is equal to the given union piecewise multi affine expression.
8149 * In order to be able to perform the conversion, the input
8150 * needs to be non-empty and may only involve a single range space.
8152 * If the resulting multi union piecewise affine expression has
8153 * an explicit domain, then assign it the domain of the input.
8154 * In other cases, the domain is stored in the individual elements.
8156 __isl_give isl_multi_union_pw_aff
*
8157 isl_multi_union_pw_aff_from_union_pw_multi_aff(
8158 __isl_take isl_union_pw_multi_aff
*upma
)
8160 isl_space
*space
= NULL
;
8161 isl_multi_union_pw_aff
*mupa
;
8166 if (isl_union_pw_multi_aff_n_pw_multi_aff(upma
) == 0)
8167 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
8168 "cannot extract range space from empty input",
8170 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
, &extract_space
,
8177 n
= isl_space_dim(space
, isl_dim_set
);
8178 mupa
= isl_multi_union_pw_aff_alloc(space
);
8180 for (i
= 0; i
< n
; ++i
) {
8181 isl_union_pw_aff
*upa
;
8183 upa
= isl_union_pw_multi_aff_get_union_pw_aff(upma
, i
);
8184 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8186 if (isl_multi_union_pw_aff_has_explicit_domain(mupa
)) {
8188 isl_union_pw_multi_aff
*copy
;
8190 copy
= isl_union_pw_multi_aff_copy(upma
);
8191 dom
= isl_union_pw_multi_aff_domain(copy
);
8192 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, dom
);
8195 isl_union_pw_multi_aff_free(upma
);
8198 isl_space_free(space
);
8199 isl_union_pw_multi_aff_free(upma
);
8203 /* Try and create an isl_multi_union_pw_aff that is equivalent
8204 * to the given isl_union_map.
8205 * The isl_union_map is required to be single-valued in each space.
8206 * Moreover, it cannot be empty and all range spaces need to be the same.
8207 * Otherwise, an error is produced.
8209 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_union_map(
8210 __isl_take isl_union_map
*umap
)
8212 isl_union_pw_multi_aff
*upma
;
8214 upma
= isl_union_pw_multi_aff_from_union_map(umap
);
8215 return isl_multi_union_pw_aff_from_union_pw_multi_aff(upma
);
8218 /* Return a multiple union piecewise affine expression
8219 * that is equal to "mv" on "domain", assuming "domain" and "mv"
8220 * have been aligned.
8222 * If the resulting multi union piecewise affine expression has
8223 * an explicit domain, then assign it the input domain.
8224 * In other cases, the domain is stored in the individual elements.
8226 static __isl_give isl_multi_union_pw_aff
*
8227 isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8228 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8232 isl_multi_union_pw_aff
*mupa
;
8237 n
= isl_multi_val_dim(mv
, isl_dim_set
);
8238 space
= isl_multi_val_get_space(mv
);
8239 mupa
= isl_multi_union_pw_aff_alloc(space
);
8240 for (i
= 0; i
< n
; ++i
) {
8242 isl_union_pw_aff
*upa
;
8244 v
= isl_multi_val_get_val(mv
, i
);
8245 upa
= isl_union_pw_aff_val_on_domain(isl_union_set_copy(domain
),
8247 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8249 if (isl_multi_union_pw_aff_has_explicit_domain(mupa
))
8250 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
,
8251 isl_union_set_copy(domain
));
8253 isl_union_set_free(domain
);
8254 isl_multi_val_free(mv
);
8257 isl_union_set_free(domain
);
8258 isl_multi_val_free(mv
);
8262 /* Return a multiple union piecewise affine expression
8263 * that is equal to "mv" on "domain".
8265 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_val_on_domain(
8266 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8268 isl_bool equal_params
;
8272 equal_params
= isl_space_has_equal_params(domain
->dim
, mv
->space
);
8273 if (equal_params
< 0)
8276 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8278 domain
= isl_union_set_align_params(domain
,
8279 isl_multi_val_get_space(mv
));
8280 mv
= isl_multi_val_align_params(mv
, isl_union_set_get_space(domain
));
8281 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(domain
, mv
);
8283 isl_union_set_free(domain
);
8284 isl_multi_val_free(mv
);
8288 /* Return a multiple union piecewise affine expression
8289 * that is equal to "ma" on "domain".
8291 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_aff_on_domain(
8292 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8294 isl_pw_multi_aff
*pma
;
8296 pma
= isl_pw_multi_aff_from_multi_aff(ma
);
8297 return isl_multi_union_pw_aff_pw_multi_aff_on_domain(domain
, pma
);
8300 /* Return a multiple union piecewise affine expression
8301 * that is equal to "pma" on "domain", assuming "domain" and "pma"
8302 * have been aligned.
8304 * If the resulting multi union piecewise affine expression has
8305 * an explicit domain, then assign it the input domain.
8306 * In other cases, the domain is stored in the individual elements.
8308 static __isl_give isl_multi_union_pw_aff
*
8309 isl_multi_union_pw_aff_pw_multi_aff_on_domain_aligned(
8310 __isl_take isl_union_set
*domain
, __isl_take isl_pw_multi_aff
*pma
)
8314 isl_multi_union_pw_aff
*mupa
;
8316 if (!domain
|| !pma
)
8319 n
= isl_pw_multi_aff_dim(pma
, isl_dim_set
);
8320 space
= isl_pw_multi_aff_get_space(pma
);
8321 mupa
= isl_multi_union_pw_aff_alloc(space
);
8322 for (i
= 0; i
< n
; ++i
) {
8324 isl_union_pw_aff
*upa
;
8326 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
8327 upa
= isl_union_pw_aff_pw_aff_on_domain(
8328 isl_union_set_copy(domain
), pa
);
8329 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8331 if (isl_multi_union_pw_aff_has_explicit_domain(mupa
))
8332 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
,
8333 isl_union_set_copy(domain
));
8335 isl_union_set_free(domain
);
8336 isl_pw_multi_aff_free(pma
);
8339 isl_union_set_free(domain
);
8340 isl_pw_multi_aff_free(pma
);
8344 /* Return a multiple union piecewise affine expression
8345 * that is equal to "pma" on "domain".
8347 __isl_give isl_multi_union_pw_aff
*
8348 isl_multi_union_pw_aff_pw_multi_aff_on_domain(__isl_take isl_union_set
*domain
,
8349 __isl_take isl_pw_multi_aff
*pma
)
8351 isl_bool equal_params
;
8354 space
= isl_pw_multi_aff_peek_space(pma
);
8355 equal_params
= isl_union_set_space_has_equal_params(domain
, space
);
8356 if (equal_params
< 0)
8359 return isl_multi_union_pw_aff_pw_multi_aff_on_domain_aligned(
8361 domain
= isl_union_set_align_params(domain
,
8362 isl_pw_multi_aff_get_space(pma
));
8363 pma
= isl_pw_multi_aff_align_params(pma
,
8364 isl_union_set_get_space(domain
));
8365 return isl_multi_union_pw_aff_pw_multi_aff_on_domain_aligned(domain
,
8368 isl_union_set_free(domain
);
8369 isl_pw_multi_aff_free(pma
);
8373 /* Return a union set containing those elements in the domains
8374 * of the elements of "mupa" where they are all zero.
8376 * If there are no elements, then simply return the entire domain.
8378 __isl_give isl_union_set
*isl_multi_union_pw_aff_zero_union_set(
8379 __isl_take isl_multi_union_pw_aff
*mupa
)
8382 isl_union_pw_aff
*upa
;
8383 isl_union_set
*zero
;
8388 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8390 return isl_multi_union_pw_aff_domain(mupa
);
8392 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8393 zero
= isl_union_pw_aff_zero_union_set(upa
);
8395 for (i
= 1; i
< n
; ++i
) {
8396 isl_union_set
*zero_i
;
8398 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8399 zero_i
= isl_union_pw_aff_zero_union_set(upa
);
8401 zero
= isl_union_set_intersect(zero
, zero_i
);
8404 isl_multi_union_pw_aff_free(mupa
);
8408 /* Construct a union map mapping the shared domain
8409 * of the union piecewise affine expressions to the range of "mupa"
8410 * in the special case of a 0D multi union piecewise affine expression.
8412 * Construct a map between the explicit domain of "mupa" and
8414 * Note that this assumes that the domain consists of explicit elements.
8416 static __isl_give isl_union_map
*isl_union_map_from_multi_union_pw_aff_0D(
8417 __isl_take isl_multi_union_pw_aff
*mupa
)
8421 isl_union_set
*dom
, *ran
;
8423 space
= isl_multi_union_pw_aff_get_space(mupa
);
8424 dom
= isl_multi_union_pw_aff_domain(mupa
);
8425 ran
= isl_union_set_from_set(isl_set_universe(space
));
8427 is_params
= isl_union_set_is_params(dom
);
8429 dom
= isl_union_set_free(dom
);
8431 isl_die(isl_union_set_get_ctx(dom
), isl_error_invalid
,
8432 "cannot create union map from expression without "
8433 "explicit domain elements",
8434 dom
= isl_union_set_free(dom
));
8436 return isl_union_map_from_domain_and_range(dom
, ran
);
8439 /* Construct a union map mapping the shared domain
8440 * of the union piecewise affine expressions to the range of "mupa"
8441 * with each dimension in the range equated to the
8442 * corresponding union piecewise affine expression.
8444 * If the input is zero-dimensional, then construct a mapping
8445 * from its explicit domain.
8447 __isl_give isl_union_map
*isl_union_map_from_multi_union_pw_aff(
8448 __isl_take isl_multi_union_pw_aff
*mupa
)
8452 isl_union_map
*umap
;
8453 isl_union_pw_aff
*upa
;
8458 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8460 return isl_union_map_from_multi_union_pw_aff_0D(mupa
);
8462 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8463 umap
= isl_union_map_from_union_pw_aff(upa
);
8465 for (i
= 1; i
< n
; ++i
) {
8466 isl_union_map
*umap_i
;
8468 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8469 umap_i
= isl_union_map_from_union_pw_aff(upa
);
8470 umap
= isl_union_map_flat_range_product(umap
, umap_i
);
8473 space
= isl_multi_union_pw_aff_get_space(mupa
);
8474 umap
= isl_union_map_reset_range_space(umap
, space
);
8476 isl_multi_union_pw_aff_free(mupa
);
8480 /* Internal data structure for isl_union_pw_multi_aff_reset_range_space.
8481 * "range" is the space from which to set the range space.
8482 * "res" collects the results.
8484 struct isl_union_pw_multi_aff_reset_range_space_data
{
8486 isl_union_pw_multi_aff
*res
;
8489 /* Replace the range space of "pma" by the range space of data->range and
8490 * add the result to data->res.
8492 static isl_stat
reset_range_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8494 struct isl_union_pw_multi_aff_reset_range_space_data
*data
= user
;
8497 space
= isl_pw_multi_aff_get_space(pma
);
8498 space
= isl_space_domain(space
);
8499 space
= isl_space_extend_domain_with_range(space
,
8500 isl_space_copy(data
->range
));
8501 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
8502 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
8504 return data
->res
? isl_stat_ok
: isl_stat_error
;
8507 /* Replace the range space of all the piecewise affine expressions in "upma" by
8508 * the range space of "space".
8510 * This assumes that all these expressions have the same output dimension.
8512 * Since the spaces of the expressions change, so do their hash values.
8513 * We therefore need to create a new isl_union_pw_multi_aff.
8514 * Note that the hash value is currently computed based on the entire
8515 * space even though there can only be a single expression with a given
8518 static __isl_give isl_union_pw_multi_aff
*
8519 isl_union_pw_multi_aff_reset_range_space(
8520 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_space
*space
)
8522 struct isl_union_pw_multi_aff_reset_range_space_data data
= { space
};
8523 isl_space
*space_upma
;
8525 space_upma
= isl_union_pw_multi_aff_get_space(upma
);
8526 data
.res
= isl_union_pw_multi_aff_empty(space_upma
);
8527 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
8528 &reset_range_space
, &data
) < 0)
8529 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
8531 isl_space_free(space
);
8532 isl_union_pw_multi_aff_free(upma
);
8536 /* Construct and return a union piecewise multi affine expression
8537 * that is equal to the given multi union piecewise affine expression,
8538 * in the special case of a 0D multi union piecewise affine expression.
8540 * Construct a union piecewise multi affine expression
8541 * on top of the explicit domain of the input.
8543 __isl_give isl_union_pw_multi_aff
*
8544 isl_union_pw_multi_aff_from_multi_union_pw_aff_0D(
8545 __isl_take isl_multi_union_pw_aff
*mupa
)
8549 isl_union_set
*domain
;
8551 space
= isl_multi_union_pw_aff_get_space(mupa
);
8552 mv
= isl_multi_val_zero(space
);
8553 domain
= isl_multi_union_pw_aff_domain(mupa
);
8554 return isl_union_pw_multi_aff_multi_val_on_domain(domain
, mv
);
8557 /* Construct and return a union piecewise multi affine expression
8558 * that is equal to the given multi union piecewise affine expression.
8560 * If the input is zero-dimensional, then
8561 * construct a union piecewise multi affine expression
8562 * on top of the explicit domain of the input.
8564 __isl_give isl_union_pw_multi_aff
*
8565 isl_union_pw_multi_aff_from_multi_union_pw_aff(
8566 __isl_take isl_multi_union_pw_aff
*mupa
)
8570 isl_union_pw_multi_aff
*upma
;
8571 isl_union_pw_aff
*upa
;
8576 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8578 return isl_union_pw_multi_aff_from_multi_union_pw_aff_0D(mupa
);
8580 space
= isl_multi_union_pw_aff_get_space(mupa
);
8581 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8582 upma
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8584 for (i
= 1; i
< n
; ++i
) {
8585 isl_union_pw_multi_aff
*upma_i
;
8587 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8588 upma_i
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8589 upma
= isl_union_pw_multi_aff_flat_range_product(upma
, upma_i
);
8592 upma
= isl_union_pw_multi_aff_reset_range_space(upma
, space
);
8594 isl_multi_union_pw_aff_free(mupa
);
8598 /* Intersect the range of "mupa" with "range",
8599 * in the special case where "mupa" is 0D.
8601 * Intersect the domain of "mupa" with the constraints on the parameters
8604 static __isl_give isl_multi_union_pw_aff
*mupa_intersect_range_0D(
8605 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_set
*range
)
8607 range
= isl_set_params(range
);
8608 mupa
= isl_multi_union_pw_aff_intersect_params(mupa
, range
);
8612 /* Intersect the range of "mupa" with "range".
8613 * That is, keep only those domain elements that have a function value
8616 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_intersect_range(
8617 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_set
*range
)
8619 isl_union_pw_multi_aff
*upma
;
8620 isl_union_set
*domain
;
8625 if (!mupa
|| !range
)
8628 space
= isl_set_get_space(range
);
8629 match
= isl_space_tuple_is_equal(mupa
->space
, isl_dim_set
,
8630 space
, isl_dim_set
);
8631 isl_space_free(space
);
8635 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8636 "space don't match", goto error
);
8637 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8639 return mupa_intersect_range_0D(mupa
, range
);
8641 upma
= isl_union_pw_multi_aff_from_multi_union_pw_aff(
8642 isl_multi_union_pw_aff_copy(mupa
));
8643 domain
= isl_union_set_from_set(range
);
8644 domain
= isl_union_set_preimage_union_pw_multi_aff(domain
, upma
);
8645 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, domain
);
8649 isl_multi_union_pw_aff_free(mupa
);
8650 isl_set_free(range
);
8654 /* Return the shared domain of the elements of "mupa",
8655 * in the special case where "mupa" is zero-dimensional.
8657 * Return the explicit domain of "mupa".
8658 * Note that this domain may be a parameter set, either
8659 * because "mupa" is meant to live in a set space or
8660 * because no explicit domain has been set.
8662 __isl_give isl_union_set
*isl_multi_union_pw_aff_domain_0D(
8663 __isl_take isl_multi_union_pw_aff
*mupa
)
8667 dom
= isl_multi_union_pw_aff_get_explicit_domain(mupa
);
8668 isl_multi_union_pw_aff_free(mupa
);
8673 /* Return the shared domain of the elements of "mupa".
8675 * If "mupa" is zero-dimensional, then return its explicit domain.
8677 __isl_give isl_union_set
*isl_multi_union_pw_aff_domain(
8678 __isl_take isl_multi_union_pw_aff
*mupa
)
8681 isl_union_pw_aff
*upa
;
8687 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8689 return isl_multi_union_pw_aff_domain_0D(mupa
);
8691 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8692 dom
= isl_union_pw_aff_domain(upa
);
8693 for (i
= 1; i
< n
; ++i
) {
8694 isl_union_set
*dom_i
;
8696 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8697 dom_i
= isl_union_pw_aff_domain(upa
);
8698 dom
= isl_union_set_intersect(dom
, dom_i
);
8701 isl_multi_union_pw_aff_free(mupa
);
8705 /* Apply "aff" to "mupa". The space of "mupa" is equal to the domain of "aff".
8706 * In particular, the spaces have been aligned.
8707 * The result is defined over the shared domain of the elements of "mupa"
8709 * We first extract the parametric constant part of "aff" and
8710 * define that over the shared domain.
8711 * Then we iterate over all input dimensions of "aff" and add the corresponding
8712 * multiples of the elements of "mupa".
8713 * Finally, we consider the integer divisions, calling the function
8714 * recursively to obtain an isl_union_pw_aff corresponding to the
8715 * integer division argument.
8717 static __isl_give isl_union_pw_aff
*multi_union_pw_aff_apply_aff(
8718 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8721 isl_union_pw_aff
*upa
;
8722 isl_union_set
*uset
;
8726 n_in
= isl_aff_dim(aff
, isl_dim_in
);
8727 n_div
= isl_aff_dim(aff
, isl_dim_div
);
8729 uset
= isl_multi_union_pw_aff_domain(isl_multi_union_pw_aff_copy(mupa
));
8730 cst
= isl_aff_copy(aff
);
8731 cst
= isl_aff_drop_dims(cst
, isl_dim_div
, 0, n_div
);
8732 cst
= isl_aff_drop_dims(cst
, isl_dim_in
, 0, n_in
);
8733 cst
= isl_aff_project_domain_on_params(cst
);
8734 upa
= isl_union_pw_aff_aff_on_domain(uset
, cst
);
8736 for (i
= 0; i
< n_in
; ++i
) {
8737 isl_union_pw_aff
*upa_i
;
8739 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
8741 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
8742 upa_i
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8743 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8744 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8747 for (i
= 0; i
< n_div
; ++i
) {
8749 isl_union_pw_aff
*upa_i
;
8751 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
8753 div
= isl_aff_get_div(aff
, i
);
8754 upa_i
= multi_union_pw_aff_apply_aff(
8755 isl_multi_union_pw_aff_copy(mupa
), div
);
8756 upa_i
= isl_union_pw_aff_floor(upa_i
);
8757 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
8758 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8759 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8762 isl_multi_union_pw_aff_free(mupa
);
8768 /* Apply "aff" to "mupa". The space of "mupa" needs to be compatible
8769 * with the domain of "aff".
8770 * Furthermore, the dimension of this space needs to be greater than zero.
8771 * The result is defined over the shared domain of the elements of "mupa"
8773 * We perform these checks and then hand over control to
8774 * multi_union_pw_aff_apply_aff.
8776 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_aff(
8777 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8779 isl_space
*space1
, *space2
;
8782 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8783 isl_aff_get_space(aff
));
8784 aff
= isl_aff_align_params(aff
, isl_multi_union_pw_aff_get_space(mupa
));
8788 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8789 space2
= isl_aff_get_domain_space(aff
);
8790 equal
= isl_space_is_equal(space1
, space2
);
8791 isl_space_free(space1
);
8792 isl_space_free(space2
);
8796 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8797 "spaces don't match", goto error
);
8798 if (isl_aff_dim(aff
, isl_dim_in
) == 0)
8799 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8800 "cannot determine domains", goto error
);
8802 return multi_union_pw_aff_apply_aff(mupa
, aff
);
8804 isl_multi_union_pw_aff_free(mupa
);
8809 /* Apply "ma" to "mupa", in the special case where "mupa" is 0D.
8810 * The space of "mupa" is known to be compatible with the domain of "ma".
8812 * Construct an isl_multi_union_pw_aff that is equal to "ma"
8813 * on the domain of "mupa".
8815 static __isl_give isl_multi_union_pw_aff
*mupa_apply_multi_aff_0D(
8816 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_multi_aff
*ma
)
8820 dom
= isl_multi_union_pw_aff_domain(mupa
);
8821 ma
= isl_multi_aff_project_domain_on_params(ma
);
8823 return isl_multi_union_pw_aff_multi_aff_on_domain(dom
, ma
);
8826 /* Apply "ma" to "mupa". The space of "mupa" needs to be compatible
8827 * with the domain of "ma".
8828 * The result is defined over the shared domain of the elements of "mupa"
8830 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_multi_aff(
8831 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_multi_aff
*ma
)
8833 isl_space
*space1
, *space2
;
8834 isl_multi_union_pw_aff
*res
;
8838 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8839 isl_multi_aff_get_space(ma
));
8840 ma
= isl_multi_aff_align_params(ma
,
8841 isl_multi_union_pw_aff_get_space(mupa
));
8845 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8846 space2
= isl_multi_aff_get_domain_space(ma
);
8847 equal
= isl_space_is_equal(space1
, space2
);
8848 isl_space_free(space1
);
8849 isl_space_free(space2
);
8853 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8854 "spaces don't match", goto error
);
8855 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
8856 if (isl_multi_aff_dim(ma
, isl_dim_in
) == 0)
8857 return mupa_apply_multi_aff_0D(mupa
, ma
);
8859 space1
= isl_space_range(isl_multi_aff_get_space(ma
));
8860 res
= isl_multi_union_pw_aff_alloc(space1
);
8862 for (i
= 0; i
< n_out
; ++i
) {
8864 isl_union_pw_aff
*upa
;
8866 aff
= isl_multi_aff_get_aff(ma
, i
);
8867 upa
= multi_union_pw_aff_apply_aff(
8868 isl_multi_union_pw_aff_copy(mupa
), aff
);
8869 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8872 isl_multi_aff_free(ma
);
8873 isl_multi_union_pw_aff_free(mupa
);
8876 isl_multi_union_pw_aff_free(mupa
);
8877 isl_multi_aff_free(ma
);
8881 /* Apply "pa" to "mupa", in the special case where "mupa" is 0D.
8882 * The space of "mupa" is known to be compatible with the domain of "pa".
8884 * Construct an isl_multi_union_pw_aff that is equal to "pa"
8885 * on the domain of "mupa".
8887 static __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_aff_0D(
8888 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_pw_aff
*pa
)
8892 dom
= isl_multi_union_pw_aff_domain(mupa
);
8893 pa
= isl_pw_aff_project_domain_on_params(pa
);
8895 return isl_union_pw_aff_pw_aff_on_domain(dom
, pa
);
8898 /* Apply "pa" to "mupa". The space of "mupa" needs to be compatible
8899 * with the domain of "pa".
8900 * Furthermore, the dimension of this space needs to be greater than zero.
8901 * The result is defined over the shared domain of the elements of "mupa"
8903 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_aff(
8904 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_pw_aff
*pa
)
8908 isl_space
*space
, *space2
;
8909 isl_union_pw_aff
*upa
;
8911 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8912 isl_pw_aff_get_space(pa
));
8913 pa
= isl_pw_aff_align_params(pa
,
8914 isl_multi_union_pw_aff_get_space(mupa
));
8918 space
= isl_multi_union_pw_aff_get_space(mupa
);
8919 space2
= isl_pw_aff_get_domain_space(pa
);
8920 equal
= isl_space_is_equal(space
, space2
);
8921 isl_space_free(space
);
8922 isl_space_free(space2
);
8926 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8927 "spaces don't match", goto error
);
8928 if (isl_pw_aff_dim(pa
, isl_dim_in
) == 0)
8929 return isl_multi_union_pw_aff_apply_pw_aff_0D(mupa
, pa
);
8931 space
= isl_space_params(isl_multi_union_pw_aff_get_space(mupa
));
8932 upa
= isl_union_pw_aff_empty(space
);
8934 for (i
= 0; i
< pa
->n
; ++i
) {
8937 isl_multi_union_pw_aff
*mupa_i
;
8938 isl_union_pw_aff
*upa_i
;
8940 mupa_i
= isl_multi_union_pw_aff_copy(mupa
);
8941 domain
= isl_set_copy(pa
->p
[i
].set
);
8942 mupa_i
= isl_multi_union_pw_aff_intersect_range(mupa_i
, domain
);
8943 aff
= isl_aff_copy(pa
->p
[i
].aff
);
8944 upa_i
= multi_union_pw_aff_apply_aff(mupa_i
, aff
);
8945 upa
= isl_union_pw_aff_union_add(upa
, upa_i
);
8948 isl_multi_union_pw_aff_free(mupa
);
8949 isl_pw_aff_free(pa
);
8952 isl_multi_union_pw_aff_free(mupa
);
8953 isl_pw_aff_free(pa
);
8957 /* Apply "pma" to "mupa", in the special case where "mupa" is 0D.
8958 * The space of "mupa" is known to be compatible with the domain of "pma".
8960 * Construct an isl_multi_union_pw_aff that is equal to "pma"
8961 * on the domain of "mupa".
8963 static __isl_give isl_multi_union_pw_aff
*mupa_apply_pw_multi_aff_0D(
8964 __isl_take isl_multi_union_pw_aff
*mupa
,
8965 __isl_take isl_pw_multi_aff
*pma
)
8969 dom
= isl_multi_union_pw_aff_domain(mupa
);
8970 pma
= isl_pw_multi_aff_project_domain_on_params(pma
);
8972 return isl_multi_union_pw_aff_pw_multi_aff_on_domain(dom
, pma
);
8975 /* Apply "pma" to "mupa". The space of "mupa" needs to be compatible
8976 * with the domain of "pma".
8977 * The result is defined over the shared domain of the elements of "mupa"
8979 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_multi_aff(
8980 __isl_take isl_multi_union_pw_aff
*mupa
,
8981 __isl_take isl_pw_multi_aff
*pma
)
8983 isl_space
*space1
, *space2
;
8984 isl_multi_union_pw_aff
*res
;
8988 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8989 isl_pw_multi_aff_get_space(pma
));
8990 pma
= isl_pw_multi_aff_align_params(pma
,
8991 isl_multi_union_pw_aff_get_space(mupa
));
8995 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8996 space2
= isl_pw_multi_aff_get_domain_space(pma
);
8997 equal
= isl_space_is_equal(space1
, space2
);
8998 isl_space_free(space1
);
8999 isl_space_free(space2
);
9003 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
9004 "spaces don't match", goto error
);
9005 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
9006 if (isl_pw_multi_aff_dim(pma
, isl_dim_in
) == 0)
9007 return mupa_apply_pw_multi_aff_0D(mupa
, pma
);
9009 space1
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
9010 res
= isl_multi_union_pw_aff_alloc(space1
);
9012 for (i
= 0; i
< n_out
; ++i
) {
9014 isl_union_pw_aff
*upa
;
9016 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
9017 upa
= isl_multi_union_pw_aff_apply_pw_aff(
9018 isl_multi_union_pw_aff_copy(mupa
), pa
);
9019 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
9022 isl_pw_multi_aff_free(pma
);
9023 isl_multi_union_pw_aff_free(mupa
);
9026 isl_multi_union_pw_aff_free(mupa
);
9027 isl_pw_multi_aff_free(pma
);
9031 /* Replace the explicit domain of "mupa" by its preimage under "upma".
9032 * If the explicit domain only keeps track of constraints on the parameters,
9033 * then only update those constraints.
9035 static __isl_give isl_multi_union_pw_aff
*preimage_explicit_domain(
9036 __isl_take isl_multi_union_pw_aff
*mupa
,
9037 __isl_keep isl_union_pw_multi_aff
*upma
)
9041 if (isl_multi_union_pw_aff_check_has_explicit_domain(mupa
) < 0)
9042 return isl_multi_union_pw_aff_free(mupa
);
9044 mupa
= isl_multi_union_pw_aff_cow(mupa
);
9048 is_params
= isl_union_set_is_params(mupa
->u
.dom
);
9050 return isl_multi_union_pw_aff_free(mupa
);
9052 upma
= isl_union_pw_multi_aff_copy(upma
);
9054 mupa
->u
.dom
= isl_union_set_intersect_params(mupa
->u
.dom
,
9055 isl_union_set_params(isl_union_pw_multi_aff_domain(upma
)));
9057 mupa
->u
.dom
= isl_union_set_preimage_union_pw_multi_aff(
9060 return isl_multi_union_pw_aff_free(mupa
);
9064 /* Compute the pullback of "mupa" by the function represented by "upma".
9065 * In other words, plug in "upma" in "mupa". The result contains
9066 * expressions defined over the domain space of "upma".
9068 * Run over all elements of "mupa" and plug in "upma" in each of them.
9070 * If "mupa" has an explicit domain, then it is this domain
9071 * that needs to undergo a pullback instead, i.e., a preimage.
9073 __isl_give isl_multi_union_pw_aff
*
9074 isl_multi_union_pw_aff_pullback_union_pw_multi_aff(
9075 __isl_take isl_multi_union_pw_aff
*mupa
,
9076 __isl_take isl_union_pw_multi_aff
*upma
)
9080 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
9081 isl_union_pw_multi_aff_get_space(upma
));
9082 upma
= isl_union_pw_multi_aff_align_params(upma
,
9083 isl_multi_union_pw_aff_get_space(mupa
));
9084 mupa
= isl_multi_union_pw_aff_cow(mupa
);
9088 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
9089 for (i
= 0; i
< n
; ++i
) {
9090 isl_union_pw_aff
*upa
;
9092 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
9093 upa
= isl_union_pw_aff_pullback_union_pw_multi_aff(upa
,
9094 isl_union_pw_multi_aff_copy(upma
));
9095 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
9098 if (isl_multi_union_pw_aff_has_explicit_domain(mupa
))
9099 mupa
= preimage_explicit_domain(mupa
, upma
);
9101 isl_union_pw_multi_aff_free(upma
);
9104 isl_multi_union_pw_aff_free(mupa
);
9105 isl_union_pw_multi_aff_free(upma
);
9109 /* Extract the sequence of elements in "mupa" with domain space "space"
9110 * (ignoring parameters).
9112 * For the elements of "mupa" that are not defined on the specified space,
9113 * the corresponding element in the result is empty.
9115 __isl_give isl_multi_pw_aff
*isl_multi_union_pw_aff_extract_multi_pw_aff(
9116 __isl_keep isl_multi_union_pw_aff
*mupa
, __isl_take isl_space
*space
)
9119 isl_space
*space_mpa
;
9120 isl_multi_pw_aff
*mpa
;
9122 if (!mupa
|| !space
)
9125 space_mpa
= isl_multi_union_pw_aff_get_space(mupa
);
9126 space
= isl_space_replace_params(space
, space_mpa
);
9127 space_mpa
= isl_space_map_from_domain_and_range(isl_space_copy(space
),
9129 mpa
= isl_multi_pw_aff_alloc(space_mpa
);
9131 space
= isl_space_from_domain(space
);
9132 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
9133 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
9134 for (i
= 0; i
< n
; ++i
) {
9135 isl_union_pw_aff
*upa
;
9138 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
9139 pa
= isl_union_pw_aff_extract_pw_aff(upa
,
9140 isl_space_copy(space
));
9141 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
9142 isl_union_pw_aff_free(upa
);
9145 isl_space_free(space
);
9148 isl_space_free(space
);
9152 /* Evaluate the affine function "aff" in the void point "pnt".
9153 * In particular, return the value NaN.
9155 static __isl_give isl_val
*eval_void(__isl_take isl_aff
*aff
,
9156 __isl_take isl_point
*pnt
)
9160 ctx
= isl_point_get_ctx(pnt
);
9162 isl_point_free(pnt
);
9163 return isl_val_nan(ctx
);
9166 /* Evaluate the affine expression "aff"
9167 * in the coordinates (with denominator) "pnt".
9169 static __isl_give isl_val
*eval(__isl_keep isl_vec
*aff
,
9170 __isl_keep isl_vec
*pnt
)
9179 ctx
= isl_vec_get_ctx(aff
);
9182 isl_seq_inner_product(aff
->el
+ 1, pnt
->el
, pnt
->size
, &n
);
9183 isl_int_mul(d
, aff
->el
[0], pnt
->el
[0]);
9184 v
= isl_val_rat_from_isl_int(ctx
, n
, d
);
9185 v
= isl_val_normalize(v
);
9192 /* Check that the domain space of "aff" is equal to "space".
9194 static isl_stat
isl_aff_check_has_domain_space(__isl_keep isl_aff
*aff
,
9195 __isl_keep isl_space
*space
)
9199 ok
= isl_space_is_equal(isl_aff_peek_domain_space(aff
), space
);
9201 return isl_stat_error
;
9203 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
9204 "incompatible spaces", return isl_stat_error
);
9208 /* Evaluate the affine function "aff" in "pnt".
9210 __isl_give isl_val
*isl_aff_eval(__isl_take isl_aff
*aff
,
9211 __isl_take isl_point
*pnt
)
9215 isl_local_space
*ls
;
9217 if (isl_aff_check_has_domain_space(aff
, isl_point_peek_space(pnt
)) < 0)
9219 is_void
= isl_point_is_void(pnt
);
9223 return eval_void(aff
, pnt
);
9225 ls
= isl_aff_get_domain_local_space(aff
);
9226 pnt
= isl_local_space_lift_point(ls
, pnt
);
9228 v
= eval(aff
->v
, isl_point_peek_vec(pnt
));
9231 isl_point_free(pnt
);
9236 isl_point_free(pnt
);