2 * Copyright 2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
7 * Use of this software is governed by the MIT license
9 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
10 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
13 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
14 * B.P. 105 - 78153 Le Chesnay, France
17 #include <isl_ctx_private.h>
19 #include <isl_map_private.h>
20 #include <isl_union_map_private.h>
21 #include <isl_aff_private.h>
22 #include <isl_space_private.h>
23 #include <isl_local_space_private.h>
24 #include <isl_vec_private.h>
25 #include <isl_mat_private.h>
26 #include <isl/constraint.h>
29 #include <isl_val_private.h>
30 #include <isl/deprecated/aff_int.h>
31 #include <isl_config.h>
36 #include <isl_list_templ.c>
41 #include <isl_list_templ.c>
44 #define BASE union_pw_aff
46 #include <isl_list_templ.c>
49 #define BASE union_pw_multi_aff
51 #include <isl_list_templ.c>
53 __isl_give isl_aff
*isl_aff_alloc_vec(__isl_take isl_local_space
*ls
,
54 __isl_take isl_vec
*v
)
61 aff
= isl_calloc_type(v
->ctx
, struct isl_aff
);
71 isl_local_space_free(ls
);
76 __isl_give isl_aff
*isl_aff_alloc(__isl_take isl_local_space
*ls
)
85 ctx
= isl_local_space_get_ctx(ls
);
86 if (!isl_local_space_divs_known(ls
))
87 isl_die(ctx
, isl_error_invalid
, "local space has unknown divs",
89 if (!isl_local_space_is_set(ls
))
90 isl_die(ctx
, isl_error_invalid
,
91 "domain of affine expression should be a set",
94 total
= isl_local_space_dim(ls
, isl_dim_all
);
95 v
= isl_vec_alloc(ctx
, 1 + 1 + total
);
96 return isl_aff_alloc_vec(ls
, v
);
98 isl_local_space_free(ls
);
102 __isl_give isl_aff
*isl_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
106 aff
= isl_aff_alloc(ls
);
110 isl_int_set_si(aff
->v
->el
[0], 1);
111 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
116 /* Return a piecewise affine expression defined on the specified domain
117 * that is equal to zero.
119 __isl_give isl_pw_aff
*isl_pw_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
121 return isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls
));
124 /* Return an affine expression defined on the specified domain
125 * that represents NaN.
127 __isl_give isl_aff
*isl_aff_nan_on_domain(__isl_take isl_local_space
*ls
)
131 aff
= isl_aff_alloc(ls
);
135 isl_seq_clr(aff
->v
->el
, aff
->v
->size
);
140 /* Return a piecewise affine expression defined on the specified domain
141 * that represents NaN.
143 __isl_give isl_pw_aff
*isl_pw_aff_nan_on_domain(__isl_take isl_local_space
*ls
)
145 return isl_pw_aff_from_aff(isl_aff_nan_on_domain(ls
));
148 /* Return an affine expression that is equal to "val" on
149 * domain local space "ls".
151 __isl_give isl_aff
*isl_aff_val_on_domain(__isl_take isl_local_space
*ls
,
152 __isl_take isl_val
*val
)
158 if (!isl_val_is_rat(val
))
159 isl_die(isl_val_get_ctx(val
), isl_error_invalid
,
160 "expecting rational value", goto error
);
162 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
166 isl_seq_clr(aff
->v
->el
+ 2, aff
->v
->size
- 2);
167 isl_int_set(aff
->v
->el
[1], val
->n
);
168 isl_int_set(aff
->v
->el
[0], val
->d
);
170 isl_local_space_free(ls
);
174 isl_local_space_free(ls
);
179 /* Return an affine expression that is equal to the specified dimension
182 __isl_give isl_aff
*isl_aff_var_on_domain(__isl_take isl_local_space
*ls
,
183 enum isl_dim_type type
, unsigned pos
)
191 space
= isl_local_space_get_space(ls
);
194 if (isl_space_is_map(space
))
195 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
196 "expecting (parameter) set space", goto error
);
197 if (pos
>= isl_local_space_dim(ls
, type
))
198 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
199 "position out of bounds", goto error
);
201 isl_space_free(space
);
202 aff
= isl_aff_alloc(ls
);
206 pos
+= isl_local_space_offset(aff
->ls
, type
);
208 isl_int_set_si(aff
->v
->el
[0], 1);
209 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
210 isl_int_set_si(aff
->v
->el
[1 + pos
], 1);
214 isl_local_space_free(ls
);
215 isl_space_free(space
);
219 /* Return a piecewise affine expression that is equal to
220 * the specified dimension in "ls".
222 __isl_give isl_pw_aff
*isl_pw_aff_var_on_domain(__isl_take isl_local_space
*ls
,
223 enum isl_dim_type type
, unsigned pos
)
225 return isl_pw_aff_from_aff(isl_aff_var_on_domain(ls
, type
, pos
));
228 __isl_give isl_aff
*isl_aff_copy(__isl_keep isl_aff
*aff
)
237 __isl_give isl_aff
*isl_aff_dup(__isl_keep isl_aff
*aff
)
242 return isl_aff_alloc_vec(isl_local_space_copy(aff
->ls
),
243 isl_vec_copy(aff
->v
));
246 __isl_give isl_aff
*isl_aff_cow(__isl_take isl_aff
*aff
)
254 return isl_aff_dup(aff
);
257 __isl_null isl_aff
*isl_aff_free(__isl_take isl_aff
*aff
)
265 isl_local_space_free(aff
->ls
);
266 isl_vec_free(aff
->v
);
273 isl_ctx
*isl_aff_get_ctx(__isl_keep isl_aff
*aff
)
275 return aff
? isl_local_space_get_ctx(aff
->ls
) : NULL
;
278 /* Return a hash value that digests "aff".
280 uint32_t isl_aff_get_hash(__isl_keep isl_aff
*aff
)
282 uint32_t hash
, ls_hash
, v_hash
;
287 hash
= isl_hash_init();
288 ls_hash
= isl_local_space_get_hash(aff
->ls
);
289 isl_hash_hash(hash
, ls_hash
);
290 v_hash
= isl_vec_get_hash(aff
->v
);
291 isl_hash_hash(hash
, v_hash
);
296 /* Externally, an isl_aff has a map space, but internally, the
297 * ls field corresponds to the domain of that space.
299 int isl_aff_dim(__isl_keep isl_aff
*aff
, enum isl_dim_type type
)
303 if (type
== isl_dim_out
)
305 if (type
== isl_dim_in
)
307 return isl_local_space_dim(aff
->ls
, type
);
310 /* Return the position of the dimension of the given type and name
312 * Return -1 if no such dimension can be found.
314 int isl_aff_find_dim_by_name(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
319 if (type
== isl_dim_out
)
321 if (type
== isl_dim_in
)
323 return isl_local_space_find_dim_by_name(aff
->ls
, type
, name
);
326 __isl_give isl_space
*isl_aff_get_domain_space(__isl_keep isl_aff
*aff
)
328 return aff
? isl_local_space_get_space(aff
->ls
) : NULL
;
331 __isl_give isl_space
*isl_aff_get_space(__isl_keep isl_aff
*aff
)
336 space
= isl_local_space_get_space(aff
->ls
);
337 space
= isl_space_from_domain(space
);
338 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
342 __isl_give isl_local_space
*isl_aff_get_domain_local_space(
343 __isl_keep isl_aff
*aff
)
345 return aff
? isl_local_space_copy(aff
->ls
) : NULL
;
348 __isl_give isl_local_space
*isl_aff_get_local_space(__isl_keep isl_aff
*aff
)
353 ls
= isl_local_space_copy(aff
->ls
);
354 ls
= isl_local_space_from_domain(ls
);
355 ls
= isl_local_space_add_dims(ls
, isl_dim_out
, 1);
359 /* Externally, an isl_aff has a map space, but internally, the
360 * ls field corresponds to the domain of that space.
362 const char *isl_aff_get_dim_name(__isl_keep isl_aff
*aff
,
363 enum isl_dim_type type
, unsigned pos
)
367 if (type
== isl_dim_out
)
369 if (type
== isl_dim_in
)
371 return isl_local_space_get_dim_name(aff
->ls
, type
, pos
);
374 __isl_give isl_aff
*isl_aff_reset_domain_space(__isl_take isl_aff
*aff
,
375 __isl_take isl_space
*dim
)
377 aff
= isl_aff_cow(aff
);
381 aff
->ls
= isl_local_space_reset_space(aff
->ls
, dim
);
383 return isl_aff_free(aff
);
392 /* Reset the space of "aff". This function is called from isl_pw_templ.c
393 * and doesn't know if the space of an element object is represented
394 * directly or through its domain. It therefore passes along both.
396 __isl_give isl_aff
*isl_aff_reset_space_and_domain(__isl_take isl_aff
*aff
,
397 __isl_take isl_space
*space
, __isl_take isl_space
*domain
)
399 isl_space_free(space
);
400 return isl_aff_reset_domain_space(aff
, domain
);
403 /* Reorder the coefficients of the affine expression based
404 * on the given reodering.
405 * The reordering r is assumed to have been extended with the local
408 static __isl_give isl_vec
*vec_reorder(__isl_take isl_vec
*vec
,
409 __isl_take isl_reordering
*r
, int n_div
)
417 res
= isl_vec_alloc(vec
->ctx
,
418 2 + isl_space_dim(r
->dim
, isl_dim_all
) + n_div
);
421 isl_seq_cpy(res
->el
, vec
->el
, 2);
422 isl_seq_clr(res
->el
+ 2, res
->size
- 2);
423 for (i
= 0; i
< r
->len
; ++i
)
424 isl_int_set(res
->el
[2 + r
->pos
[i
]], vec
->el
[2 + i
]);
426 isl_reordering_free(r
);
431 isl_reordering_free(r
);
435 /* Reorder the dimensions of the domain of "aff" according
436 * to the given reordering.
438 __isl_give isl_aff
*isl_aff_realign_domain(__isl_take isl_aff
*aff
,
439 __isl_take isl_reordering
*r
)
441 aff
= isl_aff_cow(aff
);
445 r
= isl_reordering_extend(r
, aff
->ls
->div
->n_row
);
446 aff
->v
= vec_reorder(aff
->v
, isl_reordering_copy(r
),
447 aff
->ls
->div
->n_row
);
448 aff
->ls
= isl_local_space_realign(aff
->ls
, r
);
450 if (!aff
->v
|| !aff
->ls
)
451 return isl_aff_free(aff
);
456 isl_reordering_free(r
);
460 __isl_give isl_aff
*isl_aff_align_params(__isl_take isl_aff
*aff
,
461 __isl_take isl_space
*model
)
466 if (!isl_space_match(aff
->ls
->dim
, isl_dim_param
,
467 model
, isl_dim_param
)) {
470 model
= isl_space_drop_dims(model
, isl_dim_in
,
471 0, isl_space_dim(model
, isl_dim_in
));
472 model
= isl_space_drop_dims(model
, isl_dim_out
,
473 0, isl_space_dim(model
, isl_dim_out
));
474 exp
= isl_parameter_alignment_reordering(aff
->ls
->dim
, model
);
475 exp
= isl_reordering_extend_space(exp
,
476 isl_aff_get_domain_space(aff
));
477 aff
= isl_aff_realign_domain(aff
, exp
);
480 isl_space_free(model
);
483 isl_space_free(model
);
488 /* Is "aff" obviously equal to zero?
490 * If the denominator is zero, then "aff" is not equal to zero.
492 isl_bool
isl_aff_plain_is_zero(__isl_keep isl_aff
*aff
)
495 return isl_bool_error
;
497 if (isl_int_is_zero(aff
->v
->el
[0]))
498 return isl_bool_false
;
499 return isl_seq_first_non_zero(aff
->v
->el
+ 1, aff
->v
->size
- 1) < 0;
502 /* Does "aff" represent NaN?
504 isl_bool
isl_aff_is_nan(__isl_keep isl_aff
*aff
)
507 return isl_bool_error
;
509 return isl_seq_first_non_zero(aff
->v
->el
, 2) < 0;
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 * reduce_div_coefficients performs the same normalization.
1514 * As a special case, floor(NaN) = NaN.
1516 __isl_give isl_aff
*isl_aff_floor(__isl_take isl_aff
*aff
)
1526 if (isl_aff_is_nan(aff
))
1528 if (isl_int_is_one(aff
->v
->el
[0]))
1531 aff
= isl_aff_cow(aff
);
1535 aff
->v
= isl_vec_cow(aff
->v
);
1537 return isl_aff_free(aff
);
1539 if (isl_aff_is_cst(aff
)) {
1540 isl_int_fdiv_q(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1541 isl_int_set_si(aff
->v
->el
[0], 1);
1545 div
= isl_vec_copy(aff
->v
);
1546 div
= isl_vec_cow(div
);
1548 return isl_aff_free(aff
);
1550 ctx
= isl_aff_get_ctx(aff
);
1551 isl_int_fdiv_q(aff
->v
->el
[0], aff
->v
->el
[0], ctx
->two
);
1552 for (i
= 1; i
< aff
->v
->size
; ++i
) {
1553 isl_int_fdiv_r(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1554 isl_int_fdiv_q(aff
->v
->el
[i
], aff
->v
->el
[i
], div
->el
[0]);
1555 if (isl_int_gt(div
->el
[i
], aff
->v
->el
[0])) {
1556 isl_int_sub(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1557 isl_int_add_ui(aff
->v
->el
[i
], aff
->v
->el
[i
], 1);
1561 aff
->ls
= isl_local_space_add_div(aff
->ls
, div
);
1563 return isl_aff_free(aff
);
1565 size
= aff
->v
->size
;
1566 aff
->v
= isl_vec_extend(aff
->v
, size
+ 1);
1568 return isl_aff_free(aff
);
1569 isl_int_set_si(aff
->v
->el
[0], 1);
1570 isl_int_set_si(aff
->v
->el
[size
], 1);
1572 aff
= isl_aff_normalize(aff
);
1579 * aff mod m = aff - m * floor(aff/m)
1581 __isl_give isl_aff
*isl_aff_mod(__isl_take isl_aff
*aff
, isl_int m
)
1585 res
= isl_aff_copy(aff
);
1586 aff
= isl_aff_scale_down(aff
, m
);
1587 aff
= isl_aff_floor(aff
);
1588 aff
= isl_aff_scale(aff
, m
);
1589 res
= isl_aff_sub(res
, aff
);
1596 * aff mod m = aff - m * floor(aff/m)
1598 * with m an integer value.
1600 __isl_give isl_aff
*isl_aff_mod_val(__isl_take isl_aff
*aff
,
1601 __isl_take isl_val
*m
)
1608 if (!isl_val_is_int(m
))
1609 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
1610 "expecting integer modulo", goto error
);
1612 res
= isl_aff_copy(aff
);
1613 aff
= isl_aff_scale_down_val(aff
, isl_val_copy(m
));
1614 aff
= isl_aff_floor(aff
);
1615 aff
= isl_aff_scale_val(aff
, m
);
1616 res
= isl_aff_sub(res
, aff
);
1627 * pwaff mod m = pwaff - m * floor(pwaff/m)
1629 __isl_give isl_pw_aff
*isl_pw_aff_mod(__isl_take isl_pw_aff
*pwaff
, isl_int m
)
1633 res
= isl_pw_aff_copy(pwaff
);
1634 pwaff
= isl_pw_aff_scale_down(pwaff
, m
);
1635 pwaff
= isl_pw_aff_floor(pwaff
);
1636 pwaff
= isl_pw_aff_scale(pwaff
, m
);
1637 res
= isl_pw_aff_sub(res
, pwaff
);
1644 * pa mod m = pa - m * floor(pa/m)
1646 * with m an integer value.
1648 __isl_give isl_pw_aff
*isl_pw_aff_mod_val(__isl_take isl_pw_aff
*pa
,
1649 __isl_take isl_val
*m
)
1653 if (!isl_val_is_int(m
))
1654 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
1655 "expecting integer modulo", goto error
);
1656 pa
= isl_pw_aff_mod(pa
, m
->n
);
1660 isl_pw_aff_free(pa
);
1665 /* Given f, return ceil(f).
1666 * If f is an integer expression, then just return f.
1667 * Otherwise, let f be the expression
1673 * floor((e + m - 1)/m)
1675 * As a special case, ceil(NaN) = NaN.
1677 __isl_give isl_aff
*isl_aff_ceil(__isl_take isl_aff
*aff
)
1682 if (isl_aff_is_nan(aff
))
1684 if (isl_int_is_one(aff
->v
->el
[0]))
1687 aff
= isl_aff_cow(aff
);
1690 aff
->v
= isl_vec_cow(aff
->v
);
1692 return isl_aff_free(aff
);
1694 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1695 isl_int_sub_ui(aff
->v
->el
[1], aff
->v
->el
[1], 1);
1696 aff
= isl_aff_floor(aff
);
1701 /* Apply the expansion computed by isl_merge_divs.
1702 * The expansion itself is given by "exp" while the resulting
1703 * list of divs is given by "div".
1705 __isl_give isl_aff
*isl_aff_expand_divs(__isl_take isl_aff
*aff
,
1706 __isl_take isl_mat
*div
, int *exp
)
1712 aff
= isl_aff_cow(aff
);
1716 old_n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1717 new_n_div
= isl_mat_rows(div
);
1718 offset
= 1 + isl_local_space_offset(aff
->ls
, isl_dim_div
);
1720 aff
->v
= isl_vec_expand(aff
->v
, offset
, old_n_div
, exp
, new_n_div
);
1721 aff
->ls
= isl_local_space_replace_divs(aff
->ls
, div
);
1722 if (!aff
->v
|| !aff
->ls
)
1723 return isl_aff_free(aff
);
1731 /* Add two affine expressions that live in the same local space.
1733 static __isl_give isl_aff
*add_expanded(__isl_take isl_aff
*aff1
,
1734 __isl_take isl_aff
*aff2
)
1738 aff1
= isl_aff_cow(aff1
);
1742 aff1
->v
= isl_vec_cow(aff1
->v
);
1748 isl_int_gcd(gcd
, aff1
->v
->el
[0], aff2
->v
->el
[0]);
1749 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1750 isl_seq_scale(aff1
->v
->el
+ 1, aff1
->v
->el
+ 1, f
, aff1
->v
->size
- 1);
1751 isl_int_divexact(f
, aff1
->v
->el
[0], gcd
);
1752 isl_seq_addmul(aff1
->v
->el
+ 1, f
, aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
1753 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1754 isl_int_mul(aff1
->v
->el
[0], aff1
->v
->el
[0], f
);
1766 /* Return the sum of "aff1" and "aff2".
1768 * If either of the two is NaN, then the result is NaN.
1770 __isl_give isl_aff
*isl_aff_add(__isl_take isl_aff
*aff1
,
1771 __isl_take isl_aff
*aff2
)
1782 ctx
= isl_aff_get_ctx(aff1
);
1783 if (!isl_space_is_equal(aff1
->ls
->dim
, aff2
->ls
->dim
))
1784 isl_die(ctx
, isl_error_invalid
,
1785 "spaces don't match", goto error
);
1787 if (isl_aff_is_nan(aff1
)) {
1791 if (isl_aff_is_nan(aff2
)) {
1796 n_div1
= isl_aff_dim(aff1
, isl_dim_div
);
1797 n_div2
= isl_aff_dim(aff2
, isl_dim_div
);
1798 if (n_div1
== 0 && n_div2
== 0)
1799 return add_expanded(aff1
, aff2
);
1801 exp1
= isl_alloc_array(ctx
, int, n_div1
);
1802 exp2
= isl_alloc_array(ctx
, int, n_div2
);
1803 if ((n_div1
&& !exp1
) || (n_div2
&& !exp2
))
1806 div
= isl_merge_divs(aff1
->ls
->div
, aff2
->ls
->div
, exp1
, exp2
);
1807 aff1
= isl_aff_expand_divs(aff1
, isl_mat_copy(div
), exp1
);
1808 aff2
= isl_aff_expand_divs(aff2
, div
, exp2
);
1812 return add_expanded(aff1
, aff2
);
1821 __isl_give isl_aff
*isl_aff_sub(__isl_take isl_aff
*aff1
,
1822 __isl_take isl_aff
*aff2
)
1824 return isl_aff_add(aff1
, isl_aff_neg(aff2
));
1827 /* Return the result of scaling "aff" by a factor of "f".
1829 * As a special case, f * NaN = NaN.
1831 __isl_give isl_aff
*isl_aff_scale(__isl_take isl_aff
*aff
, isl_int f
)
1837 if (isl_aff_is_nan(aff
))
1840 if (isl_int_is_one(f
))
1843 aff
= isl_aff_cow(aff
);
1846 aff
->v
= isl_vec_cow(aff
->v
);
1848 return isl_aff_free(aff
);
1850 if (isl_int_is_pos(f
) && isl_int_is_divisible_by(aff
->v
->el
[0], f
)) {
1851 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], f
);
1856 isl_int_gcd(gcd
, aff
->v
->el
[0], f
);
1857 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1858 isl_int_divexact(gcd
, f
, gcd
);
1859 isl_seq_scale(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1865 /* Multiple "aff" by "v".
1867 __isl_give isl_aff
*isl_aff_scale_val(__isl_take isl_aff
*aff
,
1868 __isl_take isl_val
*v
)
1873 if (isl_val_is_one(v
)) {
1878 if (!isl_val_is_rat(v
))
1879 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1880 "expecting rational factor", goto error
);
1882 aff
= isl_aff_scale(aff
, v
->n
);
1883 aff
= isl_aff_scale_down(aff
, v
->d
);
1893 /* Return the result of scaling "aff" down by a factor of "f".
1895 * As a special case, NaN/f = NaN.
1897 __isl_give isl_aff
*isl_aff_scale_down(__isl_take isl_aff
*aff
, isl_int f
)
1903 if (isl_aff_is_nan(aff
))
1906 if (isl_int_is_one(f
))
1909 aff
= isl_aff_cow(aff
);
1913 if (isl_int_is_zero(f
))
1914 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1915 "cannot scale down by zero", return isl_aff_free(aff
));
1917 aff
->v
= isl_vec_cow(aff
->v
);
1919 return isl_aff_free(aff
);
1922 isl_seq_gcd(aff
->v
->el
+ 1, aff
->v
->size
- 1, &gcd
);
1923 isl_int_gcd(gcd
, gcd
, f
);
1924 isl_seq_scale_down(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1925 isl_int_divexact(gcd
, f
, gcd
);
1926 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1932 /* Divide "aff" by "v".
1934 __isl_give isl_aff
*isl_aff_scale_down_val(__isl_take isl_aff
*aff
,
1935 __isl_take isl_val
*v
)
1940 if (isl_val_is_one(v
)) {
1945 if (!isl_val_is_rat(v
))
1946 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1947 "expecting rational factor", goto error
);
1948 if (!isl_val_is_pos(v
))
1949 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1950 "factor needs to be positive", goto error
);
1952 aff
= isl_aff_scale(aff
, v
->d
);
1953 aff
= isl_aff_scale_down(aff
, v
->n
);
1963 __isl_give isl_aff
*isl_aff_scale_down_ui(__isl_take isl_aff
*aff
, unsigned f
)
1971 isl_int_set_ui(v
, f
);
1972 aff
= isl_aff_scale_down(aff
, v
);
1978 __isl_give isl_aff
*isl_aff_set_dim_name(__isl_take isl_aff
*aff
,
1979 enum isl_dim_type type
, unsigned pos
, const char *s
)
1981 aff
= isl_aff_cow(aff
);
1984 if (type
== isl_dim_out
)
1985 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1986 "cannot set name of output/set dimension",
1987 return isl_aff_free(aff
));
1988 if (type
== isl_dim_in
)
1990 aff
->ls
= isl_local_space_set_dim_name(aff
->ls
, type
, pos
, s
);
1992 return isl_aff_free(aff
);
1997 __isl_give isl_aff
*isl_aff_set_dim_id(__isl_take isl_aff
*aff
,
1998 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
2000 aff
= isl_aff_cow(aff
);
2003 if (type
== isl_dim_out
)
2004 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2005 "cannot set name of output/set dimension",
2007 if (type
== isl_dim_in
)
2009 aff
->ls
= isl_local_space_set_dim_id(aff
->ls
, type
, pos
, id
);
2011 return isl_aff_free(aff
);
2020 /* Replace the identifier of the input tuple of "aff" by "id".
2021 * type is currently required to be equal to isl_dim_in
2023 __isl_give isl_aff
*isl_aff_set_tuple_id(__isl_take isl_aff
*aff
,
2024 enum isl_dim_type type
, __isl_take isl_id
*id
)
2026 aff
= isl_aff_cow(aff
);
2029 if (type
!= isl_dim_out
)
2030 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2031 "cannot only set id of input tuple", goto error
);
2032 aff
->ls
= isl_local_space_set_tuple_id(aff
->ls
, isl_dim_set
, id
);
2034 return isl_aff_free(aff
);
2043 /* Exploit the equalities in "eq" to simplify the affine expression
2044 * and the expressions of the integer divisions in the local space.
2045 * The integer divisions in this local space are assumed to appear
2046 * as regular dimensions in "eq".
2048 static __isl_give isl_aff
*isl_aff_substitute_equalities_lifted(
2049 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
2057 if (eq
->n_eq
== 0) {
2058 isl_basic_set_free(eq
);
2062 aff
= isl_aff_cow(aff
);
2066 aff
->ls
= isl_local_space_substitute_equalities(aff
->ls
,
2067 isl_basic_set_copy(eq
));
2068 aff
->v
= isl_vec_cow(aff
->v
);
2069 if (!aff
->ls
|| !aff
->v
)
2072 total
= 1 + isl_space_dim(eq
->dim
, isl_dim_all
);
2074 for (i
= 0; i
< eq
->n_eq
; ++i
) {
2075 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
2076 if (j
< 0 || j
== 0 || j
>= total
)
2079 isl_seq_elim(aff
->v
->el
+ 1, eq
->eq
[i
], j
, total
,
2083 isl_basic_set_free(eq
);
2084 aff
= isl_aff_normalize(aff
);
2087 isl_basic_set_free(eq
);
2092 /* Exploit the equalities in "eq" to simplify the affine expression
2093 * and the expressions of the integer divisions in the local space.
2095 __isl_give isl_aff
*isl_aff_substitute_equalities(__isl_take isl_aff
*aff
,
2096 __isl_take isl_basic_set
*eq
)
2102 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2104 eq
= isl_basic_set_add_dims(eq
, isl_dim_set
, n_div
);
2105 return isl_aff_substitute_equalities_lifted(aff
, eq
);
2107 isl_basic_set_free(eq
);
2112 /* Look for equalities among the variables shared by context and aff
2113 * and the integer divisions of aff, if any.
2114 * The equalities are then used to eliminate coefficients and/or integer
2115 * divisions from aff.
2117 __isl_give isl_aff
*isl_aff_gist(__isl_take isl_aff
*aff
,
2118 __isl_take isl_set
*context
)
2120 isl_basic_set
*hull
;
2125 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2127 isl_basic_set
*bset
;
2128 isl_local_space
*ls
;
2129 context
= isl_set_add_dims(context
, isl_dim_set
, n_div
);
2130 ls
= isl_aff_get_domain_local_space(aff
);
2131 bset
= isl_basic_set_from_local_space(ls
);
2132 bset
= isl_basic_set_lift(bset
);
2133 bset
= isl_basic_set_flatten(bset
);
2134 context
= isl_set_intersect(context
,
2135 isl_set_from_basic_set(bset
));
2138 hull
= isl_set_affine_hull(context
);
2139 return isl_aff_substitute_equalities_lifted(aff
, hull
);
2142 isl_set_free(context
);
2146 __isl_give isl_aff
*isl_aff_gist_params(__isl_take isl_aff
*aff
,
2147 __isl_take isl_set
*context
)
2149 isl_set
*dom_context
= isl_set_universe(isl_aff_get_domain_space(aff
));
2150 dom_context
= isl_set_intersect_params(dom_context
, context
);
2151 return isl_aff_gist(aff
, dom_context
);
2154 /* Return a basic set containing those elements in the space
2155 * of aff where it is positive. "rational" should not be set.
2157 * If "aff" is NaN, then it is not positive.
2159 static __isl_give isl_basic_set
*aff_pos_basic_set(__isl_take isl_aff
*aff
,
2162 isl_constraint
*ineq
;
2163 isl_basic_set
*bset
;
2168 if (isl_aff_is_nan(aff
)) {
2169 isl_space
*space
= isl_aff_get_domain_space(aff
);
2171 return isl_basic_set_empty(space
);
2174 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2175 "rational sets not supported", goto error
);
2177 ineq
= isl_inequality_from_aff(aff
);
2178 c
= isl_constraint_get_constant_val(ineq
);
2179 c
= isl_val_sub_ui(c
, 1);
2180 ineq
= isl_constraint_set_constant_val(ineq
, c
);
2182 bset
= isl_basic_set_from_constraint(ineq
);
2183 bset
= isl_basic_set_simplify(bset
);
2190 /* Return a basic set containing those elements in the space
2191 * of aff where it is non-negative.
2192 * If "rational" is set, then return a rational basic set.
2194 * If "aff" is NaN, then it is not non-negative (it's not negative either).
2196 static __isl_give isl_basic_set
*aff_nonneg_basic_set(
2197 __isl_take isl_aff
*aff
, int rational
)
2199 isl_constraint
*ineq
;
2200 isl_basic_set
*bset
;
2204 if (isl_aff_is_nan(aff
)) {
2205 isl_space
*space
= isl_aff_get_domain_space(aff
);
2207 return isl_basic_set_empty(space
);
2210 ineq
= isl_inequality_from_aff(aff
);
2212 bset
= isl_basic_set_from_constraint(ineq
);
2214 bset
= isl_basic_set_set_rational(bset
);
2215 bset
= isl_basic_set_simplify(bset
);
2219 /* Return a basic set containing those elements in the space
2220 * of aff where it is non-negative.
2222 __isl_give isl_basic_set
*isl_aff_nonneg_basic_set(__isl_take isl_aff
*aff
)
2224 return aff_nonneg_basic_set(aff
, 0);
2227 /* Return a basic set containing those elements in the domain space
2228 * of aff where it is negative.
2230 __isl_give isl_basic_set
*isl_aff_neg_basic_set(__isl_take isl_aff
*aff
)
2232 aff
= isl_aff_neg(aff
);
2233 aff
= isl_aff_add_constant_num_si(aff
, -1);
2234 return isl_aff_nonneg_basic_set(aff
);
2237 /* Return a basic set containing those elements in the space
2238 * of aff where it is zero.
2239 * If "rational" is set, then return a rational basic set.
2241 * If "aff" is NaN, then it is not zero.
2243 static __isl_give isl_basic_set
*aff_zero_basic_set(__isl_take isl_aff
*aff
,
2246 isl_constraint
*ineq
;
2247 isl_basic_set
*bset
;
2251 if (isl_aff_is_nan(aff
)) {
2252 isl_space
*space
= isl_aff_get_domain_space(aff
);
2254 return isl_basic_set_empty(space
);
2257 ineq
= isl_equality_from_aff(aff
);
2259 bset
= isl_basic_set_from_constraint(ineq
);
2261 bset
= isl_basic_set_set_rational(bset
);
2262 bset
= isl_basic_set_simplify(bset
);
2266 /* Return a basic set containing those elements in the space
2267 * of aff where it is zero.
2269 __isl_give isl_basic_set
*isl_aff_zero_basic_set(__isl_take isl_aff
*aff
)
2271 return aff_zero_basic_set(aff
, 0);
2274 /* Return a basic set containing those elements in the shared space
2275 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2277 __isl_give isl_basic_set
*isl_aff_ge_basic_set(__isl_take isl_aff
*aff1
,
2278 __isl_take isl_aff
*aff2
)
2280 aff1
= isl_aff_sub(aff1
, aff2
);
2282 return isl_aff_nonneg_basic_set(aff1
);
2285 /* Return a set containing those elements in the shared space
2286 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2288 __isl_give isl_set
*isl_aff_ge_set(__isl_take isl_aff
*aff1
,
2289 __isl_take isl_aff
*aff2
)
2291 return isl_set_from_basic_set(isl_aff_ge_basic_set(aff1
, aff2
));
2294 /* Return a basic set containing those elements in the shared space
2295 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2297 __isl_give isl_basic_set
*isl_aff_le_basic_set(__isl_take isl_aff
*aff1
,
2298 __isl_take isl_aff
*aff2
)
2300 return isl_aff_ge_basic_set(aff2
, aff1
);
2303 /* Return a set containing those elements in the shared space
2304 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2306 __isl_give isl_set
*isl_aff_le_set(__isl_take isl_aff
*aff1
,
2307 __isl_take isl_aff
*aff2
)
2309 return isl_aff_ge_set(aff2
, aff1
);
2312 /* Return a basic set containing those elements in the shared space
2313 * of aff1 and aff2 where aff1 and aff2 are equal.
2315 __isl_give isl_basic_set
*isl_aff_eq_basic_set(__isl_take isl_aff
*aff1
,
2316 __isl_take isl_aff
*aff2
)
2318 aff1
= isl_aff_sub(aff1
, aff2
);
2320 return isl_aff_zero_basic_set(aff1
);
2323 /* Return a set containing those elements in the shared space
2324 * of aff1 and aff2 where aff1 and aff2 are equal.
2326 __isl_give isl_set
*isl_aff_eq_set(__isl_take isl_aff
*aff1
,
2327 __isl_take isl_aff
*aff2
)
2329 return isl_set_from_basic_set(isl_aff_eq_basic_set(aff1
, aff2
));
2332 __isl_give isl_aff
*isl_aff_add_on_domain(__isl_keep isl_set
*dom
,
2333 __isl_take isl_aff
*aff1
, __isl_take isl_aff
*aff2
)
2335 aff1
= isl_aff_add(aff1
, aff2
);
2336 aff1
= isl_aff_gist(aff1
, isl_set_copy(dom
));
2340 int isl_aff_is_empty(__isl_keep isl_aff
*aff
)
2348 /* Check whether the given affine expression has non-zero coefficient
2349 * for any dimension in the given range or if any of these dimensions
2350 * appear with non-zero coefficients in any of the integer divisions
2351 * involved in the affine expression.
2353 isl_bool
isl_aff_involves_dims(__isl_keep isl_aff
*aff
,
2354 enum isl_dim_type type
, unsigned first
, unsigned n
)
2359 isl_bool involves
= isl_bool_false
;
2362 return isl_bool_error
;
2364 return isl_bool_false
;
2366 ctx
= isl_aff_get_ctx(aff
);
2367 if (first
+ n
> isl_aff_dim(aff
, type
))
2368 isl_die(ctx
, isl_error_invalid
,
2369 "range out of bounds", return isl_bool_error
);
2371 active
= isl_local_space_get_active(aff
->ls
, aff
->v
->el
+ 2);
2375 first
+= isl_local_space_offset(aff
->ls
, type
) - 1;
2376 for (i
= 0; i
< n
; ++i
)
2377 if (active
[first
+ i
]) {
2378 involves
= isl_bool_true
;
2387 return isl_bool_error
;
2390 __isl_give isl_aff
*isl_aff_drop_dims(__isl_take isl_aff
*aff
,
2391 enum isl_dim_type type
, unsigned first
, unsigned n
)
2397 if (type
== isl_dim_out
)
2398 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2399 "cannot drop output/set dimension",
2400 return isl_aff_free(aff
));
2401 if (type
== isl_dim_in
)
2403 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2406 ctx
= isl_aff_get_ctx(aff
);
2407 if (first
+ n
> isl_local_space_dim(aff
->ls
, type
))
2408 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
2409 return isl_aff_free(aff
));
2411 aff
= isl_aff_cow(aff
);
2415 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, type
, first
, n
);
2417 return isl_aff_free(aff
);
2419 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2420 aff
->v
= isl_vec_drop_els(aff
->v
, first
, n
);
2422 return isl_aff_free(aff
);
2427 /* Project the domain of the affine expression onto its parameter space.
2428 * The affine expression may not involve any of the domain dimensions.
2430 __isl_give isl_aff
*isl_aff_project_domain_on_params(__isl_take isl_aff
*aff
)
2436 n
= isl_aff_dim(aff
, isl_dim_in
);
2437 involves
= isl_aff_involves_dims(aff
, isl_dim_in
, 0, n
);
2439 return isl_aff_free(aff
);
2441 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2442 "affine expression involves some of the domain dimensions",
2443 return isl_aff_free(aff
));
2444 aff
= isl_aff_drop_dims(aff
, isl_dim_in
, 0, n
);
2445 space
= isl_aff_get_domain_space(aff
);
2446 space
= isl_space_params(space
);
2447 aff
= isl_aff_reset_domain_space(aff
, space
);
2451 __isl_give isl_aff
*isl_aff_insert_dims(__isl_take isl_aff
*aff
,
2452 enum isl_dim_type type
, unsigned first
, unsigned n
)
2458 if (type
== isl_dim_out
)
2459 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2460 "cannot insert output/set dimensions",
2461 return isl_aff_free(aff
));
2462 if (type
== isl_dim_in
)
2464 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2467 ctx
= isl_aff_get_ctx(aff
);
2468 if (first
> isl_local_space_dim(aff
->ls
, type
))
2469 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
2470 return isl_aff_free(aff
));
2472 aff
= isl_aff_cow(aff
);
2476 aff
->ls
= isl_local_space_insert_dims(aff
->ls
, type
, first
, n
);
2478 return isl_aff_free(aff
);
2480 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2481 aff
->v
= isl_vec_insert_zero_els(aff
->v
, first
, n
);
2483 return isl_aff_free(aff
);
2488 __isl_give isl_aff
*isl_aff_add_dims(__isl_take isl_aff
*aff
,
2489 enum isl_dim_type type
, unsigned n
)
2493 pos
= isl_aff_dim(aff
, type
);
2495 return isl_aff_insert_dims(aff
, type
, pos
, n
);
2498 __isl_give isl_pw_aff
*isl_pw_aff_add_dims(__isl_take isl_pw_aff
*pwaff
,
2499 enum isl_dim_type type
, unsigned n
)
2503 pos
= isl_pw_aff_dim(pwaff
, type
);
2505 return isl_pw_aff_insert_dims(pwaff
, type
, pos
, n
);
2508 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "aff"
2509 * to dimensions of "dst_type" at "dst_pos".
2511 * We only support moving input dimensions to parameters and vice versa.
2513 __isl_give isl_aff
*isl_aff_move_dims(__isl_take isl_aff
*aff
,
2514 enum isl_dim_type dst_type
, unsigned dst_pos
,
2515 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2523 !isl_local_space_is_named_or_nested(aff
->ls
, src_type
) &&
2524 !isl_local_space_is_named_or_nested(aff
->ls
, dst_type
))
2527 if (dst_type
== isl_dim_out
|| src_type
== isl_dim_out
)
2528 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2529 "cannot move output/set dimension",
2530 return isl_aff_free(aff
));
2531 if (dst_type
== isl_dim_div
|| src_type
== isl_dim_div
)
2532 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2533 "cannot move divs", return isl_aff_free(aff
));
2534 if (dst_type
== isl_dim_in
)
2535 dst_type
= isl_dim_set
;
2536 if (src_type
== isl_dim_in
)
2537 src_type
= isl_dim_set
;
2539 if (src_pos
+ n
> isl_local_space_dim(aff
->ls
, src_type
))
2540 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2541 "range out of bounds", return isl_aff_free(aff
));
2542 if (dst_type
== src_type
)
2543 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2544 "moving dims within the same type not supported",
2545 return isl_aff_free(aff
));
2547 aff
= isl_aff_cow(aff
);
2551 g_src_pos
= 1 + isl_local_space_offset(aff
->ls
, src_type
) + src_pos
;
2552 g_dst_pos
= 1 + isl_local_space_offset(aff
->ls
, dst_type
) + dst_pos
;
2553 if (dst_type
> src_type
)
2556 aff
->v
= isl_vec_move_els(aff
->v
, g_dst_pos
, g_src_pos
, n
);
2557 aff
->ls
= isl_local_space_move_dims(aff
->ls
, dst_type
, dst_pos
,
2558 src_type
, src_pos
, n
);
2559 if (!aff
->v
|| !aff
->ls
)
2560 return isl_aff_free(aff
);
2562 aff
= sort_divs(aff
);
2567 __isl_give isl_pw_aff
*isl_pw_aff_from_aff(__isl_take isl_aff
*aff
)
2569 isl_set
*dom
= isl_set_universe(isl_aff_get_domain_space(aff
));
2570 return isl_pw_aff_alloc(dom
, aff
);
2573 #define isl_aff_involves_nan isl_aff_is_nan
2576 #define PW isl_pw_aff
2580 #define EL_IS_ZERO is_empty
2584 #define IS_ZERO is_empty
2587 #undef DEFAULT_IS_ZERO
2588 #define DEFAULT_IS_ZERO 0
2595 #include <isl_pw_templ.c>
2596 #include <isl_pw_hash.c>
2597 #include <isl_pw_union_opt.c>
2600 #define UNION isl_union_pw_aff
2602 #define PART isl_pw_aff
2604 #define PARTS pw_aff
2606 #include <isl_union_single.c>
2607 #include <isl_union_neg.c>
2609 static __isl_give isl_set
*align_params_pw_pw_set_and(
2610 __isl_take isl_pw_aff
*pwaff1
, __isl_take isl_pw_aff
*pwaff2
,
2611 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
2612 __isl_take isl_pw_aff
*pwaff2
))
2614 if (!pwaff1
|| !pwaff2
)
2616 if (isl_space_match(pwaff1
->dim
, isl_dim_param
,
2617 pwaff2
->dim
, isl_dim_param
))
2618 return fn(pwaff1
, pwaff2
);
2619 if (!isl_space_has_named_params(pwaff1
->dim
) ||
2620 !isl_space_has_named_params(pwaff2
->dim
))
2621 isl_die(isl_pw_aff_get_ctx(pwaff1
), isl_error_invalid
,
2622 "unaligned unnamed parameters", goto error
);
2623 pwaff1
= isl_pw_aff_align_params(pwaff1
, isl_pw_aff_get_space(pwaff2
));
2624 pwaff2
= isl_pw_aff_align_params(pwaff2
, isl_pw_aff_get_space(pwaff1
));
2625 return fn(pwaff1
, pwaff2
);
2627 isl_pw_aff_free(pwaff1
);
2628 isl_pw_aff_free(pwaff2
);
2632 /* Align the parameters of the to isl_pw_aff arguments and
2633 * then apply a function "fn" on them that returns an isl_map.
2635 static __isl_give isl_map
*align_params_pw_pw_map_and(
2636 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
2637 __isl_give isl_map
*(*fn
)(__isl_take isl_pw_aff
*pa1
,
2638 __isl_take isl_pw_aff
*pa2
))
2642 if (isl_space_match(pa1
->dim
, isl_dim_param
, pa2
->dim
, isl_dim_param
))
2643 return fn(pa1
, pa2
);
2644 if (!isl_space_has_named_params(pa1
->dim
) ||
2645 !isl_space_has_named_params(pa2
->dim
))
2646 isl_die(isl_pw_aff_get_ctx(pa1
), isl_error_invalid
,
2647 "unaligned unnamed parameters", goto error
);
2648 pa1
= isl_pw_aff_align_params(pa1
, isl_pw_aff_get_space(pa2
));
2649 pa2
= isl_pw_aff_align_params(pa2
, isl_pw_aff_get_space(pa1
));
2650 return fn(pa1
, pa2
);
2652 isl_pw_aff_free(pa1
);
2653 isl_pw_aff_free(pa2
);
2657 /* Compute a piecewise quasi-affine expression with a domain that
2658 * is the union of those of pwaff1 and pwaff2 and such that on each
2659 * cell, the quasi-affine expression is the maximum of those of pwaff1
2660 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2661 * cell, then the associated expression is the defined one.
2663 static __isl_give isl_pw_aff
*pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2664 __isl_take isl_pw_aff
*pwaff2
)
2666 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_ge_set
);
2669 __isl_give isl_pw_aff
*isl_pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2670 __isl_take isl_pw_aff
*pwaff2
)
2672 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2676 /* Compute a piecewise quasi-affine expression with a domain that
2677 * is the union of those of pwaff1 and pwaff2 and such that on each
2678 * cell, the quasi-affine expression is the minimum of those of pwaff1
2679 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2680 * cell, then the associated expression is the defined one.
2682 static __isl_give isl_pw_aff
*pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2683 __isl_take isl_pw_aff
*pwaff2
)
2685 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_le_set
);
2688 __isl_give isl_pw_aff
*isl_pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2689 __isl_take isl_pw_aff
*pwaff2
)
2691 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2695 __isl_give isl_pw_aff
*isl_pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
2696 __isl_take isl_pw_aff
*pwaff2
, int max
)
2699 return isl_pw_aff_union_max(pwaff1
, pwaff2
);
2701 return isl_pw_aff_union_min(pwaff1
, pwaff2
);
2704 /* Construct a map with as domain the domain of pwaff and
2705 * one-dimensional range corresponding to the affine expressions.
2707 static __isl_give isl_map
*map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2716 dim
= isl_pw_aff_get_space(pwaff
);
2717 map
= isl_map_empty(dim
);
2719 for (i
= 0; i
< pwaff
->n
; ++i
) {
2720 isl_basic_map
*bmap
;
2723 bmap
= isl_basic_map_from_aff(isl_aff_copy(pwaff
->p
[i
].aff
));
2724 map_i
= isl_map_from_basic_map(bmap
);
2725 map_i
= isl_map_intersect_domain(map_i
,
2726 isl_set_copy(pwaff
->p
[i
].set
));
2727 map
= isl_map_union_disjoint(map
, map_i
);
2730 isl_pw_aff_free(pwaff
);
2735 /* Construct a map with as domain the domain of pwaff and
2736 * one-dimensional range corresponding to the affine expressions.
2738 __isl_give isl_map
*isl_map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2742 if (isl_space_is_set(pwaff
->dim
))
2743 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2744 "space of input is not a map", goto error
);
2745 return map_from_pw_aff(pwaff
);
2747 isl_pw_aff_free(pwaff
);
2751 /* Construct a one-dimensional set with as parameter domain
2752 * the domain of pwaff and the single set dimension
2753 * corresponding to the affine expressions.
2755 __isl_give isl_set
*isl_set_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2759 if (!isl_space_is_set(pwaff
->dim
))
2760 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2761 "space of input is not a set", goto error
);
2762 return map_from_pw_aff(pwaff
);
2764 isl_pw_aff_free(pwaff
);
2768 /* Return a set containing those elements in the domain
2769 * of "pwaff" where it satisfies "fn" (if complement is 0) or
2770 * does not satisfy "fn" (if complement is 1).
2772 * The pieces with a NaN never belong to the result since
2773 * NaN does not satisfy any property.
2775 static __isl_give isl_set
*pw_aff_locus(__isl_take isl_pw_aff
*pwaff
,
2776 __isl_give isl_basic_set
*(*fn
)(__isl_take isl_aff
*aff
, int rational
),
2785 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
2787 for (i
= 0; i
< pwaff
->n
; ++i
) {
2788 isl_basic_set
*bset
;
2789 isl_set
*set_i
, *locus
;
2792 if (isl_aff_is_nan(pwaff
->p
[i
].aff
))
2795 rational
= isl_set_has_rational(pwaff
->p
[i
].set
);
2796 bset
= fn(isl_aff_copy(pwaff
->p
[i
].aff
), rational
);
2797 locus
= isl_set_from_basic_set(bset
);
2798 set_i
= isl_set_copy(pwaff
->p
[i
].set
);
2800 set_i
= isl_set_subtract(set_i
, locus
);
2802 set_i
= isl_set_intersect(set_i
, locus
);
2803 set
= isl_set_union_disjoint(set
, set_i
);
2806 isl_pw_aff_free(pwaff
);
2811 /* Return a set containing those elements in the domain
2812 * of "pa" where it is positive.
2814 __isl_give isl_set
*isl_pw_aff_pos_set(__isl_take isl_pw_aff
*pa
)
2816 return pw_aff_locus(pa
, &aff_pos_basic_set
, 0);
2819 /* Return a set containing those elements in the domain
2820 * of pwaff where it is non-negative.
2822 __isl_give isl_set
*isl_pw_aff_nonneg_set(__isl_take isl_pw_aff
*pwaff
)
2824 return pw_aff_locus(pwaff
, &aff_nonneg_basic_set
, 0);
2827 /* Return a set containing those elements in the domain
2828 * of pwaff where it is zero.
2830 __isl_give isl_set
*isl_pw_aff_zero_set(__isl_take isl_pw_aff
*pwaff
)
2832 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 0);
2835 /* Return a set containing those elements in the domain
2836 * of pwaff where it is not zero.
2838 __isl_give isl_set
*isl_pw_aff_non_zero_set(__isl_take isl_pw_aff
*pwaff
)
2840 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 1);
2843 /* Return a set containing those elements in the shared domain
2844 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
2846 * We compute the difference on the shared domain and then construct
2847 * the set of values where this difference is non-negative.
2848 * If strict is set, we first subtract 1 from the difference.
2849 * If equal is set, we only return the elements where pwaff1 and pwaff2
2852 static __isl_give isl_set
*pw_aff_gte_set(__isl_take isl_pw_aff
*pwaff1
,
2853 __isl_take isl_pw_aff
*pwaff2
, int strict
, int equal
)
2855 isl_set
*set1
, *set2
;
2857 set1
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
));
2858 set2
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
));
2859 set1
= isl_set_intersect(set1
, set2
);
2860 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, isl_set_copy(set1
));
2861 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, isl_set_copy(set1
));
2862 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_neg(pwaff2
));
2865 isl_space
*dim
= isl_set_get_space(set1
);
2867 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2868 aff
= isl_aff_add_constant_si(aff
, -1);
2869 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_alloc(set1
, aff
));
2874 return isl_pw_aff_zero_set(pwaff1
);
2875 return isl_pw_aff_nonneg_set(pwaff1
);
2878 /* Return a set containing those elements in the shared domain
2879 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
2881 static __isl_give isl_set
*pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2882 __isl_take isl_pw_aff
*pwaff2
)
2884 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 1);
2887 __isl_give isl_set
*isl_pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2888 __isl_take isl_pw_aff
*pwaff2
)
2890 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_eq_set
);
2893 /* Return a set containing those elements in the shared domain
2894 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
2896 static __isl_give isl_set
*pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2897 __isl_take isl_pw_aff
*pwaff2
)
2899 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 0);
2902 __isl_give isl_set
*isl_pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2903 __isl_take isl_pw_aff
*pwaff2
)
2905 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ge_set
);
2908 /* Return a set containing those elements in the shared domain
2909 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
2911 static __isl_give isl_set
*pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2912 __isl_take isl_pw_aff
*pwaff2
)
2914 return pw_aff_gte_set(pwaff1
, pwaff2
, 1, 0);
2917 __isl_give isl_set
*isl_pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2918 __isl_take isl_pw_aff
*pwaff2
)
2920 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_gt_set
);
2923 __isl_give isl_set
*isl_pw_aff_le_set(__isl_take isl_pw_aff
*pwaff1
,
2924 __isl_take isl_pw_aff
*pwaff2
)
2926 return isl_pw_aff_ge_set(pwaff2
, pwaff1
);
2929 __isl_give isl_set
*isl_pw_aff_lt_set(__isl_take isl_pw_aff
*pwaff1
,
2930 __isl_take isl_pw_aff
*pwaff2
)
2932 return isl_pw_aff_gt_set(pwaff2
, pwaff1
);
2935 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2936 * where the function values are ordered in the same way as "order",
2937 * which returns a set in the shared domain of its two arguments.
2938 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
2940 * Let "pa1" and "pa2" be defined on domains A and B respectively.
2941 * We first pull back the two functions such that they are defined on
2942 * the domain [A -> B]. Then we apply "order", resulting in a set
2943 * in the space [A -> B]. Finally, we unwrap this set to obtain
2944 * a map in the space A -> B.
2946 static __isl_give isl_map
*isl_pw_aff_order_map_aligned(
2947 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
2948 __isl_give isl_set
*(*order
)(__isl_take isl_pw_aff
*pa1
,
2949 __isl_take isl_pw_aff
*pa2
))
2951 isl_space
*space1
, *space2
;
2955 space1
= isl_space_domain(isl_pw_aff_get_space(pa1
));
2956 space2
= isl_space_domain(isl_pw_aff_get_space(pa2
));
2957 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
2958 ma
= isl_multi_aff_domain_map(isl_space_copy(space1
));
2959 pa1
= isl_pw_aff_pullback_multi_aff(pa1
, ma
);
2960 ma
= isl_multi_aff_range_map(space1
);
2961 pa2
= isl_pw_aff_pullback_multi_aff(pa2
, ma
);
2962 set
= order(pa1
, pa2
);
2964 return isl_set_unwrap(set
);
2967 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2968 * where the function values are equal.
2969 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
2971 static __isl_give isl_map
*isl_pw_aff_eq_map_aligned(__isl_take isl_pw_aff
*pa1
,
2972 __isl_take isl_pw_aff
*pa2
)
2974 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_eq_set
);
2977 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2978 * where the function values are equal.
2980 __isl_give isl_map
*isl_pw_aff_eq_map(__isl_take isl_pw_aff
*pa1
,
2981 __isl_take isl_pw_aff
*pa2
)
2983 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_eq_map_aligned
);
2986 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2987 * where the function value of "pa1" is less than the function value of "pa2".
2988 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
2990 static __isl_give isl_map
*isl_pw_aff_lt_map_aligned(__isl_take isl_pw_aff
*pa1
,
2991 __isl_take isl_pw_aff
*pa2
)
2993 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_lt_set
);
2996 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2997 * where the function value of "pa1" is less than the function value of "pa2".
2999 __isl_give isl_map
*isl_pw_aff_lt_map(__isl_take isl_pw_aff
*pa1
,
3000 __isl_take isl_pw_aff
*pa2
)
3002 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_lt_map_aligned
);
3005 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3006 * where the function value of "pa1" is greater than the function value
3008 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3010 static __isl_give isl_map
*isl_pw_aff_gt_map_aligned(__isl_take isl_pw_aff
*pa1
,
3011 __isl_take isl_pw_aff
*pa2
)
3013 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_gt_set
);
3016 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3017 * where the function value of "pa1" is greater than the function value
3020 __isl_give isl_map
*isl_pw_aff_gt_map(__isl_take isl_pw_aff
*pa1
,
3021 __isl_take isl_pw_aff
*pa2
)
3023 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_gt_map_aligned
);
3026 /* Return a set containing those elements in the shared domain
3027 * of the elements of list1 and list2 where each element in list1
3028 * has the relation specified by "fn" with each element in list2.
3030 static __isl_give isl_set
*pw_aff_list_set(__isl_take isl_pw_aff_list
*list1
,
3031 __isl_take isl_pw_aff_list
*list2
,
3032 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3033 __isl_take isl_pw_aff
*pwaff2
))
3039 if (!list1
|| !list2
)
3042 ctx
= isl_pw_aff_list_get_ctx(list1
);
3043 if (list1
->n
< 1 || list2
->n
< 1)
3044 isl_die(ctx
, isl_error_invalid
,
3045 "list should contain at least one element", goto error
);
3047 set
= isl_set_universe(isl_pw_aff_get_domain_space(list1
->p
[0]));
3048 for (i
= 0; i
< list1
->n
; ++i
)
3049 for (j
= 0; j
< list2
->n
; ++j
) {
3052 set_ij
= fn(isl_pw_aff_copy(list1
->p
[i
]),
3053 isl_pw_aff_copy(list2
->p
[j
]));
3054 set
= isl_set_intersect(set
, set_ij
);
3057 isl_pw_aff_list_free(list1
);
3058 isl_pw_aff_list_free(list2
);
3061 isl_pw_aff_list_free(list1
);
3062 isl_pw_aff_list_free(list2
);
3066 /* Return a set containing those elements in the shared domain
3067 * of the elements of list1 and list2 where each element in list1
3068 * is equal to each element in list2.
3070 __isl_give isl_set
*isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list
*list1
,
3071 __isl_take isl_pw_aff_list
*list2
)
3073 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_eq_set
);
3076 __isl_give isl_set
*isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list
*list1
,
3077 __isl_take isl_pw_aff_list
*list2
)
3079 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ne_set
);
3082 /* Return a set containing those elements in the shared domain
3083 * of the elements of list1 and list2 where each element in list1
3084 * is less than or equal to each element in list2.
3086 __isl_give isl_set
*isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list
*list1
,
3087 __isl_take isl_pw_aff_list
*list2
)
3089 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_le_set
);
3092 __isl_give isl_set
*isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list
*list1
,
3093 __isl_take isl_pw_aff_list
*list2
)
3095 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_lt_set
);
3098 __isl_give isl_set
*isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list
*list1
,
3099 __isl_take isl_pw_aff_list
*list2
)
3101 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ge_set
);
3104 __isl_give isl_set
*isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list
*list1
,
3105 __isl_take isl_pw_aff_list
*list2
)
3107 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_gt_set
);
3111 /* Return a set containing those elements in the shared domain
3112 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
3114 static __isl_give isl_set
*pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3115 __isl_take isl_pw_aff
*pwaff2
)
3117 isl_set
*set_lt
, *set_gt
;
3119 set_lt
= isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1
),
3120 isl_pw_aff_copy(pwaff2
));
3121 set_gt
= isl_pw_aff_gt_set(pwaff1
, pwaff2
);
3122 return isl_set_union_disjoint(set_lt
, set_gt
);
3125 __isl_give isl_set
*isl_pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3126 __isl_take isl_pw_aff
*pwaff2
)
3128 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ne_set
);
3131 __isl_give isl_pw_aff
*isl_pw_aff_scale_down(__isl_take isl_pw_aff
*pwaff
,
3136 if (isl_int_is_one(v
))
3138 if (!isl_int_is_pos(v
))
3139 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
3140 "factor needs to be positive",
3141 return isl_pw_aff_free(pwaff
));
3142 pwaff
= isl_pw_aff_cow(pwaff
);
3148 for (i
= 0; i
< pwaff
->n
; ++i
) {
3149 pwaff
->p
[i
].aff
= isl_aff_scale_down(pwaff
->p
[i
].aff
, v
);
3150 if (!pwaff
->p
[i
].aff
)
3151 return isl_pw_aff_free(pwaff
);
3157 __isl_give isl_pw_aff
*isl_pw_aff_floor(__isl_take isl_pw_aff
*pwaff
)
3161 pwaff
= isl_pw_aff_cow(pwaff
);
3167 for (i
= 0; i
< pwaff
->n
; ++i
) {
3168 pwaff
->p
[i
].aff
= isl_aff_floor(pwaff
->p
[i
].aff
);
3169 if (!pwaff
->p
[i
].aff
)
3170 return isl_pw_aff_free(pwaff
);
3176 __isl_give isl_pw_aff
*isl_pw_aff_ceil(__isl_take isl_pw_aff
*pwaff
)
3180 pwaff
= isl_pw_aff_cow(pwaff
);
3186 for (i
= 0; i
< pwaff
->n
; ++i
) {
3187 pwaff
->p
[i
].aff
= isl_aff_ceil(pwaff
->p
[i
].aff
);
3188 if (!pwaff
->p
[i
].aff
)
3189 return isl_pw_aff_free(pwaff
);
3195 /* Assuming that "cond1" and "cond2" are disjoint,
3196 * return an affine expression that is equal to pwaff1 on cond1
3197 * and to pwaff2 on cond2.
3199 static __isl_give isl_pw_aff
*isl_pw_aff_select(
3200 __isl_take isl_set
*cond1
, __isl_take isl_pw_aff
*pwaff1
,
3201 __isl_take isl_set
*cond2
, __isl_take isl_pw_aff
*pwaff2
)
3203 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, cond1
);
3204 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, cond2
);
3206 return isl_pw_aff_add_disjoint(pwaff1
, pwaff2
);
3209 /* Return an affine expression that is equal to pwaff_true for elements
3210 * where "cond" is non-zero and to pwaff_false for elements where "cond"
3212 * That is, return cond ? pwaff_true : pwaff_false;
3214 * If "cond" involves and NaN, then we conservatively return a NaN
3215 * on its entire domain. In principle, we could consider the pieces
3216 * where it is NaN separately from those where it is not.
3218 * If "pwaff_true" and "pwaff_false" are obviously equal to each other,
3219 * then only use the domain of "cond" to restrict the domain.
3221 __isl_give isl_pw_aff
*isl_pw_aff_cond(__isl_take isl_pw_aff
*cond
,
3222 __isl_take isl_pw_aff
*pwaff_true
, __isl_take isl_pw_aff
*pwaff_false
)
3224 isl_set
*cond_true
, *cond_false
;
3229 if (isl_pw_aff_involves_nan(cond
)) {
3230 isl_space
*space
= isl_pw_aff_get_domain_space(cond
);
3231 isl_local_space
*ls
= isl_local_space_from_space(space
);
3232 isl_pw_aff_free(cond
);
3233 isl_pw_aff_free(pwaff_true
);
3234 isl_pw_aff_free(pwaff_false
);
3235 return isl_pw_aff_nan_on_domain(ls
);
3238 pwaff_true
= isl_pw_aff_align_params(pwaff_true
,
3239 isl_pw_aff_get_space(pwaff_false
));
3240 pwaff_false
= isl_pw_aff_align_params(pwaff_false
,
3241 isl_pw_aff_get_space(pwaff_true
));
3242 equal
= isl_pw_aff_plain_is_equal(pwaff_true
, pwaff_false
);
3248 dom
= isl_set_coalesce(isl_pw_aff_domain(cond
));
3249 isl_pw_aff_free(pwaff_false
);
3250 return isl_pw_aff_intersect_domain(pwaff_true
, dom
);
3253 cond_true
= isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond
));
3254 cond_false
= isl_pw_aff_zero_set(cond
);
3255 return isl_pw_aff_select(cond_true
, pwaff_true
,
3256 cond_false
, pwaff_false
);
3258 isl_pw_aff_free(cond
);
3259 isl_pw_aff_free(pwaff_true
);
3260 isl_pw_aff_free(pwaff_false
);
3264 isl_bool
isl_aff_is_cst(__isl_keep isl_aff
*aff
)
3267 return isl_bool_error
;
3269 return isl_seq_first_non_zero(aff
->v
->el
+ 2, aff
->v
->size
- 2) == -1;
3272 /* Check whether pwaff is a piecewise constant.
3274 isl_bool
isl_pw_aff_is_cst(__isl_keep isl_pw_aff
*pwaff
)
3279 return isl_bool_error
;
3281 for (i
= 0; i
< pwaff
->n
; ++i
) {
3282 isl_bool is_cst
= isl_aff_is_cst(pwaff
->p
[i
].aff
);
3283 if (is_cst
< 0 || !is_cst
)
3287 return isl_bool_true
;
3290 /* Are all elements of "mpa" piecewise constants?
3292 isl_bool
isl_multi_pw_aff_is_cst(__isl_keep isl_multi_pw_aff
*mpa
)
3297 return isl_bool_error
;
3299 for (i
= 0; i
< mpa
->n
; ++i
) {
3300 isl_bool is_cst
= isl_pw_aff_is_cst(mpa
->p
[i
]);
3301 if (is_cst
< 0 || !is_cst
)
3305 return isl_bool_true
;
3308 /* Return the product of "aff1" and "aff2".
3310 * If either of the two is NaN, then the result is NaN.
3312 * Otherwise, at least one of "aff1" or "aff2" needs to be a constant.
3314 __isl_give isl_aff
*isl_aff_mul(__isl_take isl_aff
*aff1
,
3315 __isl_take isl_aff
*aff2
)
3320 if (isl_aff_is_nan(aff1
)) {
3324 if (isl_aff_is_nan(aff2
)) {
3329 if (!isl_aff_is_cst(aff2
) && isl_aff_is_cst(aff1
))
3330 return isl_aff_mul(aff2
, aff1
);
3332 if (!isl_aff_is_cst(aff2
))
3333 isl_die(isl_aff_get_ctx(aff1
), isl_error_invalid
,
3334 "at least one affine expression should be constant",
3337 aff1
= isl_aff_cow(aff1
);
3341 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[1]);
3342 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[0]);
3352 /* Divide "aff1" by "aff2", assuming "aff2" is a constant.
3354 * If either of the two is NaN, then the result is NaN.
3356 __isl_give isl_aff
*isl_aff_div(__isl_take isl_aff
*aff1
,
3357 __isl_take isl_aff
*aff2
)
3365 if (isl_aff_is_nan(aff1
)) {
3369 if (isl_aff_is_nan(aff2
)) {
3374 is_cst
= isl_aff_is_cst(aff2
);
3378 isl_die(isl_aff_get_ctx(aff2
), isl_error_invalid
,
3379 "second argument should be a constant", goto error
);
3384 neg
= isl_int_is_neg(aff2
->v
->el
[1]);
3386 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3387 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3390 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[0]);
3391 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[1]);
3394 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3395 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3406 static __isl_give isl_pw_aff
*pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3407 __isl_take isl_pw_aff
*pwaff2
)
3409 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_add
);
3412 __isl_give isl_pw_aff
*isl_pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3413 __isl_take isl_pw_aff
*pwaff2
)
3415 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_add
);
3418 __isl_give isl_pw_aff
*isl_pw_aff_union_add(__isl_take isl_pw_aff
*pwaff1
,
3419 __isl_take isl_pw_aff
*pwaff2
)
3421 return isl_pw_aff_union_add_(pwaff1
, pwaff2
);
3424 static __isl_give isl_pw_aff
*pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
3425 __isl_take isl_pw_aff
*pwaff2
)
3427 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_mul
);
3430 __isl_give isl_pw_aff
*isl_pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
3431 __isl_take isl_pw_aff
*pwaff2
)
3433 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_mul
);
3436 static __isl_give isl_pw_aff
*pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3437 __isl_take isl_pw_aff
*pa2
)
3439 return isl_pw_aff_on_shared_domain(pa1
, pa2
, &isl_aff_div
);
3442 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
3444 __isl_give isl_pw_aff
*isl_pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3445 __isl_take isl_pw_aff
*pa2
)
3449 is_cst
= isl_pw_aff_is_cst(pa2
);
3453 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3454 "second argument should be a piecewise constant",
3456 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_div
);
3458 isl_pw_aff_free(pa1
);
3459 isl_pw_aff_free(pa2
);
3463 /* Compute the quotient of the integer division of "pa1" by "pa2"
3464 * with rounding towards zero.
3465 * "pa2" is assumed to be a piecewise constant.
3467 * In particular, return
3469 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
3472 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_q(__isl_take isl_pw_aff
*pa1
,
3473 __isl_take isl_pw_aff
*pa2
)
3479 is_cst
= isl_pw_aff_is_cst(pa2
);
3483 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3484 "second argument should be a piecewise constant",
3487 pa1
= isl_pw_aff_div(pa1
, pa2
);
3489 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1
));
3490 f
= isl_pw_aff_floor(isl_pw_aff_copy(pa1
));
3491 c
= isl_pw_aff_ceil(pa1
);
3492 return isl_pw_aff_cond(isl_set_indicator_function(cond
), f
, c
);
3494 isl_pw_aff_free(pa1
);
3495 isl_pw_aff_free(pa2
);
3499 /* Compute the remainder of the integer division of "pa1" by "pa2"
3500 * with rounding towards zero.
3501 * "pa2" is assumed to be a piecewise constant.
3503 * In particular, return
3505 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
3508 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_r(__isl_take isl_pw_aff
*pa1
,
3509 __isl_take isl_pw_aff
*pa2
)
3514 is_cst
= isl_pw_aff_is_cst(pa2
);
3518 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3519 "second argument should be a piecewise constant",
3521 res
= isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1
), isl_pw_aff_copy(pa2
));
3522 res
= isl_pw_aff_mul(pa2
, res
);
3523 res
= isl_pw_aff_sub(pa1
, res
);
3526 isl_pw_aff_free(pa1
);
3527 isl_pw_aff_free(pa2
);
3531 static __isl_give isl_pw_aff
*pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3532 __isl_take isl_pw_aff
*pwaff2
)
3537 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3538 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3539 le
= isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1
),
3540 isl_pw_aff_copy(pwaff2
));
3541 dom
= isl_set_subtract(dom
, isl_set_copy(le
));
3542 return isl_pw_aff_select(le
, pwaff1
, dom
, pwaff2
);
3545 __isl_give isl_pw_aff
*isl_pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3546 __isl_take isl_pw_aff
*pwaff2
)
3548 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_min
);
3551 static __isl_give isl_pw_aff
*pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3552 __isl_take isl_pw_aff
*pwaff2
)
3557 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3558 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3559 ge
= isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1
),
3560 isl_pw_aff_copy(pwaff2
));
3561 dom
= isl_set_subtract(dom
, isl_set_copy(ge
));
3562 return isl_pw_aff_select(ge
, pwaff1
, dom
, pwaff2
);
3565 __isl_give isl_pw_aff
*isl_pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3566 __isl_take isl_pw_aff
*pwaff2
)
3568 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_max
);
3571 static __isl_give isl_pw_aff
*pw_aff_list_reduce(
3572 __isl_take isl_pw_aff_list
*list
,
3573 __isl_give isl_pw_aff
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3574 __isl_take isl_pw_aff
*pwaff2
))
3583 ctx
= isl_pw_aff_list_get_ctx(list
);
3585 isl_die(ctx
, isl_error_invalid
,
3586 "list should contain at least one element", goto error
);
3588 res
= isl_pw_aff_copy(list
->p
[0]);
3589 for (i
= 1; i
< list
->n
; ++i
)
3590 res
= fn(res
, isl_pw_aff_copy(list
->p
[i
]));
3592 isl_pw_aff_list_free(list
);
3595 isl_pw_aff_list_free(list
);
3599 /* Return an isl_pw_aff that maps each element in the intersection of the
3600 * domains of the elements of list to the minimal corresponding affine
3603 __isl_give isl_pw_aff
*isl_pw_aff_list_min(__isl_take isl_pw_aff_list
*list
)
3605 return pw_aff_list_reduce(list
, &isl_pw_aff_min
);
3608 /* Return an isl_pw_aff that maps each element in the intersection of the
3609 * domains of the elements of list to the maximal corresponding affine
3612 __isl_give isl_pw_aff
*isl_pw_aff_list_max(__isl_take isl_pw_aff_list
*list
)
3614 return pw_aff_list_reduce(list
, &isl_pw_aff_max
);
3617 /* Mark the domains of "pwaff" as rational.
3619 __isl_give isl_pw_aff
*isl_pw_aff_set_rational(__isl_take isl_pw_aff
*pwaff
)
3623 pwaff
= isl_pw_aff_cow(pwaff
);
3629 for (i
= 0; i
< pwaff
->n
; ++i
) {
3630 pwaff
->p
[i
].set
= isl_set_set_rational(pwaff
->p
[i
].set
);
3631 if (!pwaff
->p
[i
].set
)
3632 return isl_pw_aff_free(pwaff
);
3638 /* Mark the domains of the elements of "list" as rational.
3640 __isl_give isl_pw_aff_list
*isl_pw_aff_list_set_rational(
3641 __isl_take isl_pw_aff_list
*list
)
3651 for (i
= 0; i
< n
; ++i
) {
3654 pa
= isl_pw_aff_list_get_pw_aff(list
, i
);
3655 pa
= isl_pw_aff_set_rational(pa
);
3656 list
= isl_pw_aff_list_set_pw_aff(list
, i
, pa
);
3662 /* Do the parameters of "aff" match those of "space"?
3664 int isl_aff_matching_params(__isl_keep isl_aff
*aff
,
3665 __isl_keep isl_space
*space
)
3667 isl_space
*aff_space
;
3673 aff_space
= isl_aff_get_domain_space(aff
);
3675 match
= isl_space_match(space
, isl_dim_param
, aff_space
, isl_dim_param
);
3677 isl_space_free(aff_space
);
3681 /* Check that the domain space of "aff" matches "space".
3683 * Return 0 on success and -1 on error.
3685 int isl_aff_check_match_domain_space(__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
);
3700 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3701 "parameters don't match", goto error
);
3702 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
3703 aff_space
, isl_dim_set
);
3707 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3708 "domains don't match", goto error
);
3709 isl_space_free(aff_space
);
3712 isl_space_free(aff_space
);
3722 #include <isl_multi_templ.c>
3723 #include <isl_multi_apply_set.c>
3724 #include <isl_multi_cmp.c>
3725 #include <isl_multi_floor.c>
3726 #include <isl_multi_gist.c>
3730 /* Remove any internal structure of the domain of "ma".
3731 * If there is any such internal structure in the input,
3732 * then the name of the corresponding space is also removed.
3734 __isl_give isl_multi_aff
*isl_multi_aff_flatten_domain(
3735 __isl_take isl_multi_aff
*ma
)
3742 if (!ma
->space
->nested
[0])
3745 space
= isl_multi_aff_get_space(ma
);
3746 space
= isl_space_flatten_domain(space
);
3747 ma
= isl_multi_aff_reset_space(ma
, space
);
3752 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3753 * of the space to its domain.
3755 __isl_give isl_multi_aff
*isl_multi_aff_domain_map(__isl_take isl_space
*space
)
3758 isl_local_space
*ls
;
3763 if (!isl_space_is_map(space
))
3764 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3765 "not a map space", goto error
);
3767 n_in
= isl_space_dim(space
, isl_dim_in
);
3768 space
= isl_space_domain_map(space
);
3770 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3772 isl_space_free(space
);
3776 space
= isl_space_domain(space
);
3777 ls
= isl_local_space_from_space(space
);
3778 for (i
= 0; i
< n_in
; ++i
) {
3781 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3783 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3785 isl_local_space_free(ls
);
3788 isl_space_free(space
);
3792 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3793 * of the space to its range.
3795 __isl_give isl_multi_aff
*isl_multi_aff_range_map(__isl_take isl_space
*space
)
3798 isl_local_space
*ls
;
3803 if (!isl_space_is_map(space
))
3804 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3805 "not a map space", goto error
);
3807 n_in
= isl_space_dim(space
, isl_dim_in
);
3808 n_out
= isl_space_dim(space
, isl_dim_out
);
3809 space
= isl_space_range_map(space
);
3811 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3813 isl_space_free(space
);
3817 space
= isl_space_domain(space
);
3818 ls
= isl_local_space_from_space(space
);
3819 for (i
= 0; i
< n_out
; ++i
) {
3822 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3823 isl_dim_set
, n_in
+ i
);
3824 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3826 isl_local_space_free(ls
);
3829 isl_space_free(space
);
3833 /* Given a map space, return an isl_pw_multi_aff that maps a wrapped copy
3834 * of the space to its range.
3836 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_map(
3837 __isl_take isl_space
*space
)
3839 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_range_map(space
));
3842 /* Given the space of a set and a range of set dimensions,
3843 * construct an isl_multi_aff that projects out those dimensions.
3845 __isl_give isl_multi_aff
*isl_multi_aff_project_out_map(
3846 __isl_take isl_space
*space
, enum isl_dim_type type
,
3847 unsigned first
, unsigned n
)
3850 isl_local_space
*ls
;
3855 if (!isl_space_is_set(space
))
3856 isl_die(isl_space_get_ctx(space
), isl_error_unsupported
,
3857 "expecting set space", goto error
);
3858 if (type
!= isl_dim_set
)
3859 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3860 "only set dimensions can be projected out", goto error
);
3862 dim
= isl_space_dim(space
, isl_dim_set
);
3863 if (first
+ n
> dim
)
3864 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3865 "range out of bounds", goto error
);
3867 space
= isl_space_from_domain(space
);
3868 space
= isl_space_add_dims(space
, isl_dim_out
, dim
- n
);
3871 return isl_multi_aff_alloc(space
);
3873 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3874 space
= isl_space_domain(space
);
3875 ls
= isl_local_space_from_space(space
);
3877 for (i
= 0; i
< first
; ++i
) {
3880 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3882 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3885 for (i
= 0; i
< dim
- (first
+ n
); ++i
) {
3888 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3889 isl_dim_set
, first
+ n
+ i
);
3890 ma
= isl_multi_aff_set_aff(ma
, first
+ i
, aff
);
3893 isl_local_space_free(ls
);
3896 isl_space_free(space
);
3900 /* Given the space of a set and a range of set dimensions,
3901 * construct an isl_pw_multi_aff that projects out those dimensions.
3903 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_project_out_map(
3904 __isl_take isl_space
*space
, enum isl_dim_type type
,
3905 unsigned first
, unsigned n
)
3909 ma
= isl_multi_aff_project_out_map(space
, type
, first
, n
);
3910 return isl_pw_multi_aff_from_multi_aff(ma
);
3913 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
3916 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_aff(
3917 __isl_take isl_multi_aff
*ma
)
3919 isl_set
*dom
= isl_set_universe(isl_multi_aff_get_domain_space(ma
));
3920 return isl_pw_multi_aff_alloc(dom
, ma
);
3923 /* Create a piecewise multi-affine expression in the given space that maps each
3924 * input dimension to the corresponding output dimension.
3926 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_identity(
3927 __isl_take isl_space
*space
)
3929 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space
));
3932 /* Exploit the equalities in "eq" to simplify the affine expressions.
3934 static __isl_give isl_multi_aff
*isl_multi_aff_substitute_equalities(
3935 __isl_take isl_multi_aff
*maff
, __isl_take isl_basic_set
*eq
)
3939 maff
= isl_multi_aff_cow(maff
);
3943 for (i
= 0; i
< maff
->n
; ++i
) {
3944 maff
->p
[i
] = isl_aff_substitute_equalities(maff
->p
[i
],
3945 isl_basic_set_copy(eq
));
3950 isl_basic_set_free(eq
);
3953 isl_basic_set_free(eq
);
3954 isl_multi_aff_free(maff
);
3958 __isl_give isl_multi_aff
*isl_multi_aff_scale(__isl_take isl_multi_aff
*maff
,
3963 maff
= isl_multi_aff_cow(maff
);
3967 for (i
= 0; i
< maff
->n
; ++i
) {
3968 maff
->p
[i
] = isl_aff_scale(maff
->p
[i
], f
);
3970 return isl_multi_aff_free(maff
);
3976 __isl_give isl_multi_aff
*isl_multi_aff_add_on_domain(__isl_keep isl_set
*dom
,
3977 __isl_take isl_multi_aff
*maff1
, __isl_take isl_multi_aff
*maff2
)
3979 maff1
= isl_multi_aff_add(maff1
, maff2
);
3980 maff1
= isl_multi_aff_gist(maff1
, isl_set_copy(dom
));
3984 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff
*maff
)
3992 /* Return the set of domain elements where "ma1" is lexicographically
3993 * smaller than or equal to "ma2".
3995 __isl_give isl_set
*isl_multi_aff_lex_le_set(__isl_take isl_multi_aff
*ma1
,
3996 __isl_take isl_multi_aff
*ma2
)
3998 return isl_multi_aff_lex_ge_set(ma2
, ma1
);
4001 /* Return the set of domain elements where "ma1" is lexicographically
4002 * smaller than "ma2".
4004 __isl_give isl_set
*isl_multi_aff_lex_lt_set(__isl_take isl_multi_aff
*ma1
,
4005 __isl_take isl_multi_aff
*ma2
)
4007 return isl_multi_aff_lex_gt_set(ma2
, ma1
);
4010 /* Return the set of domain elements where "ma1" and "ma2"
4013 static __isl_give isl_set
*isl_multi_aff_order_set(
4014 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
,
4015 __isl_give isl_map
*order(__isl_take isl_space
*set_space
))
4018 isl_map
*map1
, *map2
;
4021 map1
= isl_map_from_multi_aff(ma1
);
4022 map2
= isl_map_from_multi_aff(ma2
);
4023 map
= isl_map_range_product(map1
, map2
);
4024 space
= isl_space_range(isl_map_get_space(map
));
4025 space
= isl_space_domain(isl_space_unwrap(space
));
4027 map
= isl_map_intersect_range(map
, isl_map_wrap(ge
));
4029 return isl_map_domain(map
);
4032 /* Return the set of domain elements where "ma1" is lexicographically
4033 * greater than or equal to "ma2".
4035 __isl_give isl_set
*isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff
*ma1
,
4036 __isl_take isl_multi_aff
*ma2
)
4038 return isl_multi_aff_order_set(ma1
, ma2
, &isl_map_lex_ge
);
4041 /* Return the set of domain elements where "ma1" is lexicographically
4042 * greater than "ma2".
4044 __isl_give isl_set
*isl_multi_aff_lex_gt_set(__isl_take isl_multi_aff
*ma1
,
4045 __isl_take isl_multi_aff
*ma2
)
4047 return isl_multi_aff_order_set(ma1
, ma2
, &isl_map_lex_gt
);
4051 #define PW isl_pw_multi_aff
4053 #define EL isl_multi_aff
4055 #define EL_IS_ZERO is_empty
4059 #define IS_ZERO is_empty
4062 #undef DEFAULT_IS_ZERO
4063 #define DEFAULT_IS_ZERO 0
4068 #define NO_INVOLVES_DIMS
4069 #define NO_INSERT_DIMS
4073 #include <isl_pw_templ.c>
4074 #include <isl_pw_union_opt.c>
4079 #define UNION isl_union_pw_multi_aff
4081 #define PART isl_pw_multi_aff
4083 #define PARTS pw_multi_aff
4085 #include <isl_union_multi.c>
4086 #include <isl_union_neg.c>
4088 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmax(
4089 __isl_take isl_pw_multi_aff
*pma1
,
4090 __isl_take isl_pw_multi_aff
*pma2
)
4092 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4093 &isl_multi_aff_lex_ge_set
);
4096 /* Given two piecewise multi affine expressions, return a piecewise
4097 * multi-affine expression defined on the union of the definition domains
4098 * of the inputs that is equal to the lexicographic maximum of the two
4099 * inputs on each cell. If only one of the two inputs is defined on
4100 * a given cell, then it is considered to be the maximum.
4102 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmax(
4103 __isl_take isl_pw_multi_aff
*pma1
,
4104 __isl_take isl_pw_multi_aff
*pma2
)
4106 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4107 &pw_multi_aff_union_lexmax
);
4110 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmin(
4111 __isl_take isl_pw_multi_aff
*pma1
,
4112 __isl_take isl_pw_multi_aff
*pma2
)
4114 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4115 &isl_multi_aff_lex_le_set
);
4118 /* Given two piecewise multi affine expressions, return a piecewise
4119 * multi-affine expression defined on the union of the definition domains
4120 * of the inputs that is equal to the lexicographic minimum of the two
4121 * inputs on each cell. If only one of the two inputs is defined on
4122 * a given cell, then it is considered to be the minimum.
4124 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmin(
4125 __isl_take isl_pw_multi_aff
*pma1
,
4126 __isl_take isl_pw_multi_aff
*pma2
)
4128 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4129 &pw_multi_aff_union_lexmin
);
4132 static __isl_give isl_pw_multi_aff
*pw_multi_aff_add(
4133 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4135 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4136 &isl_multi_aff_add
);
4139 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_add(
4140 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4142 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4146 static __isl_give isl_pw_multi_aff
*pw_multi_aff_sub(
4147 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4149 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4150 &isl_multi_aff_sub
);
4153 /* Subtract "pma2" from "pma1" and return the result.
4155 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_sub(
4156 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4158 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4162 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_add(
4163 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4165 return isl_pw_multi_aff_union_add_(pma1
, pma2
);
4168 /* Compute the sum of "upa1" and "upa2" on the union of their domains,
4169 * with the actual sum on the shared domain and
4170 * the defined expression on the symmetric difference of the domains.
4172 __isl_give isl_union_pw_aff
*isl_union_pw_aff_union_add(
4173 __isl_take isl_union_pw_aff
*upa1
, __isl_take isl_union_pw_aff
*upa2
)
4175 return isl_union_pw_aff_union_add_(upa1
, upa2
);
4178 /* Compute the sum of "upma1" and "upma2" on the union of their domains,
4179 * with the actual sum on the shared domain and
4180 * the defined expression on the symmetric difference of the domains.
4182 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_union_add(
4183 __isl_take isl_union_pw_multi_aff
*upma1
,
4184 __isl_take isl_union_pw_multi_aff
*upma2
)
4186 return isl_union_pw_multi_aff_union_add_(upma1
, upma2
);
4189 /* Given two piecewise multi-affine expressions A -> B and C -> D,
4190 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
4192 static __isl_give isl_pw_multi_aff
*pw_multi_aff_product(
4193 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4197 isl_pw_multi_aff
*res
;
4202 n
= pma1
->n
* pma2
->n
;
4203 space
= isl_space_product(isl_space_copy(pma1
->dim
),
4204 isl_space_copy(pma2
->dim
));
4205 res
= isl_pw_multi_aff_alloc_size(space
, n
);
4207 for (i
= 0; i
< pma1
->n
; ++i
) {
4208 for (j
= 0; j
< pma2
->n
; ++j
) {
4212 domain
= isl_set_product(isl_set_copy(pma1
->p
[i
].set
),
4213 isl_set_copy(pma2
->p
[j
].set
));
4214 ma
= isl_multi_aff_product(
4215 isl_multi_aff_copy(pma1
->p
[i
].maff
),
4216 isl_multi_aff_copy(pma2
->p
[j
].maff
));
4217 res
= isl_pw_multi_aff_add_piece(res
, domain
, ma
);
4221 isl_pw_multi_aff_free(pma1
);
4222 isl_pw_multi_aff_free(pma2
);
4225 isl_pw_multi_aff_free(pma1
);
4226 isl_pw_multi_aff_free(pma2
);
4230 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_product(
4231 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4233 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4234 &pw_multi_aff_product
);
4237 /* Construct a map mapping the domain of the piecewise multi-affine expression
4238 * to its range, with each dimension in the range equated to the
4239 * corresponding affine expression on its cell.
4241 * If the domain of "pma" is rational, then so is the constructed "map".
4243 __isl_give isl_map
*isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
4251 map
= isl_map_empty(isl_pw_multi_aff_get_space(pma
));
4253 for (i
= 0; i
< pma
->n
; ++i
) {
4255 isl_multi_aff
*maff
;
4256 isl_basic_map
*bmap
;
4259 rational
= isl_set_is_rational(pma
->p
[i
].set
);
4261 map
= isl_map_free(map
);
4262 maff
= isl_multi_aff_copy(pma
->p
[i
].maff
);
4263 bmap
= isl_basic_map_from_multi_aff2(maff
, rational
);
4264 map_i
= isl_map_from_basic_map(bmap
);
4265 map_i
= isl_map_intersect_domain(map_i
,
4266 isl_set_copy(pma
->p
[i
].set
));
4267 map
= isl_map_union_disjoint(map
, map_i
);
4270 isl_pw_multi_aff_free(pma
);
4274 __isl_give isl_set
*isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
4279 if (!isl_space_is_set(pma
->dim
))
4280 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
4281 "isl_pw_multi_aff cannot be converted into an isl_set",
4284 return isl_map_from_pw_multi_aff(pma
);
4286 isl_pw_multi_aff_free(pma
);
4290 /* Subtract the initial "n" elements in "ma" with coefficients in "c" and
4291 * denominator "denom".
4292 * "denom" is allowed to be negative, in which case the actual denominator
4293 * is -denom and the expressions are added instead.
4295 static __isl_give isl_aff
*subtract_initial(__isl_take isl_aff
*aff
,
4296 __isl_keep isl_multi_aff
*ma
, int n
, isl_int
*c
, isl_int denom
)
4302 first
= isl_seq_first_non_zero(c
, n
);
4306 sign
= isl_int_sgn(denom
);
4308 isl_int_abs(d
, denom
);
4309 for (i
= first
; i
< n
; ++i
) {
4312 if (isl_int_is_zero(c
[i
]))
4314 aff_i
= isl_multi_aff_get_aff(ma
, i
);
4315 aff_i
= isl_aff_scale(aff_i
, c
[i
]);
4316 aff_i
= isl_aff_scale_down(aff_i
, d
);
4318 aff
= isl_aff_sub(aff
, aff_i
);
4320 aff
= isl_aff_add(aff
, aff_i
);
4327 /* Extract an affine expression that expresses the output dimension "pos"
4328 * of "bmap" in terms of the parameters and input dimensions from
4330 * Note that this expression may involve integer divisions defined
4331 * in terms of parameters and input dimensions.
4332 * The equality may also involve references to earlier (but not later)
4333 * output dimensions. These are replaced by the corresponding elements
4336 * If the equality is of the form
4338 * f(i) + h(j) + a x + g(i) = 0,
4340 * with f(i) a linear combinations of the parameters and input dimensions,
4341 * g(i) a linear combination of integer divisions defined in terms of the same
4342 * and h(j) a linear combinations of earlier output dimensions,
4343 * then the affine expression is
4345 * (-f(i) - g(i))/a - h(j)/a
4347 * If the equality is of the form
4349 * f(i) + h(j) - a x + g(i) = 0,
4351 * then the affine expression is
4353 * (f(i) + g(i))/a - h(j)/(-a)
4356 * If "div" refers to an integer division (i.e., it is smaller than
4357 * the number of integer divisions), then the equality constraint
4358 * does involve an integer division (the one at position "div") that
4359 * is defined in terms of output dimensions. However, this integer
4360 * division can be eliminated by exploiting a pair of constraints
4361 * x >= l and x <= l + n, with n smaller than the coefficient of "div"
4362 * in the equality constraint. "ineq" refers to inequality x >= l, i.e.,
4364 * In particular, let
4366 * x = e(i) + m floor(...)
4368 * with e(i) the expression derived above and floor(...) the integer
4369 * division involving output dimensions.
4380 * e(i) + m floor(...) - l = (e(i) + m floor(...) - l) mod m
4381 * = (e(i) - l) mod m
4385 * x - l = (e(i) - l) mod m
4389 * x = ((e(i) - l) mod m) + l
4391 * The variable "shift" below contains the expression -l, which may
4392 * also involve a linear combination of earlier output dimensions.
4394 static __isl_give isl_aff
*extract_aff_from_equality(
4395 __isl_keep isl_basic_map
*bmap
, int pos
, int eq
, int div
, int ineq
,
4396 __isl_keep isl_multi_aff
*ma
)
4399 unsigned n_div
, n_out
;
4401 isl_local_space
*ls
;
4402 isl_aff
*aff
, *shift
;
4405 ctx
= isl_basic_map_get_ctx(bmap
);
4406 ls
= isl_basic_map_get_local_space(bmap
);
4407 ls
= isl_local_space_domain(ls
);
4408 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
4411 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
4412 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4413 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4414 if (isl_int_is_neg(bmap
->eq
[eq
][o_out
+ pos
])) {
4415 isl_seq_cpy(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4416 isl_seq_cpy(aff
->v
->el
+ 1 + o_out
,
4417 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4419 isl_seq_neg(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4420 isl_seq_neg(aff
->v
->el
+ 1 + o_out
,
4421 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4424 isl_int_set_si(aff
->v
->el
[1 + o_out
+ div
], 0);
4425 isl_int_abs(aff
->v
->el
[0], bmap
->eq
[eq
][o_out
+ pos
]);
4426 aff
= subtract_initial(aff
, ma
, pos
, bmap
->eq
[eq
] + o_out
,
4427 bmap
->eq
[eq
][o_out
+ pos
]);
4429 shift
= isl_aff_alloc(isl_local_space_copy(ls
));
4432 isl_seq_cpy(shift
->v
->el
+ 1, bmap
->ineq
[ineq
], o_out
);
4433 isl_seq_cpy(shift
->v
->el
+ 1 + o_out
,
4434 bmap
->ineq
[ineq
] + o_out
+ n_out
, n_div
);
4435 isl_int_set_si(shift
->v
->el
[0], 1);
4436 shift
= subtract_initial(shift
, ma
, pos
,
4437 bmap
->ineq
[ineq
] + o_out
, ctx
->negone
);
4438 aff
= isl_aff_add(aff
, isl_aff_copy(shift
));
4439 mod
= isl_val_int_from_isl_int(ctx
,
4440 bmap
->eq
[eq
][o_out
+ n_out
+ div
]);
4441 mod
= isl_val_abs(mod
);
4442 aff
= isl_aff_mod_val(aff
, mod
);
4443 aff
= isl_aff_sub(aff
, shift
);
4446 isl_local_space_free(ls
);
4449 isl_local_space_free(ls
);
4454 /* Given a basic map with output dimensions defined
4455 * in terms of the parameters input dimensions and earlier
4456 * output dimensions using an equality (and possibly a pair on inequalities),
4457 * extract an isl_aff that expresses output dimension "pos" in terms
4458 * of the parameters and input dimensions.
4459 * Note that this expression may involve integer divisions defined
4460 * in terms of parameters and input dimensions.
4461 * "ma" contains the expressions corresponding to earlier output dimensions.
4463 * This function shares some similarities with
4464 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
4466 static __isl_give isl_aff
*extract_isl_aff_from_basic_map(
4467 __isl_keep isl_basic_map
*bmap
, int pos
, __isl_keep isl_multi_aff
*ma
)
4474 eq
= isl_basic_map_output_defining_equality(bmap
, pos
, &div
, &ineq
);
4475 if (eq
>= bmap
->n_eq
)
4476 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4477 "unable to find suitable equality", return NULL
);
4478 aff
= extract_aff_from_equality(bmap
, pos
, eq
, div
, ineq
, ma
);
4480 aff
= isl_aff_remove_unused_divs(aff
);
4484 /* Given a basic map where each output dimension is defined
4485 * in terms of the parameters and input dimensions using an equality,
4486 * extract an isl_multi_aff that expresses the output dimensions in terms
4487 * of the parameters and input dimensions.
4489 static __isl_give isl_multi_aff
*extract_isl_multi_aff_from_basic_map(
4490 __isl_take isl_basic_map
*bmap
)
4499 ma
= isl_multi_aff_alloc(isl_basic_map_get_space(bmap
));
4500 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4502 for (i
= 0; i
< n_out
; ++i
) {
4505 aff
= extract_isl_aff_from_basic_map(bmap
, i
, ma
);
4506 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4509 isl_basic_map_free(bmap
);
4514 /* Given a basic set where each set dimension is defined
4515 * in terms of the parameters using an equality,
4516 * extract an isl_multi_aff that expresses the set dimensions in terms
4517 * of the parameters.
4519 __isl_give isl_multi_aff
*isl_multi_aff_from_basic_set_equalities(
4520 __isl_take isl_basic_set
*bset
)
4522 return extract_isl_multi_aff_from_basic_map(bset
);
4525 /* Create an isl_pw_multi_aff that is equivalent to
4526 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
4527 * The given basic map is such that each output dimension is defined
4528 * in terms of the parameters and input dimensions using an equality.
4530 * Since some applications expect the result of isl_pw_multi_aff_from_map
4531 * to only contain integer affine expressions, we compute the floor
4532 * of the expression before returning.
4534 * Remove all constraints involving local variables without
4535 * an explicit representation (resulting in the removal of those
4536 * local variables) prior to the actual extraction to ensure
4537 * that the local spaces in which the resulting affine expressions
4538 * are created do not contain any unknown local variables.
4539 * Removing such constraints is safe because constraints involving
4540 * unknown local variables are not used to determine whether
4541 * a basic map is obviously single-valued.
4543 static __isl_give isl_pw_multi_aff
*plain_pw_multi_aff_from_map(
4544 __isl_take isl_set
*domain
, __isl_take isl_basic_map
*bmap
)
4548 bmap
= isl_basic_map_drop_constraint_involving_unknown_divs(bmap
);
4549 ma
= extract_isl_multi_aff_from_basic_map(bmap
);
4550 ma
= isl_multi_aff_floor(ma
);
4551 return isl_pw_multi_aff_alloc(domain
, ma
);
4554 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4555 * This obviously only works if the input "map" is single-valued.
4556 * If so, we compute the lexicographic minimum of the image in the form
4557 * of an isl_pw_multi_aff. Since the image is unique, it is equal
4558 * to its lexicographic minimum.
4559 * If the input is not single-valued, we produce an error.
4561 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_base(
4562 __isl_take isl_map
*map
)
4566 isl_pw_multi_aff
*pma
;
4568 sv
= isl_map_is_single_valued(map
);
4572 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
4573 "map is not single-valued", goto error
);
4574 map
= isl_map_make_disjoint(map
);
4578 pma
= isl_pw_multi_aff_empty(isl_map_get_space(map
));
4580 for (i
= 0; i
< map
->n
; ++i
) {
4581 isl_pw_multi_aff
*pma_i
;
4582 isl_basic_map
*bmap
;
4583 bmap
= isl_basic_map_copy(map
->p
[i
]);
4584 pma_i
= isl_basic_map_lexmin_pw_multi_aff(bmap
);
4585 pma
= isl_pw_multi_aff_add_disjoint(pma
, pma_i
);
4595 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4596 * taking into account that the output dimension at position "d"
4597 * can be represented as
4599 * x = floor((e(...) + c1) / m)
4601 * given that constraint "i" is of the form
4603 * e(...) + c1 - m x >= 0
4606 * Let "map" be of the form
4610 * We construct a mapping
4612 * A -> [A -> x = floor(...)]
4614 * apply that to the map, obtaining
4616 * [A -> x = floor(...)] -> B
4618 * and equate dimension "d" to x.
4619 * We then compute a isl_pw_multi_aff representation of the resulting map
4620 * and plug in the mapping above.
4622 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_div(
4623 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
)
4627 isl_local_space
*ls
;
4635 isl_pw_multi_aff
*pma
;
4638 is_set
= isl_map_is_set(map
);
4642 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4643 ctx
= isl_map_get_ctx(map
);
4644 space
= isl_space_domain(isl_map_get_space(map
));
4645 n_in
= isl_space_dim(space
, isl_dim_set
);
4646 n
= isl_space_dim(space
, isl_dim_all
);
4648 v
= isl_vec_alloc(ctx
, 1 + 1 + n
);
4650 isl_int_neg(v
->el
[0], hull
->ineq
[i
][offset
+ d
]);
4651 isl_seq_cpy(v
->el
+ 1, hull
->ineq
[i
], 1 + n
);
4653 isl_basic_map_free(hull
);
4655 ls
= isl_local_space_from_space(isl_space_copy(space
));
4656 aff
= isl_aff_alloc_vec(ls
, v
);
4657 aff
= isl_aff_floor(aff
);
4659 isl_space_free(space
);
4660 ma
= isl_multi_aff_from_aff(aff
);
4662 ma
= isl_multi_aff_identity(isl_space_map_from_set(space
));
4663 ma
= isl_multi_aff_range_product(ma
,
4664 isl_multi_aff_from_aff(aff
));
4667 insert
= isl_map_from_multi_aff(isl_multi_aff_copy(ma
));
4668 map
= isl_map_apply_domain(map
, insert
);
4669 map
= isl_map_equate(map
, isl_dim_in
, n_in
, isl_dim_out
, d
);
4670 pma
= isl_pw_multi_aff_from_map(map
);
4671 pma
= isl_pw_multi_aff_pullback_multi_aff(pma
, ma
);
4676 isl_basic_map_free(hull
);
4680 /* Is constraint "c" of the form
4682 * e(...) + c1 - m x >= 0
4686 * -e(...) + c2 + m x >= 0
4688 * where m > 1 and e only depends on parameters and input dimemnsions?
4690 * "offset" is the offset of the output dimensions
4691 * "pos" is the position of output dimension x.
4693 static int is_potential_div_constraint(isl_int
*c
, int offset
, int d
, int total
)
4695 if (isl_int_is_zero(c
[offset
+ d
]))
4697 if (isl_int_is_one(c
[offset
+ d
]))
4699 if (isl_int_is_negone(c
[offset
+ d
]))
4701 if (isl_seq_first_non_zero(c
+ offset
, d
) != -1)
4703 if (isl_seq_first_non_zero(c
+ offset
+ d
+ 1,
4704 total
- (offset
+ d
+ 1)) != -1)
4709 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4711 * As a special case, we first check if there is any pair of constraints,
4712 * shared by all the basic maps in "map" that force a given dimension
4713 * to be equal to the floor of some affine combination of the input dimensions.
4715 * In particular, if we can find two constraints
4717 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
4721 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
4723 * where m > 1 and e only depends on parameters and input dimemnsions,
4726 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
4728 * then we know that we can take
4730 * x = floor((e(...) + c1) / m)
4732 * without having to perform any computation.
4734 * Note that we know that
4738 * If c1 + c2 were 0, then we would have detected an equality during
4739 * simplification. If c1 + c2 were negative, then we would have detected
4742 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_div(
4743 __isl_take isl_map
*map
)
4749 isl_basic_map
*hull
;
4751 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
4756 dim
= isl_map_dim(map
, isl_dim_out
);
4757 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4758 total
= 1 + isl_basic_map_total_dim(hull
);
4760 for (d
= 0; d
< dim
; ++d
) {
4761 for (i
= 0; i
< n
; ++i
) {
4762 if (!is_potential_div_constraint(hull
->ineq
[i
],
4765 for (j
= i
+ 1; j
< n
; ++j
) {
4766 if (!isl_seq_is_neg(hull
->ineq
[i
] + 1,
4767 hull
->ineq
[j
] + 1, total
- 1))
4769 isl_int_add(sum
, hull
->ineq
[i
][0],
4771 if (isl_int_abs_lt(sum
,
4772 hull
->ineq
[i
][offset
+ d
]))
4779 if (isl_int_is_pos(hull
->ineq
[j
][offset
+ d
]))
4781 return pw_multi_aff_from_map_div(map
, hull
, d
, j
);
4785 isl_basic_map_free(hull
);
4786 return pw_multi_aff_from_map_base(map
);
4789 isl_basic_map_free(hull
);
4793 /* Given an affine expression
4795 * [A -> B] -> f(A,B)
4797 * construct an isl_multi_aff
4801 * such that dimension "d" in B' is set to "aff" and the remaining
4802 * dimensions are set equal to the corresponding dimensions in B.
4803 * "n_in" is the dimension of the space A.
4804 * "n_out" is the dimension of the space B.
4806 * If "is_set" is set, then the affine expression is of the form
4810 * and we construct an isl_multi_aff
4814 static __isl_give isl_multi_aff
*range_map(__isl_take isl_aff
*aff
, int d
,
4815 unsigned n_in
, unsigned n_out
, int is_set
)
4819 isl_space
*space
, *space2
;
4820 isl_local_space
*ls
;
4822 space
= isl_aff_get_domain_space(aff
);
4823 ls
= isl_local_space_from_space(isl_space_copy(space
));
4824 space2
= isl_space_copy(space
);
4826 space2
= isl_space_range(isl_space_unwrap(space2
));
4827 space
= isl_space_map_from_domain_and_range(space
, space2
);
4828 ma
= isl_multi_aff_alloc(space
);
4829 ma
= isl_multi_aff_set_aff(ma
, d
, aff
);
4831 for (i
= 0; i
< n_out
; ++i
) {
4834 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4835 isl_dim_set
, n_in
+ i
);
4836 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4839 isl_local_space_free(ls
);
4844 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4845 * taking into account that the dimension at position "d" can be written as
4847 * x = m a + f(..) (1)
4849 * where m is equal to "gcd".
4850 * "i" is the index of the equality in "hull" that defines f(..).
4851 * In particular, the equality is of the form
4853 * f(..) - x + m g(existentials) = 0
4857 * -f(..) + x + m g(existentials) = 0
4859 * We basically plug (1) into "map", resulting in a map with "a"
4860 * in the range instead of "x". The corresponding isl_pw_multi_aff
4861 * defining "a" is then plugged back into (1) to obtain a definition for "x".
4863 * Specifically, given the input map
4867 * We first wrap it into a set
4871 * and define (1) on top of the corresponding space, resulting in "aff".
4872 * We use this to create an isl_multi_aff that maps the output position "d"
4873 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
4874 * We plug this into the wrapped map, unwrap the result and compute the
4875 * corresponding isl_pw_multi_aff.
4876 * The result is an expression
4884 * so that we can plug that into "aff", after extending the latter to
4890 * If "map" is actually a set, then there is no "A" space, meaning
4891 * that we do not need to perform any wrapping, and that the result
4892 * of the recursive call is of the form
4896 * which is plugged into a mapping of the form
4900 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_stride(
4901 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
,
4906 isl_local_space
*ls
;
4909 isl_pw_multi_aff
*pma
, *id
;
4915 is_set
= isl_map_is_set(map
);
4919 n_in
= isl_basic_map_dim(hull
, isl_dim_in
);
4920 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
4921 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
4926 set
= isl_map_wrap(map
);
4927 space
= isl_space_map_from_set(isl_set_get_space(set
));
4928 ma
= isl_multi_aff_identity(space
);
4929 ls
= isl_local_space_from_space(isl_set_get_space(set
));
4930 aff
= isl_aff_alloc(ls
);
4932 isl_int_set_si(aff
->v
->el
[0], 1);
4933 if (isl_int_is_one(hull
->eq
[i
][o_out
+ d
]))
4934 isl_seq_neg(aff
->v
->el
+ 1, hull
->eq
[i
],
4937 isl_seq_cpy(aff
->v
->el
+ 1, hull
->eq
[i
],
4939 isl_int_set(aff
->v
->el
[1 + o_out
+ d
], gcd
);
4941 ma
= isl_multi_aff_set_aff(ma
, n_in
+ d
, isl_aff_copy(aff
));
4942 set
= isl_set_preimage_multi_aff(set
, ma
);
4944 ma
= range_map(aff
, d
, n_in
, n_out
, is_set
);
4949 map
= isl_set_unwrap(set
);
4950 pma
= isl_pw_multi_aff_from_map(map
);
4953 space
= isl_pw_multi_aff_get_domain_space(pma
);
4954 space
= isl_space_map_from_set(space
);
4955 id
= isl_pw_multi_aff_identity(space
);
4956 pma
= isl_pw_multi_aff_range_product(id
, pma
);
4958 id
= isl_pw_multi_aff_from_multi_aff(ma
);
4959 pma
= isl_pw_multi_aff_pullback_pw_multi_aff(id
, pma
);
4961 isl_basic_map_free(hull
);
4965 isl_basic_map_free(hull
);
4969 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4970 * "hull" contains the equalities valid for "map".
4972 * Check if any of the output dimensions is "strided".
4973 * That is, we check if it can be written as
4977 * with m greater than 1, a some combination of existentially quantified
4978 * variables and f an expression in the parameters and input dimensions.
4979 * If so, we remove the stride in pw_multi_aff_from_map_stride.
4981 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
4984 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_strides(
4985 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
)
4994 n_div
= isl_basic_map_dim(hull
, isl_dim_div
);
4995 o_div
= isl_basic_map_offset(hull
, isl_dim_div
);
4998 isl_basic_map_free(hull
);
4999 return pw_multi_aff_from_map_check_div(map
);
5004 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5005 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5007 for (i
= 0; i
< n_out
; ++i
) {
5008 for (j
= 0; j
< hull
->n_eq
; ++j
) {
5009 isl_int
*eq
= hull
->eq
[j
];
5010 isl_pw_multi_aff
*res
;
5012 if (!isl_int_is_one(eq
[o_out
+ i
]) &&
5013 !isl_int_is_negone(eq
[o_out
+ i
]))
5015 if (isl_seq_first_non_zero(eq
+ o_out
, i
) != -1)
5017 if (isl_seq_first_non_zero(eq
+ o_out
+ i
+ 1,
5018 n_out
- (i
+ 1)) != -1)
5020 isl_seq_gcd(eq
+ o_div
, n_div
, &gcd
);
5021 if (isl_int_is_zero(gcd
))
5023 if (isl_int_is_one(gcd
))
5026 res
= pw_multi_aff_from_map_stride(map
, hull
,
5034 isl_basic_map_free(hull
);
5035 return pw_multi_aff_from_map_check_div(map
);
5038 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
5040 * As a special case, we first check if all output dimensions are uniquely
5041 * defined in terms of the parameters and input dimensions over the entire
5042 * domain. If so, we extract the desired isl_pw_multi_aff directly
5043 * from the affine hull of "map" and its domain.
5045 * Otherwise, continue with pw_multi_aff_from_map_check_strides for more
5048 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_map(__isl_take isl_map
*map
)
5051 isl_basic_map
*hull
;
5056 if (isl_map_n_basic_map(map
) == 1) {
5057 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5058 hull
= isl_basic_map_plain_affine_hull(hull
);
5059 sv
= isl_basic_map_plain_is_single_valued(hull
);
5061 return plain_pw_multi_aff_from_map(isl_map_domain(map
),
5063 isl_basic_map_free(hull
);
5065 map
= isl_map_detect_equalities(map
);
5066 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5067 sv
= isl_basic_map_plain_is_single_valued(hull
);
5069 return plain_pw_multi_aff_from_map(isl_map_domain(map
), hull
);
5071 return pw_multi_aff_from_map_check_strides(map
, hull
);
5072 isl_basic_map_free(hull
);
5077 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_set(__isl_take isl_set
*set
)
5079 return isl_pw_multi_aff_from_map(set
);
5082 /* Convert "map" into an isl_pw_multi_aff (if possible) and
5085 static isl_stat
pw_multi_aff_from_map(__isl_take isl_map
*map
, void *user
)
5087 isl_union_pw_multi_aff
**upma
= user
;
5088 isl_pw_multi_aff
*pma
;
5090 pma
= isl_pw_multi_aff_from_map(map
);
5091 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5093 return *upma
? isl_stat_ok
: isl_stat_error
;
5096 /* Create an isl_union_pw_multi_aff with the given isl_aff on a universe
5099 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_aff(
5100 __isl_take isl_aff
*aff
)
5103 isl_pw_multi_aff
*pma
;
5105 ma
= isl_multi_aff_from_aff(aff
);
5106 pma
= isl_pw_multi_aff_from_multi_aff(ma
);
5107 return isl_union_pw_multi_aff_from_pw_multi_aff(pma
);
5110 /* Try and create an isl_union_pw_multi_aff that is equivalent
5111 * to the given isl_union_map.
5112 * The isl_union_map is required to be single-valued in each space.
5113 * Otherwise, an error is produced.
5115 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_map(
5116 __isl_take isl_union_map
*umap
)
5119 isl_union_pw_multi_aff
*upma
;
5121 space
= isl_union_map_get_space(umap
);
5122 upma
= isl_union_pw_multi_aff_empty(space
);
5123 if (isl_union_map_foreach_map(umap
, &pw_multi_aff_from_map
, &upma
) < 0)
5124 upma
= isl_union_pw_multi_aff_free(upma
);
5125 isl_union_map_free(umap
);
5130 /* Try and create an isl_union_pw_multi_aff that is equivalent
5131 * to the given isl_union_set.
5132 * The isl_union_set is required to be a singleton in each space.
5133 * Otherwise, an error is produced.
5135 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_set(
5136 __isl_take isl_union_set
*uset
)
5138 return isl_union_pw_multi_aff_from_union_map(uset
);
5141 /* Return the piecewise affine expression "set ? 1 : 0".
5143 __isl_give isl_pw_aff
*isl_set_indicator_function(__isl_take isl_set
*set
)
5146 isl_space
*space
= isl_set_get_space(set
);
5147 isl_local_space
*ls
= isl_local_space_from_space(space
);
5148 isl_aff
*zero
= isl_aff_zero_on_domain(isl_local_space_copy(ls
));
5149 isl_aff
*one
= isl_aff_zero_on_domain(ls
);
5151 one
= isl_aff_add_constant_si(one
, 1);
5152 pa
= isl_pw_aff_alloc(isl_set_copy(set
), one
);
5153 set
= isl_set_complement(set
);
5154 pa
= isl_pw_aff_add_disjoint(pa
, isl_pw_aff_alloc(set
, zero
));
5159 /* Plug in "subs" for dimension "type", "pos" of "aff".
5161 * Let i be the dimension to replace and let "subs" be of the form
5165 * and "aff" of the form
5171 * (a f + d g')/(m d)
5173 * where g' is the result of plugging in "subs" in each of the integer
5176 __isl_give isl_aff
*isl_aff_substitute(__isl_take isl_aff
*aff
,
5177 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
5182 aff
= isl_aff_cow(aff
);
5184 return isl_aff_free(aff
);
5186 ctx
= isl_aff_get_ctx(aff
);
5187 if (!isl_space_is_equal(aff
->ls
->dim
, subs
->ls
->dim
))
5188 isl_die(ctx
, isl_error_invalid
,
5189 "spaces don't match", return isl_aff_free(aff
));
5190 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
5191 isl_die(ctx
, isl_error_unsupported
,
5192 "cannot handle divs yet", return isl_aff_free(aff
));
5194 aff
->ls
= isl_local_space_substitute(aff
->ls
, type
, pos
, subs
);
5196 return isl_aff_free(aff
);
5198 aff
->v
= isl_vec_cow(aff
->v
);
5200 return isl_aff_free(aff
);
5202 pos
+= isl_local_space_offset(aff
->ls
, type
);
5205 isl_seq_substitute(aff
->v
->el
, pos
, subs
->v
->el
,
5206 aff
->v
->size
, subs
->v
->size
, v
);
5212 /* Plug in "subs" for dimension "type", "pos" in each of the affine
5213 * expressions in "maff".
5215 __isl_give isl_multi_aff
*isl_multi_aff_substitute(
5216 __isl_take isl_multi_aff
*maff
, enum isl_dim_type type
, unsigned pos
,
5217 __isl_keep isl_aff
*subs
)
5221 maff
= isl_multi_aff_cow(maff
);
5223 return isl_multi_aff_free(maff
);
5225 if (type
== isl_dim_in
)
5228 for (i
= 0; i
< maff
->n
; ++i
) {
5229 maff
->p
[i
] = isl_aff_substitute(maff
->p
[i
], type
, pos
, subs
);
5231 return isl_multi_aff_free(maff
);
5237 /* Plug in "subs" for dimension "type", "pos" of "pma".
5239 * pma is of the form
5243 * while subs is of the form
5245 * v' = B_j(v) -> S_j
5247 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
5248 * has a contribution in the result, in particular
5250 * C_ij(S_j) -> M_i(S_j)
5252 * Note that plugging in S_j in C_ij may also result in an empty set
5253 * and this contribution should simply be discarded.
5255 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_substitute(
5256 __isl_take isl_pw_multi_aff
*pma
, enum isl_dim_type type
, unsigned pos
,
5257 __isl_keep isl_pw_aff
*subs
)
5260 isl_pw_multi_aff
*res
;
5263 return isl_pw_multi_aff_free(pma
);
5265 n
= pma
->n
* subs
->n
;
5266 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma
->dim
), n
);
5268 for (i
= 0; i
< pma
->n
; ++i
) {
5269 for (j
= 0; j
< subs
->n
; ++j
) {
5271 isl_multi_aff
*res_ij
;
5274 common
= isl_set_intersect(
5275 isl_set_copy(pma
->p
[i
].set
),
5276 isl_set_copy(subs
->p
[j
].set
));
5277 common
= isl_set_substitute(common
,
5278 type
, pos
, subs
->p
[j
].aff
);
5279 empty
= isl_set_plain_is_empty(common
);
5280 if (empty
< 0 || empty
) {
5281 isl_set_free(common
);
5287 res_ij
= isl_multi_aff_substitute(
5288 isl_multi_aff_copy(pma
->p
[i
].maff
),
5289 type
, pos
, subs
->p
[j
].aff
);
5291 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5295 isl_pw_multi_aff_free(pma
);
5298 isl_pw_multi_aff_free(pma
);
5299 isl_pw_multi_aff_free(res
);
5303 /* Compute the preimage of a range of dimensions in the affine expression "src"
5304 * under "ma" and put the result in "dst". The number of dimensions in "src"
5305 * that precede the range is given by "n_before". The number of dimensions
5306 * in the range is given by the number of output dimensions of "ma".
5307 * The number of dimensions that follow the range is given by "n_after".
5308 * If "has_denom" is set (to one),
5309 * then "src" and "dst" have an extra initial denominator.
5310 * "n_div_ma" is the number of existentials in "ma"
5311 * "n_div_bset" is the number of existentials in "src"
5312 * The resulting "dst" (which is assumed to have been allocated by
5313 * the caller) contains coefficients for both sets of existentials,
5314 * first those in "ma" and then those in "src".
5315 * f, c1, c2 and g are temporary objects that have been initialized
5318 * Let src represent the expression
5320 * (a(p) + f_u u + b v + f_w w + c(divs))/d
5322 * and let ma represent the expressions
5324 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
5326 * We start out with the following expression for dst:
5328 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
5330 * with the multiplication factor f initially equal to 1
5331 * and f \sum_i b_i v_i kept separately.
5332 * For each x_i that we substitute, we multiply the numerator
5333 * (and denominator) of dst by c_1 = m_i and add the numerator
5334 * of the x_i expression multiplied by c_2 = f b_i,
5335 * after removing the common factors of c_1 and c_2.
5336 * The multiplication factor f also needs to be multiplied by c_1
5337 * for the next x_j, j > i.
5339 void isl_seq_preimage(isl_int
*dst
, isl_int
*src
,
5340 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
,
5341 int n_div_ma
, int n_div_bmap
,
5342 isl_int f
, isl_int c1
, isl_int c2
, isl_int g
, int has_denom
)
5345 int n_param
, n_in
, n_out
;
5348 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
5349 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
5350 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
5352 isl_seq_cpy(dst
, src
, has_denom
+ 1 + n_param
+ n_before
);
5353 o_dst
= o_src
= has_denom
+ 1 + n_param
+ n_before
;
5354 isl_seq_clr(dst
+ o_dst
, n_in
);
5357 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_after
);
5360 isl_seq_clr(dst
+ o_dst
, n_div_ma
);
5362 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_div_bmap
);
5364 isl_int_set_si(f
, 1);
5366 for (i
= 0; i
< n_out
; ++i
) {
5367 int offset
= has_denom
+ 1 + n_param
+ n_before
+ i
;
5369 if (isl_int_is_zero(src
[offset
]))
5371 isl_int_set(c1
, ma
->p
[i
]->v
->el
[0]);
5372 isl_int_mul(c2
, f
, src
[offset
]);
5373 isl_int_gcd(g
, c1
, c2
);
5374 isl_int_divexact(c1
, c1
, g
);
5375 isl_int_divexact(c2
, c2
, g
);
5377 isl_int_mul(f
, f
, c1
);
5380 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5381 c2
, ma
->p
[i
]->v
->el
+ o_src
, 1 + n_param
);
5382 o_dst
+= 1 + n_param
;
5383 o_src
+= 1 + n_param
;
5384 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_before
);
5386 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5387 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_in
);
5390 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_after
);
5392 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5393 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_div_ma
);
5396 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_div_bmap
);
5398 isl_int_mul(dst
[0], dst
[0], c1
);
5402 /* Compute the pullback of "aff" by the function represented by "ma".
5403 * In other words, plug in "ma" in "aff". The result is an affine expression
5404 * defined over the domain space of "ma".
5406 * If "aff" is represented by
5408 * (a(p) + b x + c(divs))/d
5410 * and ma is represented by
5412 * x = D(p) + F(y) + G(divs')
5414 * then the result is
5416 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
5418 * The divs in the local space of the input are similarly adjusted
5419 * through a call to isl_local_space_preimage_multi_aff.
5421 __isl_give isl_aff
*isl_aff_pullback_multi_aff(__isl_take isl_aff
*aff
,
5422 __isl_take isl_multi_aff
*ma
)
5424 isl_aff
*res
= NULL
;
5425 isl_local_space
*ls
;
5426 int n_div_aff
, n_div_ma
;
5427 isl_int f
, c1
, c2
, g
;
5429 ma
= isl_multi_aff_align_divs(ma
);
5433 n_div_aff
= isl_aff_dim(aff
, isl_dim_div
);
5434 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
5436 ls
= isl_aff_get_domain_local_space(aff
);
5437 ls
= isl_local_space_preimage_multi_aff(ls
, isl_multi_aff_copy(ma
));
5438 res
= isl_aff_alloc(ls
);
5447 isl_seq_preimage(res
->v
->el
, aff
->v
->el
, ma
, 0, 0, n_div_ma
, n_div_aff
,
5456 isl_multi_aff_free(ma
);
5457 res
= isl_aff_normalize(res
);
5461 isl_multi_aff_free(ma
);
5466 /* Compute the pullback of "aff1" by the function represented by "aff2".
5467 * In other words, plug in "aff2" in "aff1". The result is an affine expression
5468 * defined over the domain space of "aff1".
5470 * The domain of "aff1" should match the range of "aff2", which means
5471 * that it should be single-dimensional.
5473 __isl_give isl_aff
*isl_aff_pullback_aff(__isl_take isl_aff
*aff1
,
5474 __isl_take isl_aff
*aff2
)
5478 ma
= isl_multi_aff_from_aff(aff2
);
5479 return isl_aff_pullback_multi_aff(aff1
, ma
);
5482 /* Compute the pullback of "ma1" by the function represented by "ma2".
5483 * In other words, plug in "ma2" in "ma1".
5485 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
5487 static __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff_aligned(
5488 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5491 isl_space
*space
= NULL
;
5493 ma2
= isl_multi_aff_align_divs(ma2
);
5494 ma1
= isl_multi_aff_cow(ma1
);
5498 space
= isl_space_join(isl_multi_aff_get_space(ma2
),
5499 isl_multi_aff_get_space(ma1
));
5501 for (i
= 0; i
< ma1
->n
; ++i
) {
5502 ma1
->p
[i
] = isl_aff_pullback_multi_aff(ma1
->p
[i
],
5503 isl_multi_aff_copy(ma2
));
5508 ma1
= isl_multi_aff_reset_space(ma1
, space
);
5509 isl_multi_aff_free(ma2
);
5512 isl_space_free(space
);
5513 isl_multi_aff_free(ma2
);
5514 isl_multi_aff_free(ma1
);
5518 /* Compute the pullback of "ma1" by the function represented by "ma2".
5519 * In other words, plug in "ma2" in "ma1".
5521 __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff(
5522 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5524 return isl_multi_aff_align_params_multi_multi_and(ma1
, ma2
,
5525 &isl_multi_aff_pullback_multi_aff_aligned
);
5528 /* Extend the local space of "dst" to include the divs
5529 * in the local space of "src".
5531 * If "src" does not have any divs or if the local spaces of "dst" and
5532 * "src" are the same, then no extension is required.
5534 __isl_give isl_aff
*isl_aff_align_divs(__isl_take isl_aff
*dst
,
5535 __isl_keep isl_aff
*src
)
5538 int src_n_div
, dst_n_div
;
5545 return isl_aff_free(dst
);
5547 ctx
= isl_aff_get_ctx(src
);
5548 equal
= isl_local_space_has_equal_space(src
->ls
, dst
->ls
);
5550 return isl_aff_free(dst
);
5552 isl_die(ctx
, isl_error_invalid
,
5553 "spaces don't match", goto error
);
5555 src_n_div
= isl_local_space_dim(src
->ls
, isl_dim_div
);
5558 equal
= isl_local_space_is_equal(src
->ls
, dst
->ls
);
5560 return isl_aff_free(dst
);
5564 dst_n_div
= isl_local_space_dim(dst
->ls
, isl_dim_div
);
5565 exp1
= isl_alloc_array(ctx
, int, src_n_div
);
5566 exp2
= isl_alloc_array(ctx
, int, dst_n_div
);
5567 if (!exp1
|| (dst_n_div
&& !exp2
))
5570 div
= isl_merge_divs(src
->ls
->div
, dst
->ls
->div
, exp1
, exp2
);
5571 dst
= isl_aff_expand_divs(dst
, div
, exp2
);
5579 return isl_aff_free(dst
);
5582 /* Adjust the local spaces of the affine expressions in "maff"
5583 * such that they all have the save divs.
5585 __isl_give isl_multi_aff
*isl_multi_aff_align_divs(
5586 __isl_take isl_multi_aff
*maff
)
5594 maff
= isl_multi_aff_cow(maff
);
5598 for (i
= 1; i
< maff
->n
; ++i
)
5599 maff
->p
[0] = isl_aff_align_divs(maff
->p
[0], maff
->p
[i
]);
5600 for (i
= 1; i
< maff
->n
; ++i
) {
5601 maff
->p
[i
] = isl_aff_align_divs(maff
->p
[i
], maff
->p
[0]);
5603 return isl_multi_aff_free(maff
);
5609 __isl_give isl_aff
*isl_aff_lift(__isl_take isl_aff
*aff
)
5611 aff
= isl_aff_cow(aff
);
5615 aff
->ls
= isl_local_space_lift(aff
->ls
);
5617 return isl_aff_free(aff
);
5622 /* Lift "maff" to a space with extra dimensions such that the result
5623 * has no more existentially quantified variables.
5624 * If "ls" is not NULL, then *ls is assigned the local space that lies
5625 * at the basis of the lifting applied to "maff".
5627 __isl_give isl_multi_aff
*isl_multi_aff_lift(__isl_take isl_multi_aff
*maff
,
5628 __isl_give isl_local_space
**ls
)
5642 isl_space
*space
= isl_multi_aff_get_domain_space(maff
);
5643 *ls
= isl_local_space_from_space(space
);
5645 return isl_multi_aff_free(maff
);
5650 maff
= isl_multi_aff_cow(maff
);
5651 maff
= isl_multi_aff_align_divs(maff
);
5655 n_div
= isl_aff_dim(maff
->p
[0], isl_dim_div
);
5656 space
= isl_multi_aff_get_space(maff
);
5657 space
= isl_space_lift(isl_space_domain(space
), n_div
);
5658 space
= isl_space_extend_domain_with_range(space
,
5659 isl_multi_aff_get_space(maff
));
5661 return isl_multi_aff_free(maff
);
5662 isl_space_free(maff
->space
);
5663 maff
->space
= space
;
5666 *ls
= isl_aff_get_domain_local_space(maff
->p
[0]);
5668 return isl_multi_aff_free(maff
);
5671 for (i
= 0; i
< maff
->n
; ++i
) {
5672 maff
->p
[i
] = isl_aff_lift(maff
->p
[i
]);
5680 isl_local_space_free(*ls
);
5681 return isl_multi_aff_free(maff
);
5685 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
5687 __isl_give isl_pw_aff
*isl_pw_multi_aff_get_pw_aff(
5688 __isl_keep isl_pw_multi_aff
*pma
, int pos
)
5698 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
5699 if (pos
< 0 || pos
>= n_out
)
5700 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5701 "index out of bounds", return NULL
);
5703 space
= isl_pw_multi_aff_get_space(pma
);
5704 space
= isl_space_drop_dims(space
, isl_dim_out
,
5705 pos
+ 1, n_out
- pos
- 1);
5706 space
= isl_space_drop_dims(space
, isl_dim_out
, 0, pos
);
5708 pa
= isl_pw_aff_alloc_size(space
, pma
->n
);
5709 for (i
= 0; i
< pma
->n
; ++i
) {
5711 aff
= isl_multi_aff_get_aff(pma
->p
[i
].maff
, pos
);
5712 pa
= isl_pw_aff_add_piece(pa
, isl_set_copy(pma
->p
[i
].set
), aff
);
5718 /* Return an isl_pw_multi_aff with the given "set" as domain and
5719 * an unnamed zero-dimensional range.
5721 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_domain(
5722 __isl_take isl_set
*set
)
5727 space
= isl_set_get_space(set
);
5728 space
= isl_space_from_domain(space
);
5729 ma
= isl_multi_aff_zero(space
);
5730 return isl_pw_multi_aff_alloc(set
, ma
);
5733 /* Add an isl_pw_multi_aff with the given "set" as domain and
5734 * an unnamed zero-dimensional range to *user.
5736 static isl_stat
add_pw_multi_aff_from_domain(__isl_take isl_set
*set
,
5739 isl_union_pw_multi_aff
**upma
= user
;
5740 isl_pw_multi_aff
*pma
;
5742 pma
= isl_pw_multi_aff_from_domain(set
);
5743 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5748 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
5749 * an unnamed zero-dimensional range.
5751 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_domain(
5752 __isl_take isl_union_set
*uset
)
5755 isl_union_pw_multi_aff
*upma
;
5760 space
= isl_union_set_get_space(uset
);
5761 upma
= isl_union_pw_multi_aff_empty(space
);
5763 if (isl_union_set_foreach_set(uset
,
5764 &add_pw_multi_aff_from_domain
, &upma
) < 0)
5767 isl_union_set_free(uset
);
5770 isl_union_set_free(uset
);
5771 isl_union_pw_multi_aff_free(upma
);
5775 /* Convert "pma" to an isl_map and add it to *umap.
5777 static isl_stat
map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
,
5780 isl_union_map
**umap
= user
;
5783 map
= isl_map_from_pw_multi_aff(pma
);
5784 *umap
= isl_union_map_add_map(*umap
, map
);
5789 /* Construct a union map mapping the domain of the union
5790 * piecewise multi-affine expression to its range, with each dimension
5791 * in the range equated to the corresponding affine expression on its cell.
5793 __isl_give isl_union_map
*isl_union_map_from_union_pw_multi_aff(
5794 __isl_take isl_union_pw_multi_aff
*upma
)
5797 isl_union_map
*umap
;
5802 space
= isl_union_pw_multi_aff_get_space(upma
);
5803 umap
= isl_union_map_empty(space
);
5805 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
5806 &map_from_pw_multi_aff
, &umap
) < 0)
5809 isl_union_pw_multi_aff_free(upma
);
5812 isl_union_pw_multi_aff_free(upma
);
5813 isl_union_map_free(umap
);
5817 /* Local data for bin_entry and the callback "fn".
5819 struct isl_union_pw_multi_aff_bin_data
{
5820 isl_union_pw_multi_aff
*upma2
;
5821 isl_union_pw_multi_aff
*res
;
5822 isl_pw_multi_aff
*pma
;
5823 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
);
5826 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
5827 * and call data->fn for each isl_pw_multi_aff in data->upma2.
5829 static isl_stat
bin_entry(__isl_take isl_pw_multi_aff
*pma
, void *user
)
5831 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5835 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma2
,
5837 isl_pw_multi_aff_free(pma
);
5842 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
5843 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
5844 * passed as user field) and the isl_pw_multi_aff from upma2 is available
5845 * as *entry. The callback should adjust data->res if desired.
5847 static __isl_give isl_union_pw_multi_aff
*bin_op(
5848 __isl_take isl_union_pw_multi_aff
*upma1
,
5849 __isl_take isl_union_pw_multi_aff
*upma2
,
5850 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
))
5853 struct isl_union_pw_multi_aff_bin_data data
= { NULL
, NULL
, NULL
, fn
};
5855 space
= isl_union_pw_multi_aff_get_space(upma2
);
5856 upma1
= isl_union_pw_multi_aff_align_params(upma1
, space
);
5857 space
= isl_union_pw_multi_aff_get_space(upma1
);
5858 upma2
= isl_union_pw_multi_aff_align_params(upma2
, space
);
5860 if (!upma1
|| !upma2
)
5864 data
.res
= isl_union_pw_multi_aff_alloc_same_size(upma1
);
5865 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma1
,
5866 &bin_entry
, &data
) < 0)
5869 isl_union_pw_multi_aff_free(upma1
);
5870 isl_union_pw_multi_aff_free(upma2
);
5873 isl_union_pw_multi_aff_free(upma1
);
5874 isl_union_pw_multi_aff_free(upma2
);
5875 isl_union_pw_multi_aff_free(data
.res
);
5879 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5880 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5882 static __isl_give isl_pw_multi_aff
*pw_multi_aff_range_product(
5883 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5887 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5888 isl_pw_multi_aff_get_space(pma2
));
5889 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5890 &isl_multi_aff_range_product
);
5893 /* Given two isl_pw_multi_affs A -> B and C -> D,
5894 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5896 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_product(
5897 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5899 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5900 &pw_multi_aff_range_product
);
5903 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5904 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5906 static __isl_give isl_pw_multi_aff
*pw_multi_aff_flat_range_product(
5907 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5911 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5912 isl_pw_multi_aff_get_space(pma2
));
5913 space
= isl_space_flatten_range(space
);
5914 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5915 &isl_multi_aff_flat_range_product
);
5918 /* Given two isl_pw_multi_affs A -> B and C -> D,
5919 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5921 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_flat_range_product(
5922 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5924 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5925 &pw_multi_aff_flat_range_product
);
5928 /* If data->pma and "pma2" have the same domain space, then compute
5929 * their flat range product and the result to data->res.
5931 static isl_stat
flat_range_product_entry(__isl_take isl_pw_multi_aff
*pma2
,
5934 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5936 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
5937 pma2
->dim
, isl_dim_in
)) {
5938 isl_pw_multi_aff_free(pma2
);
5942 pma2
= isl_pw_multi_aff_flat_range_product(
5943 isl_pw_multi_aff_copy(data
->pma
), pma2
);
5945 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
5950 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
5951 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
5953 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_flat_range_product(
5954 __isl_take isl_union_pw_multi_aff
*upma1
,
5955 __isl_take isl_union_pw_multi_aff
*upma2
)
5957 return bin_op(upma1
, upma2
, &flat_range_product_entry
);
5960 /* Replace the affine expressions at position "pos" in "pma" by "pa".
5961 * The parameters are assumed to have been aligned.
5963 * The implementation essentially performs an isl_pw_*_on_shared_domain,
5964 * except that it works on two different isl_pw_* types.
5966 static __isl_give isl_pw_multi_aff
*pw_multi_aff_set_pw_aff(
5967 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
5968 __isl_take isl_pw_aff
*pa
)
5971 isl_pw_multi_aff
*res
= NULL
;
5976 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_in
,
5977 pa
->dim
, isl_dim_in
))
5978 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5979 "domains don't match", goto error
);
5980 if (pos
>= isl_pw_multi_aff_dim(pma
, isl_dim_out
))
5981 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5982 "index out of bounds", goto error
);
5985 res
= isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma
), n
);
5987 for (i
= 0; i
< pma
->n
; ++i
) {
5988 for (j
= 0; j
< pa
->n
; ++j
) {
5990 isl_multi_aff
*res_ij
;
5993 common
= isl_set_intersect(isl_set_copy(pma
->p
[i
].set
),
5994 isl_set_copy(pa
->p
[j
].set
));
5995 empty
= isl_set_plain_is_empty(common
);
5996 if (empty
< 0 || empty
) {
5997 isl_set_free(common
);
6003 res_ij
= isl_multi_aff_set_aff(
6004 isl_multi_aff_copy(pma
->p
[i
].maff
), pos
,
6005 isl_aff_copy(pa
->p
[j
].aff
));
6006 res_ij
= isl_multi_aff_gist(res_ij
,
6007 isl_set_copy(common
));
6009 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
6013 isl_pw_multi_aff_free(pma
);
6014 isl_pw_aff_free(pa
);
6017 isl_pw_multi_aff_free(pma
);
6018 isl_pw_aff_free(pa
);
6019 return isl_pw_multi_aff_free(res
);
6022 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6024 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_set_pw_aff(
6025 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6026 __isl_take isl_pw_aff
*pa
)
6030 if (isl_space_match(pma
->dim
, isl_dim_param
, pa
->dim
, isl_dim_param
))
6031 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6032 if (!isl_space_has_named_params(pma
->dim
) ||
6033 !isl_space_has_named_params(pa
->dim
))
6034 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6035 "unaligned unnamed parameters", goto error
);
6036 pma
= isl_pw_multi_aff_align_params(pma
, isl_pw_aff_get_space(pa
));
6037 pa
= isl_pw_aff_align_params(pa
, isl_pw_multi_aff_get_space(pma
));
6038 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6040 isl_pw_multi_aff_free(pma
);
6041 isl_pw_aff_free(pa
);
6045 /* Do the parameters of "pa" match those of "space"?
6047 int isl_pw_aff_matching_params(__isl_keep isl_pw_aff
*pa
,
6048 __isl_keep isl_space
*space
)
6050 isl_space
*pa_space
;
6056 pa_space
= isl_pw_aff_get_space(pa
);
6058 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
6060 isl_space_free(pa_space
);
6064 /* Check that the domain space of "pa" matches "space".
6066 * Return 0 on success and -1 on error.
6068 int isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff
*pa
,
6069 __isl_keep isl_space
*space
)
6071 isl_space
*pa_space
;
6077 pa_space
= isl_pw_aff_get_space(pa
);
6079 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
6083 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6084 "parameters don't match", goto error
);
6085 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
6086 pa_space
, isl_dim_in
);
6090 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6091 "domains don't match", goto error
);
6092 isl_space_free(pa_space
);
6095 isl_space_free(pa_space
);
6104 #include <isl_multi_templ.c>
6105 #include <isl_multi_apply_set.c>
6106 #include <isl_multi_coalesce.c>
6107 #include <isl_multi_gist.c>
6108 #include <isl_multi_hash.c>
6109 #include <isl_multi_intersect.c>
6111 /* Scale the elements of "pma" by the corresponding elements of "mv".
6113 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_scale_multi_val(
6114 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
)
6118 pma
= isl_pw_multi_aff_cow(pma
);
6121 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6122 mv
->space
, isl_dim_set
))
6123 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6124 "spaces don't match", goto error
);
6125 if (!isl_space_match(pma
->dim
, isl_dim_param
,
6126 mv
->space
, isl_dim_param
)) {
6127 pma
= isl_pw_multi_aff_align_params(pma
,
6128 isl_multi_val_get_space(mv
));
6129 mv
= isl_multi_val_align_params(mv
,
6130 isl_pw_multi_aff_get_space(pma
));
6135 for (i
= 0; i
< pma
->n
; ++i
) {
6136 pma
->p
[i
].maff
= isl_multi_aff_scale_multi_val(pma
->p
[i
].maff
,
6137 isl_multi_val_copy(mv
));
6138 if (!pma
->p
[i
].maff
)
6142 isl_multi_val_free(mv
);
6145 isl_multi_val_free(mv
);
6146 isl_pw_multi_aff_free(pma
);
6150 /* This function is called for each entry of an isl_union_pw_multi_aff.
6151 * If the space of the entry matches that of data->mv,
6152 * then apply isl_pw_multi_aff_scale_multi_val and return the result.
6153 * Otherwise, return an empty isl_pw_multi_aff.
6155 static __isl_give isl_pw_multi_aff
*union_pw_multi_aff_scale_multi_val_entry(
6156 __isl_take isl_pw_multi_aff
*pma
, void *user
)
6158 isl_multi_val
*mv
= user
;
6162 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6163 mv
->space
, isl_dim_set
)) {
6164 isl_space
*space
= isl_pw_multi_aff_get_space(pma
);
6165 isl_pw_multi_aff_free(pma
);
6166 return isl_pw_multi_aff_empty(space
);
6169 return isl_pw_multi_aff_scale_multi_val(pma
, isl_multi_val_copy(mv
));
6172 /* Scale the elements of "upma" by the corresponding elements of "mv",
6173 * for those entries that match the space of "mv".
6175 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_scale_multi_val(
6176 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_multi_val
*mv
)
6178 upma
= isl_union_pw_multi_aff_align_params(upma
,
6179 isl_multi_val_get_space(mv
));
6180 mv
= isl_multi_val_align_params(mv
,
6181 isl_union_pw_multi_aff_get_space(upma
));
6185 return isl_union_pw_multi_aff_transform(upma
,
6186 &union_pw_multi_aff_scale_multi_val_entry
, mv
);
6188 isl_multi_val_free(mv
);
6191 isl_multi_val_free(mv
);
6192 isl_union_pw_multi_aff_free(upma
);
6196 /* Construct and return a piecewise multi affine expression
6197 * in the given space with value zero in each of the output dimensions and
6198 * a universe domain.
6200 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_zero(__isl_take isl_space
*space
)
6202 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space
));
6205 /* Construct and return a piecewise multi affine expression
6206 * that is equal to the given piecewise affine expression.
6208 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_pw_aff(
6209 __isl_take isl_pw_aff
*pa
)
6213 isl_pw_multi_aff
*pma
;
6218 space
= isl_pw_aff_get_space(pa
);
6219 pma
= isl_pw_multi_aff_alloc_size(space
, pa
->n
);
6221 for (i
= 0; i
< pa
->n
; ++i
) {
6225 set
= isl_set_copy(pa
->p
[i
].set
);
6226 ma
= isl_multi_aff_from_aff(isl_aff_copy(pa
->p
[i
].aff
));
6227 pma
= isl_pw_multi_aff_add_piece(pma
, set
, ma
);
6230 isl_pw_aff_free(pa
);
6234 /* Construct a set or map mapping the shared (parameter) domain
6235 * of the piecewise affine expressions to the range of "mpa"
6236 * with each dimension in the range equated to the
6237 * corresponding piecewise affine expression.
6239 static __isl_give isl_map
*map_from_multi_pw_aff(
6240 __isl_take isl_multi_pw_aff
*mpa
)
6249 if (isl_space_dim(mpa
->space
, isl_dim_out
) != mpa
->n
)
6250 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6251 "invalid space", goto error
);
6253 space
= isl_multi_pw_aff_get_domain_space(mpa
);
6254 map
= isl_map_universe(isl_space_from_domain(space
));
6256 for (i
= 0; i
< mpa
->n
; ++i
) {
6260 pa
= isl_pw_aff_copy(mpa
->p
[i
]);
6261 map_i
= map_from_pw_aff(pa
);
6263 map
= isl_map_flat_range_product(map
, map_i
);
6266 map
= isl_map_reset_space(map
, isl_multi_pw_aff_get_space(mpa
));
6268 isl_multi_pw_aff_free(mpa
);
6271 isl_multi_pw_aff_free(mpa
);
6275 /* Construct a map mapping the shared domain
6276 * of the piecewise affine expressions to the range of "mpa"
6277 * with each dimension in the range equated to the
6278 * corresponding piecewise affine expression.
6280 __isl_give isl_map
*isl_map_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6284 if (isl_space_is_set(mpa
->space
))
6285 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6286 "space of input is not a map", goto error
);
6288 return map_from_multi_pw_aff(mpa
);
6290 isl_multi_pw_aff_free(mpa
);
6294 /* Construct a set mapping the shared parameter domain
6295 * of the piecewise affine expressions to the space of "mpa"
6296 * with each dimension in the range equated to the
6297 * corresponding piecewise affine expression.
6299 __isl_give isl_set
*isl_set_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6303 if (!isl_space_is_set(mpa
->space
))
6304 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6305 "space of input is not a set", goto error
);
6307 return map_from_multi_pw_aff(mpa
);
6309 isl_multi_pw_aff_free(mpa
);
6313 /* Construct and return a piecewise multi affine expression
6314 * that is equal to the given multi piecewise affine expression
6315 * on the shared domain of the piecewise affine expressions.
6317 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff(
6318 __isl_take isl_multi_pw_aff
*mpa
)
6323 isl_pw_multi_aff
*pma
;
6328 space
= isl_multi_pw_aff_get_space(mpa
);
6331 isl_multi_pw_aff_free(mpa
);
6332 return isl_pw_multi_aff_zero(space
);
6335 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, 0);
6336 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
6338 for (i
= 1; i
< mpa
->n
; ++i
) {
6339 isl_pw_multi_aff
*pma_i
;
6341 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6342 pma_i
= isl_pw_multi_aff_from_pw_aff(pa
);
6343 pma
= isl_pw_multi_aff_range_product(pma
, pma_i
);
6346 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
6348 isl_multi_pw_aff_free(mpa
);
6352 /* Construct and return a multi piecewise affine expression
6353 * that is equal to the given multi affine expression.
6355 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_multi_aff(
6356 __isl_take isl_multi_aff
*ma
)
6359 isl_multi_pw_aff
*mpa
;
6364 n
= isl_multi_aff_dim(ma
, isl_dim_out
);
6365 mpa
= isl_multi_pw_aff_alloc(isl_multi_aff_get_space(ma
));
6367 for (i
= 0; i
< n
; ++i
) {
6370 pa
= isl_pw_aff_from_aff(isl_multi_aff_get_aff(ma
, i
));
6371 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6374 isl_multi_aff_free(ma
);
6378 /* Construct and return a multi piecewise affine expression
6379 * that is equal to the given piecewise multi affine expression.
6381 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_pw_multi_aff(
6382 __isl_take isl_pw_multi_aff
*pma
)
6386 isl_multi_pw_aff
*mpa
;
6391 n
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
6392 space
= isl_pw_multi_aff_get_space(pma
);
6393 mpa
= isl_multi_pw_aff_alloc(space
);
6395 for (i
= 0; i
< n
; ++i
) {
6398 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
6399 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6402 isl_pw_multi_aff_free(pma
);
6406 /* Do "pa1" and "pa2" represent the same function?
6408 * We first check if they are obviously equal.
6409 * If not, we convert them to maps and check if those are equal.
6411 * If "pa1" or "pa2" contain any NaNs, then they are considered
6412 * not to be the same. A NaN is not equal to anything, not even
6415 isl_bool
isl_pw_aff_is_equal(__isl_keep isl_pw_aff
*pa1
,
6416 __isl_keep isl_pw_aff
*pa2
)
6420 isl_map
*map1
, *map2
;
6423 return isl_bool_error
;
6425 equal
= isl_pw_aff_plain_is_equal(pa1
, pa2
);
6426 if (equal
< 0 || equal
)
6428 has_nan
= isl_pw_aff_involves_nan(pa1
);
6429 if (has_nan
>= 0 && !has_nan
)
6430 has_nan
= isl_pw_aff_involves_nan(pa2
);
6432 return isl_bool_error
;
6434 return isl_bool_false
;
6436 map1
= map_from_pw_aff(isl_pw_aff_copy(pa1
));
6437 map2
= map_from_pw_aff(isl_pw_aff_copy(pa2
));
6438 equal
= isl_map_is_equal(map1
, map2
);
6445 /* Do "mpa1" and "mpa2" represent the same function?
6447 * Note that we cannot convert the entire isl_multi_pw_aff
6448 * to a map because the domains of the piecewise affine expressions
6449 * may not be the same.
6451 isl_bool
isl_multi_pw_aff_is_equal(__isl_keep isl_multi_pw_aff
*mpa1
,
6452 __isl_keep isl_multi_pw_aff
*mpa2
)
6458 return isl_bool_error
;
6460 if (!isl_space_match(mpa1
->space
, isl_dim_param
,
6461 mpa2
->space
, isl_dim_param
)) {
6462 if (!isl_space_has_named_params(mpa1
->space
))
6463 return isl_bool_false
;
6464 if (!isl_space_has_named_params(mpa2
->space
))
6465 return isl_bool_false
;
6466 mpa1
= isl_multi_pw_aff_copy(mpa1
);
6467 mpa2
= isl_multi_pw_aff_copy(mpa2
);
6468 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6469 isl_multi_pw_aff_get_space(mpa2
));
6470 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6471 isl_multi_pw_aff_get_space(mpa1
));
6472 equal
= isl_multi_pw_aff_is_equal(mpa1
, mpa2
);
6473 isl_multi_pw_aff_free(mpa1
);
6474 isl_multi_pw_aff_free(mpa2
);
6478 equal
= isl_space_is_equal(mpa1
->space
, mpa2
->space
);
6479 if (equal
< 0 || !equal
)
6482 for (i
= 0; i
< mpa1
->n
; ++i
) {
6483 equal
= isl_pw_aff_is_equal(mpa1
->p
[i
], mpa2
->p
[i
]);
6484 if (equal
< 0 || !equal
)
6488 return isl_bool_true
;
6491 /* Do "pma1" and "pma2" represent the same function?
6493 * First check if they are obviously equal.
6494 * If not, then convert them to maps and check if those are equal.
6496 * If "pa1" or "pa2" contain any NaNs, then they are considered
6497 * not to be the same. A NaN is not equal to anything, not even
6500 isl_bool
isl_pw_multi_aff_is_equal(__isl_keep isl_pw_multi_aff
*pma1
,
6501 __isl_keep isl_pw_multi_aff
*pma2
)
6505 isl_map
*map1
, *map2
;
6508 return isl_bool_error
;
6510 equal
= isl_pw_multi_aff_plain_is_equal(pma1
, pma2
);
6511 if (equal
< 0 || equal
)
6513 has_nan
= isl_pw_multi_aff_involves_nan(pma1
);
6514 if (has_nan
>= 0 && !has_nan
)
6515 has_nan
= isl_pw_multi_aff_involves_nan(pma2
);
6516 if (has_nan
< 0 || has_nan
)
6517 return isl_bool_not(has_nan
);
6519 map1
= isl_map_from_pw_multi_aff(isl_pw_multi_aff_copy(pma1
));
6520 map2
= isl_map_from_pw_multi_aff(isl_pw_multi_aff_copy(pma2
));
6521 equal
= isl_map_is_equal(map1
, map2
);
6528 /* Compute the pullback of "mpa" by the function represented by "ma".
6529 * In other words, plug in "ma" in "mpa".
6531 * The parameters of "mpa" and "ma" are assumed to have been aligned.
6533 static __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff_aligned(
6534 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6537 isl_space
*space
= NULL
;
6539 mpa
= isl_multi_pw_aff_cow(mpa
);
6543 space
= isl_space_join(isl_multi_aff_get_space(ma
),
6544 isl_multi_pw_aff_get_space(mpa
));
6548 for (i
= 0; i
< mpa
->n
; ++i
) {
6549 mpa
->p
[i
] = isl_pw_aff_pullback_multi_aff(mpa
->p
[i
],
6550 isl_multi_aff_copy(ma
));
6555 isl_multi_aff_free(ma
);
6556 isl_space_free(mpa
->space
);
6560 isl_space_free(space
);
6561 isl_multi_pw_aff_free(mpa
);
6562 isl_multi_aff_free(ma
);
6566 /* Compute the pullback of "mpa" by the function represented by "ma".
6567 * In other words, plug in "ma" in "mpa".
6569 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff(
6570 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6574 if (isl_space_match(mpa
->space
, isl_dim_param
,
6575 ma
->space
, isl_dim_param
))
6576 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6577 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_multi_aff_get_space(ma
));
6578 ma
= isl_multi_aff_align_params(ma
, isl_multi_pw_aff_get_space(mpa
));
6579 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6581 isl_multi_pw_aff_free(mpa
);
6582 isl_multi_aff_free(ma
);
6586 /* Compute the pullback of "mpa" by the function represented by "pma".
6587 * In other words, plug in "pma" in "mpa".
6589 * The parameters of "mpa" and "mpa" are assumed to have been aligned.
6591 static __isl_give isl_multi_pw_aff
*
6592 isl_multi_pw_aff_pullback_pw_multi_aff_aligned(
6593 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6596 isl_space
*space
= NULL
;
6598 mpa
= isl_multi_pw_aff_cow(mpa
);
6602 space
= isl_space_join(isl_pw_multi_aff_get_space(pma
),
6603 isl_multi_pw_aff_get_space(mpa
));
6605 for (i
= 0; i
< mpa
->n
; ++i
) {
6606 mpa
->p
[i
] = isl_pw_aff_pullback_pw_multi_aff_aligned(mpa
->p
[i
],
6607 isl_pw_multi_aff_copy(pma
));
6612 isl_pw_multi_aff_free(pma
);
6613 isl_space_free(mpa
->space
);
6617 isl_space_free(space
);
6618 isl_multi_pw_aff_free(mpa
);
6619 isl_pw_multi_aff_free(pma
);
6623 /* Compute the pullback of "mpa" by the function represented by "pma".
6624 * In other words, plug in "pma" in "mpa".
6626 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_pw_multi_aff(
6627 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6631 if (isl_space_match(mpa
->space
, isl_dim_param
, pma
->dim
, isl_dim_param
))
6632 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6633 mpa
= isl_multi_pw_aff_align_params(mpa
,
6634 isl_pw_multi_aff_get_space(pma
));
6635 pma
= isl_pw_multi_aff_align_params(pma
,
6636 isl_multi_pw_aff_get_space(mpa
));
6637 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6639 isl_multi_pw_aff_free(mpa
);
6640 isl_pw_multi_aff_free(pma
);
6644 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6645 * with the domain of "aff". The domain of the result is the same
6647 * "mpa" and "aff" are assumed to have been aligned.
6649 * We first extract the parametric constant from "aff", defined
6650 * over the correct domain.
6651 * Then we add the appropriate combinations of the members of "mpa".
6652 * Finally, we add the integer divisions through recursive calls.
6654 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff_aligned(
6655 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6663 n_in
= isl_aff_dim(aff
, isl_dim_in
);
6664 n_div
= isl_aff_dim(aff
, isl_dim_div
);
6666 space
= isl_space_domain(isl_multi_pw_aff_get_space(mpa
));
6667 tmp
= isl_aff_copy(aff
);
6668 tmp
= isl_aff_drop_dims(tmp
, isl_dim_div
, 0, n_div
);
6669 tmp
= isl_aff_drop_dims(tmp
, isl_dim_in
, 0, n_in
);
6670 tmp
= isl_aff_add_dims(tmp
, isl_dim_in
,
6671 isl_space_dim(space
, isl_dim_set
));
6672 tmp
= isl_aff_reset_domain_space(tmp
, space
);
6673 pa
= isl_pw_aff_from_aff(tmp
);
6675 for (i
= 0; i
< n_in
; ++i
) {
6678 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
6680 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
6681 pa_i
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6682 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6683 pa
= isl_pw_aff_add(pa
, pa_i
);
6686 for (i
= 0; i
< n_div
; ++i
) {
6690 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
6692 div
= isl_aff_get_div(aff
, i
);
6693 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6694 isl_multi_pw_aff_copy(mpa
), div
);
6695 pa_i
= isl_pw_aff_floor(pa_i
);
6696 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
6697 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6698 pa
= isl_pw_aff_add(pa
, pa_i
);
6701 isl_multi_pw_aff_free(mpa
);
6707 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6708 * with the domain of "aff". The domain of the result is the same
6711 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff(
6712 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6716 if (isl_space_match(aff
->ls
->dim
, isl_dim_param
,
6717 mpa
->space
, isl_dim_param
))
6718 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6720 aff
= isl_aff_align_params(aff
, isl_multi_pw_aff_get_space(mpa
));
6721 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_aff_get_space(aff
));
6723 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6726 isl_multi_pw_aff_free(mpa
);
6730 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6731 * with the domain of "pa". The domain of the result is the same
6733 * "mpa" and "pa" are assumed to have been aligned.
6735 * We consider each piece in turn. Note that the domains of the
6736 * pieces are assumed to be disjoint and they remain disjoint
6737 * after taking the preimage (over the same function).
6739 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff_aligned(
6740 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6749 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa
),
6750 isl_pw_aff_get_space(pa
));
6751 res
= isl_pw_aff_empty(space
);
6753 for (i
= 0; i
< pa
->n
; ++i
) {
6757 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6758 isl_multi_pw_aff_copy(mpa
),
6759 isl_aff_copy(pa
->p
[i
].aff
));
6760 domain
= isl_set_copy(pa
->p
[i
].set
);
6761 domain
= isl_set_preimage_multi_pw_aff(domain
,
6762 isl_multi_pw_aff_copy(mpa
));
6763 pa_i
= isl_pw_aff_intersect_domain(pa_i
, domain
);
6764 res
= isl_pw_aff_add_disjoint(res
, pa_i
);
6767 isl_pw_aff_free(pa
);
6768 isl_multi_pw_aff_free(mpa
);
6771 isl_pw_aff_free(pa
);
6772 isl_multi_pw_aff_free(mpa
);
6776 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6777 * with the domain of "pa". The domain of the result is the same
6780 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff(
6781 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6785 if (isl_space_match(pa
->dim
, isl_dim_param
, mpa
->space
, isl_dim_param
))
6786 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6788 pa
= isl_pw_aff_align_params(pa
, isl_multi_pw_aff_get_space(mpa
));
6789 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_pw_aff_get_space(pa
));
6791 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6793 isl_pw_aff_free(pa
);
6794 isl_multi_pw_aff_free(mpa
);
6798 /* Compute the pullback of "pa" by the function represented by "mpa".
6799 * In other words, plug in "mpa" in "pa".
6800 * "pa" and "mpa" are assumed to have been aligned.
6802 * The pullback is computed by applying "pa" to "mpa".
6804 static __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff_aligned(
6805 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6807 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6810 /* Compute the pullback of "pa" by the function represented by "mpa".
6811 * In other words, plug in "mpa" in "pa".
6813 * The pullback is computed by applying "pa" to "mpa".
6815 __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff(
6816 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6818 return isl_multi_pw_aff_apply_pw_aff(mpa
, pa
);
6821 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6822 * In other words, plug in "mpa2" in "mpa1".
6824 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6826 * We pullback each member of "mpa1" in turn.
6828 static __isl_give isl_multi_pw_aff
*
6829 isl_multi_pw_aff_pullback_multi_pw_aff_aligned(
6830 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6833 isl_space
*space
= NULL
;
6835 mpa1
= isl_multi_pw_aff_cow(mpa1
);
6839 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa2
),
6840 isl_multi_pw_aff_get_space(mpa1
));
6842 for (i
= 0; i
< mpa1
->n
; ++i
) {
6843 mpa1
->p
[i
] = isl_pw_aff_pullback_multi_pw_aff_aligned(
6844 mpa1
->p
[i
], isl_multi_pw_aff_copy(mpa2
));
6849 mpa1
= isl_multi_pw_aff_reset_space(mpa1
, space
);
6851 isl_multi_pw_aff_free(mpa2
);
6854 isl_space_free(space
);
6855 isl_multi_pw_aff_free(mpa1
);
6856 isl_multi_pw_aff_free(mpa2
);
6860 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6861 * In other words, plug in "mpa2" in "mpa1".
6863 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_pw_aff(
6864 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6866 return isl_multi_pw_aff_align_params_multi_multi_and(mpa1
, mpa2
,
6867 &isl_multi_pw_aff_pullback_multi_pw_aff_aligned
);
6870 /* Align the parameters of "mpa1" and "mpa2", check that the ranges
6871 * of "mpa1" and "mpa2" live in the same space, construct map space
6872 * between the domain spaces of "mpa1" and "mpa2" and call "order"
6873 * with this map space as extract argument.
6875 static __isl_give isl_map
*isl_multi_pw_aff_order_map(
6876 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6877 __isl_give isl_map
*(*order
)(__isl_keep isl_multi_pw_aff
*mpa1
,
6878 __isl_keep isl_multi_pw_aff
*mpa2
, __isl_take isl_space
*space
))
6881 isl_space
*space1
, *space2
;
6884 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6885 isl_multi_pw_aff_get_space(mpa2
));
6886 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6887 isl_multi_pw_aff_get_space(mpa1
));
6890 match
= isl_space_tuple_is_equal(mpa1
->space
, isl_dim_out
,
6891 mpa2
->space
, isl_dim_out
);
6895 isl_die(isl_multi_pw_aff_get_ctx(mpa1
), isl_error_invalid
,
6896 "range spaces don't match", goto error
);
6897 space1
= isl_space_domain(isl_multi_pw_aff_get_space(mpa1
));
6898 space2
= isl_space_domain(isl_multi_pw_aff_get_space(mpa2
));
6899 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
6901 res
= order(mpa1
, mpa2
, space1
);
6902 isl_multi_pw_aff_free(mpa1
);
6903 isl_multi_pw_aff_free(mpa2
);
6906 isl_multi_pw_aff_free(mpa1
);
6907 isl_multi_pw_aff_free(mpa2
);
6911 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6912 * where the function values are equal. "space" is the space of the result.
6913 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6915 * "mpa1" and "mpa2" are equal when each of the pairs of elements
6916 * in the sequences are equal.
6918 static __isl_give isl_map
*isl_multi_pw_aff_eq_map_on_space(
6919 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
6920 __isl_take isl_space
*space
)
6925 res
= isl_map_universe(space
);
6927 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
6928 for (i
= 0; i
< n
; ++i
) {
6929 isl_pw_aff
*pa1
, *pa2
;
6932 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6933 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6934 map
= isl_pw_aff_eq_map(pa1
, pa2
);
6935 res
= isl_map_intersect(res
, map
);
6941 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6942 * where the function values are equal.
6944 __isl_give isl_map
*isl_multi_pw_aff_eq_map(__isl_take isl_multi_pw_aff
*mpa1
,
6945 __isl_take isl_multi_pw_aff
*mpa2
)
6947 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
6948 &isl_multi_pw_aff_eq_map_on_space
);
6951 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6952 * where the function values of "mpa1" is lexicographically satisfies "base"
6953 * compared to that of "mpa2". "space" is the space of the result.
6954 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6956 * "mpa1" lexicographically satisfies "base" compared to "mpa2"
6957 * if its i-th element satisfies "base" when compared to
6958 * the i-th element of "mpa2" while all previous elements are
6961 static __isl_give isl_map
*isl_multi_pw_aff_lex_map_on_space(
6962 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6963 __isl_give isl_map
*(*base
)(__isl_take isl_pw_aff
*pa1
,
6964 __isl_take isl_pw_aff
*pa2
),
6965 __isl_take isl_space
*space
)
6968 isl_map
*res
, *rest
;
6970 res
= isl_map_empty(isl_space_copy(space
));
6971 rest
= isl_map_universe(space
);
6973 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
6974 for (i
= 0; i
< n
; ++i
) {
6975 isl_pw_aff
*pa1
, *pa2
;
6978 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6979 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6980 map
= base(pa1
, pa2
);
6981 map
= isl_map_intersect(map
, isl_map_copy(rest
));
6982 res
= isl_map_union(res
, map
);
6987 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6988 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6989 map
= isl_pw_aff_eq_map(pa1
, pa2
);
6990 rest
= isl_map_intersect(rest
, map
);
6997 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6998 * where the function value of "mpa1" is lexicographically less than that
6999 * of "mpa2". "space" is the space of the result.
7000 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7002 * "mpa1" is less than "mpa2" if its i-th element is smaller
7003 * than the i-th element of "mpa2" while all previous elements are
7006 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map_on_space(
7007 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
7008 __isl_take isl_space
*space
)
7010 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
7011 &isl_pw_aff_lt_map
, space
);
7014 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7015 * where the function value of "mpa1" is lexicographically less than that
7018 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map(
7019 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
7021 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7022 &isl_multi_pw_aff_lex_lt_map_on_space
);
7025 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7026 * where the function value of "mpa1" is lexicographically greater than that
7027 * of "mpa2". "space" is the space of the result.
7028 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
7030 * "mpa1" is greater than "mpa2" if its i-th element is greater
7031 * than the i-th element of "mpa2" while all previous elements are
7034 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map_on_space(
7035 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
7036 __isl_take isl_space
*space
)
7038 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
7039 &isl_pw_aff_gt_map
, space
);
7042 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
7043 * where the function value of "mpa1" is lexicographically greater than that
7046 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map(
7047 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
7049 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
7050 &isl_multi_pw_aff_lex_gt_map_on_space
);
7053 /* Compare two isl_affs.
7055 * Return -1 if "aff1" is "smaller" than "aff2", 1 if "aff1" is "greater"
7056 * than "aff2" and 0 if they are equal.
7058 * The order is fairly arbitrary. We do consider expressions that only involve
7059 * earlier dimensions as "smaller".
7061 int isl_aff_plain_cmp(__isl_keep isl_aff
*aff1
, __isl_keep isl_aff
*aff2
)
7074 cmp
= isl_local_space_cmp(aff1
->ls
, aff2
->ls
);
7078 last1
= isl_seq_last_non_zero(aff1
->v
->el
+ 1, aff1
->v
->size
- 1);
7079 last2
= isl_seq_last_non_zero(aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
7081 return last1
- last2
;
7083 return isl_seq_cmp(aff1
->v
->el
, aff2
->v
->el
, aff1
->v
->size
);
7086 /* Compare two isl_pw_affs.
7088 * Return -1 if "pa1" is "smaller" than "pa2", 1 if "pa1" is "greater"
7089 * than "pa2" and 0 if they are equal.
7091 * The order is fairly arbitrary. We do consider expressions that only involve
7092 * earlier dimensions as "smaller".
7094 int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff
*pa1
,
7095 __isl_keep isl_pw_aff
*pa2
)
7108 cmp
= isl_space_cmp(pa1
->dim
, pa2
->dim
);
7112 if (pa1
->n
!= pa2
->n
)
7113 return pa1
->n
- pa2
->n
;
7115 for (i
= 0; i
< pa1
->n
; ++i
) {
7116 cmp
= isl_set_plain_cmp(pa1
->p
[i
].set
, pa2
->p
[i
].set
);
7119 cmp
= isl_aff_plain_cmp(pa1
->p
[i
].aff
, pa2
->p
[i
].aff
);
7127 /* Return a piecewise affine expression that is equal to "v" on "domain".
7129 __isl_give isl_pw_aff
*isl_pw_aff_val_on_domain(__isl_take isl_set
*domain
,
7130 __isl_take isl_val
*v
)
7133 isl_local_space
*ls
;
7136 space
= isl_set_get_space(domain
);
7137 ls
= isl_local_space_from_space(space
);
7138 aff
= isl_aff_val_on_domain(ls
, v
);
7140 return isl_pw_aff_alloc(domain
, aff
);
7143 /* Return a multi affine expression that is equal to "mv" on domain
7146 __isl_give isl_multi_aff
*isl_multi_aff_multi_val_on_space(
7147 __isl_take isl_space
*space
, __isl_take isl_multi_val
*mv
)
7151 isl_local_space
*ls
;
7157 n
= isl_multi_val_dim(mv
, isl_dim_set
);
7158 space2
= isl_multi_val_get_space(mv
);
7159 space2
= isl_space_align_params(space2
, isl_space_copy(space
));
7160 space
= isl_space_align_params(space
, isl_space_copy(space2
));
7161 space
= isl_space_map_from_domain_and_range(space
, space2
);
7162 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
7163 ls
= isl_local_space_from_space(isl_space_domain(space
));
7164 for (i
= 0; i
< n
; ++i
) {
7168 v
= isl_multi_val_get_val(mv
, i
);
7169 aff
= isl_aff_val_on_domain(isl_local_space_copy(ls
), v
);
7170 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
7172 isl_local_space_free(ls
);
7174 isl_multi_val_free(mv
);
7177 isl_space_free(space
);
7178 isl_multi_val_free(mv
);
7182 /* Return a piecewise multi-affine expression
7183 * that is equal to "mv" on "domain".
7185 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_multi_val_on_domain(
7186 __isl_take isl_set
*domain
, __isl_take isl_multi_val
*mv
)
7191 space
= isl_set_get_space(domain
);
7192 ma
= isl_multi_aff_multi_val_on_space(space
, mv
);
7194 return isl_pw_multi_aff_alloc(domain
, ma
);
7197 /* Internal data structure for isl_union_pw_multi_aff_multi_val_on_domain.
7198 * mv is the value that should be attained on each domain set
7199 * res collects the results
7201 struct isl_union_pw_multi_aff_multi_val_on_domain_data
{
7203 isl_union_pw_multi_aff
*res
;
7206 /* Create an isl_pw_multi_aff equal to data->mv on "domain"
7207 * and add it to data->res.
7209 static isl_stat
pw_multi_aff_multi_val_on_domain(__isl_take isl_set
*domain
,
7212 struct isl_union_pw_multi_aff_multi_val_on_domain_data
*data
= user
;
7213 isl_pw_multi_aff
*pma
;
7216 mv
= isl_multi_val_copy(data
->mv
);
7217 pma
= isl_pw_multi_aff_multi_val_on_domain(domain
, mv
);
7218 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
7220 return data
->res
? isl_stat_ok
: isl_stat_error
;
7223 /* Return a union piecewise multi-affine expression
7224 * that is equal to "mv" on "domain".
7226 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_multi_val_on_domain(
7227 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7229 struct isl_union_pw_multi_aff_multi_val_on_domain_data data
;
7232 space
= isl_union_set_get_space(domain
);
7233 data
.res
= isl_union_pw_multi_aff_empty(space
);
7235 if (isl_union_set_foreach_set(domain
,
7236 &pw_multi_aff_multi_val_on_domain
, &data
) < 0)
7237 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
7238 isl_union_set_free(domain
);
7239 isl_multi_val_free(mv
);
7243 /* Compute the pullback of data->pma by the function represented by "pma2",
7244 * provided the spaces match, and add the results to data->res.
7246 static isl_stat
pullback_entry(__isl_take isl_pw_multi_aff
*pma2
, void *user
)
7248 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
7250 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
7251 pma2
->dim
, isl_dim_out
)) {
7252 isl_pw_multi_aff_free(pma2
);
7256 pma2
= isl_pw_multi_aff_pullback_pw_multi_aff(
7257 isl_pw_multi_aff_copy(data
->pma
), pma2
);
7259 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
7261 return isl_stat_error
;
7266 /* Compute the pullback of "upma1" by the function represented by "upma2".
7268 __isl_give isl_union_pw_multi_aff
*
7269 isl_union_pw_multi_aff_pullback_union_pw_multi_aff(
7270 __isl_take isl_union_pw_multi_aff
*upma1
,
7271 __isl_take isl_union_pw_multi_aff
*upma2
)
7273 return bin_op(upma1
, upma2
, &pullback_entry
);
7276 /* Check that the domain space of "upa" matches "space".
7278 * Return 0 on success and -1 on error.
7280 * This function is called from isl_multi_union_pw_aff_set_union_pw_aff and
7281 * can in principle never fail since the space "space" is that
7282 * of the isl_multi_union_pw_aff and is a set space such that
7283 * there is no domain space to match.
7285 * We check the parameters and double-check that "space" is
7286 * indeed that of a set.
7288 static int isl_union_pw_aff_check_match_domain_space(
7289 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7291 isl_space
*upa_space
;
7297 match
= isl_space_is_set(space
);
7301 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7302 "expecting set space", return -1);
7304 upa_space
= isl_union_pw_aff_get_space(upa
);
7305 match
= isl_space_match(space
, isl_dim_param
, upa_space
, isl_dim_param
);
7309 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7310 "parameters don't match", goto error
);
7312 isl_space_free(upa_space
);
7315 isl_space_free(upa_space
);
7319 /* Do the parameters of "upa" match those of "space"?
7321 static int isl_union_pw_aff_matching_params(__isl_keep isl_union_pw_aff
*upa
,
7322 __isl_keep isl_space
*space
)
7324 isl_space
*upa_space
;
7330 upa_space
= isl_union_pw_aff_get_space(upa
);
7332 match
= isl_space_match(space
, isl_dim_param
, upa_space
, isl_dim_param
);
7334 isl_space_free(upa_space
);
7338 /* Internal data structure for isl_union_pw_aff_reset_domain_space.
7339 * space represents the new parameters.
7340 * res collects the results.
7342 struct isl_union_pw_aff_reset_params_data
{
7344 isl_union_pw_aff
*res
;
7347 /* Replace the parameters of "pa" by data->space and
7348 * add the result to data->res.
7350 static isl_stat
reset_params(__isl_take isl_pw_aff
*pa
, void *user
)
7352 struct isl_union_pw_aff_reset_params_data
*data
= user
;
7355 space
= isl_pw_aff_get_space(pa
);
7356 space
= isl_space_replace(space
, isl_dim_param
, data
->space
);
7357 pa
= isl_pw_aff_reset_space(pa
, space
);
7358 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7360 return data
->res
? isl_stat_ok
: isl_stat_error
;
7363 /* Replace the domain space of "upa" by "space".
7364 * Since a union expression does not have a (single) domain space,
7365 * "space" is necessarily a parameter space.
7367 * Since the order and the names of the parameters determine
7368 * the hash value, we need to create a new hash table.
7370 static __isl_give isl_union_pw_aff
*isl_union_pw_aff_reset_domain_space(
7371 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_space
*space
)
7373 struct isl_union_pw_aff_reset_params_data data
= { space
};
7376 match
= isl_union_pw_aff_matching_params(upa
, space
);
7378 upa
= isl_union_pw_aff_free(upa
);
7380 isl_space_free(space
);
7384 data
.res
= isl_union_pw_aff_empty(isl_space_copy(space
));
7385 if (isl_union_pw_aff_foreach_pw_aff(upa
, &reset_params
, &data
) < 0)
7386 data
.res
= isl_union_pw_aff_free(data
.res
);
7388 isl_union_pw_aff_free(upa
);
7389 isl_space_free(space
);
7393 /* Return the floor of "pa".
7395 static __isl_give isl_pw_aff
*floor_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7397 return isl_pw_aff_floor(pa
);
7400 /* Given f, return floor(f).
7402 __isl_give isl_union_pw_aff
*isl_union_pw_aff_floor(
7403 __isl_take isl_union_pw_aff
*upa
)
7405 return isl_union_pw_aff_transform_inplace(upa
, &floor_entry
, NULL
);
7410 * upa mod m = upa - m * floor(upa/m)
7412 * with m an integer value.
7414 __isl_give isl_union_pw_aff
*isl_union_pw_aff_mod_val(
7415 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_val
*m
)
7417 isl_union_pw_aff
*res
;
7422 if (!isl_val_is_int(m
))
7423 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7424 "expecting integer modulo", goto error
);
7425 if (!isl_val_is_pos(m
))
7426 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7427 "expecting positive modulo", goto error
);
7429 res
= isl_union_pw_aff_copy(upa
);
7430 upa
= isl_union_pw_aff_scale_down_val(upa
, isl_val_copy(m
));
7431 upa
= isl_union_pw_aff_floor(upa
);
7432 upa
= isl_union_pw_aff_scale_val(upa
, m
);
7433 res
= isl_union_pw_aff_sub(res
, upa
);
7438 isl_union_pw_aff_free(upa
);
7442 /* Internal data structure for isl_union_pw_aff_aff_on_domain.
7443 * "aff" is the symbolic value that the resulting isl_union_pw_aff
7445 * "res" collects the results.
7447 struct isl_union_pw_aff_aff_on_domain_data
{
7449 isl_union_pw_aff
*res
;
7452 /* Construct a piecewise affine expression that is equal to data->aff
7453 * on "domain" and add the result to data->res.
7455 static isl_stat
pw_aff_aff_on_domain(__isl_take isl_set
*domain
, void *user
)
7457 struct isl_union_pw_aff_aff_on_domain_data
*data
= user
;
7462 aff
= isl_aff_copy(data
->aff
);
7463 dim
= isl_set_dim(domain
, isl_dim_set
);
7464 aff
= isl_aff_add_dims(aff
, isl_dim_in
, dim
);
7465 aff
= isl_aff_reset_domain_space(aff
, isl_set_get_space(domain
));
7466 pa
= isl_pw_aff_alloc(domain
, aff
);
7467 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7469 return data
->res
? isl_stat_ok
: isl_stat_error
;
7472 /* Internal data structure for isl_union_pw_multi_aff_get_union_pw_aff.
7473 * pos is the output position that needs to be extracted.
7474 * res collects the results.
7476 struct isl_union_pw_multi_aff_get_union_pw_aff_data
{
7478 isl_union_pw_aff
*res
;
7481 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma"
7482 * (assuming it has such a dimension) and add it to data->res.
7484 static isl_stat
get_union_pw_aff(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7486 struct isl_union_pw_multi_aff_get_union_pw_aff_data
*data
= user
;
7491 return isl_stat_error
;
7493 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
7494 if (data
->pos
>= n_out
) {
7495 isl_pw_multi_aff_free(pma
);
7499 pa
= isl_pw_multi_aff_get_pw_aff(pma
, data
->pos
);
7500 isl_pw_multi_aff_free(pma
);
7502 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7504 return data
->res
? isl_stat_ok
: isl_stat_error
;
7507 /* Extract an isl_union_pw_aff corresponding to
7508 * output dimension "pos" of "upma".
7510 __isl_give isl_union_pw_aff
*isl_union_pw_multi_aff_get_union_pw_aff(
7511 __isl_keep isl_union_pw_multi_aff
*upma
, int pos
)
7513 struct isl_union_pw_multi_aff_get_union_pw_aff_data data
;
7520 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7521 "cannot extract at negative position", return NULL
);
7523 space
= isl_union_pw_multi_aff_get_space(upma
);
7524 data
.res
= isl_union_pw_aff_empty(space
);
7526 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
7527 &get_union_pw_aff
, &data
) < 0)
7528 data
.res
= isl_union_pw_aff_free(data
.res
);
7533 /* Return a union piecewise affine expression
7534 * that is equal to "aff" on "domain".
7536 * Construct an isl_pw_aff on each of the sets in "domain" and
7537 * collect the results.
7539 __isl_give isl_union_pw_aff
*isl_union_pw_aff_aff_on_domain(
7540 __isl_take isl_union_set
*domain
, __isl_take isl_aff
*aff
)
7542 struct isl_union_pw_aff_aff_on_domain_data data
;
7545 if (!domain
|| !aff
)
7547 if (!isl_local_space_is_params(aff
->ls
))
7548 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
7549 "expecting parametric expression", goto error
);
7551 space
= isl_union_set_get_space(domain
);
7552 data
.res
= isl_union_pw_aff_empty(space
);
7554 if (isl_union_set_foreach_set(domain
, &pw_aff_aff_on_domain
, &data
) < 0)
7555 data
.res
= isl_union_pw_aff_free(data
.res
);
7556 isl_union_set_free(domain
);
7560 isl_union_set_free(domain
);
7565 /* Internal data structure for isl_union_pw_aff_val_on_domain.
7566 * "v" is the value that the resulting isl_union_pw_aff needs to attain.
7567 * "res" collects the results.
7569 struct isl_union_pw_aff_val_on_domain_data
{
7571 isl_union_pw_aff
*res
;
7574 /* Construct a piecewise affine expression that is equal to data->v
7575 * on "domain" and add the result to data->res.
7577 static isl_stat
pw_aff_val_on_domain(__isl_take isl_set
*domain
, void *user
)
7579 struct isl_union_pw_aff_val_on_domain_data
*data
= user
;
7583 v
= isl_val_copy(data
->v
);
7584 pa
= isl_pw_aff_val_on_domain(domain
, v
);
7585 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7587 return data
->res
? isl_stat_ok
: isl_stat_error
;
7590 /* Return a union piecewise affine expression
7591 * that is equal to "v" on "domain".
7593 * Construct an isl_pw_aff on each of the sets in "domain" and
7594 * collect the results.
7596 __isl_give isl_union_pw_aff
*isl_union_pw_aff_val_on_domain(
7597 __isl_take isl_union_set
*domain
, __isl_take isl_val
*v
)
7599 struct isl_union_pw_aff_val_on_domain_data data
;
7602 space
= isl_union_set_get_space(domain
);
7603 data
.res
= isl_union_pw_aff_empty(space
);
7605 if (isl_union_set_foreach_set(domain
, &pw_aff_val_on_domain
, &data
) < 0)
7606 data
.res
= isl_union_pw_aff_free(data
.res
);
7607 isl_union_set_free(domain
);
7612 /* Construct a piecewise multi affine expression
7613 * that is equal to "pa" and add it to upma.
7615 static isl_stat
pw_multi_aff_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
,
7618 isl_union_pw_multi_aff
**upma
= user
;
7619 isl_pw_multi_aff
*pma
;
7621 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
7622 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
7624 return *upma
? isl_stat_ok
: isl_stat_error
;
7627 /* Construct and return a union piecewise multi affine expression
7628 * that is equal to the given union piecewise affine expression.
7630 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_pw_aff(
7631 __isl_take isl_union_pw_aff
*upa
)
7634 isl_union_pw_multi_aff
*upma
;
7639 space
= isl_union_pw_aff_get_space(upa
);
7640 upma
= isl_union_pw_multi_aff_empty(space
);
7642 if (isl_union_pw_aff_foreach_pw_aff(upa
,
7643 &pw_multi_aff_from_pw_aff_entry
, &upma
) < 0)
7644 upma
= isl_union_pw_multi_aff_free(upma
);
7646 isl_union_pw_aff_free(upa
);
7650 /* Compute the set of elements in the domain of "pa" where it is zero and
7651 * add this set to "uset".
7653 static isl_stat
zero_union_set(__isl_take isl_pw_aff
*pa
, void *user
)
7655 isl_union_set
**uset
= (isl_union_set
**)user
;
7657 *uset
= isl_union_set_add_set(*uset
, isl_pw_aff_zero_set(pa
));
7659 return *uset
? isl_stat_ok
: isl_stat_error
;
7662 /* Return a union set containing those elements in the domain
7663 * of "upa" where it is zero.
7665 __isl_give isl_union_set
*isl_union_pw_aff_zero_union_set(
7666 __isl_take isl_union_pw_aff
*upa
)
7668 isl_union_set
*zero
;
7670 zero
= isl_union_set_empty(isl_union_pw_aff_get_space(upa
));
7671 if (isl_union_pw_aff_foreach_pw_aff(upa
, &zero_union_set
, &zero
) < 0)
7672 zero
= isl_union_set_free(zero
);
7674 isl_union_pw_aff_free(upa
);
7678 /* Convert "pa" to an isl_map and add it to *umap.
7680 static isl_stat
map_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7682 isl_union_map
**umap
= user
;
7685 map
= isl_map_from_pw_aff(pa
);
7686 *umap
= isl_union_map_add_map(*umap
, map
);
7688 return *umap
? isl_stat_ok
: isl_stat_error
;
7691 /* Construct a union map mapping the domain of the union
7692 * piecewise affine expression to its range, with the single output dimension
7693 * equated to the corresponding affine expressions on their cells.
7695 __isl_give isl_union_map
*isl_union_map_from_union_pw_aff(
7696 __isl_take isl_union_pw_aff
*upa
)
7699 isl_union_map
*umap
;
7704 space
= isl_union_pw_aff_get_space(upa
);
7705 umap
= isl_union_map_empty(space
);
7707 if (isl_union_pw_aff_foreach_pw_aff(upa
, &map_from_pw_aff_entry
,
7709 umap
= isl_union_map_free(umap
);
7711 isl_union_pw_aff_free(upa
);
7715 /* Internal data structure for isl_union_pw_aff_pullback_union_pw_multi_aff.
7716 * upma is the function that is plugged in.
7717 * pa is the current part of the function in which upma is plugged in.
7718 * res collects the results.
7720 struct isl_union_pw_aff_pullback_upma_data
{
7721 isl_union_pw_multi_aff
*upma
;
7723 isl_union_pw_aff
*res
;
7726 /* Check if "pma" can be plugged into data->pa.
7727 * If so, perform the pullback and add the result to data->res.
7729 static isl_stat
pa_pb_pma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7731 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7734 if (!isl_space_tuple_is_equal(data
->pa
->dim
, isl_dim_in
,
7735 pma
->dim
, isl_dim_out
)) {
7736 isl_pw_multi_aff_free(pma
);
7740 pa
= isl_pw_aff_copy(data
->pa
);
7741 pa
= isl_pw_aff_pullback_pw_multi_aff(pa
, pma
);
7743 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7745 return data
->res
? isl_stat_ok
: isl_stat_error
;
7748 /* Check if any of the elements of data->upma can be plugged into pa,
7749 * add if so add the result to data->res.
7751 static isl_stat
upa_pb_upma(__isl_take isl_pw_aff
*pa
, void *user
)
7753 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7757 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma
,
7759 isl_pw_aff_free(pa
);
7764 /* Compute the pullback of "upa" by the function represented by "upma".
7765 * In other words, plug in "upma" in "upa". The result contains
7766 * expressions defined over the domain space of "upma".
7768 * Run over all pairs of elements in "upa" and "upma", perform
7769 * the pullback when appropriate and collect the results.
7770 * If the hash value were based on the domain space rather than
7771 * the function space, then we could run through all elements
7772 * of "upma" and directly pick out the corresponding element of "upa".
7774 __isl_give isl_union_pw_aff
*isl_union_pw_aff_pullback_union_pw_multi_aff(
7775 __isl_take isl_union_pw_aff
*upa
,
7776 __isl_take isl_union_pw_multi_aff
*upma
)
7778 struct isl_union_pw_aff_pullback_upma_data data
= { NULL
, NULL
};
7781 space
= isl_union_pw_multi_aff_get_space(upma
);
7782 upa
= isl_union_pw_aff_align_params(upa
, space
);
7783 space
= isl_union_pw_aff_get_space(upa
);
7784 upma
= isl_union_pw_multi_aff_align_params(upma
, space
);
7790 data
.res
= isl_union_pw_aff_alloc_same_size(upa
);
7791 if (isl_union_pw_aff_foreach_pw_aff(upa
, &upa_pb_upma
, &data
) < 0)
7792 data
.res
= isl_union_pw_aff_free(data
.res
);
7794 isl_union_pw_aff_free(upa
);
7795 isl_union_pw_multi_aff_free(upma
);
7798 isl_union_pw_aff_free(upa
);
7799 isl_union_pw_multi_aff_free(upma
);
7804 #define BASE union_pw_aff
7806 #define DOMBASE union_set
7808 #define NO_MOVE_DIMS
7817 #include <isl_multi_templ.c>
7818 #include <isl_multi_apply_set.c>
7819 #include <isl_multi_apply_union_set.c>
7820 #include <isl_multi_coalesce.c>
7821 #include <isl_multi_floor.c>
7822 #include <isl_multi_gist.c>
7823 #include <isl_multi_intersect.c>
7825 /* Construct a multiple union piecewise affine expression
7826 * in the given space with value zero in each of the output dimensions.
7828 * Since there is no canonical zero value for
7829 * a union piecewise affine expression, we can only construct
7830 * zero-dimensional "zero" value.
7832 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_zero(
7833 __isl_take isl_space
*space
)
7838 if (!isl_space_is_set(space
))
7839 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7840 "expecting set space", goto error
);
7841 if (isl_space_dim(space
, isl_dim_out
) != 0)
7842 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7843 "expecting 0D space", goto error
);
7845 return isl_multi_union_pw_aff_alloc(space
);
7847 isl_space_free(space
);
7851 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
7852 * with the actual sum on the shared domain and
7853 * the defined expression on the symmetric difference of the domains.
7855 * We simply iterate over the elements in both arguments and
7856 * call isl_union_pw_aff_union_add on each of them.
7858 static __isl_give isl_multi_union_pw_aff
*
7859 isl_multi_union_pw_aff_union_add_aligned(
7860 __isl_take isl_multi_union_pw_aff
*mupa1
,
7861 __isl_take isl_multi_union_pw_aff
*mupa2
)
7863 return isl_multi_union_pw_aff_bin_op(mupa1
, mupa2
,
7864 &isl_union_pw_aff_union_add
);
7867 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
7868 * with the actual sum on the shared domain and
7869 * the defined expression on the symmetric difference of the domains.
7871 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_union_add(
7872 __isl_take isl_multi_union_pw_aff
*mupa1
,
7873 __isl_take isl_multi_union_pw_aff
*mupa2
)
7875 return isl_multi_union_pw_aff_align_params_multi_multi_and(mupa1
, mupa2
,
7876 &isl_multi_union_pw_aff_union_add_aligned
);
7879 /* Construct and return a multi union piecewise affine expression
7880 * that is equal to the given multi affine expression.
7882 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_aff(
7883 __isl_take isl_multi_aff
*ma
)
7885 isl_multi_pw_aff
*mpa
;
7887 mpa
= isl_multi_pw_aff_from_multi_aff(ma
);
7888 return isl_multi_union_pw_aff_from_multi_pw_aff(mpa
);
7891 /* Construct and return a multi union piecewise affine expression
7892 * that is equal to the given multi piecewise affine expression.
7894 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_pw_aff(
7895 __isl_take isl_multi_pw_aff
*mpa
)
7899 isl_multi_union_pw_aff
*mupa
;
7904 space
= isl_multi_pw_aff_get_space(mpa
);
7905 space
= isl_space_range(space
);
7906 mupa
= isl_multi_union_pw_aff_alloc(space
);
7908 n
= isl_multi_pw_aff_dim(mpa
, isl_dim_out
);
7909 for (i
= 0; i
< n
; ++i
) {
7911 isl_union_pw_aff
*upa
;
7913 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
7914 upa
= isl_union_pw_aff_from_pw_aff(pa
);
7915 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7918 isl_multi_pw_aff_free(mpa
);
7923 /* Extract the range space of "pma" and assign it to *space.
7924 * If *space has already been set (through a previous call to this function),
7925 * then check that the range space is the same.
7927 static isl_stat
extract_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7929 isl_space
**space
= user
;
7930 isl_space
*pma_space
;
7933 pma_space
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
7934 isl_pw_multi_aff_free(pma
);
7937 return isl_stat_error
;
7943 equal
= isl_space_is_equal(pma_space
, *space
);
7944 isl_space_free(pma_space
);
7947 return isl_stat_error
;
7949 isl_die(isl_space_get_ctx(*space
), isl_error_invalid
,
7950 "range spaces not the same", return isl_stat_error
);
7954 /* Construct and return a multi union piecewise affine expression
7955 * that is equal to the given union piecewise multi affine expression.
7957 * In order to be able to perform the conversion, the input
7958 * needs to be non-empty and may only involve a single range space.
7960 __isl_give isl_multi_union_pw_aff
*
7961 isl_multi_union_pw_aff_from_union_pw_multi_aff(
7962 __isl_take isl_union_pw_multi_aff
*upma
)
7964 isl_space
*space
= NULL
;
7965 isl_multi_union_pw_aff
*mupa
;
7970 if (isl_union_pw_multi_aff_n_pw_multi_aff(upma
) == 0)
7971 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7972 "cannot extract range space from empty input",
7974 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
, &extract_space
,
7981 n
= isl_space_dim(space
, isl_dim_set
);
7982 mupa
= isl_multi_union_pw_aff_alloc(space
);
7984 for (i
= 0; i
< n
; ++i
) {
7985 isl_union_pw_aff
*upa
;
7987 upa
= isl_union_pw_multi_aff_get_union_pw_aff(upma
, i
);
7988 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7991 isl_union_pw_multi_aff_free(upma
);
7994 isl_space_free(space
);
7995 isl_union_pw_multi_aff_free(upma
);
7999 /* Try and create an isl_multi_union_pw_aff that is equivalent
8000 * to the given isl_union_map.
8001 * The isl_union_map is required to be single-valued in each space.
8002 * Moreover, it cannot be empty and all range spaces need to be the same.
8003 * Otherwise, an error is produced.
8005 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_union_map(
8006 __isl_take isl_union_map
*umap
)
8008 isl_union_pw_multi_aff
*upma
;
8010 upma
= isl_union_pw_multi_aff_from_union_map(umap
);
8011 return isl_multi_union_pw_aff_from_union_pw_multi_aff(upma
);
8014 /* Return a multiple union piecewise affine expression
8015 * that is equal to "mv" on "domain", assuming "domain" and "mv"
8016 * have been aligned.
8018 static __isl_give isl_multi_union_pw_aff
*
8019 isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8020 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8024 isl_multi_union_pw_aff
*mupa
;
8029 n
= isl_multi_val_dim(mv
, isl_dim_set
);
8030 space
= isl_multi_val_get_space(mv
);
8031 mupa
= isl_multi_union_pw_aff_alloc(space
);
8032 for (i
= 0; i
< n
; ++i
) {
8034 isl_union_pw_aff
*upa
;
8036 v
= isl_multi_val_get_val(mv
, i
);
8037 upa
= isl_union_pw_aff_val_on_domain(isl_union_set_copy(domain
),
8039 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8042 isl_union_set_free(domain
);
8043 isl_multi_val_free(mv
);
8046 isl_union_set_free(domain
);
8047 isl_multi_val_free(mv
);
8051 /* Return a multiple union piecewise affine expression
8052 * that is equal to "mv" on "domain".
8054 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_val_on_domain(
8055 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8059 if (isl_space_match(domain
->dim
, isl_dim_param
,
8060 mv
->space
, isl_dim_param
))
8061 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8063 domain
= isl_union_set_align_params(domain
,
8064 isl_multi_val_get_space(mv
));
8065 mv
= isl_multi_val_align_params(mv
, isl_union_set_get_space(domain
));
8066 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(domain
, mv
);
8068 isl_union_set_free(domain
);
8069 isl_multi_val_free(mv
);
8073 /* Return a multiple union piecewise affine expression
8074 * that is equal to "ma" on "domain", assuming "domain" and "ma"
8075 * have been aligned.
8077 static __isl_give isl_multi_union_pw_aff
*
8078 isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
8079 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8083 isl_multi_union_pw_aff
*mupa
;
8088 n
= isl_multi_aff_dim(ma
, isl_dim_set
);
8089 space
= isl_multi_aff_get_space(ma
);
8090 mupa
= isl_multi_union_pw_aff_alloc(space
);
8091 for (i
= 0; i
< n
; ++i
) {
8093 isl_union_pw_aff
*upa
;
8095 aff
= isl_multi_aff_get_aff(ma
, i
);
8096 upa
= isl_union_pw_aff_aff_on_domain(isl_union_set_copy(domain
),
8098 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8101 isl_union_set_free(domain
);
8102 isl_multi_aff_free(ma
);
8105 isl_union_set_free(domain
);
8106 isl_multi_aff_free(ma
);
8110 /* Return a multiple union piecewise affine expression
8111 * that is equal to "ma" on "domain".
8113 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_aff_on_domain(
8114 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8118 if (isl_space_match(domain
->dim
, isl_dim_param
,
8119 ma
->space
, isl_dim_param
))
8120 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
8122 domain
= isl_union_set_align_params(domain
,
8123 isl_multi_aff_get_space(ma
));
8124 ma
= isl_multi_aff_align_params(ma
, isl_union_set_get_space(domain
));
8125 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(domain
, ma
);
8127 isl_union_set_free(domain
);
8128 isl_multi_aff_free(ma
);
8132 /* Return a union set containing those elements in the domains
8133 * of the elements of "mupa" where they are all zero.
8135 __isl_give isl_union_set
*isl_multi_union_pw_aff_zero_union_set(
8136 __isl_take isl_multi_union_pw_aff
*mupa
)
8139 isl_union_pw_aff
*upa
;
8140 isl_union_set
*zero
;
8145 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8147 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8148 "cannot determine zero set "
8149 "of zero-dimensional function", goto error
);
8151 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8152 zero
= isl_union_pw_aff_zero_union_set(upa
);
8154 for (i
= 1; i
< n
; ++i
) {
8155 isl_union_set
*zero_i
;
8157 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8158 zero_i
= isl_union_pw_aff_zero_union_set(upa
);
8160 zero
= isl_union_set_intersect(zero
, zero_i
);
8163 isl_multi_union_pw_aff_free(mupa
);
8166 isl_multi_union_pw_aff_free(mupa
);
8170 /* Construct a union map mapping the shared domain
8171 * of the union piecewise affine expressions to the range of "mupa"
8172 * with each dimension in the range equated to the
8173 * corresponding union piecewise affine expression.
8175 * The input cannot be zero-dimensional as there is
8176 * no way to extract a domain from a zero-dimensional isl_multi_union_pw_aff.
8178 __isl_give isl_union_map
*isl_union_map_from_multi_union_pw_aff(
8179 __isl_take isl_multi_union_pw_aff
*mupa
)
8183 isl_union_map
*umap
;
8184 isl_union_pw_aff
*upa
;
8189 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8191 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8192 "cannot determine domain of zero-dimensional "
8193 "isl_multi_union_pw_aff", goto error
);
8195 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8196 umap
= isl_union_map_from_union_pw_aff(upa
);
8198 for (i
= 1; i
< n
; ++i
) {
8199 isl_union_map
*umap_i
;
8201 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8202 umap_i
= isl_union_map_from_union_pw_aff(upa
);
8203 umap
= isl_union_map_flat_range_product(umap
, umap_i
);
8206 space
= isl_multi_union_pw_aff_get_space(mupa
);
8207 umap
= isl_union_map_reset_range_space(umap
, space
);
8209 isl_multi_union_pw_aff_free(mupa
);
8212 isl_multi_union_pw_aff_free(mupa
);
8216 /* Internal data structure for isl_union_pw_multi_aff_reset_range_space.
8217 * "range" is the space from which to set the range space.
8218 * "res" collects the results.
8220 struct isl_union_pw_multi_aff_reset_range_space_data
{
8222 isl_union_pw_multi_aff
*res
;
8225 /* Replace the range space of "pma" by the range space of data->range and
8226 * add the result to data->res.
8228 static isl_stat
reset_range_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8230 struct isl_union_pw_multi_aff_reset_range_space_data
*data
= user
;
8233 space
= isl_pw_multi_aff_get_space(pma
);
8234 space
= isl_space_domain(space
);
8235 space
= isl_space_extend_domain_with_range(space
,
8236 isl_space_copy(data
->range
));
8237 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
8238 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
8240 return data
->res
? isl_stat_ok
: isl_stat_error
;
8243 /* Replace the range space of all the piecewise affine expressions in "upma" by
8244 * the range space of "space".
8246 * This assumes that all these expressions have the same output dimension.
8248 * Since the spaces of the expressions change, so do their hash values.
8249 * We therefore need to create a new isl_union_pw_multi_aff.
8250 * Note that the hash value is currently computed based on the entire
8251 * space even though there can only be a single expression with a given
8254 static __isl_give isl_union_pw_multi_aff
*
8255 isl_union_pw_multi_aff_reset_range_space(
8256 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_space
*space
)
8258 struct isl_union_pw_multi_aff_reset_range_space_data data
= { space
};
8259 isl_space
*space_upma
;
8261 space_upma
= isl_union_pw_multi_aff_get_space(upma
);
8262 data
.res
= isl_union_pw_multi_aff_empty(space_upma
);
8263 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
8264 &reset_range_space
, &data
) < 0)
8265 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
8267 isl_space_free(space
);
8268 isl_union_pw_multi_aff_free(upma
);
8272 /* Construct and return a union piecewise multi affine expression
8273 * that is equal to the given multi union piecewise affine expression.
8275 * In order to be able to perform the conversion, the input
8276 * needs to have a least one output dimension.
8278 __isl_give isl_union_pw_multi_aff
*
8279 isl_union_pw_multi_aff_from_multi_union_pw_aff(
8280 __isl_take isl_multi_union_pw_aff
*mupa
)
8284 isl_union_pw_multi_aff
*upma
;
8285 isl_union_pw_aff
*upa
;
8290 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8292 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8293 "cannot determine domain of zero-dimensional "
8294 "isl_multi_union_pw_aff", goto error
);
8296 space
= isl_multi_union_pw_aff_get_space(mupa
);
8297 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8298 upma
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8300 for (i
= 1; i
< n
; ++i
) {
8301 isl_union_pw_multi_aff
*upma_i
;
8303 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8304 upma_i
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8305 upma
= isl_union_pw_multi_aff_flat_range_product(upma
, upma_i
);
8308 upma
= isl_union_pw_multi_aff_reset_range_space(upma
, space
);
8310 isl_multi_union_pw_aff_free(mupa
);
8313 isl_multi_union_pw_aff_free(mupa
);
8317 /* Intersect the range of "mupa" with "range".
8318 * That is, keep only those domain elements that have a function value
8321 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_intersect_range(
8322 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_set
*range
)
8324 isl_union_pw_multi_aff
*upma
;
8325 isl_union_set
*domain
;
8330 if (!mupa
|| !range
)
8333 space
= isl_set_get_space(range
);
8334 match
= isl_space_tuple_is_equal(mupa
->space
, isl_dim_set
,
8335 space
, isl_dim_set
);
8336 isl_space_free(space
);
8340 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8341 "space don't match", goto error
);
8342 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8344 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8345 "cannot intersect range of zero-dimensional "
8346 "isl_multi_union_pw_aff", goto error
);
8348 upma
= isl_union_pw_multi_aff_from_multi_union_pw_aff(
8349 isl_multi_union_pw_aff_copy(mupa
));
8350 domain
= isl_union_set_from_set(range
);
8351 domain
= isl_union_set_preimage_union_pw_multi_aff(domain
, upma
);
8352 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, domain
);
8356 isl_multi_union_pw_aff_free(mupa
);
8357 isl_set_free(range
);
8361 /* Return the shared domain of the elements of "mupa".
8363 __isl_give isl_union_set
*isl_multi_union_pw_aff_domain(
8364 __isl_take isl_multi_union_pw_aff
*mupa
)
8367 isl_union_pw_aff
*upa
;
8373 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8375 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8376 "cannot determine domain", goto error
);
8378 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8379 dom
= isl_union_pw_aff_domain(upa
);
8380 for (i
= 1; i
< n
; ++i
) {
8381 isl_union_set
*dom_i
;
8383 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8384 dom_i
= isl_union_pw_aff_domain(upa
);
8385 dom
= isl_union_set_intersect(dom
, dom_i
);
8388 isl_multi_union_pw_aff_free(mupa
);
8391 isl_multi_union_pw_aff_free(mupa
);
8395 /* Apply "aff" to "mupa". The space of "mupa" is equal to the domain of "aff".
8396 * In particular, the spaces have been aligned.
8397 * The result is defined over the shared domain of the elements of "mupa"
8399 * We first extract the parametric constant part of "aff" and
8400 * define that over the shared domain.
8401 * Then we iterate over all input dimensions of "aff" and add the corresponding
8402 * multiples of the elements of "mupa".
8403 * Finally, we consider the integer divisions, calling the function
8404 * recursively to obtain an isl_union_pw_aff corresponding to the
8405 * integer division argument.
8407 static __isl_give isl_union_pw_aff
*multi_union_pw_aff_apply_aff(
8408 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8411 isl_union_pw_aff
*upa
;
8412 isl_union_set
*uset
;
8416 n_in
= isl_aff_dim(aff
, isl_dim_in
);
8417 n_div
= isl_aff_dim(aff
, isl_dim_div
);
8419 uset
= isl_multi_union_pw_aff_domain(isl_multi_union_pw_aff_copy(mupa
));
8420 cst
= isl_aff_copy(aff
);
8421 cst
= isl_aff_drop_dims(cst
, isl_dim_div
, 0, n_div
);
8422 cst
= isl_aff_drop_dims(cst
, isl_dim_in
, 0, n_in
);
8423 cst
= isl_aff_project_domain_on_params(cst
);
8424 upa
= isl_union_pw_aff_aff_on_domain(uset
, cst
);
8426 for (i
= 0; i
< n_in
; ++i
) {
8427 isl_union_pw_aff
*upa_i
;
8429 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
8431 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
8432 upa_i
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8433 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8434 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8437 for (i
= 0; i
< n_div
; ++i
) {
8439 isl_union_pw_aff
*upa_i
;
8441 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
8443 div
= isl_aff_get_div(aff
, i
);
8444 upa_i
= multi_union_pw_aff_apply_aff(
8445 isl_multi_union_pw_aff_copy(mupa
), div
);
8446 upa_i
= isl_union_pw_aff_floor(upa_i
);
8447 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
8448 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8449 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8452 isl_multi_union_pw_aff_free(mupa
);
8458 /* Apply "aff" to "mupa". The space of "mupa" needs to be compatible
8459 * with the domain of "aff".
8460 * Furthermore, the dimension of this space needs to be greater than zero.
8461 * The result is defined over the shared domain of the elements of "mupa"
8463 * We perform these checks and then hand over control to
8464 * multi_union_pw_aff_apply_aff.
8466 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_aff(
8467 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8469 isl_space
*space1
, *space2
;
8472 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8473 isl_aff_get_space(aff
));
8474 aff
= isl_aff_align_params(aff
, isl_multi_union_pw_aff_get_space(mupa
));
8478 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8479 space2
= isl_aff_get_domain_space(aff
);
8480 equal
= isl_space_is_equal(space1
, space2
);
8481 isl_space_free(space1
);
8482 isl_space_free(space2
);
8486 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8487 "spaces don't match", goto error
);
8488 if (isl_aff_dim(aff
, isl_dim_in
) == 0)
8489 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8490 "cannot determine domains", goto error
);
8492 return multi_union_pw_aff_apply_aff(mupa
, aff
);
8494 isl_multi_union_pw_aff_free(mupa
);
8499 /* Apply "ma" to "mupa". The space of "mupa" needs to be compatible
8500 * with the domain of "ma".
8501 * Furthermore, the dimension of this space needs to be greater than zero,
8502 * unless the dimension of the target space of "ma" is also zero.
8503 * The result is defined over the shared domain of the elements of "mupa"
8505 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_multi_aff(
8506 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_multi_aff
*ma
)
8508 isl_space
*space1
, *space2
;
8509 isl_multi_union_pw_aff
*res
;
8513 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8514 isl_multi_aff_get_space(ma
));
8515 ma
= isl_multi_aff_align_params(ma
,
8516 isl_multi_union_pw_aff_get_space(mupa
));
8520 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8521 space2
= isl_multi_aff_get_domain_space(ma
);
8522 equal
= isl_space_is_equal(space1
, space2
);
8523 isl_space_free(space1
);
8524 isl_space_free(space2
);
8528 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8529 "spaces don't match", goto error
);
8530 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
8531 if (isl_multi_aff_dim(ma
, isl_dim_in
) == 0 && n_out
!= 0)
8532 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8533 "cannot determine domains", goto error
);
8535 space1
= isl_space_range(isl_multi_aff_get_space(ma
));
8536 res
= isl_multi_union_pw_aff_alloc(space1
);
8538 for (i
= 0; i
< n_out
; ++i
) {
8540 isl_union_pw_aff
*upa
;
8542 aff
= isl_multi_aff_get_aff(ma
, i
);
8543 upa
= multi_union_pw_aff_apply_aff(
8544 isl_multi_union_pw_aff_copy(mupa
), aff
);
8545 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8548 isl_multi_aff_free(ma
);
8549 isl_multi_union_pw_aff_free(mupa
);
8552 isl_multi_union_pw_aff_free(mupa
);
8553 isl_multi_aff_free(ma
);
8557 /* Apply "pa" to "mupa". The space of "mupa" needs to be compatible
8558 * with the domain of "pa".
8559 * Furthermore, the dimension of this space needs to be greater than zero.
8560 * The result is defined over the shared domain of the elements of "mupa"
8562 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_aff(
8563 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_pw_aff
*pa
)
8567 isl_space
*space
, *space2
;
8568 isl_union_pw_aff
*upa
;
8570 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8571 isl_pw_aff_get_space(pa
));
8572 pa
= isl_pw_aff_align_params(pa
,
8573 isl_multi_union_pw_aff_get_space(mupa
));
8577 space
= isl_multi_union_pw_aff_get_space(mupa
);
8578 space2
= isl_pw_aff_get_domain_space(pa
);
8579 equal
= isl_space_is_equal(space
, space2
);
8580 isl_space_free(space
);
8581 isl_space_free(space2
);
8585 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8586 "spaces don't match", goto error
);
8587 if (isl_pw_aff_dim(pa
, isl_dim_in
) == 0)
8588 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8589 "cannot determine domains", goto error
);
8591 space
= isl_space_params(isl_multi_union_pw_aff_get_space(mupa
));
8592 upa
= isl_union_pw_aff_empty(space
);
8594 for (i
= 0; i
< pa
->n
; ++i
) {
8597 isl_multi_union_pw_aff
*mupa_i
;
8598 isl_union_pw_aff
*upa_i
;
8600 mupa_i
= isl_multi_union_pw_aff_copy(mupa
);
8601 domain
= isl_set_copy(pa
->p
[i
].set
);
8602 mupa_i
= isl_multi_union_pw_aff_intersect_range(mupa_i
, domain
);
8603 aff
= isl_aff_copy(pa
->p
[i
].aff
);
8604 upa_i
= multi_union_pw_aff_apply_aff(mupa_i
, aff
);
8605 upa
= isl_union_pw_aff_union_add(upa
, upa_i
);
8608 isl_multi_union_pw_aff_free(mupa
);
8609 isl_pw_aff_free(pa
);
8612 isl_multi_union_pw_aff_free(mupa
);
8613 isl_pw_aff_free(pa
);
8617 /* Apply "pma" to "mupa". The space of "mupa" needs to be compatible
8618 * with the domain of "pma".
8619 * Furthermore, the dimension of this space needs to be greater than zero,
8620 * unless the dimension of the target space of "pma" is also zero.
8621 * The result is defined over the shared domain of the elements of "mupa"
8623 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_multi_aff(
8624 __isl_take isl_multi_union_pw_aff
*mupa
,
8625 __isl_take isl_pw_multi_aff
*pma
)
8627 isl_space
*space1
, *space2
;
8628 isl_multi_union_pw_aff
*res
;
8632 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8633 isl_pw_multi_aff_get_space(pma
));
8634 pma
= isl_pw_multi_aff_align_params(pma
,
8635 isl_multi_union_pw_aff_get_space(mupa
));
8639 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8640 space2
= isl_pw_multi_aff_get_domain_space(pma
);
8641 equal
= isl_space_is_equal(space1
, space2
);
8642 isl_space_free(space1
);
8643 isl_space_free(space2
);
8647 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8648 "spaces don't match", goto error
);
8649 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
8650 if (isl_pw_multi_aff_dim(pma
, isl_dim_in
) == 0 && n_out
!= 0)
8651 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8652 "cannot determine domains", goto error
);
8654 space1
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
8655 res
= isl_multi_union_pw_aff_alloc(space1
);
8657 for (i
= 0; i
< n_out
; ++i
) {
8659 isl_union_pw_aff
*upa
;
8661 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
8662 upa
= isl_multi_union_pw_aff_apply_pw_aff(
8663 isl_multi_union_pw_aff_copy(mupa
), pa
);
8664 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8667 isl_pw_multi_aff_free(pma
);
8668 isl_multi_union_pw_aff_free(mupa
);
8671 isl_multi_union_pw_aff_free(mupa
);
8672 isl_pw_multi_aff_free(pma
);
8676 /* Compute the pullback of "mupa" by the function represented by "upma".
8677 * In other words, plug in "upma" in "mupa". The result contains
8678 * expressions defined over the domain space of "upma".
8680 * Run over all elements of "mupa" and plug in "upma" in each of them.
8682 __isl_give isl_multi_union_pw_aff
*
8683 isl_multi_union_pw_aff_pullback_union_pw_multi_aff(
8684 __isl_take isl_multi_union_pw_aff
*mupa
,
8685 __isl_take isl_union_pw_multi_aff
*upma
)
8689 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8690 isl_union_pw_multi_aff_get_space(upma
));
8691 upma
= isl_union_pw_multi_aff_align_params(upma
,
8692 isl_multi_union_pw_aff_get_space(mupa
));
8696 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8697 for (i
= 0; i
< n
; ++i
) {
8698 isl_union_pw_aff
*upa
;
8700 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8701 upa
= isl_union_pw_aff_pullback_union_pw_multi_aff(upa
,
8702 isl_union_pw_multi_aff_copy(upma
));
8703 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8706 isl_union_pw_multi_aff_free(upma
);
8709 isl_multi_union_pw_aff_free(mupa
);
8710 isl_union_pw_multi_aff_free(upma
);
8714 /* Extract the sequence of elements in "mupa" with domain space "space"
8715 * (ignoring parameters).
8717 * For the elements of "mupa" that are not defined on the specified space,
8718 * the corresponding element in the result is empty.
8720 __isl_give isl_multi_pw_aff
*isl_multi_union_pw_aff_extract_multi_pw_aff(
8721 __isl_keep isl_multi_union_pw_aff
*mupa
, __isl_take isl_space
*space
)
8724 isl_space
*space_mpa
= NULL
;
8725 isl_multi_pw_aff
*mpa
;
8727 if (!mupa
|| !space
)
8730 space_mpa
= isl_multi_union_pw_aff_get_space(mupa
);
8731 if (!isl_space_match(space_mpa
, isl_dim_param
, space
, isl_dim_param
)) {
8732 space
= isl_space_drop_dims(space
, isl_dim_param
,
8733 0, isl_space_dim(space
, isl_dim_param
));
8734 space
= isl_space_align_params(space
,
8735 isl_space_copy(space_mpa
));
8739 space_mpa
= isl_space_map_from_domain_and_range(isl_space_copy(space
),
8741 mpa
= isl_multi_pw_aff_alloc(space_mpa
);
8743 space
= isl_space_from_domain(space
);
8744 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
8745 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8746 for (i
= 0; i
< n
; ++i
) {
8747 isl_union_pw_aff
*upa
;
8750 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8751 pa
= isl_union_pw_aff_extract_pw_aff(upa
,
8752 isl_space_copy(space
));
8753 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
8754 isl_union_pw_aff_free(upa
);
8757 isl_space_free(space
);
8760 isl_space_free(space_mpa
);
8761 isl_space_free(space
);