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>
19 #include <isl_map_private.h>
20 #include <isl_union_map_private.h>
21 #include <isl_aff_private.h>
22 #include <isl_space_private.h>
23 #include <isl_local_space_private.h>
24 #include <isl_vec_private.h>
25 #include <isl_mat_private.h>
26 #include <isl/constraint.h>
29 #include <isl_val_private.h>
30 #include <isl/deprecated/aff_int.h>
31 #include <isl_config.h>
36 #include <isl_list_templ.c>
41 #include <isl_list_templ.c>
44 #define BASE union_pw_aff
46 #include <isl_list_templ.c>
49 #define BASE union_pw_multi_aff
51 #include <isl_list_templ.c>
53 __isl_give isl_aff
*isl_aff_alloc_vec(__isl_take isl_local_space
*ls
,
54 __isl_take isl_vec
*v
)
61 aff
= isl_calloc_type(v
->ctx
, struct isl_aff
);
71 isl_local_space_free(ls
);
76 __isl_give isl_aff
*isl_aff_alloc(__isl_take isl_local_space
*ls
)
85 ctx
= isl_local_space_get_ctx(ls
);
86 if (!isl_local_space_divs_known(ls
))
87 isl_die(ctx
, isl_error_invalid
, "local space has unknown divs",
89 if (!isl_local_space_is_set(ls
))
90 isl_die(ctx
, isl_error_invalid
,
91 "domain of affine expression should be a set",
94 total
= isl_local_space_dim(ls
, isl_dim_all
);
95 v
= isl_vec_alloc(ctx
, 1 + 1 + total
);
96 return isl_aff_alloc_vec(ls
, v
);
98 isl_local_space_free(ls
);
102 __isl_give isl_aff
*isl_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
106 aff
= isl_aff_alloc(ls
);
110 isl_int_set_si(aff
->v
->el
[0], 1);
111 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
116 /* Return a piecewise affine expression defined on the specified domain
117 * that is equal to zero.
119 __isl_give isl_pw_aff
*isl_pw_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
121 return isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls
));
124 /* Return an affine expression defined on the specified domain
125 * that represents NaN.
127 __isl_give isl_aff
*isl_aff_nan_on_domain(__isl_take isl_local_space
*ls
)
131 aff
= isl_aff_alloc(ls
);
135 isl_seq_clr(aff
->v
->el
, aff
->v
->size
);
140 /* Return a piecewise affine expression defined on the specified domain
141 * that represents NaN.
143 __isl_give isl_pw_aff
*isl_pw_aff_nan_on_domain(__isl_take isl_local_space
*ls
)
145 return isl_pw_aff_from_aff(isl_aff_nan_on_domain(ls
));
148 /* Return an affine expression that is equal to "val" on
149 * domain local space "ls".
151 __isl_give isl_aff
*isl_aff_val_on_domain(__isl_take isl_local_space
*ls
,
152 __isl_take isl_val
*val
)
158 if (!isl_val_is_rat(val
))
159 isl_die(isl_val_get_ctx(val
), isl_error_invalid
,
160 "expecting rational value", goto error
);
162 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
166 isl_seq_clr(aff
->v
->el
+ 2, aff
->v
->size
- 2);
167 isl_int_set(aff
->v
->el
[1], val
->n
);
168 isl_int_set(aff
->v
->el
[0], val
->d
);
170 isl_local_space_free(ls
);
174 isl_local_space_free(ls
);
179 /* Return an affine expression that is equal to the specified dimension
182 __isl_give isl_aff
*isl_aff_var_on_domain(__isl_take isl_local_space
*ls
,
183 enum isl_dim_type type
, unsigned pos
)
191 space
= isl_local_space_get_space(ls
);
194 if (isl_space_is_map(space
))
195 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
196 "expecting (parameter) set space", goto error
);
197 if (pos
>= isl_local_space_dim(ls
, type
))
198 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
199 "position out of bounds", goto error
);
201 isl_space_free(space
);
202 aff
= isl_aff_alloc(ls
);
206 pos
+= isl_local_space_offset(aff
->ls
, type
);
208 isl_int_set_si(aff
->v
->el
[0], 1);
209 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
210 isl_int_set_si(aff
->v
->el
[1 + pos
], 1);
214 isl_local_space_free(ls
);
215 isl_space_free(space
);
219 /* Return a piecewise affine expression that is equal to
220 * the specified dimension in "ls".
222 __isl_give isl_pw_aff
*isl_pw_aff_var_on_domain(__isl_take isl_local_space
*ls
,
223 enum isl_dim_type type
, unsigned pos
)
225 return isl_pw_aff_from_aff(isl_aff_var_on_domain(ls
, type
, pos
));
228 __isl_give isl_aff
*isl_aff_copy(__isl_keep isl_aff
*aff
)
237 __isl_give isl_aff
*isl_aff_dup(__isl_keep isl_aff
*aff
)
242 return isl_aff_alloc_vec(isl_local_space_copy(aff
->ls
),
243 isl_vec_copy(aff
->v
));
246 __isl_give isl_aff
*isl_aff_cow(__isl_take isl_aff
*aff
)
254 return isl_aff_dup(aff
);
257 __isl_null isl_aff
*isl_aff_free(__isl_take isl_aff
*aff
)
265 isl_local_space_free(aff
->ls
);
266 isl_vec_free(aff
->v
);
273 isl_ctx
*isl_aff_get_ctx(__isl_keep isl_aff
*aff
)
275 return aff
? isl_local_space_get_ctx(aff
->ls
) : NULL
;
278 /* Return a hash value that digests "aff".
280 uint32_t isl_aff_get_hash(__isl_keep isl_aff
*aff
)
282 uint32_t hash
, ls_hash
, v_hash
;
287 hash
= isl_hash_init();
288 ls_hash
= isl_local_space_get_hash(aff
->ls
);
289 isl_hash_hash(hash
, ls_hash
);
290 v_hash
= isl_vec_get_hash(aff
->v
);
291 isl_hash_hash(hash
, v_hash
);
296 /* Externally, an isl_aff has a map space, but internally, the
297 * ls field corresponds to the domain of that space.
299 int isl_aff_dim(__isl_keep isl_aff
*aff
, enum isl_dim_type type
)
303 if (type
== isl_dim_out
)
305 if (type
== isl_dim_in
)
307 return isl_local_space_dim(aff
->ls
, type
);
310 /* Return the position of the dimension of the given type and name
312 * Return -1 if no such dimension can be found.
314 int isl_aff_find_dim_by_name(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
319 if (type
== isl_dim_out
)
321 if (type
== isl_dim_in
)
323 return isl_local_space_find_dim_by_name(aff
->ls
, type
, name
);
326 __isl_give isl_space
*isl_aff_get_domain_space(__isl_keep isl_aff
*aff
)
328 return aff
? isl_local_space_get_space(aff
->ls
) : NULL
;
331 __isl_give isl_space
*isl_aff_get_space(__isl_keep isl_aff
*aff
)
336 space
= isl_local_space_get_space(aff
->ls
);
337 space
= isl_space_from_domain(space
);
338 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
342 __isl_give isl_local_space
*isl_aff_get_domain_local_space(
343 __isl_keep isl_aff
*aff
)
345 return aff
? isl_local_space_copy(aff
->ls
) : NULL
;
348 __isl_give isl_local_space
*isl_aff_get_local_space(__isl_keep isl_aff
*aff
)
353 ls
= isl_local_space_copy(aff
->ls
);
354 ls
= isl_local_space_from_domain(ls
);
355 ls
= isl_local_space_add_dims(ls
, isl_dim_out
, 1);
359 /* Externally, an isl_aff has a map space, but internally, the
360 * ls field corresponds to the domain of that space.
362 const char *isl_aff_get_dim_name(__isl_keep isl_aff
*aff
,
363 enum isl_dim_type type
, unsigned pos
)
367 if (type
== isl_dim_out
)
369 if (type
== isl_dim_in
)
371 return isl_local_space_get_dim_name(aff
->ls
, type
, pos
);
374 __isl_give isl_aff
*isl_aff_reset_domain_space(__isl_take isl_aff
*aff
,
375 __isl_take isl_space
*dim
)
377 aff
= isl_aff_cow(aff
);
381 aff
->ls
= isl_local_space_reset_space(aff
->ls
, dim
);
383 return isl_aff_free(aff
);
392 /* Reset the space of "aff". This function is called from isl_pw_templ.c
393 * and doesn't know if the space of an element object is represented
394 * directly or through its domain. It therefore passes along both.
396 __isl_give isl_aff
*isl_aff_reset_space_and_domain(__isl_take isl_aff
*aff
,
397 __isl_take isl_space
*space
, __isl_take isl_space
*domain
)
399 isl_space_free(space
);
400 return isl_aff_reset_domain_space(aff
, domain
);
403 /* Reorder the coefficients of the affine expression based
404 * on the given reordering.
405 * The reordering r is assumed to have been extended with the local
408 static __isl_give isl_vec
*vec_reorder(__isl_take isl_vec
*vec
,
409 __isl_take isl_reordering
*r
, int n_div
)
417 res
= isl_vec_alloc(vec
->ctx
,
418 2 + isl_space_dim(r
->dim
, isl_dim_all
) + n_div
);
421 isl_seq_cpy(res
->el
, vec
->el
, 2);
422 isl_seq_clr(res
->el
+ 2, res
->size
- 2);
423 for (i
= 0; i
< r
->len
; ++i
)
424 isl_int_set(res
->el
[2 + r
->pos
[i
]], vec
->el
[2 + i
]);
426 isl_reordering_free(r
);
431 isl_reordering_free(r
);
435 /* Reorder the dimensions of the domain of "aff" according
436 * to the given reordering.
438 __isl_give isl_aff
*isl_aff_realign_domain(__isl_take isl_aff
*aff
,
439 __isl_take isl_reordering
*r
)
441 aff
= isl_aff_cow(aff
);
445 r
= isl_reordering_extend(r
, aff
->ls
->div
->n_row
);
446 aff
->v
= vec_reorder(aff
->v
, isl_reordering_copy(r
),
447 aff
->ls
->div
->n_row
);
448 aff
->ls
= isl_local_space_realign(aff
->ls
, r
);
450 if (!aff
->v
|| !aff
->ls
)
451 return isl_aff_free(aff
);
456 isl_reordering_free(r
);
460 __isl_give isl_aff
*isl_aff_align_params(__isl_take isl_aff
*aff
,
461 __isl_take isl_space
*model
)
463 isl_bool equal_params
;
468 equal_params
= isl_space_has_equal_params(aff
->ls
->dim
, model
);
469 if (equal_params
< 0)
474 model
= isl_space_drop_dims(model
, isl_dim_in
,
475 0, isl_space_dim(model
, isl_dim_in
));
476 model
= isl_space_drop_dims(model
, isl_dim_out
,
477 0, isl_space_dim(model
, isl_dim_out
));
478 exp
= isl_parameter_alignment_reordering(aff
->ls
->dim
, model
);
479 exp
= isl_reordering_extend_space(exp
,
480 isl_aff_get_domain_space(aff
));
481 aff
= isl_aff_realign_domain(aff
, exp
);
484 isl_space_free(model
);
487 isl_space_free(model
);
492 /* Is "aff" obviously equal to zero?
494 * If the denominator is zero, then "aff" is not equal to zero.
496 isl_bool
isl_aff_plain_is_zero(__isl_keep isl_aff
*aff
)
499 return isl_bool_error
;
501 if (isl_int_is_zero(aff
->v
->el
[0]))
502 return isl_bool_false
;
503 return isl_seq_first_non_zero(aff
->v
->el
+ 1, aff
->v
->size
- 1) < 0;
506 /* Does "aff" represent NaN?
508 isl_bool
isl_aff_is_nan(__isl_keep isl_aff
*aff
)
511 return isl_bool_error
;
513 return isl_seq_first_non_zero(aff
->v
->el
, 2) < 0;
516 /* Are "aff1" and "aff2" obviously equal?
518 * NaN is not equal to anything, not even to another NaN.
520 isl_bool
isl_aff_plain_is_equal(__isl_keep isl_aff
*aff1
,
521 __isl_keep isl_aff
*aff2
)
526 return isl_bool_error
;
528 if (isl_aff_is_nan(aff1
) || isl_aff_is_nan(aff2
))
529 return isl_bool_false
;
531 equal
= isl_local_space_is_equal(aff1
->ls
, aff2
->ls
);
532 if (equal
< 0 || !equal
)
535 return isl_vec_is_equal(aff1
->v
, aff2
->v
);
538 /* Return the common denominator of "aff" in "v".
540 * We cannot return anything meaningful in case of a NaN.
542 isl_stat
isl_aff_get_denominator(__isl_keep isl_aff
*aff
, isl_int
*v
)
545 return isl_stat_error
;
546 if (isl_aff_is_nan(aff
))
547 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
548 "cannot get denominator of NaN", return isl_stat_error
);
549 isl_int_set(*v
, aff
->v
->el
[0]);
553 /* Return the common denominator of "aff".
555 __isl_give isl_val
*isl_aff_get_denominator_val(__isl_keep isl_aff
*aff
)
562 ctx
= isl_aff_get_ctx(aff
);
563 if (isl_aff_is_nan(aff
))
564 return isl_val_nan(ctx
);
565 return isl_val_int_from_isl_int(ctx
, aff
->v
->el
[0]);
568 /* Return the constant term of "aff" in "v".
570 * We cannot return anything meaningful in case of a NaN.
572 int isl_aff_get_constant(__isl_keep isl_aff
*aff
, isl_int
*v
)
576 if (isl_aff_is_nan(aff
))
577 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
578 "cannot get constant term of NaN", return -1);
579 isl_int_set(*v
, aff
->v
->el
[1]);
583 /* Return the constant term of "aff".
585 __isl_give isl_val
*isl_aff_get_constant_val(__isl_keep isl_aff
*aff
)
593 ctx
= isl_aff_get_ctx(aff
);
594 if (isl_aff_is_nan(aff
))
595 return isl_val_nan(ctx
);
596 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1], aff
->v
->el
[0]);
597 return isl_val_normalize(v
);
600 /* Return the coefficient of the variable of type "type" at position "pos"
603 * We cannot return anything meaningful in case of a NaN.
605 int isl_aff_get_coefficient(__isl_keep isl_aff
*aff
,
606 enum isl_dim_type type
, int pos
, isl_int
*v
)
611 if (type
== isl_dim_out
)
612 isl_die(aff
->v
->ctx
, isl_error_invalid
,
613 "output/set dimension does not have a coefficient",
615 if (type
== isl_dim_in
)
618 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
619 isl_die(aff
->v
->ctx
, isl_error_invalid
,
620 "position out of bounds", return -1);
622 if (isl_aff_is_nan(aff
))
623 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
624 "cannot get coefficient of NaN", return -1);
625 pos
+= isl_local_space_offset(aff
->ls
, type
);
626 isl_int_set(*v
, aff
->v
->el
[1 + pos
]);
631 /* Return the coefficient of the variable of type "type" at position "pos"
634 __isl_give isl_val
*isl_aff_get_coefficient_val(__isl_keep isl_aff
*aff
,
635 enum isl_dim_type type
, int pos
)
643 ctx
= isl_aff_get_ctx(aff
);
644 if (type
== isl_dim_out
)
645 isl_die(ctx
, isl_error_invalid
,
646 "output/set dimension does not have a coefficient",
648 if (type
== isl_dim_in
)
651 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
652 isl_die(ctx
, isl_error_invalid
,
653 "position out of bounds", return NULL
);
655 if (isl_aff_is_nan(aff
))
656 return isl_val_nan(ctx
);
657 pos
+= isl_local_space_offset(aff
->ls
, type
);
658 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1 + pos
], aff
->v
->el
[0]);
659 return isl_val_normalize(v
);
662 /* Return the sign of the coefficient of the variable of type "type"
663 * at position "pos" of "aff".
665 int isl_aff_coefficient_sgn(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
673 ctx
= isl_aff_get_ctx(aff
);
674 if (type
== isl_dim_out
)
675 isl_die(ctx
, isl_error_invalid
,
676 "output/set dimension does not have a coefficient",
678 if (type
== isl_dim_in
)
681 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
682 isl_die(ctx
, isl_error_invalid
,
683 "position out of bounds", return 0);
685 pos
+= isl_local_space_offset(aff
->ls
, type
);
686 return isl_int_sgn(aff
->v
->el
[1 + pos
]);
689 /* Replace the denominator of "aff" by "v".
691 * A NaN is unaffected by this operation.
693 __isl_give isl_aff
*isl_aff_set_denominator(__isl_take isl_aff
*aff
, isl_int v
)
697 if (isl_aff_is_nan(aff
))
699 aff
= isl_aff_cow(aff
);
703 aff
->v
= isl_vec_cow(aff
->v
);
705 return isl_aff_free(aff
);
707 isl_int_set(aff
->v
->el
[0], v
);
712 /* Replace the numerator of the constant term of "aff" by "v".
714 * A NaN is unaffected by this operation.
716 __isl_give isl_aff
*isl_aff_set_constant(__isl_take isl_aff
*aff
, isl_int v
)
720 if (isl_aff_is_nan(aff
))
722 aff
= isl_aff_cow(aff
);
726 aff
->v
= isl_vec_cow(aff
->v
);
728 return isl_aff_free(aff
);
730 isl_int_set(aff
->v
->el
[1], v
);
735 /* Replace the constant term of "aff" by "v".
737 * A NaN is unaffected by this operation.
739 __isl_give isl_aff
*isl_aff_set_constant_val(__isl_take isl_aff
*aff
,
740 __isl_take isl_val
*v
)
745 if (isl_aff_is_nan(aff
)) {
750 if (!isl_val_is_rat(v
))
751 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
752 "expecting rational value", goto error
);
754 if (isl_int_eq(aff
->v
->el
[1], v
->n
) &&
755 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
760 aff
= isl_aff_cow(aff
);
763 aff
->v
= isl_vec_cow(aff
->v
);
767 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
768 isl_int_set(aff
->v
->el
[1], v
->n
);
769 } else if (isl_int_is_one(v
->d
)) {
770 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
772 isl_seq_scale(aff
->v
->el
+ 1,
773 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
774 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
775 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
776 aff
->v
= isl_vec_normalize(aff
->v
);
789 /* Add "v" to the constant term of "aff".
791 * A NaN is unaffected by this operation.
793 __isl_give isl_aff
*isl_aff_add_constant(__isl_take isl_aff
*aff
, isl_int v
)
795 if (isl_int_is_zero(v
))
800 if (isl_aff_is_nan(aff
))
802 aff
= isl_aff_cow(aff
);
806 aff
->v
= isl_vec_cow(aff
->v
);
808 return isl_aff_free(aff
);
810 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
);
815 /* Add "v" to the constant term of "aff".
817 * A NaN is unaffected by this operation.
819 __isl_give isl_aff
*isl_aff_add_constant_val(__isl_take isl_aff
*aff
,
820 __isl_take isl_val
*v
)
825 if (isl_aff_is_nan(aff
) || isl_val_is_zero(v
)) {
830 if (!isl_val_is_rat(v
))
831 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
832 "expecting rational value", goto error
);
834 aff
= isl_aff_cow(aff
);
838 aff
->v
= isl_vec_cow(aff
->v
);
842 if (isl_int_is_one(v
->d
)) {
843 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
844 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
845 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
->n
);
846 aff
->v
= isl_vec_normalize(aff
->v
);
850 isl_seq_scale(aff
->v
->el
+ 1,
851 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
852 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
853 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
854 aff
->v
= isl_vec_normalize(aff
->v
);
867 __isl_give isl_aff
*isl_aff_add_constant_si(__isl_take isl_aff
*aff
, int v
)
872 isl_int_set_si(t
, v
);
873 aff
= isl_aff_add_constant(aff
, t
);
879 /* Add "v" to the numerator of the constant term of "aff".
881 * A NaN is unaffected by this operation.
883 __isl_give isl_aff
*isl_aff_add_constant_num(__isl_take isl_aff
*aff
, isl_int v
)
885 if (isl_int_is_zero(v
))
890 if (isl_aff_is_nan(aff
))
892 aff
= isl_aff_cow(aff
);
896 aff
->v
= isl_vec_cow(aff
->v
);
898 return isl_aff_free(aff
);
900 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
);
905 /* Add "v" to the numerator of the constant term of "aff".
907 * A NaN is unaffected by this operation.
909 __isl_give isl_aff
*isl_aff_add_constant_num_si(__isl_take isl_aff
*aff
, int v
)
917 isl_int_set_si(t
, v
);
918 aff
= isl_aff_add_constant_num(aff
, t
);
924 /* Replace the numerator of the constant term of "aff" by "v".
926 * A NaN is unaffected by this operation.
928 __isl_give isl_aff
*isl_aff_set_constant_si(__isl_take isl_aff
*aff
, int v
)
932 if (isl_aff_is_nan(aff
))
934 aff
= isl_aff_cow(aff
);
938 aff
->v
= isl_vec_cow(aff
->v
);
940 return isl_aff_free(aff
);
942 isl_int_set_si(aff
->v
->el
[1], v
);
947 /* Replace the numerator of the coefficient of the variable of type "type"
948 * at position "pos" of "aff" by "v".
950 * A NaN is unaffected by this operation.
952 __isl_give isl_aff
*isl_aff_set_coefficient(__isl_take isl_aff
*aff
,
953 enum isl_dim_type type
, int pos
, isl_int v
)
958 if (type
== isl_dim_out
)
959 isl_die(aff
->v
->ctx
, isl_error_invalid
,
960 "output/set dimension does not have a coefficient",
961 return isl_aff_free(aff
));
962 if (type
== isl_dim_in
)
965 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
966 isl_die(aff
->v
->ctx
, isl_error_invalid
,
967 "position out of bounds", return isl_aff_free(aff
));
969 if (isl_aff_is_nan(aff
))
971 aff
= isl_aff_cow(aff
);
975 aff
->v
= isl_vec_cow(aff
->v
);
977 return isl_aff_free(aff
);
979 pos
+= isl_local_space_offset(aff
->ls
, type
);
980 isl_int_set(aff
->v
->el
[1 + pos
], v
);
985 /* Replace the numerator of the coefficient of the variable of type "type"
986 * at position "pos" of "aff" by "v".
988 * A NaN is unaffected by this operation.
990 __isl_give isl_aff
*isl_aff_set_coefficient_si(__isl_take isl_aff
*aff
,
991 enum isl_dim_type type
, int pos
, int v
)
996 if (type
== isl_dim_out
)
997 isl_die(aff
->v
->ctx
, isl_error_invalid
,
998 "output/set dimension does not have a coefficient",
999 return isl_aff_free(aff
));
1000 if (type
== isl_dim_in
)
1003 if (pos
< 0 || pos
>= isl_local_space_dim(aff
->ls
, type
))
1004 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1005 "position out of bounds", return isl_aff_free(aff
));
1007 if (isl_aff_is_nan(aff
))
1009 pos
+= isl_local_space_offset(aff
->ls
, type
);
1010 if (isl_int_cmp_si(aff
->v
->el
[1 + pos
], v
) == 0)
1013 aff
= isl_aff_cow(aff
);
1017 aff
->v
= isl_vec_cow(aff
->v
);
1019 return isl_aff_free(aff
);
1021 isl_int_set_si(aff
->v
->el
[1 + pos
], v
);
1026 /* Replace the coefficient of the variable of type "type" at position "pos"
1029 * A NaN is unaffected by this operation.
1031 __isl_give isl_aff
*isl_aff_set_coefficient_val(__isl_take isl_aff
*aff
,
1032 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1037 if (type
== isl_dim_out
)
1038 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1039 "output/set dimension does not have a coefficient",
1041 if (type
== isl_dim_in
)
1044 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1045 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1046 "position out of bounds", goto error
);
1048 if (isl_aff_is_nan(aff
)) {
1052 if (!isl_val_is_rat(v
))
1053 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1054 "expecting rational value", goto error
);
1056 pos
+= isl_local_space_offset(aff
->ls
, type
);
1057 if (isl_int_eq(aff
->v
->el
[1 + pos
], v
->n
) &&
1058 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1063 aff
= isl_aff_cow(aff
);
1066 aff
->v
= isl_vec_cow(aff
->v
);
1070 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1071 isl_int_set(aff
->v
->el
[1 + pos
], v
->n
);
1072 } else if (isl_int_is_one(v
->d
)) {
1073 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1075 isl_seq_scale(aff
->v
->el
+ 1,
1076 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1077 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1078 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1079 aff
->v
= isl_vec_normalize(aff
->v
);
1092 /* Add "v" to the coefficient of the variable of type "type"
1093 * at position "pos" of "aff".
1095 * A NaN is unaffected by this operation.
1097 __isl_give isl_aff
*isl_aff_add_coefficient(__isl_take isl_aff
*aff
,
1098 enum isl_dim_type type
, int pos
, isl_int v
)
1103 if (type
== isl_dim_out
)
1104 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1105 "output/set dimension does not have a coefficient",
1106 return isl_aff_free(aff
));
1107 if (type
== isl_dim_in
)
1110 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1111 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1112 "position out of bounds", return isl_aff_free(aff
));
1114 if (isl_aff_is_nan(aff
))
1116 aff
= isl_aff_cow(aff
);
1120 aff
->v
= isl_vec_cow(aff
->v
);
1122 return isl_aff_free(aff
);
1124 pos
+= isl_local_space_offset(aff
->ls
, type
);
1125 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
);
1130 /* Add "v" to the coefficient of the variable of type "type"
1131 * at position "pos" of "aff".
1133 * A NaN is unaffected by this operation.
1135 __isl_give isl_aff
*isl_aff_add_coefficient_val(__isl_take isl_aff
*aff
,
1136 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1141 if (isl_val_is_zero(v
)) {
1146 if (type
== isl_dim_out
)
1147 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1148 "output/set dimension does not have a coefficient",
1150 if (type
== isl_dim_in
)
1153 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1154 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1155 "position out of bounds", goto error
);
1157 if (isl_aff_is_nan(aff
)) {
1161 if (!isl_val_is_rat(v
))
1162 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1163 "expecting rational value", goto error
);
1165 aff
= isl_aff_cow(aff
);
1169 aff
->v
= isl_vec_cow(aff
->v
);
1173 pos
+= isl_local_space_offset(aff
->ls
, type
);
1174 if (isl_int_is_one(v
->d
)) {
1175 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1176 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1177 isl_int_add(aff
->v
->el
[1 + pos
], aff
->v
->el
[1 + pos
], v
->n
);
1178 aff
->v
= isl_vec_normalize(aff
->v
);
1182 isl_seq_scale(aff
->v
->el
+ 1,
1183 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1184 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1185 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1186 aff
->v
= isl_vec_normalize(aff
->v
);
1199 __isl_give isl_aff
*isl_aff_add_coefficient_si(__isl_take isl_aff
*aff
,
1200 enum isl_dim_type type
, int pos
, int v
)
1205 isl_int_set_si(t
, v
);
1206 aff
= isl_aff_add_coefficient(aff
, type
, pos
, t
);
1212 __isl_give isl_aff
*isl_aff_get_div(__isl_keep isl_aff
*aff
, int pos
)
1217 return isl_local_space_get_div(aff
->ls
, pos
);
1220 /* Return the negation of "aff".
1222 * As a special case, -NaN = NaN.
1224 __isl_give isl_aff
*isl_aff_neg(__isl_take isl_aff
*aff
)
1228 if (isl_aff_is_nan(aff
))
1230 aff
= isl_aff_cow(aff
);
1233 aff
->v
= isl_vec_cow(aff
->v
);
1235 return isl_aff_free(aff
);
1237 isl_seq_neg(aff
->v
->el
+ 1, aff
->v
->el
+ 1, aff
->v
->size
- 1);
1242 /* Remove divs from the local space that do not appear in the affine
1244 * We currently only remove divs at the end.
1245 * Some intermediate divs may also not appear directly in the affine
1246 * expression, but we would also need to check that no other divs are
1247 * defined in terms of them.
1249 __isl_give isl_aff
*isl_aff_remove_unused_divs(__isl_take isl_aff
*aff
)
1258 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1259 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1261 pos
= isl_seq_last_non_zero(aff
->v
->el
+ 1 + off
, n
) + 1;
1265 aff
= isl_aff_cow(aff
);
1269 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, isl_dim_div
, pos
, n
- pos
);
1270 aff
->v
= isl_vec_drop_els(aff
->v
, 1 + off
+ pos
, n
- pos
);
1271 if (!aff
->ls
|| !aff
->v
)
1272 return isl_aff_free(aff
);
1277 /* Look for any divs in the aff->ls with a denominator equal to one
1278 * and plug them into the affine expression and any subsequent divs
1279 * that may reference the div.
1281 static __isl_give isl_aff
*plug_in_integral_divs(__isl_take isl_aff
*aff
)
1287 isl_local_space
*ls
;
1293 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1295 for (i
= 0; i
< n
; ++i
) {
1296 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][0]))
1298 ls
= isl_local_space_copy(aff
->ls
);
1299 ls
= isl_local_space_substitute_seq(ls
, isl_dim_div
, i
,
1300 aff
->ls
->div
->row
[i
], len
, i
+ 1, n
- (i
+ 1));
1301 vec
= isl_vec_copy(aff
->v
);
1302 vec
= isl_vec_cow(vec
);
1308 pos
= isl_local_space_offset(aff
->ls
, isl_dim_div
) + i
;
1309 isl_seq_substitute(vec
->el
, pos
, aff
->ls
->div
->row
[i
],
1314 isl_vec_free(aff
->v
);
1316 isl_local_space_free(aff
->ls
);
1323 isl_local_space_free(ls
);
1324 return isl_aff_free(aff
);
1327 /* Look for any divs j that appear with a unit coefficient inside
1328 * the definitions of other divs i and plug them into the definitions
1331 * In particular, an expression of the form
1333 * floor((f(..) + floor(g(..)/n))/m)
1337 * floor((n * f(..) + g(..))/(n * m))
1339 * This simplification is correct because we can move the expression
1340 * f(..) into the inner floor in the original expression to obtain
1342 * floor(floor((n * f(..) + g(..))/n)/m)
1344 * from which we can derive the simplified expression.
1346 static __isl_give isl_aff
*plug_in_unit_divs(__isl_take isl_aff
*aff
)
1354 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1355 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1356 for (i
= 1; i
< n
; ++i
) {
1357 for (j
= 0; j
< i
; ++j
) {
1358 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][1 + off
+ j
]))
1360 aff
->ls
= isl_local_space_substitute_seq(aff
->ls
,
1361 isl_dim_div
, j
, aff
->ls
->div
->row
[j
],
1362 aff
->v
->size
, i
, 1);
1364 return isl_aff_free(aff
);
1371 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
1373 * Even though this function is only called on isl_affs with a single
1374 * reference, we are careful to only change aff->v and aff->ls together.
1376 static __isl_give isl_aff
*swap_div(__isl_take isl_aff
*aff
, int a
, int b
)
1378 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1379 isl_local_space
*ls
;
1382 ls
= isl_local_space_copy(aff
->ls
);
1383 ls
= isl_local_space_swap_div(ls
, a
, b
);
1384 v
= isl_vec_copy(aff
->v
);
1389 isl_int_swap(v
->el
[1 + off
+ a
], v
->el
[1 + off
+ b
]);
1390 isl_vec_free(aff
->v
);
1392 isl_local_space_free(aff
->ls
);
1398 isl_local_space_free(ls
);
1399 return isl_aff_free(aff
);
1402 /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL.
1404 * We currently do not actually remove div "b", but simply add its
1405 * coefficient to that of "a" and then zero it out.
1407 static __isl_give isl_aff
*merge_divs(__isl_take isl_aff
*aff
, int a
, int b
)
1409 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1411 if (isl_int_is_zero(aff
->v
->el
[1 + off
+ b
]))
1414 aff
->v
= isl_vec_cow(aff
->v
);
1416 return isl_aff_free(aff
);
1418 isl_int_add(aff
->v
->el
[1 + off
+ a
],
1419 aff
->v
->el
[1 + off
+ a
], aff
->v
->el
[1 + off
+ b
]);
1420 isl_int_set_si(aff
->v
->el
[1 + off
+ b
], 0);
1425 /* Sort the divs in the local space of "aff" according to
1426 * the comparison function "cmp_row" in isl_local_space.c,
1427 * combining the coefficients of identical divs.
1429 * Reordering divs does not change the semantics of "aff",
1430 * so there is no need to call isl_aff_cow.
1431 * Moreover, this function is currently only called on isl_affs
1432 * with a single reference.
1434 static __isl_give isl_aff
*sort_divs(__isl_take isl_aff
*aff
)
1441 n
= isl_aff_dim(aff
, isl_dim_div
);
1442 for (i
= 1; i
< n
; ++i
) {
1443 for (j
= i
- 1; j
>= 0; --j
) {
1444 int cmp
= isl_mat_cmp_div(aff
->ls
->div
, j
, j
+ 1);
1448 aff
= merge_divs(aff
, j
, j
+ 1);
1450 aff
= swap_div(aff
, j
, j
+ 1);
1459 /* Normalize the representation of "aff".
1461 * This function should only be called of "new" isl_affs, i.e.,
1462 * with only a single reference. We therefore do not need to
1463 * worry about affecting other instances.
1465 __isl_give isl_aff
*isl_aff_normalize(__isl_take isl_aff
*aff
)
1469 aff
->v
= isl_vec_normalize(aff
->v
);
1471 return isl_aff_free(aff
);
1472 aff
= plug_in_integral_divs(aff
);
1473 aff
= plug_in_unit_divs(aff
);
1474 aff
= sort_divs(aff
);
1475 aff
= isl_aff_remove_unused_divs(aff
);
1479 /* Given f, return floor(f).
1480 * If f is an integer expression, then just return f.
1481 * If f is a constant, then return the constant floor(f).
1482 * Otherwise, if f = g/m, write g = q m + r,
1483 * create a new div d = [r/m] and return the expression q + d.
1484 * The coefficients in r are taken to lie between -m/2 and m/2.
1486 * reduce_div_coefficients performs the same normalization.
1488 * As a special case, floor(NaN) = NaN.
1490 __isl_give isl_aff
*isl_aff_floor(__isl_take isl_aff
*aff
)
1500 if (isl_aff_is_nan(aff
))
1502 if (isl_int_is_one(aff
->v
->el
[0]))
1505 aff
= isl_aff_cow(aff
);
1509 aff
->v
= isl_vec_cow(aff
->v
);
1511 return isl_aff_free(aff
);
1513 if (isl_aff_is_cst(aff
)) {
1514 isl_int_fdiv_q(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1515 isl_int_set_si(aff
->v
->el
[0], 1);
1519 div
= isl_vec_copy(aff
->v
);
1520 div
= isl_vec_cow(div
);
1522 return isl_aff_free(aff
);
1524 ctx
= isl_aff_get_ctx(aff
);
1525 isl_int_fdiv_q(aff
->v
->el
[0], aff
->v
->el
[0], ctx
->two
);
1526 for (i
= 1; i
< aff
->v
->size
; ++i
) {
1527 isl_int_fdiv_r(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1528 isl_int_fdiv_q(aff
->v
->el
[i
], aff
->v
->el
[i
], div
->el
[0]);
1529 if (isl_int_gt(div
->el
[i
], aff
->v
->el
[0])) {
1530 isl_int_sub(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1531 isl_int_add_ui(aff
->v
->el
[i
], aff
->v
->el
[i
], 1);
1535 aff
->ls
= isl_local_space_add_div(aff
->ls
, div
);
1537 return isl_aff_free(aff
);
1539 size
= aff
->v
->size
;
1540 aff
->v
= isl_vec_extend(aff
->v
, size
+ 1);
1542 return isl_aff_free(aff
);
1543 isl_int_set_si(aff
->v
->el
[0], 1);
1544 isl_int_set_si(aff
->v
->el
[size
], 1);
1546 aff
= isl_aff_normalize(aff
);
1553 * aff mod m = aff - m * floor(aff/m)
1555 __isl_give isl_aff
*isl_aff_mod(__isl_take isl_aff
*aff
, isl_int m
)
1559 res
= isl_aff_copy(aff
);
1560 aff
= isl_aff_scale_down(aff
, m
);
1561 aff
= isl_aff_floor(aff
);
1562 aff
= isl_aff_scale(aff
, m
);
1563 res
= isl_aff_sub(res
, aff
);
1570 * aff mod m = aff - m * floor(aff/m)
1572 * with m an integer value.
1574 __isl_give isl_aff
*isl_aff_mod_val(__isl_take isl_aff
*aff
,
1575 __isl_take isl_val
*m
)
1582 if (!isl_val_is_int(m
))
1583 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
1584 "expecting integer modulo", goto error
);
1586 res
= isl_aff_copy(aff
);
1587 aff
= isl_aff_scale_down_val(aff
, isl_val_copy(m
));
1588 aff
= isl_aff_floor(aff
);
1589 aff
= isl_aff_scale_val(aff
, m
);
1590 res
= isl_aff_sub(res
, aff
);
1601 * pwaff mod m = pwaff - m * floor(pwaff/m)
1603 __isl_give isl_pw_aff
*isl_pw_aff_mod(__isl_take isl_pw_aff
*pwaff
, isl_int m
)
1607 res
= isl_pw_aff_copy(pwaff
);
1608 pwaff
= isl_pw_aff_scale_down(pwaff
, m
);
1609 pwaff
= isl_pw_aff_floor(pwaff
);
1610 pwaff
= isl_pw_aff_scale(pwaff
, m
);
1611 res
= isl_pw_aff_sub(res
, pwaff
);
1618 * pa mod m = pa - m * floor(pa/m)
1620 * with m an integer value.
1622 __isl_give isl_pw_aff
*isl_pw_aff_mod_val(__isl_take isl_pw_aff
*pa
,
1623 __isl_take isl_val
*m
)
1627 if (!isl_val_is_int(m
))
1628 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
1629 "expecting integer modulo", goto error
);
1630 pa
= isl_pw_aff_mod(pa
, m
->n
);
1634 isl_pw_aff_free(pa
);
1639 /* Given f, return ceil(f).
1640 * If f is an integer expression, then just return f.
1641 * Otherwise, let f be the expression
1647 * floor((e + m - 1)/m)
1649 * As a special case, ceil(NaN) = NaN.
1651 __isl_give isl_aff
*isl_aff_ceil(__isl_take isl_aff
*aff
)
1656 if (isl_aff_is_nan(aff
))
1658 if (isl_int_is_one(aff
->v
->el
[0]))
1661 aff
= isl_aff_cow(aff
);
1664 aff
->v
= isl_vec_cow(aff
->v
);
1666 return isl_aff_free(aff
);
1668 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1669 isl_int_sub_ui(aff
->v
->el
[1], aff
->v
->el
[1], 1);
1670 aff
= isl_aff_floor(aff
);
1675 /* Apply the expansion computed by isl_merge_divs.
1676 * The expansion itself is given by "exp" while the resulting
1677 * list of divs is given by "div".
1679 __isl_give isl_aff
*isl_aff_expand_divs(__isl_take isl_aff
*aff
,
1680 __isl_take isl_mat
*div
, int *exp
)
1686 aff
= isl_aff_cow(aff
);
1690 old_n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1691 new_n_div
= isl_mat_rows(div
);
1692 offset
= 1 + isl_local_space_offset(aff
->ls
, isl_dim_div
);
1694 aff
->v
= isl_vec_expand(aff
->v
, offset
, old_n_div
, exp
, new_n_div
);
1695 aff
->ls
= isl_local_space_replace_divs(aff
->ls
, div
);
1696 if (!aff
->v
|| !aff
->ls
)
1697 return isl_aff_free(aff
);
1705 /* Add two affine expressions that live in the same local space.
1707 static __isl_give isl_aff
*add_expanded(__isl_take isl_aff
*aff1
,
1708 __isl_take isl_aff
*aff2
)
1712 aff1
= isl_aff_cow(aff1
);
1716 aff1
->v
= isl_vec_cow(aff1
->v
);
1722 isl_int_gcd(gcd
, aff1
->v
->el
[0], aff2
->v
->el
[0]);
1723 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1724 isl_seq_scale(aff1
->v
->el
+ 1, aff1
->v
->el
+ 1, f
, aff1
->v
->size
- 1);
1725 isl_int_divexact(f
, aff1
->v
->el
[0], gcd
);
1726 isl_seq_addmul(aff1
->v
->el
+ 1, f
, aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
1727 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1728 isl_int_mul(aff1
->v
->el
[0], aff1
->v
->el
[0], f
);
1740 /* Return the sum of "aff1" and "aff2".
1742 * If either of the two is NaN, then the result is NaN.
1744 __isl_give isl_aff
*isl_aff_add(__isl_take isl_aff
*aff1
,
1745 __isl_take isl_aff
*aff2
)
1756 ctx
= isl_aff_get_ctx(aff1
);
1757 if (!isl_space_is_equal(aff1
->ls
->dim
, aff2
->ls
->dim
))
1758 isl_die(ctx
, isl_error_invalid
,
1759 "spaces don't match", goto error
);
1761 if (isl_aff_is_nan(aff1
)) {
1765 if (isl_aff_is_nan(aff2
)) {
1770 n_div1
= isl_aff_dim(aff1
, isl_dim_div
);
1771 n_div2
= isl_aff_dim(aff2
, isl_dim_div
);
1772 if (n_div1
== 0 && n_div2
== 0)
1773 return add_expanded(aff1
, aff2
);
1775 exp1
= isl_alloc_array(ctx
, int, n_div1
);
1776 exp2
= isl_alloc_array(ctx
, int, n_div2
);
1777 if ((n_div1
&& !exp1
) || (n_div2
&& !exp2
))
1780 div
= isl_merge_divs(aff1
->ls
->div
, aff2
->ls
->div
, exp1
, exp2
);
1781 aff1
= isl_aff_expand_divs(aff1
, isl_mat_copy(div
), exp1
);
1782 aff2
= isl_aff_expand_divs(aff2
, div
, exp2
);
1786 return add_expanded(aff1
, aff2
);
1795 __isl_give isl_aff
*isl_aff_sub(__isl_take isl_aff
*aff1
,
1796 __isl_take isl_aff
*aff2
)
1798 return isl_aff_add(aff1
, isl_aff_neg(aff2
));
1801 /* Return the result of scaling "aff" by a factor of "f".
1803 * As a special case, f * NaN = NaN.
1805 __isl_give isl_aff
*isl_aff_scale(__isl_take isl_aff
*aff
, isl_int f
)
1811 if (isl_aff_is_nan(aff
))
1814 if (isl_int_is_one(f
))
1817 aff
= isl_aff_cow(aff
);
1820 aff
->v
= isl_vec_cow(aff
->v
);
1822 return isl_aff_free(aff
);
1824 if (isl_int_is_pos(f
) && isl_int_is_divisible_by(aff
->v
->el
[0], f
)) {
1825 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], f
);
1830 isl_int_gcd(gcd
, aff
->v
->el
[0], f
);
1831 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1832 isl_int_divexact(gcd
, f
, gcd
);
1833 isl_seq_scale(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1839 /* Multiple "aff" by "v".
1841 __isl_give isl_aff
*isl_aff_scale_val(__isl_take isl_aff
*aff
,
1842 __isl_take isl_val
*v
)
1847 if (isl_val_is_one(v
)) {
1852 if (!isl_val_is_rat(v
))
1853 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1854 "expecting rational factor", goto error
);
1856 aff
= isl_aff_scale(aff
, v
->n
);
1857 aff
= isl_aff_scale_down(aff
, v
->d
);
1867 /* Return the result of scaling "aff" down by a factor of "f".
1869 * As a special case, NaN/f = NaN.
1871 __isl_give isl_aff
*isl_aff_scale_down(__isl_take isl_aff
*aff
, isl_int f
)
1877 if (isl_aff_is_nan(aff
))
1880 if (isl_int_is_one(f
))
1883 aff
= isl_aff_cow(aff
);
1887 if (isl_int_is_zero(f
))
1888 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1889 "cannot scale down by zero", return isl_aff_free(aff
));
1891 aff
->v
= isl_vec_cow(aff
->v
);
1893 return isl_aff_free(aff
);
1896 isl_seq_gcd(aff
->v
->el
+ 1, aff
->v
->size
- 1, &gcd
);
1897 isl_int_gcd(gcd
, gcd
, f
);
1898 isl_seq_scale_down(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1899 isl_int_divexact(gcd
, f
, gcd
);
1900 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1906 /* Divide "aff" by "v".
1908 __isl_give isl_aff
*isl_aff_scale_down_val(__isl_take isl_aff
*aff
,
1909 __isl_take isl_val
*v
)
1914 if (isl_val_is_one(v
)) {
1919 if (!isl_val_is_rat(v
))
1920 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1921 "expecting rational factor", goto error
);
1922 if (!isl_val_is_pos(v
))
1923 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1924 "factor needs to be positive", goto error
);
1926 aff
= isl_aff_scale(aff
, v
->d
);
1927 aff
= isl_aff_scale_down(aff
, v
->n
);
1937 __isl_give isl_aff
*isl_aff_scale_down_ui(__isl_take isl_aff
*aff
, unsigned f
)
1945 isl_int_set_ui(v
, f
);
1946 aff
= isl_aff_scale_down(aff
, v
);
1952 __isl_give isl_aff
*isl_aff_set_dim_name(__isl_take isl_aff
*aff
,
1953 enum isl_dim_type type
, unsigned pos
, const char *s
)
1955 aff
= isl_aff_cow(aff
);
1958 if (type
== isl_dim_out
)
1959 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1960 "cannot set name of output/set dimension",
1961 return isl_aff_free(aff
));
1962 if (type
== isl_dim_in
)
1964 aff
->ls
= isl_local_space_set_dim_name(aff
->ls
, type
, pos
, s
);
1966 return isl_aff_free(aff
);
1971 __isl_give isl_aff
*isl_aff_set_dim_id(__isl_take isl_aff
*aff
,
1972 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
1974 aff
= isl_aff_cow(aff
);
1977 if (type
== isl_dim_out
)
1978 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1979 "cannot set name of output/set dimension",
1981 if (type
== isl_dim_in
)
1983 aff
->ls
= isl_local_space_set_dim_id(aff
->ls
, type
, pos
, id
);
1985 return isl_aff_free(aff
);
1994 /* Replace the identifier of the input tuple of "aff" by "id".
1995 * type is currently required to be equal to isl_dim_in
1997 __isl_give isl_aff
*isl_aff_set_tuple_id(__isl_take isl_aff
*aff
,
1998 enum isl_dim_type type
, __isl_take isl_id
*id
)
2000 aff
= isl_aff_cow(aff
);
2003 if (type
!= isl_dim_out
)
2004 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2005 "cannot only set id of input tuple", goto error
);
2006 aff
->ls
= isl_local_space_set_tuple_id(aff
->ls
, isl_dim_set
, id
);
2008 return isl_aff_free(aff
);
2017 /* Exploit the equalities in "eq" to simplify the affine expression
2018 * and the expressions of the integer divisions in the local space.
2019 * The integer divisions in this local space are assumed to appear
2020 * as regular dimensions in "eq".
2022 static __isl_give isl_aff
*isl_aff_substitute_equalities_lifted(
2023 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
2031 if (eq
->n_eq
== 0) {
2032 isl_basic_set_free(eq
);
2036 aff
= isl_aff_cow(aff
);
2040 aff
->ls
= isl_local_space_substitute_equalities(aff
->ls
,
2041 isl_basic_set_copy(eq
));
2042 aff
->v
= isl_vec_cow(aff
->v
);
2043 if (!aff
->ls
|| !aff
->v
)
2046 total
= 1 + isl_space_dim(eq
->dim
, isl_dim_all
);
2048 for (i
= 0; i
< eq
->n_eq
; ++i
) {
2049 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
2050 if (j
< 0 || j
== 0 || j
>= total
)
2053 isl_seq_elim(aff
->v
->el
+ 1, eq
->eq
[i
], j
, total
,
2057 isl_basic_set_free(eq
);
2058 aff
= isl_aff_normalize(aff
);
2061 isl_basic_set_free(eq
);
2066 /* Exploit the equalities in "eq" to simplify the affine expression
2067 * and the expressions of the integer divisions in the local space.
2069 __isl_give isl_aff
*isl_aff_substitute_equalities(__isl_take isl_aff
*aff
,
2070 __isl_take isl_basic_set
*eq
)
2076 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2078 eq
= isl_basic_set_add_dims(eq
, isl_dim_set
, n_div
);
2079 return isl_aff_substitute_equalities_lifted(aff
, eq
);
2081 isl_basic_set_free(eq
);
2086 /* Look for equalities among the variables shared by context and aff
2087 * and the integer divisions of aff, if any.
2088 * The equalities are then used to eliminate coefficients and/or integer
2089 * divisions from aff.
2091 __isl_give isl_aff
*isl_aff_gist(__isl_take isl_aff
*aff
,
2092 __isl_take isl_set
*context
)
2094 isl_basic_set
*hull
;
2099 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2101 isl_basic_set
*bset
;
2102 isl_local_space
*ls
;
2103 context
= isl_set_add_dims(context
, isl_dim_set
, n_div
);
2104 ls
= isl_aff_get_domain_local_space(aff
);
2105 bset
= isl_basic_set_from_local_space(ls
);
2106 bset
= isl_basic_set_lift(bset
);
2107 bset
= isl_basic_set_flatten(bset
);
2108 context
= isl_set_intersect(context
,
2109 isl_set_from_basic_set(bset
));
2112 hull
= isl_set_affine_hull(context
);
2113 return isl_aff_substitute_equalities_lifted(aff
, hull
);
2116 isl_set_free(context
);
2120 __isl_give isl_aff
*isl_aff_gist_params(__isl_take isl_aff
*aff
,
2121 __isl_take isl_set
*context
)
2123 isl_set
*dom_context
= isl_set_universe(isl_aff_get_domain_space(aff
));
2124 dom_context
= isl_set_intersect_params(dom_context
, context
);
2125 return isl_aff_gist(aff
, dom_context
);
2128 /* Return a basic set containing those elements in the space
2129 * of aff where it is positive. "rational" should not be set.
2131 * If "aff" is NaN, then it is not positive.
2133 static __isl_give isl_basic_set
*aff_pos_basic_set(__isl_take isl_aff
*aff
,
2136 isl_constraint
*ineq
;
2137 isl_basic_set
*bset
;
2142 if (isl_aff_is_nan(aff
)) {
2143 isl_space
*space
= isl_aff_get_domain_space(aff
);
2145 return isl_basic_set_empty(space
);
2148 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2149 "rational sets not supported", goto error
);
2151 ineq
= isl_inequality_from_aff(aff
);
2152 c
= isl_constraint_get_constant_val(ineq
);
2153 c
= isl_val_sub_ui(c
, 1);
2154 ineq
= isl_constraint_set_constant_val(ineq
, c
);
2156 bset
= isl_basic_set_from_constraint(ineq
);
2157 bset
= isl_basic_set_simplify(bset
);
2164 /* Return a basic set containing those elements in the space
2165 * of aff where it is non-negative.
2166 * If "rational" is set, then return a rational basic set.
2168 * If "aff" is NaN, then it is not non-negative (it's not negative either).
2170 static __isl_give isl_basic_set
*aff_nonneg_basic_set(
2171 __isl_take isl_aff
*aff
, int rational
)
2173 isl_constraint
*ineq
;
2174 isl_basic_set
*bset
;
2178 if (isl_aff_is_nan(aff
)) {
2179 isl_space
*space
= isl_aff_get_domain_space(aff
);
2181 return isl_basic_set_empty(space
);
2184 ineq
= isl_inequality_from_aff(aff
);
2186 bset
= isl_basic_set_from_constraint(ineq
);
2188 bset
= isl_basic_set_set_rational(bset
);
2189 bset
= isl_basic_set_simplify(bset
);
2193 /* Return a basic set containing those elements in the space
2194 * of aff where it is non-negative.
2196 __isl_give isl_basic_set
*isl_aff_nonneg_basic_set(__isl_take isl_aff
*aff
)
2198 return aff_nonneg_basic_set(aff
, 0);
2201 /* Return a basic set containing those elements in the domain space
2202 * of "aff" where it is positive.
2204 __isl_give isl_basic_set
*isl_aff_pos_basic_set(__isl_take isl_aff
*aff
)
2206 aff
= isl_aff_add_constant_num_si(aff
, -1);
2207 return isl_aff_nonneg_basic_set(aff
);
2210 /* Return a basic set containing those elements in the domain space
2211 * of aff where it is negative.
2213 __isl_give isl_basic_set
*isl_aff_neg_basic_set(__isl_take isl_aff
*aff
)
2215 aff
= isl_aff_neg(aff
);
2216 return isl_aff_pos_basic_set(aff
);
2219 /* Return a basic set containing those elements in the space
2220 * of aff where it is zero.
2221 * If "rational" is set, then return a rational basic set.
2223 * If "aff" is NaN, then it is not zero.
2225 static __isl_give isl_basic_set
*aff_zero_basic_set(__isl_take isl_aff
*aff
,
2228 isl_constraint
*ineq
;
2229 isl_basic_set
*bset
;
2233 if (isl_aff_is_nan(aff
)) {
2234 isl_space
*space
= isl_aff_get_domain_space(aff
);
2236 return isl_basic_set_empty(space
);
2239 ineq
= isl_equality_from_aff(aff
);
2241 bset
= isl_basic_set_from_constraint(ineq
);
2243 bset
= isl_basic_set_set_rational(bset
);
2244 bset
= isl_basic_set_simplify(bset
);
2248 /* Return a basic set containing those elements in the space
2249 * of aff where it is zero.
2251 __isl_give isl_basic_set
*isl_aff_zero_basic_set(__isl_take isl_aff
*aff
)
2253 return aff_zero_basic_set(aff
, 0);
2256 /* Return a basic set containing those elements in the shared space
2257 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2259 __isl_give isl_basic_set
*isl_aff_ge_basic_set(__isl_take isl_aff
*aff1
,
2260 __isl_take isl_aff
*aff2
)
2262 aff1
= isl_aff_sub(aff1
, aff2
);
2264 return isl_aff_nonneg_basic_set(aff1
);
2267 /* Return a basic set containing those elements in the shared domain space
2268 * of "aff1" and "aff2" where "aff1" is greater than "aff2".
2270 __isl_give isl_basic_set
*isl_aff_gt_basic_set(__isl_take isl_aff
*aff1
,
2271 __isl_take isl_aff
*aff2
)
2273 aff1
= isl_aff_sub(aff1
, aff2
);
2275 return isl_aff_pos_basic_set(aff1
);
2278 /* Return a set containing those elements in the shared space
2279 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2281 __isl_give isl_set
*isl_aff_ge_set(__isl_take isl_aff
*aff1
,
2282 __isl_take isl_aff
*aff2
)
2284 return isl_set_from_basic_set(isl_aff_ge_basic_set(aff1
, aff2
));
2287 /* Return a basic set containing those elements in the shared space
2288 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2290 __isl_give isl_basic_set
*isl_aff_le_basic_set(__isl_take isl_aff
*aff1
,
2291 __isl_take isl_aff
*aff2
)
2293 return isl_aff_ge_basic_set(aff2
, aff1
);
2296 /* Return a basic set containing those elements in the shared domain space
2297 * of "aff1" and "aff2" where "aff1" is smaller than "aff2".
2299 __isl_give isl_basic_set
*isl_aff_lt_basic_set(__isl_take isl_aff
*aff1
,
2300 __isl_take isl_aff
*aff2
)
2302 return isl_aff_gt_basic_set(aff2
, aff1
);
2305 /* Return a set containing those elements in the shared space
2306 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2308 __isl_give isl_set
*isl_aff_le_set(__isl_take isl_aff
*aff1
,
2309 __isl_take isl_aff
*aff2
)
2311 return isl_aff_ge_set(aff2
, aff1
);
2314 /* Return a set containing those elements in the shared domain space
2315 * of "aff1" and "aff2" where "aff1" is smaller than "aff2".
2317 __isl_give isl_set
*isl_aff_lt_set(__isl_take isl_aff
*aff1
,
2318 __isl_take isl_aff
*aff2
)
2320 return isl_set_from_basic_set(isl_aff_lt_basic_set(aff1
, aff2
));
2323 /* Return a basic set containing those elements in the shared space
2324 * of aff1 and aff2 where aff1 and aff2 are equal.
2326 __isl_give isl_basic_set
*isl_aff_eq_basic_set(__isl_take isl_aff
*aff1
,
2327 __isl_take isl_aff
*aff2
)
2329 aff1
= isl_aff_sub(aff1
, aff2
);
2331 return isl_aff_zero_basic_set(aff1
);
2334 /* Return a set containing those elements in the shared space
2335 * of aff1 and aff2 where aff1 and aff2 are equal.
2337 __isl_give isl_set
*isl_aff_eq_set(__isl_take isl_aff
*aff1
,
2338 __isl_take isl_aff
*aff2
)
2340 return isl_set_from_basic_set(isl_aff_eq_basic_set(aff1
, aff2
));
2343 __isl_give isl_aff
*isl_aff_add_on_domain(__isl_keep isl_set
*dom
,
2344 __isl_take isl_aff
*aff1
, __isl_take isl_aff
*aff2
)
2346 aff1
= isl_aff_add(aff1
, aff2
);
2347 aff1
= isl_aff_gist(aff1
, isl_set_copy(dom
));
2351 int isl_aff_is_empty(__isl_keep isl_aff
*aff
)
2359 /* Check whether the given affine expression has non-zero coefficient
2360 * for any dimension in the given range or if any of these dimensions
2361 * appear with non-zero coefficients in any of the integer divisions
2362 * involved in the affine expression.
2364 isl_bool
isl_aff_involves_dims(__isl_keep isl_aff
*aff
,
2365 enum isl_dim_type type
, unsigned first
, unsigned n
)
2370 isl_bool involves
= isl_bool_false
;
2373 return isl_bool_error
;
2375 return isl_bool_false
;
2377 ctx
= isl_aff_get_ctx(aff
);
2378 if (first
+ n
> isl_aff_dim(aff
, type
))
2379 isl_die(ctx
, isl_error_invalid
,
2380 "range out of bounds", return isl_bool_error
);
2382 active
= isl_local_space_get_active(aff
->ls
, aff
->v
->el
+ 2);
2386 first
+= isl_local_space_offset(aff
->ls
, type
) - 1;
2387 for (i
= 0; i
< n
; ++i
)
2388 if (active
[first
+ i
]) {
2389 involves
= isl_bool_true
;
2398 return isl_bool_error
;
2401 __isl_give isl_aff
*isl_aff_drop_dims(__isl_take isl_aff
*aff
,
2402 enum isl_dim_type type
, unsigned first
, unsigned n
)
2408 if (type
== isl_dim_out
)
2409 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2410 "cannot drop output/set dimension",
2411 return isl_aff_free(aff
));
2412 if (type
== isl_dim_in
)
2414 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2417 ctx
= isl_aff_get_ctx(aff
);
2418 if (first
+ n
> isl_local_space_dim(aff
->ls
, type
))
2419 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
2420 return isl_aff_free(aff
));
2422 aff
= isl_aff_cow(aff
);
2426 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, type
, first
, n
);
2428 return isl_aff_free(aff
);
2430 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2431 aff
->v
= isl_vec_drop_els(aff
->v
, first
, n
);
2433 return isl_aff_free(aff
);
2438 /* Project the domain of the affine expression onto its parameter space.
2439 * The affine expression may not involve any of the domain dimensions.
2441 __isl_give isl_aff
*isl_aff_project_domain_on_params(__isl_take isl_aff
*aff
)
2447 n
= isl_aff_dim(aff
, isl_dim_in
);
2448 involves
= isl_aff_involves_dims(aff
, isl_dim_in
, 0, n
);
2450 return isl_aff_free(aff
);
2452 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2453 "affine expression involves some of the domain dimensions",
2454 return isl_aff_free(aff
));
2455 aff
= isl_aff_drop_dims(aff
, isl_dim_in
, 0, n
);
2456 space
= isl_aff_get_domain_space(aff
);
2457 space
= isl_space_params(space
);
2458 aff
= isl_aff_reset_domain_space(aff
, space
);
2462 __isl_give isl_aff
*isl_aff_insert_dims(__isl_take isl_aff
*aff
,
2463 enum isl_dim_type type
, unsigned first
, unsigned n
)
2469 if (type
== isl_dim_out
)
2470 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2471 "cannot insert output/set dimensions",
2472 return isl_aff_free(aff
));
2473 if (type
== isl_dim_in
)
2475 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2478 ctx
= isl_aff_get_ctx(aff
);
2479 if (first
> isl_local_space_dim(aff
->ls
, type
))
2480 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
2481 return isl_aff_free(aff
));
2483 aff
= isl_aff_cow(aff
);
2487 aff
->ls
= isl_local_space_insert_dims(aff
->ls
, type
, first
, n
);
2489 return isl_aff_free(aff
);
2491 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2492 aff
->v
= isl_vec_insert_zero_els(aff
->v
, first
, n
);
2494 return isl_aff_free(aff
);
2499 __isl_give isl_aff
*isl_aff_add_dims(__isl_take isl_aff
*aff
,
2500 enum isl_dim_type type
, unsigned n
)
2504 pos
= isl_aff_dim(aff
, type
);
2506 return isl_aff_insert_dims(aff
, type
, pos
, n
);
2509 __isl_give isl_pw_aff
*isl_pw_aff_add_dims(__isl_take isl_pw_aff
*pwaff
,
2510 enum isl_dim_type type
, unsigned n
)
2514 pos
= isl_pw_aff_dim(pwaff
, type
);
2516 return isl_pw_aff_insert_dims(pwaff
, type
, pos
, n
);
2519 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "aff"
2520 * to dimensions of "dst_type" at "dst_pos".
2522 * We only support moving input dimensions to parameters and vice versa.
2524 __isl_give isl_aff
*isl_aff_move_dims(__isl_take isl_aff
*aff
,
2525 enum isl_dim_type dst_type
, unsigned dst_pos
,
2526 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2534 !isl_local_space_is_named_or_nested(aff
->ls
, src_type
) &&
2535 !isl_local_space_is_named_or_nested(aff
->ls
, dst_type
))
2538 if (dst_type
== isl_dim_out
|| src_type
== isl_dim_out
)
2539 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2540 "cannot move output/set dimension",
2541 return isl_aff_free(aff
));
2542 if (dst_type
== isl_dim_div
|| src_type
== isl_dim_div
)
2543 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2544 "cannot move divs", return isl_aff_free(aff
));
2545 if (dst_type
== isl_dim_in
)
2546 dst_type
= isl_dim_set
;
2547 if (src_type
== isl_dim_in
)
2548 src_type
= isl_dim_set
;
2550 if (src_pos
+ n
> isl_local_space_dim(aff
->ls
, src_type
))
2551 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2552 "range out of bounds", return isl_aff_free(aff
));
2553 if (dst_type
== src_type
)
2554 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2555 "moving dims within the same type not supported",
2556 return isl_aff_free(aff
));
2558 aff
= isl_aff_cow(aff
);
2562 g_src_pos
= 1 + isl_local_space_offset(aff
->ls
, src_type
) + src_pos
;
2563 g_dst_pos
= 1 + isl_local_space_offset(aff
->ls
, dst_type
) + dst_pos
;
2564 if (dst_type
> src_type
)
2567 aff
->v
= isl_vec_move_els(aff
->v
, g_dst_pos
, g_src_pos
, n
);
2568 aff
->ls
= isl_local_space_move_dims(aff
->ls
, dst_type
, dst_pos
,
2569 src_type
, src_pos
, n
);
2570 if (!aff
->v
|| !aff
->ls
)
2571 return isl_aff_free(aff
);
2573 aff
= sort_divs(aff
);
2578 __isl_give isl_pw_aff
*isl_pw_aff_from_aff(__isl_take isl_aff
*aff
)
2580 isl_set
*dom
= isl_set_universe(isl_aff_get_domain_space(aff
));
2581 return isl_pw_aff_alloc(dom
, aff
);
2584 #define isl_aff_involves_nan isl_aff_is_nan
2587 #define PW isl_pw_aff
2591 #define EL_IS_ZERO is_empty
2595 #define IS_ZERO is_empty
2598 #undef DEFAULT_IS_ZERO
2599 #define DEFAULT_IS_ZERO 0
2606 #include <isl_pw_templ.c>
2607 #include <isl_pw_hash.c>
2608 #include <isl_pw_union_opt.c>
2611 #define UNION isl_union_pw_aff
2613 #define PART isl_pw_aff
2615 #define PARTS pw_aff
2617 #include <isl_union_single.c>
2618 #include <isl_union_neg.c>
2620 static __isl_give isl_set
*align_params_pw_pw_set_and(
2621 __isl_take isl_pw_aff
*pwaff1
, __isl_take isl_pw_aff
*pwaff2
,
2622 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
2623 __isl_take isl_pw_aff
*pwaff2
))
2625 isl_bool equal_params
;
2627 if (!pwaff1
|| !pwaff2
)
2629 equal_params
= isl_space_has_equal_params(pwaff1
->dim
, pwaff2
->dim
);
2630 if (equal_params
< 0)
2633 return fn(pwaff1
, pwaff2
);
2634 if (!isl_space_has_named_params(pwaff1
->dim
) ||
2635 !isl_space_has_named_params(pwaff2
->dim
))
2636 isl_die(isl_pw_aff_get_ctx(pwaff1
), isl_error_invalid
,
2637 "unaligned unnamed parameters", goto error
);
2638 pwaff1
= isl_pw_aff_align_params(pwaff1
, isl_pw_aff_get_space(pwaff2
));
2639 pwaff2
= isl_pw_aff_align_params(pwaff2
, isl_pw_aff_get_space(pwaff1
));
2640 return fn(pwaff1
, pwaff2
);
2642 isl_pw_aff_free(pwaff1
);
2643 isl_pw_aff_free(pwaff2
);
2647 /* Align the parameters of the to isl_pw_aff arguments and
2648 * then apply a function "fn" on them that returns an isl_map.
2650 static __isl_give isl_map
*align_params_pw_pw_map_and(
2651 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
2652 __isl_give isl_map
*(*fn
)(__isl_take isl_pw_aff
*pa1
,
2653 __isl_take isl_pw_aff
*pa2
))
2655 isl_bool equal_params
;
2659 equal_params
= isl_space_has_equal_params(pa1
->dim
, pa2
->dim
);
2660 if (equal_params
< 0)
2663 return fn(pa1
, pa2
);
2664 if (!isl_space_has_named_params(pa1
->dim
) ||
2665 !isl_space_has_named_params(pa2
->dim
))
2666 isl_die(isl_pw_aff_get_ctx(pa1
), isl_error_invalid
,
2667 "unaligned unnamed parameters", goto error
);
2668 pa1
= isl_pw_aff_align_params(pa1
, isl_pw_aff_get_space(pa2
));
2669 pa2
= isl_pw_aff_align_params(pa2
, isl_pw_aff_get_space(pa1
));
2670 return fn(pa1
, pa2
);
2672 isl_pw_aff_free(pa1
);
2673 isl_pw_aff_free(pa2
);
2677 /* Compute a piecewise quasi-affine expression with a domain that
2678 * is the union of those of pwaff1 and pwaff2 and such that on each
2679 * cell, the quasi-affine expression is the maximum of those of pwaff1
2680 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2681 * cell, then the associated expression is the defined one.
2683 static __isl_give isl_pw_aff
*pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2684 __isl_take isl_pw_aff
*pwaff2
)
2686 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_ge_set
);
2689 __isl_give isl_pw_aff
*isl_pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2690 __isl_take isl_pw_aff
*pwaff2
)
2692 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2696 /* Compute a piecewise quasi-affine expression with a domain that
2697 * is the union of those of pwaff1 and pwaff2 and such that on each
2698 * cell, the quasi-affine expression is the minimum of those of pwaff1
2699 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2700 * cell, then the associated expression is the defined one.
2702 static __isl_give isl_pw_aff
*pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2703 __isl_take isl_pw_aff
*pwaff2
)
2705 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_le_set
);
2708 __isl_give isl_pw_aff
*isl_pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2709 __isl_take isl_pw_aff
*pwaff2
)
2711 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2715 __isl_give isl_pw_aff
*isl_pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
2716 __isl_take isl_pw_aff
*pwaff2
, int max
)
2719 return isl_pw_aff_union_max(pwaff1
, pwaff2
);
2721 return isl_pw_aff_union_min(pwaff1
, pwaff2
);
2724 /* Construct a map with as domain the domain of pwaff and
2725 * one-dimensional range corresponding to the affine expressions.
2727 static __isl_give isl_map
*map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2736 dim
= isl_pw_aff_get_space(pwaff
);
2737 map
= isl_map_empty(dim
);
2739 for (i
= 0; i
< pwaff
->n
; ++i
) {
2740 isl_basic_map
*bmap
;
2743 bmap
= isl_basic_map_from_aff(isl_aff_copy(pwaff
->p
[i
].aff
));
2744 map_i
= isl_map_from_basic_map(bmap
);
2745 map_i
= isl_map_intersect_domain(map_i
,
2746 isl_set_copy(pwaff
->p
[i
].set
));
2747 map
= isl_map_union_disjoint(map
, map_i
);
2750 isl_pw_aff_free(pwaff
);
2755 /* Construct a map with as domain the domain of pwaff and
2756 * one-dimensional range corresponding to the affine expressions.
2758 __isl_give isl_map
*isl_map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2762 if (isl_space_is_set(pwaff
->dim
))
2763 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2764 "space of input is not a map", goto error
);
2765 return map_from_pw_aff(pwaff
);
2767 isl_pw_aff_free(pwaff
);
2771 /* Construct a one-dimensional set with as parameter domain
2772 * the domain of pwaff and the single set dimension
2773 * corresponding to the affine expressions.
2775 __isl_give isl_set
*isl_set_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2779 if (!isl_space_is_set(pwaff
->dim
))
2780 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2781 "space of input is not a set", goto error
);
2782 return map_from_pw_aff(pwaff
);
2784 isl_pw_aff_free(pwaff
);
2788 /* Return a set containing those elements in the domain
2789 * of "pwaff" where it satisfies "fn" (if complement is 0) or
2790 * does not satisfy "fn" (if complement is 1).
2792 * The pieces with a NaN never belong to the result since
2793 * NaN does not satisfy any property.
2795 static __isl_give isl_set
*pw_aff_locus(__isl_take isl_pw_aff
*pwaff
,
2796 __isl_give isl_basic_set
*(*fn
)(__isl_take isl_aff
*aff
, int rational
),
2805 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
2807 for (i
= 0; i
< pwaff
->n
; ++i
) {
2808 isl_basic_set
*bset
;
2809 isl_set
*set_i
, *locus
;
2812 if (isl_aff_is_nan(pwaff
->p
[i
].aff
))
2815 rational
= isl_set_has_rational(pwaff
->p
[i
].set
);
2816 bset
= fn(isl_aff_copy(pwaff
->p
[i
].aff
), rational
);
2817 locus
= isl_set_from_basic_set(bset
);
2818 set_i
= isl_set_copy(pwaff
->p
[i
].set
);
2820 set_i
= isl_set_subtract(set_i
, locus
);
2822 set_i
= isl_set_intersect(set_i
, locus
);
2823 set
= isl_set_union_disjoint(set
, set_i
);
2826 isl_pw_aff_free(pwaff
);
2831 /* Return a set containing those elements in the domain
2832 * of "pa" where it is positive.
2834 __isl_give isl_set
*isl_pw_aff_pos_set(__isl_take isl_pw_aff
*pa
)
2836 return pw_aff_locus(pa
, &aff_pos_basic_set
, 0);
2839 /* Return a set containing those elements in the domain
2840 * of pwaff where it is non-negative.
2842 __isl_give isl_set
*isl_pw_aff_nonneg_set(__isl_take isl_pw_aff
*pwaff
)
2844 return pw_aff_locus(pwaff
, &aff_nonneg_basic_set
, 0);
2847 /* Return a set containing those elements in the domain
2848 * of pwaff where it is zero.
2850 __isl_give isl_set
*isl_pw_aff_zero_set(__isl_take isl_pw_aff
*pwaff
)
2852 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 0);
2855 /* Return a set containing those elements in the domain
2856 * of pwaff where it is not zero.
2858 __isl_give isl_set
*isl_pw_aff_non_zero_set(__isl_take isl_pw_aff
*pwaff
)
2860 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 1);
2863 /* Return a set containing those elements in the shared domain
2864 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
2866 * We compute the difference on the shared domain and then construct
2867 * the set of values where this difference is non-negative.
2868 * If strict is set, we first subtract 1 from the difference.
2869 * If equal is set, we only return the elements where pwaff1 and pwaff2
2872 static __isl_give isl_set
*pw_aff_gte_set(__isl_take isl_pw_aff
*pwaff1
,
2873 __isl_take isl_pw_aff
*pwaff2
, int strict
, int equal
)
2875 isl_set
*set1
, *set2
;
2877 set1
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
));
2878 set2
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
));
2879 set1
= isl_set_intersect(set1
, set2
);
2880 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, isl_set_copy(set1
));
2881 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, isl_set_copy(set1
));
2882 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_neg(pwaff2
));
2885 isl_space
*dim
= isl_set_get_space(set1
);
2887 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2888 aff
= isl_aff_add_constant_si(aff
, -1);
2889 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_alloc(set1
, aff
));
2894 return isl_pw_aff_zero_set(pwaff1
);
2895 return isl_pw_aff_nonneg_set(pwaff1
);
2898 /* Return a set containing those elements in the shared domain
2899 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
2901 static __isl_give isl_set
*pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2902 __isl_take isl_pw_aff
*pwaff2
)
2904 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 1);
2907 __isl_give isl_set
*isl_pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2908 __isl_take isl_pw_aff
*pwaff2
)
2910 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_eq_set
);
2913 /* Return a set containing those elements in the shared domain
2914 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
2916 static __isl_give isl_set
*pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2917 __isl_take isl_pw_aff
*pwaff2
)
2919 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 0);
2922 __isl_give isl_set
*isl_pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2923 __isl_take isl_pw_aff
*pwaff2
)
2925 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ge_set
);
2928 /* Return a set containing those elements in the shared domain
2929 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
2931 static __isl_give isl_set
*pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2932 __isl_take isl_pw_aff
*pwaff2
)
2934 return pw_aff_gte_set(pwaff1
, pwaff2
, 1, 0);
2937 __isl_give isl_set
*isl_pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2938 __isl_take isl_pw_aff
*pwaff2
)
2940 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_gt_set
);
2943 __isl_give isl_set
*isl_pw_aff_le_set(__isl_take isl_pw_aff
*pwaff1
,
2944 __isl_take isl_pw_aff
*pwaff2
)
2946 return isl_pw_aff_ge_set(pwaff2
, pwaff1
);
2949 __isl_give isl_set
*isl_pw_aff_lt_set(__isl_take isl_pw_aff
*pwaff1
,
2950 __isl_take isl_pw_aff
*pwaff2
)
2952 return isl_pw_aff_gt_set(pwaff2
, pwaff1
);
2955 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2956 * where the function values are ordered in the same way as "order",
2957 * which returns a set in the shared domain of its two arguments.
2958 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
2960 * Let "pa1" and "pa2" be defined on domains A and B respectively.
2961 * We first pull back the two functions such that they are defined on
2962 * the domain [A -> B]. Then we apply "order", resulting in a set
2963 * in the space [A -> B]. Finally, we unwrap this set to obtain
2964 * a map in the space A -> B.
2966 static __isl_give isl_map
*isl_pw_aff_order_map_aligned(
2967 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
2968 __isl_give isl_set
*(*order
)(__isl_take isl_pw_aff
*pa1
,
2969 __isl_take isl_pw_aff
*pa2
))
2971 isl_space
*space1
, *space2
;
2975 space1
= isl_space_domain(isl_pw_aff_get_space(pa1
));
2976 space2
= isl_space_domain(isl_pw_aff_get_space(pa2
));
2977 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
2978 ma
= isl_multi_aff_domain_map(isl_space_copy(space1
));
2979 pa1
= isl_pw_aff_pullback_multi_aff(pa1
, ma
);
2980 ma
= isl_multi_aff_range_map(space1
);
2981 pa2
= isl_pw_aff_pullback_multi_aff(pa2
, ma
);
2982 set
= order(pa1
, pa2
);
2984 return isl_set_unwrap(set
);
2987 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2988 * where the function values are equal.
2989 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
2991 static __isl_give isl_map
*isl_pw_aff_eq_map_aligned(__isl_take isl_pw_aff
*pa1
,
2992 __isl_take isl_pw_aff
*pa2
)
2994 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_eq_set
);
2997 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2998 * where the function values are equal.
3000 __isl_give isl_map
*isl_pw_aff_eq_map(__isl_take isl_pw_aff
*pa1
,
3001 __isl_take isl_pw_aff
*pa2
)
3003 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_eq_map_aligned
);
3006 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3007 * where the function value of "pa1" is less than the function value of "pa2".
3008 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3010 static __isl_give isl_map
*isl_pw_aff_lt_map_aligned(__isl_take isl_pw_aff
*pa1
,
3011 __isl_take isl_pw_aff
*pa2
)
3013 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_lt_set
);
3016 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3017 * where the function value of "pa1" is less than the function value of "pa2".
3019 __isl_give isl_map
*isl_pw_aff_lt_map(__isl_take isl_pw_aff
*pa1
,
3020 __isl_take isl_pw_aff
*pa2
)
3022 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_lt_map_aligned
);
3025 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3026 * where the function value of "pa1" is greater than the function value
3028 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3030 static __isl_give isl_map
*isl_pw_aff_gt_map_aligned(__isl_take isl_pw_aff
*pa1
,
3031 __isl_take isl_pw_aff
*pa2
)
3033 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_gt_set
);
3036 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3037 * where the function value of "pa1" is greater than the function value
3040 __isl_give isl_map
*isl_pw_aff_gt_map(__isl_take isl_pw_aff
*pa1
,
3041 __isl_take isl_pw_aff
*pa2
)
3043 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_gt_map_aligned
);
3046 /* Return a set containing those elements in the shared domain
3047 * of the elements of list1 and list2 where each element in list1
3048 * has the relation specified by "fn" with each element in list2.
3050 static __isl_give isl_set
*pw_aff_list_set(__isl_take isl_pw_aff_list
*list1
,
3051 __isl_take isl_pw_aff_list
*list2
,
3052 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3053 __isl_take isl_pw_aff
*pwaff2
))
3059 if (!list1
|| !list2
)
3062 ctx
= isl_pw_aff_list_get_ctx(list1
);
3063 if (list1
->n
< 1 || list2
->n
< 1)
3064 isl_die(ctx
, isl_error_invalid
,
3065 "list should contain at least one element", goto error
);
3067 set
= isl_set_universe(isl_pw_aff_get_domain_space(list1
->p
[0]));
3068 for (i
= 0; i
< list1
->n
; ++i
)
3069 for (j
= 0; j
< list2
->n
; ++j
) {
3072 set_ij
= fn(isl_pw_aff_copy(list1
->p
[i
]),
3073 isl_pw_aff_copy(list2
->p
[j
]));
3074 set
= isl_set_intersect(set
, set_ij
);
3077 isl_pw_aff_list_free(list1
);
3078 isl_pw_aff_list_free(list2
);
3081 isl_pw_aff_list_free(list1
);
3082 isl_pw_aff_list_free(list2
);
3086 /* Return a set containing those elements in the shared domain
3087 * of the elements of list1 and list2 where each element in list1
3088 * is equal to each element in list2.
3090 __isl_give isl_set
*isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list
*list1
,
3091 __isl_take isl_pw_aff_list
*list2
)
3093 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_eq_set
);
3096 __isl_give isl_set
*isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list
*list1
,
3097 __isl_take isl_pw_aff_list
*list2
)
3099 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ne_set
);
3102 /* Return a set containing those elements in the shared domain
3103 * of the elements of list1 and list2 where each element in list1
3104 * is less than or equal to each element in list2.
3106 __isl_give isl_set
*isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list
*list1
,
3107 __isl_take isl_pw_aff_list
*list2
)
3109 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_le_set
);
3112 __isl_give isl_set
*isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list
*list1
,
3113 __isl_take isl_pw_aff_list
*list2
)
3115 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_lt_set
);
3118 __isl_give isl_set
*isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list
*list1
,
3119 __isl_take isl_pw_aff_list
*list2
)
3121 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ge_set
);
3124 __isl_give isl_set
*isl_pw_aff_list_gt_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_gt_set
);
3131 /* Return a set containing those elements in the shared domain
3132 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
3134 static __isl_give isl_set
*pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3135 __isl_take isl_pw_aff
*pwaff2
)
3137 isl_set
*set_lt
, *set_gt
;
3139 set_lt
= isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1
),
3140 isl_pw_aff_copy(pwaff2
));
3141 set_gt
= isl_pw_aff_gt_set(pwaff1
, pwaff2
);
3142 return isl_set_union_disjoint(set_lt
, set_gt
);
3145 __isl_give isl_set
*isl_pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3146 __isl_take isl_pw_aff
*pwaff2
)
3148 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ne_set
);
3151 __isl_give isl_pw_aff
*isl_pw_aff_scale_down(__isl_take isl_pw_aff
*pwaff
,
3156 if (isl_int_is_one(v
))
3158 if (!isl_int_is_pos(v
))
3159 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
3160 "factor needs to be positive",
3161 return isl_pw_aff_free(pwaff
));
3162 pwaff
= isl_pw_aff_cow(pwaff
);
3168 for (i
= 0; i
< pwaff
->n
; ++i
) {
3169 pwaff
->p
[i
].aff
= isl_aff_scale_down(pwaff
->p
[i
].aff
, v
);
3170 if (!pwaff
->p
[i
].aff
)
3171 return isl_pw_aff_free(pwaff
);
3177 __isl_give isl_pw_aff
*isl_pw_aff_floor(__isl_take isl_pw_aff
*pwaff
)
3181 pwaff
= isl_pw_aff_cow(pwaff
);
3187 for (i
= 0; i
< pwaff
->n
; ++i
) {
3188 pwaff
->p
[i
].aff
= isl_aff_floor(pwaff
->p
[i
].aff
);
3189 if (!pwaff
->p
[i
].aff
)
3190 return isl_pw_aff_free(pwaff
);
3196 __isl_give isl_pw_aff
*isl_pw_aff_ceil(__isl_take isl_pw_aff
*pwaff
)
3200 pwaff
= isl_pw_aff_cow(pwaff
);
3206 for (i
= 0; i
< pwaff
->n
; ++i
) {
3207 pwaff
->p
[i
].aff
= isl_aff_ceil(pwaff
->p
[i
].aff
);
3208 if (!pwaff
->p
[i
].aff
)
3209 return isl_pw_aff_free(pwaff
);
3215 /* Assuming that "cond1" and "cond2" are disjoint,
3216 * return an affine expression that is equal to pwaff1 on cond1
3217 * and to pwaff2 on cond2.
3219 static __isl_give isl_pw_aff
*isl_pw_aff_select(
3220 __isl_take isl_set
*cond1
, __isl_take isl_pw_aff
*pwaff1
,
3221 __isl_take isl_set
*cond2
, __isl_take isl_pw_aff
*pwaff2
)
3223 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, cond1
);
3224 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, cond2
);
3226 return isl_pw_aff_add_disjoint(pwaff1
, pwaff2
);
3229 /* Return an affine expression that is equal to pwaff_true for elements
3230 * where "cond" is non-zero and to pwaff_false for elements where "cond"
3232 * That is, return cond ? pwaff_true : pwaff_false;
3234 * If "cond" involves and NaN, then we conservatively return a NaN
3235 * on its entire domain. In principle, we could consider the pieces
3236 * where it is NaN separately from those where it is not.
3238 * If "pwaff_true" and "pwaff_false" are obviously equal to each other,
3239 * then only use the domain of "cond" to restrict the domain.
3241 __isl_give isl_pw_aff
*isl_pw_aff_cond(__isl_take isl_pw_aff
*cond
,
3242 __isl_take isl_pw_aff
*pwaff_true
, __isl_take isl_pw_aff
*pwaff_false
)
3244 isl_set
*cond_true
, *cond_false
;
3249 if (isl_pw_aff_involves_nan(cond
)) {
3250 isl_space
*space
= isl_pw_aff_get_domain_space(cond
);
3251 isl_local_space
*ls
= isl_local_space_from_space(space
);
3252 isl_pw_aff_free(cond
);
3253 isl_pw_aff_free(pwaff_true
);
3254 isl_pw_aff_free(pwaff_false
);
3255 return isl_pw_aff_nan_on_domain(ls
);
3258 pwaff_true
= isl_pw_aff_align_params(pwaff_true
,
3259 isl_pw_aff_get_space(pwaff_false
));
3260 pwaff_false
= isl_pw_aff_align_params(pwaff_false
,
3261 isl_pw_aff_get_space(pwaff_true
));
3262 equal
= isl_pw_aff_plain_is_equal(pwaff_true
, pwaff_false
);
3268 dom
= isl_set_coalesce(isl_pw_aff_domain(cond
));
3269 isl_pw_aff_free(pwaff_false
);
3270 return isl_pw_aff_intersect_domain(pwaff_true
, dom
);
3273 cond_true
= isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond
));
3274 cond_false
= isl_pw_aff_zero_set(cond
);
3275 return isl_pw_aff_select(cond_true
, pwaff_true
,
3276 cond_false
, pwaff_false
);
3278 isl_pw_aff_free(cond
);
3279 isl_pw_aff_free(pwaff_true
);
3280 isl_pw_aff_free(pwaff_false
);
3284 isl_bool
isl_aff_is_cst(__isl_keep isl_aff
*aff
)
3287 return isl_bool_error
;
3289 return isl_seq_first_non_zero(aff
->v
->el
+ 2, aff
->v
->size
- 2) == -1;
3292 /* Check whether pwaff is a piecewise constant.
3294 isl_bool
isl_pw_aff_is_cst(__isl_keep isl_pw_aff
*pwaff
)
3299 return isl_bool_error
;
3301 for (i
= 0; i
< pwaff
->n
; ++i
) {
3302 isl_bool is_cst
= isl_aff_is_cst(pwaff
->p
[i
].aff
);
3303 if (is_cst
< 0 || !is_cst
)
3307 return isl_bool_true
;
3310 /* Are all elements of "mpa" piecewise constants?
3312 isl_bool
isl_multi_pw_aff_is_cst(__isl_keep isl_multi_pw_aff
*mpa
)
3317 return isl_bool_error
;
3319 for (i
= 0; i
< mpa
->n
; ++i
) {
3320 isl_bool is_cst
= isl_pw_aff_is_cst(mpa
->p
[i
]);
3321 if (is_cst
< 0 || !is_cst
)
3325 return isl_bool_true
;
3328 /* Return the product of "aff1" and "aff2".
3330 * If either of the two is NaN, then the result is NaN.
3332 * Otherwise, at least one of "aff1" or "aff2" needs to be a constant.
3334 __isl_give isl_aff
*isl_aff_mul(__isl_take isl_aff
*aff1
,
3335 __isl_take isl_aff
*aff2
)
3340 if (isl_aff_is_nan(aff1
)) {
3344 if (isl_aff_is_nan(aff2
)) {
3349 if (!isl_aff_is_cst(aff2
) && isl_aff_is_cst(aff1
))
3350 return isl_aff_mul(aff2
, aff1
);
3352 if (!isl_aff_is_cst(aff2
))
3353 isl_die(isl_aff_get_ctx(aff1
), isl_error_invalid
,
3354 "at least one affine expression should be constant",
3357 aff1
= isl_aff_cow(aff1
);
3361 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[1]);
3362 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[0]);
3372 /* Divide "aff1" by "aff2", assuming "aff2" is a constant.
3374 * If either of the two is NaN, then the result is NaN.
3376 __isl_give isl_aff
*isl_aff_div(__isl_take isl_aff
*aff1
,
3377 __isl_take isl_aff
*aff2
)
3385 if (isl_aff_is_nan(aff1
)) {
3389 if (isl_aff_is_nan(aff2
)) {
3394 is_cst
= isl_aff_is_cst(aff2
);
3398 isl_die(isl_aff_get_ctx(aff2
), isl_error_invalid
,
3399 "second argument should be a constant", goto error
);
3404 neg
= isl_int_is_neg(aff2
->v
->el
[1]);
3406 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3407 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3410 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[0]);
3411 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[1]);
3414 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3415 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3426 static __isl_give isl_pw_aff
*pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3427 __isl_take isl_pw_aff
*pwaff2
)
3429 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_add
);
3432 __isl_give isl_pw_aff
*isl_pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3433 __isl_take isl_pw_aff
*pwaff2
)
3435 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_add
);
3438 __isl_give isl_pw_aff
*isl_pw_aff_union_add(__isl_take isl_pw_aff
*pwaff1
,
3439 __isl_take isl_pw_aff
*pwaff2
)
3441 return isl_pw_aff_union_add_(pwaff1
, pwaff2
);
3444 static __isl_give isl_pw_aff
*pw_aff_mul(__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_mul
);
3450 __isl_give isl_pw_aff
*isl_pw_aff_mul(__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_mul
);
3456 static __isl_give isl_pw_aff
*pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3457 __isl_take isl_pw_aff
*pa2
)
3459 return isl_pw_aff_on_shared_domain(pa1
, pa2
, &isl_aff_div
);
3462 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
3464 __isl_give isl_pw_aff
*isl_pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3465 __isl_take isl_pw_aff
*pa2
)
3469 is_cst
= isl_pw_aff_is_cst(pa2
);
3473 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3474 "second argument should be a piecewise constant",
3476 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_div
);
3478 isl_pw_aff_free(pa1
);
3479 isl_pw_aff_free(pa2
);
3483 /* Compute the quotient of the integer division of "pa1" by "pa2"
3484 * with rounding towards zero.
3485 * "pa2" is assumed to be a piecewise constant.
3487 * In particular, return
3489 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
3492 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_q(__isl_take isl_pw_aff
*pa1
,
3493 __isl_take isl_pw_aff
*pa2
)
3499 is_cst
= isl_pw_aff_is_cst(pa2
);
3503 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3504 "second argument should be a piecewise constant",
3507 pa1
= isl_pw_aff_div(pa1
, pa2
);
3509 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1
));
3510 f
= isl_pw_aff_floor(isl_pw_aff_copy(pa1
));
3511 c
= isl_pw_aff_ceil(pa1
);
3512 return isl_pw_aff_cond(isl_set_indicator_function(cond
), f
, c
);
3514 isl_pw_aff_free(pa1
);
3515 isl_pw_aff_free(pa2
);
3519 /* Compute the remainder of the integer division of "pa1" by "pa2"
3520 * with rounding towards zero.
3521 * "pa2" is assumed to be a piecewise constant.
3523 * In particular, return
3525 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
3528 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_r(__isl_take isl_pw_aff
*pa1
,
3529 __isl_take isl_pw_aff
*pa2
)
3534 is_cst
= isl_pw_aff_is_cst(pa2
);
3538 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3539 "second argument should be a piecewise constant",
3541 res
= isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1
), isl_pw_aff_copy(pa2
));
3542 res
= isl_pw_aff_mul(pa2
, res
);
3543 res
= isl_pw_aff_sub(pa1
, res
);
3546 isl_pw_aff_free(pa1
);
3547 isl_pw_aff_free(pa2
);
3551 /* Does either of "pa1" or "pa2" involve any NaN2?
3553 static isl_bool
either_involves_nan(__isl_keep isl_pw_aff
*pa1
,
3554 __isl_keep isl_pw_aff
*pa2
)
3558 has_nan
= isl_pw_aff_involves_nan(pa1
);
3559 if (has_nan
< 0 || has_nan
)
3561 return isl_pw_aff_involves_nan(pa2
);
3564 /* Replace "pa1" and "pa2" (at least one of which involves a NaN)
3565 * by a NaN on their shared domain.
3567 * In principle, the result could be refined to only being NaN
3568 * on the parts of this domain where at least one of "pa1" or "pa2" is NaN.
3570 static __isl_give isl_pw_aff
*replace_by_nan(__isl_take isl_pw_aff
*pa1
,
3571 __isl_take isl_pw_aff
*pa2
)
3573 isl_local_space
*ls
;
3577 dom
= isl_set_intersect(isl_pw_aff_domain(pa1
), isl_pw_aff_domain(pa2
));
3578 ls
= isl_local_space_from_space(isl_set_get_space(dom
));
3579 pa
= isl_pw_aff_nan_on_domain(ls
);
3580 pa
= isl_pw_aff_intersect_domain(pa
, dom
);
3585 static __isl_give isl_pw_aff
*pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3586 __isl_take isl_pw_aff
*pwaff2
)
3591 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3592 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3593 le
= isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1
),
3594 isl_pw_aff_copy(pwaff2
));
3595 dom
= isl_set_subtract(dom
, isl_set_copy(le
));
3596 return isl_pw_aff_select(le
, pwaff1
, dom
, pwaff2
);
3599 static __isl_give isl_pw_aff
*pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3600 __isl_take isl_pw_aff
*pwaff2
)
3605 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3606 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3607 ge
= isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1
),
3608 isl_pw_aff_copy(pwaff2
));
3609 dom
= isl_set_subtract(dom
, isl_set_copy(ge
));
3610 return isl_pw_aff_select(ge
, pwaff1
, dom
, pwaff2
);
3613 /* Return an expression for the minimum (if "max" is not set) or
3614 * the maximum (if "max" is set) of "pa1" and "pa2".
3615 * If either expression involves any NaN, then return a NaN
3616 * on the shared domain as result.
3618 static __isl_give isl_pw_aff
*pw_aff_min_max(__isl_take isl_pw_aff
*pa1
,
3619 __isl_take isl_pw_aff
*pa2
, int max
)
3623 has_nan
= either_involves_nan(pa1
, pa2
);
3625 pa1
= isl_pw_aff_free(pa1
);
3627 return replace_by_nan(pa1
, pa2
);
3630 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_max
);
3632 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_min
);
3635 /* Return an expression for the minimum of "pwaff1" and "pwaff2".
3637 __isl_give isl_pw_aff
*isl_pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3638 __isl_take isl_pw_aff
*pwaff2
)
3640 return pw_aff_min_max(pwaff1
, pwaff2
, 0);
3643 /* Return an expression for the maximum of "pwaff1" and "pwaff2".
3645 __isl_give isl_pw_aff
*isl_pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3646 __isl_take isl_pw_aff
*pwaff2
)
3648 return pw_aff_min_max(pwaff1
, pwaff2
, 1);
3651 static __isl_give isl_pw_aff
*pw_aff_list_reduce(
3652 __isl_take isl_pw_aff_list
*list
,
3653 __isl_give isl_pw_aff
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3654 __isl_take isl_pw_aff
*pwaff2
))
3663 ctx
= isl_pw_aff_list_get_ctx(list
);
3665 isl_die(ctx
, isl_error_invalid
,
3666 "list should contain at least one element", goto error
);
3668 res
= isl_pw_aff_copy(list
->p
[0]);
3669 for (i
= 1; i
< list
->n
; ++i
)
3670 res
= fn(res
, isl_pw_aff_copy(list
->p
[i
]));
3672 isl_pw_aff_list_free(list
);
3675 isl_pw_aff_list_free(list
);
3679 /* Return an isl_pw_aff that maps each element in the intersection of the
3680 * domains of the elements of list to the minimal corresponding affine
3683 __isl_give isl_pw_aff
*isl_pw_aff_list_min(__isl_take isl_pw_aff_list
*list
)
3685 return pw_aff_list_reduce(list
, &isl_pw_aff_min
);
3688 /* Return an isl_pw_aff that maps each element in the intersection of the
3689 * domains of the elements of list to the maximal corresponding affine
3692 __isl_give isl_pw_aff
*isl_pw_aff_list_max(__isl_take isl_pw_aff_list
*list
)
3694 return pw_aff_list_reduce(list
, &isl_pw_aff_max
);
3697 /* Mark the domains of "pwaff" as rational.
3699 __isl_give isl_pw_aff
*isl_pw_aff_set_rational(__isl_take isl_pw_aff
*pwaff
)
3703 pwaff
= isl_pw_aff_cow(pwaff
);
3709 for (i
= 0; i
< pwaff
->n
; ++i
) {
3710 pwaff
->p
[i
].set
= isl_set_set_rational(pwaff
->p
[i
].set
);
3711 if (!pwaff
->p
[i
].set
)
3712 return isl_pw_aff_free(pwaff
);
3718 /* Mark the domains of the elements of "list" as rational.
3720 __isl_give isl_pw_aff_list
*isl_pw_aff_list_set_rational(
3721 __isl_take isl_pw_aff_list
*list
)
3731 for (i
= 0; i
< n
; ++i
) {
3734 pa
= isl_pw_aff_list_get_pw_aff(list
, i
);
3735 pa
= isl_pw_aff_set_rational(pa
);
3736 list
= isl_pw_aff_list_set_pw_aff(list
, i
, pa
);
3742 /* Do the parameters of "aff" match those of "space"?
3744 isl_bool
isl_aff_matching_params(__isl_keep isl_aff
*aff
,
3745 __isl_keep isl_space
*space
)
3747 isl_space
*aff_space
;
3751 return isl_bool_error
;
3753 aff_space
= isl_aff_get_domain_space(aff
);
3755 match
= isl_space_has_equal_params(space
, aff_space
);
3757 isl_space_free(aff_space
);
3761 /* Check that the domain space of "aff" matches "space".
3763 isl_stat
isl_aff_check_match_domain_space(__isl_keep isl_aff
*aff
,
3764 __isl_keep isl_space
*space
)
3766 isl_space
*aff_space
;
3770 return isl_stat_error
;
3772 aff_space
= isl_aff_get_domain_space(aff
);
3774 match
= isl_space_has_equal_params(space
, aff_space
);
3778 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3779 "parameters don't match", goto error
);
3780 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
3781 aff_space
, isl_dim_set
);
3785 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3786 "domains don't match", goto error
);
3787 isl_space_free(aff_space
);
3790 isl_space_free(aff_space
);
3791 return isl_stat_error
;
3800 #include <isl_multi_templ.c>
3801 #include <isl_multi_apply_set.c>
3802 #include <isl_multi_cmp.c>
3803 #include <isl_multi_floor.c>
3804 #include <isl_multi_gist.c>
3808 /* Construct an isl_multi_aff living in "space" that corresponds
3809 * to the affine transformation matrix "mat".
3811 __isl_give isl_multi_aff
*isl_multi_aff_from_aff_mat(
3812 __isl_take isl_space
*space
, __isl_take isl_mat
*mat
)
3815 isl_local_space
*ls
= NULL
;
3816 isl_multi_aff
*ma
= NULL
;
3817 int n_row
, n_col
, n_out
, total
;
3823 ctx
= isl_mat_get_ctx(mat
);
3825 n_row
= isl_mat_rows(mat
);
3826 n_col
= isl_mat_cols(mat
);
3828 isl_die(ctx
, isl_error_invalid
,
3829 "insufficient number of rows", goto error
);
3831 isl_die(ctx
, isl_error_invalid
,
3832 "insufficient number of columns", goto error
);
3833 n_out
= isl_space_dim(space
, isl_dim_out
);
3834 total
= isl_space_dim(space
, isl_dim_all
);
3835 if (1 + n_out
!= n_row
|| 2 + total
!= n_row
+ n_col
)
3836 isl_die(ctx
, isl_error_invalid
,
3837 "dimension mismatch", goto error
);
3839 ma
= isl_multi_aff_zero(isl_space_copy(space
));
3840 ls
= isl_local_space_from_space(isl_space_domain(space
));
3842 for (i
= 0; i
< n_row
- 1; ++i
) {
3846 v
= isl_vec_alloc(ctx
, 1 + n_col
);
3849 isl_int_set(v
->el
[0], mat
->row
[0][0]);
3850 isl_seq_cpy(v
->el
+ 1, mat
->row
[1 + i
], n_col
);
3851 v
= isl_vec_normalize(v
);
3852 aff
= isl_aff_alloc_vec(isl_local_space_copy(ls
), v
);
3853 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3856 isl_local_space_free(ls
);
3860 isl_local_space_free(ls
);
3862 isl_multi_aff_free(ma
);
3866 /* Remove any internal structure of the domain of "ma".
3867 * If there is any such internal structure in the input,
3868 * then the name of the corresponding space is also removed.
3870 __isl_give isl_multi_aff
*isl_multi_aff_flatten_domain(
3871 __isl_take isl_multi_aff
*ma
)
3878 if (!ma
->space
->nested
[0])
3881 space
= isl_multi_aff_get_space(ma
);
3882 space
= isl_space_flatten_domain(space
);
3883 ma
= isl_multi_aff_reset_space(ma
, space
);
3888 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3889 * of the space to its domain.
3891 __isl_give isl_multi_aff
*isl_multi_aff_domain_map(__isl_take isl_space
*space
)
3894 isl_local_space
*ls
;
3899 if (!isl_space_is_map(space
))
3900 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3901 "not a map space", goto error
);
3903 n_in
= isl_space_dim(space
, isl_dim_in
);
3904 space
= isl_space_domain_map(space
);
3906 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3908 isl_space_free(space
);
3912 space
= isl_space_domain(space
);
3913 ls
= isl_local_space_from_space(space
);
3914 for (i
= 0; i
< n_in
; ++i
) {
3917 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3919 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3921 isl_local_space_free(ls
);
3924 isl_space_free(space
);
3928 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3929 * of the space to its range.
3931 __isl_give isl_multi_aff
*isl_multi_aff_range_map(__isl_take isl_space
*space
)
3934 isl_local_space
*ls
;
3939 if (!isl_space_is_map(space
))
3940 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3941 "not a map space", goto error
);
3943 n_in
= isl_space_dim(space
, isl_dim_in
);
3944 n_out
= isl_space_dim(space
, isl_dim_out
);
3945 space
= isl_space_range_map(space
);
3947 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3949 isl_space_free(space
);
3953 space
= isl_space_domain(space
);
3954 ls
= isl_local_space_from_space(space
);
3955 for (i
= 0; i
< n_out
; ++i
) {
3958 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3959 isl_dim_set
, n_in
+ i
);
3960 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3962 isl_local_space_free(ls
);
3965 isl_space_free(space
);
3969 /* Given a map space, return an isl_pw_multi_aff that maps a wrapped copy
3970 * of the space to its range.
3972 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_map(
3973 __isl_take isl_space
*space
)
3975 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_range_map(space
));
3978 /* Given the space of a set and a range of set dimensions,
3979 * construct an isl_multi_aff that projects out those dimensions.
3981 __isl_give isl_multi_aff
*isl_multi_aff_project_out_map(
3982 __isl_take isl_space
*space
, enum isl_dim_type type
,
3983 unsigned first
, unsigned n
)
3986 isl_local_space
*ls
;
3991 if (!isl_space_is_set(space
))
3992 isl_die(isl_space_get_ctx(space
), isl_error_unsupported
,
3993 "expecting set space", goto error
);
3994 if (type
!= isl_dim_set
)
3995 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3996 "only set dimensions can be projected out", goto error
);
3998 dim
= isl_space_dim(space
, isl_dim_set
);
3999 if (first
+ n
> dim
)
4000 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
4001 "range out of bounds", goto error
);
4003 space
= isl_space_from_domain(space
);
4004 space
= isl_space_add_dims(space
, isl_dim_out
, dim
- n
);
4007 return isl_multi_aff_alloc(space
);
4009 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
4010 space
= isl_space_domain(space
);
4011 ls
= isl_local_space_from_space(space
);
4013 for (i
= 0; i
< first
; ++i
) {
4016 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4018 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4021 for (i
= 0; i
< dim
- (first
+ n
); ++i
) {
4024 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4025 isl_dim_set
, first
+ n
+ i
);
4026 ma
= isl_multi_aff_set_aff(ma
, first
+ i
, aff
);
4029 isl_local_space_free(ls
);
4032 isl_space_free(space
);
4036 /* Given the space of a set and a range of set dimensions,
4037 * construct an isl_pw_multi_aff that projects out those dimensions.
4039 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_project_out_map(
4040 __isl_take isl_space
*space
, enum isl_dim_type type
,
4041 unsigned first
, unsigned n
)
4045 ma
= isl_multi_aff_project_out_map(space
, type
, first
, n
);
4046 return isl_pw_multi_aff_from_multi_aff(ma
);
4049 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
4052 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_aff(
4053 __isl_take isl_multi_aff
*ma
)
4055 isl_set
*dom
= isl_set_universe(isl_multi_aff_get_domain_space(ma
));
4056 return isl_pw_multi_aff_alloc(dom
, ma
);
4059 /* Create a piecewise multi-affine expression in the given space that maps each
4060 * input dimension to the corresponding output dimension.
4062 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_identity(
4063 __isl_take isl_space
*space
)
4065 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space
));
4068 /* Exploit the equalities in "eq" to simplify the affine expressions.
4070 static __isl_give isl_multi_aff
*isl_multi_aff_substitute_equalities(
4071 __isl_take isl_multi_aff
*maff
, __isl_take isl_basic_set
*eq
)
4075 maff
= isl_multi_aff_cow(maff
);
4079 for (i
= 0; i
< maff
->n
; ++i
) {
4080 maff
->p
[i
] = isl_aff_substitute_equalities(maff
->p
[i
],
4081 isl_basic_set_copy(eq
));
4086 isl_basic_set_free(eq
);
4089 isl_basic_set_free(eq
);
4090 isl_multi_aff_free(maff
);
4094 __isl_give isl_multi_aff
*isl_multi_aff_scale(__isl_take isl_multi_aff
*maff
,
4099 maff
= isl_multi_aff_cow(maff
);
4103 for (i
= 0; i
< maff
->n
; ++i
) {
4104 maff
->p
[i
] = isl_aff_scale(maff
->p
[i
], f
);
4106 return isl_multi_aff_free(maff
);
4112 __isl_give isl_multi_aff
*isl_multi_aff_add_on_domain(__isl_keep isl_set
*dom
,
4113 __isl_take isl_multi_aff
*maff1
, __isl_take isl_multi_aff
*maff2
)
4115 maff1
= isl_multi_aff_add(maff1
, maff2
);
4116 maff1
= isl_multi_aff_gist(maff1
, isl_set_copy(dom
));
4120 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff
*maff
)
4128 /* Return the set of domain elements where "ma1" is lexicographically
4129 * smaller than or equal to "ma2".
4131 __isl_give isl_set
*isl_multi_aff_lex_le_set(__isl_take isl_multi_aff
*ma1
,
4132 __isl_take isl_multi_aff
*ma2
)
4134 return isl_multi_aff_lex_ge_set(ma2
, ma1
);
4137 /* Return the set of domain elements where "ma1" is lexicographically
4138 * smaller than "ma2".
4140 __isl_give isl_set
*isl_multi_aff_lex_lt_set(__isl_take isl_multi_aff
*ma1
,
4141 __isl_take isl_multi_aff
*ma2
)
4143 return isl_multi_aff_lex_gt_set(ma2
, ma1
);
4146 /* Return the set of domain elements where "ma1" and "ma2"
4149 static __isl_give isl_set
*isl_multi_aff_order_set(
4150 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
,
4151 __isl_give isl_map
*order(__isl_take isl_space
*set_space
))
4154 isl_map
*map1
, *map2
;
4157 map1
= isl_map_from_multi_aff(ma1
);
4158 map2
= isl_map_from_multi_aff(ma2
);
4159 map
= isl_map_range_product(map1
, map2
);
4160 space
= isl_space_range(isl_map_get_space(map
));
4161 space
= isl_space_domain(isl_space_unwrap(space
));
4163 map
= isl_map_intersect_range(map
, isl_map_wrap(ge
));
4165 return isl_map_domain(map
);
4168 /* Return the set of domain elements where "ma1" is lexicographically
4169 * greater than or equal to "ma2".
4171 __isl_give isl_set
*isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff
*ma1
,
4172 __isl_take isl_multi_aff
*ma2
)
4174 return isl_multi_aff_order_set(ma1
, ma2
, &isl_map_lex_ge
);
4177 /* Return the set of domain elements where "ma1" is lexicographically
4178 * greater than "ma2".
4180 __isl_give isl_set
*isl_multi_aff_lex_gt_set(__isl_take isl_multi_aff
*ma1
,
4181 __isl_take isl_multi_aff
*ma2
)
4183 return isl_multi_aff_order_set(ma1
, ma2
, &isl_map_lex_gt
);
4187 #define PW isl_pw_multi_aff
4189 #define EL isl_multi_aff
4191 #define EL_IS_ZERO is_empty
4195 #define IS_ZERO is_empty
4198 #undef DEFAULT_IS_ZERO
4199 #define DEFAULT_IS_ZERO 0
4204 #define NO_INVOLVES_DIMS
4205 #define NO_INSERT_DIMS
4209 #include <isl_pw_templ.c>
4210 #include <isl_pw_union_opt.c>
4215 #define UNION isl_union_pw_multi_aff
4217 #define PART isl_pw_multi_aff
4219 #define PARTS pw_multi_aff
4221 #include <isl_union_multi.c>
4222 #include <isl_union_neg.c>
4224 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmax(
4225 __isl_take isl_pw_multi_aff
*pma1
,
4226 __isl_take isl_pw_multi_aff
*pma2
)
4228 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4229 &isl_multi_aff_lex_ge_set
);
4232 /* Given two piecewise multi affine expressions, return a piecewise
4233 * multi-affine expression defined on the union of the definition domains
4234 * of the inputs that is equal to the lexicographic maximum of the two
4235 * inputs on each cell. If only one of the two inputs is defined on
4236 * a given cell, then it is considered to be the maximum.
4238 __isl_give isl_pw_multi_aff
*isl_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_align_params_pw_pw_and(pma1
, pma2
,
4243 &pw_multi_aff_union_lexmax
);
4246 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmin(
4247 __isl_take isl_pw_multi_aff
*pma1
,
4248 __isl_take isl_pw_multi_aff
*pma2
)
4250 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4251 &isl_multi_aff_lex_le_set
);
4254 /* Given two piecewise multi affine expressions, return a piecewise
4255 * multi-affine expression defined on the union of the definition domains
4256 * of the inputs that is equal to the lexicographic minimum of the two
4257 * inputs on each cell. If only one of the two inputs is defined on
4258 * a given cell, then it is considered to be the minimum.
4260 __isl_give isl_pw_multi_aff
*isl_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_align_params_pw_pw_and(pma1
, pma2
,
4265 &pw_multi_aff_union_lexmin
);
4268 static __isl_give isl_pw_multi_aff
*pw_multi_aff_add(
4269 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4271 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4272 &isl_multi_aff_add
);
4275 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_add(
4276 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4278 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4282 static __isl_give isl_pw_multi_aff
*pw_multi_aff_sub(
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_sub
);
4289 /* Subtract "pma2" from "pma1" and return the result.
4291 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_sub(
4292 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4294 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4298 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_add(
4299 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4301 return isl_pw_multi_aff_union_add_(pma1
, pma2
);
4304 /* Compute the sum of "upa1" and "upa2" on the union of their domains,
4305 * with the actual sum on the shared domain and
4306 * the defined expression on the symmetric difference of the domains.
4308 __isl_give isl_union_pw_aff
*isl_union_pw_aff_union_add(
4309 __isl_take isl_union_pw_aff
*upa1
, __isl_take isl_union_pw_aff
*upa2
)
4311 return isl_union_pw_aff_union_add_(upa1
, upa2
);
4314 /* Compute the sum of "upma1" and "upma2" on the union of their domains,
4315 * with the actual sum on the shared domain and
4316 * the defined expression on the symmetric difference of the domains.
4318 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_union_add(
4319 __isl_take isl_union_pw_multi_aff
*upma1
,
4320 __isl_take isl_union_pw_multi_aff
*upma2
)
4322 return isl_union_pw_multi_aff_union_add_(upma1
, upma2
);
4325 /* Given two piecewise multi-affine expressions A -> B and C -> D,
4326 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
4328 static __isl_give isl_pw_multi_aff
*pw_multi_aff_product(
4329 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4333 isl_pw_multi_aff
*res
;
4338 n
= pma1
->n
* pma2
->n
;
4339 space
= isl_space_product(isl_space_copy(pma1
->dim
),
4340 isl_space_copy(pma2
->dim
));
4341 res
= isl_pw_multi_aff_alloc_size(space
, n
);
4343 for (i
= 0; i
< pma1
->n
; ++i
) {
4344 for (j
= 0; j
< pma2
->n
; ++j
) {
4348 domain
= isl_set_product(isl_set_copy(pma1
->p
[i
].set
),
4349 isl_set_copy(pma2
->p
[j
].set
));
4350 ma
= isl_multi_aff_product(
4351 isl_multi_aff_copy(pma1
->p
[i
].maff
),
4352 isl_multi_aff_copy(pma2
->p
[j
].maff
));
4353 res
= isl_pw_multi_aff_add_piece(res
, domain
, ma
);
4357 isl_pw_multi_aff_free(pma1
);
4358 isl_pw_multi_aff_free(pma2
);
4361 isl_pw_multi_aff_free(pma1
);
4362 isl_pw_multi_aff_free(pma2
);
4366 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_product(
4367 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4369 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4370 &pw_multi_aff_product
);
4373 /* Construct a map mapping the domain of the piecewise multi-affine expression
4374 * to its range, with each dimension in the range equated to the
4375 * corresponding affine expression on its cell.
4377 * If the domain of "pma" is rational, then so is the constructed "map".
4379 __isl_give isl_map
*isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
4387 map
= isl_map_empty(isl_pw_multi_aff_get_space(pma
));
4389 for (i
= 0; i
< pma
->n
; ++i
) {
4391 isl_multi_aff
*maff
;
4392 isl_basic_map
*bmap
;
4395 rational
= isl_set_is_rational(pma
->p
[i
].set
);
4397 map
= isl_map_free(map
);
4398 maff
= isl_multi_aff_copy(pma
->p
[i
].maff
);
4399 bmap
= isl_basic_map_from_multi_aff2(maff
, rational
);
4400 map_i
= isl_map_from_basic_map(bmap
);
4401 map_i
= isl_map_intersect_domain(map_i
,
4402 isl_set_copy(pma
->p
[i
].set
));
4403 map
= isl_map_union_disjoint(map
, map_i
);
4406 isl_pw_multi_aff_free(pma
);
4410 __isl_give isl_set
*isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
4415 if (!isl_space_is_set(pma
->dim
))
4416 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
4417 "isl_pw_multi_aff cannot be converted into an isl_set",
4420 return isl_map_from_pw_multi_aff(pma
);
4422 isl_pw_multi_aff_free(pma
);
4426 /* Subtract the initial "n" elements in "ma" with coefficients in "c" and
4427 * denominator "denom".
4428 * "denom" is allowed to be negative, in which case the actual denominator
4429 * is -denom and the expressions are added instead.
4431 static __isl_give isl_aff
*subtract_initial(__isl_take isl_aff
*aff
,
4432 __isl_keep isl_multi_aff
*ma
, int n
, isl_int
*c
, isl_int denom
)
4438 first
= isl_seq_first_non_zero(c
, n
);
4442 sign
= isl_int_sgn(denom
);
4444 isl_int_abs(d
, denom
);
4445 for (i
= first
; i
< n
; ++i
) {
4448 if (isl_int_is_zero(c
[i
]))
4450 aff_i
= isl_multi_aff_get_aff(ma
, i
);
4451 aff_i
= isl_aff_scale(aff_i
, c
[i
]);
4452 aff_i
= isl_aff_scale_down(aff_i
, d
);
4454 aff
= isl_aff_sub(aff
, aff_i
);
4456 aff
= isl_aff_add(aff
, aff_i
);
4463 /* Extract an affine expression that expresses the output dimension "pos"
4464 * of "bmap" in terms of the parameters and input dimensions from
4466 * Note that this expression may involve integer divisions defined
4467 * in terms of parameters and input dimensions.
4468 * The equality may also involve references to earlier (but not later)
4469 * output dimensions. These are replaced by the corresponding elements
4472 * If the equality is of the form
4474 * f(i) + h(j) + a x + g(i) = 0,
4476 * with f(i) a linear combinations of the parameters and input dimensions,
4477 * g(i) a linear combination of integer divisions defined in terms of the same
4478 * and h(j) a linear combinations of earlier output dimensions,
4479 * then the affine expression is
4481 * (-f(i) - g(i))/a - h(j)/a
4483 * If the equality is of the form
4485 * f(i) + h(j) - a x + g(i) = 0,
4487 * then the affine expression is
4489 * (f(i) + g(i))/a - h(j)/(-a)
4492 * If "div" refers to an integer division (i.e., it is smaller than
4493 * the number of integer divisions), then the equality constraint
4494 * does involve an integer division (the one at position "div") that
4495 * is defined in terms of output dimensions. However, this integer
4496 * division can be eliminated by exploiting a pair of constraints
4497 * x >= l and x <= l + n, with n smaller than the coefficient of "div"
4498 * in the equality constraint. "ineq" refers to inequality x >= l, i.e.,
4500 * In particular, let
4502 * x = e(i) + m floor(...)
4504 * with e(i) the expression derived above and floor(...) the integer
4505 * division involving output dimensions.
4516 * e(i) + m floor(...) - l = (e(i) + m floor(...) - l) mod m
4517 * = (e(i) - l) mod m
4521 * x - l = (e(i) - l) mod m
4525 * x = ((e(i) - l) mod m) + l
4527 * The variable "shift" below contains the expression -l, which may
4528 * also involve a linear combination of earlier output dimensions.
4530 static __isl_give isl_aff
*extract_aff_from_equality(
4531 __isl_keep isl_basic_map
*bmap
, int pos
, int eq
, int div
, int ineq
,
4532 __isl_keep isl_multi_aff
*ma
)
4535 unsigned n_div
, n_out
;
4537 isl_local_space
*ls
;
4538 isl_aff
*aff
, *shift
;
4541 ctx
= isl_basic_map_get_ctx(bmap
);
4542 ls
= isl_basic_map_get_local_space(bmap
);
4543 ls
= isl_local_space_domain(ls
);
4544 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
4547 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
4548 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4549 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4550 if (isl_int_is_neg(bmap
->eq
[eq
][o_out
+ pos
])) {
4551 isl_seq_cpy(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4552 isl_seq_cpy(aff
->v
->el
+ 1 + o_out
,
4553 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4555 isl_seq_neg(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4556 isl_seq_neg(aff
->v
->el
+ 1 + o_out
,
4557 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4560 isl_int_set_si(aff
->v
->el
[1 + o_out
+ div
], 0);
4561 isl_int_abs(aff
->v
->el
[0], bmap
->eq
[eq
][o_out
+ pos
]);
4562 aff
= subtract_initial(aff
, ma
, pos
, bmap
->eq
[eq
] + o_out
,
4563 bmap
->eq
[eq
][o_out
+ pos
]);
4565 shift
= isl_aff_alloc(isl_local_space_copy(ls
));
4568 isl_seq_cpy(shift
->v
->el
+ 1, bmap
->ineq
[ineq
], o_out
);
4569 isl_seq_cpy(shift
->v
->el
+ 1 + o_out
,
4570 bmap
->ineq
[ineq
] + o_out
+ n_out
, n_div
);
4571 isl_int_set_si(shift
->v
->el
[0], 1);
4572 shift
= subtract_initial(shift
, ma
, pos
,
4573 bmap
->ineq
[ineq
] + o_out
, ctx
->negone
);
4574 aff
= isl_aff_add(aff
, isl_aff_copy(shift
));
4575 mod
= isl_val_int_from_isl_int(ctx
,
4576 bmap
->eq
[eq
][o_out
+ n_out
+ div
]);
4577 mod
= isl_val_abs(mod
);
4578 aff
= isl_aff_mod_val(aff
, mod
);
4579 aff
= isl_aff_sub(aff
, shift
);
4582 isl_local_space_free(ls
);
4585 isl_local_space_free(ls
);
4590 /* Given a basic map with output dimensions defined
4591 * in terms of the parameters input dimensions and earlier
4592 * output dimensions using an equality (and possibly a pair on inequalities),
4593 * extract an isl_aff that expresses output dimension "pos" in terms
4594 * of the parameters and input dimensions.
4595 * Note that this expression may involve integer divisions defined
4596 * in terms of parameters and input dimensions.
4597 * "ma" contains the expressions corresponding to earlier output dimensions.
4599 * This function shares some similarities with
4600 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
4602 static __isl_give isl_aff
*extract_isl_aff_from_basic_map(
4603 __isl_keep isl_basic_map
*bmap
, int pos
, __isl_keep isl_multi_aff
*ma
)
4610 eq
= isl_basic_map_output_defining_equality(bmap
, pos
, &div
, &ineq
);
4611 if (eq
>= bmap
->n_eq
)
4612 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4613 "unable to find suitable equality", return NULL
);
4614 aff
= extract_aff_from_equality(bmap
, pos
, eq
, div
, ineq
, ma
);
4616 aff
= isl_aff_remove_unused_divs(aff
);
4620 /* Given a basic map where each output dimension is defined
4621 * in terms of the parameters and input dimensions using an equality,
4622 * extract an isl_multi_aff that expresses the output dimensions in terms
4623 * of the parameters and input dimensions.
4625 static __isl_give isl_multi_aff
*extract_isl_multi_aff_from_basic_map(
4626 __isl_take isl_basic_map
*bmap
)
4635 ma
= isl_multi_aff_alloc(isl_basic_map_get_space(bmap
));
4636 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4638 for (i
= 0; i
< n_out
; ++i
) {
4641 aff
= extract_isl_aff_from_basic_map(bmap
, i
, ma
);
4642 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4645 isl_basic_map_free(bmap
);
4650 /* Given a basic set where each set dimension is defined
4651 * in terms of the parameters using an equality,
4652 * extract an isl_multi_aff that expresses the set dimensions in terms
4653 * of the parameters.
4655 __isl_give isl_multi_aff
*isl_multi_aff_from_basic_set_equalities(
4656 __isl_take isl_basic_set
*bset
)
4658 return extract_isl_multi_aff_from_basic_map(bset
);
4661 /* Create an isl_pw_multi_aff that is equivalent to
4662 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
4663 * The given basic map is such that each output dimension is defined
4664 * in terms of the parameters and input dimensions using an equality.
4666 * Since some applications expect the result of isl_pw_multi_aff_from_map
4667 * to only contain integer affine expressions, we compute the floor
4668 * of the expression before returning.
4670 * Remove all constraints involving local variables without
4671 * an explicit representation (resulting in the removal of those
4672 * local variables) prior to the actual extraction to ensure
4673 * that the local spaces in which the resulting affine expressions
4674 * are created do not contain any unknown local variables.
4675 * Removing such constraints is safe because constraints involving
4676 * unknown local variables are not used to determine whether
4677 * a basic map is obviously single-valued.
4679 static __isl_give isl_pw_multi_aff
*plain_pw_multi_aff_from_map(
4680 __isl_take isl_set
*domain
, __isl_take isl_basic_map
*bmap
)
4684 bmap
= isl_basic_map_drop_constraint_involving_unknown_divs(bmap
);
4685 ma
= extract_isl_multi_aff_from_basic_map(bmap
);
4686 ma
= isl_multi_aff_floor(ma
);
4687 return isl_pw_multi_aff_alloc(domain
, ma
);
4690 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4691 * This obviously only works if the input "map" is single-valued.
4692 * If so, we compute the lexicographic minimum of the image in the form
4693 * of an isl_pw_multi_aff. Since the image is unique, it is equal
4694 * to its lexicographic minimum.
4695 * If the input is not single-valued, we produce an error.
4697 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_base(
4698 __isl_take isl_map
*map
)
4702 isl_pw_multi_aff
*pma
;
4704 sv
= isl_map_is_single_valued(map
);
4708 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
4709 "map is not single-valued", goto error
);
4710 map
= isl_map_make_disjoint(map
);
4714 pma
= isl_pw_multi_aff_empty(isl_map_get_space(map
));
4716 for (i
= 0; i
< map
->n
; ++i
) {
4717 isl_pw_multi_aff
*pma_i
;
4718 isl_basic_map
*bmap
;
4719 bmap
= isl_basic_map_copy(map
->p
[i
]);
4720 pma_i
= isl_basic_map_lexmin_pw_multi_aff(bmap
);
4721 pma
= isl_pw_multi_aff_add_disjoint(pma
, pma_i
);
4731 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4732 * taking into account that the output dimension at position "d"
4733 * can be represented as
4735 * x = floor((e(...) + c1) / m)
4737 * given that constraint "i" is of the form
4739 * e(...) + c1 - m x >= 0
4742 * Let "map" be of the form
4746 * We construct a mapping
4748 * A -> [A -> x = floor(...)]
4750 * apply that to the map, obtaining
4752 * [A -> x = floor(...)] -> B
4754 * and equate dimension "d" to x.
4755 * We then compute a isl_pw_multi_aff representation of the resulting map
4756 * and plug in the mapping above.
4758 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_div(
4759 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
)
4763 isl_local_space
*ls
;
4771 isl_pw_multi_aff
*pma
;
4774 is_set
= isl_map_is_set(map
);
4778 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4779 ctx
= isl_map_get_ctx(map
);
4780 space
= isl_space_domain(isl_map_get_space(map
));
4781 n_in
= isl_space_dim(space
, isl_dim_set
);
4782 n
= isl_space_dim(space
, isl_dim_all
);
4784 v
= isl_vec_alloc(ctx
, 1 + 1 + n
);
4786 isl_int_neg(v
->el
[0], hull
->ineq
[i
][offset
+ d
]);
4787 isl_seq_cpy(v
->el
+ 1, hull
->ineq
[i
], 1 + n
);
4789 isl_basic_map_free(hull
);
4791 ls
= isl_local_space_from_space(isl_space_copy(space
));
4792 aff
= isl_aff_alloc_vec(ls
, v
);
4793 aff
= isl_aff_floor(aff
);
4795 isl_space_free(space
);
4796 ma
= isl_multi_aff_from_aff(aff
);
4798 ma
= isl_multi_aff_identity(isl_space_map_from_set(space
));
4799 ma
= isl_multi_aff_range_product(ma
,
4800 isl_multi_aff_from_aff(aff
));
4803 insert
= isl_map_from_multi_aff(isl_multi_aff_copy(ma
));
4804 map
= isl_map_apply_domain(map
, insert
);
4805 map
= isl_map_equate(map
, isl_dim_in
, n_in
, isl_dim_out
, d
);
4806 pma
= isl_pw_multi_aff_from_map(map
);
4807 pma
= isl_pw_multi_aff_pullback_multi_aff(pma
, ma
);
4812 isl_basic_map_free(hull
);
4816 /* Is constraint "c" of the form
4818 * e(...) + c1 - m x >= 0
4822 * -e(...) + c2 + m x >= 0
4824 * where m > 1 and e only depends on parameters and input dimemnsions?
4826 * "offset" is the offset of the output dimensions
4827 * "pos" is the position of output dimension x.
4829 static int is_potential_div_constraint(isl_int
*c
, int offset
, int d
, int total
)
4831 if (isl_int_is_zero(c
[offset
+ d
]))
4833 if (isl_int_is_one(c
[offset
+ d
]))
4835 if (isl_int_is_negone(c
[offset
+ d
]))
4837 if (isl_seq_first_non_zero(c
+ offset
, d
) != -1)
4839 if (isl_seq_first_non_zero(c
+ offset
+ d
+ 1,
4840 total
- (offset
+ d
+ 1)) != -1)
4845 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4847 * As a special case, we first check if there is any pair of constraints,
4848 * shared by all the basic maps in "map" that force a given dimension
4849 * to be equal to the floor of some affine combination of the input dimensions.
4851 * In particular, if we can find two constraints
4853 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
4857 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
4859 * where m > 1 and e only depends on parameters and input dimemnsions,
4862 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
4864 * then we know that we can take
4866 * x = floor((e(...) + c1) / m)
4868 * without having to perform any computation.
4870 * Note that we know that
4874 * If c1 + c2 were 0, then we would have detected an equality during
4875 * simplification. If c1 + c2 were negative, then we would have detected
4878 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_div(
4879 __isl_take isl_map
*map
)
4885 isl_basic_map
*hull
;
4887 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
4892 dim
= isl_map_dim(map
, isl_dim_out
);
4893 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4894 total
= 1 + isl_basic_map_total_dim(hull
);
4896 for (d
= 0; d
< dim
; ++d
) {
4897 for (i
= 0; i
< n
; ++i
) {
4898 if (!is_potential_div_constraint(hull
->ineq
[i
],
4901 for (j
= i
+ 1; j
< n
; ++j
) {
4902 if (!isl_seq_is_neg(hull
->ineq
[i
] + 1,
4903 hull
->ineq
[j
] + 1, total
- 1))
4905 isl_int_add(sum
, hull
->ineq
[i
][0],
4907 if (isl_int_abs_lt(sum
,
4908 hull
->ineq
[i
][offset
+ d
]))
4915 if (isl_int_is_pos(hull
->ineq
[j
][offset
+ d
]))
4917 return pw_multi_aff_from_map_div(map
, hull
, d
, j
);
4921 isl_basic_map_free(hull
);
4922 return pw_multi_aff_from_map_base(map
);
4925 isl_basic_map_free(hull
);
4929 /* Given an affine expression
4931 * [A -> B] -> f(A,B)
4933 * construct an isl_multi_aff
4937 * such that dimension "d" in B' is set to "aff" and the remaining
4938 * dimensions are set equal to the corresponding dimensions in B.
4939 * "n_in" is the dimension of the space A.
4940 * "n_out" is the dimension of the space B.
4942 * If "is_set" is set, then the affine expression is of the form
4946 * and we construct an isl_multi_aff
4950 static __isl_give isl_multi_aff
*range_map(__isl_take isl_aff
*aff
, int d
,
4951 unsigned n_in
, unsigned n_out
, int is_set
)
4955 isl_space
*space
, *space2
;
4956 isl_local_space
*ls
;
4958 space
= isl_aff_get_domain_space(aff
);
4959 ls
= isl_local_space_from_space(isl_space_copy(space
));
4960 space2
= isl_space_copy(space
);
4962 space2
= isl_space_range(isl_space_unwrap(space2
));
4963 space
= isl_space_map_from_domain_and_range(space
, space2
);
4964 ma
= isl_multi_aff_alloc(space
);
4965 ma
= isl_multi_aff_set_aff(ma
, d
, aff
);
4967 for (i
= 0; i
< n_out
; ++i
) {
4970 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4971 isl_dim_set
, n_in
+ i
);
4972 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4975 isl_local_space_free(ls
);
4980 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4981 * taking into account that the dimension at position "d" can be written as
4983 * x = m a + f(..) (1)
4985 * where m is equal to "gcd".
4986 * "i" is the index of the equality in "hull" that defines f(..).
4987 * In particular, the equality is of the form
4989 * f(..) - x + m g(existentials) = 0
4993 * -f(..) + x + m g(existentials) = 0
4995 * We basically plug (1) into "map", resulting in a map with "a"
4996 * in the range instead of "x". The corresponding isl_pw_multi_aff
4997 * defining "a" is then plugged back into (1) to obtain a definition for "x".
4999 * Specifically, given the input map
5003 * We first wrap it into a set
5007 * and define (1) on top of the corresponding space, resulting in "aff".
5008 * We use this to create an isl_multi_aff that maps the output position "d"
5009 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
5010 * We plug this into the wrapped map, unwrap the result and compute the
5011 * corresponding isl_pw_multi_aff.
5012 * The result is an expression
5020 * so that we can plug that into "aff", after extending the latter to
5026 * If "map" is actually a set, then there is no "A" space, meaning
5027 * that we do not need to perform any wrapping, and that the result
5028 * of the recursive call is of the form
5032 * which is plugged into a mapping of the form
5036 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_stride(
5037 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
,
5042 isl_local_space
*ls
;
5045 isl_pw_multi_aff
*pma
, *id
;
5051 is_set
= isl_map_is_set(map
);
5055 n_in
= isl_basic_map_dim(hull
, isl_dim_in
);
5056 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5057 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5062 set
= isl_map_wrap(map
);
5063 space
= isl_space_map_from_set(isl_set_get_space(set
));
5064 ma
= isl_multi_aff_identity(space
);
5065 ls
= isl_local_space_from_space(isl_set_get_space(set
));
5066 aff
= isl_aff_alloc(ls
);
5068 isl_int_set_si(aff
->v
->el
[0], 1);
5069 if (isl_int_is_one(hull
->eq
[i
][o_out
+ d
]))
5070 isl_seq_neg(aff
->v
->el
+ 1, hull
->eq
[i
],
5073 isl_seq_cpy(aff
->v
->el
+ 1, hull
->eq
[i
],
5075 isl_int_set(aff
->v
->el
[1 + o_out
+ d
], gcd
);
5077 ma
= isl_multi_aff_set_aff(ma
, n_in
+ d
, isl_aff_copy(aff
));
5078 set
= isl_set_preimage_multi_aff(set
, ma
);
5080 ma
= range_map(aff
, d
, n_in
, n_out
, is_set
);
5085 map
= isl_set_unwrap(set
);
5086 pma
= isl_pw_multi_aff_from_map(map
);
5089 space
= isl_pw_multi_aff_get_domain_space(pma
);
5090 space
= isl_space_map_from_set(space
);
5091 id
= isl_pw_multi_aff_identity(space
);
5092 pma
= isl_pw_multi_aff_range_product(id
, pma
);
5094 id
= isl_pw_multi_aff_from_multi_aff(ma
);
5095 pma
= isl_pw_multi_aff_pullback_pw_multi_aff(id
, pma
);
5097 isl_basic_map_free(hull
);
5101 isl_basic_map_free(hull
);
5105 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
5106 * "hull" contains the equalities valid for "map".
5108 * Check if any of the output dimensions is "strided".
5109 * That is, we check if it can be written as
5113 * with m greater than 1, a some combination of existentially quantified
5114 * variables and f an expression in the parameters and input dimensions.
5115 * If so, we remove the stride in pw_multi_aff_from_map_stride.
5117 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
5120 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_strides(
5121 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
)
5130 n_div
= isl_basic_map_dim(hull
, isl_dim_div
);
5131 o_div
= isl_basic_map_offset(hull
, isl_dim_div
);
5134 isl_basic_map_free(hull
);
5135 return pw_multi_aff_from_map_check_div(map
);
5140 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5141 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5143 for (i
= 0; i
< n_out
; ++i
) {
5144 for (j
= 0; j
< hull
->n_eq
; ++j
) {
5145 isl_int
*eq
= hull
->eq
[j
];
5146 isl_pw_multi_aff
*res
;
5148 if (!isl_int_is_one(eq
[o_out
+ i
]) &&
5149 !isl_int_is_negone(eq
[o_out
+ i
]))
5151 if (isl_seq_first_non_zero(eq
+ o_out
, i
) != -1)
5153 if (isl_seq_first_non_zero(eq
+ o_out
+ i
+ 1,
5154 n_out
- (i
+ 1)) != -1)
5156 isl_seq_gcd(eq
+ o_div
, n_div
, &gcd
);
5157 if (isl_int_is_zero(gcd
))
5159 if (isl_int_is_one(gcd
))
5162 res
= pw_multi_aff_from_map_stride(map
, hull
,
5170 isl_basic_map_free(hull
);
5171 return pw_multi_aff_from_map_check_div(map
);
5174 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
5176 * As a special case, we first check if all output dimensions are uniquely
5177 * defined in terms of the parameters and input dimensions over the entire
5178 * domain. If so, we extract the desired isl_pw_multi_aff directly
5179 * from the affine hull of "map" and its domain.
5181 * Otherwise, continue with pw_multi_aff_from_map_check_strides for more
5184 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_map(__isl_take isl_map
*map
)
5187 isl_basic_map
*hull
;
5192 if (isl_map_n_basic_map(map
) == 1) {
5193 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5194 hull
= isl_basic_map_plain_affine_hull(hull
);
5195 sv
= isl_basic_map_plain_is_single_valued(hull
);
5197 return plain_pw_multi_aff_from_map(isl_map_domain(map
),
5199 isl_basic_map_free(hull
);
5201 map
= isl_map_detect_equalities(map
);
5202 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5203 sv
= isl_basic_map_plain_is_single_valued(hull
);
5205 return plain_pw_multi_aff_from_map(isl_map_domain(map
), hull
);
5207 return pw_multi_aff_from_map_check_strides(map
, hull
);
5208 isl_basic_map_free(hull
);
5213 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_set(__isl_take isl_set
*set
)
5215 return isl_pw_multi_aff_from_map(set
);
5218 /* Convert "map" into an isl_pw_multi_aff (if possible) and
5221 static isl_stat
pw_multi_aff_from_map(__isl_take isl_map
*map
, void *user
)
5223 isl_union_pw_multi_aff
**upma
= user
;
5224 isl_pw_multi_aff
*pma
;
5226 pma
= isl_pw_multi_aff_from_map(map
);
5227 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5229 return *upma
? isl_stat_ok
: isl_stat_error
;
5232 /* Create an isl_union_pw_multi_aff with the given isl_aff on a universe
5235 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_aff(
5236 __isl_take isl_aff
*aff
)
5239 isl_pw_multi_aff
*pma
;
5241 ma
= isl_multi_aff_from_aff(aff
);
5242 pma
= isl_pw_multi_aff_from_multi_aff(ma
);
5243 return isl_union_pw_multi_aff_from_pw_multi_aff(pma
);
5246 /* Try and create an isl_union_pw_multi_aff that is equivalent
5247 * to the given isl_union_map.
5248 * The isl_union_map is required to be single-valued in each space.
5249 * Otherwise, an error is produced.
5251 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_map(
5252 __isl_take isl_union_map
*umap
)
5255 isl_union_pw_multi_aff
*upma
;
5257 space
= isl_union_map_get_space(umap
);
5258 upma
= isl_union_pw_multi_aff_empty(space
);
5259 if (isl_union_map_foreach_map(umap
, &pw_multi_aff_from_map
, &upma
) < 0)
5260 upma
= isl_union_pw_multi_aff_free(upma
);
5261 isl_union_map_free(umap
);
5266 /* Try and create an isl_union_pw_multi_aff that is equivalent
5267 * to the given isl_union_set.
5268 * The isl_union_set is required to be a singleton in each space.
5269 * Otherwise, an error is produced.
5271 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_set(
5272 __isl_take isl_union_set
*uset
)
5274 return isl_union_pw_multi_aff_from_union_map(uset
);
5277 /* Return the piecewise affine expression "set ? 1 : 0".
5279 __isl_give isl_pw_aff
*isl_set_indicator_function(__isl_take isl_set
*set
)
5282 isl_space
*space
= isl_set_get_space(set
);
5283 isl_local_space
*ls
= isl_local_space_from_space(space
);
5284 isl_aff
*zero
= isl_aff_zero_on_domain(isl_local_space_copy(ls
));
5285 isl_aff
*one
= isl_aff_zero_on_domain(ls
);
5287 one
= isl_aff_add_constant_si(one
, 1);
5288 pa
= isl_pw_aff_alloc(isl_set_copy(set
), one
);
5289 set
= isl_set_complement(set
);
5290 pa
= isl_pw_aff_add_disjoint(pa
, isl_pw_aff_alloc(set
, zero
));
5295 /* Plug in "subs" for dimension "type", "pos" of "aff".
5297 * Let i be the dimension to replace and let "subs" be of the form
5301 * and "aff" of the form
5307 * (a f + d g')/(m d)
5309 * where g' is the result of plugging in "subs" in each of the integer
5312 __isl_give isl_aff
*isl_aff_substitute(__isl_take isl_aff
*aff
,
5313 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
5318 aff
= isl_aff_cow(aff
);
5320 return isl_aff_free(aff
);
5322 ctx
= isl_aff_get_ctx(aff
);
5323 if (!isl_space_is_equal(aff
->ls
->dim
, subs
->ls
->dim
))
5324 isl_die(ctx
, isl_error_invalid
,
5325 "spaces don't match", return isl_aff_free(aff
));
5326 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
5327 isl_die(ctx
, isl_error_unsupported
,
5328 "cannot handle divs yet", return isl_aff_free(aff
));
5330 aff
->ls
= isl_local_space_substitute(aff
->ls
, type
, pos
, subs
);
5332 return isl_aff_free(aff
);
5334 aff
->v
= isl_vec_cow(aff
->v
);
5336 return isl_aff_free(aff
);
5338 pos
+= isl_local_space_offset(aff
->ls
, type
);
5341 isl_seq_substitute(aff
->v
->el
, pos
, subs
->v
->el
,
5342 aff
->v
->size
, subs
->v
->size
, v
);
5348 /* Plug in "subs" for dimension "type", "pos" in each of the affine
5349 * expressions in "maff".
5351 __isl_give isl_multi_aff
*isl_multi_aff_substitute(
5352 __isl_take isl_multi_aff
*maff
, enum isl_dim_type type
, unsigned pos
,
5353 __isl_keep isl_aff
*subs
)
5357 maff
= isl_multi_aff_cow(maff
);
5359 return isl_multi_aff_free(maff
);
5361 if (type
== isl_dim_in
)
5364 for (i
= 0; i
< maff
->n
; ++i
) {
5365 maff
->p
[i
] = isl_aff_substitute(maff
->p
[i
], type
, pos
, subs
);
5367 return isl_multi_aff_free(maff
);
5373 /* Plug in "subs" for dimension "type", "pos" of "pma".
5375 * pma is of the form
5379 * while subs is of the form
5381 * v' = B_j(v) -> S_j
5383 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
5384 * has a contribution in the result, in particular
5386 * C_ij(S_j) -> M_i(S_j)
5388 * Note that plugging in S_j in C_ij may also result in an empty set
5389 * and this contribution should simply be discarded.
5391 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_substitute(
5392 __isl_take isl_pw_multi_aff
*pma
, enum isl_dim_type type
, unsigned pos
,
5393 __isl_keep isl_pw_aff
*subs
)
5396 isl_pw_multi_aff
*res
;
5399 return isl_pw_multi_aff_free(pma
);
5401 n
= pma
->n
* subs
->n
;
5402 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma
->dim
), n
);
5404 for (i
= 0; i
< pma
->n
; ++i
) {
5405 for (j
= 0; j
< subs
->n
; ++j
) {
5407 isl_multi_aff
*res_ij
;
5410 common
= isl_set_intersect(
5411 isl_set_copy(pma
->p
[i
].set
),
5412 isl_set_copy(subs
->p
[j
].set
));
5413 common
= isl_set_substitute(common
,
5414 type
, pos
, subs
->p
[j
].aff
);
5415 empty
= isl_set_plain_is_empty(common
);
5416 if (empty
< 0 || empty
) {
5417 isl_set_free(common
);
5423 res_ij
= isl_multi_aff_substitute(
5424 isl_multi_aff_copy(pma
->p
[i
].maff
),
5425 type
, pos
, subs
->p
[j
].aff
);
5427 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5431 isl_pw_multi_aff_free(pma
);
5434 isl_pw_multi_aff_free(pma
);
5435 isl_pw_multi_aff_free(res
);
5439 /* Compute the preimage of a range of dimensions in the affine expression "src"
5440 * under "ma" and put the result in "dst". The number of dimensions in "src"
5441 * that precede the range is given by "n_before". The number of dimensions
5442 * in the range is given by the number of output dimensions of "ma".
5443 * The number of dimensions that follow the range is given by "n_after".
5444 * If "has_denom" is set (to one),
5445 * then "src" and "dst" have an extra initial denominator.
5446 * "n_div_ma" is the number of existentials in "ma"
5447 * "n_div_bset" is the number of existentials in "src"
5448 * The resulting "dst" (which is assumed to have been allocated by
5449 * the caller) contains coefficients for both sets of existentials,
5450 * first those in "ma" and then those in "src".
5451 * f, c1, c2 and g are temporary objects that have been initialized
5454 * Let src represent the expression
5456 * (a(p) + f_u u + b v + f_w w + c(divs))/d
5458 * and let ma represent the expressions
5460 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
5462 * We start out with the following expression for dst:
5464 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
5466 * with the multiplication factor f initially equal to 1
5467 * and f \sum_i b_i v_i kept separately.
5468 * For each x_i that we substitute, we multiply the numerator
5469 * (and denominator) of dst by c_1 = m_i and add the numerator
5470 * of the x_i expression multiplied by c_2 = f b_i,
5471 * after removing the common factors of c_1 and c_2.
5472 * The multiplication factor f also needs to be multiplied by c_1
5473 * for the next x_j, j > i.
5475 void isl_seq_preimage(isl_int
*dst
, isl_int
*src
,
5476 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
,
5477 int n_div_ma
, int n_div_bmap
,
5478 isl_int f
, isl_int c1
, isl_int c2
, isl_int g
, int has_denom
)
5481 int n_param
, n_in
, n_out
;
5484 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
5485 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
5486 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
5488 isl_seq_cpy(dst
, src
, has_denom
+ 1 + n_param
+ n_before
);
5489 o_dst
= o_src
= has_denom
+ 1 + n_param
+ n_before
;
5490 isl_seq_clr(dst
+ o_dst
, n_in
);
5493 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_after
);
5496 isl_seq_clr(dst
+ o_dst
, n_div_ma
);
5498 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_div_bmap
);
5500 isl_int_set_si(f
, 1);
5502 for (i
= 0; i
< n_out
; ++i
) {
5503 int offset
= has_denom
+ 1 + n_param
+ n_before
+ i
;
5505 if (isl_int_is_zero(src
[offset
]))
5507 isl_int_set(c1
, ma
->p
[i
]->v
->el
[0]);
5508 isl_int_mul(c2
, f
, src
[offset
]);
5509 isl_int_gcd(g
, c1
, c2
);
5510 isl_int_divexact(c1
, c1
, g
);
5511 isl_int_divexact(c2
, c2
, g
);
5513 isl_int_mul(f
, f
, c1
);
5516 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5517 c2
, ma
->p
[i
]->v
->el
+ o_src
, 1 + n_param
);
5518 o_dst
+= 1 + n_param
;
5519 o_src
+= 1 + n_param
;
5520 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_before
);
5522 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5523 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_in
);
5526 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_after
);
5528 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5529 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_div_ma
);
5532 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_div_bmap
);
5534 isl_int_mul(dst
[0], dst
[0], c1
);
5538 /* Compute the pullback of "aff" by the function represented by "ma".
5539 * In other words, plug in "ma" in "aff". The result is an affine expression
5540 * defined over the domain space of "ma".
5542 * If "aff" is represented by
5544 * (a(p) + b x + c(divs))/d
5546 * and ma is represented by
5548 * x = D(p) + F(y) + G(divs')
5550 * then the result is
5552 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
5554 * The divs in the local space of the input are similarly adjusted
5555 * through a call to isl_local_space_preimage_multi_aff.
5557 __isl_give isl_aff
*isl_aff_pullback_multi_aff(__isl_take isl_aff
*aff
,
5558 __isl_take isl_multi_aff
*ma
)
5560 isl_aff
*res
= NULL
;
5561 isl_local_space
*ls
;
5562 int n_div_aff
, n_div_ma
;
5563 isl_int f
, c1
, c2
, g
;
5565 ma
= isl_multi_aff_align_divs(ma
);
5569 n_div_aff
= isl_aff_dim(aff
, isl_dim_div
);
5570 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
5572 ls
= isl_aff_get_domain_local_space(aff
);
5573 ls
= isl_local_space_preimage_multi_aff(ls
, isl_multi_aff_copy(ma
));
5574 res
= isl_aff_alloc(ls
);
5583 isl_seq_preimage(res
->v
->el
, aff
->v
->el
, ma
, 0, 0, n_div_ma
, n_div_aff
,
5592 isl_multi_aff_free(ma
);
5593 res
= isl_aff_normalize(res
);
5597 isl_multi_aff_free(ma
);
5602 /* Compute the pullback of "aff1" by the function represented by "aff2".
5603 * In other words, plug in "aff2" in "aff1". The result is an affine expression
5604 * defined over the domain space of "aff1".
5606 * The domain of "aff1" should match the range of "aff2", which means
5607 * that it should be single-dimensional.
5609 __isl_give isl_aff
*isl_aff_pullback_aff(__isl_take isl_aff
*aff1
,
5610 __isl_take isl_aff
*aff2
)
5614 ma
= isl_multi_aff_from_aff(aff2
);
5615 return isl_aff_pullback_multi_aff(aff1
, ma
);
5618 /* Compute the pullback of "ma1" by the function represented by "ma2".
5619 * In other words, plug in "ma2" in "ma1".
5621 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
5623 static __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff_aligned(
5624 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5627 isl_space
*space
= NULL
;
5629 ma2
= isl_multi_aff_align_divs(ma2
);
5630 ma1
= isl_multi_aff_cow(ma1
);
5634 space
= isl_space_join(isl_multi_aff_get_space(ma2
),
5635 isl_multi_aff_get_space(ma1
));
5637 for (i
= 0; i
< ma1
->n
; ++i
) {
5638 ma1
->p
[i
] = isl_aff_pullback_multi_aff(ma1
->p
[i
],
5639 isl_multi_aff_copy(ma2
));
5644 ma1
= isl_multi_aff_reset_space(ma1
, space
);
5645 isl_multi_aff_free(ma2
);
5648 isl_space_free(space
);
5649 isl_multi_aff_free(ma2
);
5650 isl_multi_aff_free(ma1
);
5654 /* Compute the pullback of "ma1" by the function represented by "ma2".
5655 * In other words, plug in "ma2" in "ma1".
5657 __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff(
5658 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5660 return isl_multi_aff_align_params_multi_multi_and(ma1
, ma2
,
5661 &isl_multi_aff_pullback_multi_aff_aligned
);
5664 /* Extend the local space of "dst" to include the divs
5665 * in the local space of "src".
5667 * If "src" does not have any divs or if the local spaces of "dst" and
5668 * "src" are the same, then no extension is required.
5670 __isl_give isl_aff
*isl_aff_align_divs(__isl_take isl_aff
*dst
,
5671 __isl_keep isl_aff
*src
)
5674 int src_n_div
, dst_n_div
;
5681 return isl_aff_free(dst
);
5683 ctx
= isl_aff_get_ctx(src
);
5684 equal
= isl_local_space_has_equal_space(src
->ls
, dst
->ls
);
5686 return isl_aff_free(dst
);
5688 isl_die(ctx
, isl_error_invalid
,
5689 "spaces don't match", goto error
);
5691 src_n_div
= isl_local_space_dim(src
->ls
, isl_dim_div
);
5694 equal
= isl_local_space_is_equal(src
->ls
, dst
->ls
);
5696 return isl_aff_free(dst
);
5700 dst_n_div
= isl_local_space_dim(dst
->ls
, isl_dim_div
);
5701 exp1
= isl_alloc_array(ctx
, int, src_n_div
);
5702 exp2
= isl_alloc_array(ctx
, int, dst_n_div
);
5703 if (!exp1
|| (dst_n_div
&& !exp2
))
5706 div
= isl_merge_divs(src
->ls
->div
, dst
->ls
->div
, exp1
, exp2
);
5707 dst
= isl_aff_expand_divs(dst
, div
, exp2
);
5715 return isl_aff_free(dst
);
5718 /* Adjust the local spaces of the affine expressions in "maff"
5719 * such that they all have the save divs.
5721 __isl_give isl_multi_aff
*isl_multi_aff_align_divs(
5722 __isl_take isl_multi_aff
*maff
)
5730 maff
= isl_multi_aff_cow(maff
);
5734 for (i
= 1; i
< maff
->n
; ++i
)
5735 maff
->p
[0] = isl_aff_align_divs(maff
->p
[0], maff
->p
[i
]);
5736 for (i
= 1; i
< maff
->n
; ++i
) {
5737 maff
->p
[i
] = isl_aff_align_divs(maff
->p
[i
], maff
->p
[0]);
5739 return isl_multi_aff_free(maff
);
5745 __isl_give isl_aff
*isl_aff_lift(__isl_take isl_aff
*aff
)
5747 aff
= isl_aff_cow(aff
);
5751 aff
->ls
= isl_local_space_lift(aff
->ls
);
5753 return isl_aff_free(aff
);
5758 /* Lift "maff" to a space with extra dimensions such that the result
5759 * has no more existentially quantified variables.
5760 * If "ls" is not NULL, then *ls is assigned the local space that lies
5761 * at the basis of the lifting applied to "maff".
5763 __isl_give isl_multi_aff
*isl_multi_aff_lift(__isl_take isl_multi_aff
*maff
,
5764 __isl_give isl_local_space
**ls
)
5778 isl_space
*space
= isl_multi_aff_get_domain_space(maff
);
5779 *ls
= isl_local_space_from_space(space
);
5781 return isl_multi_aff_free(maff
);
5786 maff
= isl_multi_aff_cow(maff
);
5787 maff
= isl_multi_aff_align_divs(maff
);
5791 n_div
= isl_aff_dim(maff
->p
[0], isl_dim_div
);
5792 space
= isl_multi_aff_get_space(maff
);
5793 space
= isl_space_lift(isl_space_domain(space
), n_div
);
5794 space
= isl_space_extend_domain_with_range(space
,
5795 isl_multi_aff_get_space(maff
));
5797 return isl_multi_aff_free(maff
);
5798 isl_space_free(maff
->space
);
5799 maff
->space
= space
;
5802 *ls
= isl_aff_get_domain_local_space(maff
->p
[0]);
5804 return isl_multi_aff_free(maff
);
5807 for (i
= 0; i
< maff
->n
; ++i
) {
5808 maff
->p
[i
] = isl_aff_lift(maff
->p
[i
]);
5816 isl_local_space_free(*ls
);
5817 return isl_multi_aff_free(maff
);
5821 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
5823 __isl_give isl_pw_aff
*isl_pw_multi_aff_get_pw_aff(
5824 __isl_keep isl_pw_multi_aff
*pma
, int pos
)
5834 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
5835 if (pos
< 0 || pos
>= n_out
)
5836 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5837 "index out of bounds", return NULL
);
5839 space
= isl_pw_multi_aff_get_space(pma
);
5840 space
= isl_space_drop_dims(space
, isl_dim_out
,
5841 pos
+ 1, n_out
- pos
- 1);
5842 space
= isl_space_drop_dims(space
, isl_dim_out
, 0, pos
);
5844 pa
= isl_pw_aff_alloc_size(space
, pma
->n
);
5845 for (i
= 0; i
< pma
->n
; ++i
) {
5847 aff
= isl_multi_aff_get_aff(pma
->p
[i
].maff
, pos
);
5848 pa
= isl_pw_aff_add_piece(pa
, isl_set_copy(pma
->p
[i
].set
), aff
);
5854 /* Return an isl_pw_multi_aff with the given "set" as domain and
5855 * an unnamed zero-dimensional range.
5857 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_domain(
5858 __isl_take isl_set
*set
)
5863 space
= isl_set_get_space(set
);
5864 space
= isl_space_from_domain(space
);
5865 ma
= isl_multi_aff_zero(space
);
5866 return isl_pw_multi_aff_alloc(set
, ma
);
5869 /* Add an isl_pw_multi_aff with the given "set" as domain and
5870 * an unnamed zero-dimensional range to *user.
5872 static isl_stat
add_pw_multi_aff_from_domain(__isl_take isl_set
*set
,
5875 isl_union_pw_multi_aff
**upma
= user
;
5876 isl_pw_multi_aff
*pma
;
5878 pma
= isl_pw_multi_aff_from_domain(set
);
5879 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5884 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
5885 * an unnamed zero-dimensional range.
5887 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_domain(
5888 __isl_take isl_union_set
*uset
)
5891 isl_union_pw_multi_aff
*upma
;
5896 space
= isl_union_set_get_space(uset
);
5897 upma
= isl_union_pw_multi_aff_empty(space
);
5899 if (isl_union_set_foreach_set(uset
,
5900 &add_pw_multi_aff_from_domain
, &upma
) < 0)
5903 isl_union_set_free(uset
);
5906 isl_union_set_free(uset
);
5907 isl_union_pw_multi_aff_free(upma
);
5911 /* Convert "pma" to an isl_map and add it to *umap.
5913 static isl_stat
map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
,
5916 isl_union_map
**umap
= user
;
5919 map
= isl_map_from_pw_multi_aff(pma
);
5920 *umap
= isl_union_map_add_map(*umap
, map
);
5925 /* Construct a union map mapping the domain of the union
5926 * piecewise multi-affine expression to its range, with each dimension
5927 * in the range equated to the corresponding affine expression on its cell.
5929 __isl_give isl_union_map
*isl_union_map_from_union_pw_multi_aff(
5930 __isl_take isl_union_pw_multi_aff
*upma
)
5933 isl_union_map
*umap
;
5938 space
= isl_union_pw_multi_aff_get_space(upma
);
5939 umap
= isl_union_map_empty(space
);
5941 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
5942 &map_from_pw_multi_aff
, &umap
) < 0)
5945 isl_union_pw_multi_aff_free(upma
);
5948 isl_union_pw_multi_aff_free(upma
);
5949 isl_union_map_free(umap
);
5953 /* Local data for bin_entry and the callback "fn".
5955 struct isl_union_pw_multi_aff_bin_data
{
5956 isl_union_pw_multi_aff
*upma2
;
5957 isl_union_pw_multi_aff
*res
;
5958 isl_pw_multi_aff
*pma
;
5959 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
);
5962 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
5963 * and call data->fn for each isl_pw_multi_aff in data->upma2.
5965 static isl_stat
bin_entry(__isl_take isl_pw_multi_aff
*pma
, void *user
)
5967 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5971 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma2
,
5973 isl_pw_multi_aff_free(pma
);
5978 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
5979 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
5980 * passed as user field) and the isl_pw_multi_aff from upma2 is available
5981 * as *entry. The callback should adjust data->res if desired.
5983 static __isl_give isl_union_pw_multi_aff
*bin_op(
5984 __isl_take isl_union_pw_multi_aff
*upma1
,
5985 __isl_take isl_union_pw_multi_aff
*upma2
,
5986 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
))
5989 struct isl_union_pw_multi_aff_bin_data data
= { NULL
, NULL
, NULL
, fn
};
5991 space
= isl_union_pw_multi_aff_get_space(upma2
);
5992 upma1
= isl_union_pw_multi_aff_align_params(upma1
, space
);
5993 space
= isl_union_pw_multi_aff_get_space(upma1
);
5994 upma2
= isl_union_pw_multi_aff_align_params(upma2
, space
);
5996 if (!upma1
|| !upma2
)
6000 data
.res
= isl_union_pw_multi_aff_alloc_same_size(upma1
);
6001 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma1
,
6002 &bin_entry
, &data
) < 0)
6005 isl_union_pw_multi_aff_free(upma1
);
6006 isl_union_pw_multi_aff_free(upma2
);
6009 isl_union_pw_multi_aff_free(upma1
);
6010 isl_union_pw_multi_aff_free(upma2
);
6011 isl_union_pw_multi_aff_free(data
.res
);
6015 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
6016 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
6018 static __isl_give isl_pw_multi_aff
*pw_multi_aff_range_product(
6019 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
6023 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
6024 isl_pw_multi_aff_get_space(pma2
));
6025 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
6026 &isl_multi_aff_range_product
);
6029 /* Given two isl_pw_multi_affs A -> B and C -> D,
6030 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
6032 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_product(
6033 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
6035 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
6036 &pw_multi_aff_range_product
);
6039 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
6040 * construct an isl_pw_multi_aff (A * C) -> (B, D).
6042 static __isl_give isl_pw_multi_aff
*pw_multi_aff_flat_range_product(
6043 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
6047 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
6048 isl_pw_multi_aff_get_space(pma2
));
6049 space
= isl_space_flatten_range(space
);
6050 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
6051 &isl_multi_aff_flat_range_product
);
6054 /* Given two isl_pw_multi_affs A -> B and C -> D,
6055 * construct an isl_pw_multi_aff (A * C) -> (B, D).
6057 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_flat_range_product(
6058 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
6060 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
6061 &pw_multi_aff_flat_range_product
);
6064 /* If data->pma and "pma2" have the same domain space, then compute
6065 * their flat range product and the result to data->res.
6067 static isl_stat
flat_range_product_entry(__isl_take isl_pw_multi_aff
*pma2
,
6070 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
6072 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
6073 pma2
->dim
, isl_dim_in
)) {
6074 isl_pw_multi_aff_free(pma2
);
6078 pma2
= isl_pw_multi_aff_flat_range_product(
6079 isl_pw_multi_aff_copy(data
->pma
), pma2
);
6081 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
6086 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
6087 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
6089 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_flat_range_product(
6090 __isl_take isl_union_pw_multi_aff
*upma1
,
6091 __isl_take isl_union_pw_multi_aff
*upma2
)
6093 return bin_op(upma1
, upma2
, &flat_range_product_entry
);
6096 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6097 * The parameters are assumed to have been aligned.
6099 * The implementation essentially performs an isl_pw_*_on_shared_domain,
6100 * except that it works on two different isl_pw_* types.
6102 static __isl_give isl_pw_multi_aff
*pw_multi_aff_set_pw_aff(
6103 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6104 __isl_take isl_pw_aff
*pa
)
6107 isl_pw_multi_aff
*res
= NULL
;
6112 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_in
,
6113 pa
->dim
, isl_dim_in
))
6114 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6115 "domains don't match", goto error
);
6116 if (pos
>= isl_pw_multi_aff_dim(pma
, isl_dim_out
))
6117 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6118 "index out of bounds", goto error
);
6121 res
= isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma
), n
);
6123 for (i
= 0; i
< pma
->n
; ++i
) {
6124 for (j
= 0; j
< pa
->n
; ++j
) {
6126 isl_multi_aff
*res_ij
;
6129 common
= isl_set_intersect(isl_set_copy(pma
->p
[i
].set
),
6130 isl_set_copy(pa
->p
[j
].set
));
6131 empty
= isl_set_plain_is_empty(common
);
6132 if (empty
< 0 || empty
) {
6133 isl_set_free(common
);
6139 res_ij
= isl_multi_aff_set_aff(
6140 isl_multi_aff_copy(pma
->p
[i
].maff
), pos
,
6141 isl_aff_copy(pa
->p
[j
].aff
));
6142 res_ij
= isl_multi_aff_gist(res_ij
,
6143 isl_set_copy(common
));
6145 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
6149 isl_pw_multi_aff_free(pma
);
6150 isl_pw_aff_free(pa
);
6153 isl_pw_multi_aff_free(pma
);
6154 isl_pw_aff_free(pa
);
6155 return isl_pw_multi_aff_free(res
);
6158 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6160 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_set_pw_aff(
6161 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6162 __isl_take isl_pw_aff
*pa
)
6164 isl_bool equal_params
;
6168 equal_params
= isl_space_has_equal_params(pma
->dim
, pa
->dim
);
6169 if (equal_params
< 0)
6172 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6173 if (!isl_space_has_named_params(pma
->dim
) ||
6174 !isl_space_has_named_params(pa
->dim
))
6175 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6176 "unaligned unnamed parameters", goto error
);
6177 pma
= isl_pw_multi_aff_align_params(pma
, isl_pw_aff_get_space(pa
));
6178 pa
= isl_pw_aff_align_params(pa
, isl_pw_multi_aff_get_space(pma
));
6179 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6181 isl_pw_multi_aff_free(pma
);
6182 isl_pw_aff_free(pa
);
6186 /* Do the parameters of "pa" match those of "space"?
6188 isl_bool
isl_pw_aff_matching_params(__isl_keep isl_pw_aff
*pa
,
6189 __isl_keep isl_space
*space
)
6191 isl_space
*pa_space
;
6195 return isl_bool_error
;
6197 pa_space
= isl_pw_aff_get_space(pa
);
6199 match
= isl_space_has_equal_params(space
, pa_space
);
6201 isl_space_free(pa_space
);
6205 /* Check that the domain space of "pa" matches "space".
6207 isl_stat
isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff
*pa
,
6208 __isl_keep isl_space
*space
)
6210 isl_space
*pa_space
;
6214 return isl_stat_error
;
6216 pa_space
= isl_pw_aff_get_space(pa
);
6218 match
= isl_space_has_equal_params(space
, pa_space
);
6222 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6223 "parameters don't match", goto error
);
6224 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
6225 pa_space
, isl_dim_in
);
6229 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6230 "domains don't match", goto error
);
6231 isl_space_free(pa_space
);
6234 isl_space_free(pa_space
);
6235 return isl_stat_error
;
6243 #include <isl_multi_templ.c>
6244 #include <isl_multi_apply_set.c>
6245 #include <isl_multi_coalesce.c>
6246 #include <isl_multi_gist.c>
6247 #include <isl_multi_hash.c>
6248 #include <isl_multi_intersect.c>
6250 /* Scale the elements of "pma" by the corresponding elements of "mv".
6252 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_scale_multi_val(
6253 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
)
6256 isl_bool equal_params
;
6258 pma
= isl_pw_multi_aff_cow(pma
);
6261 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6262 mv
->space
, isl_dim_set
))
6263 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6264 "spaces don't match", goto error
);
6265 equal_params
= isl_space_has_equal_params(pma
->dim
, mv
->space
);
6266 if (equal_params
< 0)
6268 if (!equal_params
) {
6269 pma
= isl_pw_multi_aff_align_params(pma
,
6270 isl_multi_val_get_space(mv
));
6271 mv
= isl_multi_val_align_params(mv
,
6272 isl_pw_multi_aff_get_space(pma
));
6277 for (i
= 0; i
< pma
->n
; ++i
) {
6278 pma
->p
[i
].maff
= isl_multi_aff_scale_multi_val(pma
->p
[i
].maff
,
6279 isl_multi_val_copy(mv
));
6280 if (!pma
->p
[i
].maff
)
6284 isl_multi_val_free(mv
);
6287 isl_multi_val_free(mv
);
6288 isl_pw_multi_aff_free(pma
);
6292 /* This function is called for each entry of an isl_union_pw_multi_aff.
6293 * If the space of the entry matches that of data->mv,
6294 * then apply isl_pw_multi_aff_scale_multi_val and return the result.
6295 * Otherwise, return an empty isl_pw_multi_aff.
6297 static __isl_give isl_pw_multi_aff
*union_pw_multi_aff_scale_multi_val_entry(
6298 __isl_take isl_pw_multi_aff
*pma
, void *user
)
6300 isl_multi_val
*mv
= user
;
6304 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6305 mv
->space
, isl_dim_set
)) {
6306 isl_space
*space
= isl_pw_multi_aff_get_space(pma
);
6307 isl_pw_multi_aff_free(pma
);
6308 return isl_pw_multi_aff_empty(space
);
6311 return isl_pw_multi_aff_scale_multi_val(pma
, isl_multi_val_copy(mv
));
6314 /* Scale the elements of "upma" by the corresponding elements of "mv",
6315 * for those entries that match the space of "mv".
6317 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_scale_multi_val(
6318 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_multi_val
*mv
)
6320 upma
= isl_union_pw_multi_aff_align_params(upma
,
6321 isl_multi_val_get_space(mv
));
6322 mv
= isl_multi_val_align_params(mv
,
6323 isl_union_pw_multi_aff_get_space(upma
));
6327 return isl_union_pw_multi_aff_transform(upma
,
6328 &union_pw_multi_aff_scale_multi_val_entry
, mv
);
6330 isl_multi_val_free(mv
);
6333 isl_multi_val_free(mv
);
6334 isl_union_pw_multi_aff_free(upma
);
6338 /* Construct and return a piecewise multi affine expression
6339 * in the given space with value zero in each of the output dimensions and
6340 * a universe domain.
6342 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_zero(__isl_take isl_space
*space
)
6344 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space
));
6347 /* Construct and return a piecewise multi affine expression
6348 * that is equal to the given piecewise affine expression.
6350 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_pw_aff(
6351 __isl_take isl_pw_aff
*pa
)
6355 isl_pw_multi_aff
*pma
;
6360 space
= isl_pw_aff_get_space(pa
);
6361 pma
= isl_pw_multi_aff_alloc_size(space
, pa
->n
);
6363 for (i
= 0; i
< pa
->n
; ++i
) {
6367 set
= isl_set_copy(pa
->p
[i
].set
);
6368 ma
= isl_multi_aff_from_aff(isl_aff_copy(pa
->p
[i
].aff
));
6369 pma
= isl_pw_multi_aff_add_piece(pma
, set
, ma
);
6372 isl_pw_aff_free(pa
);
6376 /* Construct a set or map mapping the shared (parameter) domain
6377 * of the piecewise affine expressions to the range of "mpa"
6378 * with each dimension in the range equated to the
6379 * corresponding piecewise affine expression.
6381 static __isl_give isl_map
*map_from_multi_pw_aff(
6382 __isl_take isl_multi_pw_aff
*mpa
)
6391 if (isl_space_dim(mpa
->space
, isl_dim_out
) != mpa
->n
)
6392 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6393 "invalid space", goto error
);
6395 space
= isl_multi_pw_aff_get_domain_space(mpa
);
6396 map
= isl_map_universe(isl_space_from_domain(space
));
6398 for (i
= 0; i
< mpa
->n
; ++i
) {
6402 pa
= isl_pw_aff_copy(mpa
->p
[i
]);
6403 map_i
= map_from_pw_aff(pa
);
6405 map
= isl_map_flat_range_product(map
, map_i
);
6408 map
= isl_map_reset_space(map
, isl_multi_pw_aff_get_space(mpa
));
6410 isl_multi_pw_aff_free(mpa
);
6413 isl_multi_pw_aff_free(mpa
);
6417 /* Construct a map mapping the shared domain
6418 * of the piecewise affine expressions to the range of "mpa"
6419 * with each dimension in the range equated to the
6420 * corresponding piecewise affine expression.
6422 __isl_give isl_map
*isl_map_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6426 if (isl_space_is_set(mpa
->space
))
6427 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6428 "space of input is not a map", goto error
);
6430 return map_from_multi_pw_aff(mpa
);
6432 isl_multi_pw_aff_free(mpa
);
6436 /* Construct a set mapping the shared parameter domain
6437 * of the piecewise affine expressions to the space of "mpa"
6438 * with each dimension in the range equated to the
6439 * corresponding piecewise affine expression.
6441 __isl_give isl_set
*isl_set_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6445 if (!isl_space_is_set(mpa
->space
))
6446 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6447 "space of input is not a set", goto error
);
6449 return map_from_multi_pw_aff(mpa
);
6451 isl_multi_pw_aff_free(mpa
);
6455 /* Construct and return a piecewise multi affine expression
6456 * that is equal to the given multi piecewise affine expression
6457 * on the shared domain of the piecewise affine expressions.
6459 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff(
6460 __isl_take isl_multi_pw_aff
*mpa
)
6465 isl_pw_multi_aff
*pma
;
6470 space
= isl_multi_pw_aff_get_space(mpa
);
6473 isl_multi_pw_aff_free(mpa
);
6474 return isl_pw_multi_aff_zero(space
);
6477 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, 0);
6478 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
6480 for (i
= 1; i
< mpa
->n
; ++i
) {
6481 isl_pw_multi_aff
*pma_i
;
6483 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6484 pma_i
= isl_pw_multi_aff_from_pw_aff(pa
);
6485 pma
= isl_pw_multi_aff_range_product(pma
, pma_i
);
6488 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
6490 isl_multi_pw_aff_free(mpa
);
6494 /* Construct and return a multi piecewise affine expression
6495 * that is equal to the given multi affine expression.
6497 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_multi_aff(
6498 __isl_take isl_multi_aff
*ma
)
6501 isl_multi_pw_aff
*mpa
;
6506 n
= isl_multi_aff_dim(ma
, isl_dim_out
);
6507 mpa
= isl_multi_pw_aff_alloc(isl_multi_aff_get_space(ma
));
6509 for (i
= 0; i
< n
; ++i
) {
6512 pa
= isl_pw_aff_from_aff(isl_multi_aff_get_aff(ma
, i
));
6513 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6516 isl_multi_aff_free(ma
);
6520 /* Construct and return a multi piecewise affine expression
6521 * that is equal to the given piecewise multi affine expression.
6523 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_pw_multi_aff(
6524 __isl_take isl_pw_multi_aff
*pma
)
6528 isl_multi_pw_aff
*mpa
;
6533 n
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
6534 space
= isl_pw_multi_aff_get_space(pma
);
6535 mpa
= isl_multi_pw_aff_alloc(space
);
6537 for (i
= 0; i
< n
; ++i
) {
6540 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
6541 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6544 isl_pw_multi_aff_free(pma
);
6548 /* Do "pa1" and "pa2" represent the same function?
6550 * We first check if they are obviously equal.
6551 * If not, we convert them to maps and check if those are equal.
6553 * If "pa1" or "pa2" contain any NaNs, then they are considered
6554 * not to be the same. A NaN is not equal to anything, not even
6557 isl_bool
isl_pw_aff_is_equal(__isl_keep isl_pw_aff
*pa1
,
6558 __isl_keep isl_pw_aff
*pa2
)
6562 isl_map
*map1
, *map2
;
6565 return isl_bool_error
;
6567 equal
= isl_pw_aff_plain_is_equal(pa1
, pa2
);
6568 if (equal
< 0 || equal
)
6570 has_nan
= either_involves_nan(pa1
, pa2
);
6572 return isl_bool_error
;
6574 return isl_bool_false
;
6576 map1
= map_from_pw_aff(isl_pw_aff_copy(pa1
));
6577 map2
= map_from_pw_aff(isl_pw_aff_copy(pa2
));
6578 equal
= isl_map_is_equal(map1
, map2
);
6585 /* Do "mpa1" and "mpa2" represent the same function?
6587 * Note that we cannot convert the entire isl_multi_pw_aff
6588 * to a map because the domains of the piecewise affine expressions
6589 * may not be the same.
6591 isl_bool
isl_multi_pw_aff_is_equal(__isl_keep isl_multi_pw_aff
*mpa1
,
6592 __isl_keep isl_multi_pw_aff
*mpa2
)
6595 isl_bool equal
, equal_params
;
6598 return isl_bool_error
;
6600 equal_params
= isl_space_has_equal_params(mpa1
->space
, mpa2
->space
);
6601 if (equal_params
< 0)
6602 return isl_bool_error
;
6603 if (!equal_params
) {
6604 if (!isl_space_has_named_params(mpa1
->space
))
6605 return isl_bool_false
;
6606 if (!isl_space_has_named_params(mpa2
->space
))
6607 return isl_bool_false
;
6608 mpa1
= isl_multi_pw_aff_copy(mpa1
);
6609 mpa2
= isl_multi_pw_aff_copy(mpa2
);
6610 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6611 isl_multi_pw_aff_get_space(mpa2
));
6612 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6613 isl_multi_pw_aff_get_space(mpa1
));
6614 equal
= isl_multi_pw_aff_is_equal(mpa1
, mpa2
);
6615 isl_multi_pw_aff_free(mpa1
);
6616 isl_multi_pw_aff_free(mpa2
);
6620 equal
= isl_space_is_equal(mpa1
->space
, mpa2
->space
);
6621 if (equal
< 0 || !equal
)
6624 for (i
= 0; i
< mpa1
->n
; ++i
) {
6625 equal
= isl_pw_aff_is_equal(mpa1
->p
[i
], mpa2
->p
[i
]);
6626 if (equal
< 0 || !equal
)
6630 return isl_bool_true
;
6633 /* Do "pma1" and "pma2" represent the same function?
6635 * First check if they are obviously equal.
6636 * If not, then convert them to maps and check if those are equal.
6638 * If "pa1" or "pa2" contain any NaNs, then they are considered
6639 * not to be the same. A NaN is not equal to anything, not even
6642 isl_bool
isl_pw_multi_aff_is_equal(__isl_keep isl_pw_multi_aff
*pma1
,
6643 __isl_keep isl_pw_multi_aff
*pma2
)
6647 isl_map
*map1
, *map2
;
6650 return isl_bool_error
;
6652 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
6653 if (equal
< 0 || equal
)
6655 has_nan
= isl_pw_multi_aff_involves_nan(pma1
);
6656 if (has_nan
>= 0 && !has_nan
)
6657 has_nan
= isl_pw_multi_aff_involves_nan(pma2
);
6658 if (has_nan
< 0 || has_nan
)
6659 return isl_bool_not(has_nan
);
6661 map1
= isl_map_from_pw_multi_aff(isl_pw_multi_aff_copy(pma1
));
6662 map2
= isl_map_from_pw_multi_aff(isl_pw_multi_aff_copy(pma2
));
6663 equal
= isl_map_is_equal(map1
, map2
);
6670 /* Compute the pullback of "mpa" by the function represented by "ma".
6671 * In other words, plug in "ma" in "mpa".
6673 * The parameters of "mpa" and "ma" are assumed to have been aligned.
6675 static __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff_aligned(
6676 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6679 isl_space
*space
= NULL
;
6681 mpa
= isl_multi_pw_aff_cow(mpa
);
6685 space
= isl_space_join(isl_multi_aff_get_space(ma
),
6686 isl_multi_pw_aff_get_space(mpa
));
6690 for (i
= 0; i
< mpa
->n
; ++i
) {
6691 mpa
->p
[i
] = isl_pw_aff_pullback_multi_aff(mpa
->p
[i
],
6692 isl_multi_aff_copy(ma
));
6697 isl_multi_aff_free(ma
);
6698 isl_space_free(mpa
->space
);
6702 isl_space_free(space
);
6703 isl_multi_pw_aff_free(mpa
);
6704 isl_multi_aff_free(ma
);
6708 /* Compute the pullback of "mpa" by the function represented by "ma".
6709 * In other words, plug in "ma" in "mpa".
6711 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff(
6712 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6714 isl_bool equal_params
;
6718 equal_params
= isl_space_has_equal_params(mpa
->space
, ma
->space
);
6719 if (equal_params
< 0)
6722 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6723 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_multi_aff_get_space(ma
));
6724 ma
= isl_multi_aff_align_params(ma
, isl_multi_pw_aff_get_space(mpa
));
6725 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6727 isl_multi_pw_aff_free(mpa
);
6728 isl_multi_aff_free(ma
);
6732 /* Compute the pullback of "mpa" by the function represented by "pma".
6733 * In other words, plug in "pma" in "mpa".
6735 * The parameters of "mpa" and "mpa" are assumed to have been aligned.
6737 static __isl_give isl_multi_pw_aff
*
6738 isl_multi_pw_aff_pullback_pw_multi_aff_aligned(
6739 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6742 isl_space
*space
= NULL
;
6744 mpa
= isl_multi_pw_aff_cow(mpa
);
6748 space
= isl_space_join(isl_pw_multi_aff_get_space(pma
),
6749 isl_multi_pw_aff_get_space(mpa
));
6751 for (i
= 0; i
< mpa
->n
; ++i
) {
6752 mpa
->p
[i
] = isl_pw_aff_pullback_pw_multi_aff_aligned(mpa
->p
[i
],
6753 isl_pw_multi_aff_copy(pma
));
6758 isl_pw_multi_aff_free(pma
);
6759 isl_space_free(mpa
->space
);
6763 isl_space_free(space
);
6764 isl_multi_pw_aff_free(mpa
);
6765 isl_pw_multi_aff_free(pma
);
6769 /* Compute the pullback of "mpa" by the function represented by "pma".
6770 * In other words, plug in "pma" in "mpa".
6772 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_pw_multi_aff(
6773 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6775 isl_bool equal_params
;
6779 equal_params
= isl_space_has_equal_params(mpa
->space
, pma
->dim
);
6780 if (equal_params
< 0)
6783 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6784 mpa
= isl_multi_pw_aff_align_params(mpa
,
6785 isl_pw_multi_aff_get_space(pma
));
6786 pma
= isl_pw_multi_aff_align_params(pma
,
6787 isl_multi_pw_aff_get_space(mpa
));
6788 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6790 isl_multi_pw_aff_free(mpa
);
6791 isl_pw_multi_aff_free(pma
);
6795 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6796 * with the domain of "aff". The domain of the result is the same
6798 * "mpa" and "aff" are assumed to have been aligned.
6800 * We first extract the parametric constant from "aff", defined
6801 * over the correct domain.
6802 * Then we add the appropriate combinations of the members of "mpa".
6803 * Finally, we add the integer divisions through recursive calls.
6805 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff_aligned(
6806 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6814 n_in
= isl_aff_dim(aff
, isl_dim_in
);
6815 n_div
= isl_aff_dim(aff
, isl_dim_div
);
6817 space
= isl_space_domain(isl_multi_pw_aff_get_space(mpa
));
6818 tmp
= isl_aff_copy(aff
);
6819 tmp
= isl_aff_drop_dims(tmp
, isl_dim_div
, 0, n_div
);
6820 tmp
= isl_aff_drop_dims(tmp
, isl_dim_in
, 0, n_in
);
6821 tmp
= isl_aff_add_dims(tmp
, isl_dim_in
,
6822 isl_space_dim(space
, isl_dim_set
));
6823 tmp
= isl_aff_reset_domain_space(tmp
, space
);
6824 pa
= isl_pw_aff_from_aff(tmp
);
6826 for (i
= 0; i
< n_in
; ++i
) {
6829 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
6831 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
6832 pa_i
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6833 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6834 pa
= isl_pw_aff_add(pa
, pa_i
);
6837 for (i
= 0; i
< n_div
; ++i
) {
6841 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
6843 div
= isl_aff_get_div(aff
, i
);
6844 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6845 isl_multi_pw_aff_copy(mpa
), div
);
6846 pa_i
= isl_pw_aff_floor(pa_i
);
6847 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
6848 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6849 pa
= isl_pw_aff_add(pa
, pa_i
);
6852 isl_multi_pw_aff_free(mpa
);
6858 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6859 * with the domain of "aff". The domain of the result is the same
6862 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff(
6863 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6865 isl_bool equal_params
;
6869 equal_params
= isl_space_has_equal_params(aff
->ls
->dim
, mpa
->space
);
6870 if (equal_params
< 0)
6873 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6875 aff
= isl_aff_align_params(aff
, isl_multi_pw_aff_get_space(mpa
));
6876 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_aff_get_space(aff
));
6878 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6881 isl_multi_pw_aff_free(mpa
);
6885 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6886 * with the domain of "pa". The domain of the result is the same
6888 * "mpa" and "pa" are assumed to have been aligned.
6890 * We consider each piece in turn. Note that the domains of the
6891 * pieces are assumed to be disjoint and they remain disjoint
6892 * after taking the preimage (over the same function).
6894 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff_aligned(
6895 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6904 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa
),
6905 isl_pw_aff_get_space(pa
));
6906 res
= isl_pw_aff_empty(space
);
6908 for (i
= 0; i
< pa
->n
; ++i
) {
6912 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6913 isl_multi_pw_aff_copy(mpa
),
6914 isl_aff_copy(pa
->p
[i
].aff
));
6915 domain
= isl_set_copy(pa
->p
[i
].set
);
6916 domain
= isl_set_preimage_multi_pw_aff(domain
,
6917 isl_multi_pw_aff_copy(mpa
));
6918 pa_i
= isl_pw_aff_intersect_domain(pa_i
, domain
);
6919 res
= isl_pw_aff_add_disjoint(res
, pa_i
);
6922 isl_pw_aff_free(pa
);
6923 isl_multi_pw_aff_free(mpa
);
6926 isl_pw_aff_free(pa
);
6927 isl_multi_pw_aff_free(mpa
);
6931 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6932 * with the domain of "pa". The domain of the result is the same
6935 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff(
6936 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6938 isl_bool equal_params
;
6942 equal_params
= isl_space_has_equal_params(pa
->dim
, mpa
->space
);
6943 if (equal_params
< 0)
6946 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6948 pa
= isl_pw_aff_align_params(pa
, isl_multi_pw_aff_get_space(mpa
));
6949 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_pw_aff_get_space(pa
));
6951 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6953 isl_pw_aff_free(pa
);
6954 isl_multi_pw_aff_free(mpa
);
6958 /* Compute the pullback of "pa" by the function represented by "mpa".
6959 * In other words, plug in "mpa" in "pa".
6960 * "pa" and "mpa" are assumed to have been aligned.
6962 * The pullback is computed by applying "pa" to "mpa".
6964 static __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff_aligned(
6965 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6967 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6970 /* Compute the pullback of "pa" by the function represented by "mpa".
6971 * In other words, plug in "mpa" in "pa".
6973 * The pullback is computed by applying "pa" to "mpa".
6975 __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff(
6976 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6978 return isl_multi_pw_aff_apply_pw_aff(mpa
, pa
);
6981 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6982 * In other words, plug in "mpa2" in "mpa1".
6984 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6986 * We pullback each member of "mpa1" in turn.
6988 static __isl_give isl_multi_pw_aff
*
6989 isl_multi_pw_aff_pullback_multi_pw_aff_aligned(
6990 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6993 isl_space
*space
= NULL
;
6995 mpa1
= isl_multi_pw_aff_cow(mpa1
);
6999 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa2
),
7000 isl_multi_pw_aff_get_space(mpa1
));
7002 for (i
= 0; i
< mpa1
->n
; ++i
) {
7003 mpa1
->p
[i
] = isl_pw_aff_pullback_multi_pw_aff_aligned(
7004 mpa1
->p
[i
], isl_multi_pw_aff_copy(mpa2
));
7009 mpa1
= isl_multi_pw_aff_reset_space(mpa1
, space
);
7011 isl_multi_pw_aff_free(mpa2
);
7014 isl_space_free(space
);
7015 isl_multi_pw_aff_free(mpa1
);
7016 isl_multi_pw_aff_free(mpa2
);
7020 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
7021 * In other words, plug in "mpa2" in "mpa1".
7023 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_pw_aff(
7024 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
7026 return isl_multi_pw_aff_align_params_multi_multi_and(mpa1
, mpa2
,
7027 &isl_multi_pw_aff_pullback_multi_pw_aff_aligned
);
7030 /* Align the parameters of "mpa1" and "mpa2", check that the ranges
7031 * of "mpa1" and "mpa2" live in the same space, construct map space
7032 * between the domain spaces of "mpa1" and "mpa2" and call "order"
7033 * with this map space as extract argument.
7035 static __isl_give isl_map
*isl_multi_pw_aff_order_map(
7036 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
7037 __isl_give isl_map
*(*order
)(__isl_keep isl_multi_pw_aff
*mpa1
,
7038 __isl_keep isl_multi_pw_aff
*mpa2
, __isl_take isl_space
*space
))
7041 isl_space
*space1
, *space2
;
7044 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
7045 isl_multi_pw_aff_get_space(mpa2
));
7046 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
7047 isl_multi_pw_aff_get_space(mpa1
));
7050 match
= isl_space_tuple_is_equal(mpa1
->space
, isl_dim_out
,
7051 mpa2
->space
, isl_dim_out
);
7055 isl_die(isl_multi_pw_aff_get_ctx(mpa1
), isl_error_invalid
,
7056 "range spaces don't match", goto error
);
7057 space1
= isl_space_domain(isl_multi_pw_aff_get_space(mpa1
));
7058 space2
= isl_space_domain(isl_multi_pw_aff_get_space(mpa2
));
7059 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
7061 res
= order(mpa1
, mpa2
, space1
);
7062 isl_multi_pw_aff_free(mpa1
);
7063 isl_multi_pw_aff_free(mpa2
);
7066 isl_multi_pw_aff_free(mpa1
);
7067 isl_multi_pw_aff_free(mpa2
);
7071 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7072 * where the function values are equal. "space" is the space of the result.
7073 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7075 * "mpa1" and "mpa2" are equal when each of the pairs of elements
7076 * in the sequences are equal.
7078 static __isl_give isl_map
*isl_multi_pw_aff_eq_map_on_space(
7079 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
7080 __isl_take isl_space
*space
)
7085 res
= isl_map_universe(space
);
7087 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
7088 for (i
= 0; i
< n
; ++i
) {
7089 isl_pw_aff
*pa1
, *pa2
;
7092 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
7093 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
7094 map
= isl_pw_aff_eq_map(pa1
, pa2
);
7095 res
= isl_map_intersect(res
, map
);
7101 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7102 * where the function values are equal.
7104 __isl_give isl_map
*isl_multi_pw_aff_eq_map(__isl_take isl_multi_pw_aff
*mpa1
,
7105 __isl_take isl_multi_pw_aff
*mpa2
)
7107 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7108 &isl_multi_pw_aff_eq_map_on_space
);
7111 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7112 * where the function values of "mpa1" is lexicographically satisfies "base"
7113 * compared to that of "mpa2". "space" is the space of the result.
7114 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7116 * "mpa1" lexicographically satisfies "base" compared to "mpa2"
7117 * if its i-th element satisfies "base" when compared to
7118 * the i-th element of "mpa2" while all previous elements are
7121 static __isl_give isl_map
*isl_multi_pw_aff_lex_map_on_space(
7122 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
7123 __isl_give isl_map
*(*base
)(__isl_take isl_pw_aff
*pa1
,
7124 __isl_take isl_pw_aff
*pa2
),
7125 __isl_take isl_space
*space
)
7128 isl_map
*res
, *rest
;
7130 res
= isl_map_empty(isl_space_copy(space
));
7131 rest
= isl_map_universe(space
);
7133 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
7134 for (i
= 0; i
< n
; ++i
) {
7135 isl_pw_aff
*pa1
, *pa2
;
7138 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
7139 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
7140 map
= base(pa1
, pa2
);
7141 map
= isl_map_intersect(map
, isl_map_copy(rest
));
7142 res
= isl_map_union(res
, map
);
7147 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
7148 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
7149 map
= isl_pw_aff_eq_map(pa1
, pa2
);
7150 rest
= isl_map_intersect(rest
, map
);
7157 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7158 * where the function value of "mpa1" is lexicographically less than that
7159 * of "mpa2". "space" is the space of the result.
7160 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7162 * "mpa1" is less than "mpa2" if its i-th element is smaller
7163 * than the i-th element of "mpa2" while all previous elements are
7166 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map_on_space(
7167 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
7168 __isl_take isl_space
*space
)
7170 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
7171 &isl_pw_aff_lt_map
, space
);
7174 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7175 * where the function value of "mpa1" is lexicographically less than that
7178 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map(
7179 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
7181 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7182 &isl_multi_pw_aff_lex_lt_map_on_space
);
7185 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7186 * where the function value of "mpa1" is lexicographically greater than that
7187 * of "mpa2". "space" is the space of the result.
7188 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7190 * "mpa1" is greater than "mpa2" if its i-th element is greater
7191 * than the i-th element of "mpa2" while all previous elements are
7194 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map_on_space(
7195 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
7196 __isl_take isl_space
*space
)
7198 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
7199 &isl_pw_aff_gt_map
, space
);
7202 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7203 * where the function value of "mpa1" is lexicographically greater than that
7206 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map(
7207 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
7209 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7210 &isl_multi_pw_aff_lex_gt_map_on_space
);
7213 /* Compare two isl_affs.
7215 * Return -1 if "aff1" is "smaller" than "aff2", 1 if "aff1" is "greater"
7216 * than "aff2" and 0 if they are equal.
7218 * The order is fairly arbitrary. We do consider expressions that only involve
7219 * earlier dimensions as "smaller".
7221 int isl_aff_plain_cmp(__isl_keep isl_aff
*aff1
, __isl_keep isl_aff
*aff2
)
7234 cmp
= isl_local_space_cmp(aff1
->ls
, aff2
->ls
);
7238 last1
= isl_seq_last_non_zero(aff1
->v
->el
+ 1, aff1
->v
->size
- 1);
7239 last2
= isl_seq_last_non_zero(aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
7241 return last1
- last2
;
7243 return isl_seq_cmp(aff1
->v
->el
, aff2
->v
->el
, aff1
->v
->size
);
7246 /* Compare two isl_pw_affs.
7248 * Return -1 if "pa1" is "smaller" than "pa2", 1 if "pa1" is "greater"
7249 * than "pa2" and 0 if they are equal.
7251 * The order is fairly arbitrary. We do consider expressions that only involve
7252 * earlier dimensions as "smaller".
7254 int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff
*pa1
,
7255 __isl_keep isl_pw_aff
*pa2
)
7268 cmp
= isl_space_cmp(pa1
->dim
, pa2
->dim
);
7272 if (pa1
->n
!= pa2
->n
)
7273 return pa1
->n
- pa2
->n
;
7275 for (i
= 0; i
< pa1
->n
; ++i
) {
7276 cmp
= isl_set_plain_cmp(pa1
->p
[i
].set
, pa2
->p
[i
].set
);
7279 cmp
= isl_aff_plain_cmp(pa1
->p
[i
].aff
, pa2
->p
[i
].aff
);
7287 /* Return a piecewise affine expression that is equal to "v" on "domain".
7289 __isl_give isl_pw_aff
*isl_pw_aff_val_on_domain(__isl_take isl_set
*domain
,
7290 __isl_take isl_val
*v
)
7293 isl_local_space
*ls
;
7296 space
= isl_set_get_space(domain
);
7297 ls
= isl_local_space_from_space(space
);
7298 aff
= isl_aff_val_on_domain(ls
, v
);
7300 return isl_pw_aff_alloc(domain
, aff
);
7303 /* Return a multi affine expression that is equal to "mv" on domain
7306 __isl_give isl_multi_aff
*isl_multi_aff_multi_val_on_space(
7307 __isl_take isl_space
*space
, __isl_take isl_multi_val
*mv
)
7311 isl_local_space
*ls
;
7317 n
= isl_multi_val_dim(mv
, isl_dim_set
);
7318 space2
= isl_multi_val_get_space(mv
);
7319 space2
= isl_space_align_params(space2
, isl_space_copy(space
));
7320 space
= isl_space_align_params(space
, isl_space_copy(space2
));
7321 space
= isl_space_map_from_domain_and_range(space
, space2
);
7322 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
7323 ls
= isl_local_space_from_space(isl_space_domain(space
));
7324 for (i
= 0; i
< n
; ++i
) {
7328 v
= isl_multi_val_get_val(mv
, i
);
7329 aff
= isl_aff_val_on_domain(isl_local_space_copy(ls
), v
);
7330 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
7332 isl_local_space_free(ls
);
7334 isl_multi_val_free(mv
);
7337 isl_space_free(space
);
7338 isl_multi_val_free(mv
);
7342 /* Return a piecewise multi-affine expression
7343 * that is equal to "mv" on "domain".
7345 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_multi_val_on_domain(
7346 __isl_take isl_set
*domain
, __isl_take isl_multi_val
*mv
)
7351 space
= isl_set_get_space(domain
);
7352 ma
= isl_multi_aff_multi_val_on_space(space
, mv
);
7354 return isl_pw_multi_aff_alloc(domain
, ma
);
7357 /* Internal data structure for isl_union_pw_multi_aff_multi_val_on_domain.
7358 * mv is the value that should be attained on each domain set
7359 * res collects the results
7361 struct isl_union_pw_multi_aff_multi_val_on_domain_data
{
7363 isl_union_pw_multi_aff
*res
;
7366 /* Create an isl_pw_multi_aff equal to data->mv on "domain"
7367 * and add it to data->res.
7369 static isl_stat
pw_multi_aff_multi_val_on_domain(__isl_take isl_set
*domain
,
7372 struct isl_union_pw_multi_aff_multi_val_on_domain_data
*data
= user
;
7373 isl_pw_multi_aff
*pma
;
7376 mv
= isl_multi_val_copy(data
->mv
);
7377 pma
= isl_pw_multi_aff_multi_val_on_domain(domain
, mv
);
7378 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
7380 return data
->res
? isl_stat_ok
: isl_stat_error
;
7383 /* Return a union piecewise multi-affine expression
7384 * that is equal to "mv" on "domain".
7386 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_multi_val_on_domain(
7387 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7389 struct isl_union_pw_multi_aff_multi_val_on_domain_data data
;
7392 space
= isl_union_set_get_space(domain
);
7393 data
.res
= isl_union_pw_multi_aff_empty(space
);
7395 if (isl_union_set_foreach_set(domain
,
7396 &pw_multi_aff_multi_val_on_domain
, &data
) < 0)
7397 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
7398 isl_union_set_free(domain
);
7399 isl_multi_val_free(mv
);
7403 /* Compute the pullback of data->pma by the function represented by "pma2",
7404 * provided the spaces match, and add the results to data->res.
7406 static isl_stat
pullback_entry(__isl_take isl_pw_multi_aff
*pma2
, void *user
)
7408 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
7410 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
7411 pma2
->dim
, isl_dim_out
)) {
7412 isl_pw_multi_aff_free(pma2
);
7416 pma2
= isl_pw_multi_aff_pullback_pw_multi_aff(
7417 isl_pw_multi_aff_copy(data
->pma
), pma2
);
7419 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
7421 return isl_stat_error
;
7426 /* Compute the pullback of "upma1" by the function represented by "upma2".
7428 __isl_give isl_union_pw_multi_aff
*
7429 isl_union_pw_multi_aff_pullback_union_pw_multi_aff(
7430 __isl_take isl_union_pw_multi_aff
*upma1
,
7431 __isl_take isl_union_pw_multi_aff
*upma2
)
7433 return bin_op(upma1
, upma2
, &pullback_entry
);
7436 /* Check that the domain space of "upa" matches "space".
7438 * This function is called from isl_multi_union_pw_aff_set_union_pw_aff and
7439 * can in principle never fail since the space "space" is that
7440 * of the isl_multi_union_pw_aff and is a set space such that
7441 * there is no domain space to match.
7443 * We check the parameters and double-check that "space" is
7444 * indeed that of a set.
7446 static isl_stat
isl_union_pw_aff_check_match_domain_space(
7447 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7449 isl_space
*upa_space
;
7453 return isl_stat_error
;
7455 match
= isl_space_is_set(space
);
7457 return isl_stat_error
;
7459 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7460 "expecting set space", return -1);
7462 upa_space
= isl_union_pw_aff_get_space(upa
);
7463 match
= isl_space_has_equal_params(space
, upa_space
);
7467 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7468 "parameters don't match", goto error
);
7470 isl_space_free(upa_space
);
7473 isl_space_free(upa_space
);
7474 return isl_stat_error
;
7477 /* Do the parameters of "upa" match those of "space"?
7479 static isl_bool
isl_union_pw_aff_matching_params(
7480 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7482 isl_space
*upa_space
;
7486 return isl_bool_error
;
7488 upa_space
= isl_union_pw_aff_get_space(upa
);
7490 match
= isl_space_has_equal_params(space
, upa_space
);
7492 isl_space_free(upa_space
);
7496 /* Internal data structure for isl_union_pw_aff_reset_domain_space.
7497 * space represents the new parameters.
7498 * res collects the results.
7500 struct isl_union_pw_aff_reset_params_data
{
7502 isl_union_pw_aff
*res
;
7505 /* Replace the parameters of "pa" by data->space and
7506 * add the result to data->res.
7508 static isl_stat
reset_params(__isl_take isl_pw_aff
*pa
, void *user
)
7510 struct isl_union_pw_aff_reset_params_data
*data
= user
;
7513 space
= isl_pw_aff_get_space(pa
);
7514 space
= isl_space_replace(space
, isl_dim_param
, data
->space
);
7515 pa
= isl_pw_aff_reset_space(pa
, space
);
7516 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7518 return data
->res
? isl_stat_ok
: isl_stat_error
;
7521 /* Replace the domain space of "upa" by "space".
7522 * Since a union expression does not have a (single) domain space,
7523 * "space" is necessarily a parameter space.
7525 * Since the order and the names of the parameters determine
7526 * the hash value, we need to create a new hash table.
7528 static __isl_give isl_union_pw_aff
*isl_union_pw_aff_reset_domain_space(
7529 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_space
*space
)
7531 struct isl_union_pw_aff_reset_params_data data
= { space
};
7534 match
= isl_union_pw_aff_matching_params(upa
, space
);
7536 upa
= isl_union_pw_aff_free(upa
);
7538 isl_space_free(space
);
7542 data
.res
= isl_union_pw_aff_empty(isl_space_copy(space
));
7543 if (isl_union_pw_aff_foreach_pw_aff(upa
, &reset_params
, &data
) < 0)
7544 data
.res
= isl_union_pw_aff_free(data
.res
);
7546 isl_union_pw_aff_free(upa
);
7547 isl_space_free(space
);
7551 /* Return the floor of "pa".
7553 static __isl_give isl_pw_aff
*floor_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7555 return isl_pw_aff_floor(pa
);
7558 /* Given f, return floor(f).
7560 __isl_give isl_union_pw_aff
*isl_union_pw_aff_floor(
7561 __isl_take isl_union_pw_aff
*upa
)
7563 return isl_union_pw_aff_transform_inplace(upa
, &floor_entry
, NULL
);
7568 * upa mod m = upa - m * floor(upa/m)
7570 * with m an integer value.
7572 __isl_give isl_union_pw_aff
*isl_union_pw_aff_mod_val(
7573 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_val
*m
)
7575 isl_union_pw_aff
*res
;
7580 if (!isl_val_is_int(m
))
7581 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7582 "expecting integer modulo", goto error
);
7583 if (!isl_val_is_pos(m
))
7584 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7585 "expecting positive modulo", goto error
);
7587 res
= isl_union_pw_aff_copy(upa
);
7588 upa
= isl_union_pw_aff_scale_down_val(upa
, isl_val_copy(m
));
7589 upa
= isl_union_pw_aff_floor(upa
);
7590 upa
= isl_union_pw_aff_scale_val(upa
, m
);
7591 res
= isl_union_pw_aff_sub(res
, upa
);
7596 isl_union_pw_aff_free(upa
);
7600 /* Internal data structure for isl_union_pw_aff_aff_on_domain.
7601 * "aff" is the symbolic value that the resulting isl_union_pw_aff
7603 * "res" collects the results.
7605 struct isl_union_pw_aff_aff_on_domain_data
{
7607 isl_union_pw_aff
*res
;
7610 /* Construct a piecewise affine expression that is equal to data->aff
7611 * on "domain" and add the result to data->res.
7613 static isl_stat
pw_aff_aff_on_domain(__isl_take isl_set
*domain
, void *user
)
7615 struct isl_union_pw_aff_aff_on_domain_data
*data
= user
;
7620 aff
= isl_aff_copy(data
->aff
);
7621 dim
= isl_set_dim(domain
, isl_dim_set
);
7622 aff
= isl_aff_add_dims(aff
, isl_dim_in
, dim
);
7623 aff
= isl_aff_reset_domain_space(aff
, isl_set_get_space(domain
));
7624 pa
= isl_pw_aff_alloc(domain
, aff
);
7625 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7627 return data
->res
? isl_stat_ok
: isl_stat_error
;
7630 /* Internal data structure for isl_union_pw_multi_aff_get_union_pw_aff.
7631 * pos is the output position that needs to be extracted.
7632 * res collects the results.
7634 struct isl_union_pw_multi_aff_get_union_pw_aff_data
{
7636 isl_union_pw_aff
*res
;
7639 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma"
7640 * (assuming it has such a dimension) and add it to data->res.
7642 static isl_stat
get_union_pw_aff(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7644 struct isl_union_pw_multi_aff_get_union_pw_aff_data
*data
= user
;
7649 return isl_stat_error
;
7651 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
7652 if (data
->pos
>= n_out
) {
7653 isl_pw_multi_aff_free(pma
);
7657 pa
= isl_pw_multi_aff_get_pw_aff(pma
, data
->pos
);
7658 isl_pw_multi_aff_free(pma
);
7660 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7662 return data
->res
? isl_stat_ok
: isl_stat_error
;
7665 /* Extract an isl_union_pw_aff corresponding to
7666 * output dimension "pos" of "upma".
7668 __isl_give isl_union_pw_aff
*isl_union_pw_multi_aff_get_union_pw_aff(
7669 __isl_keep isl_union_pw_multi_aff
*upma
, int pos
)
7671 struct isl_union_pw_multi_aff_get_union_pw_aff_data data
;
7678 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7679 "cannot extract at negative position", return NULL
);
7681 space
= isl_union_pw_multi_aff_get_space(upma
);
7682 data
.res
= isl_union_pw_aff_empty(space
);
7684 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
7685 &get_union_pw_aff
, &data
) < 0)
7686 data
.res
= isl_union_pw_aff_free(data
.res
);
7691 /* Return a union piecewise affine expression
7692 * that is equal to "aff" on "domain".
7694 * Construct an isl_pw_aff on each of the sets in "domain" and
7695 * collect the results.
7697 __isl_give isl_union_pw_aff
*isl_union_pw_aff_aff_on_domain(
7698 __isl_take isl_union_set
*domain
, __isl_take isl_aff
*aff
)
7700 struct isl_union_pw_aff_aff_on_domain_data data
;
7703 if (!domain
|| !aff
)
7705 if (!isl_local_space_is_params(aff
->ls
))
7706 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
7707 "expecting parametric expression", goto error
);
7709 space
= isl_union_set_get_space(domain
);
7710 data
.res
= isl_union_pw_aff_empty(space
);
7712 if (isl_union_set_foreach_set(domain
, &pw_aff_aff_on_domain
, &data
) < 0)
7713 data
.res
= isl_union_pw_aff_free(data
.res
);
7714 isl_union_set_free(domain
);
7718 isl_union_set_free(domain
);
7723 /* Internal data structure for isl_union_pw_aff_val_on_domain.
7724 * "v" is the value that the resulting isl_union_pw_aff needs to attain.
7725 * "res" collects the results.
7727 struct isl_union_pw_aff_val_on_domain_data
{
7729 isl_union_pw_aff
*res
;
7732 /* Construct a piecewise affine expression that is equal to data->v
7733 * on "domain" and add the result to data->res.
7735 static isl_stat
pw_aff_val_on_domain(__isl_take isl_set
*domain
, void *user
)
7737 struct isl_union_pw_aff_val_on_domain_data
*data
= user
;
7741 v
= isl_val_copy(data
->v
);
7742 pa
= isl_pw_aff_val_on_domain(domain
, v
);
7743 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7745 return data
->res
? isl_stat_ok
: isl_stat_error
;
7748 /* Return a union piecewise affine expression
7749 * that is equal to "v" on "domain".
7751 * Construct an isl_pw_aff on each of the sets in "domain" and
7752 * collect the results.
7754 __isl_give isl_union_pw_aff
*isl_union_pw_aff_val_on_domain(
7755 __isl_take isl_union_set
*domain
, __isl_take isl_val
*v
)
7757 struct isl_union_pw_aff_val_on_domain_data data
;
7760 space
= isl_union_set_get_space(domain
);
7761 data
.res
= isl_union_pw_aff_empty(space
);
7763 if (isl_union_set_foreach_set(domain
, &pw_aff_val_on_domain
, &data
) < 0)
7764 data
.res
= isl_union_pw_aff_free(data
.res
);
7765 isl_union_set_free(domain
);
7770 /* Construct a piecewise multi affine expression
7771 * that is equal to "pa" and add it to upma.
7773 static isl_stat
pw_multi_aff_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
,
7776 isl_union_pw_multi_aff
**upma
= user
;
7777 isl_pw_multi_aff
*pma
;
7779 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
7780 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
7782 return *upma
? isl_stat_ok
: isl_stat_error
;
7785 /* Construct and return a union piecewise multi affine expression
7786 * that is equal to the given union piecewise affine expression.
7788 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_pw_aff(
7789 __isl_take isl_union_pw_aff
*upa
)
7792 isl_union_pw_multi_aff
*upma
;
7797 space
= isl_union_pw_aff_get_space(upa
);
7798 upma
= isl_union_pw_multi_aff_empty(space
);
7800 if (isl_union_pw_aff_foreach_pw_aff(upa
,
7801 &pw_multi_aff_from_pw_aff_entry
, &upma
) < 0)
7802 upma
= isl_union_pw_multi_aff_free(upma
);
7804 isl_union_pw_aff_free(upa
);
7808 /* Compute the set of elements in the domain of "pa" where it is zero and
7809 * add this set to "uset".
7811 static isl_stat
zero_union_set(__isl_take isl_pw_aff
*pa
, void *user
)
7813 isl_union_set
**uset
= (isl_union_set
**)user
;
7815 *uset
= isl_union_set_add_set(*uset
, isl_pw_aff_zero_set(pa
));
7817 return *uset
? isl_stat_ok
: isl_stat_error
;
7820 /* Return a union set containing those elements in the domain
7821 * of "upa" where it is zero.
7823 __isl_give isl_union_set
*isl_union_pw_aff_zero_union_set(
7824 __isl_take isl_union_pw_aff
*upa
)
7826 isl_union_set
*zero
;
7828 zero
= isl_union_set_empty(isl_union_pw_aff_get_space(upa
));
7829 if (isl_union_pw_aff_foreach_pw_aff(upa
, &zero_union_set
, &zero
) < 0)
7830 zero
= isl_union_set_free(zero
);
7832 isl_union_pw_aff_free(upa
);
7836 /* Convert "pa" to an isl_map and add it to *umap.
7838 static isl_stat
map_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7840 isl_union_map
**umap
= user
;
7843 map
= isl_map_from_pw_aff(pa
);
7844 *umap
= isl_union_map_add_map(*umap
, map
);
7846 return *umap
? isl_stat_ok
: isl_stat_error
;
7849 /* Construct a union map mapping the domain of the union
7850 * piecewise affine expression to its range, with the single output dimension
7851 * equated to the corresponding affine expressions on their cells.
7853 __isl_give isl_union_map
*isl_union_map_from_union_pw_aff(
7854 __isl_take isl_union_pw_aff
*upa
)
7857 isl_union_map
*umap
;
7862 space
= isl_union_pw_aff_get_space(upa
);
7863 umap
= isl_union_map_empty(space
);
7865 if (isl_union_pw_aff_foreach_pw_aff(upa
, &map_from_pw_aff_entry
,
7867 umap
= isl_union_map_free(umap
);
7869 isl_union_pw_aff_free(upa
);
7873 /* Internal data structure for isl_union_pw_aff_pullback_union_pw_multi_aff.
7874 * upma is the function that is plugged in.
7875 * pa is the current part of the function in which upma is plugged in.
7876 * res collects the results.
7878 struct isl_union_pw_aff_pullback_upma_data
{
7879 isl_union_pw_multi_aff
*upma
;
7881 isl_union_pw_aff
*res
;
7884 /* Check if "pma" can be plugged into data->pa.
7885 * If so, perform the pullback and add the result to data->res.
7887 static isl_stat
pa_pb_pma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7889 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7892 if (!isl_space_tuple_is_equal(data
->pa
->dim
, isl_dim_in
,
7893 pma
->dim
, isl_dim_out
)) {
7894 isl_pw_multi_aff_free(pma
);
7898 pa
= isl_pw_aff_copy(data
->pa
);
7899 pa
= isl_pw_aff_pullback_pw_multi_aff(pa
, pma
);
7901 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7903 return data
->res
? isl_stat_ok
: isl_stat_error
;
7906 /* Check if any of the elements of data->upma can be plugged into pa,
7907 * add if so add the result to data->res.
7909 static isl_stat
upa_pb_upma(__isl_take isl_pw_aff
*pa
, void *user
)
7911 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7915 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma
,
7917 isl_pw_aff_free(pa
);
7922 /* Compute the pullback of "upa" by the function represented by "upma".
7923 * In other words, plug in "upma" in "upa". The result contains
7924 * expressions defined over the domain space of "upma".
7926 * Run over all pairs of elements in "upa" and "upma", perform
7927 * the pullback when appropriate and collect the results.
7928 * If the hash value were based on the domain space rather than
7929 * the function space, then we could run through all elements
7930 * of "upma" and directly pick out the corresponding element of "upa".
7932 __isl_give isl_union_pw_aff
*isl_union_pw_aff_pullback_union_pw_multi_aff(
7933 __isl_take isl_union_pw_aff
*upa
,
7934 __isl_take isl_union_pw_multi_aff
*upma
)
7936 struct isl_union_pw_aff_pullback_upma_data data
= { NULL
, NULL
};
7939 space
= isl_union_pw_multi_aff_get_space(upma
);
7940 upa
= isl_union_pw_aff_align_params(upa
, space
);
7941 space
= isl_union_pw_aff_get_space(upa
);
7942 upma
= isl_union_pw_multi_aff_align_params(upma
, space
);
7948 data
.res
= isl_union_pw_aff_alloc_same_size(upa
);
7949 if (isl_union_pw_aff_foreach_pw_aff(upa
, &upa_pb_upma
, &data
) < 0)
7950 data
.res
= isl_union_pw_aff_free(data
.res
);
7952 isl_union_pw_aff_free(upa
);
7953 isl_union_pw_multi_aff_free(upma
);
7956 isl_union_pw_aff_free(upa
);
7957 isl_union_pw_multi_aff_free(upma
);
7962 #define BASE union_pw_aff
7964 #define DOMBASE union_set
7966 #define NO_MOVE_DIMS
7975 #include <isl_multi_templ.c>
7976 #include <isl_multi_apply_set.c>
7977 #include <isl_multi_apply_union_set.c>
7978 #include <isl_multi_coalesce.c>
7979 #include <isl_multi_floor.c>
7980 #include <isl_multi_gist.c>
7981 #include <isl_multi_intersect.c>
7983 /* Construct a multiple union piecewise affine expression
7984 * in the given space with value zero in each of the output dimensions.
7986 * Since there is no canonical zero value for
7987 * a union piecewise affine expression, we can only construct
7988 * zero-dimensional "zero" value.
7990 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_zero(
7991 __isl_take isl_space
*space
)
7996 if (!isl_space_is_set(space
))
7997 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7998 "expecting set space", goto error
);
7999 if (isl_space_dim(space
, isl_dim_out
) != 0)
8000 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
8001 "expecting 0D space", goto error
);
8003 return isl_multi_union_pw_aff_alloc(space
);
8005 isl_space_free(space
);
8009 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
8010 * with the actual sum on the shared domain and
8011 * the defined expression on the symmetric difference of the domains.
8013 * We simply iterate over the elements in both arguments and
8014 * call isl_union_pw_aff_union_add on each of them.
8016 static __isl_give isl_multi_union_pw_aff
*
8017 isl_multi_union_pw_aff_union_add_aligned(
8018 __isl_take isl_multi_union_pw_aff
*mupa1
,
8019 __isl_take isl_multi_union_pw_aff
*mupa2
)
8021 return isl_multi_union_pw_aff_bin_op(mupa1
, mupa2
,
8022 &isl_union_pw_aff_union_add
);
8025 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
8026 * with the actual sum on the shared domain and
8027 * the defined expression on the symmetric difference of the domains.
8029 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_union_add(
8030 __isl_take isl_multi_union_pw_aff
*mupa1
,
8031 __isl_take isl_multi_union_pw_aff
*mupa2
)
8033 return isl_multi_union_pw_aff_align_params_multi_multi_and(mupa1
, mupa2
,
8034 &isl_multi_union_pw_aff_union_add_aligned
);
8037 /* Construct and return a multi union piecewise affine expression
8038 * that is equal to the given multi affine expression.
8040 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_aff(
8041 __isl_take isl_multi_aff
*ma
)
8043 isl_multi_pw_aff
*mpa
;
8045 mpa
= isl_multi_pw_aff_from_multi_aff(ma
);
8046 return isl_multi_union_pw_aff_from_multi_pw_aff(mpa
);
8049 /* Construct and return a multi union piecewise affine expression
8050 * that is equal to the given multi piecewise affine expression.
8052 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_pw_aff(
8053 __isl_take isl_multi_pw_aff
*mpa
)
8057 isl_multi_union_pw_aff
*mupa
;
8062 space
= isl_multi_pw_aff_get_space(mpa
);
8063 space
= isl_space_range(space
);
8064 mupa
= isl_multi_union_pw_aff_alloc(space
);
8066 n
= isl_multi_pw_aff_dim(mpa
, isl_dim_out
);
8067 for (i
= 0; i
< n
; ++i
) {
8069 isl_union_pw_aff
*upa
;
8071 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
8072 upa
= isl_union_pw_aff_from_pw_aff(pa
);
8073 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8076 isl_multi_pw_aff_free(mpa
);
8081 /* Extract the range space of "pma" and assign it to *space.
8082 * If *space has already been set (through a previous call to this function),
8083 * then check that the range space is the same.
8085 static isl_stat
extract_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8087 isl_space
**space
= user
;
8088 isl_space
*pma_space
;
8091 pma_space
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
8092 isl_pw_multi_aff_free(pma
);
8095 return isl_stat_error
;
8101 equal
= isl_space_is_equal(pma_space
, *space
);
8102 isl_space_free(pma_space
);
8105 return isl_stat_error
;
8107 isl_die(isl_space_get_ctx(*space
), isl_error_invalid
,
8108 "range spaces not the same", return isl_stat_error
);
8112 /* Construct and return a multi union piecewise affine expression
8113 * that is equal to the given union piecewise multi affine expression.
8115 * In order to be able to perform the conversion, the input
8116 * needs to be non-empty and may only involve a single range space.
8118 __isl_give isl_multi_union_pw_aff
*
8119 isl_multi_union_pw_aff_from_union_pw_multi_aff(
8120 __isl_take isl_union_pw_multi_aff
*upma
)
8122 isl_space
*space
= NULL
;
8123 isl_multi_union_pw_aff
*mupa
;
8128 if (isl_union_pw_multi_aff_n_pw_multi_aff(upma
) == 0)
8129 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
8130 "cannot extract range space from empty input",
8132 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
, &extract_space
,
8139 n
= isl_space_dim(space
, isl_dim_set
);
8140 mupa
= isl_multi_union_pw_aff_alloc(space
);
8142 for (i
= 0; i
< n
; ++i
) {
8143 isl_union_pw_aff
*upa
;
8145 upa
= isl_union_pw_multi_aff_get_union_pw_aff(upma
, i
);
8146 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8149 isl_union_pw_multi_aff_free(upma
);
8152 isl_space_free(space
);
8153 isl_union_pw_multi_aff_free(upma
);
8157 /* Try and create an isl_multi_union_pw_aff that is equivalent
8158 * to the given isl_union_map.
8159 * The isl_union_map is required to be single-valued in each space.
8160 * Moreover, it cannot be empty and all range spaces need to be the same.
8161 * Otherwise, an error is produced.
8163 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_union_map(
8164 __isl_take isl_union_map
*umap
)
8166 isl_union_pw_multi_aff
*upma
;
8168 upma
= isl_union_pw_multi_aff_from_union_map(umap
);
8169 return isl_multi_union_pw_aff_from_union_pw_multi_aff(upma
);
8172 /* Return a multiple union piecewise affine expression
8173 * that is equal to "mv" on "domain", assuming "domain" and "mv"
8174 * have been aligned.
8176 static __isl_give isl_multi_union_pw_aff
*
8177 isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8178 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8182 isl_multi_union_pw_aff
*mupa
;
8187 n
= isl_multi_val_dim(mv
, isl_dim_set
);
8188 space
= isl_multi_val_get_space(mv
);
8189 mupa
= isl_multi_union_pw_aff_alloc(space
);
8190 for (i
= 0; i
< n
; ++i
) {
8192 isl_union_pw_aff
*upa
;
8194 v
= isl_multi_val_get_val(mv
, i
);
8195 upa
= isl_union_pw_aff_val_on_domain(isl_union_set_copy(domain
),
8197 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8200 isl_union_set_free(domain
);
8201 isl_multi_val_free(mv
);
8204 isl_union_set_free(domain
);
8205 isl_multi_val_free(mv
);
8209 /* Return a multiple union piecewise affine expression
8210 * that is equal to "mv" on "domain".
8212 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_val_on_domain(
8213 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8215 isl_bool equal_params
;
8219 equal_params
= isl_space_has_equal_params(domain
->dim
, mv
->space
);
8220 if (equal_params
< 0)
8223 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8225 domain
= isl_union_set_align_params(domain
,
8226 isl_multi_val_get_space(mv
));
8227 mv
= isl_multi_val_align_params(mv
, isl_union_set_get_space(domain
));
8228 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(domain
, mv
);
8230 isl_union_set_free(domain
);
8231 isl_multi_val_free(mv
);
8235 /* Return a multiple union piecewise affine expression
8236 * that is equal to "ma" on "domain", assuming "domain" and "ma"
8237 * have been aligned.
8239 static __isl_give isl_multi_union_pw_aff
*
8240 isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
8241 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8245 isl_multi_union_pw_aff
*mupa
;
8250 n
= isl_multi_aff_dim(ma
, isl_dim_set
);
8251 space
= isl_multi_aff_get_space(ma
);
8252 mupa
= isl_multi_union_pw_aff_alloc(space
);
8253 for (i
= 0; i
< n
; ++i
) {
8255 isl_union_pw_aff
*upa
;
8257 aff
= isl_multi_aff_get_aff(ma
, i
);
8258 upa
= isl_union_pw_aff_aff_on_domain(isl_union_set_copy(domain
),
8260 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8263 isl_union_set_free(domain
);
8264 isl_multi_aff_free(ma
);
8267 isl_union_set_free(domain
);
8268 isl_multi_aff_free(ma
);
8272 /* Return a multiple union piecewise affine expression
8273 * that is equal to "ma" on "domain".
8275 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_aff_on_domain(
8276 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8278 isl_bool equal_params
;
8282 equal_params
= isl_space_has_equal_params(domain
->dim
, ma
->space
);
8283 if (equal_params
< 0)
8286 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
8288 domain
= isl_union_set_align_params(domain
,
8289 isl_multi_aff_get_space(ma
));
8290 ma
= isl_multi_aff_align_params(ma
, isl_union_set_get_space(domain
));
8291 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(domain
, ma
);
8293 isl_union_set_free(domain
);
8294 isl_multi_aff_free(ma
);
8298 /* Return a union set containing those elements in the domains
8299 * of the elements of "mupa" where they are all zero.
8301 __isl_give isl_union_set
*isl_multi_union_pw_aff_zero_union_set(
8302 __isl_take isl_multi_union_pw_aff
*mupa
)
8305 isl_union_pw_aff
*upa
;
8306 isl_union_set
*zero
;
8311 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8313 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8314 "cannot determine zero set "
8315 "of zero-dimensional function", goto error
);
8317 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8318 zero
= isl_union_pw_aff_zero_union_set(upa
);
8320 for (i
= 1; i
< n
; ++i
) {
8321 isl_union_set
*zero_i
;
8323 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8324 zero_i
= isl_union_pw_aff_zero_union_set(upa
);
8326 zero
= isl_union_set_intersect(zero
, zero_i
);
8329 isl_multi_union_pw_aff_free(mupa
);
8332 isl_multi_union_pw_aff_free(mupa
);
8336 /* Construct a union map mapping the shared domain
8337 * of the union piecewise affine expressions to the range of "mupa"
8338 * with each dimension in the range equated to the
8339 * corresponding union piecewise affine expression.
8341 * The input cannot be zero-dimensional as there is
8342 * no way to extract a domain from a zero-dimensional isl_multi_union_pw_aff.
8344 __isl_give isl_union_map
*isl_union_map_from_multi_union_pw_aff(
8345 __isl_take isl_multi_union_pw_aff
*mupa
)
8349 isl_union_map
*umap
;
8350 isl_union_pw_aff
*upa
;
8355 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8357 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8358 "cannot determine domain of zero-dimensional "
8359 "isl_multi_union_pw_aff", goto error
);
8361 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8362 umap
= isl_union_map_from_union_pw_aff(upa
);
8364 for (i
= 1; i
< n
; ++i
) {
8365 isl_union_map
*umap_i
;
8367 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8368 umap_i
= isl_union_map_from_union_pw_aff(upa
);
8369 umap
= isl_union_map_flat_range_product(umap
, umap_i
);
8372 space
= isl_multi_union_pw_aff_get_space(mupa
);
8373 umap
= isl_union_map_reset_range_space(umap
, space
);
8375 isl_multi_union_pw_aff_free(mupa
);
8378 isl_multi_union_pw_aff_free(mupa
);
8382 /* Internal data structure for isl_union_pw_multi_aff_reset_range_space.
8383 * "range" is the space from which to set the range space.
8384 * "res" collects the results.
8386 struct isl_union_pw_multi_aff_reset_range_space_data
{
8388 isl_union_pw_multi_aff
*res
;
8391 /* Replace the range space of "pma" by the range space of data->range and
8392 * add the result to data->res.
8394 static isl_stat
reset_range_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8396 struct isl_union_pw_multi_aff_reset_range_space_data
*data
= user
;
8399 space
= isl_pw_multi_aff_get_space(pma
);
8400 space
= isl_space_domain(space
);
8401 space
= isl_space_extend_domain_with_range(space
,
8402 isl_space_copy(data
->range
));
8403 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
8404 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
8406 return data
->res
? isl_stat_ok
: isl_stat_error
;
8409 /* Replace the range space of all the piecewise affine expressions in "upma" by
8410 * the range space of "space".
8412 * This assumes that all these expressions have the same output dimension.
8414 * Since the spaces of the expressions change, so do their hash values.
8415 * We therefore need to create a new isl_union_pw_multi_aff.
8416 * Note that the hash value is currently computed based on the entire
8417 * space even though there can only be a single expression with a given
8420 static __isl_give isl_union_pw_multi_aff
*
8421 isl_union_pw_multi_aff_reset_range_space(
8422 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_space
*space
)
8424 struct isl_union_pw_multi_aff_reset_range_space_data data
= { space
};
8425 isl_space
*space_upma
;
8427 space_upma
= isl_union_pw_multi_aff_get_space(upma
);
8428 data
.res
= isl_union_pw_multi_aff_empty(space_upma
);
8429 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
8430 &reset_range_space
, &data
) < 0)
8431 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
8433 isl_space_free(space
);
8434 isl_union_pw_multi_aff_free(upma
);
8438 /* Construct and return a union piecewise multi affine expression
8439 * that is equal to the given multi union piecewise affine expression.
8441 * In order to be able to perform the conversion, the input
8442 * needs to have a least one output dimension.
8444 __isl_give isl_union_pw_multi_aff
*
8445 isl_union_pw_multi_aff_from_multi_union_pw_aff(
8446 __isl_take isl_multi_union_pw_aff
*mupa
)
8450 isl_union_pw_multi_aff
*upma
;
8451 isl_union_pw_aff
*upa
;
8456 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8458 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8459 "cannot determine domain of zero-dimensional "
8460 "isl_multi_union_pw_aff", goto error
);
8462 space
= isl_multi_union_pw_aff_get_space(mupa
);
8463 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8464 upma
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8466 for (i
= 1; i
< n
; ++i
) {
8467 isl_union_pw_multi_aff
*upma_i
;
8469 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8470 upma_i
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8471 upma
= isl_union_pw_multi_aff_flat_range_product(upma
, upma_i
);
8474 upma
= isl_union_pw_multi_aff_reset_range_space(upma
, space
);
8476 isl_multi_union_pw_aff_free(mupa
);
8479 isl_multi_union_pw_aff_free(mupa
);
8483 /* Intersect the range of "mupa" with "range".
8484 * That is, keep only those domain elements that have a function value
8487 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_intersect_range(
8488 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_set
*range
)
8490 isl_union_pw_multi_aff
*upma
;
8491 isl_union_set
*domain
;
8496 if (!mupa
|| !range
)
8499 space
= isl_set_get_space(range
);
8500 match
= isl_space_tuple_is_equal(mupa
->space
, isl_dim_set
,
8501 space
, isl_dim_set
);
8502 isl_space_free(space
);
8506 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8507 "space don't match", goto error
);
8508 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8510 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8511 "cannot intersect range of zero-dimensional "
8512 "isl_multi_union_pw_aff", goto error
);
8514 upma
= isl_union_pw_multi_aff_from_multi_union_pw_aff(
8515 isl_multi_union_pw_aff_copy(mupa
));
8516 domain
= isl_union_set_from_set(range
);
8517 domain
= isl_union_set_preimage_union_pw_multi_aff(domain
, upma
);
8518 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, domain
);
8522 isl_multi_union_pw_aff_free(mupa
);
8523 isl_set_free(range
);
8527 /* Return the shared domain of the elements of "mupa".
8529 __isl_give isl_union_set
*isl_multi_union_pw_aff_domain(
8530 __isl_take isl_multi_union_pw_aff
*mupa
)
8533 isl_union_pw_aff
*upa
;
8539 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8541 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8542 "cannot determine domain", goto error
);
8544 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8545 dom
= isl_union_pw_aff_domain(upa
);
8546 for (i
= 1; i
< n
; ++i
) {
8547 isl_union_set
*dom_i
;
8549 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8550 dom_i
= isl_union_pw_aff_domain(upa
);
8551 dom
= isl_union_set_intersect(dom
, dom_i
);
8554 isl_multi_union_pw_aff_free(mupa
);
8557 isl_multi_union_pw_aff_free(mupa
);
8561 /* Apply "aff" to "mupa". The space of "mupa" is equal to the domain of "aff".
8562 * In particular, the spaces have been aligned.
8563 * The result is defined over the shared domain of the elements of "mupa"
8565 * We first extract the parametric constant part of "aff" and
8566 * define that over the shared domain.
8567 * Then we iterate over all input dimensions of "aff" and add the corresponding
8568 * multiples of the elements of "mupa".
8569 * Finally, we consider the integer divisions, calling the function
8570 * recursively to obtain an isl_union_pw_aff corresponding to the
8571 * integer division argument.
8573 static __isl_give isl_union_pw_aff
*multi_union_pw_aff_apply_aff(
8574 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8577 isl_union_pw_aff
*upa
;
8578 isl_union_set
*uset
;
8582 n_in
= isl_aff_dim(aff
, isl_dim_in
);
8583 n_div
= isl_aff_dim(aff
, isl_dim_div
);
8585 uset
= isl_multi_union_pw_aff_domain(isl_multi_union_pw_aff_copy(mupa
));
8586 cst
= isl_aff_copy(aff
);
8587 cst
= isl_aff_drop_dims(cst
, isl_dim_div
, 0, n_div
);
8588 cst
= isl_aff_drop_dims(cst
, isl_dim_in
, 0, n_in
);
8589 cst
= isl_aff_project_domain_on_params(cst
);
8590 upa
= isl_union_pw_aff_aff_on_domain(uset
, cst
);
8592 for (i
= 0; i
< n_in
; ++i
) {
8593 isl_union_pw_aff
*upa_i
;
8595 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
8597 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
8598 upa_i
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8599 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8600 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8603 for (i
= 0; i
< n_div
; ++i
) {
8605 isl_union_pw_aff
*upa_i
;
8607 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
8609 div
= isl_aff_get_div(aff
, i
);
8610 upa_i
= multi_union_pw_aff_apply_aff(
8611 isl_multi_union_pw_aff_copy(mupa
), div
);
8612 upa_i
= isl_union_pw_aff_floor(upa_i
);
8613 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
8614 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8615 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8618 isl_multi_union_pw_aff_free(mupa
);
8624 /* Apply "aff" to "mupa". The space of "mupa" needs to be compatible
8625 * with the domain of "aff".
8626 * Furthermore, the dimension of this space needs to be greater than zero.
8627 * The result is defined over the shared domain of the elements of "mupa"
8629 * We perform these checks and then hand over control to
8630 * multi_union_pw_aff_apply_aff.
8632 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_aff(
8633 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8635 isl_space
*space1
, *space2
;
8638 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8639 isl_aff_get_space(aff
));
8640 aff
= isl_aff_align_params(aff
, isl_multi_union_pw_aff_get_space(mupa
));
8644 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8645 space2
= isl_aff_get_domain_space(aff
);
8646 equal
= isl_space_is_equal(space1
, space2
);
8647 isl_space_free(space1
);
8648 isl_space_free(space2
);
8652 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8653 "spaces don't match", goto error
);
8654 if (isl_aff_dim(aff
, isl_dim_in
) == 0)
8655 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8656 "cannot determine domains", goto error
);
8658 return multi_union_pw_aff_apply_aff(mupa
, aff
);
8660 isl_multi_union_pw_aff_free(mupa
);
8665 /* Apply "ma" to "mupa". The space of "mupa" needs to be compatible
8666 * with the domain of "ma".
8667 * Furthermore, the dimension of this space needs to be greater than zero,
8668 * unless the dimension of the target space of "ma" is also zero.
8669 * The result is defined over the shared domain of the elements of "mupa"
8671 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_multi_aff(
8672 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_multi_aff
*ma
)
8674 isl_space
*space1
, *space2
;
8675 isl_multi_union_pw_aff
*res
;
8679 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8680 isl_multi_aff_get_space(ma
));
8681 ma
= isl_multi_aff_align_params(ma
,
8682 isl_multi_union_pw_aff_get_space(mupa
));
8686 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8687 space2
= isl_multi_aff_get_domain_space(ma
);
8688 equal
= isl_space_is_equal(space1
, space2
);
8689 isl_space_free(space1
);
8690 isl_space_free(space2
);
8694 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8695 "spaces don't match", goto error
);
8696 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
8697 if (isl_multi_aff_dim(ma
, isl_dim_in
) == 0 && n_out
!= 0)
8698 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8699 "cannot determine domains", goto error
);
8701 space1
= isl_space_range(isl_multi_aff_get_space(ma
));
8702 res
= isl_multi_union_pw_aff_alloc(space1
);
8704 for (i
= 0; i
< n_out
; ++i
) {
8706 isl_union_pw_aff
*upa
;
8708 aff
= isl_multi_aff_get_aff(ma
, i
);
8709 upa
= multi_union_pw_aff_apply_aff(
8710 isl_multi_union_pw_aff_copy(mupa
), aff
);
8711 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8714 isl_multi_aff_free(ma
);
8715 isl_multi_union_pw_aff_free(mupa
);
8718 isl_multi_union_pw_aff_free(mupa
);
8719 isl_multi_aff_free(ma
);
8723 /* Apply "pa" to "mupa". The space of "mupa" needs to be compatible
8724 * with the domain of "pa".
8725 * Furthermore, the dimension of this space needs to be greater than zero.
8726 * The result is defined over the shared domain of the elements of "mupa"
8728 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_aff(
8729 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_pw_aff
*pa
)
8733 isl_space
*space
, *space2
;
8734 isl_union_pw_aff
*upa
;
8736 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8737 isl_pw_aff_get_space(pa
));
8738 pa
= isl_pw_aff_align_params(pa
,
8739 isl_multi_union_pw_aff_get_space(mupa
));
8743 space
= isl_multi_union_pw_aff_get_space(mupa
);
8744 space2
= isl_pw_aff_get_domain_space(pa
);
8745 equal
= isl_space_is_equal(space
, space2
);
8746 isl_space_free(space
);
8747 isl_space_free(space2
);
8751 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8752 "spaces don't match", goto error
);
8753 if (isl_pw_aff_dim(pa
, isl_dim_in
) == 0)
8754 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8755 "cannot determine domains", goto error
);
8757 space
= isl_space_params(isl_multi_union_pw_aff_get_space(mupa
));
8758 upa
= isl_union_pw_aff_empty(space
);
8760 for (i
= 0; i
< pa
->n
; ++i
) {
8763 isl_multi_union_pw_aff
*mupa_i
;
8764 isl_union_pw_aff
*upa_i
;
8766 mupa_i
= isl_multi_union_pw_aff_copy(mupa
);
8767 domain
= isl_set_copy(pa
->p
[i
].set
);
8768 mupa_i
= isl_multi_union_pw_aff_intersect_range(mupa_i
, domain
);
8769 aff
= isl_aff_copy(pa
->p
[i
].aff
);
8770 upa_i
= multi_union_pw_aff_apply_aff(mupa_i
, aff
);
8771 upa
= isl_union_pw_aff_union_add(upa
, upa_i
);
8774 isl_multi_union_pw_aff_free(mupa
);
8775 isl_pw_aff_free(pa
);
8778 isl_multi_union_pw_aff_free(mupa
);
8779 isl_pw_aff_free(pa
);
8783 /* Apply "pma" to "mupa". The space of "mupa" needs to be compatible
8784 * with the domain of "pma".
8785 * Furthermore, the dimension of this space needs to be greater than zero,
8786 * unless the dimension of the target space of "pma" is also zero.
8787 * The result is defined over the shared domain of the elements of "mupa"
8789 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_multi_aff(
8790 __isl_take isl_multi_union_pw_aff
*mupa
,
8791 __isl_take isl_pw_multi_aff
*pma
)
8793 isl_space
*space1
, *space2
;
8794 isl_multi_union_pw_aff
*res
;
8798 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8799 isl_pw_multi_aff_get_space(pma
));
8800 pma
= isl_pw_multi_aff_align_params(pma
,
8801 isl_multi_union_pw_aff_get_space(mupa
));
8805 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8806 space2
= isl_pw_multi_aff_get_domain_space(pma
);
8807 equal
= isl_space_is_equal(space1
, space2
);
8808 isl_space_free(space1
);
8809 isl_space_free(space2
);
8813 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8814 "spaces don't match", goto error
);
8815 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
8816 if (isl_pw_multi_aff_dim(pma
, isl_dim_in
) == 0 && n_out
!= 0)
8817 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8818 "cannot determine domains", goto error
);
8820 space1
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
8821 res
= isl_multi_union_pw_aff_alloc(space1
);
8823 for (i
= 0; i
< n_out
; ++i
) {
8825 isl_union_pw_aff
*upa
;
8827 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
8828 upa
= isl_multi_union_pw_aff_apply_pw_aff(
8829 isl_multi_union_pw_aff_copy(mupa
), pa
);
8830 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8833 isl_pw_multi_aff_free(pma
);
8834 isl_multi_union_pw_aff_free(mupa
);
8837 isl_multi_union_pw_aff_free(mupa
);
8838 isl_pw_multi_aff_free(pma
);
8842 /* Compute the pullback of "mupa" by the function represented by "upma".
8843 * In other words, plug in "upma" in "mupa". The result contains
8844 * expressions defined over the domain space of "upma".
8846 * Run over all elements of "mupa" and plug in "upma" in each of them.
8848 __isl_give isl_multi_union_pw_aff
*
8849 isl_multi_union_pw_aff_pullback_union_pw_multi_aff(
8850 __isl_take isl_multi_union_pw_aff
*mupa
,
8851 __isl_take isl_union_pw_multi_aff
*upma
)
8855 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8856 isl_union_pw_multi_aff_get_space(upma
));
8857 upma
= isl_union_pw_multi_aff_align_params(upma
,
8858 isl_multi_union_pw_aff_get_space(mupa
));
8862 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8863 for (i
= 0; i
< n
; ++i
) {
8864 isl_union_pw_aff
*upa
;
8866 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8867 upa
= isl_union_pw_aff_pullback_union_pw_multi_aff(upa
,
8868 isl_union_pw_multi_aff_copy(upma
));
8869 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8872 isl_union_pw_multi_aff_free(upma
);
8875 isl_multi_union_pw_aff_free(mupa
);
8876 isl_union_pw_multi_aff_free(upma
);
8880 /* Extract the sequence of elements in "mupa" with domain space "space"
8881 * (ignoring parameters).
8883 * For the elements of "mupa" that are not defined on the specified space,
8884 * the corresponding element in the result is empty.
8886 __isl_give isl_multi_pw_aff
*isl_multi_union_pw_aff_extract_multi_pw_aff(
8887 __isl_keep isl_multi_union_pw_aff
*mupa
, __isl_take isl_space
*space
)
8890 isl_bool equal_params
;
8891 isl_space
*space_mpa
= NULL
;
8892 isl_multi_pw_aff
*mpa
;
8894 if (!mupa
|| !space
)
8897 space_mpa
= isl_multi_union_pw_aff_get_space(mupa
);
8898 equal_params
= isl_space_has_equal_params(space_mpa
, space
);
8899 if (equal_params
< 0)
8901 if (!equal_params
) {
8902 space
= isl_space_drop_dims(space
, isl_dim_param
,
8903 0, isl_space_dim(space
, isl_dim_param
));
8904 space
= isl_space_align_params(space
,
8905 isl_space_copy(space_mpa
));
8909 space_mpa
= isl_space_map_from_domain_and_range(isl_space_copy(space
),
8911 mpa
= isl_multi_pw_aff_alloc(space_mpa
);
8913 space
= isl_space_from_domain(space
);
8914 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
8915 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8916 for (i
= 0; i
< n
; ++i
) {
8917 isl_union_pw_aff
*upa
;
8920 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8921 pa
= isl_union_pw_aff_extract_pw_aff(upa
,
8922 isl_space_copy(space
));
8923 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
8924 isl_union_pw_aff_free(upa
);
8927 isl_space_free(space
);
8930 isl_space_free(space_mpa
);
8931 isl_space_free(space
);