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_templ.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_templ.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 /* Given a basic map with a single output dimension that is defined
4384 * in terms of the parameters and input dimensions using an equality,
4385 * extract an isl_aff that expresses the output dimension in terms
4386 * of the parameters and input dimensions.
4387 * Note that this expression may involve integer divisions defined
4388 * in terms of parameters and input dimensions.
4390 * This function shares some similarities with
4391 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
4393 static __isl_give isl_aff
*extract_isl_aff_from_basic_map(
4394 __isl_take isl_basic_map
*bmap
)
4399 isl_local_space
*ls
;
4404 if (isl_basic_map_dim(bmap
, isl_dim_out
) != 1)
4405 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4406 "basic map should have a single output dimension",
4408 eq
= isl_basic_map_output_defining_equality(bmap
, 0);
4409 if (eq
>= bmap
->n_eq
)
4410 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4411 "unable to find suitable equality", goto error
);
4412 ls
= isl_basic_map_get_local_space(bmap
);
4413 aff
= isl_aff_alloc(isl_local_space_domain(ls
));
4416 offset
= isl_basic_map_offset(bmap
, isl_dim_out
);
4417 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4418 if (isl_int_is_neg(bmap
->eq
[eq
][offset
])) {
4419 isl_seq_cpy(aff
->v
->el
+ 1, bmap
->eq
[eq
], offset
);
4420 isl_seq_cpy(aff
->v
->el
+ 1 + offset
, bmap
->eq
[eq
] + offset
+ 1,
4423 isl_seq_neg(aff
->v
->el
+ 1, bmap
->eq
[eq
], offset
);
4424 isl_seq_neg(aff
->v
->el
+ 1 + offset
, bmap
->eq
[eq
] + offset
+ 1,
4427 isl_int_abs(aff
->v
->el
[0], bmap
->eq
[eq
][offset
]);
4428 isl_basic_map_free(bmap
);
4430 aff
= isl_aff_remove_unused_divs(aff
);
4433 isl_basic_map_free(bmap
);
4437 /* Given a basic map where each output dimension is defined
4438 * in terms of the parameters and input dimensions using an equality,
4439 * extract an isl_multi_aff that expresses the output dimensions in terms
4440 * of the parameters and input dimensions.
4442 static __isl_give isl_multi_aff
*extract_isl_multi_aff_from_basic_map(
4443 __isl_take isl_basic_map
*bmap
)
4452 ma
= isl_multi_aff_alloc(isl_basic_map_get_space(bmap
));
4453 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4455 for (i
= 0; i
< n_out
; ++i
) {
4456 isl_basic_map
*bmap_i
;
4459 bmap_i
= isl_basic_map_copy(bmap
);
4460 bmap_i
= isl_basic_map_project_out(bmap_i
, isl_dim_out
,
4461 i
+ 1, n_out
- (1 + i
));
4462 bmap_i
= isl_basic_map_project_out(bmap_i
, isl_dim_out
, 0, i
);
4463 aff
= extract_isl_aff_from_basic_map(bmap_i
);
4464 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4467 isl_basic_map_free(bmap
);
4472 /* Given a basic set where each set dimension is defined
4473 * in terms of the parameters using an equality,
4474 * extract an isl_multi_aff that expresses the set dimensions in terms
4475 * of the parameters.
4477 __isl_give isl_multi_aff
*isl_multi_aff_from_basic_set_equalities(
4478 __isl_take isl_basic_set
*bset
)
4480 return extract_isl_multi_aff_from_basic_map(bset
);
4483 /* Create an isl_pw_multi_aff that is equivalent to
4484 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
4485 * The given basic map is such that each output dimension is defined
4486 * in terms of the parameters and input dimensions using an equality.
4488 * Since some applications expect the result of isl_pw_multi_aff_from_map
4489 * to only contain integer affine expressions, we compute the floor
4490 * of the expression before returning.
4492 static __isl_give isl_pw_multi_aff
*plain_pw_multi_aff_from_map(
4493 __isl_take isl_set
*domain
, __isl_take isl_basic_map
*bmap
)
4497 ma
= extract_isl_multi_aff_from_basic_map(bmap
);
4498 ma
= isl_multi_aff_floor(ma
);
4499 return isl_pw_multi_aff_alloc(domain
, ma
);
4502 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4503 * This obviously only works if the input "map" is single-valued.
4504 * If so, we compute the lexicographic minimum of the image in the form
4505 * of an isl_pw_multi_aff. Since the image is unique, it is equal
4506 * to its lexicographic minimum.
4507 * If the input is not single-valued, we produce an error.
4509 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_base(
4510 __isl_take isl_map
*map
)
4514 isl_pw_multi_aff
*pma
;
4516 sv
= isl_map_is_single_valued(map
);
4520 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
4521 "map is not single-valued", goto error
);
4522 map
= isl_map_make_disjoint(map
);
4526 pma
= isl_pw_multi_aff_empty(isl_map_get_space(map
));
4528 for (i
= 0; i
< map
->n
; ++i
) {
4529 isl_pw_multi_aff
*pma_i
;
4530 isl_basic_map
*bmap
;
4531 bmap
= isl_basic_map_copy(map
->p
[i
]);
4532 pma_i
= isl_basic_map_lexmin_pw_multi_aff(bmap
);
4533 pma
= isl_pw_multi_aff_add_disjoint(pma
, pma_i
);
4543 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4544 * taking into account that the output dimension at position "d"
4545 * can be represented as
4547 * x = floor((e(...) + c1) / m)
4549 * given that constraint "i" is of the form
4551 * e(...) + c1 - m x >= 0
4554 * Let "map" be of the form
4558 * We construct a mapping
4560 * A -> [A -> x = floor(...)]
4562 * apply that to the map, obtaining
4564 * [A -> x = floor(...)] -> B
4566 * and equate dimension "d" to x.
4567 * We then compute a isl_pw_multi_aff representation of the resulting map
4568 * and plug in the mapping above.
4570 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_div(
4571 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
)
4575 isl_local_space
*ls
;
4583 isl_pw_multi_aff
*pma
;
4586 is_set
= isl_map_is_set(map
);
4588 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4589 ctx
= isl_map_get_ctx(map
);
4590 space
= isl_space_domain(isl_map_get_space(map
));
4591 n_in
= isl_space_dim(space
, isl_dim_set
);
4592 n
= isl_space_dim(space
, isl_dim_all
);
4594 v
= isl_vec_alloc(ctx
, 1 + 1 + n
);
4596 isl_int_neg(v
->el
[0], hull
->ineq
[i
][offset
+ d
]);
4597 isl_seq_cpy(v
->el
+ 1, hull
->ineq
[i
], 1 + n
);
4599 isl_basic_map_free(hull
);
4601 ls
= isl_local_space_from_space(isl_space_copy(space
));
4602 aff
= isl_aff_alloc_vec(ls
, v
);
4603 aff
= isl_aff_floor(aff
);
4605 isl_space_free(space
);
4606 ma
= isl_multi_aff_from_aff(aff
);
4608 ma
= isl_multi_aff_identity(isl_space_map_from_set(space
));
4609 ma
= isl_multi_aff_range_product(ma
,
4610 isl_multi_aff_from_aff(aff
));
4613 insert
= isl_map_from_multi_aff(isl_multi_aff_copy(ma
));
4614 map
= isl_map_apply_domain(map
, insert
);
4615 map
= isl_map_equate(map
, isl_dim_in
, n_in
, isl_dim_out
, d
);
4616 pma
= isl_pw_multi_aff_from_map(map
);
4617 pma
= isl_pw_multi_aff_pullback_multi_aff(pma
, ma
);
4622 /* Is constraint "c" of the form
4624 * e(...) + c1 - m x >= 0
4628 * -e(...) + c2 + m x >= 0
4630 * where m > 1 and e only depends on parameters and input dimemnsions?
4632 * "offset" is the offset of the output dimensions
4633 * "pos" is the position of output dimension x.
4635 static int is_potential_div_constraint(isl_int
*c
, int offset
, int d
, int total
)
4637 if (isl_int_is_zero(c
[offset
+ d
]))
4639 if (isl_int_is_one(c
[offset
+ d
]))
4641 if (isl_int_is_negone(c
[offset
+ d
]))
4643 if (isl_seq_first_non_zero(c
+ offset
, d
) != -1)
4645 if (isl_seq_first_non_zero(c
+ offset
+ d
+ 1,
4646 total
- (offset
+ d
+ 1)) != -1)
4651 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4653 * As a special case, we first check if there is any pair of constraints,
4654 * shared by all the basic maps in "map" that force a given dimension
4655 * to be equal to the floor of some affine combination of the input dimensions.
4657 * In particular, if we can find two constraints
4659 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
4663 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
4665 * where m > 1 and e only depends on parameters and input dimemnsions,
4668 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
4670 * then we know that we can take
4672 * x = floor((e(...) + c1) / m)
4674 * without having to perform any computation.
4676 * Note that we know that
4680 * If c1 + c2 were 0, then we would have detected an equality during
4681 * simplification. If c1 + c2 were negative, then we would have detected
4684 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_div(
4685 __isl_take isl_map
*map
)
4691 isl_basic_map
*hull
;
4693 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
4698 dim
= isl_map_dim(map
, isl_dim_out
);
4699 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4700 total
= 1 + isl_basic_map_total_dim(hull
);
4702 for (d
= 0; d
< dim
; ++d
) {
4703 for (i
= 0; i
< n
; ++i
) {
4704 if (!is_potential_div_constraint(hull
->ineq
[i
],
4707 for (j
= i
+ 1; j
< n
; ++j
) {
4708 if (!isl_seq_is_neg(hull
->ineq
[i
] + 1,
4709 hull
->ineq
[j
] + 1, total
- 1))
4711 isl_int_add(sum
, hull
->ineq
[i
][0],
4713 if (isl_int_abs_lt(sum
,
4714 hull
->ineq
[i
][offset
+ d
]))
4721 if (isl_int_is_pos(hull
->ineq
[j
][offset
+ d
]))
4723 return pw_multi_aff_from_map_div(map
, hull
, d
, j
);
4727 isl_basic_map_free(hull
);
4728 return pw_multi_aff_from_map_base(map
);
4731 isl_basic_map_free(hull
);
4735 /* Given an affine expression
4737 * [A -> B] -> f(A,B)
4739 * construct an isl_multi_aff
4743 * such that dimension "d" in B' is set to "aff" and the remaining
4744 * dimensions are set equal to the corresponding dimensions in B.
4745 * "n_in" is the dimension of the space A.
4746 * "n_out" is the dimension of the space B.
4748 * If "is_set" is set, then the affine expression is of the form
4752 * and we construct an isl_multi_aff
4756 static __isl_give isl_multi_aff
*range_map(__isl_take isl_aff
*aff
, int d
,
4757 unsigned n_in
, unsigned n_out
, int is_set
)
4761 isl_space
*space
, *space2
;
4762 isl_local_space
*ls
;
4764 space
= isl_aff_get_domain_space(aff
);
4765 ls
= isl_local_space_from_space(isl_space_copy(space
));
4766 space2
= isl_space_copy(space
);
4768 space2
= isl_space_range(isl_space_unwrap(space2
));
4769 space
= isl_space_map_from_domain_and_range(space
, space2
);
4770 ma
= isl_multi_aff_alloc(space
);
4771 ma
= isl_multi_aff_set_aff(ma
, d
, aff
);
4773 for (i
= 0; i
< n_out
; ++i
) {
4776 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4777 isl_dim_set
, n_in
+ i
);
4778 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4781 isl_local_space_free(ls
);
4786 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4787 * taking into account that the dimension at position "d" can be written as
4789 * x = m a + f(..) (1)
4791 * where m is equal to "gcd".
4792 * "i" is the index of the equality in "hull" that defines f(..).
4793 * In particular, the equality is of the form
4795 * f(..) - x + m g(existentials) = 0
4799 * -f(..) + x + m g(existentials) = 0
4801 * We basically plug (1) into "map", resulting in a map with "a"
4802 * in the range instead of "x". The corresponding isl_pw_multi_aff
4803 * defining "a" is then plugged back into (1) to obtain a definition fro "x".
4805 * Specifically, given the input map
4809 * We first wrap it into a set
4813 * and define (1) on top of the corresponding space, resulting in "aff".
4814 * We use this to create an isl_multi_aff that maps the output position "d"
4815 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
4816 * We plug this into the wrapped map, unwrap the result and compute the
4817 * corresponding isl_pw_multi_aff.
4818 * The result is an expression
4826 * so that we can plug that into "aff", after extending the latter to
4832 * If "map" is actually a set, then there is no "A" space, meaning
4833 * that we do not need to perform any wrapping, and that the result
4834 * of the recursive call is of the form
4838 * which is plugged into a mapping of the form
4842 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_stride(
4843 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
,
4848 isl_local_space
*ls
;
4851 isl_pw_multi_aff
*pma
, *id
;
4857 is_set
= isl_map_is_set(map
);
4859 n_in
= isl_basic_map_dim(hull
, isl_dim_in
);
4860 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
4861 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
4866 set
= isl_map_wrap(map
);
4867 space
= isl_space_map_from_set(isl_set_get_space(set
));
4868 ma
= isl_multi_aff_identity(space
);
4869 ls
= isl_local_space_from_space(isl_set_get_space(set
));
4870 aff
= isl_aff_alloc(ls
);
4872 isl_int_set_si(aff
->v
->el
[0], 1);
4873 if (isl_int_is_one(hull
->eq
[i
][o_out
+ d
]))
4874 isl_seq_neg(aff
->v
->el
+ 1, hull
->eq
[i
],
4877 isl_seq_cpy(aff
->v
->el
+ 1, hull
->eq
[i
],
4879 isl_int_set(aff
->v
->el
[1 + o_out
+ d
], gcd
);
4881 ma
= isl_multi_aff_set_aff(ma
, n_in
+ d
, isl_aff_copy(aff
));
4882 set
= isl_set_preimage_multi_aff(set
, ma
);
4884 ma
= range_map(aff
, d
, n_in
, n_out
, is_set
);
4889 map
= isl_set_unwrap(set
);
4890 pma
= isl_pw_multi_aff_from_map(map
);
4893 space
= isl_pw_multi_aff_get_domain_space(pma
);
4894 space
= isl_space_map_from_set(space
);
4895 id
= isl_pw_multi_aff_identity(space
);
4896 pma
= isl_pw_multi_aff_range_product(id
, pma
);
4898 id
= isl_pw_multi_aff_from_multi_aff(ma
);
4899 pma
= isl_pw_multi_aff_pullback_pw_multi_aff(id
, pma
);
4901 isl_basic_map_free(hull
);
4905 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4907 * As a special case, we first check if all output dimensions are uniquely
4908 * defined in terms of the parameters and input dimensions over the entire
4909 * domain. If so, we extract the desired isl_pw_multi_aff directly
4910 * from the affine hull of "map" and its domain.
4912 * Otherwise, we check if any of the output dimensions is "strided".
4913 * That is, we check if can be written as
4917 * with m greater than 1, a some combination of existentiall quantified
4918 * variables and f and expression in the parameters and input dimensions.
4919 * If so, we remove the stride in pw_multi_aff_from_map_stride.
4921 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
4924 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_map(__isl_take isl_map
*map
)
4928 isl_basic_map
*hull
;
4938 hull
= isl_map_affine_hull(isl_map_copy(map
));
4939 sv
= isl_basic_map_plain_is_single_valued(hull
);
4941 return plain_pw_multi_aff_from_map(isl_map_domain(map
), hull
);
4943 hull
= isl_basic_map_free(hull
);
4947 n_div
= isl_basic_map_dim(hull
, isl_dim_div
);
4948 o_div
= isl_basic_map_offset(hull
, isl_dim_div
);
4951 isl_basic_map_free(hull
);
4952 return pw_multi_aff_from_map_check_div(map
);
4957 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
4958 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
4960 for (i
= 0; i
< n_out
; ++i
) {
4961 for (j
= 0; j
< hull
->n_eq
; ++j
) {
4962 isl_int
*eq
= hull
->eq
[j
];
4963 isl_pw_multi_aff
*res
;
4965 if (!isl_int_is_one(eq
[o_out
+ i
]) &&
4966 !isl_int_is_negone(eq
[o_out
+ i
]))
4968 if (isl_seq_first_non_zero(eq
+ o_out
, i
) != -1)
4970 if (isl_seq_first_non_zero(eq
+ o_out
+ i
+ 1,
4971 n_out
- (i
+ 1)) != -1)
4973 isl_seq_gcd(eq
+ o_div
, n_div
, &gcd
);
4974 if (isl_int_is_zero(gcd
))
4976 if (isl_int_is_one(gcd
))
4979 res
= pw_multi_aff_from_map_stride(map
, hull
,
4987 isl_basic_map_free(hull
);
4988 return pw_multi_aff_from_map_check_div(map
);
4994 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_set(__isl_take isl_set
*set
)
4996 return isl_pw_multi_aff_from_map(set
);
4999 /* Convert "map" into an isl_pw_multi_aff (if possible) and
5002 static isl_stat
pw_multi_aff_from_map(__isl_take isl_map
*map
, void *user
)
5004 isl_union_pw_multi_aff
**upma
= user
;
5005 isl_pw_multi_aff
*pma
;
5007 pma
= isl_pw_multi_aff_from_map(map
);
5008 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5010 return *upma
? isl_stat_ok
: isl_stat_error
;
5013 /* Create an isl_union_pw_multi_aff with the given isl_aff on a universe
5016 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_aff(
5017 __isl_take isl_aff
*aff
)
5020 isl_pw_multi_aff
*pma
;
5022 ma
= isl_multi_aff_from_aff(aff
);
5023 pma
= isl_pw_multi_aff_from_multi_aff(ma
);
5024 return isl_union_pw_multi_aff_from_pw_multi_aff(pma
);
5027 /* Try and create an isl_union_pw_multi_aff that is equivalent
5028 * to the given isl_union_map.
5029 * The isl_union_map is required to be single-valued in each space.
5030 * Otherwise, an error is produced.
5032 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_map(
5033 __isl_take isl_union_map
*umap
)
5036 isl_union_pw_multi_aff
*upma
;
5038 space
= isl_union_map_get_space(umap
);
5039 upma
= isl_union_pw_multi_aff_empty(space
);
5040 if (isl_union_map_foreach_map(umap
, &pw_multi_aff_from_map
, &upma
) < 0)
5041 upma
= isl_union_pw_multi_aff_free(upma
);
5042 isl_union_map_free(umap
);
5047 /* Try and create an isl_union_pw_multi_aff that is equivalent
5048 * to the given isl_union_set.
5049 * The isl_union_set is required to be a singleton in each space.
5050 * Otherwise, an error is produced.
5052 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_set(
5053 __isl_take isl_union_set
*uset
)
5055 return isl_union_pw_multi_aff_from_union_map(uset
);
5058 /* Return the piecewise affine expression "set ? 1 : 0".
5060 __isl_give isl_pw_aff
*isl_set_indicator_function(__isl_take isl_set
*set
)
5063 isl_space
*space
= isl_set_get_space(set
);
5064 isl_local_space
*ls
= isl_local_space_from_space(space
);
5065 isl_aff
*zero
= isl_aff_zero_on_domain(isl_local_space_copy(ls
));
5066 isl_aff
*one
= isl_aff_zero_on_domain(ls
);
5068 one
= isl_aff_add_constant_si(one
, 1);
5069 pa
= isl_pw_aff_alloc(isl_set_copy(set
), one
);
5070 set
= isl_set_complement(set
);
5071 pa
= isl_pw_aff_add_disjoint(pa
, isl_pw_aff_alloc(set
, zero
));
5076 /* Plug in "subs" for dimension "type", "pos" of "aff".
5078 * Let i be the dimension to replace and let "subs" be of the form
5082 * and "aff" of the form
5088 * (a f + d g')/(m d)
5090 * where g' is the result of plugging in "subs" in each of the integer
5093 __isl_give isl_aff
*isl_aff_substitute(__isl_take isl_aff
*aff
,
5094 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
5099 aff
= isl_aff_cow(aff
);
5101 return isl_aff_free(aff
);
5103 ctx
= isl_aff_get_ctx(aff
);
5104 if (!isl_space_is_equal(aff
->ls
->dim
, subs
->ls
->dim
))
5105 isl_die(ctx
, isl_error_invalid
,
5106 "spaces don't match", return isl_aff_free(aff
));
5107 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
5108 isl_die(ctx
, isl_error_unsupported
,
5109 "cannot handle divs yet", return isl_aff_free(aff
));
5111 aff
->ls
= isl_local_space_substitute(aff
->ls
, type
, pos
, subs
);
5113 return isl_aff_free(aff
);
5115 aff
->v
= isl_vec_cow(aff
->v
);
5117 return isl_aff_free(aff
);
5119 pos
+= isl_local_space_offset(aff
->ls
, type
);
5122 isl_seq_substitute(aff
->v
->el
, pos
, subs
->v
->el
,
5123 aff
->v
->size
, subs
->v
->size
, v
);
5129 /* Plug in "subs" for dimension "type", "pos" in each of the affine
5130 * expressions in "maff".
5132 __isl_give isl_multi_aff
*isl_multi_aff_substitute(
5133 __isl_take isl_multi_aff
*maff
, enum isl_dim_type type
, unsigned pos
,
5134 __isl_keep isl_aff
*subs
)
5138 maff
= isl_multi_aff_cow(maff
);
5140 return isl_multi_aff_free(maff
);
5142 if (type
== isl_dim_in
)
5145 for (i
= 0; i
< maff
->n
; ++i
) {
5146 maff
->p
[i
] = isl_aff_substitute(maff
->p
[i
], type
, pos
, subs
);
5148 return isl_multi_aff_free(maff
);
5154 /* Plug in "subs" for dimension "type", "pos" of "pma".
5156 * pma is of the form
5160 * while subs is of the form
5162 * v' = B_j(v) -> S_j
5164 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
5165 * has a contribution in the result, in particular
5167 * C_ij(S_j) -> M_i(S_j)
5169 * Note that plugging in S_j in C_ij may also result in an empty set
5170 * and this contribution should simply be discarded.
5172 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_substitute(
5173 __isl_take isl_pw_multi_aff
*pma
, enum isl_dim_type type
, unsigned pos
,
5174 __isl_keep isl_pw_aff
*subs
)
5177 isl_pw_multi_aff
*res
;
5180 return isl_pw_multi_aff_free(pma
);
5182 n
= pma
->n
* subs
->n
;
5183 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma
->dim
), n
);
5185 for (i
= 0; i
< pma
->n
; ++i
) {
5186 for (j
= 0; j
< subs
->n
; ++j
) {
5188 isl_multi_aff
*res_ij
;
5191 common
= isl_set_intersect(
5192 isl_set_copy(pma
->p
[i
].set
),
5193 isl_set_copy(subs
->p
[j
].set
));
5194 common
= isl_set_substitute(common
,
5195 type
, pos
, subs
->p
[j
].aff
);
5196 empty
= isl_set_plain_is_empty(common
);
5197 if (empty
< 0 || empty
) {
5198 isl_set_free(common
);
5204 res_ij
= isl_multi_aff_substitute(
5205 isl_multi_aff_copy(pma
->p
[i
].maff
),
5206 type
, pos
, subs
->p
[j
].aff
);
5208 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5212 isl_pw_multi_aff_free(pma
);
5215 isl_pw_multi_aff_free(pma
);
5216 isl_pw_multi_aff_free(res
);
5220 /* Compute the preimage of a range of dimensions in the affine expression "src"
5221 * under "ma" and put the result in "dst". The number of dimensions in "src"
5222 * that precede the range is given by "n_before". The number of dimensions
5223 * in the range is given by the number of output dimensions of "ma".
5224 * The number of dimensions that follow the range is given by "n_after".
5225 * If "has_denom" is set (to one),
5226 * then "src" and "dst" have an extra initial denominator.
5227 * "n_div_ma" is the number of existentials in "ma"
5228 * "n_div_bset" is the number of existentials in "src"
5229 * The resulting "dst" (which is assumed to have been allocated by
5230 * the caller) contains coefficients for both sets of existentials,
5231 * first those in "ma" and then those in "src".
5232 * f, c1, c2 and g are temporary objects that have been initialized
5235 * Let src represent the expression
5237 * (a(p) + f_u u + b v + f_w w + c(divs))/d
5239 * and let ma represent the expressions
5241 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
5243 * We start out with the following expression for dst:
5245 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
5247 * with the multiplication factor f initially equal to 1
5248 * and f \sum_i b_i v_i kept separately.
5249 * For each x_i that we substitute, we multiply the numerator
5250 * (and denominator) of dst by c_1 = m_i and add the numerator
5251 * of the x_i expression multiplied by c_2 = f b_i,
5252 * after removing the common factors of c_1 and c_2.
5253 * The multiplication factor f also needs to be multiplied by c_1
5254 * for the next x_j, j > i.
5256 void isl_seq_preimage(isl_int
*dst
, isl_int
*src
,
5257 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
,
5258 int n_div_ma
, int n_div_bmap
,
5259 isl_int f
, isl_int c1
, isl_int c2
, isl_int g
, int has_denom
)
5262 int n_param
, n_in
, n_out
;
5265 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
5266 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
5267 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
5269 isl_seq_cpy(dst
, src
, has_denom
+ 1 + n_param
+ n_before
);
5270 o_dst
= o_src
= has_denom
+ 1 + n_param
+ n_before
;
5271 isl_seq_clr(dst
+ o_dst
, n_in
);
5274 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_after
);
5277 isl_seq_clr(dst
+ o_dst
, n_div_ma
);
5279 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_div_bmap
);
5281 isl_int_set_si(f
, 1);
5283 for (i
= 0; i
< n_out
; ++i
) {
5284 int offset
= has_denom
+ 1 + n_param
+ n_before
+ i
;
5286 if (isl_int_is_zero(src
[offset
]))
5288 isl_int_set(c1
, ma
->p
[i
]->v
->el
[0]);
5289 isl_int_mul(c2
, f
, src
[offset
]);
5290 isl_int_gcd(g
, c1
, c2
);
5291 isl_int_divexact(c1
, c1
, g
);
5292 isl_int_divexact(c2
, c2
, g
);
5294 isl_int_mul(f
, f
, c1
);
5297 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5298 c2
, ma
->p
[i
]->v
->el
+ o_src
, 1 + n_param
);
5299 o_dst
+= 1 + n_param
;
5300 o_src
+= 1 + n_param
;
5301 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_before
);
5303 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5304 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_in
);
5307 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_after
);
5309 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5310 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_div_ma
);
5313 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_div_bmap
);
5315 isl_int_mul(dst
[0], dst
[0], c1
);
5319 /* Compute the pullback of "aff" by the function represented by "ma".
5320 * In other words, plug in "ma" in "aff". The result is an affine expression
5321 * defined over the domain space of "ma".
5323 * If "aff" is represented by
5325 * (a(p) + b x + c(divs))/d
5327 * and ma is represented by
5329 * x = D(p) + F(y) + G(divs')
5331 * then the result is
5333 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
5335 * The divs in the local space of the input are similarly adjusted
5336 * through a call to isl_local_space_preimage_multi_aff.
5338 __isl_give isl_aff
*isl_aff_pullback_multi_aff(__isl_take isl_aff
*aff
,
5339 __isl_take isl_multi_aff
*ma
)
5341 isl_aff
*res
= NULL
;
5342 isl_local_space
*ls
;
5343 int n_div_aff
, n_div_ma
;
5344 isl_int f
, c1
, c2
, g
;
5346 ma
= isl_multi_aff_align_divs(ma
);
5350 n_div_aff
= isl_aff_dim(aff
, isl_dim_div
);
5351 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
5353 ls
= isl_aff_get_domain_local_space(aff
);
5354 ls
= isl_local_space_preimage_multi_aff(ls
, isl_multi_aff_copy(ma
));
5355 res
= isl_aff_alloc(ls
);
5364 isl_seq_preimage(res
->v
->el
, aff
->v
->el
, ma
, 0, 0, n_div_ma
, n_div_aff
,
5373 isl_multi_aff_free(ma
);
5374 res
= isl_aff_normalize(res
);
5378 isl_multi_aff_free(ma
);
5383 /* Compute the pullback of "aff1" by the function represented by "aff2".
5384 * In other words, plug in "aff2" in "aff1". The result is an affine expression
5385 * defined over the domain space of "aff1".
5387 * The domain of "aff1" should match the range of "aff2", which means
5388 * that it should be single-dimensional.
5390 __isl_give isl_aff
*isl_aff_pullback_aff(__isl_take isl_aff
*aff1
,
5391 __isl_take isl_aff
*aff2
)
5395 ma
= isl_multi_aff_from_aff(aff2
);
5396 return isl_aff_pullback_multi_aff(aff1
, ma
);
5399 /* Compute the pullback of "ma1" by the function represented by "ma2".
5400 * In other words, plug in "ma2" in "ma1".
5402 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
5404 static __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff_aligned(
5405 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5408 isl_space
*space
= NULL
;
5410 ma2
= isl_multi_aff_align_divs(ma2
);
5411 ma1
= isl_multi_aff_cow(ma1
);
5415 space
= isl_space_join(isl_multi_aff_get_space(ma2
),
5416 isl_multi_aff_get_space(ma1
));
5418 for (i
= 0; i
< ma1
->n
; ++i
) {
5419 ma1
->p
[i
] = isl_aff_pullback_multi_aff(ma1
->p
[i
],
5420 isl_multi_aff_copy(ma2
));
5425 ma1
= isl_multi_aff_reset_space(ma1
, space
);
5426 isl_multi_aff_free(ma2
);
5429 isl_space_free(space
);
5430 isl_multi_aff_free(ma2
);
5431 isl_multi_aff_free(ma1
);
5435 /* Compute the pullback of "ma1" by the function represented by "ma2".
5436 * In other words, plug in "ma2" in "ma1".
5438 __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff(
5439 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5441 return isl_multi_aff_align_params_multi_multi_and(ma1
, ma2
,
5442 &isl_multi_aff_pullback_multi_aff_aligned
);
5445 /* Extend the local space of "dst" to include the divs
5446 * in the local space of "src".
5448 __isl_give isl_aff
*isl_aff_align_divs(__isl_take isl_aff
*dst
,
5449 __isl_keep isl_aff
*src
)
5457 return isl_aff_free(dst
);
5459 ctx
= isl_aff_get_ctx(src
);
5460 if (!isl_space_is_equal(src
->ls
->dim
, dst
->ls
->dim
))
5461 isl_die(ctx
, isl_error_invalid
,
5462 "spaces don't match", goto error
);
5464 if (src
->ls
->div
->n_row
== 0)
5467 exp1
= isl_alloc_array(ctx
, int, src
->ls
->div
->n_row
);
5468 exp2
= isl_alloc_array(ctx
, int, dst
->ls
->div
->n_row
);
5469 if (!exp1
|| (dst
->ls
->div
->n_row
&& !exp2
))
5472 div
= isl_merge_divs(src
->ls
->div
, dst
->ls
->div
, exp1
, exp2
);
5473 dst
= isl_aff_expand_divs(dst
, div
, exp2
);
5481 return isl_aff_free(dst
);
5484 /* Adjust the local spaces of the affine expressions in "maff"
5485 * such that they all have the save divs.
5487 __isl_give isl_multi_aff
*isl_multi_aff_align_divs(
5488 __isl_take isl_multi_aff
*maff
)
5496 maff
= isl_multi_aff_cow(maff
);
5500 for (i
= 1; i
< maff
->n
; ++i
)
5501 maff
->p
[0] = isl_aff_align_divs(maff
->p
[0], maff
->p
[i
]);
5502 for (i
= 1; i
< maff
->n
; ++i
) {
5503 maff
->p
[i
] = isl_aff_align_divs(maff
->p
[i
], maff
->p
[0]);
5505 return isl_multi_aff_free(maff
);
5511 __isl_give isl_aff
*isl_aff_lift(__isl_take isl_aff
*aff
)
5513 aff
= isl_aff_cow(aff
);
5517 aff
->ls
= isl_local_space_lift(aff
->ls
);
5519 return isl_aff_free(aff
);
5524 /* Lift "maff" to a space with extra dimensions such that the result
5525 * has no more existentially quantified variables.
5526 * If "ls" is not NULL, then *ls is assigned the local space that lies
5527 * at the basis of the lifting applied to "maff".
5529 __isl_give isl_multi_aff
*isl_multi_aff_lift(__isl_take isl_multi_aff
*maff
,
5530 __isl_give isl_local_space
**ls
)
5544 isl_space
*space
= isl_multi_aff_get_domain_space(maff
);
5545 *ls
= isl_local_space_from_space(space
);
5547 return isl_multi_aff_free(maff
);
5552 maff
= isl_multi_aff_cow(maff
);
5553 maff
= isl_multi_aff_align_divs(maff
);
5557 n_div
= isl_aff_dim(maff
->p
[0], isl_dim_div
);
5558 space
= isl_multi_aff_get_space(maff
);
5559 space
= isl_space_lift(isl_space_domain(space
), n_div
);
5560 space
= isl_space_extend_domain_with_range(space
,
5561 isl_multi_aff_get_space(maff
));
5563 return isl_multi_aff_free(maff
);
5564 isl_space_free(maff
->space
);
5565 maff
->space
= space
;
5568 *ls
= isl_aff_get_domain_local_space(maff
->p
[0]);
5570 return isl_multi_aff_free(maff
);
5573 for (i
= 0; i
< maff
->n
; ++i
) {
5574 maff
->p
[i
] = isl_aff_lift(maff
->p
[i
]);
5582 isl_local_space_free(*ls
);
5583 return isl_multi_aff_free(maff
);
5587 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
5589 __isl_give isl_pw_aff
*isl_pw_multi_aff_get_pw_aff(
5590 __isl_keep isl_pw_multi_aff
*pma
, int pos
)
5600 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
5601 if (pos
< 0 || pos
>= n_out
)
5602 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5603 "index out of bounds", return NULL
);
5605 space
= isl_pw_multi_aff_get_space(pma
);
5606 space
= isl_space_drop_dims(space
, isl_dim_out
,
5607 pos
+ 1, n_out
- pos
- 1);
5608 space
= isl_space_drop_dims(space
, isl_dim_out
, 0, pos
);
5610 pa
= isl_pw_aff_alloc_size(space
, pma
->n
);
5611 for (i
= 0; i
< pma
->n
; ++i
) {
5613 aff
= isl_multi_aff_get_aff(pma
->p
[i
].maff
, pos
);
5614 pa
= isl_pw_aff_add_piece(pa
, isl_set_copy(pma
->p
[i
].set
), aff
);
5620 /* Return an isl_pw_multi_aff with the given "set" as domain and
5621 * an unnamed zero-dimensional range.
5623 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_domain(
5624 __isl_take isl_set
*set
)
5629 space
= isl_set_get_space(set
);
5630 space
= isl_space_from_domain(space
);
5631 ma
= isl_multi_aff_zero(space
);
5632 return isl_pw_multi_aff_alloc(set
, ma
);
5635 /* Add an isl_pw_multi_aff with the given "set" as domain and
5636 * an unnamed zero-dimensional range to *user.
5638 static isl_stat
add_pw_multi_aff_from_domain(__isl_take isl_set
*set
,
5641 isl_union_pw_multi_aff
**upma
= user
;
5642 isl_pw_multi_aff
*pma
;
5644 pma
= isl_pw_multi_aff_from_domain(set
);
5645 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5650 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
5651 * an unnamed zero-dimensional range.
5653 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_domain(
5654 __isl_take isl_union_set
*uset
)
5657 isl_union_pw_multi_aff
*upma
;
5662 space
= isl_union_set_get_space(uset
);
5663 upma
= isl_union_pw_multi_aff_empty(space
);
5665 if (isl_union_set_foreach_set(uset
,
5666 &add_pw_multi_aff_from_domain
, &upma
) < 0)
5669 isl_union_set_free(uset
);
5672 isl_union_set_free(uset
);
5673 isl_union_pw_multi_aff_free(upma
);
5677 /* Convert "pma" to an isl_map and add it to *umap.
5679 static isl_stat
map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
,
5682 isl_union_map
**umap
= user
;
5685 map
= isl_map_from_pw_multi_aff(pma
);
5686 *umap
= isl_union_map_add_map(*umap
, map
);
5691 /* Construct a union map mapping the domain of the union
5692 * piecewise multi-affine expression to its range, with each dimension
5693 * in the range equated to the corresponding affine expression on its cell.
5695 __isl_give isl_union_map
*isl_union_map_from_union_pw_multi_aff(
5696 __isl_take isl_union_pw_multi_aff
*upma
)
5699 isl_union_map
*umap
;
5704 space
= isl_union_pw_multi_aff_get_space(upma
);
5705 umap
= isl_union_map_empty(space
);
5707 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
5708 &map_from_pw_multi_aff
, &umap
) < 0)
5711 isl_union_pw_multi_aff_free(upma
);
5714 isl_union_pw_multi_aff_free(upma
);
5715 isl_union_map_free(umap
);
5719 /* Local data for bin_entry and the callback "fn".
5721 struct isl_union_pw_multi_aff_bin_data
{
5722 isl_union_pw_multi_aff
*upma2
;
5723 isl_union_pw_multi_aff
*res
;
5724 isl_pw_multi_aff
*pma
;
5725 isl_stat (*fn
)(void **entry
, void *user
);
5728 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
5729 * and call data->fn for each isl_pw_multi_aff in data->upma2.
5731 static isl_stat
bin_entry(void **entry
, void *user
)
5733 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5734 isl_pw_multi_aff
*pma
= *entry
;
5737 if (isl_hash_table_foreach(data
->upma2
->space
->ctx
, &data
->upma2
->table
,
5738 data
->fn
, data
) < 0)
5739 return isl_stat_error
;
5744 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
5745 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
5746 * passed as user field) and the isl_pw_multi_aff from upma2 is available
5747 * as *entry. The callback should adjust data->res if desired.
5749 static __isl_give isl_union_pw_multi_aff
*bin_op(
5750 __isl_take isl_union_pw_multi_aff
*upma1
,
5751 __isl_take isl_union_pw_multi_aff
*upma2
,
5752 isl_stat (*fn
)(void **entry
, void *user
))
5755 struct isl_union_pw_multi_aff_bin_data data
= { NULL
, NULL
, NULL
, fn
};
5757 space
= isl_union_pw_multi_aff_get_space(upma2
);
5758 upma1
= isl_union_pw_multi_aff_align_params(upma1
, space
);
5759 space
= isl_union_pw_multi_aff_get_space(upma1
);
5760 upma2
= isl_union_pw_multi_aff_align_params(upma2
, space
);
5762 if (!upma1
|| !upma2
)
5766 data
.res
= isl_union_pw_multi_aff_alloc_same_size(upma1
);
5767 if (isl_hash_table_foreach(upma1
->space
->ctx
, &upma1
->table
,
5768 &bin_entry
, &data
) < 0)
5771 isl_union_pw_multi_aff_free(upma1
);
5772 isl_union_pw_multi_aff_free(upma2
);
5775 isl_union_pw_multi_aff_free(upma1
);
5776 isl_union_pw_multi_aff_free(upma2
);
5777 isl_union_pw_multi_aff_free(data
.res
);
5781 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5782 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5784 static __isl_give isl_pw_multi_aff
*pw_multi_aff_range_product(
5785 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5789 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5790 isl_pw_multi_aff_get_space(pma2
));
5791 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5792 &isl_multi_aff_range_product
);
5795 /* Given two isl_pw_multi_affs A -> B and C -> D,
5796 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5798 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_product(
5799 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5801 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5802 &pw_multi_aff_range_product
);
5805 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5806 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5808 static __isl_give isl_pw_multi_aff
*pw_multi_aff_flat_range_product(
5809 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5813 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5814 isl_pw_multi_aff_get_space(pma2
));
5815 space
= isl_space_flatten_range(space
);
5816 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5817 &isl_multi_aff_flat_range_product
);
5820 /* Given two isl_pw_multi_affs A -> B and C -> D,
5821 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5823 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_flat_range_product(
5824 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5826 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5827 &pw_multi_aff_flat_range_product
);
5830 /* If data->pma and *entry have the same domain space, then compute
5831 * their flat range product and the result to data->res.
5833 static isl_stat
flat_range_product_entry(void **entry
, void *user
)
5835 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5836 isl_pw_multi_aff
*pma2
= *entry
;
5838 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
5839 pma2
->dim
, isl_dim_in
))
5842 pma2
= isl_pw_multi_aff_flat_range_product(
5843 isl_pw_multi_aff_copy(data
->pma
),
5844 isl_pw_multi_aff_copy(pma2
));
5846 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
5851 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
5852 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
5854 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_flat_range_product(
5855 __isl_take isl_union_pw_multi_aff
*upma1
,
5856 __isl_take isl_union_pw_multi_aff
*upma2
)
5858 return bin_op(upma1
, upma2
, &flat_range_product_entry
);
5861 /* Replace the affine expressions at position "pos" in "pma" by "pa".
5862 * The parameters are assumed to have been aligned.
5864 * The implementation essentially performs an isl_pw_*_on_shared_domain,
5865 * except that it works on two different isl_pw_* types.
5867 static __isl_give isl_pw_multi_aff
*pw_multi_aff_set_pw_aff(
5868 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
5869 __isl_take isl_pw_aff
*pa
)
5872 isl_pw_multi_aff
*res
= NULL
;
5877 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_in
,
5878 pa
->dim
, isl_dim_in
))
5879 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5880 "domains don't match", goto error
);
5881 if (pos
>= isl_pw_multi_aff_dim(pma
, isl_dim_out
))
5882 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5883 "index out of bounds", goto error
);
5886 res
= isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma
), n
);
5888 for (i
= 0; i
< pma
->n
; ++i
) {
5889 for (j
= 0; j
< pa
->n
; ++j
) {
5891 isl_multi_aff
*res_ij
;
5894 common
= isl_set_intersect(isl_set_copy(pma
->p
[i
].set
),
5895 isl_set_copy(pa
->p
[j
].set
));
5896 empty
= isl_set_plain_is_empty(common
);
5897 if (empty
< 0 || empty
) {
5898 isl_set_free(common
);
5904 res_ij
= isl_multi_aff_set_aff(
5905 isl_multi_aff_copy(pma
->p
[i
].maff
), pos
,
5906 isl_aff_copy(pa
->p
[j
].aff
));
5907 res_ij
= isl_multi_aff_gist(res_ij
,
5908 isl_set_copy(common
));
5910 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5914 isl_pw_multi_aff_free(pma
);
5915 isl_pw_aff_free(pa
);
5918 isl_pw_multi_aff_free(pma
);
5919 isl_pw_aff_free(pa
);
5920 return isl_pw_multi_aff_free(res
);
5923 /* Replace the affine expressions at position "pos" in "pma" by "pa".
5925 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_set_pw_aff(
5926 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
5927 __isl_take isl_pw_aff
*pa
)
5931 if (isl_space_match(pma
->dim
, isl_dim_param
, pa
->dim
, isl_dim_param
))
5932 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
5933 if (!isl_space_has_named_params(pma
->dim
) ||
5934 !isl_space_has_named_params(pa
->dim
))
5935 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5936 "unaligned unnamed parameters", goto error
);
5937 pma
= isl_pw_multi_aff_align_params(pma
, isl_pw_aff_get_space(pa
));
5938 pa
= isl_pw_aff_align_params(pa
, isl_pw_multi_aff_get_space(pma
));
5939 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
5941 isl_pw_multi_aff_free(pma
);
5942 isl_pw_aff_free(pa
);
5946 /* Do the parameters of "pa" match those of "space"?
5948 int isl_pw_aff_matching_params(__isl_keep isl_pw_aff
*pa
,
5949 __isl_keep isl_space
*space
)
5951 isl_space
*pa_space
;
5957 pa_space
= isl_pw_aff_get_space(pa
);
5959 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
5961 isl_space_free(pa_space
);
5965 /* Check that the domain space of "pa" matches "space".
5967 * Return 0 on success and -1 on error.
5969 int isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff
*pa
,
5970 __isl_keep isl_space
*space
)
5972 isl_space
*pa_space
;
5978 pa_space
= isl_pw_aff_get_space(pa
);
5980 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
5984 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
5985 "parameters don't match", goto error
);
5986 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
5987 pa_space
, isl_dim_in
);
5991 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
5992 "domains don't match", goto error
);
5993 isl_space_free(pa_space
);
5996 isl_space_free(pa_space
);
6005 #include <isl_multi_templ.c>
6006 #include <isl_multi_apply_set.c>
6007 #include <isl_multi_gist.c>
6008 #include <isl_multi_intersect.c>
6010 /* Scale the elements of "pma" by the corresponding elements of "mv".
6012 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_scale_multi_val(
6013 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
)
6017 pma
= isl_pw_multi_aff_cow(pma
);
6020 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6021 mv
->space
, isl_dim_set
))
6022 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6023 "spaces don't match", goto error
);
6024 if (!isl_space_match(pma
->dim
, isl_dim_param
,
6025 mv
->space
, isl_dim_param
)) {
6026 pma
= isl_pw_multi_aff_align_params(pma
,
6027 isl_multi_val_get_space(mv
));
6028 mv
= isl_multi_val_align_params(mv
,
6029 isl_pw_multi_aff_get_space(pma
));
6034 for (i
= 0; i
< pma
->n
; ++i
) {
6035 pma
->p
[i
].maff
= isl_multi_aff_scale_multi_val(pma
->p
[i
].maff
,
6036 isl_multi_val_copy(mv
));
6037 if (!pma
->p
[i
].maff
)
6041 isl_multi_val_free(mv
);
6044 isl_multi_val_free(mv
);
6045 isl_pw_multi_aff_free(pma
);
6049 /* Internal data structure for isl_union_pw_multi_aff_scale_multi_val.
6050 * mv contains the mv argument.
6051 * res collects the results.
6053 struct isl_union_pw_multi_aff_scale_multi_val_data
{
6055 isl_union_pw_multi_aff
*res
;
6058 /* This function is called for each entry of an isl_union_pw_multi_aff.
6059 * If the space of the entry matches that of data->mv,
6060 * then apply isl_pw_multi_aff_scale_multi_val and add the result
6063 static isl_stat
union_pw_multi_aff_scale_multi_val_entry(void **entry
,
6066 struct isl_union_pw_multi_aff_scale_multi_val_data
*data
= user
;
6067 isl_pw_multi_aff
*pma
= *entry
;
6070 return isl_stat_error
;
6071 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6072 data
->mv
->space
, isl_dim_set
))
6075 pma
= isl_pw_multi_aff_copy(pma
);
6076 pma
= isl_pw_multi_aff_scale_multi_val(pma
,
6077 isl_multi_val_copy(data
->mv
));
6078 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
6080 return isl_stat_error
;
6085 /* Scale the elements of "upma" by the corresponding elements of "mv",
6086 * for those entries that match the space of "mv".
6088 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_scale_multi_val(
6089 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_multi_val
*mv
)
6091 struct isl_union_pw_multi_aff_scale_multi_val_data data
;
6093 upma
= isl_union_pw_multi_aff_align_params(upma
,
6094 isl_multi_val_get_space(mv
));
6095 mv
= isl_multi_val_align_params(mv
,
6096 isl_union_pw_multi_aff_get_space(upma
));
6101 data
.res
= isl_union_pw_multi_aff_alloc_same_size(upma
);
6102 if (isl_hash_table_foreach(upma
->space
->ctx
, &upma
->table
,
6103 &union_pw_multi_aff_scale_multi_val_entry
, &data
) < 0)
6106 isl_multi_val_free(mv
);
6107 isl_union_pw_multi_aff_free(upma
);
6110 isl_multi_val_free(mv
);
6111 isl_union_pw_multi_aff_free(upma
);
6115 /* Construct and return a piecewise multi affine expression
6116 * in the given space with value zero in each of the output dimensions and
6117 * a universe domain.
6119 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_zero(__isl_take isl_space
*space
)
6121 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space
));
6124 /* Construct and return a piecewise multi affine expression
6125 * that is equal to the given piecewise affine expression.
6127 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_pw_aff(
6128 __isl_take isl_pw_aff
*pa
)
6132 isl_pw_multi_aff
*pma
;
6137 space
= isl_pw_aff_get_space(pa
);
6138 pma
= isl_pw_multi_aff_alloc_size(space
, pa
->n
);
6140 for (i
= 0; i
< pa
->n
; ++i
) {
6144 set
= isl_set_copy(pa
->p
[i
].set
);
6145 ma
= isl_multi_aff_from_aff(isl_aff_copy(pa
->p
[i
].aff
));
6146 pma
= isl_pw_multi_aff_add_piece(pma
, set
, ma
);
6149 isl_pw_aff_free(pa
);
6153 /* Construct a set or map mapping the shared (parameter) domain
6154 * of the piecewise affine expressions to the range of "mpa"
6155 * with each dimension in the range equated to the
6156 * corresponding piecewise affine expression.
6158 static __isl_give isl_map
*map_from_multi_pw_aff(
6159 __isl_take isl_multi_pw_aff
*mpa
)
6168 if (isl_space_dim(mpa
->space
, isl_dim_out
) != mpa
->n
)
6169 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6170 "invalid space", goto error
);
6172 space
= isl_multi_pw_aff_get_domain_space(mpa
);
6173 map
= isl_map_universe(isl_space_from_domain(space
));
6175 for (i
= 0; i
< mpa
->n
; ++i
) {
6179 pa
= isl_pw_aff_copy(mpa
->p
[i
]);
6180 map_i
= map_from_pw_aff(pa
);
6182 map
= isl_map_flat_range_product(map
, map_i
);
6185 map
= isl_map_reset_space(map
, isl_multi_pw_aff_get_space(mpa
));
6187 isl_multi_pw_aff_free(mpa
);
6190 isl_multi_pw_aff_free(mpa
);
6194 /* Construct a map mapping the shared domain
6195 * of the piecewise affine expressions to the range of "mpa"
6196 * with each dimension in the range equated to the
6197 * corresponding piecewise affine expression.
6199 __isl_give isl_map
*isl_map_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6203 if (isl_space_is_set(mpa
->space
))
6204 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6205 "space of input is not a map", goto error
);
6207 return map_from_multi_pw_aff(mpa
);
6209 isl_multi_pw_aff_free(mpa
);
6213 /* Construct a set mapping the shared parameter domain
6214 * of the piecewise affine expressions to the space of "mpa"
6215 * with each dimension in the range equated to the
6216 * corresponding piecewise affine expression.
6218 __isl_give isl_set
*isl_set_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6222 if (!isl_space_is_set(mpa
->space
))
6223 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6224 "space of input is not a set", goto error
);
6226 return map_from_multi_pw_aff(mpa
);
6228 isl_multi_pw_aff_free(mpa
);
6232 /* Construct and return a piecewise multi affine expression
6233 * that is equal to the given multi piecewise affine expression
6234 * on the shared domain of the piecewise affine expressions.
6236 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff(
6237 __isl_take isl_multi_pw_aff
*mpa
)
6242 isl_pw_multi_aff
*pma
;
6247 space
= isl_multi_pw_aff_get_space(mpa
);
6250 isl_multi_pw_aff_free(mpa
);
6251 return isl_pw_multi_aff_zero(space
);
6254 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, 0);
6255 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
6257 for (i
= 1; i
< mpa
->n
; ++i
) {
6258 isl_pw_multi_aff
*pma_i
;
6260 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6261 pma_i
= isl_pw_multi_aff_from_pw_aff(pa
);
6262 pma
= isl_pw_multi_aff_range_product(pma
, pma_i
);
6265 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
6267 isl_multi_pw_aff_free(mpa
);
6271 /* Construct and return a multi piecewise affine expression
6272 * that is equal to the given multi affine expression.
6274 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_multi_aff(
6275 __isl_take isl_multi_aff
*ma
)
6278 isl_multi_pw_aff
*mpa
;
6283 n
= isl_multi_aff_dim(ma
, isl_dim_out
);
6284 mpa
= isl_multi_pw_aff_alloc(isl_multi_aff_get_space(ma
));
6286 for (i
= 0; i
< n
; ++i
) {
6289 pa
= isl_pw_aff_from_aff(isl_multi_aff_get_aff(ma
, i
));
6290 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6293 isl_multi_aff_free(ma
);
6297 /* Construct and return a multi piecewise affine expression
6298 * that is equal to the given piecewise multi affine expression.
6300 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_pw_multi_aff(
6301 __isl_take isl_pw_multi_aff
*pma
)
6305 isl_multi_pw_aff
*mpa
;
6310 n
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
6311 space
= isl_pw_multi_aff_get_space(pma
);
6312 mpa
= isl_multi_pw_aff_alloc(space
);
6314 for (i
= 0; i
< n
; ++i
) {
6317 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
6318 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6321 isl_pw_multi_aff_free(pma
);
6325 /* Do "pa1" and "pa2" represent the same function?
6327 * We first check if they are obviously equal.
6328 * If not, we convert them to maps and check if those are equal.
6330 int isl_pw_aff_is_equal(__isl_keep isl_pw_aff
*pa1
, __isl_keep isl_pw_aff
*pa2
)
6333 isl_map
*map1
, *map2
;
6338 equal
= isl_pw_aff_plain_is_equal(pa1
, pa2
);
6339 if (equal
< 0 || equal
)
6342 map1
= map_from_pw_aff(isl_pw_aff_copy(pa1
));
6343 map2
= map_from_pw_aff(isl_pw_aff_copy(pa2
));
6344 equal
= isl_map_is_equal(map1
, map2
);
6351 /* Do "mpa1" and "mpa2" represent the same function?
6353 * Note that we cannot convert the entire isl_multi_pw_aff
6354 * to a map because the domains of the piecewise affine expressions
6355 * may not be the same.
6357 isl_bool
isl_multi_pw_aff_is_equal(__isl_keep isl_multi_pw_aff
*mpa1
,
6358 __isl_keep isl_multi_pw_aff
*mpa2
)
6364 return isl_bool_error
;
6366 if (!isl_space_match(mpa1
->space
, isl_dim_param
,
6367 mpa2
->space
, isl_dim_param
)) {
6368 if (!isl_space_has_named_params(mpa1
->space
))
6369 return isl_bool_false
;
6370 if (!isl_space_has_named_params(mpa2
->space
))
6371 return isl_bool_false
;
6372 mpa1
= isl_multi_pw_aff_copy(mpa1
);
6373 mpa2
= isl_multi_pw_aff_copy(mpa2
);
6374 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6375 isl_multi_pw_aff_get_space(mpa2
));
6376 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6377 isl_multi_pw_aff_get_space(mpa1
));
6378 equal
= isl_multi_pw_aff_is_equal(mpa1
, mpa2
);
6379 isl_multi_pw_aff_free(mpa1
);
6380 isl_multi_pw_aff_free(mpa2
);
6384 equal
= isl_space_is_equal(mpa1
->space
, mpa2
->space
);
6385 if (equal
< 0 || !equal
)
6388 for (i
= 0; i
< mpa1
->n
; ++i
) {
6389 equal
= isl_pw_aff_is_equal(mpa1
->p
[i
], mpa2
->p
[i
]);
6390 if (equal
< 0 || !equal
)
6394 return isl_bool_true
;
6397 /* Coalesce the elements of "mpa".
6399 * Note that such coalescing does not change the meaning of "mpa"
6400 * so there is no need to cow. We do need to be careful not to
6401 * destroy any other copies of "mpa" in case of failure.
6403 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_coalesce(
6404 __isl_take isl_multi_pw_aff
*mpa
)
6411 for (i
= 0; i
< mpa
->n
; ++i
) {
6412 isl_pw_aff
*pa
= isl_pw_aff_copy(mpa
->p
[i
]);
6413 pa
= isl_pw_aff_coalesce(pa
);
6415 return isl_multi_pw_aff_free(mpa
);
6416 isl_pw_aff_free(mpa
->p
[i
]);
6423 /* Compute the pullback of "mpa" by the function represented by "ma".
6424 * In other words, plug in "ma" in "mpa".
6426 * The parameters of "mpa" and "ma" are assumed to have been aligned.
6428 static __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff_aligned(
6429 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6432 isl_space
*space
= NULL
;
6434 mpa
= isl_multi_pw_aff_cow(mpa
);
6438 space
= isl_space_join(isl_multi_aff_get_space(ma
),
6439 isl_multi_pw_aff_get_space(mpa
));
6443 for (i
= 0; i
< mpa
->n
; ++i
) {
6444 mpa
->p
[i
] = isl_pw_aff_pullback_multi_aff(mpa
->p
[i
],
6445 isl_multi_aff_copy(ma
));
6450 isl_multi_aff_free(ma
);
6451 isl_space_free(mpa
->space
);
6455 isl_space_free(space
);
6456 isl_multi_pw_aff_free(mpa
);
6457 isl_multi_aff_free(ma
);
6461 /* Compute the pullback of "mpa" by the function represented by "ma".
6462 * In other words, plug in "ma" in "mpa".
6464 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff(
6465 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6469 if (isl_space_match(mpa
->space
, isl_dim_param
,
6470 ma
->space
, isl_dim_param
))
6471 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6472 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_multi_aff_get_space(ma
));
6473 ma
= isl_multi_aff_align_params(ma
, isl_multi_pw_aff_get_space(mpa
));
6474 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6476 isl_multi_pw_aff_free(mpa
);
6477 isl_multi_aff_free(ma
);
6481 /* Compute the pullback of "mpa" by the function represented by "pma".
6482 * In other words, plug in "pma" in "mpa".
6484 * The parameters of "mpa" and "mpa" are assumed to have been aligned.
6486 static __isl_give isl_multi_pw_aff
*
6487 isl_multi_pw_aff_pullback_pw_multi_aff_aligned(
6488 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6491 isl_space
*space
= NULL
;
6493 mpa
= isl_multi_pw_aff_cow(mpa
);
6497 space
= isl_space_join(isl_pw_multi_aff_get_space(pma
),
6498 isl_multi_pw_aff_get_space(mpa
));
6500 for (i
= 0; i
< mpa
->n
; ++i
) {
6501 mpa
->p
[i
] = isl_pw_aff_pullback_pw_multi_aff_aligned(mpa
->p
[i
],
6502 isl_pw_multi_aff_copy(pma
));
6507 isl_pw_multi_aff_free(pma
);
6508 isl_space_free(mpa
->space
);
6512 isl_space_free(space
);
6513 isl_multi_pw_aff_free(mpa
);
6514 isl_pw_multi_aff_free(pma
);
6518 /* Compute the pullback of "mpa" by the function represented by "pma".
6519 * In other words, plug in "pma" in "mpa".
6521 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_pw_multi_aff(
6522 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6526 if (isl_space_match(mpa
->space
, isl_dim_param
, pma
->dim
, isl_dim_param
))
6527 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6528 mpa
= isl_multi_pw_aff_align_params(mpa
,
6529 isl_pw_multi_aff_get_space(pma
));
6530 pma
= isl_pw_multi_aff_align_params(pma
,
6531 isl_multi_pw_aff_get_space(mpa
));
6532 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6534 isl_multi_pw_aff_free(mpa
);
6535 isl_pw_multi_aff_free(pma
);
6539 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6540 * with the domain of "aff". The domain of the result is the same
6542 * "mpa" and "aff" are assumed to have been aligned.
6544 * We first extract the parametric constant from "aff", defined
6545 * over the correct domain.
6546 * Then we add the appropriate combinations of the members of "mpa".
6547 * Finally, we add the integer divisions through recursive calls.
6549 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff_aligned(
6550 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6558 n_in
= isl_aff_dim(aff
, isl_dim_in
);
6559 n_div
= isl_aff_dim(aff
, isl_dim_div
);
6561 space
= isl_space_domain(isl_multi_pw_aff_get_space(mpa
));
6562 tmp
= isl_aff_copy(aff
);
6563 tmp
= isl_aff_drop_dims(tmp
, isl_dim_div
, 0, n_div
);
6564 tmp
= isl_aff_drop_dims(tmp
, isl_dim_in
, 0, n_in
);
6565 tmp
= isl_aff_add_dims(tmp
, isl_dim_in
,
6566 isl_space_dim(space
, isl_dim_set
));
6567 tmp
= isl_aff_reset_domain_space(tmp
, space
);
6568 pa
= isl_pw_aff_from_aff(tmp
);
6570 for (i
= 0; i
< n_in
; ++i
) {
6573 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
6575 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
6576 pa_i
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6577 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6578 pa
= isl_pw_aff_add(pa
, pa_i
);
6581 for (i
= 0; i
< n_div
; ++i
) {
6585 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
6587 div
= isl_aff_get_div(aff
, i
);
6588 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6589 isl_multi_pw_aff_copy(mpa
), div
);
6590 pa_i
= isl_pw_aff_floor(pa_i
);
6591 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
6592 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6593 pa
= isl_pw_aff_add(pa
, pa_i
);
6596 isl_multi_pw_aff_free(mpa
);
6602 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6603 * with the domain of "aff". The domain of the result is the same
6606 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff(
6607 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6611 if (isl_space_match(aff
->ls
->dim
, isl_dim_param
,
6612 mpa
->space
, isl_dim_param
))
6613 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6615 aff
= isl_aff_align_params(aff
, isl_multi_pw_aff_get_space(mpa
));
6616 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_aff_get_space(aff
));
6618 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6621 isl_multi_pw_aff_free(mpa
);
6625 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6626 * with the domain of "pa". The domain of the result is the same
6628 * "mpa" and "pa" are assumed to have been aligned.
6630 * We consider each piece in turn. Note that the domains of the
6631 * pieces are assumed to be disjoint and they remain disjoint
6632 * after taking the preimage (over the same function).
6634 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff_aligned(
6635 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6644 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa
),
6645 isl_pw_aff_get_space(pa
));
6646 res
= isl_pw_aff_empty(space
);
6648 for (i
= 0; i
< pa
->n
; ++i
) {
6652 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6653 isl_multi_pw_aff_copy(mpa
),
6654 isl_aff_copy(pa
->p
[i
].aff
));
6655 domain
= isl_set_copy(pa
->p
[i
].set
);
6656 domain
= isl_set_preimage_multi_pw_aff(domain
,
6657 isl_multi_pw_aff_copy(mpa
));
6658 pa_i
= isl_pw_aff_intersect_domain(pa_i
, domain
);
6659 res
= isl_pw_aff_add_disjoint(res
, pa_i
);
6662 isl_pw_aff_free(pa
);
6663 isl_multi_pw_aff_free(mpa
);
6666 isl_pw_aff_free(pa
);
6667 isl_multi_pw_aff_free(mpa
);
6671 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6672 * with the domain of "pa". The domain of the result is the same
6675 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff(
6676 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6680 if (isl_space_match(pa
->dim
, isl_dim_param
, mpa
->space
, isl_dim_param
))
6681 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6683 pa
= isl_pw_aff_align_params(pa
, isl_multi_pw_aff_get_space(mpa
));
6684 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_pw_aff_get_space(pa
));
6686 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6688 isl_pw_aff_free(pa
);
6689 isl_multi_pw_aff_free(mpa
);
6693 /* Compute the pullback of "pa" by the function represented by "mpa".
6694 * In other words, plug in "mpa" in "pa".
6695 * "pa" and "mpa" are assumed to have been aligned.
6697 * The pullback is computed by applying "pa" to "mpa".
6699 static __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff_aligned(
6700 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6702 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6705 /* Compute the pullback of "pa" by the function represented by "mpa".
6706 * In other words, plug in "mpa" in "pa".
6708 * The pullback is computed by applying "pa" to "mpa".
6710 __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff(
6711 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6713 return isl_multi_pw_aff_apply_pw_aff(mpa
, pa
);
6716 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6717 * In other words, plug in "mpa2" in "mpa1".
6719 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6721 * We pullback each member of "mpa1" in turn.
6723 static __isl_give isl_multi_pw_aff
*
6724 isl_multi_pw_aff_pullback_multi_pw_aff_aligned(
6725 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6728 isl_space
*space
= NULL
;
6730 mpa1
= isl_multi_pw_aff_cow(mpa1
);
6734 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa2
),
6735 isl_multi_pw_aff_get_space(mpa1
));
6737 for (i
= 0; i
< mpa1
->n
; ++i
) {
6738 mpa1
->p
[i
] = isl_pw_aff_pullback_multi_pw_aff_aligned(
6739 mpa1
->p
[i
], isl_multi_pw_aff_copy(mpa2
));
6744 mpa1
= isl_multi_pw_aff_reset_space(mpa1
, space
);
6746 isl_multi_pw_aff_free(mpa2
);
6749 isl_space_free(space
);
6750 isl_multi_pw_aff_free(mpa1
);
6751 isl_multi_pw_aff_free(mpa2
);
6755 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6756 * In other words, plug in "mpa2" in "mpa1".
6758 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_pw_aff(
6759 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6761 return isl_multi_pw_aff_align_params_multi_multi_and(mpa1
, mpa2
,
6762 &isl_multi_pw_aff_pullback_multi_pw_aff_aligned
);
6765 /* Align the parameters of "mpa1" and "mpa2", check that the ranges
6766 * of "mpa1" and "mpa2" live in the same space, construct map space
6767 * between the domain spaces of "mpa1" and "mpa2" and call "order"
6768 * with this map space as extract argument.
6770 static __isl_give isl_map
*isl_multi_pw_aff_order_map(
6771 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6772 __isl_give isl_map
*(*order
)(__isl_keep isl_multi_pw_aff
*mpa1
,
6773 __isl_keep isl_multi_pw_aff
*mpa2
, __isl_take isl_space
*space
))
6776 isl_space
*space1
, *space2
;
6779 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6780 isl_multi_pw_aff_get_space(mpa2
));
6781 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6782 isl_multi_pw_aff_get_space(mpa1
));
6785 match
= isl_space_tuple_is_equal(mpa1
->space
, isl_dim_out
,
6786 mpa2
->space
, isl_dim_out
);
6790 isl_die(isl_multi_pw_aff_get_ctx(mpa1
), isl_error_invalid
,
6791 "range spaces don't match", goto error
);
6792 space1
= isl_space_domain(isl_multi_pw_aff_get_space(mpa1
));
6793 space2
= isl_space_domain(isl_multi_pw_aff_get_space(mpa2
));
6794 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
6796 res
= order(mpa1
, mpa2
, space1
);
6797 isl_multi_pw_aff_free(mpa1
);
6798 isl_multi_pw_aff_free(mpa2
);
6801 isl_multi_pw_aff_free(mpa1
);
6802 isl_multi_pw_aff_free(mpa2
);
6806 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6807 * where the function values are equal. "space" is the space of the result.
6808 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6810 * "mpa1" and "mpa2" are equal when each of the pairs of elements
6811 * in the sequences are equal.
6813 static __isl_give isl_map
*isl_multi_pw_aff_eq_map_on_space(
6814 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
6815 __isl_take isl_space
*space
)
6820 res
= isl_map_universe(space
);
6822 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
6823 for (i
= 0; i
< n
; ++i
) {
6824 isl_pw_aff
*pa1
, *pa2
;
6827 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6828 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6829 map
= isl_pw_aff_eq_map(pa1
, pa2
);
6830 res
= isl_map_intersect(res
, map
);
6836 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6837 * where the function values are equal.
6839 __isl_give isl_map
*isl_multi_pw_aff_eq_map(__isl_take isl_multi_pw_aff
*mpa1
,
6840 __isl_take isl_multi_pw_aff
*mpa2
)
6842 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
6843 &isl_multi_pw_aff_eq_map_on_space
);
6846 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6847 * where the function values of "mpa1" is lexicographically satisfies "base"
6848 * compared to that of "mpa2". "space" is the space of the result.
6849 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6851 * "mpa1" lexicographically satisfies "base" compared to "mpa2"
6852 * if its i-th element satisfies "base" when compared to
6853 * the i-th element of "mpa2" while all previous elements are
6856 static __isl_give isl_map
*isl_multi_pw_aff_lex_map_on_space(
6857 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6858 __isl_give isl_map
*(*base
)(__isl_take isl_pw_aff
*pa1
,
6859 __isl_take isl_pw_aff
*pa2
),
6860 __isl_take isl_space
*space
)
6863 isl_map
*res
, *rest
;
6865 res
= isl_map_empty(isl_space_copy(space
));
6866 rest
= isl_map_universe(space
);
6868 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
6869 for (i
= 0; i
< n
; ++i
) {
6870 isl_pw_aff
*pa1
, *pa2
;
6873 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6874 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6875 map
= base(pa1
, pa2
);
6876 map
= isl_map_intersect(map
, isl_map_copy(rest
));
6877 res
= isl_map_union(res
, map
);
6882 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6883 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6884 map
= isl_pw_aff_eq_map(pa1
, pa2
);
6885 rest
= isl_map_intersect(rest
, map
);
6892 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6893 * where the function value of "mpa1" is lexicographically less than that
6894 * of "mpa2". "space" is the space of the result.
6895 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6897 * "mpa1" is less than "mpa2" if its i-th element is smaller
6898 * than the i-th element of "mpa2" while all previous elements are
6901 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map_on_space(
6902 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6903 __isl_take isl_space
*space
)
6905 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
6906 &isl_pw_aff_lt_map
, space
);
6909 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6910 * where the function value of "mpa1" is lexicographically less than that
6913 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map(
6914 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6916 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
6917 &isl_multi_pw_aff_lex_lt_map_on_space
);
6920 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6921 * where the function value of "mpa1" is lexicographically greater than that
6922 * of "mpa2". "space" is the space of the result.
6923 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6925 * "mpa1" is greater than "mpa2" if its i-th element is greater
6926 * than the i-th element of "mpa2" while all previous elements are
6929 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map_on_space(
6930 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6931 __isl_take isl_space
*space
)
6933 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
6934 &isl_pw_aff_gt_map
, space
);
6937 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6938 * where the function value of "mpa1" is lexicographically greater than that
6941 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map(
6942 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6944 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
6945 &isl_multi_pw_aff_lex_gt_map_on_space
);
6948 /* Compare two isl_affs.
6950 * Return -1 if "aff1" is "smaller" than "aff2", 1 if "aff1" is "greater"
6951 * than "aff2" and 0 if they are equal.
6953 * The order is fairly arbitrary. We do consider expressions that only involve
6954 * earlier dimensions as "smaller".
6956 int isl_aff_plain_cmp(__isl_keep isl_aff
*aff1
, __isl_keep isl_aff
*aff2
)
6969 cmp
= isl_local_space_cmp(aff1
->ls
, aff2
->ls
);
6973 last1
= isl_seq_last_non_zero(aff1
->v
->el
+ 1, aff1
->v
->size
- 1);
6974 last2
= isl_seq_last_non_zero(aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
6976 return last1
- last2
;
6978 return isl_seq_cmp(aff1
->v
->el
, aff2
->v
->el
, aff1
->v
->size
);
6981 /* Compare two isl_pw_affs.
6983 * Return -1 if "pa1" is "smaller" than "pa2", 1 if "pa1" is "greater"
6984 * than "pa2" and 0 if they are equal.
6986 * The order is fairly arbitrary. We do consider expressions that only involve
6987 * earlier dimensions as "smaller".
6989 int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff
*pa1
,
6990 __isl_keep isl_pw_aff
*pa2
)
7003 cmp
= isl_space_cmp(pa1
->dim
, pa2
->dim
);
7007 if (pa1
->n
!= pa2
->n
)
7008 return pa1
->n
- pa2
->n
;
7010 for (i
= 0; i
< pa1
->n
; ++i
) {
7011 cmp
= isl_set_plain_cmp(pa1
->p
[i
].set
, pa2
->p
[i
].set
);
7014 cmp
= isl_aff_plain_cmp(pa1
->p
[i
].aff
, pa2
->p
[i
].aff
);
7022 /* Return a piecewise affine expression that is equal to "v" on "domain".
7024 __isl_give isl_pw_aff
*isl_pw_aff_val_on_domain(__isl_take isl_set
*domain
,
7025 __isl_take isl_val
*v
)
7028 isl_local_space
*ls
;
7031 space
= isl_set_get_space(domain
);
7032 ls
= isl_local_space_from_space(space
);
7033 aff
= isl_aff_val_on_domain(ls
, v
);
7035 return isl_pw_aff_alloc(domain
, aff
);
7038 /* Return a multi affine expression that is equal to "mv" on domain
7041 __isl_give isl_multi_aff
*isl_multi_aff_multi_val_on_space(
7042 __isl_take isl_space
*space
, __isl_take isl_multi_val
*mv
)
7046 isl_local_space
*ls
;
7052 n
= isl_multi_val_dim(mv
, isl_dim_set
);
7053 space2
= isl_multi_val_get_space(mv
);
7054 space2
= isl_space_align_params(space2
, isl_space_copy(space
));
7055 space
= isl_space_align_params(space
, isl_space_copy(space2
));
7056 space
= isl_space_map_from_domain_and_range(space
, space2
);
7057 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
7058 ls
= isl_local_space_from_space(isl_space_domain(space
));
7059 for (i
= 0; i
< n
; ++i
) {
7063 v
= isl_multi_val_get_val(mv
, i
);
7064 aff
= isl_aff_val_on_domain(isl_local_space_copy(ls
), v
);
7065 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
7067 isl_local_space_free(ls
);
7069 isl_multi_val_free(mv
);
7072 isl_space_free(space
);
7073 isl_multi_val_free(mv
);
7077 /* Return a piecewise multi-affine expression
7078 * that is equal to "mv" on "domain".
7080 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_multi_val_on_domain(
7081 __isl_take isl_set
*domain
, __isl_take isl_multi_val
*mv
)
7086 space
= isl_set_get_space(domain
);
7087 ma
= isl_multi_aff_multi_val_on_space(space
, mv
);
7089 return isl_pw_multi_aff_alloc(domain
, ma
);
7092 /* Internal data structure for isl_union_pw_multi_aff_multi_val_on_domain.
7093 * mv is the value that should be attained on each domain set
7094 * res collects the results
7096 struct isl_union_pw_multi_aff_multi_val_on_domain_data
{
7098 isl_union_pw_multi_aff
*res
;
7101 /* Create an isl_pw_multi_aff equal to data->mv on "domain"
7102 * and add it to data->res.
7104 static isl_stat
pw_multi_aff_multi_val_on_domain(__isl_take isl_set
*domain
,
7107 struct isl_union_pw_multi_aff_multi_val_on_domain_data
*data
= user
;
7108 isl_pw_multi_aff
*pma
;
7111 mv
= isl_multi_val_copy(data
->mv
);
7112 pma
= isl_pw_multi_aff_multi_val_on_domain(domain
, mv
);
7113 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
7115 return data
->res
? isl_stat_ok
: isl_stat_error
;
7118 /* Return a union piecewise multi-affine expression
7119 * that is equal to "mv" on "domain".
7121 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_multi_val_on_domain(
7122 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7124 struct isl_union_pw_multi_aff_multi_val_on_domain_data data
;
7127 space
= isl_union_set_get_space(domain
);
7128 data
.res
= isl_union_pw_multi_aff_empty(space
);
7130 if (isl_union_set_foreach_set(domain
,
7131 &pw_multi_aff_multi_val_on_domain
, &data
) < 0)
7132 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
7133 isl_union_set_free(domain
);
7134 isl_multi_val_free(mv
);
7138 /* Compute the pullback of data->pma by the function represented by "pma2",
7139 * provided the spaces match, and add the results to data->res.
7141 static isl_stat
pullback_entry(void **entry
, void *user
)
7143 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
7144 isl_pw_multi_aff
*pma2
= *entry
;
7146 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
7147 pma2
->dim
, isl_dim_out
))
7150 pma2
= isl_pw_multi_aff_pullback_pw_multi_aff(
7151 isl_pw_multi_aff_copy(data
->pma
),
7152 isl_pw_multi_aff_copy(pma2
));
7154 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
7156 return isl_stat_error
;
7161 /* Compute the pullback of "upma1" by the function represented by "upma2".
7163 __isl_give isl_union_pw_multi_aff
*
7164 isl_union_pw_multi_aff_pullback_union_pw_multi_aff(
7165 __isl_take isl_union_pw_multi_aff
*upma1
,
7166 __isl_take isl_union_pw_multi_aff
*upma2
)
7168 return bin_op(upma1
, upma2
, &pullback_entry
);
7171 /* Check that the domain space of "upa" matches "space".
7173 * Return 0 on success and -1 on error.
7175 * This function is called from isl_multi_union_pw_aff_set_union_pw_aff and
7176 * can in principle never fail since the space "space" is that
7177 * of the isl_multi_union_pw_aff and is a set space such that
7178 * there is no domain space to match.
7180 * We check the parameters and double-check that "space" is
7181 * indeed that of a set.
7183 static int isl_union_pw_aff_check_match_domain_space(
7184 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7186 isl_space
*upa_space
;
7192 match
= isl_space_is_set(space
);
7196 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7197 "expecting set space", return -1);
7199 upa_space
= isl_union_pw_aff_get_space(upa
);
7200 match
= isl_space_match(space
, isl_dim_param
, upa_space
, isl_dim_param
);
7204 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7205 "parameters don't match", goto error
);
7207 isl_space_free(upa_space
);
7210 isl_space_free(upa_space
);
7214 /* Do the parameters of "upa" match those of "space"?
7216 static int isl_union_pw_aff_matching_params(__isl_keep isl_union_pw_aff
*upa
,
7217 __isl_keep isl_space
*space
)
7219 isl_space
*upa_space
;
7225 upa_space
= isl_union_pw_aff_get_space(upa
);
7227 match
= isl_space_match(space
, isl_dim_param
, upa_space
, isl_dim_param
);
7229 isl_space_free(upa_space
);
7233 /* Internal data structure for isl_union_pw_aff_reset_domain_space.
7234 * space represents the new parameters.
7235 * res collects the results.
7237 struct isl_union_pw_aff_reset_params_data
{
7239 isl_union_pw_aff
*res
;
7242 /* Replace the parameters of "pa" by data->space and
7243 * add the result to data->res.
7245 static isl_stat
reset_params(__isl_take isl_pw_aff
*pa
, void *user
)
7247 struct isl_union_pw_aff_reset_params_data
*data
= user
;
7250 space
= isl_pw_aff_get_space(pa
);
7251 space
= isl_space_replace(space
, isl_dim_param
, data
->space
);
7252 pa
= isl_pw_aff_reset_space(pa
, space
);
7253 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7255 return data
->res
? isl_stat_ok
: isl_stat_error
;
7258 /* Replace the domain space of "upa" by "space".
7259 * Since a union expression does not have a (single) domain space,
7260 * "space" is necessarily a parameter space.
7262 * Since the order and the names of the parameters determine
7263 * the hash value, we need to create a new hash table.
7265 static __isl_give isl_union_pw_aff
*isl_union_pw_aff_reset_domain_space(
7266 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_space
*space
)
7268 struct isl_union_pw_aff_reset_params_data data
= { space
};
7271 match
= isl_union_pw_aff_matching_params(upa
, space
);
7273 upa
= isl_union_pw_aff_free(upa
);
7275 isl_space_free(space
);
7279 data
.res
= isl_union_pw_aff_empty(isl_space_copy(space
));
7280 if (isl_union_pw_aff_foreach_pw_aff(upa
, &reset_params
, &data
) < 0)
7281 data
.res
= isl_union_pw_aff_free(data
.res
);
7283 isl_union_pw_aff_free(upa
);
7284 isl_space_free(space
);
7288 /* Replace the entry of isl_union_pw_aff to which "entry" points
7291 static isl_stat
floor_entry(void **entry
, void *user
)
7293 isl_pw_aff
**pa
= (isl_pw_aff
**) entry
;
7295 *pa
= isl_pw_aff_floor(*pa
);
7297 return isl_stat_error
;
7302 /* Given f, return floor(f).
7304 __isl_give isl_union_pw_aff
*isl_union_pw_aff_floor(
7305 __isl_take isl_union_pw_aff
*upa
)
7309 upa
= isl_union_pw_aff_cow(upa
);
7313 ctx
= isl_union_pw_aff_get_ctx(upa
);
7314 if (isl_hash_table_foreach(ctx
, &upa
->table
, &floor_entry
, NULL
) < 0)
7315 upa
= isl_union_pw_aff_free(upa
);
7322 * upa mod m = upa - m * floor(upa/m)
7324 * with m an integer value.
7326 __isl_give isl_union_pw_aff
*isl_union_pw_aff_mod_val(
7327 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_val
*m
)
7329 isl_union_pw_aff
*res
;
7334 if (!isl_val_is_int(m
))
7335 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7336 "expecting integer modulo", goto error
);
7337 if (!isl_val_is_pos(m
))
7338 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7339 "expecting positive modulo", goto error
);
7341 res
= isl_union_pw_aff_copy(upa
);
7342 upa
= isl_union_pw_aff_scale_down_val(upa
, isl_val_copy(m
));
7343 upa
= isl_union_pw_aff_floor(upa
);
7344 upa
= isl_union_pw_aff_scale_val(upa
, m
);
7345 res
= isl_union_pw_aff_sub(res
, upa
);
7350 isl_union_pw_aff_free(upa
);
7354 /* Internal data structure for isl_union_pw_aff_aff_on_domain.
7355 * "aff" is the symbolic value that the resulting isl_union_pw_aff
7357 * "res" collects the results.
7359 struct isl_union_pw_aff_aff_on_domain_data
{
7361 isl_union_pw_aff
*res
;
7364 /* Construct a piecewise affine expression that is equal to data->aff
7365 * on "domain" and add the result to data->res.
7367 static isl_stat
pw_aff_aff_on_domain(__isl_take isl_set
*domain
, void *user
)
7369 struct isl_union_pw_aff_aff_on_domain_data
*data
= user
;
7374 aff
= isl_aff_copy(data
->aff
);
7375 dim
= isl_set_dim(domain
, isl_dim_set
);
7376 aff
= isl_aff_add_dims(aff
, isl_dim_in
, dim
);
7377 aff
= isl_aff_reset_domain_space(aff
, isl_set_get_space(domain
));
7378 pa
= isl_pw_aff_alloc(domain
, aff
);
7379 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7381 return data
->res
? isl_stat_ok
: isl_stat_error
;
7384 /* Internal data structure for isl_union_pw_multi_aff_get_union_pw_aff.
7385 * pos is the output position that needs to be extracted.
7386 * res collects the results.
7388 struct isl_union_pw_multi_aff_get_union_pw_aff_data
{
7390 isl_union_pw_aff
*res
;
7393 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma"
7394 * (assuming it has such a dimension) and add it to data->res.
7396 static isl_stat
get_union_pw_aff(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7398 struct isl_union_pw_multi_aff_get_union_pw_aff_data
*data
= user
;
7403 return isl_stat_error
;
7405 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
7406 if (data
->pos
>= n_out
) {
7407 isl_pw_multi_aff_free(pma
);
7411 pa
= isl_pw_multi_aff_get_pw_aff(pma
, data
->pos
);
7412 isl_pw_multi_aff_free(pma
);
7414 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7416 return data
->res
? isl_stat_ok
: isl_stat_error
;
7419 /* Extract an isl_union_pw_aff corresponding to
7420 * output dimension "pos" of "upma".
7422 __isl_give isl_union_pw_aff
*isl_union_pw_multi_aff_get_union_pw_aff(
7423 __isl_keep isl_union_pw_multi_aff
*upma
, int pos
)
7425 struct isl_union_pw_multi_aff_get_union_pw_aff_data data
;
7432 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7433 "cannot extract at negative position", return NULL
);
7435 space
= isl_union_pw_multi_aff_get_space(upma
);
7436 data
.res
= isl_union_pw_aff_empty(space
);
7438 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
7439 &get_union_pw_aff
, &data
) < 0)
7440 data
.res
= isl_union_pw_aff_free(data
.res
);
7445 /* Return a union piecewise affine expression
7446 * that is equal to "aff" on "domain".
7448 * Construct an isl_pw_aff on each of the sets in "domain" and
7449 * collect the results.
7451 __isl_give isl_union_pw_aff
*isl_union_pw_aff_aff_on_domain(
7452 __isl_take isl_union_set
*domain
, __isl_take isl_aff
*aff
)
7454 struct isl_union_pw_aff_aff_on_domain_data data
;
7457 if (!domain
|| !aff
)
7459 if (!isl_local_space_is_params(aff
->ls
))
7460 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
7461 "expecting parametric expression", goto error
);
7463 space
= isl_union_set_get_space(domain
);
7464 data
.res
= isl_union_pw_aff_empty(space
);
7466 if (isl_union_set_foreach_set(domain
, &pw_aff_aff_on_domain
, &data
) < 0)
7467 data
.res
= isl_union_pw_aff_free(data
.res
);
7468 isl_union_set_free(domain
);
7472 isl_union_set_free(domain
);
7477 /* Internal data structure for isl_union_pw_aff_val_on_domain.
7478 * "v" is the value that the resulting isl_union_pw_aff needs to attain.
7479 * "res" collects the results.
7481 struct isl_union_pw_aff_val_on_domain_data
{
7483 isl_union_pw_aff
*res
;
7486 /* Construct a piecewise affine expression that is equal to data->v
7487 * on "domain" and add the result to data->res.
7489 static isl_stat
pw_aff_val_on_domain(__isl_take isl_set
*domain
, void *user
)
7491 struct isl_union_pw_aff_val_on_domain_data
*data
= user
;
7495 v
= isl_val_copy(data
->v
);
7496 pa
= isl_pw_aff_val_on_domain(domain
, v
);
7497 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7499 return data
->res
? isl_stat_ok
: isl_stat_error
;
7502 /* Return a union piecewise affine expression
7503 * that is equal to "v" on "domain".
7505 * Construct an isl_pw_aff on each of the sets in "domain" and
7506 * collect the results.
7508 __isl_give isl_union_pw_aff
*isl_union_pw_aff_val_on_domain(
7509 __isl_take isl_union_set
*domain
, __isl_take isl_val
*v
)
7511 struct isl_union_pw_aff_val_on_domain_data data
;
7514 space
= isl_union_set_get_space(domain
);
7515 data
.res
= isl_union_pw_aff_empty(space
);
7517 if (isl_union_set_foreach_set(domain
, &pw_aff_val_on_domain
, &data
) < 0)
7518 data
.res
= isl_union_pw_aff_free(data
.res
);
7519 isl_union_set_free(domain
);
7524 /* Construct a piecewise multi affine expression
7525 * that is equal to "pa" and add it to upma.
7527 static isl_stat
pw_multi_aff_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
,
7530 isl_union_pw_multi_aff
**upma
= user
;
7531 isl_pw_multi_aff
*pma
;
7533 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
7534 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
7536 return *upma
? isl_stat_ok
: isl_stat_error
;
7539 /* Construct and return a union piecewise multi affine expression
7540 * that is equal to the given union piecewise affine expression.
7542 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_pw_aff(
7543 __isl_take isl_union_pw_aff
*upa
)
7546 isl_union_pw_multi_aff
*upma
;
7551 space
= isl_union_pw_aff_get_space(upa
);
7552 upma
= isl_union_pw_multi_aff_empty(space
);
7554 if (isl_union_pw_aff_foreach_pw_aff(upa
,
7555 &pw_multi_aff_from_pw_aff_entry
, &upma
) < 0)
7556 upma
= isl_union_pw_multi_aff_free(upma
);
7558 isl_union_pw_aff_free(upa
);
7562 /* Compute the set of elements in the domain of "pa" where it is zero and
7563 * add this set to "uset".
7565 static isl_stat
zero_union_set(__isl_take isl_pw_aff
*pa
, void *user
)
7567 isl_union_set
**uset
= (isl_union_set
**)user
;
7569 *uset
= isl_union_set_add_set(*uset
, isl_pw_aff_zero_set(pa
));
7571 return *uset
? isl_stat_ok
: isl_stat_error
;
7574 /* Return a union set containing those elements in the domain
7575 * of "upa" where it is zero.
7577 __isl_give isl_union_set
*isl_union_pw_aff_zero_union_set(
7578 __isl_take isl_union_pw_aff
*upa
)
7580 isl_union_set
*zero
;
7582 zero
= isl_union_set_empty(isl_union_pw_aff_get_space(upa
));
7583 if (isl_union_pw_aff_foreach_pw_aff(upa
, &zero_union_set
, &zero
) < 0)
7584 zero
= isl_union_set_free(zero
);
7586 isl_union_pw_aff_free(upa
);
7590 /* Convert "pa" to an isl_map and add it to *umap.
7592 static isl_stat
map_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7594 isl_union_map
**umap
= user
;
7597 map
= isl_map_from_pw_aff(pa
);
7598 *umap
= isl_union_map_add_map(*umap
, map
);
7600 return *umap
? isl_stat_ok
: isl_stat_error
;
7603 /* Construct a union map mapping the domain of the union
7604 * piecewise affine expression to its range, with the single output dimension
7605 * equated to the corresponding affine expressions on their cells.
7607 __isl_give isl_union_map
*isl_union_map_from_union_pw_aff(
7608 __isl_take isl_union_pw_aff
*upa
)
7611 isl_union_map
*umap
;
7616 space
= isl_union_pw_aff_get_space(upa
);
7617 umap
= isl_union_map_empty(space
);
7619 if (isl_union_pw_aff_foreach_pw_aff(upa
, &map_from_pw_aff_entry
,
7621 umap
= isl_union_map_free(umap
);
7623 isl_union_pw_aff_free(upa
);
7627 /* Internal data structure for isl_union_pw_aff_pullback_union_pw_multi_aff.
7628 * upma is the function that is plugged in.
7629 * pa is the current part of the function in which upma is plugged in.
7630 * res collects the results.
7632 struct isl_union_pw_aff_pullback_upma_data
{
7633 isl_union_pw_multi_aff
*upma
;
7635 isl_union_pw_aff
*res
;
7638 /* Check if "pma" can be plugged into data->pa.
7639 * If so, perform the pullback and add the result to data->res.
7641 static isl_stat
pa_pb_pma(void **entry
, void *user
)
7643 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7644 isl_pw_multi_aff
*pma
= *entry
;
7647 if (!isl_space_tuple_is_equal(data
->pa
->dim
, isl_dim_in
,
7648 pma
->dim
, isl_dim_out
))
7651 pma
= isl_pw_multi_aff_copy(pma
);
7652 pa
= isl_pw_aff_copy(data
->pa
);
7653 pa
= isl_pw_aff_pullback_pw_multi_aff(pa
, pma
);
7655 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7657 return data
->res
? isl_stat_ok
: isl_stat_error
;
7660 /* Check if any of the elements of data->upma can be plugged into pa,
7661 * add if so add the result to data->res.
7663 static isl_stat
upa_pb_upma(void **entry
, void *user
)
7665 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7667 isl_pw_aff
*pa
= *entry
;
7670 ctx
= isl_union_pw_multi_aff_get_ctx(data
->upma
);
7671 if (isl_hash_table_foreach(ctx
, &data
->upma
->table
,
7672 &pa_pb_pma
, data
) < 0)
7673 return isl_stat_error
;
7678 /* Compute the pullback of "upa" by the function represented by "upma".
7679 * In other words, plug in "upma" in "upa". The result contains
7680 * expressions defined over the domain space of "upma".
7682 * Run over all pairs of elements in "upa" and "upma", perform
7683 * the pullback when appropriate and collect the results.
7684 * If the hash value were based on the domain space rather than
7685 * the function space, then we could run through all elements
7686 * of "upma" and directly pick out the corresponding element of "upa".
7688 __isl_give isl_union_pw_aff
*isl_union_pw_aff_pullback_union_pw_multi_aff(
7689 __isl_take isl_union_pw_aff
*upa
,
7690 __isl_take isl_union_pw_multi_aff
*upma
)
7692 struct isl_union_pw_aff_pullback_upma_data data
= { NULL
, NULL
};
7696 space
= isl_union_pw_multi_aff_get_space(upma
);
7697 upa
= isl_union_pw_aff_align_params(upa
, space
);
7698 space
= isl_union_pw_aff_get_space(upa
);
7699 upma
= isl_union_pw_multi_aff_align_params(upma
, space
);
7704 ctx
= isl_union_pw_aff_get_ctx(upa
);
7706 data
.res
= isl_union_pw_aff_alloc_same_size(upa
);
7707 if (isl_hash_table_foreach(ctx
, &upa
->table
, &upa_pb_upma
, &data
) < 0)
7708 data
.res
= isl_union_pw_aff_free(data
.res
);
7710 isl_union_pw_aff_free(upa
);
7711 isl_union_pw_multi_aff_free(upma
);
7714 isl_union_pw_aff_free(upa
);
7715 isl_union_pw_multi_aff_free(upma
);
7720 #define BASE union_pw_aff
7722 #define DOMBASE union_set
7724 #define NO_MOVE_DIMS
7733 #include <isl_multi_templ.c>
7734 #include <isl_multi_apply_set.c>
7735 #include <isl_multi_apply_union_set.c>
7736 #include <isl_multi_floor.c>
7737 #include <isl_multi_gist.c>
7738 #include <isl_multi_intersect.c>
7740 /* Construct a multiple union piecewise affine expression
7741 * in the given space with value zero in each of the output dimensions.
7743 * Since there is no canonical zero value for
7744 * a union piecewise affine expression, we can only construct
7745 * zero-dimensional "zero" value.
7747 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_zero(
7748 __isl_take isl_space
*space
)
7753 if (!isl_space_is_set(space
))
7754 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7755 "expecting set space", goto error
);
7756 if (isl_space_dim(space
, isl_dim_out
) != 0)
7757 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7758 "expecting 0D space", goto error
);
7760 return isl_multi_union_pw_aff_alloc(space
);
7762 isl_space_free(space
);
7766 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
7767 * with the actual sum on the shared domain and
7768 * the defined expression on the symmetric difference of the domains.
7770 * We simply iterate over the elements in both arguments and
7771 * call isl_union_pw_aff_union_add on each of them.
7773 static __isl_give isl_multi_union_pw_aff
*
7774 isl_multi_union_pw_aff_union_add_aligned(
7775 __isl_take isl_multi_union_pw_aff
*mupa1
,
7776 __isl_take isl_multi_union_pw_aff
*mupa2
)
7778 return isl_multi_union_pw_aff_bin_op(mupa1
, mupa2
,
7779 &isl_union_pw_aff_union_add
);
7782 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
7783 * with the actual sum on the shared domain and
7784 * the defined expression on the symmetric difference of the domains.
7786 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_union_add(
7787 __isl_take isl_multi_union_pw_aff
*mupa1
,
7788 __isl_take isl_multi_union_pw_aff
*mupa2
)
7790 return isl_multi_union_pw_aff_align_params_multi_multi_and(mupa1
, mupa2
,
7791 &isl_multi_union_pw_aff_union_add_aligned
);
7794 /* Construct and return a multi union piecewise affine expression
7795 * that is equal to the given multi affine expression.
7797 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_aff(
7798 __isl_take isl_multi_aff
*ma
)
7800 isl_multi_pw_aff
*mpa
;
7802 mpa
= isl_multi_pw_aff_from_multi_aff(ma
);
7803 return isl_multi_union_pw_aff_from_multi_pw_aff(mpa
);
7806 /* Construct and return a multi union piecewise affine expression
7807 * that is equal to the given multi piecewise affine expression.
7809 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_pw_aff(
7810 __isl_take isl_multi_pw_aff
*mpa
)
7814 isl_multi_union_pw_aff
*mupa
;
7819 space
= isl_multi_pw_aff_get_space(mpa
);
7820 space
= isl_space_range(space
);
7821 mupa
= isl_multi_union_pw_aff_alloc(space
);
7823 n
= isl_multi_pw_aff_dim(mpa
, isl_dim_out
);
7824 for (i
= 0; i
< n
; ++i
) {
7826 isl_union_pw_aff
*upa
;
7828 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
7829 upa
= isl_union_pw_aff_from_pw_aff(pa
);
7830 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7833 isl_multi_pw_aff_free(mpa
);
7838 /* Extract the range space of "pma" and assign it to *space.
7839 * If *space has already been set (through a previous call to this function),
7840 * then check that the range space is the same.
7842 static isl_stat
extract_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7844 isl_space
**space
= user
;
7845 isl_space
*pma_space
;
7848 pma_space
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
7849 isl_pw_multi_aff_free(pma
);
7852 return isl_stat_error
;
7858 equal
= isl_space_is_equal(pma_space
, *space
);
7859 isl_space_free(pma_space
);
7862 return isl_stat_error
;
7864 isl_die(isl_space_get_ctx(*space
), isl_error_invalid
,
7865 "range spaces not the same", return isl_stat_error
);
7869 /* Construct and return a multi union piecewise affine expression
7870 * that is equal to the given union piecewise multi affine expression.
7872 * In order to be able to perform the conversion, the input
7873 * needs to be non-empty and may only involve a single range space.
7875 __isl_give isl_multi_union_pw_aff
*
7876 isl_multi_union_pw_aff_from_union_pw_multi_aff(
7877 __isl_take isl_union_pw_multi_aff
*upma
)
7879 isl_space
*space
= NULL
;
7880 isl_multi_union_pw_aff
*mupa
;
7885 if (isl_union_pw_multi_aff_n_pw_multi_aff(upma
) == 0)
7886 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7887 "cannot extract range space from empty input",
7889 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
, &extract_space
,
7896 n
= isl_space_dim(space
, isl_dim_set
);
7897 mupa
= isl_multi_union_pw_aff_alloc(space
);
7899 for (i
= 0; i
< n
; ++i
) {
7900 isl_union_pw_aff
*upa
;
7902 upa
= isl_union_pw_multi_aff_get_union_pw_aff(upma
, i
);
7903 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7906 isl_union_pw_multi_aff_free(upma
);
7909 isl_space_free(space
);
7910 isl_union_pw_multi_aff_free(upma
);
7914 /* Try and create an isl_multi_union_pw_aff that is equivalent
7915 * to the given isl_union_map.
7916 * The isl_union_map is required to be single-valued in each space.
7917 * Moreover, it cannot be empty and all range spaces need to be the same.
7918 * Otherwise, an error is produced.
7920 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_union_map(
7921 __isl_take isl_union_map
*umap
)
7923 isl_union_pw_multi_aff
*upma
;
7925 upma
= isl_union_pw_multi_aff_from_union_map(umap
);
7926 return isl_multi_union_pw_aff_from_union_pw_multi_aff(upma
);
7929 /* Return a multiple union piecewise affine expression
7930 * that is equal to "mv" on "domain", assuming "domain" and "mv"
7931 * have been aligned.
7933 static __isl_give isl_multi_union_pw_aff
*
7934 isl_multi_union_pw_aff_multi_val_on_domain_aligned(
7935 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7939 isl_multi_union_pw_aff
*mupa
;
7944 n
= isl_multi_val_dim(mv
, isl_dim_set
);
7945 space
= isl_multi_val_get_space(mv
);
7946 mupa
= isl_multi_union_pw_aff_alloc(space
);
7947 for (i
= 0; i
< n
; ++i
) {
7949 isl_union_pw_aff
*upa
;
7951 v
= isl_multi_val_get_val(mv
, i
);
7952 upa
= isl_union_pw_aff_val_on_domain(isl_union_set_copy(domain
),
7954 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7957 isl_union_set_free(domain
);
7958 isl_multi_val_free(mv
);
7961 isl_union_set_free(domain
);
7962 isl_multi_val_free(mv
);
7966 /* Return a multiple union piecewise affine expression
7967 * that is equal to "mv" on "domain".
7969 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_val_on_domain(
7970 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7974 if (isl_space_match(domain
->dim
, isl_dim_param
,
7975 mv
->space
, isl_dim_param
))
7976 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(
7978 domain
= isl_union_set_align_params(domain
,
7979 isl_multi_val_get_space(mv
));
7980 mv
= isl_multi_val_align_params(mv
, isl_union_set_get_space(domain
));
7981 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(domain
, mv
);
7983 isl_union_set_free(domain
);
7984 isl_multi_val_free(mv
);
7988 /* Return a multiple union piecewise affine expression
7989 * that is equal to "ma" on "domain", assuming "domain" and "ma"
7990 * have been aligned.
7992 static __isl_give isl_multi_union_pw_aff
*
7993 isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
7994 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
7998 isl_multi_union_pw_aff
*mupa
;
8003 n
= isl_multi_aff_dim(ma
, isl_dim_set
);
8004 space
= isl_multi_aff_get_space(ma
);
8005 mupa
= isl_multi_union_pw_aff_alloc(space
);
8006 for (i
= 0; i
< n
; ++i
) {
8008 isl_union_pw_aff
*upa
;
8010 aff
= isl_multi_aff_get_aff(ma
, i
);
8011 upa
= isl_union_pw_aff_aff_on_domain(isl_union_set_copy(domain
),
8013 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8016 isl_union_set_free(domain
);
8017 isl_multi_aff_free(ma
);
8020 isl_union_set_free(domain
);
8021 isl_multi_aff_free(ma
);
8025 /* Return a multiple union piecewise affine expression
8026 * that is equal to "ma" on "domain".
8028 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_aff_on_domain(
8029 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8033 if (isl_space_match(domain
->dim
, isl_dim_param
,
8034 ma
->space
, isl_dim_param
))
8035 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
8037 domain
= isl_union_set_align_params(domain
,
8038 isl_multi_aff_get_space(ma
));
8039 ma
= isl_multi_aff_align_params(ma
, isl_union_set_get_space(domain
));
8040 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(domain
, ma
);
8042 isl_union_set_free(domain
);
8043 isl_multi_aff_free(ma
);
8047 /* Return a union set containing those elements in the domains
8048 * of the elements of "mupa" where they are all zero.
8050 __isl_give isl_union_set
*isl_multi_union_pw_aff_zero_union_set(
8051 __isl_take isl_multi_union_pw_aff
*mupa
)
8054 isl_union_pw_aff
*upa
;
8055 isl_union_set
*zero
;
8060 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8062 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8063 "cannot determine zero set "
8064 "of zero-dimensional function", goto error
);
8066 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8067 zero
= isl_union_pw_aff_zero_union_set(upa
);
8069 for (i
= 1; i
< n
; ++i
) {
8070 isl_union_set
*zero_i
;
8072 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8073 zero_i
= isl_union_pw_aff_zero_union_set(upa
);
8075 zero
= isl_union_set_intersect(zero
, zero_i
);
8078 isl_multi_union_pw_aff_free(mupa
);
8081 isl_multi_union_pw_aff_free(mupa
);
8085 /* Construct a union map mapping the shared domain
8086 * of the union piecewise affine expressions to the range of "mupa"
8087 * with each dimension in the range equated to the
8088 * corresponding union piecewise affine expression.
8090 * The input cannot be zero-dimensional as there is
8091 * no way to extract a domain from a zero-dimensional isl_multi_union_pw_aff.
8093 __isl_give isl_union_map
*isl_union_map_from_multi_union_pw_aff(
8094 __isl_take isl_multi_union_pw_aff
*mupa
)
8098 isl_union_map
*umap
;
8099 isl_union_pw_aff
*upa
;
8104 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8106 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8107 "cannot determine domain of zero-dimensional "
8108 "isl_multi_union_pw_aff", goto error
);
8110 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8111 umap
= isl_union_map_from_union_pw_aff(upa
);
8113 for (i
= 1; i
< n
; ++i
) {
8114 isl_union_map
*umap_i
;
8116 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8117 umap_i
= isl_union_map_from_union_pw_aff(upa
);
8118 umap
= isl_union_map_flat_range_product(umap
, umap_i
);
8121 space
= isl_multi_union_pw_aff_get_space(mupa
);
8122 umap
= isl_union_map_reset_range_space(umap
, space
);
8124 isl_multi_union_pw_aff_free(mupa
);
8127 isl_multi_union_pw_aff_free(mupa
);
8131 /* Internal data structure for isl_union_pw_multi_aff_reset_range_space.
8132 * "range" is the space from which to set the range space.
8133 * "res" collects the results.
8135 struct isl_union_pw_multi_aff_reset_range_space_data
{
8137 isl_union_pw_multi_aff
*res
;
8140 /* Replace the range space of "pma" by the range space of data->range and
8141 * add the result to data->res.
8143 static isl_stat
reset_range_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8145 struct isl_union_pw_multi_aff_reset_range_space_data
*data
= user
;
8148 space
= isl_pw_multi_aff_get_space(pma
);
8149 space
= isl_space_domain(space
);
8150 space
= isl_space_extend_domain_with_range(space
,
8151 isl_space_copy(data
->range
));
8152 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
8153 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
8155 return data
->res
? isl_stat_ok
: isl_stat_error
;
8158 /* Replace the range space of all the piecewise affine expressions in "upma" by
8159 * the range space of "space".
8161 * This assumes that all these expressions have the same output dimension.
8163 * Since the spaces of the expressions change, so do their hash values.
8164 * We therefore need to create a new isl_union_pw_multi_aff.
8165 * Note that the hash value is currently computed based on the entire
8166 * space even though there can only be a single expression with a given
8169 static __isl_give isl_union_pw_multi_aff
*
8170 isl_union_pw_multi_aff_reset_range_space(
8171 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_space
*space
)
8173 struct isl_union_pw_multi_aff_reset_range_space_data data
= { space
};
8174 isl_space
*space_upma
;
8176 space_upma
= isl_union_pw_multi_aff_get_space(upma
);
8177 data
.res
= isl_union_pw_multi_aff_empty(space_upma
);
8178 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
8179 &reset_range_space
, &data
) < 0)
8180 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
8182 isl_space_free(space
);
8183 isl_union_pw_multi_aff_free(upma
);
8187 /* Construct and return a union piecewise multi affine expression
8188 * that is equal to the given multi union piecewise affine expression.
8190 * In order to be able to perform the conversion, the input
8191 * needs to have a least one output dimension.
8193 __isl_give isl_union_pw_multi_aff
*
8194 isl_union_pw_multi_aff_from_multi_union_pw_aff(
8195 __isl_take isl_multi_union_pw_aff
*mupa
)
8199 isl_union_pw_multi_aff
*upma
;
8200 isl_union_pw_aff
*upa
;
8205 space
= isl_multi_union_pw_aff_get_space(mupa
);
8207 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8209 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8210 "cannot determine domain of zero-dimensional "
8211 "isl_multi_union_pw_aff", goto error
);
8213 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8214 upma
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8216 for (i
= 1; i
< n
; ++i
) {
8217 isl_union_pw_multi_aff
*upma_i
;
8219 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8220 upma_i
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8221 upma
= isl_union_pw_multi_aff_flat_range_product(upma
, upma_i
);
8224 upma
= isl_union_pw_multi_aff_reset_range_space(upma
, space
);
8226 isl_multi_union_pw_aff_free(mupa
);
8229 isl_multi_union_pw_aff_free(mupa
);
8233 /* Intersect the range of "mupa" with "range".
8234 * That is, keep only those domain elements that have a function value
8237 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_intersect_range(
8238 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_set
*range
)
8240 isl_union_pw_multi_aff
*upma
;
8241 isl_union_set
*domain
;
8246 if (!mupa
|| !range
)
8249 space
= isl_set_get_space(range
);
8250 match
= isl_space_tuple_is_equal(mupa
->space
, isl_dim_set
,
8251 space
, isl_dim_set
);
8252 isl_space_free(space
);
8256 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8257 "space don't match", goto error
);
8258 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8260 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8261 "cannot intersect range of zero-dimensional "
8262 "isl_multi_union_pw_aff", goto error
);
8264 upma
= isl_union_pw_multi_aff_from_multi_union_pw_aff(
8265 isl_multi_union_pw_aff_copy(mupa
));
8266 domain
= isl_union_set_from_set(range
);
8267 domain
= isl_union_set_preimage_union_pw_multi_aff(domain
, upma
);
8268 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, domain
);
8272 isl_multi_union_pw_aff_free(mupa
);
8273 isl_set_free(range
);
8277 /* Return the shared domain of the elements of "mupa".
8279 __isl_give isl_union_set
*isl_multi_union_pw_aff_domain(
8280 __isl_take isl_multi_union_pw_aff
*mupa
)
8283 isl_union_pw_aff
*upa
;
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", goto error
);
8294 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8295 dom
= isl_union_pw_aff_domain(upa
);
8296 for (i
= 1; i
< n
; ++i
) {
8297 isl_union_set
*dom_i
;
8299 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8300 dom_i
= isl_union_pw_aff_domain(upa
);
8301 dom
= isl_union_set_intersect(dom
, dom_i
);
8304 isl_multi_union_pw_aff_free(mupa
);
8307 isl_multi_union_pw_aff_free(mupa
);
8311 /* Apply "aff" to "mupa". The space of "mupa" is equal to the domain of "aff".
8312 * In particular, the spaces have been aligned.
8313 * The result is defined over the shared domain of the elements of "mupa"
8315 * We first extract the parametric constant part of "aff" and
8316 * define that over the shared domain.
8317 * Then we iterate over all input dimensions of "aff" and add the corresponding
8318 * multiples of the elements of "mupa".
8319 * Finally, we consider the integer divisions, calling the function
8320 * recursively to obtain an isl_union_pw_aff corresponding to the
8321 * integer division argument.
8323 static __isl_give isl_union_pw_aff
*multi_union_pw_aff_apply_aff(
8324 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8327 isl_union_pw_aff
*upa
;
8328 isl_union_set
*uset
;
8332 n_in
= isl_aff_dim(aff
, isl_dim_in
);
8333 n_div
= isl_aff_dim(aff
, isl_dim_div
);
8335 uset
= isl_multi_union_pw_aff_domain(isl_multi_union_pw_aff_copy(mupa
));
8336 cst
= isl_aff_copy(aff
);
8337 cst
= isl_aff_drop_dims(cst
, isl_dim_div
, 0, n_div
);
8338 cst
= isl_aff_drop_dims(cst
, isl_dim_in
, 0, n_in
);
8339 cst
= isl_aff_project_domain_on_params(cst
);
8340 upa
= isl_union_pw_aff_aff_on_domain(uset
, cst
);
8342 for (i
= 0; i
< n_in
; ++i
) {
8343 isl_union_pw_aff
*upa_i
;
8345 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
8347 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
8348 upa_i
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8349 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8350 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8353 for (i
= 0; i
< n_div
; ++i
) {
8355 isl_union_pw_aff
*upa_i
;
8357 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
8359 div
= isl_aff_get_div(aff
, i
);
8360 upa_i
= multi_union_pw_aff_apply_aff(
8361 isl_multi_union_pw_aff_copy(mupa
), div
);
8362 upa_i
= isl_union_pw_aff_floor(upa_i
);
8363 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
8364 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8365 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8368 isl_multi_union_pw_aff_free(mupa
);
8374 /* Apply "aff" to "mupa". The space of "mupa" needs to be compatible
8375 * with the domain of "aff".
8376 * Furthermore, the dimension of this space needs to be greater than zero.
8377 * The result is defined over the shared domain of the elements of "mupa"
8379 * We perform these checks and then hand over control to
8380 * multi_union_pw_aff_apply_aff.
8382 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_aff(
8383 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8385 isl_space
*space1
, *space2
;
8388 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8389 isl_aff_get_space(aff
));
8390 aff
= isl_aff_align_params(aff
, isl_multi_union_pw_aff_get_space(mupa
));
8394 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8395 space2
= isl_aff_get_domain_space(aff
);
8396 equal
= isl_space_is_equal(space1
, space2
);
8397 isl_space_free(space1
);
8398 isl_space_free(space2
);
8402 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8403 "spaces don't match", goto error
);
8404 if (isl_aff_dim(aff
, isl_dim_in
) == 0)
8405 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8406 "cannot determine domains", goto error
);
8408 return multi_union_pw_aff_apply_aff(mupa
, aff
);
8410 isl_multi_union_pw_aff_free(mupa
);
8415 /* Apply "ma" to "mupa". The space of "mupa" needs to be compatible
8416 * with the domain of "ma".
8417 * Furthermore, the dimension of this space needs to be greater than zero,
8418 * unless the dimension of the target space of "ma" is also zero.
8419 * The result is defined over the shared domain of the elements of "mupa"
8421 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_multi_aff(
8422 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_multi_aff
*ma
)
8424 isl_space
*space1
, *space2
;
8425 isl_multi_union_pw_aff
*res
;
8429 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8430 isl_multi_aff_get_space(ma
));
8431 ma
= isl_multi_aff_align_params(ma
,
8432 isl_multi_union_pw_aff_get_space(mupa
));
8436 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8437 space2
= isl_multi_aff_get_domain_space(ma
);
8438 equal
= isl_space_is_equal(space1
, space2
);
8439 isl_space_free(space1
);
8440 isl_space_free(space2
);
8444 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8445 "spaces don't match", goto error
);
8446 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
8447 if (isl_multi_aff_dim(ma
, isl_dim_in
) == 0 && n_out
!= 0)
8448 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8449 "cannot determine domains", goto error
);
8451 space1
= isl_space_range(isl_multi_aff_get_space(ma
));
8452 res
= isl_multi_union_pw_aff_alloc(space1
);
8454 for (i
= 0; i
< n_out
; ++i
) {
8456 isl_union_pw_aff
*upa
;
8458 aff
= isl_multi_aff_get_aff(ma
, i
);
8459 upa
= multi_union_pw_aff_apply_aff(
8460 isl_multi_union_pw_aff_copy(mupa
), aff
);
8461 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8464 isl_multi_aff_free(ma
);
8465 isl_multi_union_pw_aff_free(mupa
);
8468 isl_multi_union_pw_aff_free(mupa
);
8469 isl_multi_aff_free(ma
);
8473 /* Apply "pa" to "mupa". The space of "mupa" needs to be compatible
8474 * with the domain of "pa".
8475 * Furthermore, the dimension of this space needs to be greater than zero.
8476 * The result is defined over the shared domain of the elements of "mupa"
8478 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_aff(
8479 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_pw_aff
*pa
)
8483 isl_space
*space
, *space2
;
8484 isl_union_pw_aff
*upa
;
8486 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8487 isl_pw_aff_get_space(pa
));
8488 pa
= isl_pw_aff_align_params(pa
,
8489 isl_multi_union_pw_aff_get_space(mupa
));
8493 space
= isl_multi_union_pw_aff_get_space(mupa
);
8494 space2
= isl_pw_aff_get_domain_space(pa
);
8495 equal
= isl_space_is_equal(space
, space2
);
8496 isl_space_free(space
);
8497 isl_space_free(space2
);
8501 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8502 "spaces don't match", goto error
);
8503 if (isl_pw_aff_dim(pa
, isl_dim_in
) == 0)
8504 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8505 "cannot determine domains", goto error
);
8507 space
= isl_space_params(isl_multi_union_pw_aff_get_space(mupa
));
8508 upa
= isl_union_pw_aff_empty(space
);
8510 for (i
= 0; i
< pa
->n
; ++i
) {
8513 isl_multi_union_pw_aff
*mupa_i
;
8514 isl_union_pw_aff
*upa_i
;
8516 mupa_i
= isl_multi_union_pw_aff_copy(mupa
);
8517 domain
= isl_set_copy(pa
->p
[i
].set
);
8518 mupa_i
= isl_multi_union_pw_aff_intersect_range(mupa_i
, domain
);
8519 aff
= isl_aff_copy(pa
->p
[i
].aff
);
8520 upa_i
= multi_union_pw_aff_apply_aff(mupa_i
, aff
);
8521 upa
= isl_union_pw_aff_union_add(upa
, upa_i
);
8524 isl_multi_union_pw_aff_free(mupa
);
8525 isl_pw_aff_free(pa
);
8528 isl_multi_union_pw_aff_free(mupa
);
8529 isl_pw_aff_free(pa
);
8533 /* Apply "pma" to "mupa". The space of "mupa" needs to be compatible
8534 * with the domain of "pma".
8535 * Furthermore, the dimension of this space needs to be greater than zero,
8536 * unless the dimension of the target space of "pma" is also zero.
8537 * The result is defined over the shared domain of the elements of "mupa"
8539 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_multi_aff(
8540 __isl_take isl_multi_union_pw_aff
*mupa
,
8541 __isl_take isl_pw_multi_aff
*pma
)
8543 isl_space
*space1
, *space2
;
8544 isl_multi_union_pw_aff
*res
;
8548 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8549 isl_pw_multi_aff_get_space(pma
));
8550 pma
= isl_pw_multi_aff_align_params(pma
,
8551 isl_multi_union_pw_aff_get_space(mupa
));
8555 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8556 space2
= isl_pw_multi_aff_get_domain_space(pma
);
8557 equal
= isl_space_is_equal(space1
, space2
);
8558 isl_space_free(space1
);
8559 isl_space_free(space2
);
8563 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8564 "spaces don't match", goto error
);
8565 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
8566 if (isl_pw_multi_aff_dim(pma
, isl_dim_in
) == 0 && n_out
!= 0)
8567 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8568 "cannot determine domains", goto error
);
8570 space1
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
8571 res
= isl_multi_union_pw_aff_alloc(space1
);
8573 for (i
= 0; i
< n_out
; ++i
) {
8575 isl_union_pw_aff
*upa
;
8577 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
8578 upa
= isl_multi_union_pw_aff_apply_pw_aff(
8579 isl_multi_union_pw_aff_copy(mupa
), pa
);
8580 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8583 isl_pw_multi_aff_free(pma
);
8584 isl_multi_union_pw_aff_free(mupa
);
8587 isl_multi_union_pw_aff_free(mupa
);
8588 isl_pw_multi_aff_free(pma
);
8592 /* Compute the pullback of "mupa" by the function represented by "upma".
8593 * In other words, plug in "upma" in "mupa". The result contains
8594 * expressions defined over the domain space of "upma".
8596 * Run over all elements of "mupa" and plug in "upma" in each of them.
8598 __isl_give isl_multi_union_pw_aff
*
8599 isl_multi_union_pw_aff_pullback_union_pw_multi_aff(
8600 __isl_take isl_multi_union_pw_aff
*mupa
,
8601 __isl_take isl_union_pw_multi_aff
*upma
)
8605 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8606 isl_union_pw_multi_aff_get_space(upma
));
8607 upma
= isl_union_pw_multi_aff_align_params(upma
,
8608 isl_multi_union_pw_aff_get_space(mupa
));
8612 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8613 for (i
= 0; i
< n
; ++i
) {
8614 isl_union_pw_aff
*upa
;
8616 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8617 upa
= isl_union_pw_aff_pullback_union_pw_multi_aff(upa
,
8618 isl_union_pw_multi_aff_copy(upma
));
8619 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8622 isl_union_pw_multi_aff_free(upma
);
8625 isl_multi_union_pw_aff_free(mupa
);
8626 isl_union_pw_multi_aff_free(upma
);
8630 /* Extract the sequence of elements in "mupa" with domain space "space"
8631 * (ignoring parameters).
8633 * For the elements of "mupa" that are not defined on the specified space,
8634 * the corresponding element in the result is empty.
8636 __isl_give isl_multi_pw_aff
*isl_multi_union_pw_aff_extract_multi_pw_aff(
8637 __isl_keep isl_multi_union_pw_aff
*mupa
, __isl_take isl_space
*space
)
8640 isl_space
*space_mpa
= NULL
;
8641 isl_multi_pw_aff
*mpa
;
8643 if (!mupa
|| !space
)
8646 space_mpa
= isl_multi_union_pw_aff_get_space(mupa
);
8647 if (!isl_space_match(space_mpa
, isl_dim_param
, space
, isl_dim_param
)) {
8648 space
= isl_space_drop_dims(space
, isl_dim_param
,
8649 0, isl_space_dim(space
, isl_dim_param
));
8650 space
= isl_space_align_params(space
,
8651 isl_space_copy(space_mpa
));
8655 space_mpa
= isl_space_map_from_domain_and_range(isl_space_copy(space
),
8657 mpa
= isl_multi_pw_aff_alloc(space_mpa
);
8659 space
= isl_space_from_domain(space
);
8660 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
8661 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8662 for (i
= 0; i
< n
; ++i
) {
8663 isl_union_pw_aff
*upa
;
8666 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8667 pa
= isl_union_pw_aff_extract_pw_aff(upa
,
8668 isl_space_copy(space
));
8669 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
8670 isl_union_pw_aff_free(upa
);
8673 isl_space_free(space
);
8676 isl_space_free(space_mpa
);
8677 isl_space_free(space
);