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 /* Externally, an isl_aff has a map space, but internally, the
279 * ls field corresponds to the domain of that space.
281 int isl_aff_dim(__isl_keep isl_aff
*aff
, enum isl_dim_type type
)
285 if (type
== isl_dim_out
)
287 if (type
== isl_dim_in
)
289 return isl_local_space_dim(aff
->ls
, type
);
292 /* Return the position of the dimension of the given type and name
294 * Return -1 if no such dimension can be found.
296 int isl_aff_find_dim_by_name(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
301 if (type
== isl_dim_out
)
303 if (type
== isl_dim_in
)
305 return isl_local_space_find_dim_by_name(aff
->ls
, type
, name
);
308 __isl_give isl_space
*isl_aff_get_domain_space(__isl_keep isl_aff
*aff
)
310 return aff
? isl_local_space_get_space(aff
->ls
) : NULL
;
313 __isl_give isl_space
*isl_aff_get_space(__isl_keep isl_aff
*aff
)
318 space
= isl_local_space_get_space(aff
->ls
);
319 space
= isl_space_from_domain(space
);
320 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
324 __isl_give isl_local_space
*isl_aff_get_domain_local_space(
325 __isl_keep isl_aff
*aff
)
327 return aff
? isl_local_space_copy(aff
->ls
) : NULL
;
330 __isl_give isl_local_space
*isl_aff_get_local_space(__isl_keep isl_aff
*aff
)
335 ls
= isl_local_space_copy(aff
->ls
);
336 ls
= isl_local_space_from_domain(ls
);
337 ls
= isl_local_space_add_dims(ls
, isl_dim_out
, 1);
341 /* Externally, an isl_aff has a map space, but internally, the
342 * ls field corresponds to the domain of that space.
344 const char *isl_aff_get_dim_name(__isl_keep isl_aff
*aff
,
345 enum isl_dim_type type
, unsigned pos
)
349 if (type
== isl_dim_out
)
351 if (type
== isl_dim_in
)
353 return isl_local_space_get_dim_name(aff
->ls
, type
, pos
);
356 __isl_give isl_aff
*isl_aff_reset_domain_space(__isl_take isl_aff
*aff
,
357 __isl_take isl_space
*dim
)
359 aff
= isl_aff_cow(aff
);
363 aff
->ls
= isl_local_space_reset_space(aff
->ls
, dim
);
365 return isl_aff_free(aff
);
374 /* Reset the space of "aff". This function is called from isl_pw_templ.c
375 * and doesn't know if the space of an element object is represented
376 * directly or through its domain. It therefore passes along both.
378 __isl_give isl_aff
*isl_aff_reset_space_and_domain(__isl_take isl_aff
*aff
,
379 __isl_take isl_space
*space
, __isl_take isl_space
*domain
)
381 isl_space_free(space
);
382 return isl_aff_reset_domain_space(aff
, domain
);
385 /* Reorder the coefficients of the affine expression based
386 * on the given reodering.
387 * The reordering r is assumed to have been extended with the local
390 static __isl_give isl_vec
*vec_reorder(__isl_take isl_vec
*vec
,
391 __isl_take isl_reordering
*r
, int n_div
)
399 res
= isl_vec_alloc(vec
->ctx
,
400 2 + isl_space_dim(r
->dim
, isl_dim_all
) + n_div
);
401 isl_seq_cpy(res
->el
, vec
->el
, 2);
402 isl_seq_clr(res
->el
+ 2, res
->size
- 2);
403 for (i
= 0; i
< r
->len
; ++i
)
404 isl_int_set(res
->el
[2 + r
->pos
[i
]], vec
->el
[2 + i
]);
406 isl_reordering_free(r
);
411 isl_reordering_free(r
);
415 /* Reorder the dimensions of the domain of "aff" according
416 * to the given reordering.
418 __isl_give isl_aff
*isl_aff_realign_domain(__isl_take isl_aff
*aff
,
419 __isl_take isl_reordering
*r
)
421 aff
= isl_aff_cow(aff
);
425 r
= isl_reordering_extend(r
, aff
->ls
->div
->n_row
);
426 aff
->v
= vec_reorder(aff
->v
, isl_reordering_copy(r
),
427 aff
->ls
->div
->n_row
);
428 aff
->ls
= isl_local_space_realign(aff
->ls
, r
);
430 if (!aff
->v
|| !aff
->ls
)
431 return isl_aff_free(aff
);
436 isl_reordering_free(r
);
440 __isl_give isl_aff
*isl_aff_align_params(__isl_take isl_aff
*aff
,
441 __isl_take isl_space
*model
)
446 if (!isl_space_match(aff
->ls
->dim
, isl_dim_param
,
447 model
, isl_dim_param
)) {
450 model
= isl_space_drop_dims(model
, isl_dim_in
,
451 0, isl_space_dim(model
, isl_dim_in
));
452 model
= isl_space_drop_dims(model
, isl_dim_out
,
453 0, isl_space_dim(model
, isl_dim_out
));
454 exp
= isl_parameter_alignment_reordering(aff
->ls
->dim
, model
);
455 exp
= isl_reordering_extend_space(exp
,
456 isl_aff_get_domain_space(aff
));
457 aff
= isl_aff_realign_domain(aff
, exp
);
460 isl_space_free(model
);
463 isl_space_free(model
);
468 /* Is "aff" obviously equal to zero?
470 * If the denominator is zero, then "aff" is not equal to zero.
472 isl_bool
isl_aff_plain_is_zero(__isl_keep isl_aff
*aff
)
475 return isl_bool_error
;
477 if (isl_int_is_zero(aff
->v
->el
[0]))
478 return isl_bool_false
;
479 return isl_seq_first_non_zero(aff
->v
->el
+ 1, aff
->v
->size
- 1) < 0;
482 /* Does "aff" represent NaN?
484 isl_bool
isl_aff_is_nan(__isl_keep isl_aff
*aff
)
487 return isl_bool_error
;
489 return isl_seq_first_non_zero(aff
->v
->el
, 2) < 0;
492 /* Does "pa" involve any NaNs?
494 isl_bool
isl_pw_aff_involves_nan(__isl_keep isl_pw_aff
*pa
)
499 return isl_bool_error
;
501 return isl_bool_false
;
503 for (i
= 0; i
< pa
->n
; ++i
) {
504 isl_bool is_nan
= isl_aff_is_nan(pa
->p
[i
].aff
);
505 if (is_nan
< 0 || is_nan
)
509 return isl_bool_false
;
512 /* Are "aff1" and "aff2" obviously equal?
514 * NaN is not equal to anything, not even to another NaN.
516 isl_bool
isl_aff_plain_is_equal(__isl_keep isl_aff
*aff1
,
517 __isl_keep isl_aff
*aff2
)
522 return isl_bool_error
;
524 if (isl_aff_is_nan(aff1
) || isl_aff_is_nan(aff2
))
525 return isl_bool_false
;
527 equal
= isl_local_space_is_equal(aff1
->ls
, aff2
->ls
);
528 if (equal
< 0 || !equal
)
531 return isl_vec_is_equal(aff1
->v
, aff2
->v
);
534 /* Return the common denominator of "aff" in "v".
536 * We cannot return anything meaningful in case of a NaN.
538 int isl_aff_get_denominator(__isl_keep isl_aff
*aff
, isl_int
*v
)
542 if (isl_aff_is_nan(aff
))
543 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
544 "cannot get denominator of NaN", return -1);
545 isl_int_set(*v
, aff
->v
->el
[0]);
549 /* Return the common denominator of "aff".
551 __isl_give isl_val
*isl_aff_get_denominator_val(__isl_keep isl_aff
*aff
)
558 ctx
= isl_aff_get_ctx(aff
);
559 if (isl_aff_is_nan(aff
))
560 return isl_val_nan(ctx
);
561 return isl_val_int_from_isl_int(ctx
, aff
->v
->el
[0]);
564 /* Return the constant term of "aff" in "v".
566 * We cannot return anything meaningful in case of a NaN.
568 int isl_aff_get_constant(__isl_keep isl_aff
*aff
, isl_int
*v
)
572 if (isl_aff_is_nan(aff
))
573 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
574 "cannot get constant term of NaN", return -1);
575 isl_int_set(*v
, aff
->v
->el
[1]);
579 /* Return the constant term of "aff".
581 __isl_give isl_val
*isl_aff_get_constant_val(__isl_keep isl_aff
*aff
)
589 ctx
= isl_aff_get_ctx(aff
);
590 if (isl_aff_is_nan(aff
))
591 return isl_val_nan(ctx
);
592 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1], aff
->v
->el
[0]);
593 return isl_val_normalize(v
);
596 /* Return the coefficient of the variable of type "type" at position "pos"
599 * We cannot return anything meaningful in case of a NaN.
601 int isl_aff_get_coefficient(__isl_keep isl_aff
*aff
,
602 enum isl_dim_type type
, int pos
, isl_int
*v
)
607 if (type
== isl_dim_out
)
608 isl_die(aff
->v
->ctx
, isl_error_invalid
,
609 "output/set dimension does not have a coefficient",
611 if (type
== isl_dim_in
)
614 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
615 isl_die(aff
->v
->ctx
, isl_error_invalid
,
616 "position out of bounds", return -1);
618 if (isl_aff_is_nan(aff
))
619 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
620 "cannot get coefficient of NaN", return -1);
621 pos
+= isl_local_space_offset(aff
->ls
, type
);
622 isl_int_set(*v
, aff
->v
->el
[1 + pos
]);
627 /* Return the coefficient of the variable of type "type" at position "pos"
630 __isl_give isl_val
*isl_aff_get_coefficient_val(__isl_keep isl_aff
*aff
,
631 enum isl_dim_type type
, int pos
)
639 ctx
= isl_aff_get_ctx(aff
);
640 if (type
== isl_dim_out
)
641 isl_die(ctx
, isl_error_invalid
,
642 "output/set dimension does not have a coefficient",
644 if (type
== isl_dim_in
)
647 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
648 isl_die(ctx
, isl_error_invalid
,
649 "position out of bounds", return NULL
);
651 if (isl_aff_is_nan(aff
))
652 return isl_val_nan(ctx
);
653 pos
+= isl_local_space_offset(aff
->ls
, type
);
654 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1 + pos
], aff
->v
->el
[0]);
655 return isl_val_normalize(v
);
658 /* Return the sign of the coefficient of the variable of type "type"
659 * at position "pos" of "aff".
661 int isl_aff_coefficient_sgn(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
669 ctx
= isl_aff_get_ctx(aff
);
670 if (type
== isl_dim_out
)
671 isl_die(ctx
, isl_error_invalid
,
672 "output/set dimension does not have a coefficient",
674 if (type
== isl_dim_in
)
677 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
678 isl_die(ctx
, isl_error_invalid
,
679 "position out of bounds", return 0);
681 pos
+= isl_local_space_offset(aff
->ls
, type
);
682 return isl_int_sgn(aff
->v
->el
[1 + pos
]);
685 /* Replace the denominator of "aff" by "v".
687 * A NaN is unaffected by this operation.
689 __isl_give isl_aff
*isl_aff_set_denominator(__isl_take isl_aff
*aff
, isl_int v
)
693 if (isl_aff_is_nan(aff
))
695 aff
= isl_aff_cow(aff
);
699 aff
->v
= isl_vec_cow(aff
->v
);
701 return isl_aff_free(aff
);
703 isl_int_set(aff
->v
->el
[0], v
);
708 /* Replace the numerator of the constant term of "aff" by "v".
710 * A NaN is unaffected by this operation.
712 __isl_give isl_aff
*isl_aff_set_constant(__isl_take isl_aff
*aff
, isl_int v
)
716 if (isl_aff_is_nan(aff
))
718 aff
= isl_aff_cow(aff
);
722 aff
->v
= isl_vec_cow(aff
->v
);
724 return isl_aff_free(aff
);
726 isl_int_set(aff
->v
->el
[1], v
);
731 /* Replace the constant term of "aff" by "v".
733 * A NaN is unaffected by this operation.
735 __isl_give isl_aff
*isl_aff_set_constant_val(__isl_take isl_aff
*aff
,
736 __isl_take isl_val
*v
)
741 if (isl_aff_is_nan(aff
)) {
746 if (!isl_val_is_rat(v
))
747 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
748 "expecting rational value", goto error
);
750 if (isl_int_eq(aff
->v
->el
[1], v
->n
) &&
751 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
756 aff
= isl_aff_cow(aff
);
759 aff
->v
= isl_vec_cow(aff
->v
);
763 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
764 isl_int_set(aff
->v
->el
[1], v
->n
);
765 } else if (isl_int_is_one(v
->d
)) {
766 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
768 isl_seq_scale(aff
->v
->el
+ 1,
769 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
770 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
771 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
772 aff
->v
= isl_vec_normalize(aff
->v
);
785 /* Add "v" to the constant term of "aff".
787 * A NaN is unaffected by this operation.
789 __isl_give isl_aff
*isl_aff_add_constant(__isl_take isl_aff
*aff
, isl_int v
)
791 if (isl_int_is_zero(v
))
796 if (isl_aff_is_nan(aff
))
798 aff
= isl_aff_cow(aff
);
802 aff
->v
= isl_vec_cow(aff
->v
);
804 return isl_aff_free(aff
);
806 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
);
811 /* Add "v" to the constant term of "aff".
813 * A NaN is unaffected by this operation.
815 __isl_give isl_aff
*isl_aff_add_constant_val(__isl_take isl_aff
*aff
,
816 __isl_take isl_val
*v
)
821 if (isl_aff_is_nan(aff
) || isl_val_is_zero(v
)) {
826 if (!isl_val_is_rat(v
))
827 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
828 "expecting rational value", goto error
);
830 aff
= isl_aff_cow(aff
);
834 aff
->v
= isl_vec_cow(aff
->v
);
838 if (isl_int_is_one(v
->d
)) {
839 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
840 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
841 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
->n
);
842 aff
->v
= isl_vec_normalize(aff
->v
);
846 isl_seq_scale(aff
->v
->el
+ 1,
847 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
848 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
849 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
850 aff
->v
= isl_vec_normalize(aff
->v
);
863 __isl_give isl_aff
*isl_aff_add_constant_si(__isl_take isl_aff
*aff
, int v
)
868 isl_int_set_si(t
, v
);
869 aff
= isl_aff_add_constant(aff
, t
);
875 /* Add "v" to the numerator of the constant term of "aff".
877 * A NaN is unaffected by this operation.
879 __isl_give isl_aff
*isl_aff_add_constant_num(__isl_take isl_aff
*aff
, isl_int v
)
881 if (isl_int_is_zero(v
))
886 if (isl_aff_is_nan(aff
))
888 aff
= isl_aff_cow(aff
);
892 aff
->v
= isl_vec_cow(aff
->v
);
894 return isl_aff_free(aff
);
896 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
);
901 /* Add "v" to the numerator of the constant term of "aff".
903 * A NaN is unaffected by this operation.
905 __isl_give isl_aff
*isl_aff_add_constant_num_si(__isl_take isl_aff
*aff
, int v
)
913 isl_int_set_si(t
, v
);
914 aff
= isl_aff_add_constant_num(aff
, t
);
920 /* Replace the numerator of the constant term of "aff" by "v".
922 * A NaN is unaffected by this operation.
924 __isl_give isl_aff
*isl_aff_set_constant_si(__isl_take isl_aff
*aff
, int v
)
928 if (isl_aff_is_nan(aff
))
930 aff
= isl_aff_cow(aff
);
934 aff
->v
= isl_vec_cow(aff
->v
);
936 return isl_aff_free(aff
);
938 isl_int_set_si(aff
->v
->el
[1], v
);
943 /* Replace the numerator of the coefficient of the variable of type "type"
944 * at position "pos" of "aff" by "v".
946 * A NaN is unaffected by this operation.
948 __isl_give isl_aff
*isl_aff_set_coefficient(__isl_take isl_aff
*aff
,
949 enum isl_dim_type type
, int pos
, isl_int v
)
954 if (type
== isl_dim_out
)
955 isl_die(aff
->v
->ctx
, isl_error_invalid
,
956 "output/set dimension does not have a coefficient",
957 return isl_aff_free(aff
));
958 if (type
== isl_dim_in
)
961 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
962 isl_die(aff
->v
->ctx
, isl_error_invalid
,
963 "position out of bounds", return isl_aff_free(aff
));
965 if (isl_aff_is_nan(aff
))
967 aff
= isl_aff_cow(aff
);
971 aff
->v
= isl_vec_cow(aff
->v
);
973 return isl_aff_free(aff
);
975 pos
+= isl_local_space_offset(aff
->ls
, type
);
976 isl_int_set(aff
->v
->el
[1 + pos
], v
);
981 /* Replace the numerator of the coefficient of the variable of type "type"
982 * at position "pos" of "aff" by "v".
984 * A NaN is unaffected by this operation.
986 __isl_give isl_aff
*isl_aff_set_coefficient_si(__isl_take isl_aff
*aff
,
987 enum isl_dim_type type
, int pos
, int v
)
992 if (type
== isl_dim_out
)
993 isl_die(aff
->v
->ctx
, isl_error_invalid
,
994 "output/set dimension does not have a coefficient",
995 return isl_aff_free(aff
));
996 if (type
== isl_dim_in
)
999 if (pos
< 0 || pos
>= isl_local_space_dim(aff
->ls
, type
))
1000 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1001 "position out of bounds", return isl_aff_free(aff
));
1003 if (isl_aff_is_nan(aff
))
1005 pos
+= isl_local_space_offset(aff
->ls
, type
);
1006 if (isl_int_cmp_si(aff
->v
->el
[1 + pos
], v
) == 0)
1009 aff
= isl_aff_cow(aff
);
1013 aff
->v
= isl_vec_cow(aff
->v
);
1015 return isl_aff_free(aff
);
1017 isl_int_set_si(aff
->v
->el
[1 + pos
], v
);
1022 /* Replace the coefficient of the variable of type "type" at position "pos"
1025 * A NaN is unaffected by this operation.
1027 __isl_give isl_aff
*isl_aff_set_coefficient_val(__isl_take isl_aff
*aff
,
1028 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1033 if (type
== isl_dim_out
)
1034 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1035 "output/set dimension does not have a coefficient",
1037 if (type
== isl_dim_in
)
1040 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1041 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1042 "position out of bounds", goto error
);
1044 if (isl_aff_is_nan(aff
)) {
1048 if (!isl_val_is_rat(v
))
1049 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1050 "expecting rational value", goto error
);
1052 pos
+= isl_local_space_offset(aff
->ls
, type
);
1053 if (isl_int_eq(aff
->v
->el
[1 + pos
], v
->n
) &&
1054 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1059 aff
= isl_aff_cow(aff
);
1062 aff
->v
= isl_vec_cow(aff
->v
);
1066 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1067 isl_int_set(aff
->v
->el
[1 + pos
], v
->n
);
1068 } else if (isl_int_is_one(v
->d
)) {
1069 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1071 isl_seq_scale(aff
->v
->el
+ 1,
1072 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1073 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1074 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1075 aff
->v
= isl_vec_normalize(aff
->v
);
1088 /* Add "v" to the coefficient of the variable of type "type"
1089 * at position "pos" of "aff".
1091 * A NaN is unaffected by this operation.
1093 __isl_give isl_aff
*isl_aff_add_coefficient(__isl_take isl_aff
*aff
,
1094 enum isl_dim_type type
, int pos
, isl_int v
)
1099 if (type
== isl_dim_out
)
1100 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1101 "output/set dimension does not have a coefficient",
1102 return isl_aff_free(aff
));
1103 if (type
== isl_dim_in
)
1106 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1107 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1108 "position out of bounds", return isl_aff_free(aff
));
1110 if (isl_aff_is_nan(aff
))
1112 aff
= isl_aff_cow(aff
);
1116 aff
->v
= isl_vec_cow(aff
->v
);
1118 return isl_aff_free(aff
);
1120 pos
+= isl_local_space_offset(aff
->ls
, type
);
1121 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
);
1126 /* Add "v" to the coefficient of the variable of type "type"
1127 * at position "pos" of "aff".
1129 * A NaN is unaffected by this operation.
1131 __isl_give isl_aff
*isl_aff_add_coefficient_val(__isl_take isl_aff
*aff
,
1132 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1137 if (isl_val_is_zero(v
)) {
1142 if (type
== isl_dim_out
)
1143 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1144 "output/set dimension does not have a coefficient",
1146 if (type
== isl_dim_in
)
1149 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1150 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1151 "position out of bounds", goto error
);
1153 if (isl_aff_is_nan(aff
)) {
1157 if (!isl_val_is_rat(v
))
1158 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1159 "expecting rational value", goto error
);
1161 aff
= isl_aff_cow(aff
);
1165 aff
->v
= isl_vec_cow(aff
->v
);
1169 pos
+= isl_local_space_offset(aff
->ls
, type
);
1170 if (isl_int_is_one(v
->d
)) {
1171 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1172 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1173 isl_int_add(aff
->v
->el
[1 + pos
], aff
->v
->el
[1 + pos
], v
->n
);
1174 aff
->v
= isl_vec_normalize(aff
->v
);
1178 isl_seq_scale(aff
->v
->el
+ 1,
1179 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1180 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1181 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1182 aff
->v
= isl_vec_normalize(aff
->v
);
1195 __isl_give isl_aff
*isl_aff_add_coefficient_si(__isl_take isl_aff
*aff
,
1196 enum isl_dim_type type
, int pos
, int v
)
1201 isl_int_set_si(t
, v
);
1202 aff
= isl_aff_add_coefficient(aff
, type
, pos
, t
);
1208 __isl_give isl_aff
*isl_aff_get_div(__isl_keep isl_aff
*aff
, int pos
)
1213 return isl_local_space_get_div(aff
->ls
, pos
);
1216 /* Return the negation of "aff".
1218 * As a special case, -NaN = NaN.
1220 __isl_give isl_aff
*isl_aff_neg(__isl_take isl_aff
*aff
)
1224 if (isl_aff_is_nan(aff
))
1226 aff
= isl_aff_cow(aff
);
1229 aff
->v
= isl_vec_cow(aff
->v
);
1231 return isl_aff_free(aff
);
1233 isl_seq_neg(aff
->v
->el
+ 1, aff
->v
->el
+ 1, aff
->v
->size
- 1);
1238 /* Remove divs from the local space that do not appear in the affine
1240 * We currently only remove divs at the end.
1241 * Some intermediate divs may also not appear directly in the affine
1242 * expression, but we would also need to check that no other divs are
1243 * defined in terms of them.
1245 __isl_give isl_aff
*isl_aff_remove_unused_divs(__isl_take isl_aff
*aff
)
1254 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1255 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1257 pos
= isl_seq_last_non_zero(aff
->v
->el
+ 1 + off
, n
) + 1;
1261 aff
= isl_aff_cow(aff
);
1265 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, isl_dim_div
, pos
, n
- pos
);
1266 aff
->v
= isl_vec_drop_els(aff
->v
, 1 + off
+ pos
, n
- pos
);
1267 if (!aff
->ls
|| !aff
->v
)
1268 return isl_aff_free(aff
);
1273 /* Given two affine expressions "p" of length p_len (including the
1274 * denominator and the constant term) and "subs" of length subs_len,
1275 * plug in "subs" for the variable at position "pos".
1276 * The variables of "subs" and "p" are assumed to match up to subs_len,
1277 * but "p" may have additional variables.
1278 * "v" is an initialized isl_int that can be used internally.
1280 * In particular, if "p" represents the expression
1284 * with i the variable at position "pos" and "subs" represents the expression
1288 * then the result represents the expression
1293 void isl_seq_substitute(isl_int
*p
, int pos
, isl_int
*subs
,
1294 int p_len
, int subs_len
, isl_int v
)
1296 isl_int_set(v
, p
[1 + pos
]);
1297 isl_int_set_si(p
[1 + pos
], 0);
1298 isl_seq_combine(p
+ 1, subs
[0], p
+ 1, v
, subs
+ 1, subs_len
- 1);
1299 isl_seq_scale(p
+ subs_len
, p
+ subs_len
, subs
[0], p_len
- subs_len
);
1300 isl_int_mul(p
[0], p
[0], subs
[0]);
1303 /* Look for any divs in the aff->ls with a denominator equal to one
1304 * and plug them into the affine expression and any subsequent divs
1305 * that may reference the div.
1307 static __isl_give isl_aff
*plug_in_integral_divs(__isl_take isl_aff
*aff
)
1313 isl_local_space
*ls
;
1319 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1321 for (i
= 0; i
< n
; ++i
) {
1322 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][0]))
1324 ls
= isl_local_space_copy(aff
->ls
);
1325 ls
= isl_local_space_substitute_seq(ls
, isl_dim_div
, i
,
1326 aff
->ls
->div
->row
[i
], len
, i
+ 1, n
- (i
+ 1));
1327 vec
= isl_vec_copy(aff
->v
);
1328 vec
= isl_vec_cow(vec
);
1334 pos
= isl_local_space_offset(aff
->ls
, isl_dim_div
) + i
;
1335 isl_seq_substitute(vec
->el
, pos
, aff
->ls
->div
->row
[i
],
1340 isl_vec_free(aff
->v
);
1342 isl_local_space_free(aff
->ls
);
1349 isl_local_space_free(ls
);
1350 return isl_aff_free(aff
);
1353 /* Look for any divs j that appear with a unit coefficient inside
1354 * the definitions of other divs i and plug them into the definitions
1357 * In particular, an expression of the form
1359 * floor((f(..) + floor(g(..)/n))/m)
1363 * floor((n * f(..) + g(..))/(n * m))
1365 * This simplification is correct because we can move the expression
1366 * f(..) into the inner floor in the original expression to obtain
1368 * floor(floor((n * f(..) + g(..))/n)/m)
1370 * from which we can derive the simplified expression.
1372 static __isl_give isl_aff
*plug_in_unit_divs(__isl_take isl_aff
*aff
)
1380 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1381 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1382 for (i
= 1; i
< n
; ++i
) {
1383 for (j
= 0; j
< i
; ++j
) {
1384 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][1 + off
+ j
]))
1386 aff
->ls
= isl_local_space_substitute_seq(aff
->ls
,
1387 isl_dim_div
, j
, aff
->ls
->div
->row
[j
],
1388 aff
->v
->size
, i
, 1);
1390 return isl_aff_free(aff
);
1397 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
1399 * Even though this function is only called on isl_affs with a single
1400 * reference, we are careful to only change aff->v and aff->ls together.
1402 static __isl_give isl_aff
*swap_div(__isl_take isl_aff
*aff
, int a
, int b
)
1404 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1405 isl_local_space
*ls
;
1408 ls
= isl_local_space_copy(aff
->ls
);
1409 ls
= isl_local_space_swap_div(ls
, a
, b
);
1410 v
= isl_vec_copy(aff
->v
);
1415 isl_int_swap(v
->el
[1 + off
+ a
], v
->el
[1 + off
+ b
]);
1416 isl_vec_free(aff
->v
);
1418 isl_local_space_free(aff
->ls
);
1424 isl_local_space_free(ls
);
1425 return isl_aff_free(aff
);
1428 /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL.
1430 * We currently do not actually remove div "b", but simply add its
1431 * coefficient to that of "a" and then zero it out.
1433 static __isl_give isl_aff
*merge_divs(__isl_take isl_aff
*aff
, int a
, int b
)
1435 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1437 if (isl_int_is_zero(aff
->v
->el
[1 + off
+ b
]))
1440 aff
->v
= isl_vec_cow(aff
->v
);
1442 return isl_aff_free(aff
);
1444 isl_int_add(aff
->v
->el
[1 + off
+ a
],
1445 aff
->v
->el
[1 + off
+ a
], aff
->v
->el
[1 + off
+ b
]);
1446 isl_int_set_si(aff
->v
->el
[1 + off
+ b
], 0);
1451 /* Sort the divs in the local space of "aff" according to
1452 * the comparison function "cmp_row" in isl_local_space.c,
1453 * combining the coefficients of identical divs.
1455 * Reordering divs does not change the semantics of "aff",
1456 * so there is no need to call isl_aff_cow.
1457 * Moreover, this function is currently only called on isl_affs
1458 * with a single reference.
1460 static __isl_give isl_aff
*sort_divs(__isl_take isl_aff
*aff
)
1467 n
= isl_aff_dim(aff
, isl_dim_div
);
1468 for (i
= 1; i
< n
; ++i
) {
1469 for (j
= i
- 1; j
>= 0; --j
) {
1470 int cmp
= isl_mat_cmp_div(aff
->ls
->div
, j
, j
+ 1);
1474 aff
= merge_divs(aff
, j
, j
+ 1);
1476 aff
= swap_div(aff
, j
, j
+ 1);
1485 /* Normalize the representation of "aff".
1487 * This function should only be called of "new" isl_affs, i.e.,
1488 * with only a single reference. We therefore do not need to
1489 * worry about affecting other instances.
1491 __isl_give isl_aff
*isl_aff_normalize(__isl_take isl_aff
*aff
)
1495 aff
->v
= isl_vec_normalize(aff
->v
);
1497 return isl_aff_free(aff
);
1498 aff
= plug_in_integral_divs(aff
);
1499 aff
= plug_in_unit_divs(aff
);
1500 aff
= sort_divs(aff
);
1501 aff
= isl_aff_remove_unused_divs(aff
);
1505 /* Given f, return floor(f).
1506 * If f is an integer expression, then just return f.
1507 * If f is a constant, then return the constant floor(f).
1508 * Otherwise, if f = g/m, write g = q m + r,
1509 * create a new div d = [r/m] and return the expression q + d.
1510 * The coefficients in r are taken to lie between -m/2 and m/2.
1512 * As a special case, floor(NaN) = NaN.
1514 __isl_give isl_aff
*isl_aff_floor(__isl_take isl_aff
*aff
)
1524 if (isl_aff_is_nan(aff
))
1526 if (isl_int_is_one(aff
->v
->el
[0]))
1529 aff
= isl_aff_cow(aff
);
1533 aff
->v
= isl_vec_cow(aff
->v
);
1535 return isl_aff_free(aff
);
1537 if (isl_aff_is_cst(aff
)) {
1538 isl_int_fdiv_q(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1539 isl_int_set_si(aff
->v
->el
[0], 1);
1543 div
= isl_vec_copy(aff
->v
);
1544 div
= isl_vec_cow(div
);
1546 return isl_aff_free(aff
);
1548 ctx
= isl_aff_get_ctx(aff
);
1549 isl_int_fdiv_q(aff
->v
->el
[0], aff
->v
->el
[0], ctx
->two
);
1550 for (i
= 1; i
< aff
->v
->size
; ++i
) {
1551 isl_int_fdiv_r(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1552 isl_int_fdiv_q(aff
->v
->el
[i
], aff
->v
->el
[i
], div
->el
[0]);
1553 if (isl_int_gt(div
->el
[i
], aff
->v
->el
[0])) {
1554 isl_int_sub(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1555 isl_int_add_ui(aff
->v
->el
[i
], aff
->v
->el
[i
], 1);
1559 aff
->ls
= isl_local_space_add_div(aff
->ls
, div
);
1561 return isl_aff_free(aff
);
1563 size
= aff
->v
->size
;
1564 aff
->v
= isl_vec_extend(aff
->v
, size
+ 1);
1566 return isl_aff_free(aff
);
1567 isl_int_set_si(aff
->v
->el
[0], 1);
1568 isl_int_set_si(aff
->v
->el
[size
], 1);
1570 aff
= isl_aff_normalize(aff
);
1577 * aff mod m = aff - m * floor(aff/m)
1579 __isl_give isl_aff
*isl_aff_mod(__isl_take isl_aff
*aff
, isl_int m
)
1583 res
= isl_aff_copy(aff
);
1584 aff
= isl_aff_scale_down(aff
, m
);
1585 aff
= isl_aff_floor(aff
);
1586 aff
= isl_aff_scale(aff
, m
);
1587 res
= isl_aff_sub(res
, aff
);
1594 * aff mod m = aff - m * floor(aff/m)
1596 * with m an integer value.
1598 __isl_give isl_aff
*isl_aff_mod_val(__isl_take isl_aff
*aff
,
1599 __isl_take isl_val
*m
)
1606 if (!isl_val_is_int(m
))
1607 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
1608 "expecting integer modulo", goto error
);
1610 res
= isl_aff_copy(aff
);
1611 aff
= isl_aff_scale_down_val(aff
, isl_val_copy(m
));
1612 aff
= isl_aff_floor(aff
);
1613 aff
= isl_aff_scale_val(aff
, m
);
1614 res
= isl_aff_sub(res
, aff
);
1625 * pwaff mod m = pwaff - m * floor(pwaff/m)
1627 __isl_give isl_pw_aff
*isl_pw_aff_mod(__isl_take isl_pw_aff
*pwaff
, isl_int m
)
1631 res
= isl_pw_aff_copy(pwaff
);
1632 pwaff
= isl_pw_aff_scale_down(pwaff
, m
);
1633 pwaff
= isl_pw_aff_floor(pwaff
);
1634 pwaff
= isl_pw_aff_scale(pwaff
, m
);
1635 res
= isl_pw_aff_sub(res
, pwaff
);
1642 * pa mod m = pa - m * floor(pa/m)
1644 * with m an integer value.
1646 __isl_give isl_pw_aff
*isl_pw_aff_mod_val(__isl_take isl_pw_aff
*pa
,
1647 __isl_take isl_val
*m
)
1651 if (!isl_val_is_int(m
))
1652 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
1653 "expecting integer modulo", goto error
);
1654 pa
= isl_pw_aff_mod(pa
, m
->n
);
1658 isl_pw_aff_free(pa
);
1663 /* Given f, return ceil(f).
1664 * If f is an integer expression, then just return f.
1665 * Otherwise, let f be the expression
1671 * floor((e + m - 1)/m)
1673 * As a special case, ceil(NaN) = NaN.
1675 __isl_give isl_aff
*isl_aff_ceil(__isl_take isl_aff
*aff
)
1680 if (isl_aff_is_nan(aff
))
1682 if (isl_int_is_one(aff
->v
->el
[0]))
1685 aff
= isl_aff_cow(aff
);
1688 aff
->v
= isl_vec_cow(aff
->v
);
1690 return isl_aff_free(aff
);
1692 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1693 isl_int_sub_ui(aff
->v
->el
[1], aff
->v
->el
[1], 1);
1694 aff
= isl_aff_floor(aff
);
1699 /* Apply the expansion computed by isl_merge_divs.
1700 * The expansion itself is given by "exp" while the resulting
1701 * list of divs is given by "div".
1703 __isl_give isl_aff
*isl_aff_expand_divs( __isl_take isl_aff
*aff
,
1704 __isl_take isl_mat
*div
, int *exp
)
1711 aff
= isl_aff_cow(aff
);
1715 old_n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1716 new_n_div
= isl_mat_rows(div
);
1717 if (new_n_div
< old_n_div
)
1718 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
1719 "not an expansion", goto error
);
1721 aff
->v
= isl_vec_extend(aff
->v
, aff
->v
->size
+ new_n_div
- old_n_div
);
1725 offset
= 1 + isl_local_space_offset(aff
->ls
, isl_dim_div
);
1727 for (i
= new_n_div
- 1; i
>= 0; --i
) {
1728 if (j
>= 0 && exp
[j
] == i
) {
1730 isl_int_swap(aff
->v
->el
[offset
+ i
],
1731 aff
->v
->el
[offset
+ j
]);
1734 isl_int_set_si(aff
->v
->el
[offset
+ i
], 0);
1737 aff
->ls
= isl_local_space_replace_divs(aff
->ls
, isl_mat_copy(div
));
1748 /* Add two affine expressions that live in the same local space.
1750 static __isl_give isl_aff
*add_expanded(__isl_take isl_aff
*aff1
,
1751 __isl_take isl_aff
*aff2
)
1755 aff1
= isl_aff_cow(aff1
);
1759 aff1
->v
= isl_vec_cow(aff1
->v
);
1765 isl_int_gcd(gcd
, aff1
->v
->el
[0], aff2
->v
->el
[0]);
1766 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1767 isl_seq_scale(aff1
->v
->el
+ 1, aff1
->v
->el
+ 1, f
, aff1
->v
->size
- 1);
1768 isl_int_divexact(f
, aff1
->v
->el
[0], gcd
);
1769 isl_seq_addmul(aff1
->v
->el
+ 1, f
, aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
1770 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1771 isl_int_mul(aff1
->v
->el
[0], aff1
->v
->el
[0], f
);
1783 /* Return the sum of "aff1" and "aff2".
1785 * If either of the two is NaN, then the result is NaN.
1787 __isl_give isl_aff
*isl_aff_add(__isl_take isl_aff
*aff1
,
1788 __isl_take isl_aff
*aff2
)
1799 ctx
= isl_aff_get_ctx(aff1
);
1800 if (!isl_space_is_equal(aff1
->ls
->dim
, aff2
->ls
->dim
))
1801 isl_die(ctx
, isl_error_invalid
,
1802 "spaces don't match", goto error
);
1804 if (isl_aff_is_nan(aff1
)) {
1808 if (isl_aff_is_nan(aff2
)) {
1813 n_div1
= isl_aff_dim(aff1
, isl_dim_div
);
1814 n_div2
= isl_aff_dim(aff2
, isl_dim_div
);
1815 if (n_div1
== 0 && n_div2
== 0)
1816 return add_expanded(aff1
, aff2
);
1818 exp1
= isl_alloc_array(ctx
, int, n_div1
);
1819 exp2
= isl_alloc_array(ctx
, int, n_div2
);
1820 if ((n_div1
&& !exp1
) || (n_div2
&& !exp2
))
1823 div
= isl_merge_divs(aff1
->ls
->div
, aff2
->ls
->div
, exp1
, exp2
);
1824 aff1
= isl_aff_expand_divs(aff1
, isl_mat_copy(div
), exp1
);
1825 aff2
= isl_aff_expand_divs(aff2
, div
, exp2
);
1829 return add_expanded(aff1
, aff2
);
1838 __isl_give isl_aff
*isl_aff_sub(__isl_take isl_aff
*aff1
,
1839 __isl_take isl_aff
*aff2
)
1841 return isl_aff_add(aff1
, isl_aff_neg(aff2
));
1844 /* Return the result of scaling "aff" by a factor of "f".
1846 * As a special case, f * NaN = NaN.
1848 __isl_give isl_aff
*isl_aff_scale(__isl_take isl_aff
*aff
, isl_int f
)
1854 if (isl_aff_is_nan(aff
))
1857 if (isl_int_is_one(f
))
1860 aff
= isl_aff_cow(aff
);
1863 aff
->v
= isl_vec_cow(aff
->v
);
1865 return isl_aff_free(aff
);
1867 if (isl_int_is_pos(f
) && isl_int_is_divisible_by(aff
->v
->el
[0], f
)) {
1868 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], f
);
1873 isl_int_gcd(gcd
, aff
->v
->el
[0], f
);
1874 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1875 isl_int_divexact(gcd
, f
, gcd
);
1876 isl_seq_scale(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1882 /* Multiple "aff" by "v".
1884 __isl_give isl_aff
*isl_aff_scale_val(__isl_take isl_aff
*aff
,
1885 __isl_take isl_val
*v
)
1890 if (isl_val_is_one(v
)) {
1895 if (!isl_val_is_rat(v
))
1896 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1897 "expecting rational factor", goto error
);
1899 aff
= isl_aff_scale(aff
, v
->n
);
1900 aff
= isl_aff_scale_down(aff
, v
->d
);
1910 /* Return the result of scaling "aff" down by a factor of "f".
1912 * As a special case, NaN/f = NaN.
1914 __isl_give isl_aff
*isl_aff_scale_down(__isl_take isl_aff
*aff
, isl_int f
)
1920 if (isl_aff_is_nan(aff
))
1923 if (isl_int_is_one(f
))
1926 aff
= isl_aff_cow(aff
);
1930 if (isl_int_is_zero(f
))
1931 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1932 "cannot scale down by zero", return isl_aff_free(aff
));
1934 aff
->v
= isl_vec_cow(aff
->v
);
1936 return isl_aff_free(aff
);
1939 isl_seq_gcd(aff
->v
->el
+ 1, aff
->v
->size
- 1, &gcd
);
1940 isl_int_gcd(gcd
, gcd
, f
);
1941 isl_seq_scale_down(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1942 isl_int_divexact(gcd
, f
, gcd
);
1943 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1949 /* Divide "aff" by "v".
1951 __isl_give isl_aff
*isl_aff_scale_down_val(__isl_take isl_aff
*aff
,
1952 __isl_take isl_val
*v
)
1957 if (isl_val_is_one(v
)) {
1962 if (!isl_val_is_rat(v
))
1963 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1964 "expecting rational factor", goto error
);
1965 if (!isl_val_is_pos(v
))
1966 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1967 "factor needs to be positive", goto error
);
1969 aff
= isl_aff_scale(aff
, v
->d
);
1970 aff
= isl_aff_scale_down(aff
, v
->n
);
1980 __isl_give isl_aff
*isl_aff_scale_down_ui(__isl_take isl_aff
*aff
, unsigned f
)
1988 isl_int_set_ui(v
, f
);
1989 aff
= isl_aff_scale_down(aff
, v
);
1995 __isl_give isl_aff
*isl_aff_set_dim_name(__isl_take isl_aff
*aff
,
1996 enum isl_dim_type type
, unsigned pos
, const char *s
)
1998 aff
= isl_aff_cow(aff
);
2001 if (type
== isl_dim_out
)
2002 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2003 "cannot set name of output/set dimension",
2004 return isl_aff_free(aff
));
2005 if (type
== isl_dim_in
)
2007 aff
->ls
= isl_local_space_set_dim_name(aff
->ls
, type
, pos
, s
);
2009 return isl_aff_free(aff
);
2014 __isl_give isl_aff
*isl_aff_set_dim_id(__isl_take isl_aff
*aff
,
2015 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
2017 aff
= isl_aff_cow(aff
);
2020 if (type
== isl_dim_out
)
2021 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2022 "cannot set name of output/set dimension",
2024 if (type
== isl_dim_in
)
2026 aff
->ls
= isl_local_space_set_dim_id(aff
->ls
, type
, pos
, id
);
2028 return isl_aff_free(aff
);
2037 /* Replace the identifier of the input tuple of "aff" by "id".
2038 * type is currently required to be equal to isl_dim_in
2040 __isl_give isl_aff
*isl_aff_set_tuple_id(__isl_take isl_aff
*aff
,
2041 enum isl_dim_type type
, __isl_take isl_id
*id
)
2043 aff
= isl_aff_cow(aff
);
2046 if (type
!= isl_dim_out
)
2047 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2048 "cannot only set id of input tuple", goto error
);
2049 aff
->ls
= isl_local_space_set_tuple_id(aff
->ls
, isl_dim_set
, id
);
2051 return isl_aff_free(aff
);
2060 /* Exploit the equalities in "eq" to simplify the affine expression
2061 * and the expressions of the integer divisions in the local space.
2062 * The integer divisions in this local space are assumed to appear
2063 * as regular dimensions in "eq".
2065 static __isl_give isl_aff
*isl_aff_substitute_equalities_lifted(
2066 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
2074 if (eq
->n_eq
== 0) {
2075 isl_basic_set_free(eq
);
2079 aff
= isl_aff_cow(aff
);
2083 aff
->ls
= isl_local_space_substitute_equalities(aff
->ls
,
2084 isl_basic_set_copy(eq
));
2085 aff
->v
= isl_vec_cow(aff
->v
);
2086 if (!aff
->ls
|| !aff
->v
)
2089 total
= 1 + isl_space_dim(eq
->dim
, isl_dim_all
);
2091 for (i
= 0; i
< eq
->n_eq
; ++i
) {
2092 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
2093 if (j
< 0 || j
== 0 || j
>= total
)
2096 isl_seq_elim(aff
->v
->el
+ 1, eq
->eq
[i
], j
, total
,
2100 isl_basic_set_free(eq
);
2101 aff
= isl_aff_normalize(aff
);
2104 isl_basic_set_free(eq
);
2109 /* Exploit the equalities in "eq" to simplify the affine expression
2110 * and the expressions of the integer divisions in the local space.
2112 __isl_give isl_aff
*isl_aff_substitute_equalities(__isl_take isl_aff
*aff
,
2113 __isl_take isl_basic_set
*eq
)
2119 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2121 eq
= isl_basic_set_add_dims(eq
, isl_dim_set
, n_div
);
2122 return isl_aff_substitute_equalities_lifted(aff
, eq
);
2124 isl_basic_set_free(eq
);
2129 /* Look for equalities among the variables shared by context and aff
2130 * and the integer divisions of aff, if any.
2131 * The equalities are then used to eliminate coefficients and/or integer
2132 * divisions from aff.
2134 __isl_give isl_aff
*isl_aff_gist(__isl_take isl_aff
*aff
,
2135 __isl_take isl_set
*context
)
2137 isl_basic_set
*hull
;
2142 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2144 isl_basic_set
*bset
;
2145 isl_local_space
*ls
;
2146 context
= isl_set_add_dims(context
, isl_dim_set
, n_div
);
2147 ls
= isl_aff_get_domain_local_space(aff
);
2148 bset
= isl_basic_set_from_local_space(ls
);
2149 bset
= isl_basic_set_lift(bset
);
2150 bset
= isl_basic_set_flatten(bset
);
2151 context
= isl_set_intersect(context
,
2152 isl_set_from_basic_set(bset
));
2155 hull
= isl_set_affine_hull(context
);
2156 return isl_aff_substitute_equalities_lifted(aff
, hull
);
2159 isl_set_free(context
);
2163 __isl_give isl_aff
*isl_aff_gist_params(__isl_take isl_aff
*aff
,
2164 __isl_take isl_set
*context
)
2166 isl_set
*dom_context
= isl_set_universe(isl_aff_get_domain_space(aff
));
2167 dom_context
= isl_set_intersect_params(dom_context
, context
);
2168 return isl_aff_gist(aff
, dom_context
);
2171 /* Return a basic set containing those elements in the space
2172 * of aff where it is positive. "rational" should not be set.
2174 * If "aff" is NaN, then it is not positive.
2176 static __isl_give isl_basic_set
*aff_pos_basic_set(__isl_take isl_aff
*aff
,
2179 isl_constraint
*ineq
;
2180 isl_basic_set
*bset
;
2185 if (isl_aff_is_nan(aff
)) {
2186 isl_space
*space
= isl_aff_get_domain_space(aff
);
2188 return isl_basic_set_empty(space
);
2191 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2192 "rational sets not supported", goto error
);
2194 ineq
= isl_inequality_from_aff(aff
);
2195 c
= isl_constraint_get_constant_val(ineq
);
2196 c
= isl_val_sub_ui(c
, 1);
2197 ineq
= isl_constraint_set_constant_val(ineq
, c
);
2199 bset
= isl_basic_set_from_constraint(ineq
);
2200 bset
= isl_basic_set_simplify(bset
);
2207 /* Return a basic set containing those elements in the space
2208 * of aff where it is non-negative.
2209 * If "rational" is set, then return a rational basic set.
2211 * If "aff" is NaN, then it is not non-negative (it's not negative either).
2213 static __isl_give isl_basic_set
*aff_nonneg_basic_set(
2214 __isl_take isl_aff
*aff
, int rational
)
2216 isl_constraint
*ineq
;
2217 isl_basic_set
*bset
;
2221 if (isl_aff_is_nan(aff
)) {
2222 isl_space
*space
= isl_aff_get_domain_space(aff
);
2224 return isl_basic_set_empty(space
);
2227 ineq
= isl_inequality_from_aff(aff
);
2229 bset
= isl_basic_set_from_constraint(ineq
);
2231 bset
= isl_basic_set_set_rational(bset
);
2232 bset
= isl_basic_set_simplify(bset
);
2236 /* Return a basic set containing those elements in the space
2237 * of aff where it is non-negative.
2239 __isl_give isl_basic_set
*isl_aff_nonneg_basic_set(__isl_take isl_aff
*aff
)
2241 return aff_nonneg_basic_set(aff
, 0);
2244 /* Return a basic set containing those elements in the domain space
2245 * of aff where it is negative.
2247 __isl_give isl_basic_set
*isl_aff_neg_basic_set(__isl_take isl_aff
*aff
)
2249 aff
= isl_aff_neg(aff
);
2250 aff
= isl_aff_add_constant_num_si(aff
, -1);
2251 return isl_aff_nonneg_basic_set(aff
);
2254 /* Return a basic set containing those elements in the space
2255 * of aff where it is zero.
2256 * If "rational" is set, then return a rational basic set.
2258 * If "aff" is NaN, then it is not zero.
2260 static __isl_give isl_basic_set
*aff_zero_basic_set(__isl_take isl_aff
*aff
,
2263 isl_constraint
*ineq
;
2264 isl_basic_set
*bset
;
2268 if (isl_aff_is_nan(aff
)) {
2269 isl_space
*space
= isl_aff_get_domain_space(aff
);
2271 return isl_basic_set_empty(space
);
2274 ineq
= isl_equality_from_aff(aff
);
2276 bset
= isl_basic_set_from_constraint(ineq
);
2278 bset
= isl_basic_set_set_rational(bset
);
2279 bset
= isl_basic_set_simplify(bset
);
2283 /* Return a basic set containing those elements in the space
2284 * of aff where it is zero.
2286 __isl_give isl_basic_set
*isl_aff_zero_basic_set(__isl_take isl_aff
*aff
)
2288 return aff_zero_basic_set(aff
, 0);
2291 /* Return a basic set containing those elements in the shared space
2292 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2294 __isl_give isl_basic_set
*isl_aff_ge_basic_set(__isl_take isl_aff
*aff1
,
2295 __isl_take isl_aff
*aff2
)
2297 aff1
= isl_aff_sub(aff1
, aff2
);
2299 return isl_aff_nonneg_basic_set(aff1
);
2302 /* Return a basic set containing those elements in the shared space
2303 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2305 __isl_give isl_basic_set
*isl_aff_le_basic_set(__isl_take isl_aff
*aff1
,
2306 __isl_take isl_aff
*aff2
)
2308 return isl_aff_ge_basic_set(aff2
, aff1
);
2311 __isl_give isl_aff
*isl_aff_add_on_domain(__isl_keep isl_set
*dom
,
2312 __isl_take isl_aff
*aff1
, __isl_take isl_aff
*aff2
)
2314 aff1
= isl_aff_add(aff1
, aff2
);
2315 aff1
= isl_aff_gist(aff1
, isl_set_copy(dom
));
2319 int isl_aff_is_empty(__isl_keep isl_aff
*aff
)
2327 /* Check whether the given affine expression has non-zero coefficient
2328 * for any dimension in the given range or if any of these dimensions
2329 * appear with non-zero coefficients in any of the integer divisions
2330 * involved in the affine expression.
2332 isl_bool
isl_aff_involves_dims(__isl_keep isl_aff
*aff
,
2333 enum isl_dim_type type
, unsigned first
, unsigned n
)
2338 isl_bool involves
= isl_bool_false
;
2341 return isl_bool_error
;
2343 return isl_bool_false
;
2345 ctx
= isl_aff_get_ctx(aff
);
2346 if (first
+ n
> isl_aff_dim(aff
, type
))
2347 isl_die(ctx
, isl_error_invalid
,
2348 "range out of bounds", return isl_bool_error
);
2350 active
= isl_local_space_get_active(aff
->ls
, aff
->v
->el
+ 2);
2354 first
+= isl_local_space_offset(aff
->ls
, type
) - 1;
2355 for (i
= 0; i
< n
; ++i
)
2356 if (active
[first
+ i
]) {
2357 involves
= isl_bool_true
;
2366 return isl_bool_error
;
2369 __isl_give isl_aff
*isl_aff_drop_dims(__isl_take isl_aff
*aff
,
2370 enum isl_dim_type type
, unsigned first
, unsigned n
)
2376 if (type
== isl_dim_out
)
2377 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2378 "cannot drop output/set dimension",
2379 return isl_aff_free(aff
));
2380 if (type
== isl_dim_in
)
2382 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2385 ctx
= isl_aff_get_ctx(aff
);
2386 if (first
+ n
> isl_local_space_dim(aff
->ls
, type
))
2387 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
2388 return isl_aff_free(aff
));
2390 aff
= isl_aff_cow(aff
);
2394 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, type
, first
, n
);
2396 return isl_aff_free(aff
);
2398 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2399 aff
->v
= isl_vec_drop_els(aff
->v
, first
, n
);
2401 return isl_aff_free(aff
);
2406 /* Project the domain of the affine expression onto its parameter space.
2407 * The affine expression may not involve any of the domain dimensions.
2409 __isl_give isl_aff
*isl_aff_project_domain_on_params(__isl_take isl_aff
*aff
)
2415 n
= isl_aff_dim(aff
, isl_dim_in
);
2416 involves
= isl_aff_involves_dims(aff
, isl_dim_in
, 0, n
);
2418 return isl_aff_free(aff
);
2420 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2421 "affine expression involves some of the domain dimensions",
2422 return isl_aff_free(aff
));
2423 aff
= isl_aff_drop_dims(aff
, isl_dim_in
, 0, n
);
2424 space
= isl_aff_get_domain_space(aff
);
2425 space
= isl_space_params(space
);
2426 aff
= isl_aff_reset_domain_space(aff
, space
);
2430 __isl_give isl_aff
*isl_aff_insert_dims(__isl_take isl_aff
*aff
,
2431 enum isl_dim_type type
, unsigned first
, unsigned n
)
2437 if (type
== isl_dim_out
)
2438 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2439 "cannot insert output/set dimensions",
2440 return isl_aff_free(aff
));
2441 if (type
== isl_dim_in
)
2443 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2446 ctx
= isl_aff_get_ctx(aff
);
2447 if (first
> isl_local_space_dim(aff
->ls
, type
))
2448 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
2449 return isl_aff_free(aff
));
2451 aff
= isl_aff_cow(aff
);
2455 aff
->ls
= isl_local_space_insert_dims(aff
->ls
, type
, first
, n
);
2457 return isl_aff_free(aff
);
2459 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2460 aff
->v
= isl_vec_insert_zero_els(aff
->v
, first
, n
);
2462 return isl_aff_free(aff
);
2467 __isl_give isl_aff
*isl_aff_add_dims(__isl_take isl_aff
*aff
,
2468 enum isl_dim_type type
, unsigned n
)
2472 pos
= isl_aff_dim(aff
, type
);
2474 return isl_aff_insert_dims(aff
, type
, pos
, n
);
2477 __isl_give isl_pw_aff
*isl_pw_aff_add_dims(__isl_take isl_pw_aff
*pwaff
,
2478 enum isl_dim_type type
, unsigned n
)
2482 pos
= isl_pw_aff_dim(pwaff
, type
);
2484 return isl_pw_aff_insert_dims(pwaff
, type
, pos
, n
);
2487 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "aff"
2488 * to dimensions of "dst_type" at "dst_pos".
2490 * We only support moving input dimensions to parameters and vice versa.
2492 __isl_give isl_aff
*isl_aff_move_dims(__isl_take isl_aff
*aff
,
2493 enum isl_dim_type dst_type
, unsigned dst_pos
,
2494 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2502 !isl_local_space_is_named_or_nested(aff
->ls
, src_type
) &&
2503 !isl_local_space_is_named_or_nested(aff
->ls
, dst_type
))
2506 if (dst_type
== isl_dim_out
|| src_type
== isl_dim_out
)
2507 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2508 "cannot move output/set dimension",
2509 return isl_aff_free(aff
));
2510 if (dst_type
== isl_dim_div
|| src_type
== isl_dim_div
)
2511 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2512 "cannot move divs", return isl_aff_free(aff
));
2513 if (dst_type
== isl_dim_in
)
2514 dst_type
= isl_dim_set
;
2515 if (src_type
== isl_dim_in
)
2516 src_type
= isl_dim_set
;
2518 if (src_pos
+ n
> isl_local_space_dim(aff
->ls
, src_type
))
2519 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2520 "range out of bounds", return isl_aff_free(aff
));
2521 if (dst_type
== src_type
)
2522 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2523 "moving dims within the same type not supported",
2524 return isl_aff_free(aff
));
2526 aff
= isl_aff_cow(aff
);
2530 g_src_pos
= 1 + isl_local_space_offset(aff
->ls
, src_type
) + src_pos
;
2531 g_dst_pos
= 1 + isl_local_space_offset(aff
->ls
, dst_type
) + dst_pos
;
2532 if (dst_type
> src_type
)
2535 aff
->v
= isl_vec_move_els(aff
->v
, g_dst_pos
, g_src_pos
, n
);
2536 aff
->ls
= isl_local_space_move_dims(aff
->ls
, dst_type
, dst_pos
,
2537 src_type
, src_pos
, n
);
2538 if (!aff
->v
|| !aff
->ls
)
2539 return isl_aff_free(aff
);
2541 aff
= sort_divs(aff
);
2546 __isl_give isl_pw_aff
*isl_pw_aff_from_aff(__isl_take isl_aff
*aff
)
2548 isl_set
*dom
= isl_set_universe(isl_aff_get_domain_space(aff
));
2549 return isl_pw_aff_alloc(dom
, aff
);
2553 #define PW isl_pw_aff
2557 #define EL_IS_ZERO is_empty
2561 #define IS_ZERO is_empty
2564 #undef DEFAULT_IS_ZERO
2565 #define DEFAULT_IS_ZERO 0
2572 #include <isl_pw_templ.c>
2575 #define UNION isl_union_pw_aff
2577 #define PART isl_pw_aff
2579 #define PARTS pw_aff
2581 #include <isl_union_single.c>
2582 #include <isl_union_neg.c>
2584 static __isl_give isl_set
*align_params_pw_pw_set_and(
2585 __isl_take isl_pw_aff
*pwaff1
, __isl_take isl_pw_aff
*pwaff2
,
2586 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
2587 __isl_take isl_pw_aff
*pwaff2
))
2589 if (!pwaff1
|| !pwaff2
)
2591 if (isl_space_match(pwaff1
->dim
, isl_dim_param
,
2592 pwaff2
->dim
, isl_dim_param
))
2593 return fn(pwaff1
, pwaff2
);
2594 if (!isl_space_has_named_params(pwaff1
->dim
) ||
2595 !isl_space_has_named_params(pwaff2
->dim
))
2596 isl_die(isl_pw_aff_get_ctx(pwaff1
), isl_error_invalid
,
2597 "unaligned unnamed parameters", goto error
);
2598 pwaff1
= isl_pw_aff_align_params(pwaff1
, isl_pw_aff_get_space(pwaff2
));
2599 pwaff2
= isl_pw_aff_align_params(pwaff2
, isl_pw_aff_get_space(pwaff1
));
2600 return fn(pwaff1
, pwaff2
);
2602 isl_pw_aff_free(pwaff1
);
2603 isl_pw_aff_free(pwaff2
);
2607 /* Align the parameters of the to isl_pw_aff arguments and
2608 * then apply a function "fn" on them that returns an isl_map.
2610 static __isl_give isl_map
*align_params_pw_pw_map_and(
2611 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
2612 __isl_give isl_map
*(*fn
)(__isl_take isl_pw_aff
*pa1
,
2613 __isl_take isl_pw_aff
*pa2
))
2617 if (isl_space_match(pa1
->dim
, isl_dim_param
, pa2
->dim
, isl_dim_param
))
2618 return fn(pa1
, pa2
);
2619 if (!isl_space_has_named_params(pa1
->dim
) ||
2620 !isl_space_has_named_params(pa2
->dim
))
2621 isl_die(isl_pw_aff_get_ctx(pa1
), isl_error_invalid
,
2622 "unaligned unnamed parameters", goto error
);
2623 pa1
= isl_pw_aff_align_params(pa1
, isl_pw_aff_get_space(pa2
));
2624 pa2
= isl_pw_aff_align_params(pa2
, isl_pw_aff_get_space(pa1
));
2625 return fn(pa1
, pa2
);
2627 isl_pw_aff_free(pa1
);
2628 isl_pw_aff_free(pa2
);
2632 /* Compute a piecewise quasi-affine expression with a domain that
2633 * is the union of those of pwaff1 and pwaff2 and such that on each
2634 * cell, the quasi-affine expression is the better (according to cmp)
2635 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
2636 * is defined on a given cell, then the associated expression
2637 * is the defined one.
2639 static __isl_give isl_pw_aff
*pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
2640 __isl_take isl_pw_aff
*pwaff2
,
2641 __isl_give isl_basic_set
*(*cmp
)(__isl_take isl_aff
*aff1
,
2642 __isl_take isl_aff
*aff2
))
2649 if (!pwaff1
|| !pwaff2
)
2652 ctx
= isl_space_get_ctx(pwaff1
->dim
);
2653 if (!isl_space_is_equal(pwaff1
->dim
, pwaff2
->dim
))
2654 isl_die(ctx
, isl_error_invalid
,
2655 "arguments should live in same space", goto error
);
2657 if (isl_pw_aff_is_empty(pwaff1
)) {
2658 isl_pw_aff_free(pwaff1
);
2662 if (isl_pw_aff_is_empty(pwaff2
)) {
2663 isl_pw_aff_free(pwaff2
);
2667 n
= 2 * (pwaff1
->n
+ 1) * (pwaff2
->n
+ 1);
2668 res
= isl_pw_aff_alloc_size(isl_space_copy(pwaff1
->dim
), n
);
2670 for (i
= 0; i
< pwaff1
->n
; ++i
) {
2671 set
= isl_set_copy(pwaff1
->p
[i
].set
);
2672 for (j
= 0; j
< pwaff2
->n
; ++j
) {
2673 struct isl_set
*common
;
2676 common
= isl_set_intersect(
2677 isl_set_copy(pwaff1
->p
[i
].set
),
2678 isl_set_copy(pwaff2
->p
[j
].set
));
2679 better
= isl_set_from_basic_set(cmp(
2680 isl_aff_copy(pwaff2
->p
[j
].aff
),
2681 isl_aff_copy(pwaff1
->p
[i
].aff
)));
2682 better
= isl_set_intersect(common
, better
);
2683 if (isl_set_plain_is_empty(better
)) {
2684 isl_set_free(better
);
2687 set
= isl_set_subtract(set
, isl_set_copy(better
));
2689 res
= isl_pw_aff_add_piece(res
, better
,
2690 isl_aff_copy(pwaff2
->p
[j
].aff
));
2692 res
= isl_pw_aff_add_piece(res
, set
,
2693 isl_aff_copy(pwaff1
->p
[i
].aff
));
2696 for (j
= 0; j
< pwaff2
->n
; ++j
) {
2697 set
= isl_set_copy(pwaff2
->p
[j
].set
);
2698 for (i
= 0; i
< pwaff1
->n
; ++i
)
2699 set
= isl_set_subtract(set
,
2700 isl_set_copy(pwaff1
->p
[i
].set
));
2701 res
= isl_pw_aff_add_piece(res
, set
,
2702 isl_aff_copy(pwaff2
->p
[j
].aff
));
2705 isl_pw_aff_free(pwaff1
);
2706 isl_pw_aff_free(pwaff2
);
2710 isl_pw_aff_free(pwaff1
);
2711 isl_pw_aff_free(pwaff2
);
2715 /* Compute a piecewise quasi-affine expression with a domain that
2716 * is the union of those of pwaff1 and pwaff2 and such that on each
2717 * cell, the quasi-affine expression is the maximum of those of pwaff1
2718 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2719 * cell, then the associated expression is the defined one.
2721 static __isl_give isl_pw_aff
*pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2722 __isl_take isl_pw_aff
*pwaff2
)
2724 return pw_aff_union_opt(pwaff1
, pwaff2
, &isl_aff_ge_basic_set
);
2727 __isl_give isl_pw_aff
*isl_pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2728 __isl_take isl_pw_aff
*pwaff2
)
2730 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2734 /* Compute a piecewise quasi-affine expression with a domain that
2735 * is the union of those of pwaff1 and pwaff2 and such that on each
2736 * cell, the quasi-affine expression is the minimum of those of pwaff1
2737 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2738 * cell, then the associated expression is the defined one.
2740 static __isl_give isl_pw_aff
*pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2741 __isl_take isl_pw_aff
*pwaff2
)
2743 return pw_aff_union_opt(pwaff1
, pwaff2
, &isl_aff_le_basic_set
);
2746 __isl_give isl_pw_aff
*isl_pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2747 __isl_take isl_pw_aff
*pwaff2
)
2749 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2753 __isl_give isl_pw_aff
*isl_pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
2754 __isl_take isl_pw_aff
*pwaff2
, int max
)
2757 return isl_pw_aff_union_max(pwaff1
, pwaff2
);
2759 return isl_pw_aff_union_min(pwaff1
, pwaff2
);
2762 /* Construct a map with as domain the domain of pwaff and
2763 * one-dimensional range corresponding to the affine expressions.
2765 static __isl_give isl_map
*map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2774 dim
= isl_pw_aff_get_space(pwaff
);
2775 map
= isl_map_empty(dim
);
2777 for (i
= 0; i
< pwaff
->n
; ++i
) {
2778 isl_basic_map
*bmap
;
2781 bmap
= isl_basic_map_from_aff(isl_aff_copy(pwaff
->p
[i
].aff
));
2782 map_i
= isl_map_from_basic_map(bmap
);
2783 map_i
= isl_map_intersect_domain(map_i
,
2784 isl_set_copy(pwaff
->p
[i
].set
));
2785 map
= isl_map_union_disjoint(map
, map_i
);
2788 isl_pw_aff_free(pwaff
);
2793 /* Construct a map with as domain the domain of pwaff and
2794 * one-dimensional range corresponding to the affine expressions.
2796 __isl_give isl_map
*isl_map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2800 if (isl_space_is_set(pwaff
->dim
))
2801 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2802 "space of input is not a map", goto error
);
2803 return map_from_pw_aff(pwaff
);
2805 isl_pw_aff_free(pwaff
);
2809 /* Construct a one-dimensional set with as parameter domain
2810 * the domain of pwaff and the single set dimension
2811 * corresponding to the affine expressions.
2813 __isl_give isl_set
*isl_set_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2817 if (!isl_space_is_set(pwaff
->dim
))
2818 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2819 "space of input is not a set", goto error
);
2820 return map_from_pw_aff(pwaff
);
2822 isl_pw_aff_free(pwaff
);
2826 /* Return a set containing those elements in the domain
2827 * of "pwaff" where it satisfies "fn" (if complement is 0) or
2828 * does not satisfy "fn" (if complement is 1).
2830 * The pieces with a NaN never belong to the result since
2831 * NaN does not satisfy any property.
2833 static __isl_give isl_set
*pw_aff_locus(__isl_take isl_pw_aff
*pwaff
,
2834 __isl_give isl_basic_set
*(*fn
)(__isl_take isl_aff
*aff
, int rational
),
2843 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
2845 for (i
= 0; i
< pwaff
->n
; ++i
) {
2846 isl_basic_set
*bset
;
2847 isl_set
*set_i
, *locus
;
2850 if (isl_aff_is_nan(pwaff
->p
[i
].aff
))
2853 rational
= isl_set_has_rational(pwaff
->p
[i
].set
);
2854 bset
= fn(isl_aff_copy(pwaff
->p
[i
].aff
), rational
);
2855 locus
= isl_set_from_basic_set(bset
);
2856 set_i
= isl_set_copy(pwaff
->p
[i
].set
);
2858 set_i
= isl_set_subtract(set_i
, locus
);
2860 set_i
= isl_set_intersect(set_i
, locus
);
2861 set
= isl_set_union_disjoint(set
, set_i
);
2864 isl_pw_aff_free(pwaff
);
2869 /* Return a set containing those elements in the domain
2870 * of "pa" where it is positive.
2872 __isl_give isl_set
*isl_pw_aff_pos_set(__isl_take isl_pw_aff
*pa
)
2874 return pw_aff_locus(pa
, &aff_pos_basic_set
, 0);
2877 /* Return a set containing those elements in the domain
2878 * of pwaff where it is non-negative.
2880 __isl_give isl_set
*isl_pw_aff_nonneg_set(__isl_take isl_pw_aff
*pwaff
)
2882 return pw_aff_locus(pwaff
, &aff_nonneg_basic_set
, 0);
2885 /* Return a set containing those elements in the domain
2886 * of pwaff where it is zero.
2888 __isl_give isl_set
*isl_pw_aff_zero_set(__isl_take isl_pw_aff
*pwaff
)
2890 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 0);
2893 /* Return a set containing those elements in the domain
2894 * of pwaff where it is not zero.
2896 __isl_give isl_set
*isl_pw_aff_non_zero_set(__isl_take isl_pw_aff
*pwaff
)
2898 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 1);
2901 /* Return a set containing those elements in the shared domain
2902 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
2904 * We compute the difference on the shared domain and then construct
2905 * the set of values where this difference is non-negative.
2906 * If strict is set, we first subtract 1 from the difference.
2907 * If equal is set, we only return the elements where pwaff1 and pwaff2
2910 static __isl_give isl_set
*pw_aff_gte_set(__isl_take isl_pw_aff
*pwaff1
,
2911 __isl_take isl_pw_aff
*pwaff2
, int strict
, int equal
)
2913 isl_set
*set1
, *set2
;
2915 set1
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
));
2916 set2
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
));
2917 set1
= isl_set_intersect(set1
, set2
);
2918 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, isl_set_copy(set1
));
2919 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, isl_set_copy(set1
));
2920 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_neg(pwaff2
));
2923 isl_space
*dim
= isl_set_get_space(set1
);
2925 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2926 aff
= isl_aff_add_constant_si(aff
, -1);
2927 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_alloc(set1
, aff
));
2932 return isl_pw_aff_zero_set(pwaff1
);
2933 return isl_pw_aff_nonneg_set(pwaff1
);
2936 /* Return a set containing those elements in the shared domain
2937 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
2939 static __isl_give isl_set
*pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2940 __isl_take isl_pw_aff
*pwaff2
)
2942 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 1);
2945 __isl_give isl_set
*isl_pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2946 __isl_take isl_pw_aff
*pwaff2
)
2948 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_eq_set
);
2951 /* Return a set containing those elements in the shared domain
2952 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
2954 static __isl_give isl_set
*pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2955 __isl_take isl_pw_aff
*pwaff2
)
2957 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 0);
2960 __isl_give isl_set
*isl_pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2961 __isl_take isl_pw_aff
*pwaff2
)
2963 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ge_set
);
2966 /* Return a set containing those elements in the shared domain
2967 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
2969 static __isl_give isl_set
*pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2970 __isl_take isl_pw_aff
*pwaff2
)
2972 return pw_aff_gte_set(pwaff1
, pwaff2
, 1, 0);
2975 __isl_give isl_set
*isl_pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2976 __isl_take isl_pw_aff
*pwaff2
)
2978 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_gt_set
);
2981 __isl_give isl_set
*isl_pw_aff_le_set(__isl_take isl_pw_aff
*pwaff1
,
2982 __isl_take isl_pw_aff
*pwaff2
)
2984 return isl_pw_aff_ge_set(pwaff2
, pwaff1
);
2987 __isl_give isl_set
*isl_pw_aff_lt_set(__isl_take isl_pw_aff
*pwaff1
,
2988 __isl_take isl_pw_aff
*pwaff2
)
2990 return isl_pw_aff_gt_set(pwaff2
, pwaff1
);
2993 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2994 * where the function values are ordered in the same way as "order",
2995 * which returns a set in the shared domain of its two arguments.
2996 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
2998 * Let "pa1" and "pa2" be defined on domains A and B respectively.
2999 * We first pull back the two functions such that they are defined on
3000 * the domain [A -> B]. Then we apply "order", resulting in a set
3001 * in the space [A -> B]. Finally, we unwrap this set to obtain
3002 * a map in the space A -> B.
3004 static __isl_give isl_map
*isl_pw_aff_order_map_aligned(
3005 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
3006 __isl_give isl_set
*(*order
)(__isl_take isl_pw_aff
*pa1
,
3007 __isl_take isl_pw_aff
*pa2
))
3009 isl_space
*space1
, *space2
;
3013 space1
= isl_space_domain(isl_pw_aff_get_space(pa1
));
3014 space2
= isl_space_domain(isl_pw_aff_get_space(pa2
));
3015 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
3016 ma
= isl_multi_aff_domain_map(isl_space_copy(space1
));
3017 pa1
= isl_pw_aff_pullback_multi_aff(pa1
, ma
);
3018 ma
= isl_multi_aff_range_map(space1
);
3019 pa2
= isl_pw_aff_pullback_multi_aff(pa2
, ma
);
3020 set
= order(pa1
, pa2
);
3022 return isl_set_unwrap(set
);
3025 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3026 * where the function values are equal.
3027 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3029 static __isl_give isl_map
*isl_pw_aff_eq_map_aligned(__isl_take isl_pw_aff
*pa1
,
3030 __isl_take isl_pw_aff
*pa2
)
3032 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_eq_set
);
3035 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3036 * where the function values are equal.
3038 __isl_give isl_map
*isl_pw_aff_eq_map(__isl_take isl_pw_aff
*pa1
,
3039 __isl_take isl_pw_aff
*pa2
)
3041 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_eq_map_aligned
);
3044 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3045 * where the function value of "pa1" is less than the function value of "pa2".
3046 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3048 static __isl_give isl_map
*isl_pw_aff_lt_map_aligned(__isl_take isl_pw_aff
*pa1
,
3049 __isl_take isl_pw_aff
*pa2
)
3051 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_lt_set
);
3054 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3055 * where the function value of "pa1" is less than the function value of "pa2".
3057 __isl_give isl_map
*isl_pw_aff_lt_map(__isl_take isl_pw_aff
*pa1
,
3058 __isl_take isl_pw_aff
*pa2
)
3060 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_lt_map_aligned
);
3063 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3064 * where the function value of "pa1" is greater than the function value
3066 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3068 static __isl_give isl_map
*isl_pw_aff_gt_map_aligned(__isl_take isl_pw_aff
*pa1
,
3069 __isl_take isl_pw_aff
*pa2
)
3071 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_gt_set
);
3074 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3075 * where the function value of "pa1" is greater than the function value
3078 __isl_give isl_map
*isl_pw_aff_gt_map(__isl_take isl_pw_aff
*pa1
,
3079 __isl_take isl_pw_aff
*pa2
)
3081 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_gt_map_aligned
);
3084 /* Return a set containing those elements in the shared domain
3085 * of the elements of list1 and list2 where each element in list1
3086 * has the relation specified by "fn" with each element in list2.
3088 static __isl_give isl_set
*pw_aff_list_set(__isl_take isl_pw_aff_list
*list1
,
3089 __isl_take isl_pw_aff_list
*list2
,
3090 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3091 __isl_take isl_pw_aff
*pwaff2
))
3097 if (!list1
|| !list2
)
3100 ctx
= isl_pw_aff_list_get_ctx(list1
);
3101 if (list1
->n
< 1 || list2
->n
< 1)
3102 isl_die(ctx
, isl_error_invalid
,
3103 "list should contain at least one element", goto error
);
3105 set
= isl_set_universe(isl_pw_aff_get_domain_space(list1
->p
[0]));
3106 for (i
= 0; i
< list1
->n
; ++i
)
3107 for (j
= 0; j
< list2
->n
; ++j
) {
3110 set_ij
= fn(isl_pw_aff_copy(list1
->p
[i
]),
3111 isl_pw_aff_copy(list2
->p
[j
]));
3112 set
= isl_set_intersect(set
, set_ij
);
3115 isl_pw_aff_list_free(list1
);
3116 isl_pw_aff_list_free(list2
);
3119 isl_pw_aff_list_free(list1
);
3120 isl_pw_aff_list_free(list2
);
3124 /* Return a set containing those elements in the shared domain
3125 * of the elements of list1 and list2 where each element in list1
3126 * is equal to each element in list2.
3128 __isl_give isl_set
*isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list
*list1
,
3129 __isl_take isl_pw_aff_list
*list2
)
3131 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_eq_set
);
3134 __isl_give isl_set
*isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list
*list1
,
3135 __isl_take isl_pw_aff_list
*list2
)
3137 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ne_set
);
3140 /* Return a set containing those elements in the shared domain
3141 * of the elements of list1 and list2 where each element in list1
3142 * is less than or equal to each element in list2.
3144 __isl_give isl_set
*isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list
*list1
,
3145 __isl_take isl_pw_aff_list
*list2
)
3147 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_le_set
);
3150 __isl_give isl_set
*isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list
*list1
,
3151 __isl_take isl_pw_aff_list
*list2
)
3153 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_lt_set
);
3156 __isl_give isl_set
*isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list
*list1
,
3157 __isl_take isl_pw_aff_list
*list2
)
3159 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ge_set
);
3162 __isl_give isl_set
*isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list
*list1
,
3163 __isl_take isl_pw_aff_list
*list2
)
3165 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_gt_set
);
3169 /* Return a set containing those elements in the shared domain
3170 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
3172 static __isl_give isl_set
*pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3173 __isl_take isl_pw_aff
*pwaff2
)
3175 isl_set
*set_lt
, *set_gt
;
3177 set_lt
= isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1
),
3178 isl_pw_aff_copy(pwaff2
));
3179 set_gt
= isl_pw_aff_gt_set(pwaff1
, pwaff2
);
3180 return isl_set_union_disjoint(set_lt
, set_gt
);
3183 __isl_give isl_set
*isl_pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3184 __isl_take isl_pw_aff
*pwaff2
)
3186 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ne_set
);
3189 __isl_give isl_pw_aff
*isl_pw_aff_scale_down(__isl_take isl_pw_aff
*pwaff
,
3194 if (isl_int_is_one(v
))
3196 if (!isl_int_is_pos(v
))
3197 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
3198 "factor needs to be positive",
3199 return isl_pw_aff_free(pwaff
));
3200 pwaff
= isl_pw_aff_cow(pwaff
);
3206 for (i
= 0; i
< pwaff
->n
; ++i
) {
3207 pwaff
->p
[i
].aff
= isl_aff_scale_down(pwaff
->p
[i
].aff
, v
);
3208 if (!pwaff
->p
[i
].aff
)
3209 return isl_pw_aff_free(pwaff
);
3215 __isl_give isl_pw_aff
*isl_pw_aff_floor(__isl_take isl_pw_aff
*pwaff
)
3219 pwaff
= isl_pw_aff_cow(pwaff
);
3225 for (i
= 0; i
< pwaff
->n
; ++i
) {
3226 pwaff
->p
[i
].aff
= isl_aff_floor(pwaff
->p
[i
].aff
);
3227 if (!pwaff
->p
[i
].aff
)
3228 return isl_pw_aff_free(pwaff
);
3234 __isl_give isl_pw_aff
*isl_pw_aff_ceil(__isl_take isl_pw_aff
*pwaff
)
3238 pwaff
= isl_pw_aff_cow(pwaff
);
3244 for (i
= 0; i
< pwaff
->n
; ++i
) {
3245 pwaff
->p
[i
].aff
= isl_aff_ceil(pwaff
->p
[i
].aff
);
3246 if (!pwaff
->p
[i
].aff
)
3247 return isl_pw_aff_free(pwaff
);
3253 /* Assuming that "cond1" and "cond2" are disjoint,
3254 * return an affine expression that is equal to pwaff1 on cond1
3255 * and to pwaff2 on cond2.
3257 static __isl_give isl_pw_aff
*isl_pw_aff_select(
3258 __isl_take isl_set
*cond1
, __isl_take isl_pw_aff
*pwaff1
,
3259 __isl_take isl_set
*cond2
, __isl_take isl_pw_aff
*pwaff2
)
3261 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, cond1
);
3262 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, cond2
);
3264 return isl_pw_aff_add_disjoint(pwaff1
, pwaff2
);
3267 /* Return an affine expression that is equal to pwaff_true for elements
3268 * where "cond" is non-zero and to pwaff_false for elements where "cond"
3270 * That is, return cond ? pwaff_true : pwaff_false;
3272 * If "cond" involves and NaN, then we conservatively return a NaN
3273 * on its entire domain. In principle, we could consider the pieces
3274 * where it is NaN separately from those where it is not.
3276 __isl_give isl_pw_aff
*isl_pw_aff_cond(__isl_take isl_pw_aff
*cond
,
3277 __isl_take isl_pw_aff
*pwaff_true
, __isl_take isl_pw_aff
*pwaff_false
)
3279 isl_set
*cond_true
, *cond_false
;
3283 if (isl_pw_aff_involves_nan(cond
)) {
3284 isl_space
*space
= isl_pw_aff_get_domain_space(cond
);
3285 isl_local_space
*ls
= isl_local_space_from_space(space
);
3286 isl_pw_aff_free(cond
);
3287 isl_pw_aff_free(pwaff_true
);
3288 isl_pw_aff_free(pwaff_false
);
3289 return isl_pw_aff_nan_on_domain(ls
);
3292 cond_true
= isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond
));
3293 cond_false
= isl_pw_aff_zero_set(cond
);
3294 return isl_pw_aff_select(cond_true
, pwaff_true
,
3295 cond_false
, pwaff_false
);
3297 isl_pw_aff_free(cond
);
3298 isl_pw_aff_free(pwaff_true
);
3299 isl_pw_aff_free(pwaff_false
);
3303 isl_bool
isl_aff_is_cst(__isl_keep isl_aff
*aff
)
3306 return isl_bool_error
;
3308 return isl_seq_first_non_zero(aff
->v
->el
+ 2, aff
->v
->size
- 2) == -1;
3311 /* Check whether pwaff is a piecewise constant.
3313 isl_bool
isl_pw_aff_is_cst(__isl_keep isl_pw_aff
*pwaff
)
3318 return isl_bool_error
;
3320 for (i
= 0; i
< pwaff
->n
; ++i
) {
3321 isl_bool is_cst
= isl_aff_is_cst(pwaff
->p
[i
].aff
);
3322 if (is_cst
< 0 || !is_cst
)
3326 return isl_bool_true
;
3329 /* Return the product of "aff1" and "aff2".
3331 * If either of the two is NaN, then the result is NaN.
3333 * Otherwise, at least one of "aff1" or "aff2" needs to be a constant.
3335 __isl_give isl_aff
*isl_aff_mul(__isl_take isl_aff
*aff1
,
3336 __isl_take isl_aff
*aff2
)
3341 if (isl_aff_is_nan(aff1
)) {
3345 if (isl_aff_is_nan(aff2
)) {
3350 if (!isl_aff_is_cst(aff2
) && isl_aff_is_cst(aff1
))
3351 return isl_aff_mul(aff2
, aff1
);
3353 if (!isl_aff_is_cst(aff2
))
3354 isl_die(isl_aff_get_ctx(aff1
), isl_error_invalid
,
3355 "at least one affine expression should be constant",
3358 aff1
= isl_aff_cow(aff1
);
3362 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[1]);
3363 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[0]);
3373 /* Divide "aff1" by "aff2", assuming "aff2" is a constant.
3375 * If either of the two is NaN, then the result is NaN.
3377 __isl_give isl_aff
*isl_aff_div(__isl_take isl_aff
*aff1
,
3378 __isl_take isl_aff
*aff2
)
3386 if (isl_aff_is_nan(aff1
)) {
3390 if (isl_aff_is_nan(aff2
)) {
3395 is_cst
= isl_aff_is_cst(aff2
);
3399 isl_die(isl_aff_get_ctx(aff2
), isl_error_invalid
,
3400 "second argument should be a constant", goto error
);
3405 neg
= isl_int_is_neg(aff2
->v
->el
[1]);
3407 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3408 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3411 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[0]);
3412 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[1]);
3415 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3416 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3427 static __isl_give isl_pw_aff
*pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3428 __isl_take isl_pw_aff
*pwaff2
)
3430 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_add
);
3433 __isl_give isl_pw_aff
*isl_pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3434 __isl_take isl_pw_aff
*pwaff2
)
3436 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_add
);
3439 __isl_give isl_pw_aff
*isl_pw_aff_union_add(__isl_take isl_pw_aff
*pwaff1
,
3440 __isl_take isl_pw_aff
*pwaff2
)
3442 return isl_pw_aff_union_add_(pwaff1
, pwaff2
);
3445 static __isl_give isl_pw_aff
*pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
3446 __isl_take isl_pw_aff
*pwaff2
)
3448 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_mul
);
3451 __isl_give isl_pw_aff
*isl_pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
3452 __isl_take isl_pw_aff
*pwaff2
)
3454 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_mul
);
3457 static __isl_give isl_pw_aff
*pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3458 __isl_take isl_pw_aff
*pa2
)
3460 return isl_pw_aff_on_shared_domain(pa1
, pa2
, &isl_aff_div
);
3463 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
3465 __isl_give isl_pw_aff
*isl_pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3466 __isl_take isl_pw_aff
*pa2
)
3470 is_cst
= isl_pw_aff_is_cst(pa2
);
3474 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3475 "second argument should be a piecewise constant",
3477 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_div
);
3479 isl_pw_aff_free(pa1
);
3480 isl_pw_aff_free(pa2
);
3484 /* Compute the quotient of the integer division of "pa1" by "pa2"
3485 * with rounding towards zero.
3486 * "pa2" is assumed to be a piecewise constant.
3488 * In particular, return
3490 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
3493 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_q(__isl_take isl_pw_aff
*pa1
,
3494 __isl_take isl_pw_aff
*pa2
)
3500 is_cst
= isl_pw_aff_is_cst(pa2
);
3504 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3505 "second argument should be a piecewise constant",
3508 pa1
= isl_pw_aff_div(pa1
, pa2
);
3510 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1
));
3511 f
= isl_pw_aff_floor(isl_pw_aff_copy(pa1
));
3512 c
= isl_pw_aff_ceil(pa1
);
3513 return isl_pw_aff_cond(isl_set_indicator_function(cond
), f
, c
);
3515 isl_pw_aff_free(pa1
);
3516 isl_pw_aff_free(pa2
);
3520 /* Compute the remainder of the integer division of "pa1" by "pa2"
3521 * with rounding towards zero.
3522 * "pa2" is assumed to be a piecewise constant.
3524 * In particular, return
3526 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
3529 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_r(__isl_take isl_pw_aff
*pa1
,
3530 __isl_take isl_pw_aff
*pa2
)
3535 is_cst
= isl_pw_aff_is_cst(pa2
);
3539 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3540 "second argument should be a piecewise constant",
3542 res
= isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1
), isl_pw_aff_copy(pa2
));
3543 res
= isl_pw_aff_mul(pa2
, res
);
3544 res
= isl_pw_aff_sub(pa1
, res
);
3547 isl_pw_aff_free(pa1
);
3548 isl_pw_aff_free(pa2
);
3552 static __isl_give isl_pw_aff
*pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3553 __isl_take isl_pw_aff
*pwaff2
)
3558 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3559 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3560 le
= isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1
),
3561 isl_pw_aff_copy(pwaff2
));
3562 dom
= isl_set_subtract(dom
, isl_set_copy(le
));
3563 return isl_pw_aff_select(le
, pwaff1
, dom
, pwaff2
);
3566 __isl_give isl_pw_aff
*isl_pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3567 __isl_take isl_pw_aff
*pwaff2
)
3569 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_min
);
3572 static __isl_give isl_pw_aff
*pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3573 __isl_take isl_pw_aff
*pwaff2
)
3578 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3579 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3580 ge
= isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1
),
3581 isl_pw_aff_copy(pwaff2
));
3582 dom
= isl_set_subtract(dom
, isl_set_copy(ge
));
3583 return isl_pw_aff_select(ge
, pwaff1
, dom
, pwaff2
);
3586 __isl_give isl_pw_aff
*isl_pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3587 __isl_take isl_pw_aff
*pwaff2
)
3589 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_max
);
3592 static __isl_give isl_pw_aff
*pw_aff_list_reduce(
3593 __isl_take isl_pw_aff_list
*list
,
3594 __isl_give isl_pw_aff
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3595 __isl_take isl_pw_aff
*pwaff2
))
3604 ctx
= isl_pw_aff_list_get_ctx(list
);
3606 isl_die(ctx
, isl_error_invalid
,
3607 "list should contain at least one element", goto error
);
3609 res
= isl_pw_aff_copy(list
->p
[0]);
3610 for (i
= 1; i
< list
->n
; ++i
)
3611 res
= fn(res
, isl_pw_aff_copy(list
->p
[i
]));
3613 isl_pw_aff_list_free(list
);
3616 isl_pw_aff_list_free(list
);
3620 /* Return an isl_pw_aff that maps each element in the intersection of the
3621 * domains of the elements of list to the minimal corresponding affine
3624 __isl_give isl_pw_aff
*isl_pw_aff_list_min(__isl_take isl_pw_aff_list
*list
)
3626 return pw_aff_list_reduce(list
, &isl_pw_aff_min
);
3629 /* Return an isl_pw_aff that maps each element in the intersection of the
3630 * domains of the elements of list to the maximal corresponding affine
3633 __isl_give isl_pw_aff
*isl_pw_aff_list_max(__isl_take isl_pw_aff_list
*list
)
3635 return pw_aff_list_reduce(list
, &isl_pw_aff_max
);
3638 /* Mark the domains of "pwaff" as rational.
3640 __isl_give isl_pw_aff
*isl_pw_aff_set_rational(__isl_take isl_pw_aff
*pwaff
)
3644 pwaff
= isl_pw_aff_cow(pwaff
);
3650 for (i
= 0; i
< pwaff
->n
; ++i
) {
3651 pwaff
->p
[i
].set
= isl_set_set_rational(pwaff
->p
[i
].set
);
3652 if (!pwaff
->p
[i
].set
)
3653 return isl_pw_aff_free(pwaff
);
3659 /* Mark the domains of the elements of "list" as rational.
3661 __isl_give isl_pw_aff_list
*isl_pw_aff_list_set_rational(
3662 __isl_take isl_pw_aff_list
*list
)
3672 for (i
= 0; i
< n
; ++i
) {
3675 pa
= isl_pw_aff_list_get_pw_aff(list
, i
);
3676 pa
= isl_pw_aff_set_rational(pa
);
3677 list
= isl_pw_aff_list_set_pw_aff(list
, i
, pa
);
3683 /* Do the parameters of "aff" match those of "space"?
3685 int isl_aff_matching_params(__isl_keep isl_aff
*aff
,
3686 __isl_keep isl_space
*space
)
3688 isl_space
*aff_space
;
3694 aff_space
= isl_aff_get_domain_space(aff
);
3696 match
= isl_space_match(space
, isl_dim_param
, aff_space
, isl_dim_param
);
3698 isl_space_free(aff_space
);
3702 /* Check that the domain space of "aff" matches "space".
3704 * Return 0 on success and -1 on error.
3706 int isl_aff_check_match_domain_space(__isl_keep isl_aff
*aff
,
3707 __isl_keep isl_space
*space
)
3709 isl_space
*aff_space
;
3715 aff_space
= isl_aff_get_domain_space(aff
);
3717 match
= isl_space_match(space
, isl_dim_param
, aff_space
, isl_dim_param
);
3721 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3722 "parameters don't match", goto error
);
3723 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
3724 aff_space
, isl_dim_set
);
3728 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3729 "domains don't match", goto error
);
3730 isl_space_free(aff_space
);
3733 isl_space_free(aff_space
);
3743 #include <isl_multi_templ.c>
3744 #include <isl_multi_apply_set.c>
3745 #include <isl_multi_floor.c>
3746 #include <isl_multi_gist.c>
3750 /* Remove any internal structure of the domain of "ma".
3751 * If there is any such internal structure in the input,
3752 * then the name of the corresponding space is also removed.
3754 __isl_give isl_multi_aff
*isl_multi_aff_flatten_domain(
3755 __isl_take isl_multi_aff
*ma
)
3762 if (!ma
->space
->nested
[0])
3765 space
= isl_multi_aff_get_space(ma
);
3766 space
= isl_space_flatten_domain(space
);
3767 ma
= isl_multi_aff_reset_space(ma
, space
);
3772 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3773 * of the space to its domain.
3775 __isl_give isl_multi_aff
*isl_multi_aff_domain_map(__isl_take isl_space
*space
)
3778 isl_local_space
*ls
;
3783 if (!isl_space_is_map(space
))
3784 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3785 "not a map space", goto error
);
3787 n_in
= isl_space_dim(space
, isl_dim_in
);
3788 space
= isl_space_domain_map(space
);
3790 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3792 isl_space_free(space
);
3796 space
= isl_space_domain(space
);
3797 ls
= isl_local_space_from_space(space
);
3798 for (i
= 0; i
< n_in
; ++i
) {
3801 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3803 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3805 isl_local_space_free(ls
);
3808 isl_space_free(space
);
3812 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3813 * of the space to its range.
3815 __isl_give isl_multi_aff
*isl_multi_aff_range_map(__isl_take isl_space
*space
)
3818 isl_local_space
*ls
;
3823 if (!isl_space_is_map(space
))
3824 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3825 "not a map space", goto error
);
3827 n_in
= isl_space_dim(space
, isl_dim_in
);
3828 n_out
= isl_space_dim(space
, isl_dim_out
);
3829 space
= isl_space_range_map(space
);
3831 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3833 isl_space_free(space
);
3837 space
= isl_space_domain(space
);
3838 ls
= isl_local_space_from_space(space
);
3839 for (i
= 0; i
< n_out
; ++i
) {
3842 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3843 isl_dim_set
, n_in
+ i
);
3844 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3846 isl_local_space_free(ls
);
3849 isl_space_free(space
);
3853 /* Given a map space, return an isl_pw_multi_aff that maps a wrapped copy
3854 * of the space to its range.
3856 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_map(
3857 __isl_take isl_space
*space
)
3859 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_range_map(space
));
3862 /* Given the space of a set and a range of set dimensions,
3863 * construct an isl_multi_aff that projects out those dimensions.
3865 __isl_give isl_multi_aff
*isl_multi_aff_project_out_map(
3866 __isl_take isl_space
*space
, enum isl_dim_type type
,
3867 unsigned first
, unsigned n
)
3870 isl_local_space
*ls
;
3875 if (!isl_space_is_set(space
))
3876 isl_die(isl_space_get_ctx(space
), isl_error_unsupported
,
3877 "expecting set space", goto error
);
3878 if (type
!= isl_dim_set
)
3879 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3880 "only set dimensions can be projected out", goto error
);
3882 dim
= isl_space_dim(space
, isl_dim_set
);
3883 if (first
+ n
> dim
)
3884 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3885 "range out of bounds", goto error
);
3887 space
= isl_space_from_domain(space
);
3888 space
= isl_space_add_dims(space
, isl_dim_out
, dim
- n
);
3891 return isl_multi_aff_alloc(space
);
3893 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3894 space
= isl_space_domain(space
);
3895 ls
= isl_local_space_from_space(space
);
3897 for (i
= 0; i
< first
; ++i
) {
3900 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3902 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3905 for (i
= 0; i
< dim
- (first
+ n
); ++i
) {
3908 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3909 isl_dim_set
, first
+ n
+ i
);
3910 ma
= isl_multi_aff_set_aff(ma
, first
+ i
, aff
);
3913 isl_local_space_free(ls
);
3916 isl_space_free(space
);
3920 /* Given the space of a set and a range of set dimensions,
3921 * construct an isl_pw_multi_aff that projects out those dimensions.
3923 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_project_out_map(
3924 __isl_take isl_space
*space
, enum isl_dim_type type
,
3925 unsigned first
, unsigned n
)
3929 ma
= isl_multi_aff_project_out_map(space
, type
, first
, n
);
3930 return isl_pw_multi_aff_from_multi_aff(ma
);
3933 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
3936 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_aff(
3937 __isl_take isl_multi_aff
*ma
)
3939 isl_set
*dom
= isl_set_universe(isl_multi_aff_get_domain_space(ma
));
3940 return isl_pw_multi_aff_alloc(dom
, ma
);
3943 /* Create a piecewise multi-affine expression in the given space that maps each
3944 * input dimension to the corresponding output dimension.
3946 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_identity(
3947 __isl_take isl_space
*space
)
3949 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space
));
3952 /* Exploit the equalities in "eq" to simplify the affine expressions.
3954 static __isl_give isl_multi_aff
*isl_multi_aff_substitute_equalities(
3955 __isl_take isl_multi_aff
*maff
, __isl_take isl_basic_set
*eq
)
3959 maff
= isl_multi_aff_cow(maff
);
3963 for (i
= 0; i
< maff
->n
; ++i
) {
3964 maff
->p
[i
] = isl_aff_substitute_equalities(maff
->p
[i
],
3965 isl_basic_set_copy(eq
));
3970 isl_basic_set_free(eq
);
3973 isl_basic_set_free(eq
);
3974 isl_multi_aff_free(maff
);
3978 __isl_give isl_multi_aff
*isl_multi_aff_scale(__isl_take isl_multi_aff
*maff
,
3983 maff
= isl_multi_aff_cow(maff
);
3987 for (i
= 0; i
< maff
->n
; ++i
) {
3988 maff
->p
[i
] = isl_aff_scale(maff
->p
[i
], f
);
3990 return isl_multi_aff_free(maff
);
3996 __isl_give isl_multi_aff
*isl_multi_aff_add_on_domain(__isl_keep isl_set
*dom
,
3997 __isl_take isl_multi_aff
*maff1
, __isl_take isl_multi_aff
*maff2
)
3999 maff1
= isl_multi_aff_add(maff1
, maff2
);
4000 maff1
= isl_multi_aff_gist(maff1
, isl_set_copy(dom
));
4004 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff
*maff
)
4012 /* Return the set of domain elements where "ma1" is lexicographically
4013 * smaller than or equal to "ma2".
4015 __isl_give isl_set
*isl_multi_aff_lex_le_set(__isl_take isl_multi_aff
*ma1
,
4016 __isl_take isl_multi_aff
*ma2
)
4018 return isl_multi_aff_lex_ge_set(ma2
, ma1
);
4021 /* Return the set of domain elements where "ma1" is lexicographically
4022 * greater than or equal to "ma2".
4024 __isl_give isl_set
*isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff
*ma1
,
4025 __isl_take isl_multi_aff
*ma2
)
4028 isl_map
*map1
, *map2
;
4031 map1
= isl_map_from_multi_aff(ma1
);
4032 map2
= isl_map_from_multi_aff(ma2
);
4033 map
= isl_map_range_product(map1
, map2
);
4034 space
= isl_space_range(isl_map_get_space(map
));
4035 space
= isl_space_domain(isl_space_unwrap(space
));
4036 ge
= isl_map_lex_ge(space
);
4037 map
= isl_map_intersect_range(map
, isl_map_wrap(ge
));
4039 return isl_map_domain(map
);
4043 #define PW isl_pw_multi_aff
4045 #define EL isl_multi_aff
4047 #define EL_IS_ZERO is_empty
4051 #define IS_ZERO is_empty
4054 #undef DEFAULT_IS_ZERO
4055 #define DEFAULT_IS_ZERO 0
4060 #define NO_INVOLVES_DIMS
4061 #define NO_INSERT_DIMS
4065 #include <isl_pw_templ.c>
4070 #define UNION isl_union_pw_multi_aff
4072 #define PART isl_pw_multi_aff
4074 #define PARTS pw_multi_aff
4076 #include <isl_union_multi.c>
4077 #include <isl_union_neg.c>
4079 /* Given a function "cmp" that returns the set of elements where
4080 * "ma1" is "better" than "ma2", return the intersection of this
4081 * set with "dom1" and "dom2".
4083 static __isl_give isl_set
*shared_and_better(__isl_keep isl_set
*dom1
,
4084 __isl_keep isl_set
*dom2
, __isl_keep isl_multi_aff
*ma1
,
4085 __isl_keep isl_multi_aff
*ma2
,
4086 __isl_give isl_set
*(*cmp
)(__isl_take isl_multi_aff
*ma1
,
4087 __isl_take isl_multi_aff
*ma2
))
4093 common
= isl_set_intersect(isl_set_copy(dom1
), isl_set_copy(dom2
));
4094 is_empty
= isl_set_plain_is_empty(common
);
4095 if (is_empty
>= 0 && is_empty
)
4098 return isl_set_free(common
);
4099 better
= cmp(isl_multi_aff_copy(ma1
), isl_multi_aff_copy(ma2
));
4100 better
= isl_set_intersect(common
, better
);
4105 /* Given a function "cmp" that returns the set of elements where
4106 * "ma1" is "better" than "ma2", return a piecewise multi affine
4107 * expression defined on the union of the definition domains
4108 * of "pma1" and "pma2" that maps to the "best" of "pma1" and
4109 * "pma2" on each cell. If only one of the two input functions
4110 * is defined on a given cell, then it is considered the best.
4112 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_opt(
4113 __isl_take isl_pw_multi_aff
*pma1
,
4114 __isl_take isl_pw_multi_aff
*pma2
,
4115 __isl_give isl_set
*(*cmp
)(__isl_take isl_multi_aff
*ma1
,
4116 __isl_take isl_multi_aff
*ma2
))
4119 isl_pw_multi_aff
*res
= NULL
;
4121 isl_set
*set
= NULL
;
4126 ctx
= isl_space_get_ctx(pma1
->dim
);
4127 if (!isl_space_is_equal(pma1
->dim
, pma2
->dim
))
4128 isl_die(ctx
, isl_error_invalid
,
4129 "arguments should live in the same space", goto error
);
4131 if (isl_pw_multi_aff_is_empty(pma1
)) {
4132 isl_pw_multi_aff_free(pma1
);
4136 if (isl_pw_multi_aff_is_empty(pma2
)) {
4137 isl_pw_multi_aff_free(pma2
);
4141 n
= 2 * (pma1
->n
+ 1) * (pma2
->n
+ 1);
4142 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma1
->dim
), n
);
4144 for (i
= 0; i
< pma1
->n
; ++i
) {
4145 set
= isl_set_copy(pma1
->p
[i
].set
);
4146 for (j
= 0; j
< pma2
->n
; ++j
) {
4150 better
= shared_and_better(pma2
->p
[j
].set
,
4151 pma1
->p
[i
].set
, pma2
->p
[j
].maff
,
4152 pma1
->p
[i
].maff
, cmp
);
4153 is_empty
= isl_set_plain_is_empty(better
);
4154 if (is_empty
< 0 || is_empty
) {
4155 isl_set_free(better
);
4160 set
= isl_set_subtract(set
, isl_set_copy(better
));
4162 res
= isl_pw_multi_aff_add_piece(res
, better
,
4163 isl_multi_aff_copy(pma2
->p
[j
].maff
));
4165 res
= isl_pw_multi_aff_add_piece(res
, set
,
4166 isl_multi_aff_copy(pma1
->p
[i
].maff
));
4169 for (j
= 0; j
< pma2
->n
; ++j
) {
4170 set
= isl_set_copy(pma2
->p
[j
].set
);
4171 for (i
= 0; i
< pma1
->n
; ++i
)
4172 set
= isl_set_subtract(set
,
4173 isl_set_copy(pma1
->p
[i
].set
));
4174 res
= isl_pw_multi_aff_add_piece(res
, set
,
4175 isl_multi_aff_copy(pma2
->p
[j
].maff
));
4178 isl_pw_multi_aff_free(pma1
);
4179 isl_pw_multi_aff_free(pma2
);
4183 isl_pw_multi_aff_free(pma1
);
4184 isl_pw_multi_aff_free(pma2
);
4186 return isl_pw_multi_aff_free(res
);
4189 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmax(
4190 __isl_take isl_pw_multi_aff
*pma1
,
4191 __isl_take isl_pw_multi_aff
*pma2
)
4193 return pw_multi_aff_union_opt(pma1
, pma2
, &isl_multi_aff_lex_ge_set
);
4196 /* Given two piecewise multi affine expressions, return a piecewise
4197 * multi-affine expression defined on the union of the definition domains
4198 * of the inputs that is equal to the lexicographic maximum of the two
4199 * inputs on each cell. If only one of the two inputs is defined on
4200 * a given cell, then it is considered to be the maximum.
4202 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmax(
4203 __isl_take isl_pw_multi_aff
*pma1
,
4204 __isl_take isl_pw_multi_aff
*pma2
)
4206 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4207 &pw_multi_aff_union_lexmax
);
4210 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmin(
4211 __isl_take isl_pw_multi_aff
*pma1
,
4212 __isl_take isl_pw_multi_aff
*pma2
)
4214 return pw_multi_aff_union_opt(pma1
, pma2
, &isl_multi_aff_lex_le_set
);
4217 /* Given two piecewise multi affine expressions, return a piecewise
4218 * multi-affine expression defined on the union of the definition domains
4219 * of the inputs that is equal to the lexicographic minimum of the two
4220 * inputs on each cell. If only one of the two inputs is defined on
4221 * a given cell, then it is considered to be the minimum.
4223 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmin(
4224 __isl_take isl_pw_multi_aff
*pma1
,
4225 __isl_take isl_pw_multi_aff
*pma2
)
4227 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4228 &pw_multi_aff_union_lexmin
);
4231 static __isl_give isl_pw_multi_aff
*pw_multi_aff_add(
4232 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4234 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4235 &isl_multi_aff_add
);
4238 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_add(
4239 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4241 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4245 static __isl_give isl_pw_multi_aff
*pw_multi_aff_sub(
4246 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4248 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4249 &isl_multi_aff_sub
);
4252 /* Subtract "pma2" from "pma1" and return the result.
4254 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_sub(
4255 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4257 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4261 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_add(
4262 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4264 return isl_pw_multi_aff_union_add_(pma1
, pma2
);
4267 /* Compute the sum of "upa1" and "upa2" on the union of their domains,
4268 * with the actual sum on the shared domain and
4269 * the defined expression on the symmetric difference of the domains.
4271 __isl_give isl_union_pw_aff
*isl_union_pw_aff_union_add(
4272 __isl_take isl_union_pw_aff
*upa1
, __isl_take isl_union_pw_aff
*upa2
)
4274 return isl_union_pw_aff_union_add_(upa1
, upa2
);
4277 /* Compute the sum of "upma1" and "upma2" on the union of their domains,
4278 * with the actual sum on the shared domain and
4279 * the defined expression on the symmetric difference of the domains.
4281 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_union_add(
4282 __isl_take isl_union_pw_multi_aff
*upma1
,
4283 __isl_take isl_union_pw_multi_aff
*upma2
)
4285 return isl_union_pw_multi_aff_union_add_(upma1
, upma2
);
4288 /* Given two piecewise multi-affine expressions A -> B and C -> D,
4289 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
4291 static __isl_give isl_pw_multi_aff
*pw_multi_aff_product(
4292 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4296 isl_pw_multi_aff
*res
;
4301 n
= pma1
->n
* pma2
->n
;
4302 space
= isl_space_product(isl_space_copy(pma1
->dim
),
4303 isl_space_copy(pma2
->dim
));
4304 res
= isl_pw_multi_aff_alloc_size(space
, n
);
4306 for (i
= 0; i
< pma1
->n
; ++i
) {
4307 for (j
= 0; j
< pma2
->n
; ++j
) {
4311 domain
= isl_set_product(isl_set_copy(pma1
->p
[i
].set
),
4312 isl_set_copy(pma2
->p
[j
].set
));
4313 ma
= isl_multi_aff_product(
4314 isl_multi_aff_copy(pma1
->p
[i
].maff
),
4315 isl_multi_aff_copy(pma2
->p
[j
].maff
));
4316 res
= isl_pw_multi_aff_add_piece(res
, domain
, ma
);
4320 isl_pw_multi_aff_free(pma1
);
4321 isl_pw_multi_aff_free(pma2
);
4324 isl_pw_multi_aff_free(pma1
);
4325 isl_pw_multi_aff_free(pma2
);
4329 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_product(
4330 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4332 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4333 &pw_multi_aff_product
);
4336 /* Construct a map mapping the domain of the piecewise multi-affine expression
4337 * to its range, with each dimension in the range equated to the
4338 * corresponding affine expression on its cell.
4340 __isl_give isl_map
*isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
4348 map
= isl_map_empty(isl_pw_multi_aff_get_space(pma
));
4350 for (i
= 0; i
< pma
->n
; ++i
) {
4351 isl_multi_aff
*maff
;
4352 isl_basic_map
*bmap
;
4355 maff
= isl_multi_aff_copy(pma
->p
[i
].maff
);
4356 bmap
= isl_basic_map_from_multi_aff(maff
);
4357 map_i
= isl_map_from_basic_map(bmap
);
4358 map_i
= isl_map_intersect_domain(map_i
,
4359 isl_set_copy(pma
->p
[i
].set
));
4360 map
= isl_map_union_disjoint(map
, map_i
);
4363 isl_pw_multi_aff_free(pma
);
4367 __isl_give isl_set
*isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
4372 if (!isl_space_is_set(pma
->dim
))
4373 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
4374 "isl_pw_multi_aff cannot be converted into an isl_set",
4377 return isl_map_from_pw_multi_aff(pma
);
4379 isl_pw_multi_aff_free(pma
);
4383 /* Subtract the initial "n" elements in "ma" with coefficients in "c" and
4384 * denominator "denom".
4385 * "denom" is allowed to be negative, in which case the actual denominator
4386 * is -denom and the expressions are added instead.
4388 static __isl_give isl_aff
*subtract_initial(__isl_take isl_aff
*aff
,
4389 __isl_keep isl_multi_aff
*ma
, int n
, isl_int
*c
, isl_int denom
)
4395 first
= isl_seq_first_non_zero(c
, n
);
4399 sign
= isl_int_sgn(denom
);
4401 isl_int_abs(d
, denom
);
4402 for (i
= first
; i
< n
; ++i
) {
4405 if (isl_int_is_zero(c
[i
]))
4407 aff_i
= isl_multi_aff_get_aff(ma
, i
);
4408 aff_i
= isl_aff_scale(aff_i
, c
[i
]);
4409 aff_i
= isl_aff_scale_down(aff_i
, d
);
4411 aff
= isl_aff_sub(aff
, aff_i
);
4413 aff
= isl_aff_add(aff
, aff_i
);
4420 /* Extract an affine expression that expresses the output dimension "pos"
4421 * of "bmap" in terms of the parameters and input dimensions from
4423 * Note that this expression may involve integer divisions defined
4424 * in terms of parameters and input dimensions.
4425 * The equality may also involve references to earlier (but not later)
4426 * output dimensions. These are replaced by the corresponding elements
4429 * If the equality is of the form
4431 * f(i) + h(j) + a x + g(i) = 0,
4433 * with f(i) a linear combinations of the parameters and input dimensions,
4434 * g(i) a linear combination of integer divisions defined in terms of the same
4435 * and h(j) a linear combinations of earlier output dimensions,
4436 * then the affine expression is
4438 * (-f(i) - g(i))/a - h(j)/a
4440 * If the equality is of the form
4442 * f(i) + h(j) - a x + g(i) = 0,
4444 * then the affine expression is
4446 * (f(i) + g(i))/a - h(j)/(-a)
4449 * If "div" refers to an integer division (i.e., it is smaller than
4450 * the number of integer divisions), then the equality constraint
4451 * does involve an integer division (the one at position "div") that
4452 * is defined in terms of output dimensions. However, this integer
4453 * division can be eliminated by exploiting a pair of constraints
4454 * x >= l and x <= l + n, with n smaller than the coefficient of "div"
4455 * in the equality constraint. "ineq" refers to inequality x >= l, i.e.,
4457 * In particular, let
4459 * x = e(i) + m floor(...)
4461 * with e(i) the expression derived above and floor(...) the integer
4462 * division involving output dimensions.
4473 * e(i) + m floor(...) - l = (e(i) + m floor(...) - l) mod m
4474 * = (e(i) - l) mod m
4478 * x - l = (e(i) - l) mod m
4482 * x = ((e(i) - l) mod m) + l
4484 * The variable "shift" below contains the expression -l, which may
4485 * also involve a linear combination of earlier output dimensions.
4487 static __isl_give isl_aff
*extract_aff_from_equality(
4488 __isl_keep isl_basic_map
*bmap
, int pos
, int eq
, int div
, int ineq
,
4489 __isl_keep isl_multi_aff
*ma
)
4492 unsigned n_div
, n_out
;
4494 isl_local_space
*ls
;
4495 isl_aff
*aff
, *shift
;
4498 ctx
= isl_basic_map_get_ctx(bmap
);
4499 ls
= isl_basic_map_get_local_space(bmap
);
4500 ls
= isl_local_space_domain(ls
);
4501 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
4504 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
4505 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4506 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4507 if (isl_int_is_neg(bmap
->eq
[eq
][o_out
+ pos
])) {
4508 isl_seq_cpy(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4509 isl_seq_cpy(aff
->v
->el
+ 1 + o_out
,
4510 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4512 isl_seq_neg(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4513 isl_seq_neg(aff
->v
->el
+ 1 + o_out
,
4514 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4517 isl_int_set_si(aff
->v
->el
[1 + o_out
+ div
], 0);
4518 isl_int_abs(aff
->v
->el
[0], bmap
->eq
[eq
][o_out
+ pos
]);
4519 aff
= subtract_initial(aff
, ma
, pos
, bmap
->eq
[eq
] + o_out
,
4520 bmap
->eq
[eq
][o_out
+ pos
]);
4522 shift
= isl_aff_alloc(isl_local_space_copy(ls
));
4525 isl_seq_cpy(shift
->v
->el
+ 1, bmap
->ineq
[ineq
], o_out
);
4526 isl_seq_cpy(shift
->v
->el
+ 1 + o_out
,
4527 bmap
->ineq
[ineq
] + o_out
+ n_out
, n_div
);
4528 isl_int_set_si(shift
->v
->el
[0], 1);
4529 shift
= subtract_initial(shift
, ma
, pos
,
4530 bmap
->ineq
[ineq
] + o_out
, ctx
->negone
);
4531 aff
= isl_aff_add(aff
, isl_aff_copy(shift
));
4532 mod
= isl_val_int_from_isl_int(ctx
,
4533 bmap
->eq
[eq
][o_out
+ n_out
+ div
]);
4534 mod
= isl_val_abs(mod
);
4535 aff
= isl_aff_mod_val(aff
, mod
);
4536 aff
= isl_aff_sub(aff
, shift
);
4539 isl_local_space_free(ls
);
4542 isl_local_space_free(ls
);
4547 /* Given a basic map with output dimensions defined
4548 * in terms of the parameters input dimensions and earlier
4549 * output dimensions using an equality (and possibly a pair on inequalities),
4550 * extract an isl_aff that expresses output dimension "pos" in terms
4551 * of the parameters and input dimensions.
4552 * Note that this expression may involve integer divisions defined
4553 * in terms of parameters and input dimensions.
4554 * "ma" contains the expressions corresponding to earlier output dimensions.
4556 * This function shares some similarities with
4557 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
4559 static __isl_give isl_aff
*extract_isl_aff_from_basic_map(
4560 __isl_keep isl_basic_map
*bmap
, int pos
, __isl_keep isl_multi_aff
*ma
)
4567 eq
= isl_basic_map_output_defining_equality(bmap
, pos
, &div
, &ineq
);
4568 if (eq
>= bmap
->n_eq
)
4569 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4570 "unable to find suitable equality", return NULL
);
4571 aff
= extract_aff_from_equality(bmap
, pos
, eq
, div
, ineq
, ma
);
4573 aff
= isl_aff_remove_unused_divs(aff
);
4577 /* Given a basic map where each output dimension is defined
4578 * in terms of the parameters and input dimensions using an equality,
4579 * extract an isl_multi_aff that expresses the output dimensions in terms
4580 * of the parameters and input dimensions.
4582 static __isl_give isl_multi_aff
*extract_isl_multi_aff_from_basic_map(
4583 __isl_take isl_basic_map
*bmap
)
4592 ma
= isl_multi_aff_alloc(isl_basic_map_get_space(bmap
));
4593 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4595 for (i
= 0; i
< n_out
; ++i
) {
4598 aff
= extract_isl_aff_from_basic_map(bmap
, i
, ma
);
4599 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4602 isl_basic_map_free(bmap
);
4607 /* Given a basic set where each set dimension is defined
4608 * in terms of the parameters using an equality,
4609 * extract an isl_multi_aff that expresses the set dimensions in terms
4610 * of the parameters.
4612 __isl_give isl_multi_aff
*isl_multi_aff_from_basic_set_equalities(
4613 __isl_take isl_basic_set
*bset
)
4615 return extract_isl_multi_aff_from_basic_map(bset
);
4618 /* Create an isl_pw_multi_aff that is equivalent to
4619 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
4620 * The given basic map is such that each output dimension is defined
4621 * in terms of the parameters and input dimensions using an equality.
4623 * Since some applications expect the result of isl_pw_multi_aff_from_map
4624 * to only contain integer affine expressions, we compute the floor
4625 * of the expression before returning.
4627 * Remove all constraints involving local variables without
4628 * an explicit representation (resulting in the removal of those
4629 * local variables) prior to the actual extraction to ensure
4630 * that the local spaces in which the resulting affine expressions
4631 * are created do not contain any unknown local variables.
4632 * Removing such constraints is safe because constraints involving
4633 * unknown local variables are not used to determine whether
4634 * a basic map is obviously single-valued.
4636 static __isl_give isl_pw_multi_aff
*plain_pw_multi_aff_from_map(
4637 __isl_take isl_set
*domain
, __isl_take isl_basic_map
*bmap
)
4641 bmap
= isl_basic_map_drop_constraint_involving_unknown_divs(bmap
);
4642 ma
= extract_isl_multi_aff_from_basic_map(bmap
);
4643 ma
= isl_multi_aff_floor(ma
);
4644 return isl_pw_multi_aff_alloc(domain
, ma
);
4647 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4648 * This obviously only works if the input "map" is single-valued.
4649 * If so, we compute the lexicographic minimum of the image in the form
4650 * of an isl_pw_multi_aff. Since the image is unique, it is equal
4651 * to its lexicographic minimum.
4652 * If the input is not single-valued, we produce an error.
4654 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_base(
4655 __isl_take isl_map
*map
)
4659 isl_pw_multi_aff
*pma
;
4661 sv
= isl_map_is_single_valued(map
);
4665 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
4666 "map is not single-valued", goto error
);
4667 map
= isl_map_make_disjoint(map
);
4671 pma
= isl_pw_multi_aff_empty(isl_map_get_space(map
));
4673 for (i
= 0; i
< map
->n
; ++i
) {
4674 isl_pw_multi_aff
*pma_i
;
4675 isl_basic_map
*bmap
;
4676 bmap
= isl_basic_map_copy(map
->p
[i
]);
4677 pma_i
= isl_basic_map_lexmin_pw_multi_aff(bmap
);
4678 pma
= isl_pw_multi_aff_add_disjoint(pma
, pma_i
);
4688 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4689 * taking into account that the output dimension at position "d"
4690 * can be represented as
4692 * x = floor((e(...) + c1) / m)
4694 * given that constraint "i" is of the form
4696 * e(...) + c1 - m x >= 0
4699 * Let "map" be of the form
4703 * We construct a mapping
4705 * A -> [A -> x = floor(...)]
4707 * apply that to the map, obtaining
4709 * [A -> x = floor(...)] -> B
4711 * and equate dimension "d" to x.
4712 * We then compute a isl_pw_multi_aff representation of the resulting map
4713 * and plug in the mapping above.
4715 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_div(
4716 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
)
4720 isl_local_space
*ls
;
4728 isl_pw_multi_aff
*pma
;
4731 is_set
= isl_map_is_set(map
);
4733 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4734 ctx
= isl_map_get_ctx(map
);
4735 space
= isl_space_domain(isl_map_get_space(map
));
4736 n_in
= isl_space_dim(space
, isl_dim_set
);
4737 n
= isl_space_dim(space
, isl_dim_all
);
4739 v
= isl_vec_alloc(ctx
, 1 + 1 + n
);
4741 isl_int_neg(v
->el
[0], hull
->ineq
[i
][offset
+ d
]);
4742 isl_seq_cpy(v
->el
+ 1, hull
->ineq
[i
], 1 + n
);
4744 isl_basic_map_free(hull
);
4746 ls
= isl_local_space_from_space(isl_space_copy(space
));
4747 aff
= isl_aff_alloc_vec(ls
, v
);
4748 aff
= isl_aff_floor(aff
);
4750 isl_space_free(space
);
4751 ma
= isl_multi_aff_from_aff(aff
);
4753 ma
= isl_multi_aff_identity(isl_space_map_from_set(space
));
4754 ma
= isl_multi_aff_range_product(ma
,
4755 isl_multi_aff_from_aff(aff
));
4758 insert
= isl_map_from_multi_aff(isl_multi_aff_copy(ma
));
4759 map
= isl_map_apply_domain(map
, insert
);
4760 map
= isl_map_equate(map
, isl_dim_in
, n_in
, isl_dim_out
, d
);
4761 pma
= isl_pw_multi_aff_from_map(map
);
4762 pma
= isl_pw_multi_aff_pullback_multi_aff(pma
, ma
);
4767 /* Is constraint "c" of the form
4769 * e(...) + c1 - m x >= 0
4773 * -e(...) + c2 + m x >= 0
4775 * where m > 1 and e only depends on parameters and input dimemnsions?
4777 * "offset" is the offset of the output dimensions
4778 * "pos" is the position of output dimension x.
4780 static int is_potential_div_constraint(isl_int
*c
, int offset
, int d
, int total
)
4782 if (isl_int_is_zero(c
[offset
+ d
]))
4784 if (isl_int_is_one(c
[offset
+ d
]))
4786 if (isl_int_is_negone(c
[offset
+ d
]))
4788 if (isl_seq_first_non_zero(c
+ offset
, d
) != -1)
4790 if (isl_seq_first_non_zero(c
+ offset
+ d
+ 1,
4791 total
- (offset
+ d
+ 1)) != -1)
4796 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4798 * As a special case, we first check if there is any pair of constraints,
4799 * shared by all the basic maps in "map" that force a given dimension
4800 * to be equal to the floor of some affine combination of the input dimensions.
4802 * In particular, if we can find two constraints
4804 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
4808 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
4810 * where m > 1 and e only depends on parameters and input dimemnsions,
4813 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
4815 * then we know that we can take
4817 * x = floor((e(...) + c1) / m)
4819 * without having to perform any computation.
4821 * Note that we know that
4825 * If c1 + c2 were 0, then we would have detected an equality during
4826 * simplification. If c1 + c2 were negative, then we would have detected
4829 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_div(
4830 __isl_take isl_map
*map
)
4836 isl_basic_map
*hull
;
4838 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
4843 dim
= isl_map_dim(map
, isl_dim_out
);
4844 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4845 total
= 1 + isl_basic_map_total_dim(hull
);
4847 for (d
= 0; d
< dim
; ++d
) {
4848 for (i
= 0; i
< n
; ++i
) {
4849 if (!is_potential_div_constraint(hull
->ineq
[i
],
4852 for (j
= i
+ 1; j
< n
; ++j
) {
4853 if (!isl_seq_is_neg(hull
->ineq
[i
] + 1,
4854 hull
->ineq
[j
] + 1, total
- 1))
4856 isl_int_add(sum
, hull
->ineq
[i
][0],
4858 if (isl_int_abs_lt(sum
,
4859 hull
->ineq
[i
][offset
+ d
]))
4866 if (isl_int_is_pos(hull
->ineq
[j
][offset
+ d
]))
4868 return pw_multi_aff_from_map_div(map
, hull
, d
, j
);
4872 isl_basic_map_free(hull
);
4873 return pw_multi_aff_from_map_base(map
);
4876 isl_basic_map_free(hull
);
4880 /* Given an affine expression
4882 * [A -> B] -> f(A,B)
4884 * construct an isl_multi_aff
4888 * such that dimension "d" in B' is set to "aff" and the remaining
4889 * dimensions are set equal to the corresponding dimensions in B.
4890 * "n_in" is the dimension of the space A.
4891 * "n_out" is the dimension of the space B.
4893 * If "is_set" is set, then the affine expression is of the form
4897 * and we construct an isl_multi_aff
4901 static __isl_give isl_multi_aff
*range_map(__isl_take isl_aff
*aff
, int d
,
4902 unsigned n_in
, unsigned n_out
, int is_set
)
4906 isl_space
*space
, *space2
;
4907 isl_local_space
*ls
;
4909 space
= isl_aff_get_domain_space(aff
);
4910 ls
= isl_local_space_from_space(isl_space_copy(space
));
4911 space2
= isl_space_copy(space
);
4913 space2
= isl_space_range(isl_space_unwrap(space2
));
4914 space
= isl_space_map_from_domain_and_range(space
, space2
);
4915 ma
= isl_multi_aff_alloc(space
);
4916 ma
= isl_multi_aff_set_aff(ma
, d
, aff
);
4918 for (i
= 0; i
< n_out
; ++i
) {
4921 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4922 isl_dim_set
, n_in
+ i
);
4923 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4926 isl_local_space_free(ls
);
4931 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4932 * taking into account that the dimension at position "d" can be written as
4934 * x = m a + f(..) (1)
4936 * where m is equal to "gcd".
4937 * "i" is the index of the equality in "hull" that defines f(..).
4938 * In particular, the equality is of the form
4940 * f(..) - x + m g(existentials) = 0
4944 * -f(..) + x + m g(existentials) = 0
4946 * We basically plug (1) into "map", resulting in a map with "a"
4947 * in the range instead of "x". The corresponding isl_pw_multi_aff
4948 * defining "a" is then plugged back into (1) to obtain a definition for "x".
4950 * Specifically, given the input map
4954 * We first wrap it into a set
4958 * and define (1) on top of the corresponding space, resulting in "aff".
4959 * We use this to create an isl_multi_aff that maps the output position "d"
4960 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
4961 * We plug this into the wrapped map, unwrap the result and compute the
4962 * corresponding isl_pw_multi_aff.
4963 * The result is an expression
4971 * so that we can plug that into "aff", after extending the latter to
4977 * If "map" is actually a set, then there is no "A" space, meaning
4978 * that we do not need to perform any wrapping, and that the result
4979 * of the recursive call is of the form
4983 * which is plugged into a mapping of the form
4987 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_stride(
4988 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
,
4993 isl_local_space
*ls
;
4996 isl_pw_multi_aff
*pma
, *id
;
5002 is_set
= isl_map_is_set(map
);
5004 n_in
= isl_basic_map_dim(hull
, isl_dim_in
);
5005 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5006 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5011 set
= isl_map_wrap(map
);
5012 space
= isl_space_map_from_set(isl_set_get_space(set
));
5013 ma
= isl_multi_aff_identity(space
);
5014 ls
= isl_local_space_from_space(isl_set_get_space(set
));
5015 aff
= isl_aff_alloc(ls
);
5017 isl_int_set_si(aff
->v
->el
[0], 1);
5018 if (isl_int_is_one(hull
->eq
[i
][o_out
+ d
]))
5019 isl_seq_neg(aff
->v
->el
+ 1, hull
->eq
[i
],
5022 isl_seq_cpy(aff
->v
->el
+ 1, hull
->eq
[i
],
5024 isl_int_set(aff
->v
->el
[1 + o_out
+ d
], gcd
);
5026 ma
= isl_multi_aff_set_aff(ma
, n_in
+ d
, isl_aff_copy(aff
));
5027 set
= isl_set_preimage_multi_aff(set
, ma
);
5029 ma
= range_map(aff
, d
, n_in
, n_out
, is_set
);
5034 map
= isl_set_unwrap(set
);
5035 pma
= isl_pw_multi_aff_from_map(map
);
5038 space
= isl_pw_multi_aff_get_domain_space(pma
);
5039 space
= isl_space_map_from_set(space
);
5040 id
= isl_pw_multi_aff_identity(space
);
5041 pma
= isl_pw_multi_aff_range_product(id
, pma
);
5043 id
= isl_pw_multi_aff_from_multi_aff(ma
);
5044 pma
= isl_pw_multi_aff_pullback_pw_multi_aff(id
, pma
);
5046 isl_basic_map_free(hull
);
5050 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
5052 * As a special case, we first check if all output dimensions are uniquely
5053 * defined in terms of the parameters and input dimensions over the entire
5054 * domain. If so, we extract the desired isl_pw_multi_aff directly
5055 * from the affine hull of "map" and its domain.
5057 * Otherwise, we check if any of the output dimensions is "strided".
5058 * That is, we check if can be written as
5062 * with m greater than 1, a some combination of existentially quantified
5063 * variables and f an expression in the parameters and input dimensions.
5064 * If so, we remove the stride in pw_multi_aff_from_map_stride.
5066 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
5069 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_map(__isl_take isl_map
*map
)
5073 isl_basic_map
*hull
;
5083 map
= isl_map_detect_equalities(map
);
5084 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5085 sv
= isl_basic_map_plain_is_single_valued(hull
);
5087 return plain_pw_multi_aff_from_map(isl_map_domain(map
), hull
);
5089 hull
= isl_basic_map_free(hull
);
5093 n_div
= isl_basic_map_dim(hull
, isl_dim_div
);
5094 o_div
= isl_basic_map_offset(hull
, isl_dim_div
);
5097 isl_basic_map_free(hull
);
5098 return pw_multi_aff_from_map_check_div(map
);
5103 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5104 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5106 for (i
= 0; i
< n_out
; ++i
) {
5107 for (j
= 0; j
< hull
->n_eq
; ++j
) {
5108 isl_int
*eq
= hull
->eq
[j
];
5109 isl_pw_multi_aff
*res
;
5111 if (!isl_int_is_one(eq
[o_out
+ i
]) &&
5112 !isl_int_is_negone(eq
[o_out
+ i
]))
5114 if (isl_seq_first_non_zero(eq
+ o_out
, i
) != -1)
5116 if (isl_seq_first_non_zero(eq
+ o_out
+ i
+ 1,
5117 n_out
- (i
+ 1)) != -1)
5119 isl_seq_gcd(eq
+ o_div
, n_div
, &gcd
);
5120 if (isl_int_is_zero(gcd
))
5122 if (isl_int_is_one(gcd
))
5125 res
= pw_multi_aff_from_map_stride(map
, hull
,
5133 isl_basic_map_free(hull
);
5134 return pw_multi_aff_from_map_check_div(map
);
5140 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_set(__isl_take isl_set
*set
)
5142 return isl_pw_multi_aff_from_map(set
);
5145 /* Convert "map" into an isl_pw_multi_aff (if possible) and
5148 static isl_stat
pw_multi_aff_from_map(__isl_take isl_map
*map
, void *user
)
5150 isl_union_pw_multi_aff
**upma
= user
;
5151 isl_pw_multi_aff
*pma
;
5153 pma
= isl_pw_multi_aff_from_map(map
);
5154 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5156 return *upma
? isl_stat_ok
: isl_stat_error
;
5159 /* Create an isl_union_pw_multi_aff with the given isl_aff on a universe
5162 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_aff(
5163 __isl_take isl_aff
*aff
)
5166 isl_pw_multi_aff
*pma
;
5168 ma
= isl_multi_aff_from_aff(aff
);
5169 pma
= isl_pw_multi_aff_from_multi_aff(ma
);
5170 return isl_union_pw_multi_aff_from_pw_multi_aff(pma
);
5173 /* Try and create an isl_union_pw_multi_aff that is equivalent
5174 * to the given isl_union_map.
5175 * The isl_union_map is required to be single-valued in each space.
5176 * Otherwise, an error is produced.
5178 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_map(
5179 __isl_take isl_union_map
*umap
)
5182 isl_union_pw_multi_aff
*upma
;
5184 space
= isl_union_map_get_space(umap
);
5185 upma
= isl_union_pw_multi_aff_empty(space
);
5186 if (isl_union_map_foreach_map(umap
, &pw_multi_aff_from_map
, &upma
) < 0)
5187 upma
= isl_union_pw_multi_aff_free(upma
);
5188 isl_union_map_free(umap
);
5193 /* Try and create an isl_union_pw_multi_aff that is equivalent
5194 * to the given isl_union_set.
5195 * The isl_union_set is required to be a singleton in each space.
5196 * Otherwise, an error is produced.
5198 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_set(
5199 __isl_take isl_union_set
*uset
)
5201 return isl_union_pw_multi_aff_from_union_map(uset
);
5204 /* Return the piecewise affine expression "set ? 1 : 0".
5206 __isl_give isl_pw_aff
*isl_set_indicator_function(__isl_take isl_set
*set
)
5209 isl_space
*space
= isl_set_get_space(set
);
5210 isl_local_space
*ls
= isl_local_space_from_space(space
);
5211 isl_aff
*zero
= isl_aff_zero_on_domain(isl_local_space_copy(ls
));
5212 isl_aff
*one
= isl_aff_zero_on_domain(ls
);
5214 one
= isl_aff_add_constant_si(one
, 1);
5215 pa
= isl_pw_aff_alloc(isl_set_copy(set
), one
);
5216 set
= isl_set_complement(set
);
5217 pa
= isl_pw_aff_add_disjoint(pa
, isl_pw_aff_alloc(set
, zero
));
5222 /* Plug in "subs" for dimension "type", "pos" of "aff".
5224 * Let i be the dimension to replace and let "subs" be of the form
5228 * and "aff" of the form
5234 * (a f + d g')/(m d)
5236 * where g' is the result of plugging in "subs" in each of the integer
5239 __isl_give isl_aff
*isl_aff_substitute(__isl_take isl_aff
*aff
,
5240 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
5245 aff
= isl_aff_cow(aff
);
5247 return isl_aff_free(aff
);
5249 ctx
= isl_aff_get_ctx(aff
);
5250 if (!isl_space_is_equal(aff
->ls
->dim
, subs
->ls
->dim
))
5251 isl_die(ctx
, isl_error_invalid
,
5252 "spaces don't match", return isl_aff_free(aff
));
5253 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
5254 isl_die(ctx
, isl_error_unsupported
,
5255 "cannot handle divs yet", return isl_aff_free(aff
));
5257 aff
->ls
= isl_local_space_substitute(aff
->ls
, type
, pos
, subs
);
5259 return isl_aff_free(aff
);
5261 aff
->v
= isl_vec_cow(aff
->v
);
5263 return isl_aff_free(aff
);
5265 pos
+= isl_local_space_offset(aff
->ls
, type
);
5268 isl_seq_substitute(aff
->v
->el
, pos
, subs
->v
->el
,
5269 aff
->v
->size
, subs
->v
->size
, v
);
5275 /* Plug in "subs" for dimension "type", "pos" in each of the affine
5276 * expressions in "maff".
5278 __isl_give isl_multi_aff
*isl_multi_aff_substitute(
5279 __isl_take isl_multi_aff
*maff
, enum isl_dim_type type
, unsigned pos
,
5280 __isl_keep isl_aff
*subs
)
5284 maff
= isl_multi_aff_cow(maff
);
5286 return isl_multi_aff_free(maff
);
5288 if (type
== isl_dim_in
)
5291 for (i
= 0; i
< maff
->n
; ++i
) {
5292 maff
->p
[i
] = isl_aff_substitute(maff
->p
[i
], type
, pos
, subs
);
5294 return isl_multi_aff_free(maff
);
5300 /* Plug in "subs" for dimension "type", "pos" of "pma".
5302 * pma is of the form
5306 * while subs is of the form
5308 * v' = B_j(v) -> S_j
5310 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
5311 * has a contribution in the result, in particular
5313 * C_ij(S_j) -> M_i(S_j)
5315 * Note that plugging in S_j in C_ij may also result in an empty set
5316 * and this contribution should simply be discarded.
5318 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_substitute(
5319 __isl_take isl_pw_multi_aff
*pma
, enum isl_dim_type type
, unsigned pos
,
5320 __isl_keep isl_pw_aff
*subs
)
5323 isl_pw_multi_aff
*res
;
5326 return isl_pw_multi_aff_free(pma
);
5328 n
= pma
->n
* subs
->n
;
5329 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma
->dim
), n
);
5331 for (i
= 0; i
< pma
->n
; ++i
) {
5332 for (j
= 0; j
< subs
->n
; ++j
) {
5334 isl_multi_aff
*res_ij
;
5337 common
= isl_set_intersect(
5338 isl_set_copy(pma
->p
[i
].set
),
5339 isl_set_copy(subs
->p
[j
].set
));
5340 common
= isl_set_substitute(common
,
5341 type
, pos
, subs
->p
[j
].aff
);
5342 empty
= isl_set_plain_is_empty(common
);
5343 if (empty
< 0 || empty
) {
5344 isl_set_free(common
);
5350 res_ij
= isl_multi_aff_substitute(
5351 isl_multi_aff_copy(pma
->p
[i
].maff
),
5352 type
, pos
, subs
->p
[j
].aff
);
5354 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5358 isl_pw_multi_aff_free(pma
);
5361 isl_pw_multi_aff_free(pma
);
5362 isl_pw_multi_aff_free(res
);
5366 /* Compute the preimage of a range of dimensions in the affine expression "src"
5367 * under "ma" and put the result in "dst". The number of dimensions in "src"
5368 * that precede the range is given by "n_before". The number of dimensions
5369 * in the range is given by the number of output dimensions of "ma".
5370 * The number of dimensions that follow the range is given by "n_after".
5371 * If "has_denom" is set (to one),
5372 * then "src" and "dst" have an extra initial denominator.
5373 * "n_div_ma" is the number of existentials in "ma"
5374 * "n_div_bset" is the number of existentials in "src"
5375 * The resulting "dst" (which is assumed to have been allocated by
5376 * the caller) contains coefficients for both sets of existentials,
5377 * first those in "ma" and then those in "src".
5378 * f, c1, c2 and g are temporary objects that have been initialized
5381 * Let src represent the expression
5383 * (a(p) + f_u u + b v + f_w w + c(divs))/d
5385 * and let ma represent the expressions
5387 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
5389 * We start out with the following expression for dst:
5391 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
5393 * with the multiplication factor f initially equal to 1
5394 * and f \sum_i b_i v_i kept separately.
5395 * For each x_i that we substitute, we multiply the numerator
5396 * (and denominator) of dst by c_1 = m_i and add the numerator
5397 * of the x_i expression multiplied by c_2 = f b_i,
5398 * after removing the common factors of c_1 and c_2.
5399 * The multiplication factor f also needs to be multiplied by c_1
5400 * for the next x_j, j > i.
5402 void isl_seq_preimage(isl_int
*dst
, isl_int
*src
,
5403 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
,
5404 int n_div_ma
, int n_div_bmap
,
5405 isl_int f
, isl_int c1
, isl_int c2
, isl_int g
, int has_denom
)
5408 int n_param
, n_in
, n_out
;
5411 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
5412 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
5413 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
5415 isl_seq_cpy(dst
, src
, has_denom
+ 1 + n_param
+ n_before
);
5416 o_dst
= o_src
= has_denom
+ 1 + n_param
+ n_before
;
5417 isl_seq_clr(dst
+ o_dst
, n_in
);
5420 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_after
);
5423 isl_seq_clr(dst
+ o_dst
, n_div_ma
);
5425 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_div_bmap
);
5427 isl_int_set_si(f
, 1);
5429 for (i
= 0; i
< n_out
; ++i
) {
5430 int offset
= has_denom
+ 1 + n_param
+ n_before
+ i
;
5432 if (isl_int_is_zero(src
[offset
]))
5434 isl_int_set(c1
, ma
->p
[i
]->v
->el
[0]);
5435 isl_int_mul(c2
, f
, src
[offset
]);
5436 isl_int_gcd(g
, c1
, c2
);
5437 isl_int_divexact(c1
, c1
, g
);
5438 isl_int_divexact(c2
, c2
, g
);
5440 isl_int_mul(f
, f
, c1
);
5443 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5444 c2
, ma
->p
[i
]->v
->el
+ o_src
, 1 + n_param
);
5445 o_dst
+= 1 + n_param
;
5446 o_src
+= 1 + n_param
;
5447 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_before
);
5449 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5450 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_in
);
5453 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_after
);
5455 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5456 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_div_ma
);
5459 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_div_bmap
);
5461 isl_int_mul(dst
[0], dst
[0], c1
);
5465 /* Compute the pullback of "aff" by the function represented by "ma".
5466 * In other words, plug in "ma" in "aff". The result is an affine expression
5467 * defined over the domain space of "ma".
5469 * If "aff" is represented by
5471 * (a(p) + b x + c(divs))/d
5473 * and ma is represented by
5475 * x = D(p) + F(y) + G(divs')
5477 * then the result is
5479 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
5481 * The divs in the local space of the input are similarly adjusted
5482 * through a call to isl_local_space_preimage_multi_aff.
5484 __isl_give isl_aff
*isl_aff_pullback_multi_aff(__isl_take isl_aff
*aff
,
5485 __isl_take isl_multi_aff
*ma
)
5487 isl_aff
*res
= NULL
;
5488 isl_local_space
*ls
;
5489 int n_div_aff
, n_div_ma
;
5490 isl_int f
, c1
, c2
, g
;
5492 ma
= isl_multi_aff_align_divs(ma
);
5496 n_div_aff
= isl_aff_dim(aff
, isl_dim_div
);
5497 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
5499 ls
= isl_aff_get_domain_local_space(aff
);
5500 ls
= isl_local_space_preimage_multi_aff(ls
, isl_multi_aff_copy(ma
));
5501 res
= isl_aff_alloc(ls
);
5510 isl_seq_preimage(res
->v
->el
, aff
->v
->el
, ma
, 0, 0, n_div_ma
, n_div_aff
,
5519 isl_multi_aff_free(ma
);
5520 res
= isl_aff_normalize(res
);
5524 isl_multi_aff_free(ma
);
5529 /* Compute the pullback of "aff1" by the function represented by "aff2".
5530 * In other words, plug in "aff2" in "aff1". The result is an affine expression
5531 * defined over the domain space of "aff1".
5533 * The domain of "aff1" should match the range of "aff2", which means
5534 * that it should be single-dimensional.
5536 __isl_give isl_aff
*isl_aff_pullback_aff(__isl_take isl_aff
*aff1
,
5537 __isl_take isl_aff
*aff2
)
5541 ma
= isl_multi_aff_from_aff(aff2
);
5542 return isl_aff_pullback_multi_aff(aff1
, ma
);
5545 /* Compute the pullback of "ma1" by the function represented by "ma2".
5546 * In other words, plug in "ma2" in "ma1".
5548 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
5550 static __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff_aligned(
5551 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5554 isl_space
*space
= NULL
;
5556 ma2
= isl_multi_aff_align_divs(ma2
);
5557 ma1
= isl_multi_aff_cow(ma1
);
5561 space
= isl_space_join(isl_multi_aff_get_space(ma2
),
5562 isl_multi_aff_get_space(ma1
));
5564 for (i
= 0; i
< ma1
->n
; ++i
) {
5565 ma1
->p
[i
] = isl_aff_pullback_multi_aff(ma1
->p
[i
],
5566 isl_multi_aff_copy(ma2
));
5571 ma1
= isl_multi_aff_reset_space(ma1
, space
);
5572 isl_multi_aff_free(ma2
);
5575 isl_space_free(space
);
5576 isl_multi_aff_free(ma2
);
5577 isl_multi_aff_free(ma1
);
5581 /* Compute the pullback of "ma1" by the function represented by "ma2".
5582 * In other words, plug in "ma2" in "ma1".
5584 __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff(
5585 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5587 return isl_multi_aff_align_params_multi_multi_and(ma1
, ma2
,
5588 &isl_multi_aff_pullback_multi_aff_aligned
);
5591 /* Extend the local space of "dst" to include the divs
5592 * in the local space of "src".
5594 __isl_give isl_aff
*isl_aff_align_divs(__isl_take isl_aff
*dst
,
5595 __isl_keep isl_aff
*src
)
5603 return isl_aff_free(dst
);
5605 ctx
= isl_aff_get_ctx(src
);
5606 if (!isl_space_is_equal(src
->ls
->dim
, dst
->ls
->dim
))
5607 isl_die(ctx
, isl_error_invalid
,
5608 "spaces don't match", goto error
);
5610 if (src
->ls
->div
->n_row
== 0)
5613 exp1
= isl_alloc_array(ctx
, int, src
->ls
->div
->n_row
);
5614 exp2
= isl_alloc_array(ctx
, int, dst
->ls
->div
->n_row
);
5615 if (!exp1
|| (dst
->ls
->div
->n_row
&& !exp2
))
5618 div
= isl_merge_divs(src
->ls
->div
, dst
->ls
->div
, exp1
, exp2
);
5619 dst
= isl_aff_expand_divs(dst
, div
, exp2
);
5627 return isl_aff_free(dst
);
5630 /* Adjust the local spaces of the affine expressions in "maff"
5631 * such that they all have the save divs.
5633 __isl_give isl_multi_aff
*isl_multi_aff_align_divs(
5634 __isl_take isl_multi_aff
*maff
)
5642 maff
= isl_multi_aff_cow(maff
);
5646 for (i
= 1; i
< maff
->n
; ++i
)
5647 maff
->p
[0] = isl_aff_align_divs(maff
->p
[0], maff
->p
[i
]);
5648 for (i
= 1; i
< maff
->n
; ++i
) {
5649 maff
->p
[i
] = isl_aff_align_divs(maff
->p
[i
], maff
->p
[0]);
5651 return isl_multi_aff_free(maff
);
5657 __isl_give isl_aff
*isl_aff_lift(__isl_take isl_aff
*aff
)
5659 aff
= isl_aff_cow(aff
);
5663 aff
->ls
= isl_local_space_lift(aff
->ls
);
5665 return isl_aff_free(aff
);
5670 /* Lift "maff" to a space with extra dimensions such that the result
5671 * has no more existentially quantified variables.
5672 * If "ls" is not NULL, then *ls is assigned the local space that lies
5673 * at the basis of the lifting applied to "maff".
5675 __isl_give isl_multi_aff
*isl_multi_aff_lift(__isl_take isl_multi_aff
*maff
,
5676 __isl_give isl_local_space
**ls
)
5690 isl_space
*space
= isl_multi_aff_get_domain_space(maff
);
5691 *ls
= isl_local_space_from_space(space
);
5693 return isl_multi_aff_free(maff
);
5698 maff
= isl_multi_aff_cow(maff
);
5699 maff
= isl_multi_aff_align_divs(maff
);
5703 n_div
= isl_aff_dim(maff
->p
[0], isl_dim_div
);
5704 space
= isl_multi_aff_get_space(maff
);
5705 space
= isl_space_lift(isl_space_domain(space
), n_div
);
5706 space
= isl_space_extend_domain_with_range(space
,
5707 isl_multi_aff_get_space(maff
));
5709 return isl_multi_aff_free(maff
);
5710 isl_space_free(maff
->space
);
5711 maff
->space
= space
;
5714 *ls
= isl_aff_get_domain_local_space(maff
->p
[0]);
5716 return isl_multi_aff_free(maff
);
5719 for (i
= 0; i
< maff
->n
; ++i
) {
5720 maff
->p
[i
] = isl_aff_lift(maff
->p
[i
]);
5728 isl_local_space_free(*ls
);
5729 return isl_multi_aff_free(maff
);
5733 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
5735 __isl_give isl_pw_aff
*isl_pw_multi_aff_get_pw_aff(
5736 __isl_keep isl_pw_multi_aff
*pma
, int pos
)
5746 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
5747 if (pos
< 0 || pos
>= n_out
)
5748 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5749 "index out of bounds", return NULL
);
5751 space
= isl_pw_multi_aff_get_space(pma
);
5752 space
= isl_space_drop_dims(space
, isl_dim_out
,
5753 pos
+ 1, n_out
- pos
- 1);
5754 space
= isl_space_drop_dims(space
, isl_dim_out
, 0, pos
);
5756 pa
= isl_pw_aff_alloc_size(space
, pma
->n
);
5757 for (i
= 0; i
< pma
->n
; ++i
) {
5759 aff
= isl_multi_aff_get_aff(pma
->p
[i
].maff
, pos
);
5760 pa
= isl_pw_aff_add_piece(pa
, isl_set_copy(pma
->p
[i
].set
), aff
);
5766 /* Return an isl_pw_multi_aff with the given "set" as domain and
5767 * an unnamed zero-dimensional range.
5769 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_domain(
5770 __isl_take isl_set
*set
)
5775 space
= isl_set_get_space(set
);
5776 space
= isl_space_from_domain(space
);
5777 ma
= isl_multi_aff_zero(space
);
5778 return isl_pw_multi_aff_alloc(set
, ma
);
5781 /* Add an isl_pw_multi_aff with the given "set" as domain and
5782 * an unnamed zero-dimensional range to *user.
5784 static isl_stat
add_pw_multi_aff_from_domain(__isl_take isl_set
*set
,
5787 isl_union_pw_multi_aff
**upma
= user
;
5788 isl_pw_multi_aff
*pma
;
5790 pma
= isl_pw_multi_aff_from_domain(set
);
5791 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5796 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
5797 * an unnamed zero-dimensional range.
5799 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_domain(
5800 __isl_take isl_union_set
*uset
)
5803 isl_union_pw_multi_aff
*upma
;
5808 space
= isl_union_set_get_space(uset
);
5809 upma
= isl_union_pw_multi_aff_empty(space
);
5811 if (isl_union_set_foreach_set(uset
,
5812 &add_pw_multi_aff_from_domain
, &upma
) < 0)
5815 isl_union_set_free(uset
);
5818 isl_union_set_free(uset
);
5819 isl_union_pw_multi_aff_free(upma
);
5823 /* Convert "pma" to an isl_map and add it to *umap.
5825 static isl_stat
map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
,
5828 isl_union_map
**umap
= user
;
5831 map
= isl_map_from_pw_multi_aff(pma
);
5832 *umap
= isl_union_map_add_map(*umap
, map
);
5837 /* Construct a union map mapping the domain of the union
5838 * piecewise multi-affine expression to its range, with each dimension
5839 * in the range equated to the corresponding affine expression on its cell.
5841 __isl_give isl_union_map
*isl_union_map_from_union_pw_multi_aff(
5842 __isl_take isl_union_pw_multi_aff
*upma
)
5845 isl_union_map
*umap
;
5850 space
= isl_union_pw_multi_aff_get_space(upma
);
5851 umap
= isl_union_map_empty(space
);
5853 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
5854 &map_from_pw_multi_aff
, &umap
) < 0)
5857 isl_union_pw_multi_aff_free(upma
);
5860 isl_union_pw_multi_aff_free(upma
);
5861 isl_union_map_free(umap
);
5865 /* Local data for bin_entry and the callback "fn".
5867 struct isl_union_pw_multi_aff_bin_data
{
5868 isl_union_pw_multi_aff
*upma2
;
5869 isl_union_pw_multi_aff
*res
;
5870 isl_pw_multi_aff
*pma
;
5871 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
);
5874 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
5875 * and call data->fn for each isl_pw_multi_aff in data->upma2.
5877 static isl_stat
bin_entry(__isl_take isl_pw_multi_aff
*pma
, void *user
)
5879 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5883 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma2
,
5885 isl_pw_multi_aff_free(pma
);
5890 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
5891 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
5892 * passed as user field) and the isl_pw_multi_aff from upma2 is available
5893 * as *entry. The callback should adjust data->res if desired.
5895 static __isl_give isl_union_pw_multi_aff
*bin_op(
5896 __isl_take isl_union_pw_multi_aff
*upma1
,
5897 __isl_take isl_union_pw_multi_aff
*upma2
,
5898 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
))
5901 struct isl_union_pw_multi_aff_bin_data data
= { NULL
, NULL
, NULL
, fn
};
5903 space
= isl_union_pw_multi_aff_get_space(upma2
);
5904 upma1
= isl_union_pw_multi_aff_align_params(upma1
, space
);
5905 space
= isl_union_pw_multi_aff_get_space(upma1
);
5906 upma2
= isl_union_pw_multi_aff_align_params(upma2
, space
);
5908 if (!upma1
|| !upma2
)
5912 data
.res
= isl_union_pw_multi_aff_alloc_same_size(upma1
);
5913 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma1
,
5914 &bin_entry
, &data
) < 0)
5917 isl_union_pw_multi_aff_free(upma1
);
5918 isl_union_pw_multi_aff_free(upma2
);
5921 isl_union_pw_multi_aff_free(upma1
);
5922 isl_union_pw_multi_aff_free(upma2
);
5923 isl_union_pw_multi_aff_free(data
.res
);
5927 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5928 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5930 static __isl_give isl_pw_multi_aff
*pw_multi_aff_range_product(
5931 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5935 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5936 isl_pw_multi_aff_get_space(pma2
));
5937 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5938 &isl_multi_aff_range_product
);
5941 /* Given two isl_pw_multi_affs A -> B and C -> D,
5942 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5944 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_product(
5945 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5947 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5948 &pw_multi_aff_range_product
);
5951 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5952 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5954 static __isl_give isl_pw_multi_aff
*pw_multi_aff_flat_range_product(
5955 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5959 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5960 isl_pw_multi_aff_get_space(pma2
));
5961 space
= isl_space_flatten_range(space
);
5962 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5963 &isl_multi_aff_flat_range_product
);
5966 /* Given two isl_pw_multi_affs A -> B and C -> D,
5967 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5969 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_flat_range_product(
5970 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5972 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5973 &pw_multi_aff_flat_range_product
);
5976 /* If data->pma and "pma2" have the same domain space, then compute
5977 * their flat range product and the result to data->res.
5979 static isl_stat
flat_range_product_entry(__isl_take isl_pw_multi_aff
*pma2
,
5982 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5984 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
5985 pma2
->dim
, isl_dim_in
)) {
5986 isl_pw_multi_aff_free(pma2
);
5990 pma2
= isl_pw_multi_aff_flat_range_product(
5991 isl_pw_multi_aff_copy(data
->pma
), pma2
);
5993 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
5998 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
5999 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
6001 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_flat_range_product(
6002 __isl_take isl_union_pw_multi_aff
*upma1
,
6003 __isl_take isl_union_pw_multi_aff
*upma2
)
6005 return bin_op(upma1
, upma2
, &flat_range_product_entry
);
6008 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6009 * The parameters are assumed to have been aligned.
6011 * The implementation essentially performs an isl_pw_*_on_shared_domain,
6012 * except that it works on two different isl_pw_* types.
6014 static __isl_give isl_pw_multi_aff
*pw_multi_aff_set_pw_aff(
6015 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6016 __isl_take isl_pw_aff
*pa
)
6019 isl_pw_multi_aff
*res
= NULL
;
6024 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_in
,
6025 pa
->dim
, isl_dim_in
))
6026 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6027 "domains don't match", goto error
);
6028 if (pos
>= isl_pw_multi_aff_dim(pma
, isl_dim_out
))
6029 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6030 "index out of bounds", goto error
);
6033 res
= isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma
), n
);
6035 for (i
= 0; i
< pma
->n
; ++i
) {
6036 for (j
= 0; j
< pa
->n
; ++j
) {
6038 isl_multi_aff
*res_ij
;
6041 common
= isl_set_intersect(isl_set_copy(pma
->p
[i
].set
),
6042 isl_set_copy(pa
->p
[j
].set
));
6043 empty
= isl_set_plain_is_empty(common
);
6044 if (empty
< 0 || empty
) {
6045 isl_set_free(common
);
6051 res_ij
= isl_multi_aff_set_aff(
6052 isl_multi_aff_copy(pma
->p
[i
].maff
), pos
,
6053 isl_aff_copy(pa
->p
[j
].aff
));
6054 res_ij
= isl_multi_aff_gist(res_ij
,
6055 isl_set_copy(common
));
6057 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
6061 isl_pw_multi_aff_free(pma
);
6062 isl_pw_aff_free(pa
);
6065 isl_pw_multi_aff_free(pma
);
6066 isl_pw_aff_free(pa
);
6067 return isl_pw_multi_aff_free(res
);
6070 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6072 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_set_pw_aff(
6073 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6074 __isl_take isl_pw_aff
*pa
)
6078 if (isl_space_match(pma
->dim
, isl_dim_param
, pa
->dim
, isl_dim_param
))
6079 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6080 if (!isl_space_has_named_params(pma
->dim
) ||
6081 !isl_space_has_named_params(pa
->dim
))
6082 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6083 "unaligned unnamed parameters", goto error
);
6084 pma
= isl_pw_multi_aff_align_params(pma
, isl_pw_aff_get_space(pa
));
6085 pa
= isl_pw_aff_align_params(pa
, isl_pw_multi_aff_get_space(pma
));
6086 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6088 isl_pw_multi_aff_free(pma
);
6089 isl_pw_aff_free(pa
);
6093 /* Do the parameters of "pa" match those of "space"?
6095 int isl_pw_aff_matching_params(__isl_keep isl_pw_aff
*pa
,
6096 __isl_keep isl_space
*space
)
6098 isl_space
*pa_space
;
6104 pa_space
= isl_pw_aff_get_space(pa
);
6106 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
6108 isl_space_free(pa_space
);
6112 /* Check that the domain space of "pa" matches "space".
6114 * Return 0 on success and -1 on error.
6116 int isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff
*pa
,
6117 __isl_keep isl_space
*space
)
6119 isl_space
*pa_space
;
6125 pa_space
= isl_pw_aff_get_space(pa
);
6127 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
6131 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6132 "parameters don't match", goto error
);
6133 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
6134 pa_space
, isl_dim_in
);
6138 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6139 "domains don't match", goto error
);
6140 isl_space_free(pa_space
);
6143 isl_space_free(pa_space
);
6152 #include <isl_multi_templ.c>
6153 #include <isl_multi_apply_set.c>
6154 #include <isl_multi_coalesce.c>
6155 #include <isl_multi_gist.c>
6156 #include <isl_multi_intersect.c>
6158 /* Scale the elements of "pma" by the corresponding elements of "mv".
6160 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_scale_multi_val(
6161 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
)
6165 pma
= isl_pw_multi_aff_cow(pma
);
6168 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6169 mv
->space
, isl_dim_set
))
6170 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6171 "spaces don't match", goto error
);
6172 if (!isl_space_match(pma
->dim
, isl_dim_param
,
6173 mv
->space
, isl_dim_param
)) {
6174 pma
= isl_pw_multi_aff_align_params(pma
,
6175 isl_multi_val_get_space(mv
));
6176 mv
= isl_multi_val_align_params(mv
,
6177 isl_pw_multi_aff_get_space(pma
));
6182 for (i
= 0; i
< pma
->n
; ++i
) {
6183 pma
->p
[i
].maff
= isl_multi_aff_scale_multi_val(pma
->p
[i
].maff
,
6184 isl_multi_val_copy(mv
));
6185 if (!pma
->p
[i
].maff
)
6189 isl_multi_val_free(mv
);
6192 isl_multi_val_free(mv
);
6193 isl_pw_multi_aff_free(pma
);
6197 /* This function is called for each entry of an isl_union_pw_multi_aff.
6198 * If the space of the entry matches that of data->mv,
6199 * then apply isl_pw_multi_aff_scale_multi_val and return the result.
6200 * Otherwise, return an empty isl_pw_multi_aff.
6202 static __isl_give isl_pw_multi_aff
*union_pw_multi_aff_scale_multi_val_entry(
6203 __isl_take isl_pw_multi_aff
*pma
, void *user
)
6205 isl_multi_val
*mv
= user
;
6209 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6210 mv
->space
, isl_dim_set
)) {
6211 isl_space
*space
= isl_pw_multi_aff_get_space(pma
);
6212 isl_pw_multi_aff_free(pma
);
6213 return isl_pw_multi_aff_empty(space
);
6216 return isl_pw_multi_aff_scale_multi_val(pma
, isl_multi_val_copy(mv
));
6219 /* Scale the elements of "upma" by the corresponding elements of "mv",
6220 * for those entries that match the space of "mv".
6222 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_scale_multi_val(
6223 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_multi_val
*mv
)
6225 upma
= isl_union_pw_multi_aff_align_params(upma
,
6226 isl_multi_val_get_space(mv
));
6227 mv
= isl_multi_val_align_params(mv
,
6228 isl_union_pw_multi_aff_get_space(upma
));
6232 return isl_union_pw_multi_aff_transform(upma
,
6233 &union_pw_multi_aff_scale_multi_val_entry
, mv
);
6235 isl_multi_val_free(mv
);
6238 isl_multi_val_free(mv
);
6239 isl_union_pw_multi_aff_free(upma
);
6243 /* Construct and return a piecewise multi affine expression
6244 * in the given space with value zero in each of the output dimensions and
6245 * a universe domain.
6247 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_zero(__isl_take isl_space
*space
)
6249 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space
));
6252 /* Construct and return a piecewise multi affine expression
6253 * that is equal to the given piecewise affine expression.
6255 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_pw_aff(
6256 __isl_take isl_pw_aff
*pa
)
6260 isl_pw_multi_aff
*pma
;
6265 space
= isl_pw_aff_get_space(pa
);
6266 pma
= isl_pw_multi_aff_alloc_size(space
, pa
->n
);
6268 for (i
= 0; i
< pa
->n
; ++i
) {
6272 set
= isl_set_copy(pa
->p
[i
].set
);
6273 ma
= isl_multi_aff_from_aff(isl_aff_copy(pa
->p
[i
].aff
));
6274 pma
= isl_pw_multi_aff_add_piece(pma
, set
, ma
);
6277 isl_pw_aff_free(pa
);
6281 /* Construct a set or map mapping the shared (parameter) domain
6282 * of the piecewise affine expressions to the range of "mpa"
6283 * with each dimension in the range equated to the
6284 * corresponding piecewise affine expression.
6286 static __isl_give isl_map
*map_from_multi_pw_aff(
6287 __isl_take isl_multi_pw_aff
*mpa
)
6296 if (isl_space_dim(mpa
->space
, isl_dim_out
) != mpa
->n
)
6297 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6298 "invalid space", goto error
);
6300 space
= isl_multi_pw_aff_get_domain_space(mpa
);
6301 map
= isl_map_universe(isl_space_from_domain(space
));
6303 for (i
= 0; i
< mpa
->n
; ++i
) {
6307 pa
= isl_pw_aff_copy(mpa
->p
[i
]);
6308 map_i
= map_from_pw_aff(pa
);
6310 map
= isl_map_flat_range_product(map
, map_i
);
6313 map
= isl_map_reset_space(map
, isl_multi_pw_aff_get_space(mpa
));
6315 isl_multi_pw_aff_free(mpa
);
6318 isl_multi_pw_aff_free(mpa
);
6322 /* Construct a map mapping the shared domain
6323 * of the piecewise affine expressions to the range of "mpa"
6324 * with each dimension in the range equated to the
6325 * corresponding piecewise affine expression.
6327 __isl_give isl_map
*isl_map_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6331 if (isl_space_is_set(mpa
->space
))
6332 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6333 "space of input is not a map", goto error
);
6335 return map_from_multi_pw_aff(mpa
);
6337 isl_multi_pw_aff_free(mpa
);
6341 /* Construct a set mapping the shared parameter domain
6342 * of the piecewise affine expressions to the space of "mpa"
6343 * with each dimension in the range equated to the
6344 * corresponding piecewise affine expression.
6346 __isl_give isl_set
*isl_set_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6350 if (!isl_space_is_set(mpa
->space
))
6351 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6352 "space of input is not a set", goto error
);
6354 return map_from_multi_pw_aff(mpa
);
6356 isl_multi_pw_aff_free(mpa
);
6360 /* Construct and return a piecewise multi affine expression
6361 * that is equal to the given multi piecewise affine expression
6362 * on the shared domain of the piecewise affine expressions.
6364 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff(
6365 __isl_take isl_multi_pw_aff
*mpa
)
6370 isl_pw_multi_aff
*pma
;
6375 space
= isl_multi_pw_aff_get_space(mpa
);
6378 isl_multi_pw_aff_free(mpa
);
6379 return isl_pw_multi_aff_zero(space
);
6382 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, 0);
6383 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
6385 for (i
= 1; i
< mpa
->n
; ++i
) {
6386 isl_pw_multi_aff
*pma_i
;
6388 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6389 pma_i
= isl_pw_multi_aff_from_pw_aff(pa
);
6390 pma
= isl_pw_multi_aff_range_product(pma
, pma_i
);
6393 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
6395 isl_multi_pw_aff_free(mpa
);
6399 /* Construct and return a multi piecewise affine expression
6400 * that is equal to the given multi affine expression.
6402 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_multi_aff(
6403 __isl_take isl_multi_aff
*ma
)
6406 isl_multi_pw_aff
*mpa
;
6411 n
= isl_multi_aff_dim(ma
, isl_dim_out
);
6412 mpa
= isl_multi_pw_aff_alloc(isl_multi_aff_get_space(ma
));
6414 for (i
= 0; i
< n
; ++i
) {
6417 pa
= isl_pw_aff_from_aff(isl_multi_aff_get_aff(ma
, i
));
6418 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6421 isl_multi_aff_free(ma
);
6425 /* Construct and return a multi piecewise affine expression
6426 * that is equal to the given piecewise multi affine expression.
6428 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_pw_multi_aff(
6429 __isl_take isl_pw_multi_aff
*pma
)
6433 isl_multi_pw_aff
*mpa
;
6438 n
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
6439 space
= isl_pw_multi_aff_get_space(pma
);
6440 mpa
= isl_multi_pw_aff_alloc(space
);
6442 for (i
= 0; i
< n
; ++i
) {
6445 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
6446 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6449 isl_pw_multi_aff_free(pma
);
6453 /* Do "pa1" and "pa2" represent the same function?
6455 * We first check if they are obviously equal.
6456 * If not, we convert them to maps and check if those are equal.
6458 int isl_pw_aff_is_equal(__isl_keep isl_pw_aff
*pa1
, __isl_keep isl_pw_aff
*pa2
)
6461 isl_map
*map1
, *map2
;
6466 equal
= isl_pw_aff_plain_is_equal(pa1
, pa2
);
6467 if (equal
< 0 || equal
)
6470 map1
= map_from_pw_aff(isl_pw_aff_copy(pa1
));
6471 map2
= map_from_pw_aff(isl_pw_aff_copy(pa2
));
6472 equal
= isl_map_is_equal(map1
, map2
);
6479 /* Do "mpa1" and "mpa2" represent the same function?
6481 * Note that we cannot convert the entire isl_multi_pw_aff
6482 * to a map because the domains of the piecewise affine expressions
6483 * may not be the same.
6485 isl_bool
isl_multi_pw_aff_is_equal(__isl_keep isl_multi_pw_aff
*mpa1
,
6486 __isl_keep isl_multi_pw_aff
*mpa2
)
6492 return isl_bool_error
;
6494 if (!isl_space_match(mpa1
->space
, isl_dim_param
,
6495 mpa2
->space
, isl_dim_param
)) {
6496 if (!isl_space_has_named_params(mpa1
->space
))
6497 return isl_bool_false
;
6498 if (!isl_space_has_named_params(mpa2
->space
))
6499 return isl_bool_false
;
6500 mpa1
= isl_multi_pw_aff_copy(mpa1
);
6501 mpa2
= isl_multi_pw_aff_copy(mpa2
);
6502 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6503 isl_multi_pw_aff_get_space(mpa2
));
6504 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6505 isl_multi_pw_aff_get_space(mpa1
));
6506 equal
= isl_multi_pw_aff_is_equal(mpa1
, mpa2
);
6507 isl_multi_pw_aff_free(mpa1
);
6508 isl_multi_pw_aff_free(mpa2
);
6512 equal
= isl_space_is_equal(mpa1
->space
, mpa2
->space
);
6513 if (equal
< 0 || !equal
)
6516 for (i
= 0; i
< mpa1
->n
; ++i
) {
6517 equal
= isl_pw_aff_is_equal(mpa1
->p
[i
], mpa2
->p
[i
]);
6518 if (equal
< 0 || !equal
)
6522 return isl_bool_true
;
6525 /* Compute the pullback of "mpa" by the function represented by "ma".
6526 * In other words, plug in "ma" in "mpa".
6528 * The parameters of "mpa" and "ma" are assumed to have been aligned.
6530 static __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff_aligned(
6531 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6534 isl_space
*space
= NULL
;
6536 mpa
= isl_multi_pw_aff_cow(mpa
);
6540 space
= isl_space_join(isl_multi_aff_get_space(ma
),
6541 isl_multi_pw_aff_get_space(mpa
));
6545 for (i
= 0; i
< mpa
->n
; ++i
) {
6546 mpa
->p
[i
] = isl_pw_aff_pullback_multi_aff(mpa
->p
[i
],
6547 isl_multi_aff_copy(ma
));
6552 isl_multi_aff_free(ma
);
6553 isl_space_free(mpa
->space
);
6557 isl_space_free(space
);
6558 isl_multi_pw_aff_free(mpa
);
6559 isl_multi_aff_free(ma
);
6563 /* Compute the pullback of "mpa" by the function represented by "ma".
6564 * In other words, plug in "ma" in "mpa".
6566 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff(
6567 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6571 if (isl_space_match(mpa
->space
, isl_dim_param
,
6572 ma
->space
, isl_dim_param
))
6573 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6574 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_multi_aff_get_space(ma
));
6575 ma
= isl_multi_aff_align_params(ma
, isl_multi_pw_aff_get_space(mpa
));
6576 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6578 isl_multi_pw_aff_free(mpa
);
6579 isl_multi_aff_free(ma
);
6583 /* Compute the pullback of "mpa" by the function represented by "pma".
6584 * In other words, plug in "pma" in "mpa".
6586 * The parameters of "mpa" and "mpa" are assumed to have been aligned.
6588 static __isl_give isl_multi_pw_aff
*
6589 isl_multi_pw_aff_pullback_pw_multi_aff_aligned(
6590 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6593 isl_space
*space
= NULL
;
6595 mpa
= isl_multi_pw_aff_cow(mpa
);
6599 space
= isl_space_join(isl_pw_multi_aff_get_space(pma
),
6600 isl_multi_pw_aff_get_space(mpa
));
6602 for (i
= 0; i
< mpa
->n
; ++i
) {
6603 mpa
->p
[i
] = isl_pw_aff_pullback_pw_multi_aff_aligned(mpa
->p
[i
],
6604 isl_pw_multi_aff_copy(pma
));
6609 isl_pw_multi_aff_free(pma
);
6610 isl_space_free(mpa
->space
);
6614 isl_space_free(space
);
6615 isl_multi_pw_aff_free(mpa
);
6616 isl_pw_multi_aff_free(pma
);
6620 /* Compute the pullback of "mpa" by the function represented by "pma".
6621 * In other words, plug in "pma" in "mpa".
6623 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_pw_multi_aff(
6624 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6628 if (isl_space_match(mpa
->space
, isl_dim_param
, pma
->dim
, isl_dim_param
))
6629 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6630 mpa
= isl_multi_pw_aff_align_params(mpa
,
6631 isl_pw_multi_aff_get_space(pma
));
6632 pma
= isl_pw_multi_aff_align_params(pma
,
6633 isl_multi_pw_aff_get_space(mpa
));
6634 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6636 isl_multi_pw_aff_free(mpa
);
6637 isl_pw_multi_aff_free(pma
);
6641 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6642 * with the domain of "aff". The domain of the result is the same
6644 * "mpa" and "aff" are assumed to have been aligned.
6646 * We first extract the parametric constant from "aff", defined
6647 * over the correct domain.
6648 * Then we add the appropriate combinations of the members of "mpa".
6649 * Finally, we add the integer divisions through recursive calls.
6651 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff_aligned(
6652 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6660 n_in
= isl_aff_dim(aff
, isl_dim_in
);
6661 n_div
= isl_aff_dim(aff
, isl_dim_div
);
6663 space
= isl_space_domain(isl_multi_pw_aff_get_space(mpa
));
6664 tmp
= isl_aff_copy(aff
);
6665 tmp
= isl_aff_drop_dims(tmp
, isl_dim_div
, 0, n_div
);
6666 tmp
= isl_aff_drop_dims(tmp
, isl_dim_in
, 0, n_in
);
6667 tmp
= isl_aff_add_dims(tmp
, isl_dim_in
,
6668 isl_space_dim(space
, isl_dim_set
));
6669 tmp
= isl_aff_reset_domain_space(tmp
, space
);
6670 pa
= isl_pw_aff_from_aff(tmp
);
6672 for (i
= 0; i
< n_in
; ++i
) {
6675 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
6677 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
6678 pa_i
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6679 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6680 pa
= isl_pw_aff_add(pa
, pa_i
);
6683 for (i
= 0; i
< n_div
; ++i
) {
6687 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
6689 div
= isl_aff_get_div(aff
, i
);
6690 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6691 isl_multi_pw_aff_copy(mpa
), div
);
6692 pa_i
= isl_pw_aff_floor(pa_i
);
6693 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
6694 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6695 pa
= isl_pw_aff_add(pa
, pa_i
);
6698 isl_multi_pw_aff_free(mpa
);
6704 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6705 * with the domain of "aff". The domain of the result is the same
6708 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff(
6709 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6713 if (isl_space_match(aff
->ls
->dim
, isl_dim_param
,
6714 mpa
->space
, isl_dim_param
))
6715 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6717 aff
= isl_aff_align_params(aff
, isl_multi_pw_aff_get_space(mpa
));
6718 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_aff_get_space(aff
));
6720 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6723 isl_multi_pw_aff_free(mpa
);
6727 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6728 * with the domain of "pa". The domain of the result is the same
6730 * "mpa" and "pa" are assumed to have been aligned.
6732 * We consider each piece in turn. Note that the domains of the
6733 * pieces are assumed to be disjoint and they remain disjoint
6734 * after taking the preimage (over the same function).
6736 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff_aligned(
6737 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6746 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa
),
6747 isl_pw_aff_get_space(pa
));
6748 res
= isl_pw_aff_empty(space
);
6750 for (i
= 0; i
< pa
->n
; ++i
) {
6754 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6755 isl_multi_pw_aff_copy(mpa
),
6756 isl_aff_copy(pa
->p
[i
].aff
));
6757 domain
= isl_set_copy(pa
->p
[i
].set
);
6758 domain
= isl_set_preimage_multi_pw_aff(domain
,
6759 isl_multi_pw_aff_copy(mpa
));
6760 pa_i
= isl_pw_aff_intersect_domain(pa_i
, domain
);
6761 res
= isl_pw_aff_add_disjoint(res
, pa_i
);
6764 isl_pw_aff_free(pa
);
6765 isl_multi_pw_aff_free(mpa
);
6768 isl_pw_aff_free(pa
);
6769 isl_multi_pw_aff_free(mpa
);
6773 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6774 * with the domain of "pa". The domain of the result is the same
6777 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff(
6778 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6782 if (isl_space_match(pa
->dim
, isl_dim_param
, mpa
->space
, isl_dim_param
))
6783 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6785 pa
= isl_pw_aff_align_params(pa
, isl_multi_pw_aff_get_space(mpa
));
6786 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_pw_aff_get_space(pa
));
6788 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6790 isl_pw_aff_free(pa
);
6791 isl_multi_pw_aff_free(mpa
);
6795 /* Compute the pullback of "pa" by the function represented by "mpa".
6796 * In other words, plug in "mpa" in "pa".
6797 * "pa" and "mpa" are assumed to have been aligned.
6799 * The pullback is computed by applying "pa" to "mpa".
6801 static __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff_aligned(
6802 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6804 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6807 /* Compute the pullback of "pa" by the function represented by "mpa".
6808 * In other words, plug in "mpa" in "pa".
6810 * The pullback is computed by applying "pa" to "mpa".
6812 __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff(
6813 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6815 return isl_multi_pw_aff_apply_pw_aff(mpa
, pa
);
6818 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6819 * In other words, plug in "mpa2" in "mpa1".
6821 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6823 * We pullback each member of "mpa1" in turn.
6825 static __isl_give isl_multi_pw_aff
*
6826 isl_multi_pw_aff_pullback_multi_pw_aff_aligned(
6827 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6830 isl_space
*space
= NULL
;
6832 mpa1
= isl_multi_pw_aff_cow(mpa1
);
6836 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa2
),
6837 isl_multi_pw_aff_get_space(mpa1
));
6839 for (i
= 0; i
< mpa1
->n
; ++i
) {
6840 mpa1
->p
[i
] = isl_pw_aff_pullback_multi_pw_aff_aligned(
6841 mpa1
->p
[i
], isl_multi_pw_aff_copy(mpa2
));
6846 mpa1
= isl_multi_pw_aff_reset_space(mpa1
, space
);
6848 isl_multi_pw_aff_free(mpa2
);
6851 isl_space_free(space
);
6852 isl_multi_pw_aff_free(mpa1
);
6853 isl_multi_pw_aff_free(mpa2
);
6857 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6858 * In other words, plug in "mpa2" in "mpa1".
6860 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_pw_aff(
6861 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6863 return isl_multi_pw_aff_align_params_multi_multi_and(mpa1
, mpa2
,
6864 &isl_multi_pw_aff_pullback_multi_pw_aff_aligned
);
6867 /* Align the parameters of "mpa1" and "mpa2", check that the ranges
6868 * of "mpa1" and "mpa2" live in the same space, construct map space
6869 * between the domain spaces of "mpa1" and "mpa2" and call "order"
6870 * with this map space as extract argument.
6872 static __isl_give isl_map
*isl_multi_pw_aff_order_map(
6873 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6874 __isl_give isl_map
*(*order
)(__isl_keep isl_multi_pw_aff
*mpa1
,
6875 __isl_keep isl_multi_pw_aff
*mpa2
, __isl_take isl_space
*space
))
6878 isl_space
*space1
, *space2
;
6881 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6882 isl_multi_pw_aff_get_space(mpa2
));
6883 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6884 isl_multi_pw_aff_get_space(mpa1
));
6887 match
= isl_space_tuple_is_equal(mpa1
->space
, isl_dim_out
,
6888 mpa2
->space
, isl_dim_out
);
6892 isl_die(isl_multi_pw_aff_get_ctx(mpa1
), isl_error_invalid
,
6893 "range spaces don't match", goto error
);
6894 space1
= isl_space_domain(isl_multi_pw_aff_get_space(mpa1
));
6895 space2
= isl_space_domain(isl_multi_pw_aff_get_space(mpa2
));
6896 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
6898 res
= order(mpa1
, mpa2
, space1
);
6899 isl_multi_pw_aff_free(mpa1
);
6900 isl_multi_pw_aff_free(mpa2
);
6903 isl_multi_pw_aff_free(mpa1
);
6904 isl_multi_pw_aff_free(mpa2
);
6908 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6909 * where the function values are equal. "space" is the space of the result.
6910 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6912 * "mpa1" and "mpa2" are equal when each of the pairs of elements
6913 * in the sequences are equal.
6915 static __isl_give isl_map
*isl_multi_pw_aff_eq_map_on_space(
6916 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
6917 __isl_take isl_space
*space
)
6922 res
= isl_map_universe(space
);
6924 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
6925 for (i
= 0; i
< n
; ++i
) {
6926 isl_pw_aff
*pa1
, *pa2
;
6929 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6930 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6931 map
= isl_pw_aff_eq_map(pa1
, pa2
);
6932 res
= isl_map_intersect(res
, map
);
6938 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6939 * where the function values are equal.
6941 __isl_give isl_map
*isl_multi_pw_aff_eq_map(__isl_take isl_multi_pw_aff
*mpa1
,
6942 __isl_take isl_multi_pw_aff
*mpa2
)
6944 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
6945 &isl_multi_pw_aff_eq_map_on_space
);
6948 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6949 * where the function values of "mpa1" is lexicographically satisfies "base"
6950 * compared to that of "mpa2". "space" is the space of the result.
6951 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6953 * "mpa1" lexicographically satisfies "base" compared to "mpa2"
6954 * if its i-th element satisfies "base" when compared to
6955 * the i-th element of "mpa2" while all previous elements are
6958 static __isl_give isl_map
*isl_multi_pw_aff_lex_map_on_space(
6959 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6960 __isl_give isl_map
*(*base
)(__isl_take isl_pw_aff
*pa1
,
6961 __isl_take isl_pw_aff
*pa2
),
6962 __isl_take isl_space
*space
)
6965 isl_map
*res
, *rest
;
6967 res
= isl_map_empty(isl_space_copy(space
));
6968 rest
= isl_map_universe(space
);
6970 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
6971 for (i
= 0; i
< n
; ++i
) {
6972 isl_pw_aff
*pa1
, *pa2
;
6975 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6976 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6977 map
= base(pa1
, pa2
);
6978 map
= isl_map_intersect(map
, isl_map_copy(rest
));
6979 res
= isl_map_union(res
, map
);
6984 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6985 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6986 map
= isl_pw_aff_eq_map(pa1
, pa2
);
6987 rest
= isl_map_intersect(rest
, map
);
6994 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6995 * where the function value of "mpa1" is lexicographically less than that
6996 * of "mpa2". "space" is the space of the result.
6997 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6999 * "mpa1" is less than "mpa2" if its i-th element is smaller
7000 * than the i-th element of "mpa2" while all previous elements are
7003 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map_on_space(
7004 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
7005 __isl_take isl_space
*space
)
7007 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
7008 &isl_pw_aff_lt_map
, space
);
7011 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7012 * where the function value of "mpa1" is lexicographically less than that
7015 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map(
7016 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
7018 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7019 &isl_multi_pw_aff_lex_lt_map_on_space
);
7022 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7023 * where the function value of "mpa1" is lexicographically greater than that
7024 * of "mpa2". "space" is the space of the result.
7025 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7027 * "mpa1" is greater than "mpa2" if its i-th element is greater
7028 * than the i-th element of "mpa2" while all previous elements are
7031 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map_on_space(
7032 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
7033 __isl_take isl_space
*space
)
7035 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
7036 &isl_pw_aff_gt_map
, space
);
7039 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7040 * where the function value of "mpa1" is lexicographically greater than that
7043 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map(
7044 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
7046 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7047 &isl_multi_pw_aff_lex_gt_map_on_space
);
7050 /* Compare two isl_affs.
7052 * Return -1 if "aff1" is "smaller" than "aff2", 1 if "aff1" is "greater"
7053 * than "aff2" and 0 if they are equal.
7055 * The order is fairly arbitrary. We do consider expressions that only involve
7056 * earlier dimensions as "smaller".
7058 int isl_aff_plain_cmp(__isl_keep isl_aff
*aff1
, __isl_keep isl_aff
*aff2
)
7071 cmp
= isl_local_space_cmp(aff1
->ls
, aff2
->ls
);
7075 last1
= isl_seq_last_non_zero(aff1
->v
->el
+ 1, aff1
->v
->size
- 1);
7076 last2
= isl_seq_last_non_zero(aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
7078 return last1
- last2
;
7080 return isl_seq_cmp(aff1
->v
->el
, aff2
->v
->el
, aff1
->v
->size
);
7083 /* Compare two isl_pw_affs.
7085 * Return -1 if "pa1" is "smaller" than "pa2", 1 if "pa1" is "greater"
7086 * than "pa2" and 0 if they are equal.
7088 * The order is fairly arbitrary. We do consider expressions that only involve
7089 * earlier dimensions as "smaller".
7091 int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff
*pa1
,
7092 __isl_keep isl_pw_aff
*pa2
)
7105 cmp
= isl_space_cmp(pa1
->dim
, pa2
->dim
);
7109 if (pa1
->n
!= pa2
->n
)
7110 return pa1
->n
- pa2
->n
;
7112 for (i
= 0; i
< pa1
->n
; ++i
) {
7113 cmp
= isl_set_plain_cmp(pa1
->p
[i
].set
, pa2
->p
[i
].set
);
7116 cmp
= isl_aff_plain_cmp(pa1
->p
[i
].aff
, pa2
->p
[i
].aff
);
7124 /* Return a piecewise affine expression that is equal to "v" on "domain".
7126 __isl_give isl_pw_aff
*isl_pw_aff_val_on_domain(__isl_take isl_set
*domain
,
7127 __isl_take isl_val
*v
)
7130 isl_local_space
*ls
;
7133 space
= isl_set_get_space(domain
);
7134 ls
= isl_local_space_from_space(space
);
7135 aff
= isl_aff_val_on_domain(ls
, v
);
7137 return isl_pw_aff_alloc(domain
, aff
);
7140 /* Return a multi affine expression that is equal to "mv" on domain
7143 __isl_give isl_multi_aff
*isl_multi_aff_multi_val_on_space(
7144 __isl_take isl_space
*space
, __isl_take isl_multi_val
*mv
)
7148 isl_local_space
*ls
;
7154 n
= isl_multi_val_dim(mv
, isl_dim_set
);
7155 space2
= isl_multi_val_get_space(mv
);
7156 space2
= isl_space_align_params(space2
, isl_space_copy(space
));
7157 space
= isl_space_align_params(space
, isl_space_copy(space2
));
7158 space
= isl_space_map_from_domain_and_range(space
, space2
);
7159 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
7160 ls
= isl_local_space_from_space(isl_space_domain(space
));
7161 for (i
= 0; i
< n
; ++i
) {
7165 v
= isl_multi_val_get_val(mv
, i
);
7166 aff
= isl_aff_val_on_domain(isl_local_space_copy(ls
), v
);
7167 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
7169 isl_local_space_free(ls
);
7171 isl_multi_val_free(mv
);
7174 isl_space_free(space
);
7175 isl_multi_val_free(mv
);
7179 /* Return a piecewise multi-affine expression
7180 * that is equal to "mv" on "domain".
7182 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_multi_val_on_domain(
7183 __isl_take isl_set
*domain
, __isl_take isl_multi_val
*mv
)
7188 space
= isl_set_get_space(domain
);
7189 ma
= isl_multi_aff_multi_val_on_space(space
, mv
);
7191 return isl_pw_multi_aff_alloc(domain
, ma
);
7194 /* Internal data structure for isl_union_pw_multi_aff_multi_val_on_domain.
7195 * mv is the value that should be attained on each domain set
7196 * res collects the results
7198 struct isl_union_pw_multi_aff_multi_val_on_domain_data
{
7200 isl_union_pw_multi_aff
*res
;
7203 /* Create an isl_pw_multi_aff equal to data->mv on "domain"
7204 * and add it to data->res.
7206 static isl_stat
pw_multi_aff_multi_val_on_domain(__isl_take isl_set
*domain
,
7209 struct isl_union_pw_multi_aff_multi_val_on_domain_data
*data
= user
;
7210 isl_pw_multi_aff
*pma
;
7213 mv
= isl_multi_val_copy(data
->mv
);
7214 pma
= isl_pw_multi_aff_multi_val_on_domain(domain
, mv
);
7215 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
7217 return data
->res
? isl_stat_ok
: isl_stat_error
;
7220 /* Return a union piecewise multi-affine expression
7221 * that is equal to "mv" on "domain".
7223 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_multi_val_on_domain(
7224 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7226 struct isl_union_pw_multi_aff_multi_val_on_domain_data data
;
7229 space
= isl_union_set_get_space(domain
);
7230 data
.res
= isl_union_pw_multi_aff_empty(space
);
7232 if (isl_union_set_foreach_set(domain
,
7233 &pw_multi_aff_multi_val_on_domain
, &data
) < 0)
7234 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
7235 isl_union_set_free(domain
);
7236 isl_multi_val_free(mv
);
7240 /* Compute the pullback of data->pma by the function represented by "pma2",
7241 * provided the spaces match, and add the results to data->res.
7243 static isl_stat
pullback_entry(__isl_take isl_pw_multi_aff
*pma2
, void *user
)
7245 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
7247 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
7248 pma2
->dim
, isl_dim_out
)) {
7249 isl_pw_multi_aff_free(pma2
);
7253 pma2
= isl_pw_multi_aff_pullback_pw_multi_aff(
7254 isl_pw_multi_aff_copy(data
->pma
), pma2
);
7256 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
7258 return isl_stat_error
;
7263 /* Compute the pullback of "upma1" by the function represented by "upma2".
7265 __isl_give isl_union_pw_multi_aff
*
7266 isl_union_pw_multi_aff_pullback_union_pw_multi_aff(
7267 __isl_take isl_union_pw_multi_aff
*upma1
,
7268 __isl_take isl_union_pw_multi_aff
*upma2
)
7270 return bin_op(upma1
, upma2
, &pullback_entry
);
7273 /* Check that the domain space of "upa" matches "space".
7275 * Return 0 on success and -1 on error.
7277 * This function is called from isl_multi_union_pw_aff_set_union_pw_aff and
7278 * can in principle never fail since the space "space" is that
7279 * of the isl_multi_union_pw_aff and is a set space such that
7280 * there is no domain space to match.
7282 * We check the parameters and double-check that "space" is
7283 * indeed that of a set.
7285 static int isl_union_pw_aff_check_match_domain_space(
7286 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7288 isl_space
*upa_space
;
7294 match
= isl_space_is_set(space
);
7298 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7299 "expecting set space", return -1);
7301 upa_space
= isl_union_pw_aff_get_space(upa
);
7302 match
= isl_space_match(space
, isl_dim_param
, upa_space
, isl_dim_param
);
7306 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7307 "parameters don't match", goto error
);
7309 isl_space_free(upa_space
);
7312 isl_space_free(upa_space
);
7316 /* Do the parameters of "upa" match those of "space"?
7318 static int isl_union_pw_aff_matching_params(__isl_keep isl_union_pw_aff
*upa
,
7319 __isl_keep isl_space
*space
)
7321 isl_space
*upa_space
;
7327 upa_space
= isl_union_pw_aff_get_space(upa
);
7329 match
= isl_space_match(space
, isl_dim_param
, upa_space
, isl_dim_param
);
7331 isl_space_free(upa_space
);
7335 /* Internal data structure for isl_union_pw_aff_reset_domain_space.
7336 * space represents the new parameters.
7337 * res collects the results.
7339 struct isl_union_pw_aff_reset_params_data
{
7341 isl_union_pw_aff
*res
;
7344 /* Replace the parameters of "pa" by data->space and
7345 * add the result to data->res.
7347 static isl_stat
reset_params(__isl_take isl_pw_aff
*pa
, void *user
)
7349 struct isl_union_pw_aff_reset_params_data
*data
= user
;
7352 space
= isl_pw_aff_get_space(pa
);
7353 space
= isl_space_replace(space
, isl_dim_param
, data
->space
);
7354 pa
= isl_pw_aff_reset_space(pa
, space
);
7355 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7357 return data
->res
? isl_stat_ok
: isl_stat_error
;
7360 /* Replace the domain space of "upa" by "space".
7361 * Since a union expression does not have a (single) domain space,
7362 * "space" is necessarily a parameter space.
7364 * Since the order and the names of the parameters determine
7365 * the hash value, we need to create a new hash table.
7367 static __isl_give isl_union_pw_aff
*isl_union_pw_aff_reset_domain_space(
7368 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_space
*space
)
7370 struct isl_union_pw_aff_reset_params_data data
= { space
};
7373 match
= isl_union_pw_aff_matching_params(upa
, space
);
7375 upa
= isl_union_pw_aff_free(upa
);
7377 isl_space_free(space
);
7381 data
.res
= isl_union_pw_aff_empty(isl_space_copy(space
));
7382 if (isl_union_pw_aff_foreach_pw_aff(upa
, &reset_params
, &data
) < 0)
7383 data
.res
= isl_union_pw_aff_free(data
.res
);
7385 isl_union_pw_aff_free(upa
);
7386 isl_space_free(space
);
7390 /* Return the floor of "pa".
7392 static __isl_give isl_pw_aff
*floor_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7394 return isl_pw_aff_floor(pa
);
7397 /* Given f, return floor(f).
7399 __isl_give isl_union_pw_aff
*isl_union_pw_aff_floor(
7400 __isl_take isl_union_pw_aff
*upa
)
7402 return isl_union_pw_aff_transform_inplace(upa
, &floor_entry
, NULL
);
7407 * upa mod m = upa - m * floor(upa/m)
7409 * with m an integer value.
7411 __isl_give isl_union_pw_aff
*isl_union_pw_aff_mod_val(
7412 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_val
*m
)
7414 isl_union_pw_aff
*res
;
7419 if (!isl_val_is_int(m
))
7420 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7421 "expecting integer modulo", goto error
);
7422 if (!isl_val_is_pos(m
))
7423 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7424 "expecting positive modulo", goto error
);
7426 res
= isl_union_pw_aff_copy(upa
);
7427 upa
= isl_union_pw_aff_scale_down_val(upa
, isl_val_copy(m
));
7428 upa
= isl_union_pw_aff_floor(upa
);
7429 upa
= isl_union_pw_aff_scale_val(upa
, m
);
7430 res
= isl_union_pw_aff_sub(res
, upa
);
7435 isl_union_pw_aff_free(upa
);
7439 /* Internal data structure for isl_union_pw_aff_aff_on_domain.
7440 * "aff" is the symbolic value that the resulting isl_union_pw_aff
7442 * "res" collects the results.
7444 struct isl_union_pw_aff_aff_on_domain_data
{
7446 isl_union_pw_aff
*res
;
7449 /* Construct a piecewise affine expression that is equal to data->aff
7450 * on "domain" and add the result to data->res.
7452 static isl_stat
pw_aff_aff_on_domain(__isl_take isl_set
*domain
, void *user
)
7454 struct isl_union_pw_aff_aff_on_domain_data
*data
= user
;
7459 aff
= isl_aff_copy(data
->aff
);
7460 dim
= isl_set_dim(domain
, isl_dim_set
);
7461 aff
= isl_aff_add_dims(aff
, isl_dim_in
, dim
);
7462 aff
= isl_aff_reset_domain_space(aff
, isl_set_get_space(domain
));
7463 pa
= isl_pw_aff_alloc(domain
, aff
);
7464 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7466 return data
->res
? isl_stat_ok
: isl_stat_error
;
7469 /* Internal data structure for isl_union_pw_multi_aff_get_union_pw_aff.
7470 * pos is the output position that needs to be extracted.
7471 * res collects the results.
7473 struct isl_union_pw_multi_aff_get_union_pw_aff_data
{
7475 isl_union_pw_aff
*res
;
7478 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma"
7479 * (assuming it has such a dimension) and add it to data->res.
7481 static isl_stat
get_union_pw_aff(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7483 struct isl_union_pw_multi_aff_get_union_pw_aff_data
*data
= user
;
7488 return isl_stat_error
;
7490 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
7491 if (data
->pos
>= n_out
) {
7492 isl_pw_multi_aff_free(pma
);
7496 pa
= isl_pw_multi_aff_get_pw_aff(pma
, data
->pos
);
7497 isl_pw_multi_aff_free(pma
);
7499 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7501 return data
->res
? isl_stat_ok
: isl_stat_error
;
7504 /* Extract an isl_union_pw_aff corresponding to
7505 * output dimension "pos" of "upma".
7507 __isl_give isl_union_pw_aff
*isl_union_pw_multi_aff_get_union_pw_aff(
7508 __isl_keep isl_union_pw_multi_aff
*upma
, int pos
)
7510 struct isl_union_pw_multi_aff_get_union_pw_aff_data data
;
7517 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7518 "cannot extract at negative position", return NULL
);
7520 space
= isl_union_pw_multi_aff_get_space(upma
);
7521 data
.res
= isl_union_pw_aff_empty(space
);
7523 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
7524 &get_union_pw_aff
, &data
) < 0)
7525 data
.res
= isl_union_pw_aff_free(data
.res
);
7530 /* Return a union piecewise affine expression
7531 * that is equal to "aff" on "domain".
7533 * Construct an isl_pw_aff on each of the sets in "domain" and
7534 * collect the results.
7536 __isl_give isl_union_pw_aff
*isl_union_pw_aff_aff_on_domain(
7537 __isl_take isl_union_set
*domain
, __isl_take isl_aff
*aff
)
7539 struct isl_union_pw_aff_aff_on_domain_data data
;
7542 if (!domain
|| !aff
)
7544 if (!isl_local_space_is_params(aff
->ls
))
7545 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
7546 "expecting parametric expression", goto error
);
7548 space
= isl_union_set_get_space(domain
);
7549 data
.res
= isl_union_pw_aff_empty(space
);
7551 if (isl_union_set_foreach_set(domain
, &pw_aff_aff_on_domain
, &data
) < 0)
7552 data
.res
= isl_union_pw_aff_free(data
.res
);
7553 isl_union_set_free(domain
);
7557 isl_union_set_free(domain
);
7562 /* Internal data structure for isl_union_pw_aff_val_on_domain.
7563 * "v" is the value that the resulting isl_union_pw_aff needs to attain.
7564 * "res" collects the results.
7566 struct isl_union_pw_aff_val_on_domain_data
{
7568 isl_union_pw_aff
*res
;
7571 /* Construct a piecewise affine expression that is equal to data->v
7572 * on "domain" and add the result to data->res.
7574 static isl_stat
pw_aff_val_on_domain(__isl_take isl_set
*domain
, void *user
)
7576 struct isl_union_pw_aff_val_on_domain_data
*data
= user
;
7580 v
= isl_val_copy(data
->v
);
7581 pa
= isl_pw_aff_val_on_domain(domain
, v
);
7582 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7584 return data
->res
? isl_stat_ok
: isl_stat_error
;
7587 /* Return a union piecewise affine expression
7588 * that is equal to "v" on "domain".
7590 * Construct an isl_pw_aff on each of the sets in "domain" and
7591 * collect the results.
7593 __isl_give isl_union_pw_aff
*isl_union_pw_aff_val_on_domain(
7594 __isl_take isl_union_set
*domain
, __isl_take isl_val
*v
)
7596 struct isl_union_pw_aff_val_on_domain_data data
;
7599 space
= isl_union_set_get_space(domain
);
7600 data
.res
= isl_union_pw_aff_empty(space
);
7602 if (isl_union_set_foreach_set(domain
, &pw_aff_val_on_domain
, &data
) < 0)
7603 data
.res
= isl_union_pw_aff_free(data
.res
);
7604 isl_union_set_free(domain
);
7609 /* Construct a piecewise multi affine expression
7610 * that is equal to "pa" and add it to upma.
7612 static isl_stat
pw_multi_aff_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
,
7615 isl_union_pw_multi_aff
**upma
= user
;
7616 isl_pw_multi_aff
*pma
;
7618 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
7619 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
7621 return *upma
? isl_stat_ok
: isl_stat_error
;
7624 /* Construct and return a union piecewise multi affine expression
7625 * that is equal to the given union piecewise affine expression.
7627 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_pw_aff(
7628 __isl_take isl_union_pw_aff
*upa
)
7631 isl_union_pw_multi_aff
*upma
;
7636 space
= isl_union_pw_aff_get_space(upa
);
7637 upma
= isl_union_pw_multi_aff_empty(space
);
7639 if (isl_union_pw_aff_foreach_pw_aff(upa
,
7640 &pw_multi_aff_from_pw_aff_entry
, &upma
) < 0)
7641 upma
= isl_union_pw_multi_aff_free(upma
);
7643 isl_union_pw_aff_free(upa
);
7647 /* Compute the set of elements in the domain of "pa" where it is zero and
7648 * add this set to "uset".
7650 static isl_stat
zero_union_set(__isl_take isl_pw_aff
*pa
, void *user
)
7652 isl_union_set
**uset
= (isl_union_set
**)user
;
7654 *uset
= isl_union_set_add_set(*uset
, isl_pw_aff_zero_set(pa
));
7656 return *uset
? isl_stat_ok
: isl_stat_error
;
7659 /* Return a union set containing those elements in the domain
7660 * of "upa" where it is zero.
7662 __isl_give isl_union_set
*isl_union_pw_aff_zero_union_set(
7663 __isl_take isl_union_pw_aff
*upa
)
7665 isl_union_set
*zero
;
7667 zero
= isl_union_set_empty(isl_union_pw_aff_get_space(upa
));
7668 if (isl_union_pw_aff_foreach_pw_aff(upa
, &zero_union_set
, &zero
) < 0)
7669 zero
= isl_union_set_free(zero
);
7671 isl_union_pw_aff_free(upa
);
7675 /* Convert "pa" to an isl_map and add it to *umap.
7677 static isl_stat
map_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7679 isl_union_map
**umap
= user
;
7682 map
= isl_map_from_pw_aff(pa
);
7683 *umap
= isl_union_map_add_map(*umap
, map
);
7685 return *umap
? isl_stat_ok
: isl_stat_error
;
7688 /* Construct a union map mapping the domain of the union
7689 * piecewise affine expression to its range, with the single output dimension
7690 * equated to the corresponding affine expressions on their cells.
7692 __isl_give isl_union_map
*isl_union_map_from_union_pw_aff(
7693 __isl_take isl_union_pw_aff
*upa
)
7696 isl_union_map
*umap
;
7701 space
= isl_union_pw_aff_get_space(upa
);
7702 umap
= isl_union_map_empty(space
);
7704 if (isl_union_pw_aff_foreach_pw_aff(upa
, &map_from_pw_aff_entry
,
7706 umap
= isl_union_map_free(umap
);
7708 isl_union_pw_aff_free(upa
);
7712 /* Internal data structure for isl_union_pw_aff_pullback_union_pw_multi_aff.
7713 * upma is the function that is plugged in.
7714 * pa is the current part of the function in which upma is plugged in.
7715 * res collects the results.
7717 struct isl_union_pw_aff_pullback_upma_data
{
7718 isl_union_pw_multi_aff
*upma
;
7720 isl_union_pw_aff
*res
;
7723 /* Check if "pma" can be plugged into data->pa.
7724 * If so, perform the pullback and add the result to data->res.
7726 static isl_stat
pa_pb_pma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7728 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7731 if (!isl_space_tuple_is_equal(data
->pa
->dim
, isl_dim_in
,
7732 pma
->dim
, isl_dim_out
)) {
7733 isl_pw_multi_aff_free(pma
);
7737 pa
= isl_pw_aff_copy(data
->pa
);
7738 pa
= isl_pw_aff_pullback_pw_multi_aff(pa
, pma
);
7740 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7742 return data
->res
? isl_stat_ok
: isl_stat_error
;
7745 /* Check if any of the elements of data->upma can be plugged into pa,
7746 * add if so add the result to data->res.
7748 static isl_stat
upa_pb_upma(__isl_take isl_pw_aff
*pa
, void *user
)
7750 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7754 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma
,
7756 isl_pw_aff_free(pa
);
7761 /* Compute the pullback of "upa" by the function represented by "upma".
7762 * In other words, plug in "upma" in "upa". The result contains
7763 * expressions defined over the domain space of "upma".
7765 * Run over all pairs of elements in "upa" and "upma", perform
7766 * the pullback when appropriate and collect the results.
7767 * If the hash value were based on the domain space rather than
7768 * the function space, then we could run through all elements
7769 * of "upma" and directly pick out the corresponding element of "upa".
7771 __isl_give isl_union_pw_aff
*isl_union_pw_aff_pullback_union_pw_multi_aff(
7772 __isl_take isl_union_pw_aff
*upa
,
7773 __isl_take isl_union_pw_multi_aff
*upma
)
7775 struct isl_union_pw_aff_pullback_upma_data data
= { NULL
, NULL
};
7778 space
= isl_union_pw_multi_aff_get_space(upma
);
7779 upa
= isl_union_pw_aff_align_params(upa
, space
);
7780 space
= isl_union_pw_aff_get_space(upa
);
7781 upma
= isl_union_pw_multi_aff_align_params(upma
, space
);
7787 data
.res
= isl_union_pw_aff_alloc_same_size(upa
);
7788 if (isl_union_pw_aff_foreach_pw_aff(upa
, &upa_pb_upma
, &data
) < 0)
7789 data
.res
= isl_union_pw_aff_free(data
.res
);
7791 isl_union_pw_aff_free(upa
);
7792 isl_union_pw_multi_aff_free(upma
);
7795 isl_union_pw_aff_free(upa
);
7796 isl_union_pw_multi_aff_free(upma
);
7801 #define BASE union_pw_aff
7803 #define DOMBASE union_set
7805 #define NO_MOVE_DIMS
7814 #include <isl_multi_templ.c>
7815 #include <isl_multi_apply_set.c>
7816 #include <isl_multi_apply_union_set.c>
7817 #include <isl_multi_coalesce.c>
7818 #include <isl_multi_floor.c>
7819 #include <isl_multi_gist.c>
7820 #include <isl_multi_intersect.c>
7822 /* Construct a multiple union piecewise affine expression
7823 * in the given space with value zero in each of the output dimensions.
7825 * Since there is no canonical zero value for
7826 * a union piecewise affine expression, we can only construct
7827 * zero-dimensional "zero" value.
7829 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_zero(
7830 __isl_take isl_space
*space
)
7835 if (!isl_space_is_set(space
))
7836 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7837 "expecting set space", goto error
);
7838 if (isl_space_dim(space
, isl_dim_out
) != 0)
7839 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7840 "expecting 0D space", goto error
);
7842 return isl_multi_union_pw_aff_alloc(space
);
7844 isl_space_free(space
);
7848 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
7849 * with the actual sum on the shared domain and
7850 * the defined expression on the symmetric difference of the domains.
7852 * We simply iterate over the elements in both arguments and
7853 * call isl_union_pw_aff_union_add on each of them.
7855 static __isl_give isl_multi_union_pw_aff
*
7856 isl_multi_union_pw_aff_union_add_aligned(
7857 __isl_take isl_multi_union_pw_aff
*mupa1
,
7858 __isl_take isl_multi_union_pw_aff
*mupa2
)
7860 return isl_multi_union_pw_aff_bin_op(mupa1
, mupa2
,
7861 &isl_union_pw_aff_union_add
);
7864 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
7865 * with the actual sum on the shared domain and
7866 * the defined expression on the symmetric difference of the domains.
7868 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_union_add(
7869 __isl_take isl_multi_union_pw_aff
*mupa1
,
7870 __isl_take isl_multi_union_pw_aff
*mupa2
)
7872 return isl_multi_union_pw_aff_align_params_multi_multi_and(mupa1
, mupa2
,
7873 &isl_multi_union_pw_aff_union_add_aligned
);
7876 /* Construct and return a multi union piecewise affine expression
7877 * that is equal to the given multi affine expression.
7879 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_aff(
7880 __isl_take isl_multi_aff
*ma
)
7882 isl_multi_pw_aff
*mpa
;
7884 mpa
= isl_multi_pw_aff_from_multi_aff(ma
);
7885 return isl_multi_union_pw_aff_from_multi_pw_aff(mpa
);
7888 /* Construct and return a multi union piecewise affine expression
7889 * that is equal to the given multi piecewise affine expression.
7891 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_pw_aff(
7892 __isl_take isl_multi_pw_aff
*mpa
)
7896 isl_multi_union_pw_aff
*mupa
;
7901 space
= isl_multi_pw_aff_get_space(mpa
);
7902 space
= isl_space_range(space
);
7903 mupa
= isl_multi_union_pw_aff_alloc(space
);
7905 n
= isl_multi_pw_aff_dim(mpa
, isl_dim_out
);
7906 for (i
= 0; i
< n
; ++i
) {
7908 isl_union_pw_aff
*upa
;
7910 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
7911 upa
= isl_union_pw_aff_from_pw_aff(pa
);
7912 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7915 isl_multi_pw_aff_free(mpa
);
7920 /* Extract the range space of "pma" and assign it to *space.
7921 * If *space has already been set (through a previous call to this function),
7922 * then check that the range space is the same.
7924 static isl_stat
extract_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7926 isl_space
**space
= user
;
7927 isl_space
*pma_space
;
7930 pma_space
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
7931 isl_pw_multi_aff_free(pma
);
7934 return isl_stat_error
;
7940 equal
= isl_space_is_equal(pma_space
, *space
);
7941 isl_space_free(pma_space
);
7944 return isl_stat_error
;
7946 isl_die(isl_space_get_ctx(*space
), isl_error_invalid
,
7947 "range spaces not the same", return isl_stat_error
);
7951 /* Construct and return a multi union piecewise affine expression
7952 * that is equal to the given union piecewise multi affine expression.
7954 * In order to be able to perform the conversion, the input
7955 * needs to be non-empty and may only involve a single range space.
7957 __isl_give isl_multi_union_pw_aff
*
7958 isl_multi_union_pw_aff_from_union_pw_multi_aff(
7959 __isl_take isl_union_pw_multi_aff
*upma
)
7961 isl_space
*space
= NULL
;
7962 isl_multi_union_pw_aff
*mupa
;
7967 if (isl_union_pw_multi_aff_n_pw_multi_aff(upma
) == 0)
7968 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7969 "cannot extract range space from empty input",
7971 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
, &extract_space
,
7978 n
= isl_space_dim(space
, isl_dim_set
);
7979 mupa
= isl_multi_union_pw_aff_alloc(space
);
7981 for (i
= 0; i
< n
; ++i
) {
7982 isl_union_pw_aff
*upa
;
7984 upa
= isl_union_pw_multi_aff_get_union_pw_aff(upma
, i
);
7985 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7988 isl_union_pw_multi_aff_free(upma
);
7991 isl_space_free(space
);
7992 isl_union_pw_multi_aff_free(upma
);
7996 /* Try and create an isl_multi_union_pw_aff that is equivalent
7997 * to the given isl_union_map.
7998 * The isl_union_map is required to be single-valued in each space.
7999 * Moreover, it cannot be empty and all range spaces need to be the same.
8000 * Otherwise, an error is produced.
8002 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_union_map(
8003 __isl_take isl_union_map
*umap
)
8005 isl_union_pw_multi_aff
*upma
;
8007 upma
= isl_union_pw_multi_aff_from_union_map(umap
);
8008 return isl_multi_union_pw_aff_from_union_pw_multi_aff(upma
);
8011 /* Return a multiple union piecewise affine expression
8012 * that is equal to "mv" on "domain", assuming "domain" and "mv"
8013 * have been aligned.
8015 static __isl_give isl_multi_union_pw_aff
*
8016 isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8017 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8021 isl_multi_union_pw_aff
*mupa
;
8026 n
= isl_multi_val_dim(mv
, isl_dim_set
);
8027 space
= isl_multi_val_get_space(mv
);
8028 mupa
= isl_multi_union_pw_aff_alloc(space
);
8029 for (i
= 0; i
< n
; ++i
) {
8031 isl_union_pw_aff
*upa
;
8033 v
= isl_multi_val_get_val(mv
, i
);
8034 upa
= isl_union_pw_aff_val_on_domain(isl_union_set_copy(domain
),
8036 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8039 isl_union_set_free(domain
);
8040 isl_multi_val_free(mv
);
8043 isl_union_set_free(domain
);
8044 isl_multi_val_free(mv
);
8048 /* Return a multiple union piecewise affine expression
8049 * that is equal to "mv" on "domain".
8051 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_val_on_domain(
8052 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8056 if (isl_space_match(domain
->dim
, isl_dim_param
,
8057 mv
->space
, isl_dim_param
))
8058 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8060 domain
= isl_union_set_align_params(domain
,
8061 isl_multi_val_get_space(mv
));
8062 mv
= isl_multi_val_align_params(mv
, isl_union_set_get_space(domain
));
8063 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(domain
, mv
);
8065 isl_union_set_free(domain
);
8066 isl_multi_val_free(mv
);
8070 /* Return a multiple union piecewise affine expression
8071 * that is equal to "ma" on "domain", assuming "domain" and "ma"
8072 * have been aligned.
8074 static __isl_give isl_multi_union_pw_aff
*
8075 isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
8076 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8080 isl_multi_union_pw_aff
*mupa
;
8085 n
= isl_multi_aff_dim(ma
, isl_dim_set
);
8086 space
= isl_multi_aff_get_space(ma
);
8087 mupa
= isl_multi_union_pw_aff_alloc(space
);
8088 for (i
= 0; i
< n
; ++i
) {
8090 isl_union_pw_aff
*upa
;
8092 aff
= isl_multi_aff_get_aff(ma
, i
);
8093 upa
= isl_union_pw_aff_aff_on_domain(isl_union_set_copy(domain
),
8095 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8098 isl_union_set_free(domain
);
8099 isl_multi_aff_free(ma
);
8102 isl_union_set_free(domain
);
8103 isl_multi_aff_free(ma
);
8107 /* Return a multiple union piecewise affine expression
8108 * that is equal to "ma" on "domain".
8110 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_aff_on_domain(
8111 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8115 if (isl_space_match(domain
->dim
, isl_dim_param
,
8116 ma
->space
, isl_dim_param
))
8117 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
8119 domain
= isl_union_set_align_params(domain
,
8120 isl_multi_aff_get_space(ma
));
8121 ma
= isl_multi_aff_align_params(ma
, isl_union_set_get_space(domain
));
8122 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(domain
, ma
);
8124 isl_union_set_free(domain
);
8125 isl_multi_aff_free(ma
);
8129 /* Return a union set containing those elements in the domains
8130 * of the elements of "mupa" where they are all zero.
8132 __isl_give isl_union_set
*isl_multi_union_pw_aff_zero_union_set(
8133 __isl_take isl_multi_union_pw_aff
*mupa
)
8136 isl_union_pw_aff
*upa
;
8137 isl_union_set
*zero
;
8142 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8144 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8145 "cannot determine zero set "
8146 "of zero-dimensional function", goto error
);
8148 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8149 zero
= isl_union_pw_aff_zero_union_set(upa
);
8151 for (i
= 1; i
< n
; ++i
) {
8152 isl_union_set
*zero_i
;
8154 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8155 zero_i
= isl_union_pw_aff_zero_union_set(upa
);
8157 zero
= isl_union_set_intersect(zero
, zero_i
);
8160 isl_multi_union_pw_aff_free(mupa
);
8163 isl_multi_union_pw_aff_free(mupa
);
8167 /* Construct a union map mapping the shared domain
8168 * of the union piecewise affine expressions to the range of "mupa"
8169 * with each dimension in the range equated to the
8170 * corresponding union piecewise affine expression.
8172 * The input cannot be zero-dimensional as there is
8173 * no way to extract a domain from a zero-dimensional isl_multi_union_pw_aff.
8175 __isl_give isl_union_map
*isl_union_map_from_multi_union_pw_aff(
8176 __isl_take isl_multi_union_pw_aff
*mupa
)
8180 isl_union_map
*umap
;
8181 isl_union_pw_aff
*upa
;
8186 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8188 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8189 "cannot determine domain of zero-dimensional "
8190 "isl_multi_union_pw_aff", goto error
);
8192 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8193 umap
= isl_union_map_from_union_pw_aff(upa
);
8195 for (i
= 1; i
< n
; ++i
) {
8196 isl_union_map
*umap_i
;
8198 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8199 umap_i
= isl_union_map_from_union_pw_aff(upa
);
8200 umap
= isl_union_map_flat_range_product(umap
, umap_i
);
8203 space
= isl_multi_union_pw_aff_get_space(mupa
);
8204 umap
= isl_union_map_reset_range_space(umap
, space
);
8206 isl_multi_union_pw_aff_free(mupa
);
8209 isl_multi_union_pw_aff_free(mupa
);
8213 /* Internal data structure for isl_union_pw_multi_aff_reset_range_space.
8214 * "range" is the space from which to set the range space.
8215 * "res" collects the results.
8217 struct isl_union_pw_multi_aff_reset_range_space_data
{
8219 isl_union_pw_multi_aff
*res
;
8222 /* Replace the range space of "pma" by the range space of data->range and
8223 * add the result to data->res.
8225 static isl_stat
reset_range_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8227 struct isl_union_pw_multi_aff_reset_range_space_data
*data
= user
;
8230 space
= isl_pw_multi_aff_get_space(pma
);
8231 space
= isl_space_domain(space
);
8232 space
= isl_space_extend_domain_with_range(space
,
8233 isl_space_copy(data
->range
));
8234 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
8235 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
8237 return data
->res
? isl_stat_ok
: isl_stat_error
;
8240 /* Replace the range space of all the piecewise affine expressions in "upma" by
8241 * the range space of "space".
8243 * This assumes that all these expressions have the same output dimension.
8245 * Since the spaces of the expressions change, so do their hash values.
8246 * We therefore need to create a new isl_union_pw_multi_aff.
8247 * Note that the hash value is currently computed based on the entire
8248 * space even though there can only be a single expression with a given
8251 static __isl_give isl_union_pw_multi_aff
*
8252 isl_union_pw_multi_aff_reset_range_space(
8253 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_space
*space
)
8255 struct isl_union_pw_multi_aff_reset_range_space_data data
= { space
};
8256 isl_space
*space_upma
;
8258 space_upma
= isl_union_pw_multi_aff_get_space(upma
);
8259 data
.res
= isl_union_pw_multi_aff_empty(space_upma
);
8260 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
8261 &reset_range_space
, &data
) < 0)
8262 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
8264 isl_space_free(space
);
8265 isl_union_pw_multi_aff_free(upma
);
8269 /* Construct and return a union piecewise multi affine expression
8270 * that is equal to the given multi union piecewise affine expression.
8272 * In order to be able to perform the conversion, the input
8273 * needs to have a least one output dimension.
8275 __isl_give isl_union_pw_multi_aff
*
8276 isl_union_pw_multi_aff_from_multi_union_pw_aff(
8277 __isl_take isl_multi_union_pw_aff
*mupa
)
8281 isl_union_pw_multi_aff
*upma
;
8282 isl_union_pw_aff
*upa
;
8287 space
= isl_multi_union_pw_aff_get_space(mupa
);
8289 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8291 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8292 "cannot determine domain of zero-dimensional "
8293 "isl_multi_union_pw_aff", goto error
);
8295 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8296 upma
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8298 for (i
= 1; i
< n
; ++i
) {
8299 isl_union_pw_multi_aff
*upma_i
;
8301 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8302 upma_i
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8303 upma
= isl_union_pw_multi_aff_flat_range_product(upma
, upma_i
);
8306 upma
= isl_union_pw_multi_aff_reset_range_space(upma
, space
);
8308 isl_multi_union_pw_aff_free(mupa
);
8311 isl_multi_union_pw_aff_free(mupa
);
8315 /* Intersect the range of "mupa" with "range".
8316 * That is, keep only those domain elements that have a function value
8319 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_intersect_range(
8320 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_set
*range
)
8322 isl_union_pw_multi_aff
*upma
;
8323 isl_union_set
*domain
;
8328 if (!mupa
|| !range
)
8331 space
= isl_set_get_space(range
);
8332 match
= isl_space_tuple_is_equal(mupa
->space
, isl_dim_set
,
8333 space
, isl_dim_set
);
8334 isl_space_free(space
);
8338 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8339 "space don't match", goto error
);
8340 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8342 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8343 "cannot intersect range of zero-dimensional "
8344 "isl_multi_union_pw_aff", goto error
);
8346 upma
= isl_union_pw_multi_aff_from_multi_union_pw_aff(
8347 isl_multi_union_pw_aff_copy(mupa
));
8348 domain
= isl_union_set_from_set(range
);
8349 domain
= isl_union_set_preimage_union_pw_multi_aff(domain
, upma
);
8350 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, domain
);
8354 isl_multi_union_pw_aff_free(mupa
);
8355 isl_set_free(range
);
8359 /* Return the shared domain of the elements of "mupa".
8361 __isl_give isl_union_set
*isl_multi_union_pw_aff_domain(
8362 __isl_take isl_multi_union_pw_aff
*mupa
)
8365 isl_union_pw_aff
*upa
;
8371 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8373 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8374 "cannot determine domain", goto error
);
8376 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8377 dom
= isl_union_pw_aff_domain(upa
);
8378 for (i
= 1; i
< n
; ++i
) {
8379 isl_union_set
*dom_i
;
8381 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8382 dom_i
= isl_union_pw_aff_domain(upa
);
8383 dom
= isl_union_set_intersect(dom
, dom_i
);
8386 isl_multi_union_pw_aff_free(mupa
);
8389 isl_multi_union_pw_aff_free(mupa
);
8393 /* Apply "aff" to "mupa". The space of "mupa" is equal to the domain of "aff".
8394 * In particular, the spaces have been aligned.
8395 * The result is defined over the shared domain of the elements of "mupa"
8397 * We first extract the parametric constant part of "aff" and
8398 * define that over the shared domain.
8399 * Then we iterate over all input dimensions of "aff" and add the corresponding
8400 * multiples of the elements of "mupa".
8401 * Finally, we consider the integer divisions, calling the function
8402 * recursively to obtain an isl_union_pw_aff corresponding to the
8403 * integer division argument.
8405 static __isl_give isl_union_pw_aff
*multi_union_pw_aff_apply_aff(
8406 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8409 isl_union_pw_aff
*upa
;
8410 isl_union_set
*uset
;
8414 n_in
= isl_aff_dim(aff
, isl_dim_in
);
8415 n_div
= isl_aff_dim(aff
, isl_dim_div
);
8417 uset
= isl_multi_union_pw_aff_domain(isl_multi_union_pw_aff_copy(mupa
));
8418 cst
= isl_aff_copy(aff
);
8419 cst
= isl_aff_drop_dims(cst
, isl_dim_div
, 0, n_div
);
8420 cst
= isl_aff_drop_dims(cst
, isl_dim_in
, 0, n_in
);
8421 cst
= isl_aff_project_domain_on_params(cst
);
8422 upa
= isl_union_pw_aff_aff_on_domain(uset
, cst
);
8424 for (i
= 0; i
< n_in
; ++i
) {
8425 isl_union_pw_aff
*upa_i
;
8427 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
8429 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
8430 upa_i
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8431 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8432 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8435 for (i
= 0; i
< n_div
; ++i
) {
8437 isl_union_pw_aff
*upa_i
;
8439 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
8441 div
= isl_aff_get_div(aff
, i
);
8442 upa_i
= multi_union_pw_aff_apply_aff(
8443 isl_multi_union_pw_aff_copy(mupa
), div
);
8444 upa_i
= isl_union_pw_aff_floor(upa_i
);
8445 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
8446 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8447 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8450 isl_multi_union_pw_aff_free(mupa
);
8456 /* Apply "aff" to "mupa". The space of "mupa" needs to be compatible
8457 * with the domain of "aff".
8458 * Furthermore, the dimension of this space needs to be greater than zero.
8459 * The result is defined over the shared domain of the elements of "mupa"
8461 * We perform these checks and then hand over control to
8462 * multi_union_pw_aff_apply_aff.
8464 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_aff(
8465 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8467 isl_space
*space1
, *space2
;
8470 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8471 isl_aff_get_space(aff
));
8472 aff
= isl_aff_align_params(aff
, isl_multi_union_pw_aff_get_space(mupa
));
8476 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8477 space2
= isl_aff_get_domain_space(aff
);
8478 equal
= isl_space_is_equal(space1
, space2
);
8479 isl_space_free(space1
);
8480 isl_space_free(space2
);
8484 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8485 "spaces don't match", goto error
);
8486 if (isl_aff_dim(aff
, isl_dim_in
) == 0)
8487 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8488 "cannot determine domains", goto error
);
8490 return multi_union_pw_aff_apply_aff(mupa
, aff
);
8492 isl_multi_union_pw_aff_free(mupa
);
8497 /* Apply "ma" to "mupa". The space of "mupa" needs to be compatible
8498 * with the domain of "ma".
8499 * Furthermore, the dimension of this space needs to be greater than zero,
8500 * unless the dimension of the target space of "ma" is also zero.
8501 * The result is defined over the shared domain of the elements of "mupa"
8503 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_multi_aff(
8504 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_multi_aff
*ma
)
8506 isl_space
*space1
, *space2
;
8507 isl_multi_union_pw_aff
*res
;
8511 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8512 isl_multi_aff_get_space(ma
));
8513 ma
= isl_multi_aff_align_params(ma
,
8514 isl_multi_union_pw_aff_get_space(mupa
));
8518 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8519 space2
= isl_multi_aff_get_domain_space(ma
);
8520 equal
= isl_space_is_equal(space1
, space2
);
8521 isl_space_free(space1
);
8522 isl_space_free(space2
);
8526 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8527 "spaces don't match", goto error
);
8528 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
8529 if (isl_multi_aff_dim(ma
, isl_dim_in
) == 0 && n_out
!= 0)
8530 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8531 "cannot determine domains", goto error
);
8533 space1
= isl_space_range(isl_multi_aff_get_space(ma
));
8534 res
= isl_multi_union_pw_aff_alloc(space1
);
8536 for (i
= 0; i
< n_out
; ++i
) {
8538 isl_union_pw_aff
*upa
;
8540 aff
= isl_multi_aff_get_aff(ma
, i
);
8541 upa
= multi_union_pw_aff_apply_aff(
8542 isl_multi_union_pw_aff_copy(mupa
), aff
);
8543 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8546 isl_multi_aff_free(ma
);
8547 isl_multi_union_pw_aff_free(mupa
);
8550 isl_multi_union_pw_aff_free(mupa
);
8551 isl_multi_aff_free(ma
);
8555 /* Apply "pa" to "mupa". The space of "mupa" needs to be compatible
8556 * with the domain of "pa".
8557 * Furthermore, the dimension of this space needs to be greater than zero.
8558 * The result is defined over the shared domain of the elements of "mupa"
8560 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_aff(
8561 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_pw_aff
*pa
)
8565 isl_space
*space
, *space2
;
8566 isl_union_pw_aff
*upa
;
8568 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8569 isl_pw_aff_get_space(pa
));
8570 pa
= isl_pw_aff_align_params(pa
,
8571 isl_multi_union_pw_aff_get_space(mupa
));
8575 space
= isl_multi_union_pw_aff_get_space(mupa
);
8576 space2
= isl_pw_aff_get_domain_space(pa
);
8577 equal
= isl_space_is_equal(space
, space2
);
8578 isl_space_free(space
);
8579 isl_space_free(space2
);
8583 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8584 "spaces don't match", goto error
);
8585 if (isl_pw_aff_dim(pa
, isl_dim_in
) == 0)
8586 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8587 "cannot determine domains", goto error
);
8589 space
= isl_space_params(isl_multi_union_pw_aff_get_space(mupa
));
8590 upa
= isl_union_pw_aff_empty(space
);
8592 for (i
= 0; i
< pa
->n
; ++i
) {
8595 isl_multi_union_pw_aff
*mupa_i
;
8596 isl_union_pw_aff
*upa_i
;
8598 mupa_i
= isl_multi_union_pw_aff_copy(mupa
);
8599 domain
= isl_set_copy(pa
->p
[i
].set
);
8600 mupa_i
= isl_multi_union_pw_aff_intersect_range(mupa_i
, domain
);
8601 aff
= isl_aff_copy(pa
->p
[i
].aff
);
8602 upa_i
= multi_union_pw_aff_apply_aff(mupa_i
, aff
);
8603 upa
= isl_union_pw_aff_union_add(upa
, upa_i
);
8606 isl_multi_union_pw_aff_free(mupa
);
8607 isl_pw_aff_free(pa
);
8610 isl_multi_union_pw_aff_free(mupa
);
8611 isl_pw_aff_free(pa
);
8615 /* Apply "pma" to "mupa". The space of "mupa" needs to be compatible
8616 * with the domain of "pma".
8617 * Furthermore, the dimension of this space needs to be greater than zero,
8618 * unless the dimension of the target space of "pma" is also zero.
8619 * The result is defined over the shared domain of the elements of "mupa"
8621 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_multi_aff(
8622 __isl_take isl_multi_union_pw_aff
*mupa
,
8623 __isl_take isl_pw_multi_aff
*pma
)
8625 isl_space
*space1
, *space2
;
8626 isl_multi_union_pw_aff
*res
;
8630 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8631 isl_pw_multi_aff_get_space(pma
));
8632 pma
= isl_pw_multi_aff_align_params(pma
,
8633 isl_multi_union_pw_aff_get_space(mupa
));
8637 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8638 space2
= isl_pw_multi_aff_get_domain_space(pma
);
8639 equal
= isl_space_is_equal(space1
, space2
);
8640 isl_space_free(space1
);
8641 isl_space_free(space2
);
8645 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8646 "spaces don't match", goto error
);
8647 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
8648 if (isl_pw_multi_aff_dim(pma
, isl_dim_in
) == 0 && n_out
!= 0)
8649 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8650 "cannot determine domains", goto error
);
8652 space1
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
8653 res
= isl_multi_union_pw_aff_alloc(space1
);
8655 for (i
= 0; i
< n_out
; ++i
) {
8657 isl_union_pw_aff
*upa
;
8659 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
8660 upa
= isl_multi_union_pw_aff_apply_pw_aff(
8661 isl_multi_union_pw_aff_copy(mupa
), pa
);
8662 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8665 isl_pw_multi_aff_free(pma
);
8666 isl_multi_union_pw_aff_free(mupa
);
8669 isl_multi_union_pw_aff_free(mupa
);
8670 isl_pw_multi_aff_free(pma
);
8674 /* Compute the pullback of "mupa" by the function represented by "upma".
8675 * In other words, plug in "upma" in "mupa". The result contains
8676 * expressions defined over the domain space of "upma".
8678 * Run over all elements of "mupa" and plug in "upma" in each of them.
8680 __isl_give isl_multi_union_pw_aff
*
8681 isl_multi_union_pw_aff_pullback_union_pw_multi_aff(
8682 __isl_take isl_multi_union_pw_aff
*mupa
,
8683 __isl_take isl_union_pw_multi_aff
*upma
)
8687 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8688 isl_union_pw_multi_aff_get_space(upma
));
8689 upma
= isl_union_pw_multi_aff_align_params(upma
,
8690 isl_multi_union_pw_aff_get_space(mupa
));
8694 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8695 for (i
= 0; i
< n
; ++i
) {
8696 isl_union_pw_aff
*upa
;
8698 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8699 upa
= isl_union_pw_aff_pullback_union_pw_multi_aff(upa
,
8700 isl_union_pw_multi_aff_copy(upma
));
8701 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8704 isl_union_pw_multi_aff_free(upma
);
8707 isl_multi_union_pw_aff_free(mupa
);
8708 isl_union_pw_multi_aff_free(upma
);
8712 /* Extract the sequence of elements in "mupa" with domain space "space"
8713 * (ignoring parameters).
8715 * For the elements of "mupa" that are not defined on the specified space,
8716 * the corresponding element in the result is empty.
8718 __isl_give isl_multi_pw_aff
*isl_multi_union_pw_aff_extract_multi_pw_aff(
8719 __isl_keep isl_multi_union_pw_aff
*mupa
, __isl_take isl_space
*space
)
8722 isl_space
*space_mpa
= NULL
;
8723 isl_multi_pw_aff
*mpa
;
8725 if (!mupa
|| !space
)
8728 space_mpa
= isl_multi_union_pw_aff_get_space(mupa
);
8729 if (!isl_space_match(space_mpa
, isl_dim_param
, space
, isl_dim_param
)) {
8730 space
= isl_space_drop_dims(space
, isl_dim_param
,
8731 0, isl_space_dim(space
, isl_dim_param
));
8732 space
= isl_space_align_params(space
,
8733 isl_space_copy(space_mpa
));
8737 space_mpa
= isl_space_map_from_domain_and_range(isl_space_copy(space
),
8739 mpa
= isl_multi_pw_aff_alloc(space_mpa
);
8741 space
= isl_space_from_domain(space
);
8742 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
8743 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8744 for (i
= 0; i
< n
; ++i
) {
8745 isl_union_pw_aff
*upa
;
8748 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8749 pa
= isl_union_pw_aff_extract_pw_aff(upa
,
8750 isl_space_copy(space
));
8751 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
8752 isl_union_pw_aff_free(upa
);
8755 isl_space_free(space
);
8758 isl_space_free(space_mpa
);
8759 isl_space_free(space
);