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 /* Does "pa" involve any NaNs?
514 isl_bool
isl_pw_aff_involves_nan(__isl_keep isl_pw_aff
*pa
)
519 return isl_bool_error
;
521 return isl_bool_false
;
523 for (i
= 0; i
< pa
->n
; ++i
) {
524 isl_bool is_nan
= isl_aff_is_nan(pa
->p
[i
].aff
);
525 if (is_nan
< 0 || is_nan
)
529 return isl_bool_false
;
532 /* Are "aff1" and "aff2" obviously equal?
534 * NaN is not equal to anything, not even to another NaN.
536 isl_bool
isl_aff_plain_is_equal(__isl_keep isl_aff
*aff1
,
537 __isl_keep isl_aff
*aff2
)
542 return isl_bool_error
;
544 if (isl_aff_is_nan(aff1
) || isl_aff_is_nan(aff2
))
545 return isl_bool_false
;
547 equal
= isl_local_space_is_equal(aff1
->ls
, aff2
->ls
);
548 if (equal
< 0 || !equal
)
551 return isl_vec_is_equal(aff1
->v
, aff2
->v
);
554 /* Return the common denominator of "aff" in "v".
556 * We cannot return anything meaningful in case of a NaN.
558 int isl_aff_get_denominator(__isl_keep isl_aff
*aff
, isl_int
*v
)
562 if (isl_aff_is_nan(aff
))
563 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
564 "cannot get denominator of NaN", return -1);
565 isl_int_set(*v
, aff
->v
->el
[0]);
569 /* Return the common denominator of "aff".
571 __isl_give isl_val
*isl_aff_get_denominator_val(__isl_keep isl_aff
*aff
)
578 ctx
= isl_aff_get_ctx(aff
);
579 if (isl_aff_is_nan(aff
))
580 return isl_val_nan(ctx
);
581 return isl_val_int_from_isl_int(ctx
, aff
->v
->el
[0]);
584 /* Return the constant term of "aff" in "v".
586 * We cannot return anything meaningful in case of a NaN.
588 int isl_aff_get_constant(__isl_keep isl_aff
*aff
, isl_int
*v
)
592 if (isl_aff_is_nan(aff
))
593 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
594 "cannot get constant term of NaN", return -1);
595 isl_int_set(*v
, aff
->v
->el
[1]);
599 /* Return the constant term of "aff".
601 __isl_give isl_val
*isl_aff_get_constant_val(__isl_keep isl_aff
*aff
)
609 ctx
= isl_aff_get_ctx(aff
);
610 if (isl_aff_is_nan(aff
))
611 return isl_val_nan(ctx
);
612 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1], aff
->v
->el
[0]);
613 return isl_val_normalize(v
);
616 /* Return the coefficient of the variable of type "type" at position "pos"
619 * We cannot return anything meaningful in case of a NaN.
621 int isl_aff_get_coefficient(__isl_keep isl_aff
*aff
,
622 enum isl_dim_type type
, int pos
, isl_int
*v
)
627 if (type
== isl_dim_out
)
628 isl_die(aff
->v
->ctx
, isl_error_invalid
,
629 "output/set dimension does not have a coefficient",
631 if (type
== isl_dim_in
)
634 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
635 isl_die(aff
->v
->ctx
, isl_error_invalid
,
636 "position out of bounds", return -1);
638 if (isl_aff_is_nan(aff
))
639 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
640 "cannot get coefficient of NaN", return -1);
641 pos
+= isl_local_space_offset(aff
->ls
, type
);
642 isl_int_set(*v
, aff
->v
->el
[1 + pos
]);
647 /* Return the coefficient of the variable of type "type" at position "pos"
650 __isl_give isl_val
*isl_aff_get_coefficient_val(__isl_keep isl_aff
*aff
,
651 enum isl_dim_type type
, int pos
)
659 ctx
= isl_aff_get_ctx(aff
);
660 if (type
== isl_dim_out
)
661 isl_die(ctx
, isl_error_invalid
,
662 "output/set dimension does not have a coefficient",
664 if (type
== isl_dim_in
)
667 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
668 isl_die(ctx
, isl_error_invalid
,
669 "position out of bounds", return NULL
);
671 if (isl_aff_is_nan(aff
))
672 return isl_val_nan(ctx
);
673 pos
+= isl_local_space_offset(aff
->ls
, type
);
674 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1 + pos
], aff
->v
->el
[0]);
675 return isl_val_normalize(v
);
678 /* Return the sign of the coefficient of the variable of type "type"
679 * at position "pos" of "aff".
681 int isl_aff_coefficient_sgn(__isl_keep isl_aff
*aff
, enum isl_dim_type type
,
689 ctx
= isl_aff_get_ctx(aff
);
690 if (type
== isl_dim_out
)
691 isl_die(ctx
, isl_error_invalid
,
692 "output/set dimension does not have a coefficient",
694 if (type
== isl_dim_in
)
697 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
698 isl_die(ctx
, isl_error_invalid
,
699 "position out of bounds", return 0);
701 pos
+= isl_local_space_offset(aff
->ls
, type
);
702 return isl_int_sgn(aff
->v
->el
[1 + pos
]);
705 /* Replace the denominator of "aff" by "v".
707 * A NaN is unaffected by this operation.
709 __isl_give isl_aff
*isl_aff_set_denominator(__isl_take isl_aff
*aff
, isl_int v
)
713 if (isl_aff_is_nan(aff
))
715 aff
= isl_aff_cow(aff
);
719 aff
->v
= isl_vec_cow(aff
->v
);
721 return isl_aff_free(aff
);
723 isl_int_set(aff
->v
->el
[0], v
);
728 /* Replace the numerator of the constant term of "aff" by "v".
730 * A NaN is unaffected by this operation.
732 __isl_give isl_aff
*isl_aff_set_constant(__isl_take isl_aff
*aff
, isl_int v
)
736 if (isl_aff_is_nan(aff
))
738 aff
= isl_aff_cow(aff
);
742 aff
->v
= isl_vec_cow(aff
->v
);
744 return isl_aff_free(aff
);
746 isl_int_set(aff
->v
->el
[1], v
);
751 /* Replace the constant term of "aff" by "v".
753 * A NaN is unaffected by this operation.
755 __isl_give isl_aff
*isl_aff_set_constant_val(__isl_take isl_aff
*aff
,
756 __isl_take isl_val
*v
)
761 if (isl_aff_is_nan(aff
)) {
766 if (!isl_val_is_rat(v
))
767 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
768 "expecting rational value", goto error
);
770 if (isl_int_eq(aff
->v
->el
[1], v
->n
) &&
771 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
776 aff
= isl_aff_cow(aff
);
779 aff
->v
= isl_vec_cow(aff
->v
);
783 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
784 isl_int_set(aff
->v
->el
[1], v
->n
);
785 } else if (isl_int_is_one(v
->d
)) {
786 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
788 isl_seq_scale(aff
->v
->el
+ 1,
789 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
790 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
791 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
792 aff
->v
= isl_vec_normalize(aff
->v
);
805 /* Add "v" to the constant term of "aff".
807 * A NaN is unaffected by this operation.
809 __isl_give isl_aff
*isl_aff_add_constant(__isl_take isl_aff
*aff
, isl_int v
)
811 if (isl_int_is_zero(v
))
816 if (isl_aff_is_nan(aff
))
818 aff
= isl_aff_cow(aff
);
822 aff
->v
= isl_vec_cow(aff
->v
);
824 return isl_aff_free(aff
);
826 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
);
831 /* Add "v" to the constant term of "aff".
833 * A NaN is unaffected by this operation.
835 __isl_give isl_aff
*isl_aff_add_constant_val(__isl_take isl_aff
*aff
,
836 __isl_take isl_val
*v
)
841 if (isl_aff_is_nan(aff
) || isl_val_is_zero(v
)) {
846 if (!isl_val_is_rat(v
))
847 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
848 "expecting rational value", goto error
);
850 aff
= isl_aff_cow(aff
);
854 aff
->v
= isl_vec_cow(aff
->v
);
858 if (isl_int_is_one(v
->d
)) {
859 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
860 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
861 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
->n
);
862 aff
->v
= isl_vec_normalize(aff
->v
);
866 isl_seq_scale(aff
->v
->el
+ 1,
867 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
868 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
869 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
870 aff
->v
= isl_vec_normalize(aff
->v
);
883 __isl_give isl_aff
*isl_aff_add_constant_si(__isl_take isl_aff
*aff
, int v
)
888 isl_int_set_si(t
, v
);
889 aff
= isl_aff_add_constant(aff
, t
);
895 /* Add "v" to the numerator of the constant term of "aff".
897 * A NaN is unaffected by this operation.
899 __isl_give isl_aff
*isl_aff_add_constant_num(__isl_take isl_aff
*aff
, isl_int v
)
901 if (isl_int_is_zero(v
))
906 if (isl_aff_is_nan(aff
))
908 aff
= isl_aff_cow(aff
);
912 aff
->v
= isl_vec_cow(aff
->v
);
914 return isl_aff_free(aff
);
916 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
);
921 /* Add "v" to the numerator of the constant term of "aff".
923 * A NaN is unaffected by this operation.
925 __isl_give isl_aff
*isl_aff_add_constant_num_si(__isl_take isl_aff
*aff
, int v
)
933 isl_int_set_si(t
, v
);
934 aff
= isl_aff_add_constant_num(aff
, t
);
940 /* Replace the numerator of the constant term of "aff" by "v".
942 * A NaN is unaffected by this operation.
944 __isl_give isl_aff
*isl_aff_set_constant_si(__isl_take isl_aff
*aff
, int v
)
948 if (isl_aff_is_nan(aff
))
950 aff
= isl_aff_cow(aff
);
954 aff
->v
= isl_vec_cow(aff
->v
);
956 return isl_aff_free(aff
);
958 isl_int_set_si(aff
->v
->el
[1], v
);
963 /* Replace the numerator of the coefficient of the variable of type "type"
964 * at position "pos" of "aff" by "v".
966 * A NaN is unaffected by this operation.
968 __isl_give isl_aff
*isl_aff_set_coefficient(__isl_take isl_aff
*aff
,
969 enum isl_dim_type type
, int pos
, isl_int v
)
974 if (type
== isl_dim_out
)
975 isl_die(aff
->v
->ctx
, isl_error_invalid
,
976 "output/set dimension does not have a coefficient",
977 return isl_aff_free(aff
));
978 if (type
== isl_dim_in
)
981 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
982 isl_die(aff
->v
->ctx
, isl_error_invalid
,
983 "position out of bounds", return isl_aff_free(aff
));
985 if (isl_aff_is_nan(aff
))
987 aff
= isl_aff_cow(aff
);
991 aff
->v
= isl_vec_cow(aff
->v
);
993 return isl_aff_free(aff
);
995 pos
+= isl_local_space_offset(aff
->ls
, type
);
996 isl_int_set(aff
->v
->el
[1 + pos
], v
);
1001 /* Replace the numerator of the coefficient of the variable of type "type"
1002 * at position "pos" of "aff" by "v".
1004 * A NaN is unaffected by this operation.
1006 __isl_give isl_aff
*isl_aff_set_coefficient_si(__isl_take isl_aff
*aff
,
1007 enum isl_dim_type type
, int pos
, int v
)
1012 if (type
== isl_dim_out
)
1013 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1014 "output/set dimension does not have a coefficient",
1015 return isl_aff_free(aff
));
1016 if (type
== isl_dim_in
)
1019 if (pos
< 0 || pos
>= isl_local_space_dim(aff
->ls
, type
))
1020 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1021 "position out of bounds", return isl_aff_free(aff
));
1023 if (isl_aff_is_nan(aff
))
1025 pos
+= isl_local_space_offset(aff
->ls
, type
);
1026 if (isl_int_cmp_si(aff
->v
->el
[1 + pos
], v
) == 0)
1029 aff
= isl_aff_cow(aff
);
1033 aff
->v
= isl_vec_cow(aff
->v
);
1035 return isl_aff_free(aff
);
1037 isl_int_set_si(aff
->v
->el
[1 + pos
], v
);
1042 /* Replace the coefficient of the variable of type "type" at position "pos"
1045 * A NaN is unaffected by this operation.
1047 __isl_give isl_aff
*isl_aff_set_coefficient_val(__isl_take isl_aff
*aff
,
1048 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1053 if (type
== isl_dim_out
)
1054 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1055 "output/set dimension does not have a coefficient",
1057 if (type
== isl_dim_in
)
1060 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1061 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1062 "position out of bounds", goto error
);
1064 if (isl_aff_is_nan(aff
)) {
1068 if (!isl_val_is_rat(v
))
1069 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1070 "expecting rational value", goto error
);
1072 pos
+= isl_local_space_offset(aff
->ls
, type
);
1073 if (isl_int_eq(aff
->v
->el
[1 + pos
], v
->n
) &&
1074 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1079 aff
= isl_aff_cow(aff
);
1082 aff
->v
= isl_vec_cow(aff
->v
);
1086 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1087 isl_int_set(aff
->v
->el
[1 + pos
], v
->n
);
1088 } else if (isl_int_is_one(v
->d
)) {
1089 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1091 isl_seq_scale(aff
->v
->el
+ 1,
1092 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1093 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1094 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1095 aff
->v
= isl_vec_normalize(aff
->v
);
1108 /* Add "v" to the coefficient of the variable of type "type"
1109 * at position "pos" of "aff".
1111 * A NaN is unaffected by this operation.
1113 __isl_give isl_aff
*isl_aff_add_coefficient(__isl_take isl_aff
*aff
,
1114 enum isl_dim_type type
, int pos
, isl_int v
)
1119 if (type
== isl_dim_out
)
1120 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1121 "output/set dimension does not have a coefficient",
1122 return isl_aff_free(aff
));
1123 if (type
== isl_dim_in
)
1126 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1127 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1128 "position out of bounds", return isl_aff_free(aff
));
1130 if (isl_aff_is_nan(aff
))
1132 aff
= isl_aff_cow(aff
);
1136 aff
->v
= isl_vec_cow(aff
->v
);
1138 return isl_aff_free(aff
);
1140 pos
+= isl_local_space_offset(aff
->ls
, type
);
1141 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
);
1146 /* Add "v" to the coefficient of the variable of type "type"
1147 * at position "pos" of "aff".
1149 * A NaN is unaffected by this operation.
1151 __isl_give isl_aff
*isl_aff_add_coefficient_val(__isl_take isl_aff
*aff
,
1152 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
1157 if (isl_val_is_zero(v
)) {
1162 if (type
== isl_dim_out
)
1163 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1164 "output/set dimension does not have a coefficient",
1166 if (type
== isl_dim_in
)
1169 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
1170 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1171 "position out of bounds", goto error
);
1173 if (isl_aff_is_nan(aff
)) {
1177 if (!isl_val_is_rat(v
))
1178 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1179 "expecting rational value", goto error
);
1181 aff
= isl_aff_cow(aff
);
1185 aff
->v
= isl_vec_cow(aff
->v
);
1189 pos
+= isl_local_space_offset(aff
->ls
, type
);
1190 if (isl_int_is_one(v
->d
)) {
1191 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1192 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
1193 isl_int_add(aff
->v
->el
[1 + pos
], aff
->v
->el
[1 + pos
], v
->n
);
1194 aff
->v
= isl_vec_normalize(aff
->v
);
1198 isl_seq_scale(aff
->v
->el
+ 1,
1199 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
1200 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
1201 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
1202 aff
->v
= isl_vec_normalize(aff
->v
);
1215 __isl_give isl_aff
*isl_aff_add_coefficient_si(__isl_take isl_aff
*aff
,
1216 enum isl_dim_type type
, int pos
, int v
)
1221 isl_int_set_si(t
, v
);
1222 aff
= isl_aff_add_coefficient(aff
, type
, pos
, t
);
1228 __isl_give isl_aff
*isl_aff_get_div(__isl_keep isl_aff
*aff
, int pos
)
1233 return isl_local_space_get_div(aff
->ls
, pos
);
1236 /* Return the negation of "aff".
1238 * As a special case, -NaN = NaN.
1240 __isl_give isl_aff
*isl_aff_neg(__isl_take isl_aff
*aff
)
1244 if (isl_aff_is_nan(aff
))
1246 aff
= isl_aff_cow(aff
);
1249 aff
->v
= isl_vec_cow(aff
->v
);
1251 return isl_aff_free(aff
);
1253 isl_seq_neg(aff
->v
->el
+ 1, aff
->v
->el
+ 1, aff
->v
->size
- 1);
1258 /* Remove divs from the local space that do not appear in the affine
1260 * We currently only remove divs at the end.
1261 * Some intermediate divs may also not appear directly in the affine
1262 * expression, but we would also need to check that no other divs are
1263 * defined in terms of them.
1265 __isl_give isl_aff
*isl_aff_remove_unused_divs(__isl_take isl_aff
*aff
)
1274 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1275 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1277 pos
= isl_seq_last_non_zero(aff
->v
->el
+ 1 + off
, n
) + 1;
1281 aff
= isl_aff_cow(aff
);
1285 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, isl_dim_div
, pos
, n
- pos
);
1286 aff
->v
= isl_vec_drop_els(aff
->v
, 1 + off
+ pos
, n
- pos
);
1287 if (!aff
->ls
|| !aff
->v
)
1288 return isl_aff_free(aff
);
1293 /* Given two affine expressions "p" of length p_len (including the
1294 * denominator and the constant term) and "subs" of length subs_len,
1295 * plug in "subs" for the variable at position "pos".
1296 * The variables of "subs" and "p" are assumed to match up to subs_len,
1297 * but "p" may have additional variables.
1298 * "v" is an initialized isl_int that can be used internally.
1300 * In particular, if "p" represents the expression
1304 * with i the variable at position "pos" and "subs" represents the expression
1308 * then the result represents the expression
1313 void isl_seq_substitute(isl_int
*p
, int pos
, isl_int
*subs
,
1314 int p_len
, int subs_len
, isl_int v
)
1316 isl_int_set(v
, p
[1 + pos
]);
1317 isl_int_set_si(p
[1 + pos
], 0);
1318 isl_seq_combine(p
+ 1, subs
[0], p
+ 1, v
, subs
+ 1, subs_len
- 1);
1319 isl_seq_scale(p
+ subs_len
, p
+ subs_len
, subs
[0], p_len
- subs_len
);
1320 isl_int_mul(p
[0], p
[0], subs
[0]);
1323 /* Look for any divs in the aff->ls with a denominator equal to one
1324 * and plug them into the affine expression and any subsequent divs
1325 * that may reference the div.
1327 static __isl_give isl_aff
*plug_in_integral_divs(__isl_take isl_aff
*aff
)
1333 isl_local_space
*ls
;
1339 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1341 for (i
= 0; i
< n
; ++i
) {
1342 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][0]))
1344 ls
= isl_local_space_copy(aff
->ls
);
1345 ls
= isl_local_space_substitute_seq(ls
, isl_dim_div
, i
,
1346 aff
->ls
->div
->row
[i
], len
, i
+ 1, n
- (i
+ 1));
1347 vec
= isl_vec_copy(aff
->v
);
1348 vec
= isl_vec_cow(vec
);
1354 pos
= isl_local_space_offset(aff
->ls
, isl_dim_div
) + i
;
1355 isl_seq_substitute(vec
->el
, pos
, aff
->ls
->div
->row
[i
],
1360 isl_vec_free(aff
->v
);
1362 isl_local_space_free(aff
->ls
);
1369 isl_local_space_free(ls
);
1370 return isl_aff_free(aff
);
1373 /* Look for any divs j that appear with a unit coefficient inside
1374 * the definitions of other divs i and plug them into the definitions
1377 * In particular, an expression of the form
1379 * floor((f(..) + floor(g(..)/n))/m)
1383 * floor((n * f(..) + g(..))/(n * m))
1385 * This simplification is correct because we can move the expression
1386 * f(..) into the inner floor in the original expression to obtain
1388 * floor(floor((n * f(..) + g(..))/n)/m)
1390 * from which we can derive the simplified expression.
1392 static __isl_give isl_aff
*plug_in_unit_divs(__isl_take isl_aff
*aff
)
1400 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1401 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1402 for (i
= 1; i
< n
; ++i
) {
1403 for (j
= 0; j
< i
; ++j
) {
1404 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][1 + off
+ j
]))
1406 aff
->ls
= isl_local_space_substitute_seq(aff
->ls
,
1407 isl_dim_div
, j
, aff
->ls
->div
->row
[j
],
1408 aff
->v
->size
, i
, 1);
1410 return isl_aff_free(aff
);
1417 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
1419 * Even though this function is only called on isl_affs with a single
1420 * reference, we are careful to only change aff->v and aff->ls together.
1422 static __isl_give isl_aff
*swap_div(__isl_take isl_aff
*aff
, int a
, int b
)
1424 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1425 isl_local_space
*ls
;
1428 ls
= isl_local_space_copy(aff
->ls
);
1429 ls
= isl_local_space_swap_div(ls
, a
, b
);
1430 v
= isl_vec_copy(aff
->v
);
1435 isl_int_swap(v
->el
[1 + off
+ a
], v
->el
[1 + off
+ b
]);
1436 isl_vec_free(aff
->v
);
1438 isl_local_space_free(aff
->ls
);
1444 isl_local_space_free(ls
);
1445 return isl_aff_free(aff
);
1448 /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL.
1450 * We currently do not actually remove div "b", but simply add its
1451 * coefficient to that of "a" and then zero it out.
1453 static __isl_give isl_aff
*merge_divs(__isl_take isl_aff
*aff
, int a
, int b
)
1455 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1457 if (isl_int_is_zero(aff
->v
->el
[1 + off
+ b
]))
1460 aff
->v
= isl_vec_cow(aff
->v
);
1462 return isl_aff_free(aff
);
1464 isl_int_add(aff
->v
->el
[1 + off
+ a
],
1465 aff
->v
->el
[1 + off
+ a
], aff
->v
->el
[1 + off
+ b
]);
1466 isl_int_set_si(aff
->v
->el
[1 + off
+ b
], 0);
1471 /* Sort the divs in the local space of "aff" according to
1472 * the comparison function "cmp_row" in isl_local_space.c,
1473 * combining the coefficients of identical divs.
1475 * Reordering divs does not change the semantics of "aff",
1476 * so there is no need to call isl_aff_cow.
1477 * Moreover, this function is currently only called on isl_affs
1478 * with a single reference.
1480 static __isl_give isl_aff
*sort_divs(__isl_take isl_aff
*aff
)
1487 n
= isl_aff_dim(aff
, isl_dim_div
);
1488 for (i
= 1; i
< n
; ++i
) {
1489 for (j
= i
- 1; j
>= 0; --j
) {
1490 int cmp
= isl_mat_cmp_div(aff
->ls
->div
, j
, j
+ 1);
1494 aff
= merge_divs(aff
, j
, j
+ 1);
1496 aff
= swap_div(aff
, j
, j
+ 1);
1505 /* Normalize the representation of "aff".
1507 * This function should only be called of "new" isl_affs, i.e.,
1508 * with only a single reference. We therefore do not need to
1509 * worry about affecting other instances.
1511 __isl_give isl_aff
*isl_aff_normalize(__isl_take isl_aff
*aff
)
1515 aff
->v
= isl_vec_normalize(aff
->v
);
1517 return isl_aff_free(aff
);
1518 aff
= plug_in_integral_divs(aff
);
1519 aff
= plug_in_unit_divs(aff
);
1520 aff
= sort_divs(aff
);
1521 aff
= isl_aff_remove_unused_divs(aff
);
1525 /* Given f, return floor(f).
1526 * If f is an integer expression, then just return f.
1527 * If f is a constant, then return the constant floor(f).
1528 * Otherwise, if f = g/m, write g = q m + r,
1529 * create a new div d = [r/m] and return the expression q + d.
1530 * The coefficients in r are taken to lie between -m/2 and m/2.
1532 * As a special case, floor(NaN) = NaN.
1534 __isl_give isl_aff
*isl_aff_floor(__isl_take isl_aff
*aff
)
1544 if (isl_aff_is_nan(aff
))
1546 if (isl_int_is_one(aff
->v
->el
[0]))
1549 aff
= isl_aff_cow(aff
);
1553 aff
->v
= isl_vec_cow(aff
->v
);
1555 return isl_aff_free(aff
);
1557 if (isl_aff_is_cst(aff
)) {
1558 isl_int_fdiv_q(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1559 isl_int_set_si(aff
->v
->el
[0], 1);
1563 div
= isl_vec_copy(aff
->v
);
1564 div
= isl_vec_cow(div
);
1566 return isl_aff_free(aff
);
1568 ctx
= isl_aff_get_ctx(aff
);
1569 isl_int_fdiv_q(aff
->v
->el
[0], aff
->v
->el
[0], ctx
->two
);
1570 for (i
= 1; i
< aff
->v
->size
; ++i
) {
1571 isl_int_fdiv_r(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1572 isl_int_fdiv_q(aff
->v
->el
[i
], aff
->v
->el
[i
], div
->el
[0]);
1573 if (isl_int_gt(div
->el
[i
], aff
->v
->el
[0])) {
1574 isl_int_sub(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1575 isl_int_add_ui(aff
->v
->el
[i
], aff
->v
->el
[i
], 1);
1579 aff
->ls
= isl_local_space_add_div(aff
->ls
, div
);
1581 return isl_aff_free(aff
);
1583 size
= aff
->v
->size
;
1584 aff
->v
= isl_vec_extend(aff
->v
, size
+ 1);
1586 return isl_aff_free(aff
);
1587 isl_int_set_si(aff
->v
->el
[0], 1);
1588 isl_int_set_si(aff
->v
->el
[size
], 1);
1590 aff
= isl_aff_normalize(aff
);
1597 * aff mod m = aff - m * floor(aff/m)
1599 __isl_give isl_aff
*isl_aff_mod(__isl_take isl_aff
*aff
, isl_int m
)
1603 res
= isl_aff_copy(aff
);
1604 aff
= isl_aff_scale_down(aff
, m
);
1605 aff
= isl_aff_floor(aff
);
1606 aff
= isl_aff_scale(aff
, m
);
1607 res
= isl_aff_sub(res
, aff
);
1614 * aff mod m = aff - m * floor(aff/m)
1616 * with m an integer value.
1618 __isl_give isl_aff
*isl_aff_mod_val(__isl_take isl_aff
*aff
,
1619 __isl_take isl_val
*m
)
1626 if (!isl_val_is_int(m
))
1627 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
1628 "expecting integer modulo", goto error
);
1630 res
= isl_aff_copy(aff
);
1631 aff
= isl_aff_scale_down_val(aff
, isl_val_copy(m
));
1632 aff
= isl_aff_floor(aff
);
1633 aff
= isl_aff_scale_val(aff
, m
);
1634 res
= isl_aff_sub(res
, aff
);
1645 * pwaff mod m = pwaff - m * floor(pwaff/m)
1647 __isl_give isl_pw_aff
*isl_pw_aff_mod(__isl_take isl_pw_aff
*pwaff
, isl_int m
)
1651 res
= isl_pw_aff_copy(pwaff
);
1652 pwaff
= isl_pw_aff_scale_down(pwaff
, m
);
1653 pwaff
= isl_pw_aff_floor(pwaff
);
1654 pwaff
= isl_pw_aff_scale(pwaff
, m
);
1655 res
= isl_pw_aff_sub(res
, pwaff
);
1662 * pa mod m = pa - m * floor(pa/m)
1664 * with m an integer value.
1666 __isl_give isl_pw_aff
*isl_pw_aff_mod_val(__isl_take isl_pw_aff
*pa
,
1667 __isl_take isl_val
*m
)
1671 if (!isl_val_is_int(m
))
1672 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
1673 "expecting integer modulo", goto error
);
1674 pa
= isl_pw_aff_mod(pa
, m
->n
);
1678 isl_pw_aff_free(pa
);
1683 /* Given f, return ceil(f).
1684 * If f is an integer expression, then just return f.
1685 * Otherwise, let f be the expression
1691 * floor((e + m - 1)/m)
1693 * As a special case, ceil(NaN) = NaN.
1695 __isl_give isl_aff
*isl_aff_ceil(__isl_take isl_aff
*aff
)
1700 if (isl_aff_is_nan(aff
))
1702 if (isl_int_is_one(aff
->v
->el
[0]))
1705 aff
= isl_aff_cow(aff
);
1708 aff
->v
= isl_vec_cow(aff
->v
);
1710 return isl_aff_free(aff
);
1712 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1713 isl_int_sub_ui(aff
->v
->el
[1], aff
->v
->el
[1], 1);
1714 aff
= isl_aff_floor(aff
);
1719 /* Apply the expansion computed by isl_merge_divs.
1720 * The expansion itself is given by "exp" while the resulting
1721 * list of divs is given by "div".
1723 __isl_give isl_aff
*isl_aff_expand_divs(__isl_take isl_aff
*aff
,
1724 __isl_take isl_mat
*div
, int *exp
)
1730 aff
= isl_aff_cow(aff
);
1734 old_n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1735 new_n_div
= isl_mat_rows(div
);
1736 offset
= 1 + isl_local_space_offset(aff
->ls
, isl_dim_div
);
1738 aff
->v
= isl_vec_expand(aff
->v
, offset
, old_n_div
, exp
, new_n_div
);
1739 aff
->ls
= isl_local_space_replace_divs(aff
->ls
, div
);
1740 if (!aff
->v
|| !aff
->ls
)
1741 return isl_aff_free(aff
);
1749 /* Add two affine expressions that live in the same local space.
1751 static __isl_give isl_aff
*add_expanded(__isl_take isl_aff
*aff1
,
1752 __isl_take isl_aff
*aff2
)
1756 aff1
= isl_aff_cow(aff1
);
1760 aff1
->v
= isl_vec_cow(aff1
->v
);
1766 isl_int_gcd(gcd
, aff1
->v
->el
[0], aff2
->v
->el
[0]);
1767 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1768 isl_seq_scale(aff1
->v
->el
+ 1, aff1
->v
->el
+ 1, f
, aff1
->v
->size
- 1);
1769 isl_int_divexact(f
, aff1
->v
->el
[0], gcd
);
1770 isl_seq_addmul(aff1
->v
->el
+ 1, f
, aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
1771 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1772 isl_int_mul(aff1
->v
->el
[0], aff1
->v
->el
[0], f
);
1784 /* Return the sum of "aff1" and "aff2".
1786 * If either of the two is NaN, then the result is NaN.
1788 __isl_give isl_aff
*isl_aff_add(__isl_take isl_aff
*aff1
,
1789 __isl_take isl_aff
*aff2
)
1800 ctx
= isl_aff_get_ctx(aff1
);
1801 if (!isl_space_is_equal(aff1
->ls
->dim
, aff2
->ls
->dim
))
1802 isl_die(ctx
, isl_error_invalid
,
1803 "spaces don't match", goto error
);
1805 if (isl_aff_is_nan(aff1
)) {
1809 if (isl_aff_is_nan(aff2
)) {
1814 n_div1
= isl_aff_dim(aff1
, isl_dim_div
);
1815 n_div2
= isl_aff_dim(aff2
, isl_dim_div
);
1816 if (n_div1
== 0 && n_div2
== 0)
1817 return add_expanded(aff1
, aff2
);
1819 exp1
= isl_alloc_array(ctx
, int, n_div1
);
1820 exp2
= isl_alloc_array(ctx
, int, n_div2
);
1821 if ((n_div1
&& !exp1
) || (n_div2
&& !exp2
))
1824 div
= isl_merge_divs(aff1
->ls
->div
, aff2
->ls
->div
, exp1
, exp2
);
1825 aff1
= isl_aff_expand_divs(aff1
, isl_mat_copy(div
), exp1
);
1826 aff2
= isl_aff_expand_divs(aff2
, div
, exp2
);
1830 return add_expanded(aff1
, aff2
);
1839 __isl_give isl_aff
*isl_aff_sub(__isl_take isl_aff
*aff1
,
1840 __isl_take isl_aff
*aff2
)
1842 return isl_aff_add(aff1
, isl_aff_neg(aff2
));
1845 /* Return the result of scaling "aff" by a factor of "f".
1847 * As a special case, f * NaN = NaN.
1849 __isl_give isl_aff
*isl_aff_scale(__isl_take isl_aff
*aff
, isl_int f
)
1855 if (isl_aff_is_nan(aff
))
1858 if (isl_int_is_one(f
))
1861 aff
= isl_aff_cow(aff
);
1864 aff
->v
= isl_vec_cow(aff
->v
);
1866 return isl_aff_free(aff
);
1868 if (isl_int_is_pos(f
) && isl_int_is_divisible_by(aff
->v
->el
[0], f
)) {
1869 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], f
);
1874 isl_int_gcd(gcd
, aff
->v
->el
[0], f
);
1875 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1876 isl_int_divexact(gcd
, f
, gcd
);
1877 isl_seq_scale(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1883 /* Multiple "aff" by "v".
1885 __isl_give isl_aff
*isl_aff_scale_val(__isl_take isl_aff
*aff
,
1886 __isl_take isl_val
*v
)
1891 if (isl_val_is_one(v
)) {
1896 if (!isl_val_is_rat(v
))
1897 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1898 "expecting rational factor", goto error
);
1900 aff
= isl_aff_scale(aff
, v
->n
);
1901 aff
= isl_aff_scale_down(aff
, v
->d
);
1911 /* Return the result of scaling "aff" down by a factor of "f".
1913 * As a special case, NaN/f = NaN.
1915 __isl_give isl_aff
*isl_aff_scale_down(__isl_take isl_aff
*aff
, isl_int f
)
1921 if (isl_aff_is_nan(aff
))
1924 if (isl_int_is_one(f
))
1927 aff
= isl_aff_cow(aff
);
1931 if (isl_int_is_zero(f
))
1932 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1933 "cannot scale down by zero", return isl_aff_free(aff
));
1935 aff
->v
= isl_vec_cow(aff
->v
);
1937 return isl_aff_free(aff
);
1940 isl_seq_gcd(aff
->v
->el
+ 1, aff
->v
->size
- 1, &gcd
);
1941 isl_int_gcd(gcd
, gcd
, f
);
1942 isl_seq_scale_down(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1943 isl_int_divexact(gcd
, f
, gcd
);
1944 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1950 /* Divide "aff" by "v".
1952 __isl_give isl_aff
*isl_aff_scale_down_val(__isl_take isl_aff
*aff
,
1953 __isl_take isl_val
*v
)
1958 if (isl_val_is_one(v
)) {
1963 if (!isl_val_is_rat(v
))
1964 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1965 "expecting rational factor", goto error
);
1966 if (!isl_val_is_pos(v
))
1967 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1968 "factor needs to be positive", goto error
);
1970 aff
= isl_aff_scale(aff
, v
->d
);
1971 aff
= isl_aff_scale_down(aff
, v
->n
);
1981 __isl_give isl_aff
*isl_aff_scale_down_ui(__isl_take isl_aff
*aff
, unsigned f
)
1989 isl_int_set_ui(v
, f
);
1990 aff
= isl_aff_scale_down(aff
, v
);
1996 __isl_give isl_aff
*isl_aff_set_dim_name(__isl_take isl_aff
*aff
,
1997 enum isl_dim_type type
, unsigned pos
, const char *s
)
1999 aff
= isl_aff_cow(aff
);
2002 if (type
== isl_dim_out
)
2003 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2004 "cannot set name of output/set dimension",
2005 return isl_aff_free(aff
));
2006 if (type
== isl_dim_in
)
2008 aff
->ls
= isl_local_space_set_dim_name(aff
->ls
, type
, pos
, s
);
2010 return isl_aff_free(aff
);
2015 __isl_give isl_aff
*isl_aff_set_dim_id(__isl_take isl_aff
*aff
,
2016 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
2018 aff
= isl_aff_cow(aff
);
2021 if (type
== isl_dim_out
)
2022 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2023 "cannot set name of output/set dimension",
2025 if (type
== isl_dim_in
)
2027 aff
->ls
= isl_local_space_set_dim_id(aff
->ls
, type
, pos
, id
);
2029 return isl_aff_free(aff
);
2038 /* Replace the identifier of the input tuple of "aff" by "id".
2039 * type is currently required to be equal to isl_dim_in
2041 __isl_give isl_aff
*isl_aff_set_tuple_id(__isl_take isl_aff
*aff
,
2042 enum isl_dim_type type
, __isl_take isl_id
*id
)
2044 aff
= isl_aff_cow(aff
);
2047 if (type
!= isl_dim_out
)
2048 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2049 "cannot only set id of input tuple", goto error
);
2050 aff
->ls
= isl_local_space_set_tuple_id(aff
->ls
, isl_dim_set
, id
);
2052 return isl_aff_free(aff
);
2061 /* Exploit the equalities in "eq" to simplify the affine expression
2062 * and the expressions of the integer divisions in the local space.
2063 * The integer divisions in this local space are assumed to appear
2064 * as regular dimensions in "eq".
2066 static __isl_give isl_aff
*isl_aff_substitute_equalities_lifted(
2067 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
2075 if (eq
->n_eq
== 0) {
2076 isl_basic_set_free(eq
);
2080 aff
= isl_aff_cow(aff
);
2084 aff
->ls
= isl_local_space_substitute_equalities(aff
->ls
,
2085 isl_basic_set_copy(eq
));
2086 aff
->v
= isl_vec_cow(aff
->v
);
2087 if (!aff
->ls
|| !aff
->v
)
2090 total
= 1 + isl_space_dim(eq
->dim
, isl_dim_all
);
2092 for (i
= 0; i
< eq
->n_eq
; ++i
) {
2093 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
2094 if (j
< 0 || j
== 0 || j
>= total
)
2097 isl_seq_elim(aff
->v
->el
+ 1, eq
->eq
[i
], j
, total
,
2101 isl_basic_set_free(eq
);
2102 aff
= isl_aff_normalize(aff
);
2105 isl_basic_set_free(eq
);
2110 /* Exploit the equalities in "eq" to simplify the affine expression
2111 * and the expressions of the integer divisions in the local space.
2113 __isl_give isl_aff
*isl_aff_substitute_equalities(__isl_take isl_aff
*aff
,
2114 __isl_take isl_basic_set
*eq
)
2120 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2122 eq
= isl_basic_set_add_dims(eq
, isl_dim_set
, n_div
);
2123 return isl_aff_substitute_equalities_lifted(aff
, eq
);
2125 isl_basic_set_free(eq
);
2130 /* Look for equalities among the variables shared by context and aff
2131 * and the integer divisions of aff, if any.
2132 * The equalities are then used to eliminate coefficients and/or integer
2133 * divisions from aff.
2135 __isl_give isl_aff
*isl_aff_gist(__isl_take isl_aff
*aff
,
2136 __isl_take isl_set
*context
)
2138 isl_basic_set
*hull
;
2143 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
2145 isl_basic_set
*bset
;
2146 isl_local_space
*ls
;
2147 context
= isl_set_add_dims(context
, isl_dim_set
, n_div
);
2148 ls
= isl_aff_get_domain_local_space(aff
);
2149 bset
= isl_basic_set_from_local_space(ls
);
2150 bset
= isl_basic_set_lift(bset
);
2151 bset
= isl_basic_set_flatten(bset
);
2152 context
= isl_set_intersect(context
,
2153 isl_set_from_basic_set(bset
));
2156 hull
= isl_set_affine_hull(context
);
2157 return isl_aff_substitute_equalities_lifted(aff
, hull
);
2160 isl_set_free(context
);
2164 __isl_give isl_aff
*isl_aff_gist_params(__isl_take isl_aff
*aff
,
2165 __isl_take isl_set
*context
)
2167 isl_set
*dom_context
= isl_set_universe(isl_aff_get_domain_space(aff
));
2168 dom_context
= isl_set_intersect_params(dom_context
, context
);
2169 return isl_aff_gist(aff
, dom_context
);
2172 /* Return a basic set containing those elements in the space
2173 * of aff where it is positive. "rational" should not be set.
2175 * If "aff" is NaN, then it is not positive.
2177 static __isl_give isl_basic_set
*aff_pos_basic_set(__isl_take isl_aff
*aff
,
2180 isl_constraint
*ineq
;
2181 isl_basic_set
*bset
;
2186 if (isl_aff_is_nan(aff
)) {
2187 isl_space
*space
= isl_aff_get_domain_space(aff
);
2189 return isl_basic_set_empty(space
);
2192 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2193 "rational sets not supported", goto error
);
2195 ineq
= isl_inequality_from_aff(aff
);
2196 c
= isl_constraint_get_constant_val(ineq
);
2197 c
= isl_val_sub_ui(c
, 1);
2198 ineq
= isl_constraint_set_constant_val(ineq
, c
);
2200 bset
= isl_basic_set_from_constraint(ineq
);
2201 bset
= isl_basic_set_simplify(bset
);
2208 /* Return a basic set containing those elements in the space
2209 * of aff where it is non-negative.
2210 * If "rational" is set, then return a rational basic set.
2212 * If "aff" is NaN, then it is not non-negative (it's not negative either).
2214 static __isl_give isl_basic_set
*aff_nonneg_basic_set(
2215 __isl_take isl_aff
*aff
, int rational
)
2217 isl_constraint
*ineq
;
2218 isl_basic_set
*bset
;
2222 if (isl_aff_is_nan(aff
)) {
2223 isl_space
*space
= isl_aff_get_domain_space(aff
);
2225 return isl_basic_set_empty(space
);
2228 ineq
= isl_inequality_from_aff(aff
);
2230 bset
= isl_basic_set_from_constraint(ineq
);
2232 bset
= isl_basic_set_set_rational(bset
);
2233 bset
= isl_basic_set_simplify(bset
);
2237 /* Return a basic set containing those elements in the space
2238 * of aff where it is non-negative.
2240 __isl_give isl_basic_set
*isl_aff_nonneg_basic_set(__isl_take isl_aff
*aff
)
2242 return aff_nonneg_basic_set(aff
, 0);
2245 /* Return a basic set containing those elements in the domain space
2246 * of aff where it is negative.
2248 __isl_give isl_basic_set
*isl_aff_neg_basic_set(__isl_take isl_aff
*aff
)
2250 aff
= isl_aff_neg(aff
);
2251 aff
= isl_aff_add_constant_num_si(aff
, -1);
2252 return isl_aff_nonneg_basic_set(aff
);
2255 /* Return a basic set containing those elements in the space
2256 * of aff where it is zero.
2257 * If "rational" is set, then return a rational basic set.
2259 * If "aff" is NaN, then it is not zero.
2261 static __isl_give isl_basic_set
*aff_zero_basic_set(__isl_take isl_aff
*aff
,
2264 isl_constraint
*ineq
;
2265 isl_basic_set
*bset
;
2269 if (isl_aff_is_nan(aff
)) {
2270 isl_space
*space
= isl_aff_get_domain_space(aff
);
2272 return isl_basic_set_empty(space
);
2275 ineq
= isl_equality_from_aff(aff
);
2277 bset
= isl_basic_set_from_constraint(ineq
);
2279 bset
= isl_basic_set_set_rational(bset
);
2280 bset
= isl_basic_set_simplify(bset
);
2284 /* Return a basic set containing those elements in the space
2285 * of aff where it is zero.
2287 __isl_give isl_basic_set
*isl_aff_zero_basic_set(__isl_take isl_aff
*aff
)
2289 return aff_zero_basic_set(aff
, 0);
2292 /* Return a basic set containing those elements in the shared space
2293 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2295 __isl_give isl_basic_set
*isl_aff_ge_basic_set(__isl_take isl_aff
*aff1
,
2296 __isl_take isl_aff
*aff2
)
2298 aff1
= isl_aff_sub(aff1
, aff2
);
2300 return isl_aff_nonneg_basic_set(aff1
);
2303 /* Return a set containing those elements in the shared space
2304 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
2306 __isl_give isl_set
*isl_aff_ge_set(__isl_take isl_aff
*aff1
,
2307 __isl_take isl_aff
*aff2
)
2309 return isl_set_from_basic_set(isl_aff_ge_basic_set(aff1
, aff2
));
2312 /* Return a basic set containing those elements in the shared space
2313 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2315 __isl_give isl_basic_set
*isl_aff_le_basic_set(__isl_take isl_aff
*aff1
,
2316 __isl_take isl_aff
*aff2
)
2318 return isl_aff_ge_basic_set(aff2
, aff1
);
2321 /* Return a set containing those elements in the shared space
2322 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
2324 __isl_give isl_set
*isl_aff_le_set(__isl_take isl_aff
*aff1
,
2325 __isl_take isl_aff
*aff2
)
2327 return isl_aff_ge_set(aff2
, aff1
);
2330 /* Return a basic set containing those elements in the shared space
2331 * of aff1 and aff2 where aff1 and aff2 are equal.
2333 __isl_give isl_basic_set
*isl_aff_eq_basic_set(__isl_take isl_aff
*aff1
,
2334 __isl_take isl_aff
*aff2
)
2336 aff1
= isl_aff_sub(aff1
, aff2
);
2338 return isl_aff_zero_basic_set(aff1
);
2341 /* Return a set containing those elements in the shared space
2342 * of aff1 and aff2 where aff1 and aff2 are equal.
2344 __isl_give isl_set
*isl_aff_eq_set(__isl_take isl_aff
*aff1
,
2345 __isl_take isl_aff
*aff2
)
2347 return isl_set_from_basic_set(isl_aff_eq_basic_set(aff1
, aff2
));
2350 __isl_give isl_aff
*isl_aff_add_on_domain(__isl_keep isl_set
*dom
,
2351 __isl_take isl_aff
*aff1
, __isl_take isl_aff
*aff2
)
2353 aff1
= isl_aff_add(aff1
, aff2
);
2354 aff1
= isl_aff_gist(aff1
, isl_set_copy(dom
));
2358 int isl_aff_is_empty(__isl_keep isl_aff
*aff
)
2366 /* Check whether the given affine expression has non-zero coefficient
2367 * for any dimension in the given range or if any of these dimensions
2368 * appear with non-zero coefficients in any of the integer divisions
2369 * involved in the affine expression.
2371 isl_bool
isl_aff_involves_dims(__isl_keep isl_aff
*aff
,
2372 enum isl_dim_type type
, unsigned first
, unsigned n
)
2377 isl_bool involves
= isl_bool_false
;
2380 return isl_bool_error
;
2382 return isl_bool_false
;
2384 ctx
= isl_aff_get_ctx(aff
);
2385 if (first
+ n
> isl_aff_dim(aff
, type
))
2386 isl_die(ctx
, isl_error_invalid
,
2387 "range out of bounds", return isl_bool_error
);
2389 active
= isl_local_space_get_active(aff
->ls
, aff
->v
->el
+ 2);
2393 first
+= isl_local_space_offset(aff
->ls
, type
) - 1;
2394 for (i
= 0; i
< n
; ++i
)
2395 if (active
[first
+ i
]) {
2396 involves
= isl_bool_true
;
2405 return isl_bool_error
;
2408 __isl_give isl_aff
*isl_aff_drop_dims(__isl_take isl_aff
*aff
,
2409 enum isl_dim_type type
, unsigned first
, unsigned n
)
2415 if (type
== isl_dim_out
)
2416 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2417 "cannot drop output/set dimension",
2418 return isl_aff_free(aff
));
2419 if (type
== isl_dim_in
)
2421 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2424 ctx
= isl_aff_get_ctx(aff
);
2425 if (first
+ n
> isl_local_space_dim(aff
->ls
, type
))
2426 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
2427 return isl_aff_free(aff
));
2429 aff
= isl_aff_cow(aff
);
2433 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, type
, first
, n
);
2435 return isl_aff_free(aff
);
2437 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2438 aff
->v
= isl_vec_drop_els(aff
->v
, first
, n
);
2440 return isl_aff_free(aff
);
2445 /* Project the domain of the affine expression onto its parameter space.
2446 * The affine expression may not involve any of the domain dimensions.
2448 __isl_give isl_aff
*isl_aff_project_domain_on_params(__isl_take isl_aff
*aff
)
2454 n
= isl_aff_dim(aff
, isl_dim_in
);
2455 involves
= isl_aff_involves_dims(aff
, isl_dim_in
, 0, n
);
2457 return isl_aff_free(aff
);
2459 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2460 "affine expression involves some of the domain dimensions",
2461 return isl_aff_free(aff
));
2462 aff
= isl_aff_drop_dims(aff
, isl_dim_in
, 0, n
);
2463 space
= isl_aff_get_domain_space(aff
);
2464 space
= isl_space_params(space
);
2465 aff
= isl_aff_reset_domain_space(aff
, space
);
2469 __isl_give isl_aff
*isl_aff_insert_dims(__isl_take isl_aff
*aff
,
2470 enum isl_dim_type type
, unsigned first
, unsigned n
)
2476 if (type
== isl_dim_out
)
2477 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2478 "cannot insert output/set dimensions",
2479 return isl_aff_free(aff
));
2480 if (type
== isl_dim_in
)
2482 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2485 ctx
= isl_aff_get_ctx(aff
);
2486 if (first
> isl_local_space_dim(aff
->ls
, type
))
2487 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
2488 return isl_aff_free(aff
));
2490 aff
= isl_aff_cow(aff
);
2494 aff
->ls
= isl_local_space_insert_dims(aff
->ls
, type
, first
, n
);
2496 return isl_aff_free(aff
);
2498 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2499 aff
->v
= isl_vec_insert_zero_els(aff
->v
, first
, n
);
2501 return isl_aff_free(aff
);
2506 __isl_give isl_aff
*isl_aff_add_dims(__isl_take isl_aff
*aff
,
2507 enum isl_dim_type type
, unsigned n
)
2511 pos
= isl_aff_dim(aff
, type
);
2513 return isl_aff_insert_dims(aff
, type
, pos
, n
);
2516 __isl_give isl_pw_aff
*isl_pw_aff_add_dims(__isl_take isl_pw_aff
*pwaff
,
2517 enum isl_dim_type type
, unsigned n
)
2521 pos
= isl_pw_aff_dim(pwaff
, type
);
2523 return isl_pw_aff_insert_dims(pwaff
, type
, pos
, n
);
2526 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "aff"
2527 * to dimensions of "dst_type" at "dst_pos".
2529 * We only support moving input dimensions to parameters and vice versa.
2531 __isl_give isl_aff
*isl_aff_move_dims(__isl_take isl_aff
*aff
,
2532 enum isl_dim_type dst_type
, unsigned dst_pos
,
2533 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2541 !isl_local_space_is_named_or_nested(aff
->ls
, src_type
) &&
2542 !isl_local_space_is_named_or_nested(aff
->ls
, dst_type
))
2545 if (dst_type
== isl_dim_out
|| src_type
== isl_dim_out
)
2546 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2547 "cannot move output/set dimension",
2548 return isl_aff_free(aff
));
2549 if (dst_type
== isl_dim_div
|| src_type
== isl_dim_div
)
2550 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2551 "cannot move divs", return isl_aff_free(aff
));
2552 if (dst_type
== isl_dim_in
)
2553 dst_type
= isl_dim_set
;
2554 if (src_type
== isl_dim_in
)
2555 src_type
= isl_dim_set
;
2557 if (src_pos
+ n
> isl_local_space_dim(aff
->ls
, src_type
))
2558 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2559 "range out of bounds", return isl_aff_free(aff
));
2560 if (dst_type
== src_type
)
2561 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2562 "moving dims within the same type not supported",
2563 return isl_aff_free(aff
));
2565 aff
= isl_aff_cow(aff
);
2569 g_src_pos
= 1 + isl_local_space_offset(aff
->ls
, src_type
) + src_pos
;
2570 g_dst_pos
= 1 + isl_local_space_offset(aff
->ls
, dst_type
) + dst_pos
;
2571 if (dst_type
> src_type
)
2574 aff
->v
= isl_vec_move_els(aff
->v
, g_dst_pos
, g_src_pos
, n
);
2575 aff
->ls
= isl_local_space_move_dims(aff
->ls
, dst_type
, dst_pos
,
2576 src_type
, src_pos
, n
);
2577 if (!aff
->v
|| !aff
->ls
)
2578 return isl_aff_free(aff
);
2580 aff
= sort_divs(aff
);
2585 __isl_give isl_pw_aff
*isl_pw_aff_from_aff(__isl_take isl_aff
*aff
)
2587 isl_set
*dom
= isl_set_universe(isl_aff_get_domain_space(aff
));
2588 return isl_pw_aff_alloc(dom
, aff
);
2592 #define PW isl_pw_aff
2596 #define EL_IS_ZERO is_empty
2600 #define IS_ZERO is_empty
2603 #undef DEFAULT_IS_ZERO
2604 #define DEFAULT_IS_ZERO 0
2611 #include <isl_pw_templ.c>
2612 #include <isl_pw_hash.c>
2613 #include <isl_pw_union_opt.c>
2616 #define UNION isl_union_pw_aff
2618 #define PART isl_pw_aff
2620 #define PARTS pw_aff
2622 #include <isl_union_single.c>
2623 #include <isl_union_neg.c>
2625 static __isl_give isl_set
*align_params_pw_pw_set_and(
2626 __isl_take isl_pw_aff
*pwaff1
, __isl_take isl_pw_aff
*pwaff2
,
2627 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
2628 __isl_take isl_pw_aff
*pwaff2
))
2630 if (!pwaff1
|| !pwaff2
)
2632 if (isl_space_match(pwaff1
->dim
, isl_dim_param
,
2633 pwaff2
->dim
, isl_dim_param
))
2634 return fn(pwaff1
, pwaff2
);
2635 if (!isl_space_has_named_params(pwaff1
->dim
) ||
2636 !isl_space_has_named_params(pwaff2
->dim
))
2637 isl_die(isl_pw_aff_get_ctx(pwaff1
), isl_error_invalid
,
2638 "unaligned unnamed parameters", goto error
);
2639 pwaff1
= isl_pw_aff_align_params(pwaff1
, isl_pw_aff_get_space(pwaff2
));
2640 pwaff2
= isl_pw_aff_align_params(pwaff2
, isl_pw_aff_get_space(pwaff1
));
2641 return fn(pwaff1
, pwaff2
);
2643 isl_pw_aff_free(pwaff1
);
2644 isl_pw_aff_free(pwaff2
);
2648 /* Align the parameters of the to isl_pw_aff arguments and
2649 * then apply a function "fn" on them that returns an isl_map.
2651 static __isl_give isl_map
*align_params_pw_pw_map_and(
2652 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
2653 __isl_give isl_map
*(*fn
)(__isl_take isl_pw_aff
*pa1
,
2654 __isl_take isl_pw_aff
*pa2
))
2658 if (isl_space_match(pa1
->dim
, isl_dim_param
, pa2
->dim
, isl_dim_param
))
2659 return fn(pa1
, pa2
);
2660 if (!isl_space_has_named_params(pa1
->dim
) ||
2661 !isl_space_has_named_params(pa2
->dim
))
2662 isl_die(isl_pw_aff_get_ctx(pa1
), isl_error_invalid
,
2663 "unaligned unnamed parameters", goto error
);
2664 pa1
= isl_pw_aff_align_params(pa1
, isl_pw_aff_get_space(pa2
));
2665 pa2
= isl_pw_aff_align_params(pa2
, isl_pw_aff_get_space(pa1
));
2666 return fn(pa1
, pa2
);
2668 isl_pw_aff_free(pa1
);
2669 isl_pw_aff_free(pa2
);
2673 /* Compute a piecewise quasi-affine expression with a domain that
2674 * is the union of those of pwaff1 and pwaff2 and such that on each
2675 * cell, the quasi-affine expression is the maximum of those of pwaff1
2676 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2677 * cell, then the associated expression is the defined one.
2679 static __isl_give isl_pw_aff
*pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2680 __isl_take isl_pw_aff
*pwaff2
)
2682 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_ge_set
);
2685 __isl_give isl_pw_aff
*isl_pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2686 __isl_take isl_pw_aff
*pwaff2
)
2688 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2692 /* Compute a piecewise quasi-affine expression with a domain that
2693 * is the union of those of pwaff1 and pwaff2 and such that on each
2694 * cell, the quasi-affine expression is the minimum of those of pwaff1
2695 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2696 * cell, then the associated expression is the defined one.
2698 static __isl_give isl_pw_aff
*pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2699 __isl_take isl_pw_aff
*pwaff2
)
2701 return isl_pw_aff_union_opt_cmp(pwaff1
, pwaff2
, &isl_aff_le_set
);
2704 __isl_give isl_pw_aff
*isl_pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2705 __isl_take isl_pw_aff
*pwaff2
)
2707 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2711 __isl_give isl_pw_aff
*isl_pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
2712 __isl_take isl_pw_aff
*pwaff2
, int max
)
2715 return isl_pw_aff_union_max(pwaff1
, pwaff2
);
2717 return isl_pw_aff_union_min(pwaff1
, pwaff2
);
2720 /* Construct a map with as domain the domain of pwaff and
2721 * one-dimensional range corresponding to the affine expressions.
2723 static __isl_give isl_map
*map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2732 dim
= isl_pw_aff_get_space(pwaff
);
2733 map
= isl_map_empty(dim
);
2735 for (i
= 0; i
< pwaff
->n
; ++i
) {
2736 isl_basic_map
*bmap
;
2739 bmap
= isl_basic_map_from_aff(isl_aff_copy(pwaff
->p
[i
].aff
));
2740 map_i
= isl_map_from_basic_map(bmap
);
2741 map_i
= isl_map_intersect_domain(map_i
,
2742 isl_set_copy(pwaff
->p
[i
].set
));
2743 map
= isl_map_union_disjoint(map
, map_i
);
2746 isl_pw_aff_free(pwaff
);
2751 /* Construct a map with as domain the domain of pwaff and
2752 * one-dimensional range corresponding to the affine expressions.
2754 __isl_give isl_map
*isl_map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2758 if (isl_space_is_set(pwaff
->dim
))
2759 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2760 "space of input is not a map", goto error
);
2761 return map_from_pw_aff(pwaff
);
2763 isl_pw_aff_free(pwaff
);
2767 /* Construct a one-dimensional set with as parameter domain
2768 * the domain of pwaff and the single set dimension
2769 * corresponding to the affine expressions.
2771 __isl_give isl_set
*isl_set_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2775 if (!isl_space_is_set(pwaff
->dim
))
2776 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2777 "space of input is not a set", goto error
);
2778 return map_from_pw_aff(pwaff
);
2780 isl_pw_aff_free(pwaff
);
2784 /* Return a set containing those elements in the domain
2785 * of "pwaff" where it satisfies "fn" (if complement is 0) or
2786 * does not satisfy "fn" (if complement is 1).
2788 * The pieces with a NaN never belong to the result since
2789 * NaN does not satisfy any property.
2791 static __isl_give isl_set
*pw_aff_locus(__isl_take isl_pw_aff
*pwaff
,
2792 __isl_give isl_basic_set
*(*fn
)(__isl_take isl_aff
*aff
, int rational
),
2801 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
2803 for (i
= 0; i
< pwaff
->n
; ++i
) {
2804 isl_basic_set
*bset
;
2805 isl_set
*set_i
, *locus
;
2808 if (isl_aff_is_nan(pwaff
->p
[i
].aff
))
2811 rational
= isl_set_has_rational(pwaff
->p
[i
].set
);
2812 bset
= fn(isl_aff_copy(pwaff
->p
[i
].aff
), rational
);
2813 locus
= isl_set_from_basic_set(bset
);
2814 set_i
= isl_set_copy(pwaff
->p
[i
].set
);
2816 set_i
= isl_set_subtract(set_i
, locus
);
2818 set_i
= isl_set_intersect(set_i
, locus
);
2819 set
= isl_set_union_disjoint(set
, set_i
);
2822 isl_pw_aff_free(pwaff
);
2827 /* Return a set containing those elements in the domain
2828 * of "pa" where it is positive.
2830 __isl_give isl_set
*isl_pw_aff_pos_set(__isl_take isl_pw_aff
*pa
)
2832 return pw_aff_locus(pa
, &aff_pos_basic_set
, 0);
2835 /* Return a set containing those elements in the domain
2836 * of pwaff where it is non-negative.
2838 __isl_give isl_set
*isl_pw_aff_nonneg_set(__isl_take isl_pw_aff
*pwaff
)
2840 return pw_aff_locus(pwaff
, &aff_nonneg_basic_set
, 0);
2843 /* Return a set containing those elements in the domain
2844 * of pwaff where it is zero.
2846 __isl_give isl_set
*isl_pw_aff_zero_set(__isl_take isl_pw_aff
*pwaff
)
2848 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 0);
2851 /* Return a set containing those elements in the domain
2852 * of pwaff where it is not zero.
2854 __isl_give isl_set
*isl_pw_aff_non_zero_set(__isl_take isl_pw_aff
*pwaff
)
2856 return pw_aff_locus(pwaff
, &aff_zero_basic_set
, 1);
2859 /* Return a set containing those elements in the shared domain
2860 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
2862 * We compute the difference on the shared domain and then construct
2863 * the set of values where this difference is non-negative.
2864 * If strict is set, we first subtract 1 from the difference.
2865 * If equal is set, we only return the elements where pwaff1 and pwaff2
2868 static __isl_give isl_set
*pw_aff_gte_set(__isl_take isl_pw_aff
*pwaff1
,
2869 __isl_take isl_pw_aff
*pwaff2
, int strict
, int equal
)
2871 isl_set
*set1
, *set2
;
2873 set1
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
));
2874 set2
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
));
2875 set1
= isl_set_intersect(set1
, set2
);
2876 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, isl_set_copy(set1
));
2877 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, isl_set_copy(set1
));
2878 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_neg(pwaff2
));
2881 isl_space
*dim
= isl_set_get_space(set1
);
2883 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2884 aff
= isl_aff_add_constant_si(aff
, -1);
2885 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_alloc(set1
, aff
));
2890 return isl_pw_aff_zero_set(pwaff1
);
2891 return isl_pw_aff_nonneg_set(pwaff1
);
2894 /* Return a set containing those elements in the shared domain
2895 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
2897 static __isl_give isl_set
*pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2898 __isl_take isl_pw_aff
*pwaff2
)
2900 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 1);
2903 __isl_give isl_set
*isl_pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2904 __isl_take isl_pw_aff
*pwaff2
)
2906 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_eq_set
);
2909 /* Return a set containing those elements in the shared domain
2910 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
2912 static __isl_give isl_set
*pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2913 __isl_take isl_pw_aff
*pwaff2
)
2915 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 0);
2918 __isl_give isl_set
*isl_pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2919 __isl_take isl_pw_aff
*pwaff2
)
2921 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ge_set
);
2924 /* Return a set containing those elements in the shared domain
2925 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
2927 static __isl_give isl_set
*pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2928 __isl_take isl_pw_aff
*pwaff2
)
2930 return pw_aff_gte_set(pwaff1
, pwaff2
, 1, 0);
2933 __isl_give isl_set
*isl_pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2934 __isl_take isl_pw_aff
*pwaff2
)
2936 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_gt_set
);
2939 __isl_give isl_set
*isl_pw_aff_le_set(__isl_take isl_pw_aff
*pwaff1
,
2940 __isl_take isl_pw_aff
*pwaff2
)
2942 return isl_pw_aff_ge_set(pwaff2
, pwaff1
);
2945 __isl_give isl_set
*isl_pw_aff_lt_set(__isl_take isl_pw_aff
*pwaff1
,
2946 __isl_take isl_pw_aff
*pwaff2
)
2948 return isl_pw_aff_gt_set(pwaff2
, pwaff1
);
2951 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2952 * where the function values are ordered in the same way as "order",
2953 * which returns a set in the shared domain of its two arguments.
2954 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
2956 * Let "pa1" and "pa2" be defined on domains A and B respectively.
2957 * We first pull back the two functions such that they are defined on
2958 * the domain [A -> B]. Then we apply "order", resulting in a set
2959 * in the space [A -> B]. Finally, we unwrap this set to obtain
2960 * a map in the space A -> B.
2962 static __isl_give isl_map
*isl_pw_aff_order_map_aligned(
2963 __isl_take isl_pw_aff
*pa1
, __isl_take isl_pw_aff
*pa2
,
2964 __isl_give isl_set
*(*order
)(__isl_take isl_pw_aff
*pa1
,
2965 __isl_take isl_pw_aff
*pa2
))
2967 isl_space
*space1
, *space2
;
2971 space1
= isl_space_domain(isl_pw_aff_get_space(pa1
));
2972 space2
= isl_space_domain(isl_pw_aff_get_space(pa2
));
2973 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
2974 ma
= isl_multi_aff_domain_map(isl_space_copy(space1
));
2975 pa1
= isl_pw_aff_pullback_multi_aff(pa1
, ma
);
2976 ma
= isl_multi_aff_range_map(space1
);
2977 pa2
= isl_pw_aff_pullback_multi_aff(pa2
, ma
);
2978 set
= order(pa1
, pa2
);
2980 return isl_set_unwrap(set
);
2983 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2984 * where the function values are equal.
2985 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
2987 static __isl_give isl_map
*isl_pw_aff_eq_map_aligned(__isl_take isl_pw_aff
*pa1
,
2988 __isl_take isl_pw_aff
*pa2
)
2990 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_eq_set
);
2993 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
2994 * where the function values are equal.
2996 __isl_give isl_map
*isl_pw_aff_eq_map(__isl_take isl_pw_aff
*pa1
,
2997 __isl_take isl_pw_aff
*pa2
)
2999 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_eq_map_aligned
);
3002 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3003 * where the function value of "pa1" is less than the function value of "pa2".
3004 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3006 static __isl_give isl_map
*isl_pw_aff_lt_map_aligned(__isl_take isl_pw_aff
*pa1
,
3007 __isl_take isl_pw_aff
*pa2
)
3009 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_lt_set
);
3012 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3013 * where the function value of "pa1" is less than the function value of "pa2".
3015 __isl_give isl_map
*isl_pw_aff_lt_map(__isl_take isl_pw_aff
*pa1
,
3016 __isl_take isl_pw_aff
*pa2
)
3018 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_lt_map_aligned
);
3021 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3022 * where the function value of "pa1" is greater than the function value
3024 * The parameters of "pa1" and "pa2" are assumed to have been aligned.
3026 static __isl_give isl_map
*isl_pw_aff_gt_map_aligned(__isl_take isl_pw_aff
*pa1
,
3027 __isl_take isl_pw_aff
*pa2
)
3029 return isl_pw_aff_order_map_aligned(pa1
, pa2
, &isl_pw_aff_gt_set
);
3032 /* Return a map containing pairs of elements in the domains of "pa1" and "pa2"
3033 * where the function value of "pa1" is greater than the function value
3036 __isl_give isl_map
*isl_pw_aff_gt_map(__isl_take isl_pw_aff
*pa1
,
3037 __isl_take isl_pw_aff
*pa2
)
3039 return align_params_pw_pw_map_and(pa1
, pa2
, &isl_pw_aff_gt_map_aligned
);
3042 /* Return a set containing those elements in the shared domain
3043 * of the elements of list1 and list2 where each element in list1
3044 * has the relation specified by "fn" with each element in list2.
3046 static __isl_give isl_set
*pw_aff_list_set(__isl_take isl_pw_aff_list
*list1
,
3047 __isl_take isl_pw_aff_list
*list2
,
3048 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3049 __isl_take isl_pw_aff
*pwaff2
))
3055 if (!list1
|| !list2
)
3058 ctx
= isl_pw_aff_list_get_ctx(list1
);
3059 if (list1
->n
< 1 || list2
->n
< 1)
3060 isl_die(ctx
, isl_error_invalid
,
3061 "list should contain at least one element", goto error
);
3063 set
= isl_set_universe(isl_pw_aff_get_domain_space(list1
->p
[0]));
3064 for (i
= 0; i
< list1
->n
; ++i
)
3065 for (j
= 0; j
< list2
->n
; ++j
) {
3068 set_ij
= fn(isl_pw_aff_copy(list1
->p
[i
]),
3069 isl_pw_aff_copy(list2
->p
[j
]));
3070 set
= isl_set_intersect(set
, set_ij
);
3073 isl_pw_aff_list_free(list1
);
3074 isl_pw_aff_list_free(list2
);
3077 isl_pw_aff_list_free(list1
);
3078 isl_pw_aff_list_free(list2
);
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 equal to each element in list2.
3086 __isl_give isl_set
*isl_pw_aff_list_eq_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_eq_set
);
3092 __isl_give isl_set
*isl_pw_aff_list_ne_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_ne_set
);
3098 /* Return a set containing those elements in the shared domain
3099 * of the elements of list1 and list2 where each element in list1
3100 * is less than or equal to each element in list2.
3102 __isl_give isl_set
*isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list
*list1
,
3103 __isl_take isl_pw_aff_list
*list2
)
3105 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_le_set
);
3108 __isl_give isl_set
*isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list
*list1
,
3109 __isl_take isl_pw_aff_list
*list2
)
3111 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_lt_set
);
3114 __isl_give isl_set
*isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list
*list1
,
3115 __isl_take isl_pw_aff_list
*list2
)
3117 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ge_set
);
3120 __isl_give isl_set
*isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list
*list1
,
3121 __isl_take isl_pw_aff_list
*list2
)
3123 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_gt_set
);
3127 /* Return a set containing those elements in the shared domain
3128 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
3130 static __isl_give isl_set
*pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3131 __isl_take isl_pw_aff
*pwaff2
)
3133 isl_set
*set_lt
, *set_gt
;
3135 set_lt
= isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1
),
3136 isl_pw_aff_copy(pwaff2
));
3137 set_gt
= isl_pw_aff_gt_set(pwaff1
, pwaff2
);
3138 return isl_set_union_disjoint(set_lt
, set_gt
);
3141 __isl_give isl_set
*isl_pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
3142 __isl_take isl_pw_aff
*pwaff2
)
3144 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ne_set
);
3147 __isl_give isl_pw_aff
*isl_pw_aff_scale_down(__isl_take isl_pw_aff
*pwaff
,
3152 if (isl_int_is_one(v
))
3154 if (!isl_int_is_pos(v
))
3155 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
3156 "factor needs to be positive",
3157 return isl_pw_aff_free(pwaff
));
3158 pwaff
= isl_pw_aff_cow(pwaff
);
3164 for (i
= 0; i
< pwaff
->n
; ++i
) {
3165 pwaff
->p
[i
].aff
= isl_aff_scale_down(pwaff
->p
[i
].aff
, v
);
3166 if (!pwaff
->p
[i
].aff
)
3167 return isl_pw_aff_free(pwaff
);
3173 __isl_give isl_pw_aff
*isl_pw_aff_floor(__isl_take isl_pw_aff
*pwaff
)
3177 pwaff
= isl_pw_aff_cow(pwaff
);
3183 for (i
= 0; i
< pwaff
->n
; ++i
) {
3184 pwaff
->p
[i
].aff
= isl_aff_floor(pwaff
->p
[i
].aff
);
3185 if (!pwaff
->p
[i
].aff
)
3186 return isl_pw_aff_free(pwaff
);
3192 __isl_give isl_pw_aff
*isl_pw_aff_ceil(__isl_take isl_pw_aff
*pwaff
)
3196 pwaff
= isl_pw_aff_cow(pwaff
);
3202 for (i
= 0; i
< pwaff
->n
; ++i
) {
3203 pwaff
->p
[i
].aff
= isl_aff_ceil(pwaff
->p
[i
].aff
);
3204 if (!pwaff
->p
[i
].aff
)
3205 return isl_pw_aff_free(pwaff
);
3211 /* Assuming that "cond1" and "cond2" are disjoint,
3212 * return an affine expression that is equal to pwaff1 on cond1
3213 * and to pwaff2 on cond2.
3215 static __isl_give isl_pw_aff
*isl_pw_aff_select(
3216 __isl_take isl_set
*cond1
, __isl_take isl_pw_aff
*pwaff1
,
3217 __isl_take isl_set
*cond2
, __isl_take isl_pw_aff
*pwaff2
)
3219 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, cond1
);
3220 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, cond2
);
3222 return isl_pw_aff_add_disjoint(pwaff1
, pwaff2
);
3225 /* Return an affine expression that is equal to pwaff_true for elements
3226 * where "cond" is non-zero and to pwaff_false for elements where "cond"
3228 * That is, return cond ? pwaff_true : pwaff_false;
3230 * If "cond" involves and NaN, then we conservatively return a NaN
3231 * on its entire domain. In principle, we could consider the pieces
3232 * where it is NaN separately from those where it is not.
3234 * If "pwaff_true" and "pwaff_false" are obviously equal to each other,
3235 * then only use the domain of "cond" to restrict the domain.
3237 __isl_give isl_pw_aff
*isl_pw_aff_cond(__isl_take isl_pw_aff
*cond
,
3238 __isl_take isl_pw_aff
*pwaff_true
, __isl_take isl_pw_aff
*pwaff_false
)
3240 isl_set
*cond_true
, *cond_false
;
3245 if (isl_pw_aff_involves_nan(cond
)) {
3246 isl_space
*space
= isl_pw_aff_get_domain_space(cond
);
3247 isl_local_space
*ls
= isl_local_space_from_space(space
);
3248 isl_pw_aff_free(cond
);
3249 isl_pw_aff_free(pwaff_true
);
3250 isl_pw_aff_free(pwaff_false
);
3251 return isl_pw_aff_nan_on_domain(ls
);
3254 pwaff_true
= isl_pw_aff_align_params(pwaff_true
,
3255 isl_pw_aff_get_space(pwaff_false
));
3256 pwaff_false
= isl_pw_aff_align_params(pwaff_false
,
3257 isl_pw_aff_get_space(pwaff_true
));
3258 equal
= isl_pw_aff_plain_is_equal(pwaff_true
, pwaff_false
);
3264 dom
= isl_set_coalesce(isl_pw_aff_domain(cond
));
3265 isl_pw_aff_free(pwaff_false
);
3266 return isl_pw_aff_intersect_domain(pwaff_true
, dom
);
3269 cond_true
= isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond
));
3270 cond_false
= isl_pw_aff_zero_set(cond
);
3271 return isl_pw_aff_select(cond_true
, pwaff_true
,
3272 cond_false
, pwaff_false
);
3274 isl_pw_aff_free(cond
);
3275 isl_pw_aff_free(pwaff_true
);
3276 isl_pw_aff_free(pwaff_false
);
3280 isl_bool
isl_aff_is_cst(__isl_keep isl_aff
*aff
)
3283 return isl_bool_error
;
3285 return isl_seq_first_non_zero(aff
->v
->el
+ 2, aff
->v
->size
- 2) == -1;
3288 /* Check whether pwaff is a piecewise constant.
3290 isl_bool
isl_pw_aff_is_cst(__isl_keep isl_pw_aff
*pwaff
)
3295 return isl_bool_error
;
3297 for (i
= 0; i
< pwaff
->n
; ++i
) {
3298 isl_bool is_cst
= isl_aff_is_cst(pwaff
->p
[i
].aff
);
3299 if (is_cst
< 0 || !is_cst
)
3303 return isl_bool_true
;
3306 /* Are all elements of "mpa" piecewise constants?
3308 isl_bool
isl_multi_pw_aff_is_cst(__isl_keep isl_multi_pw_aff
*mpa
)
3313 return isl_bool_error
;
3315 for (i
= 0; i
< mpa
->n
; ++i
) {
3316 isl_bool is_cst
= isl_pw_aff_is_cst(mpa
->p
[i
]);
3317 if (is_cst
< 0 || !is_cst
)
3321 return isl_bool_true
;
3324 /* Return the product of "aff1" and "aff2".
3326 * If either of the two is NaN, then the result is NaN.
3328 * Otherwise, at least one of "aff1" or "aff2" needs to be a constant.
3330 __isl_give isl_aff
*isl_aff_mul(__isl_take isl_aff
*aff1
,
3331 __isl_take isl_aff
*aff2
)
3336 if (isl_aff_is_nan(aff1
)) {
3340 if (isl_aff_is_nan(aff2
)) {
3345 if (!isl_aff_is_cst(aff2
) && isl_aff_is_cst(aff1
))
3346 return isl_aff_mul(aff2
, aff1
);
3348 if (!isl_aff_is_cst(aff2
))
3349 isl_die(isl_aff_get_ctx(aff1
), isl_error_invalid
,
3350 "at least one affine expression should be constant",
3353 aff1
= isl_aff_cow(aff1
);
3357 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[1]);
3358 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[0]);
3368 /* Divide "aff1" by "aff2", assuming "aff2" is a constant.
3370 * If either of the two is NaN, then the result is NaN.
3372 __isl_give isl_aff
*isl_aff_div(__isl_take isl_aff
*aff1
,
3373 __isl_take isl_aff
*aff2
)
3381 if (isl_aff_is_nan(aff1
)) {
3385 if (isl_aff_is_nan(aff2
)) {
3390 is_cst
= isl_aff_is_cst(aff2
);
3394 isl_die(isl_aff_get_ctx(aff2
), isl_error_invalid
,
3395 "second argument should be a constant", goto error
);
3400 neg
= isl_int_is_neg(aff2
->v
->el
[1]);
3402 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3403 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3406 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[0]);
3407 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[1]);
3410 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
3411 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
3422 static __isl_give isl_pw_aff
*pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3423 __isl_take isl_pw_aff
*pwaff2
)
3425 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_add
);
3428 __isl_give isl_pw_aff
*isl_pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
3429 __isl_take isl_pw_aff
*pwaff2
)
3431 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_add
);
3434 __isl_give isl_pw_aff
*isl_pw_aff_union_add(__isl_take isl_pw_aff
*pwaff1
,
3435 __isl_take isl_pw_aff
*pwaff2
)
3437 return isl_pw_aff_union_add_(pwaff1
, pwaff2
);
3440 static __isl_give isl_pw_aff
*pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
3441 __isl_take isl_pw_aff
*pwaff2
)
3443 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_mul
);
3446 __isl_give isl_pw_aff
*isl_pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
3447 __isl_take isl_pw_aff
*pwaff2
)
3449 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_mul
);
3452 static __isl_give isl_pw_aff
*pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3453 __isl_take isl_pw_aff
*pa2
)
3455 return isl_pw_aff_on_shared_domain(pa1
, pa2
, &isl_aff_div
);
3458 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
3460 __isl_give isl_pw_aff
*isl_pw_aff_div(__isl_take isl_pw_aff
*pa1
,
3461 __isl_take isl_pw_aff
*pa2
)
3465 is_cst
= isl_pw_aff_is_cst(pa2
);
3469 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3470 "second argument should be a piecewise constant",
3472 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_div
);
3474 isl_pw_aff_free(pa1
);
3475 isl_pw_aff_free(pa2
);
3479 /* Compute the quotient of the integer division of "pa1" by "pa2"
3480 * with rounding towards zero.
3481 * "pa2" is assumed to be a piecewise constant.
3483 * In particular, return
3485 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
3488 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_q(__isl_take isl_pw_aff
*pa1
,
3489 __isl_take isl_pw_aff
*pa2
)
3495 is_cst
= isl_pw_aff_is_cst(pa2
);
3499 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3500 "second argument should be a piecewise constant",
3503 pa1
= isl_pw_aff_div(pa1
, pa2
);
3505 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1
));
3506 f
= isl_pw_aff_floor(isl_pw_aff_copy(pa1
));
3507 c
= isl_pw_aff_ceil(pa1
);
3508 return isl_pw_aff_cond(isl_set_indicator_function(cond
), f
, c
);
3510 isl_pw_aff_free(pa1
);
3511 isl_pw_aff_free(pa2
);
3515 /* Compute the remainder of the integer division of "pa1" by "pa2"
3516 * with rounding towards zero.
3517 * "pa2" is assumed to be a piecewise constant.
3519 * In particular, return
3521 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
3524 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_r(__isl_take isl_pw_aff
*pa1
,
3525 __isl_take isl_pw_aff
*pa2
)
3530 is_cst
= isl_pw_aff_is_cst(pa2
);
3534 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3535 "second argument should be a piecewise constant",
3537 res
= isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1
), isl_pw_aff_copy(pa2
));
3538 res
= isl_pw_aff_mul(pa2
, res
);
3539 res
= isl_pw_aff_sub(pa1
, res
);
3542 isl_pw_aff_free(pa1
);
3543 isl_pw_aff_free(pa2
);
3547 static __isl_give isl_pw_aff
*pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3548 __isl_take isl_pw_aff
*pwaff2
)
3553 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3554 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3555 le
= isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1
),
3556 isl_pw_aff_copy(pwaff2
));
3557 dom
= isl_set_subtract(dom
, isl_set_copy(le
));
3558 return isl_pw_aff_select(le
, pwaff1
, dom
, pwaff2
);
3561 __isl_give isl_pw_aff
*isl_pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3562 __isl_take isl_pw_aff
*pwaff2
)
3564 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_min
);
3567 static __isl_give isl_pw_aff
*pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3568 __isl_take isl_pw_aff
*pwaff2
)
3573 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3574 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3575 ge
= isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1
),
3576 isl_pw_aff_copy(pwaff2
));
3577 dom
= isl_set_subtract(dom
, isl_set_copy(ge
));
3578 return isl_pw_aff_select(ge
, pwaff1
, dom
, pwaff2
);
3581 __isl_give isl_pw_aff
*isl_pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3582 __isl_take isl_pw_aff
*pwaff2
)
3584 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_max
);
3587 static __isl_give isl_pw_aff
*pw_aff_list_reduce(
3588 __isl_take isl_pw_aff_list
*list
,
3589 __isl_give isl_pw_aff
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3590 __isl_take isl_pw_aff
*pwaff2
))
3599 ctx
= isl_pw_aff_list_get_ctx(list
);
3601 isl_die(ctx
, isl_error_invalid
,
3602 "list should contain at least one element", goto error
);
3604 res
= isl_pw_aff_copy(list
->p
[0]);
3605 for (i
= 1; i
< list
->n
; ++i
)
3606 res
= fn(res
, isl_pw_aff_copy(list
->p
[i
]));
3608 isl_pw_aff_list_free(list
);
3611 isl_pw_aff_list_free(list
);
3615 /* Return an isl_pw_aff that maps each element in the intersection of the
3616 * domains of the elements of list to the minimal corresponding affine
3619 __isl_give isl_pw_aff
*isl_pw_aff_list_min(__isl_take isl_pw_aff_list
*list
)
3621 return pw_aff_list_reduce(list
, &isl_pw_aff_min
);
3624 /* Return an isl_pw_aff that maps each element in the intersection of the
3625 * domains of the elements of list to the maximal corresponding affine
3628 __isl_give isl_pw_aff
*isl_pw_aff_list_max(__isl_take isl_pw_aff_list
*list
)
3630 return pw_aff_list_reduce(list
, &isl_pw_aff_max
);
3633 /* Mark the domains of "pwaff" as rational.
3635 __isl_give isl_pw_aff
*isl_pw_aff_set_rational(__isl_take isl_pw_aff
*pwaff
)
3639 pwaff
= isl_pw_aff_cow(pwaff
);
3645 for (i
= 0; i
< pwaff
->n
; ++i
) {
3646 pwaff
->p
[i
].set
= isl_set_set_rational(pwaff
->p
[i
].set
);
3647 if (!pwaff
->p
[i
].set
)
3648 return isl_pw_aff_free(pwaff
);
3654 /* Mark the domains of the elements of "list" as rational.
3656 __isl_give isl_pw_aff_list
*isl_pw_aff_list_set_rational(
3657 __isl_take isl_pw_aff_list
*list
)
3667 for (i
= 0; i
< n
; ++i
) {
3670 pa
= isl_pw_aff_list_get_pw_aff(list
, i
);
3671 pa
= isl_pw_aff_set_rational(pa
);
3672 list
= isl_pw_aff_list_set_pw_aff(list
, i
, pa
);
3678 /* Do the parameters of "aff" match those of "space"?
3680 int isl_aff_matching_params(__isl_keep isl_aff
*aff
,
3681 __isl_keep isl_space
*space
)
3683 isl_space
*aff_space
;
3689 aff_space
= isl_aff_get_domain_space(aff
);
3691 match
= isl_space_match(space
, isl_dim_param
, aff_space
, isl_dim_param
);
3693 isl_space_free(aff_space
);
3697 /* Check that the domain space of "aff" matches "space".
3699 * Return 0 on success and -1 on error.
3701 int isl_aff_check_match_domain_space(__isl_keep isl_aff
*aff
,
3702 __isl_keep isl_space
*space
)
3704 isl_space
*aff_space
;
3710 aff_space
= isl_aff_get_domain_space(aff
);
3712 match
= isl_space_match(space
, isl_dim_param
, aff_space
, isl_dim_param
);
3716 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3717 "parameters don't match", goto error
);
3718 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
3719 aff_space
, isl_dim_set
);
3723 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3724 "domains don't match", goto error
);
3725 isl_space_free(aff_space
);
3728 isl_space_free(aff_space
);
3738 #include <isl_multi_templ.c>
3739 #include <isl_multi_apply_set.c>
3740 #include <isl_multi_cmp.c>
3741 #include <isl_multi_floor.c>
3742 #include <isl_multi_gist.c>
3746 /* Remove any internal structure of the domain of "ma".
3747 * If there is any such internal structure in the input,
3748 * then the name of the corresponding space is also removed.
3750 __isl_give isl_multi_aff
*isl_multi_aff_flatten_domain(
3751 __isl_take isl_multi_aff
*ma
)
3758 if (!ma
->space
->nested
[0])
3761 space
= isl_multi_aff_get_space(ma
);
3762 space
= isl_space_flatten_domain(space
);
3763 ma
= isl_multi_aff_reset_space(ma
, space
);
3768 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3769 * of the space to its domain.
3771 __isl_give isl_multi_aff
*isl_multi_aff_domain_map(__isl_take isl_space
*space
)
3774 isl_local_space
*ls
;
3779 if (!isl_space_is_map(space
))
3780 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3781 "not a map space", goto error
);
3783 n_in
= isl_space_dim(space
, isl_dim_in
);
3784 space
= isl_space_domain_map(space
);
3786 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3788 isl_space_free(space
);
3792 space
= isl_space_domain(space
);
3793 ls
= isl_local_space_from_space(space
);
3794 for (i
= 0; i
< n_in
; ++i
) {
3797 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3799 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3801 isl_local_space_free(ls
);
3804 isl_space_free(space
);
3808 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3809 * of the space to its range.
3811 __isl_give isl_multi_aff
*isl_multi_aff_range_map(__isl_take isl_space
*space
)
3814 isl_local_space
*ls
;
3819 if (!isl_space_is_map(space
))
3820 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3821 "not a map space", goto error
);
3823 n_in
= isl_space_dim(space
, isl_dim_in
);
3824 n_out
= isl_space_dim(space
, isl_dim_out
);
3825 space
= isl_space_range_map(space
);
3827 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3829 isl_space_free(space
);
3833 space
= isl_space_domain(space
);
3834 ls
= isl_local_space_from_space(space
);
3835 for (i
= 0; i
< n_out
; ++i
) {
3838 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3839 isl_dim_set
, n_in
+ i
);
3840 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3842 isl_local_space_free(ls
);
3845 isl_space_free(space
);
3849 /* Given a map space, return an isl_pw_multi_aff that maps a wrapped copy
3850 * of the space to its range.
3852 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_map(
3853 __isl_take isl_space
*space
)
3855 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_range_map(space
));
3858 /* Given the space of a set and a range of set dimensions,
3859 * construct an isl_multi_aff that projects out those dimensions.
3861 __isl_give isl_multi_aff
*isl_multi_aff_project_out_map(
3862 __isl_take isl_space
*space
, enum isl_dim_type type
,
3863 unsigned first
, unsigned n
)
3866 isl_local_space
*ls
;
3871 if (!isl_space_is_set(space
))
3872 isl_die(isl_space_get_ctx(space
), isl_error_unsupported
,
3873 "expecting set space", goto error
);
3874 if (type
!= isl_dim_set
)
3875 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3876 "only set dimensions can be projected out", goto error
);
3878 dim
= isl_space_dim(space
, isl_dim_set
);
3879 if (first
+ n
> dim
)
3880 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3881 "range out of bounds", goto error
);
3883 space
= isl_space_from_domain(space
);
3884 space
= isl_space_add_dims(space
, isl_dim_out
, dim
- n
);
3887 return isl_multi_aff_alloc(space
);
3889 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3890 space
= isl_space_domain(space
);
3891 ls
= isl_local_space_from_space(space
);
3893 for (i
= 0; i
< first
; ++i
) {
3896 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3898 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3901 for (i
= 0; i
< dim
- (first
+ n
); ++i
) {
3904 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3905 isl_dim_set
, first
+ n
+ i
);
3906 ma
= isl_multi_aff_set_aff(ma
, first
+ i
, aff
);
3909 isl_local_space_free(ls
);
3912 isl_space_free(space
);
3916 /* Given the space of a set and a range of set dimensions,
3917 * construct an isl_pw_multi_aff that projects out those dimensions.
3919 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_project_out_map(
3920 __isl_take isl_space
*space
, enum isl_dim_type type
,
3921 unsigned first
, unsigned n
)
3925 ma
= isl_multi_aff_project_out_map(space
, type
, first
, n
);
3926 return isl_pw_multi_aff_from_multi_aff(ma
);
3929 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
3932 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_aff(
3933 __isl_take isl_multi_aff
*ma
)
3935 isl_set
*dom
= isl_set_universe(isl_multi_aff_get_domain_space(ma
));
3936 return isl_pw_multi_aff_alloc(dom
, ma
);
3939 /* Create a piecewise multi-affine expression in the given space that maps each
3940 * input dimension to the corresponding output dimension.
3942 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_identity(
3943 __isl_take isl_space
*space
)
3945 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space
));
3948 /* Exploit the equalities in "eq" to simplify the affine expressions.
3950 static __isl_give isl_multi_aff
*isl_multi_aff_substitute_equalities(
3951 __isl_take isl_multi_aff
*maff
, __isl_take isl_basic_set
*eq
)
3955 maff
= isl_multi_aff_cow(maff
);
3959 for (i
= 0; i
< maff
->n
; ++i
) {
3960 maff
->p
[i
] = isl_aff_substitute_equalities(maff
->p
[i
],
3961 isl_basic_set_copy(eq
));
3966 isl_basic_set_free(eq
);
3969 isl_basic_set_free(eq
);
3970 isl_multi_aff_free(maff
);
3974 __isl_give isl_multi_aff
*isl_multi_aff_scale(__isl_take isl_multi_aff
*maff
,
3979 maff
= isl_multi_aff_cow(maff
);
3983 for (i
= 0; i
< maff
->n
; ++i
) {
3984 maff
->p
[i
] = isl_aff_scale(maff
->p
[i
], f
);
3986 return isl_multi_aff_free(maff
);
3992 __isl_give isl_multi_aff
*isl_multi_aff_add_on_domain(__isl_keep isl_set
*dom
,
3993 __isl_take isl_multi_aff
*maff1
, __isl_take isl_multi_aff
*maff2
)
3995 maff1
= isl_multi_aff_add(maff1
, maff2
);
3996 maff1
= isl_multi_aff_gist(maff1
, isl_set_copy(dom
));
4000 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff
*maff
)
4008 /* Return the set of domain elements where "ma1" is lexicographically
4009 * smaller than or equal to "ma2".
4011 __isl_give isl_set
*isl_multi_aff_lex_le_set(__isl_take isl_multi_aff
*ma1
,
4012 __isl_take isl_multi_aff
*ma2
)
4014 return isl_multi_aff_lex_ge_set(ma2
, ma1
);
4017 /* Return the set of domain elements where "ma1" is lexicographically
4018 * smaller than "ma2".
4020 __isl_give isl_set
*isl_multi_aff_lex_lt_set(__isl_take isl_multi_aff
*ma1
,
4021 __isl_take isl_multi_aff
*ma2
)
4023 return isl_multi_aff_lex_gt_set(ma2
, ma1
);
4026 /* Return the set of domain elements where "ma1" and "ma2"
4029 static __isl_give isl_set
*isl_multi_aff_order_set(
4030 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
,
4031 __isl_give isl_map
*order(__isl_take isl_space
*set_space
))
4034 isl_map
*map1
, *map2
;
4037 map1
= isl_map_from_multi_aff(ma1
);
4038 map2
= isl_map_from_multi_aff(ma2
);
4039 map
= isl_map_range_product(map1
, map2
);
4040 space
= isl_space_range(isl_map_get_space(map
));
4041 space
= isl_space_domain(isl_space_unwrap(space
));
4043 map
= isl_map_intersect_range(map
, isl_map_wrap(ge
));
4045 return isl_map_domain(map
);
4048 /* Return the set of domain elements where "ma1" is lexicographically
4049 * greater than or equal to "ma2".
4051 __isl_give isl_set
*isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff
*ma1
,
4052 __isl_take isl_multi_aff
*ma2
)
4054 return isl_multi_aff_order_set(ma1
, ma2
, &isl_map_lex_ge
);
4057 /* Return the set of domain elements where "ma1" is lexicographically
4058 * greater than "ma2".
4060 __isl_give isl_set
*isl_multi_aff_lex_gt_set(__isl_take isl_multi_aff
*ma1
,
4061 __isl_take isl_multi_aff
*ma2
)
4063 return isl_multi_aff_order_set(ma1
, ma2
, &isl_map_lex_gt
);
4067 #define PW isl_pw_multi_aff
4069 #define EL isl_multi_aff
4071 #define EL_IS_ZERO is_empty
4075 #define IS_ZERO is_empty
4078 #undef DEFAULT_IS_ZERO
4079 #define DEFAULT_IS_ZERO 0
4084 #define NO_INVOLVES_DIMS
4085 #define NO_INSERT_DIMS
4089 #include <isl_pw_templ.c>
4090 #include <isl_pw_union_opt.c>
4095 #define UNION isl_union_pw_multi_aff
4097 #define PART isl_pw_multi_aff
4099 #define PARTS pw_multi_aff
4101 #include <isl_union_multi.c>
4102 #include <isl_union_neg.c>
4104 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmax(
4105 __isl_take isl_pw_multi_aff
*pma1
,
4106 __isl_take isl_pw_multi_aff
*pma2
)
4108 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4109 &isl_multi_aff_lex_ge_set
);
4112 /* Given two piecewise multi affine expressions, return a piecewise
4113 * multi-affine expression defined on the union of the definition domains
4114 * of the inputs that is equal to the lexicographic maximum of the two
4115 * inputs on each cell. If only one of the two inputs is defined on
4116 * a given cell, then it is considered to be the maximum.
4118 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmax(
4119 __isl_take isl_pw_multi_aff
*pma1
,
4120 __isl_take isl_pw_multi_aff
*pma2
)
4122 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4123 &pw_multi_aff_union_lexmax
);
4126 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmin(
4127 __isl_take isl_pw_multi_aff
*pma1
,
4128 __isl_take isl_pw_multi_aff
*pma2
)
4130 return isl_pw_multi_aff_union_opt_cmp(pma1
, pma2
,
4131 &isl_multi_aff_lex_le_set
);
4134 /* Given two piecewise multi affine expressions, return a piecewise
4135 * multi-affine expression defined on the union of the definition domains
4136 * of the inputs that is equal to the lexicographic minimum of the two
4137 * inputs on each cell. If only one of the two inputs is defined on
4138 * a given cell, then it is considered to be the minimum.
4140 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmin(
4141 __isl_take isl_pw_multi_aff
*pma1
,
4142 __isl_take isl_pw_multi_aff
*pma2
)
4144 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4145 &pw_multi_aff_union_lexmin
);
4148 static __isl_give isl_pw_multi_aff
*pw_multi_aff_add(
4149 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4151 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4152 &isl_multi_aff_add
);
4155 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_add(
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 static __isl_give isl_pw_multi_aff
*pw_multi_aff_sub(
4163 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4165 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
4166 &isl_multi_aff_sub
);
4169 /* Subtract "pma2" from "pma1" and return the result.
4171 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_sub(
4172 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4174 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4178 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_add(
4179 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4181 return isl_pw_multi_aff_union_add_(pma1
, pma2
);
4184 /* Compute the sum of "upa1" and "upa2" on the union of their domains,
4185 * with the actual sum on the shared domain and
4186 * the defined expression on the symmetric difference of the domains.
4188 __isl_give isl_union_pw_aff
*isl_union_pw_aff_union_add(
4189 __isl_take isl_union_pw_aff
*upa1
, __isl_take isl_union_pw_aff
*upa2
)
4191 return isl_union_pw_aff_union_add_(upa1
, upa2
);
4194 /* Compute the sum of "upma1" and "upma2" on the union of their domains,
4195 * with the actual sum on the shared domain and
4196 * the defined expression on the symmetric difference of the domains.
4198 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_union_add(
4199 __isl_take isl_union_pw_multi_aff
*upma1
,
4200 __isl_take isl_union_pw_multi_aff
*upma2
)
4202 return isl_union_pw_multi_aff_union_add_(upma1
, upma2
);
4205 /* Given two piecewise multi-affine expressions A -> B and C -> D,
4206 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
4208 static __isl_give isl_pw_multi_aff
*pw_multi_aff_product(
4209 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4213 isl_pw_multi_aff
*res
;
4218 n
= pma1
->n
* pma2
->n
;
4219 space
= isl_space_product(isl_space_copy(pma1
->dim
),
4220 isl_space_copy(pma2
->dim
));
4221 res
= isl_pw_multi_aff_alloc_size(space
, n
);
4223 for (i
= 0; i
< pma1
->n
; ++i
) {
4224 for (j
= 0; j
< pma2
->n
; ++j
) {
4228 domain
= isl_set_product(isl_set_copy(pma1
->p
[i
].set
),
4229 isl_set_copy(pma2
->p
[j
].set
));
4230 ma
= isl_multi_aff_product(
4231 isl_multi_aff_copy(pma1
->p
[i
].maff
),
4232 isl_multi_aff_copy(pma2
->p
[j
].maff
));
4233 res
= isl_pw_multi_aff_add_piece(res
, domain
, ma
);
4237 isl_pw_multi_aff_free(pma1
);
4238 isl_pw_multi_aff_free(pma2
);
4241 isl_pw_multi_aff_free(pma1
);
4242 isl_pw_multi_aff_free(pma2
);
4246 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_product(
4247 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
4249 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
4250 &pw_multi_aff_product
);
4253 /* Construct a map mapping the domain of the piecewise multi-affine expression
4254 * to its range, with each dimension in the range equated to the
4255 * corresponding affine expression on its cell.
4257 __isl_give isl_map
*isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
4265 map
= isl_map_empty(isl_pw_multi_aff_get_space(pma
));
4267 for (i
= 0; i
< pma
->n
; ++i
) {
4268 isl_multi_aff
*maff
;
4269 isl_basic_map
*bmap
;
4272 maff
= isl_multi_aff_copy(pma
->p
[i
].maff
);
4273 bmap
= isl_basic_map_from_multi_aff(maff
);
4274 map_i
= isl_map_from_basic_map(bmap
);
4275 map_i
= isl_map_intersect_domain(map_i
,
4276 isl_set_copy(pma
->p
[i
].set
));
4277 map
= isl_map_union_disjoint(map
, map_i
);
4280 isl_pw_multi_aff_free(pma
);
4284 __isl_give isl_set
*isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
4289 if (!isl_space_is_set(pma
->dim
))
4290 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
4291 "isl_pw_multi_aff cannot be converted into an isl_set",
4294 return isl_map_from_pw_multi_aff(pma
);
4296 isl_pw_multi_aff_free(pma
);
4300 /* Subtract the initial "n" elements in "ma" with coefficients in "c" and
4301 * denominator "denom".
4302 * "denom" is allowed to be negative, in which case the actual denominator
4303 * is -denom and the expressions are added instead.
4305 static __isl_give isl_aff
*subtract_initial(__isl_take isl_aff
*aff
,
4306 __isl_keep isl_multi_aff
*ma
, int n
, isl_int
*c
, isl_int denom
)
4312 first
= isl_seq_first_non_zero(c
, n
);
4316 sign
= isl_int_sgn(denom
);
4318 isl_int_abs(d
, denom
);
4319 for (i
= first
; i
< n
; ++i
) {
4322 if (isl_int_is_zero(c
[i
]))
4324 aff_i
= isl_multi_aff_get_aff(ma
, i
);
4325 aff_i
= isl_aff_scale(aff_i
, c
[i
]);
4326 aff_i
= isl_aff_scale_down(aff_i
, d
);
4328 aff
= isl_aff_sub(aff
, aff_i
);
4330 aff
= isl_aff_add(aff
, aff_i
);
4337 /* Extract an affine expression that expresses the output dimension "pos"
4338 * of "bmap" in terms of the parameters and input dimensions from
4340 * Note that this expression may involve integer divisions defined
4341 * in terms of parameters and input dimensions.
4342 * The equality may also involve references to earlier (but not later)
4343 * output dimensions. These are replaced by the corresponding elements
4346 * If the equality is of the form
4348 * f(i) + h(j) + a x + g(i) = 0,
4350 * with f(i) a linear combinations of the parameters and input dimensions,
4351 * g(i) a linear combination of integer divisions defined in terms of the same
4352 * and h(j) a linear combinations of earlier output dimensions,
4353 * then the affine expression is
4355 * (-f(i) - g(i))/a - h(j)/a
4357 * If the equality is of the form
4359 * f(i) + h(j) - a x + g(i) = 0,
4361 * then the affine expression is
4363 * (f(i) + g(i))/a - h(j)/(-a)
4366 * If "div" refers to an integer division (i.e., it is smaller than
4367 * the number of integer divisions), then the equality constraint
4368 * does involve an integer division (the one at position "div") that
4369 * is defined in terms of output dimensions. However, this integer
4370 * division can be eliminated by exploiting a pair of constraints
4371 * x >= l and x <= l + n, with n smaller than the coefficient of "div"
4372 * in the equality constraint. "ineq" refers to inequality x >= l, i.e.,
4374 * In particular, let
4376 * x = e(i) + m floor(...)
4378 * with e(i) the expression derived above and floor(...) the integer
4379 * division involving output dimensions.
4390 * e(i) + m floor(...) - l = (e(i) + m floor(...) - l) mod m
4391 * = (e(i) - l) mod m
4395 * x - l = (e(i) - l) mod m
4399 * x = ((e(i) - l) mod m) + l
4401 * The variable "shift" below contains the expression -l, which may
4402 * also involve a linear combination of earlier output dimensions.
4404 static __isl_give isl_aff
*extract_aff_from_equality(
4405 __isl_keep isl_basic_map
*bmap
, int pos
, int eq
, int div
, int ineq
,
4406 __isl_keep isl_multi_aff
*ma
)
4409 unsigned n_div
, n_out
;
4411 isl_local_space
*ls
;
4412 isl_aff
*aff
, *shift
;
4415 ctx
= isl_basic_map_get_ctx(bmap
);
4416 ls
= isl_basic_map_get_local_space(bmap
);
4417 ls
= isl_local_space_domain(ls
);
4418 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
4421 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
4422 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4423 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4424 if (isl_int_is_neg(bmap
->eq
[eq
][o_out
+ pos
])) {
4425 isl_seq_cpy(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4426 isl_seq_cpy(aff
->v
->el
+ 1 + o_out
,
4427 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4429 isl_seq_neg(aff
->v
->el
+ 1, bmap
->eq
[eq
], o_out
);
4430 isl_seq_neg(aff
->v
->el
+ 1 + o_out
,
4431 bmap
->eq
[eq
] + o_out
+ n_out
, n_div
);
4434 isl_int_set_si(aff
->v
->el
[1 + o_out
+ div
], 0);
4435 isl_int_abs(aff
->v
->el
[0], bmap
->eq
[eq
][o_out
+ pos
]);
4436 aff
= subtract_initial(aff
, ma
, pos
, bmap
->eq
[eq
] + o_out
,
4437 bmap
->eq
[eq
][o_out
+ pos
]);
4439 shift
= isl_aff_alloc(isl_local_space_copy(ls
));
4442 isl_seq_cpy(shift
->v
->el
+ 1, bmap
->ineq
[ineq
], o_out
);
4443 isl_seq_cpy(shift
->v
->el
+ 1 + o_out
,
4444 bmap
->ineq
[ineq
] + o_out
+ n_out
, n_div
);
4445 isl_int_set_si(shift
->v
->el
[0], 1);
4446 shift
= subtract_initial(shift
, ma
, pos
,
4447 bmap
->ineq
[ineq
] + o_out
, ctx
->negone
);
4448 aff
= isl_aff_add(aff
, isl_aff_copy(shift
));
4449 mod
= isl_val_int_from_isl_int(ctx
,
4450 bmap
->eq
[eq
][o_out
+ n_out
+ div
]);
4451 mod
= isl_val_abs(mod
);
4452 aff
= isl_aff_mod_val(aff
, mod
);
4453 aff
= isl_aff_sub(aff
, shift
);
4456 isl_local_space_free(ls
);
4459 isl_local_space_free(ls
);
4464 /* Given a basic map with output dimensions defined
4465 * in terms of the parameters input dimensions and earlier
4466 * output dimensions using an equality (and possibly a pair on inequalities),
4467 * extract an isl_aff that expresses output dimension "pos" in terms
4468 * of the parameters and input dimensions.
4469 * Note that this expression may involve integer divisions defined
4470 * in terms of parameters and input dimensions.
4471 * "ma" contains the expressions corresponding to earlier output dimensions.
4473 * This function shares some similarities with
4474 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
4476 static __isl_give isl_aff
*extract_isl_aff_from_basic_map(
4477 __isl_keep isl_basic_map
*bmap
, int pos
, __isl_keep isl_multi_aff
*ma
)
4484 eq
= isl_basic_map_output_defining_equality(bmap
, pos
, &div
, &ineq
);
4485 if (eq
>= bmap
->n_eq
)
4486 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4487 "unable to find suitable equality", return NULL
);
4488 aff
= extract_aff_from_equality(bmap
, pos
, eq
, div
, ineq
, ma
);
4490 aff
= isl_aff_remove_unused_divs(aff
);
4494 /* Given a basic map where each output dimension is defined
4495 * in terms of the parameters and input dimensions using an equality,
4496 * extract an isl_multi_aff that expresses the output dimensions in terms
4497 * of the parameters and input dimensions.
4499 static __isl_give isl_multi_aff
*extract_isl_multi_aff_from_basic_map(
4500 __isl_take isl_basic_map
*bmap
)
4509 ma
= isl_multi_aff_alloc(isl_basic_map_get_space(bmap
));
4510 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4512 for (i
= 0; i
< n_out
; ++i
) {
4515 aff
= extract_isl_aff_from_basic_map(bmap
, i
, ma
);
4516 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4519 isl_basic_map_free(bmap
);
4524 /* Given a basic set where each set dimension is defined
4525 * in terms of the parameters using an equality,
4526 * extract an isl_multi_aff that expresses the set dimensions in terms
4527 * of the parameters.
4529 __isl_give isl_multi_aff
*isl_multi_aff_from_basic_set_equalities(
4530 __isl_take isl_basic_set
*bset
)
4532 return extract_isl_multi_aff_from_basic_map(bset
);
4535 /* Create an isl_pw_multi_aff that is equivalent to
4536 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
4537 * The given basic map is such that each output dimension is defined
4538 * in terms of the parameters and input dimensions using an equality.
4540 * Since some applications expect the result of isl_pw_multi_aff_from_map
4541 * to only contain integer affine expressions, we compute the floor
4542 * of the expression before returning.
4544 * Remove all constraints involving local variables without
4545 * an explicit representation (resulting in the removal of those
4546 * local variables) prior to the actual extraction to ensure
4547 * that the local spaces in which the resulting affine expressions
4548 * are created do not contain any unknown local variables.
4549 * Removing such constraints is safe because constraints involving
4550 * unknown local variables are not used to determine whether
4551 * a basic map is obviously single-valued.
4553 static __isl_give isl_pw_multi_aff
*plain_pw_multi_aff_from_map(
4554 __isl_take isl_set
*domain
, __isl_take isl_basic_map
*bmap
)
4558 bmap
= isl_basic_map_drop_constraint_involving_unknown_divs(bmap
);
4559 ma
= extract_isl_multi_aff_from_basic_map(bmap
);
4560 ma
= isl_multi_aff_floor(ma
);
4561 return isl_pw_multi_aff_alloc(domain
, ma
);
4564 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4565 * This obviously only works if the input "map" is single-valued.
4566 * If so, we compute the lexicographic minimum of the image in the form
4567 * of an isl_pw_multi_aff. Since the image is unique, it is equal
4568 * to its lexicographic minimum.
4569 * If the input is not single-valued, we produce an error.
4571 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_base(
4572 __isl_take isl_map
*map
)
4576 isl_pw_multi_aff
*pma
;
4578 sv
= isl_map_is_single_valued(map
);
4582 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
4583 "map is not single-valued", goto error
);
4584 map
= isl_map_make_disjoint(map
);
4588 pma
= isl_pw_multi_aff_empty(isl_map_get_space(map
));
4590 for (i
= 0; i
< map
->n
; ++i
) {
4591 isl_pw_multi_aff
*pma_i
;
4592 isl_basic_map
*bmap
;
4593 bmap
= isl_basic_map_copy(map
->p
[i
]);
4594 pma_i
= isl_basic_map_lexmin_pw_multi_aff(bmap
);
4595 pma
= isl_pw_multi_aff_add_disjoint(pma
, pma_i
);
4605 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4606 * taking into account that the output dimension at position "d"
4607 * can be represented as
4609 * x = floor((e(...) + c1) / m)
4611 * given that constraint "i" is of the form
4613 * e(...) + c1 - m x >= 0
4616 * Let "map" be of the form
4620 * We construct a mapping
4622 * A -> [A -> x = floor(...)]
4624 * apply that to the map, obtaining
4626 * [A -> x = floor(...)] -> B
4628 * and equate dimension "d" to x.
4629 * We then compute a isl_pw_multi_aff representation of the resulting map
4630 * and plug in the mapping above.
4632 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_div(
4633 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
)
4637 isl_local_space
*ls
;
4645 isl_pw_multi_aff
*pma
;
4648 is_set
= isl_map_is_set(map
);
4650 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4651 ctx
= isl_map_get_ctx(map
);
4652 space
= isl_space_domain(isl_map_get_space(map
));
4653 n_in
= isl_space_dim(space
, isl_dim_set
);
4654 n
= isl_space_dim(space
, isl_dim_all
);
4656 v
= isl_vec_alloc(ctx
, 1 + 1 + n
);
4658 isl_int_neg(v
->el
[0], hull
->ineq
[i
][offset
+ d
]);
4659 isl_seq_cpy(v
->el
+ 1, hull
->ineq
[i
], 1 + n
);
4661 isl_basic_map_free(hull
);
4663 ls
= isl_local_space_from_space(isl_space_copy(space
));
4664 aff
= isl_aff_alloc_vec(ls
, v
);
4665 aff
= isl_aff_floor(aff
);
4667 isl_space_free(space
);
4668 ma
= isl_multi_aff_from_aff(aff
);
4670 ma
= isl_multi_aff_identity(isl_space_map_from_set(space
));
4671 ma
= isl_multi_aff_range_product(ma
,
4672 isl_multi_aff_from_aff(aff
));
4675 insert
= isl_map_from_multi_aff(isl_multi_aff_copy(ma
));
4676 map
= isl_map_apply_domain(map
, insert
);
4677 map
= isl_map_equate(map
, isl_dim_in
, n_in
, isl_dim_out
, d
);
4678 pma
= isl_pw_multi_aff_from_map(map
);
4679 pma
= isl_pw_multi_aff_pullback_multi_aff(pma
, ma
);
4684 /* Is constraint "c" of the form
4686 * e(...) + c1 - m x >= 0
4690 * -e(...) + c2 + m x >= 0
4692 * where m > 1 and e only depends on parameters and input dimemnsions?
4694 * "offset" is the offset of the output dimensions
4695 * "pos" is the position of output dimension x.
4697 static int is_potential_div_constraint(isl_int
*c
, int offset
, int d
, int total
)
4699 if (isl_int_is_zero(c
[offset
+ d
]))
4701 if (isl_int_is_one(c
[offset
+ d
]))
4703 if (isl_int_is_negone(c
[offset
+ d
]))
4705 if (isl_seq_first_non_zero(c
+ offset
, d
) != -1)
4707 if (isl_seq_first_non_zero(c
+ offset
+ d
+ 1,
4708 total
- (offset
+ d
+ 1)) != -1)
4713 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4715 * As a special case, we first check if there is any pair of constraints,
4716 * shared by all the basic maps in "map" that force a given dimension
4717 * to be equal to the floor of some affine combination of the input dimensions.
4719 * In particular, if we can find two constraints
4721 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
4725 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
4727 * where m > 1 and e only depends on parameters and input dimemnsions,
4730 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
4732 * then we know that we can take
4734 * x = floor((e(...) + c1) / m)
4736 * without having to perform any computation.
4738 * Note that we know that
4742 * If c1 + c2 were 0, then we would have detected an equality during
4743 * simplification. If c1 + c2 were negative, then we would have detected
4746 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_div(
4747 __isl_take isl_map
*map
)
4753 isl_basic_map
*hull
;
4755 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
4760 dim
= isl_map_dim(map
, isl_dim_out
);
4761 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4762 total
= 1 + isl_basic_map_total_dim(hull
);
4764 for (d
= 0; d
< dim
; ++d
) {
4765 for (i
= 0; i
< n
; ++i
) {
4766 if (!is_potential_div_constraint(hull
->ineq
[i
],
4769 for (j
= i
+ 1; j
< n
; ++j
) {
4770 if (!isl_seq_is_neg(hull
->ineq
[i
] + 1,
4771 hull
->ineq
[j
] + 1, total
- 1))
4773 isl_int_add(sum
, hull
->ineq
[i
][0],
4775 if (isl_int_abs_lt(sum
,
4776 hull
->ineq
[i
][offset
+ d
]))
4783 if (isl_int_is_pos(hull
->ineq
[j
][offset
+ d
]))
4785 return pw_multi_aff_from_map_div(map
, hull
, d
, j
);
4789 isl_basic_map_free(hull
);
4790 return pw_multi_aff_from_map_base(map
);
4793 isl_basic_map_free(hull
);
4797 /* Given an affine expression
4799 * [A -> B] -> f(A,B)
4801 * construct an isl_multi_aff
4805 * such that dimension "d" in B' is set to "aff" and the remaining
4806 * dimensions are set equal to the corresponding dimensions in B.
4807 * "n_in" is the dimension of the space A.
4808 * "n_out" is the dimension of the space B.
4810 * If "is_set" is set, then the affine expression is of the form
4814 * and we construct an isl_multi_aff
4818 static __isl_give isl_multi_aff
*range_map(__isl_take isl_aff
*aff
, int d
,
4819 unsigned n_in
, unsigned n_out
, int is_set
)
4823 isl_space
*space
, *space2
;
4824 isl_local_space
*ls
;
4826 space
= isl_aff_get_domain_space(aff
);
4827 ls
= isl_local_space_from_space(isl_space_copy(space
));
4828 space2
= isl_space_copy(space
);
4830 space2
= isl_space_range(isl_space_unwrap(space2
));
4831 space
= isl_space_map_from_domain_and_range(space
, space2
);
4832 ma
= isl_multi_aff_alloc(space
);
4833 ma
= isl_multi_aff_set_aff(ma
, d
, aff
);
4835 for (i
= 0; i
< n_out
; ++i
) {
4838 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4839 isl_dim_set
, n_in
+ i
);
4840 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4843 isl_local_space_free(ls
);
4848 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4849 * taking into account that the dimension at position "d" can be written as
4851 * x = m a + f(..) (1)
4853 * where m is equal to "gcd".
4854 * "i" is the index of the equality in "hull" that defines f(..).
4855 * In particular, the equality is of the form
4857 * f(..) - x + m g(existentials) = 0
4861 * -f(..) + x + m g(existentials) = 0
4863 * We basically plug (1) into "map", resulting in a map with "a"
4864 * in the range instead of "x". The corresponding isl_pw_multi_aff
4865 * defining "a" is then plugged back into (1) to obtain a definition for "x".
4867 * Specifically, given the input map
4871 * We first wrap it into a set
4875 * and define (1) on top of the corresponding space, resulting in "aff".
4876 * We use this to create an isl_multi_aff that maps the output position "d"
4877 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
4878 * We plug this into the wrapped map, unwrap the result and compute the
4879 * corresponding isl_pw_multi_aff.
4880 * The result is an expression
4888 * so that we can plug that into "aff", after extending the latter to
4894 * If "map" is actually a set, then there is no "A" space, meaning
4895 * that we do not need to perform any wrapping, and that the result
4896 * of the recursive call is of the form
4900 * which is plugged into a mapping of the form
4904 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_stride(
4905 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
,
4910 isl_local_space
*ls
;
4913 isl_pw_multi_aff
*pma
, *id
;
4919 is_set
= isl_map_is_set(map
);
4921 n_in
= isl_basic_map_dim(hull
, isl_dim_in
);
4922 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
4923 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
4928 set
= isl_map_wrap(map
);
4929 space
= isl_space_map_from_set(isl_set_get_space(set
));
4930 ma
= isl_multi_aff_identity(space
);
4931 ls
= isl_local_space_from_space(isl_set_get_space(set
));
4932 aff
= isl_aff_alloc(ls
);
4934 isl_int_set_si(aff
->v
->el
[0], 1);
4935 if (isl_int_is_one(hull
->eq
[i
][o_out
+ d
]))
4936 isl_seq_neg(aff
->v
->el
+ 1, hull
->eq
[i
],
4939 isl_seq_cpy(aff
->v
->el
+ 1, hull
->eq
[i
],
4941 isl_int_set(aff
->v
->el
[1 + o_out
+ d
], gcd
);
4943 ma
= isl_multi_aff_set_aff(ma
, n_in
+ d
, isl_aff_copy(aff
));
4944 set
= isl_set_preimage_multi_aff(set
, ma
);
4946 ma
= range_map(aff
, d
, n_in
, n_out
, is_set
);
4951 map
= isl_set_unwrap(set
);
4952 pma
= isl_pw_multi_aff_from_map(map
);
4955 space
= isl_pw_multi_aff_get_domain_space(pma
);
4956 space
= isl_space_map_from_set(space
);
4957 id
= isl_pw_multi_aff_identity(space
);
4958 pma
= isl_pw_multi_aff_range_product(id
, pma
);
4960 id
= isl_pw_multi_aff_from_multi_aff(ma
);
4961 pma
= isl_pw_multi_aff_pullback_pw_multi_aff(id
, pma
);
4963 isl_basic_map_free(hull
);
4967 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4969 * As a special case, we first check if all output dimensions are uniquely
4970 * defined in terms of the parameters and input dimensions over the entire
4971 * domain. If so, we extract the desired isl_pw_multi_aff directly
4972 * from the affine hull of "map" and its domain.
4974 * Otherwise, we check if any of the output dimensions is "strided".
4975 * That is, we check if can be written as
4979 * with m greater than 1, a some combination of existentially quantified
4980 * variables and f an expression in the parameters and input dimensions.
4981 * If so, we remove the stride in pw_multi_aff_from_map_stride.
4983 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
4986 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_map(__isl_take isl_map
*map
)
4990 isl_basic_map
*hull
;
5000 map
= isl_map_detect_equalities(map
);
5001 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
5002 sv
= isl_basic_map_plain_is_single_valued(hull
);
5004 return plain_pw_multi_aff_from_map(isl_map_domain(map
), hull
);
5006 hull
= isl_basic_map_free(hull
);
5010 n_div
= isl_basic_map_dim(hull
, isl_dim_div
);
5011 o_div
= isl_basic_map_offset(hull
, isl_dim_div
);
5014 isl_basic_map_free(hull
);
5015 return pw_multi_aff_from_map_check_div(map
);
5020 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
5021 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
5023 for (i
= 0; i
< n_out
; ++i
) {
5024 for (j
= 0; j
< hull
->n_eq
; ++j
) {
5025 isl_int
*eq
= hull
->eq
[j
];
5026 isl_pw_multi_aff
*res
;
5028 if (!isl_int_is_one(eq
[o_out
+ i
]) &&
5029 !isl_int_is_negone(eq
[o_out
+ i
]))
5031 if (isl_seq_first_non_zero(eq
+ o_out
, i
) != -1)
5033 if (isl_seq_first_non_zero(eq
+ o_out
+ i
+ 1,
5034 n_out
- (i
+ 1)) != -1)
5036 isl_seq_gcd(eq
+ o_div
, n_div
, &gcd
);
5037 if (isl_int_is_zero(gcd
))
5039 if (isl_int_is_one(gcd
))
5042 res
= pw_multi_aff_from_map_stride(map
, hull
,
5050 isl_basic_map_free(hull
);
5051 return pw_multi_aff_from_map_check_div(map
);
5057 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_set(__isl_take isl_set
*set
)
5059 return isl_pw_multi_aff_from_map(set
);
5062 /* Convert "map" into an isl_pw_multi_aff (if possible) and
5065 static isl_stat
pw_multi_aff_from_map(__isl_take isl_map
*map
, void *user
)
5067 isl_union_pw_multi_aff
**upma
= user
;
5068 isl_pw_multi_aff
*pma
;
5070 pma
= isl_pw_multi_aff_from_map(map
);
5071 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5073 return *upma
? isl_stat_ok
: isl_stat_error
;
5076 /* Create an isl_union_pw_multi_aff with the given isl_aff on a universe
5079 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_aff(
5080 __isl_take isl_aff
*aff
)
5083 isl_pw_multi_aff
*pma
;
5085 ma
= isl_multi_aff_from_aff(aff
);
5086 pma
= isl_pw_multi_aff_from_multi_aff(ma
);
5087 return isl_union_pw_multi_aff_from_pw_multi_aff(pma
);
5090 /* Try and create an isl_union_pw_multi_aff that is equivalent
5091 * to the given isl_union_map.
5092 * The isl_union_map is required to be single-valued in each space.
5093 * Otherwise, an error is produced.
5095 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_map(
5096 __isl_take isl_union_map
*umap
)
5099 isl_union_pw_multi_aff
*upma
;
5101 space
= isl_union_map_get_space(umap
);
5102 upma
= isl_union_pw_multi_aff_empty(space
);
5103 if (isl_union_map_foreach_map(umap
, &pw_multi_aff_from_map
, &upma
) < 0)
5104 upma
= isl_union_pw_multi_aff_free(upma
);
5105 isl_union_map_free(umap
);
5110 /* Try and create an isl_union_pw_multi_aff that is equivalent
5111 * to the given isl_union_set.
5112 * The isl_union_set is required to be a singleton in each space.
5113 * Otherwise, an error is produced.
5115 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_set(
5116 __isl_take isl_union_set
*uset
)
5118 return isl_union_pw_multi_aff_from_union_map(uset
);
5121 /* Return the piecewise affine expression "set ? 1 : 0".
5123 __isl_give isl_pw_aff
*isl_set_indicator_function(__isl_take isl_set
*set
)
5126 isl_space
*space
= isl_set_get_space(set
);
5127 isl_local_space
*ls
= isl_local_space_from_space(space
);
5128 isl_aff
*zero
= isl_aff_zero_on_domain(isl_local_space_copy(ls
));
5129 isl_aff
*one
= isl_aff_zero_on_domain(ls
);
5131 one
= isl_aff_add_constant_si(one
, 1);
5132 pa
= isl_pw_aff_alloc(isl_set_copy(set
), one
);
5133 set
= isl_set_complement(set
);
5134 pa
= isl_pw_aff_add_disjoint(pa
, isl_pw_aff_alloc(set
, zero
));
5139 /* Plug in "subs" for dimension "type", "pos" of "aff".
5141 * Let i be the dimension to replace and let "subs" be of the form
5145 * and "aff" of the form
5151 * (a f + d g')/(m d)
5153 * where g' is the result of plugging in "subs" in each of the integer
5156 __isl_give isl_aff
*isl_aff_substitute(__isl_take isl_aff
*aff
,
5157 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
5162 aff
= isl_aff_cow(aff
);
5164 return isl_aff_free(aff
);
5166 ctx
= isl_aff_get_ctx(aff
);
5167 if (!isl_space_is_equal(aff
->ls
->dim
, subs
->ls
->dim
))
5168 isl_die(ctx
, isl_error_invalid
,
5169 "spaces don't match", return isl_aff_free(aff
));
5170 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
5171 isl_die(ctx
, isl_error_unsupported
,
5172 "cannot handle divs yet", return isl_aff_free(aff
));
5174 aff
->ls
= isl_local_space_substitute(aff
->ls
, type
, pos
, subs
);
5176 return isl_aff_free(aff
);
5178 aff
->v
= isl_vec_cow(aff
->v
);
5180 return isl_aff_free(aff
);
5182 pos
+= isl_local_space_offset(aff
->ls
, type
);
5185 isl_seq_substitute(aff
->v
->el
, pos
, subs
->v
->el
,
5186 aff
->v
->size
, subs
->v
->size
, v
);
5192 /* Plug in "subs" for dimension "type", "pos" in each of the affine
5193 * expressions in "maff".
5195 __isl_give isl_multi_aff
*isl_multi_aff_substitute(
5196 __isl_take isl_multi_aff
*maff
, enum isl_dim_type type
, unsigned pos
,
5197 __isl_keep isl_aff
*subs
)
5201 maff
= isl_multi_aff_cow(maff
);
5203 return isl_multi_aff_free(maff
);
5205 if (type
== isl_dim_in
)
5208 for (i
= 0; i
< maff
->n
; ++i
) {
5209 maff
->p
[i
] = isl_aff_substitute(maff
->p
[i
], type
, pos
, subs
);
5211 return isl_multi_aff_free(maff
);
5217 /* Plug in "subs" for dimension "type", "pos" of "pma".
5219 * pma is of the form
5223 * while subs is of the form
5225 * v' = B_j(v) -> S_j
5227 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
5228 * has a contribution in the result, in particular
5230 * C_ij(S_j) -> M_i(S_j)
5232 * Note that plugging in S_j in C_ij may also result in an empty set
5233 * and this contribution should simply be discarded.
5235 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_substitute(
5236 __isl_take isl_pw_multi_aff
*pma
, enum isl_dim_type type
, unsigned pos
,
5237 __isl_keep isl_pw_aff
*subs
)
5240 isl_pw_multi_aff
*res
;
5243 return isl_pw_multi_aff_free(pma
);
5245 n
= pma
->n
* subs
->n
;
5246 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma
->dim
), n
);
5248 for (i
= 0; i
< pma
->n
; ++i
) {
5249 for (j
= 0; j
< subs
->n
; ++j
) {
5251 isl_multi_aff
*res_ij
;
5254 common
= isl_set_intersect(
5255 isl_set_copy(pma
->p
[i
].set
),
5256 isl_set_copy(subs
->p
[j
].set
));
5257 common
= isl_set_substitute(common
,
5258 type
, pos
, subs
->p
[j
].aff
);
5259 empty
= isl_set_plain_is_empty(common
);
5260 if (empty
< 0 || empty
) {
5261 isl_set_free(common
);
5267 res_ij
= isl_multi_aff_substitute(
5268 isl_multi_aff_copy(pma
->p
[i
].maff
),
5269 type
, pos
, subs
->p
[j
].aff
);
5271 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5275 isl_pw_multi_aff_free(pma
);
5278 isl_pw_multi_aff_free(pma
);
5279 isl_pw_multi_aff_free(res
);
5283 /* Compute the preimage of a range of dimensions in the affine expression "src"
5284 * under "ma" and put the result in "dst". The number of dimensions in "src"
5285 * that precede the range is given by "n_before". The number of dimensions
5286 * in the range is given by the number of output dimensions of "ma".
5287 * The number of dimensions that follow the range is given by "n_after".
5288 * If "has_denom" is set (to one),
5289 * then "src" and "dst" have an extra initial denominator.
5290 * "n_div_ma" is the number of existentials in "ma"
5291 * "n_div_bset" is the number of existentials in "src"
5292 * The resulting "dst" (which is assumed to have been allocated by
5293 * the caller) contains coefficients for both sets of existentials,
5294 * first those in "ma" and then those in "src".
5295 * f, c1, c2 and g are temporary objects that have been initialized
5298 * Let src represent the expression
5300 * (a(p) + f_u u + b v + f_w w + c(divs))/d
5302 * and let ma represent the expressions
5304 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
5306 * We start out with the following expression for dst:
5308 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
5310 * with the multiplication factor f initially equal to 1
5311 * and f \sum_i b_i v_i kept separately.
5312 * For each x_i that we substitute, we multiply the numerator
5313 * (and denominator) of dst by c_1 = m_i and add the numerator
5314 * of the x_i expression multiplied by c_2 = f b_i,
5315 * after removing the common factors of c_1 and c_2.
5316 * The multiplication factor f also needs to be multiplied by c_1
5317 * for the next x_j, j > i.
5319 void isl_seq_preimage(isl_int
*dst
, isl_int
*src
,
5320 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
,
5321 int n_div_ma
, int n_div_bmap
,
5322 isl_int f
, isl_int c1
, isl_int c2
, isl_int g
, int has_denom
)
5325 int n_param
, n_in
, n_out
;
5328 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
5329 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
5330 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
5332 isl_seq_cpy(dst
, src
, has_denom
+ 1 + n_param
+ n_before
);
5333 o_dst
= o_src
= has_denom
+ 1 + n_param
+ n_before
;
5334 isl_seq_clr(dst
+ o_dst
, n_in
);
5337 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_after
);
5340 isl_seq_clr(dst
+ o_dst
, n_div_ma
);
5342 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_div_bmap
);
5344 isl_int_set_si(f
, 1);
5346 for (i
= 0; i
< n_out
; ++i
) {
5347 int offset
= has_denom
+ 1 + n_param
+ n_before
+ i
;
5349 if (isl_int_is_zero(src
[offset
]))
5351 isl_int_set(c1
, ma
->p
[i
]->v
->el
[0]);
5352 isl_int_mul(c2
, f
, src
[offset
]);
5353 isl_int_gcd(g
, c1
, c2
);
5354 isl_int_divexact(c1
, c1
, g
);
5355 isl_int_divexact(c2
, c2
, g
);
5357 isl_int_mul(f
, f
, c1
);
5360 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5361 c2
, ma
->p
[i
]->v
->el
+ o_src
, 1 + n_param
);
5362 o_dst
+= 1 + n_param
;
5363 o_src
+= 1 + n_param
;
5364 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_before
);
5366 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5367 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_in
);
5370 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_after
);
5372 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
5373 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_div_ma
);
5376 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_div_bmap
);
5378 isl_int_mul(dst
[0], dst
[0], c1
);
5382 /* Compute the pullback of "aff" by the function represented by "ma".
5383 * In other words, plug in "ma" in "aff". The result is an affine expression
5384 * defined over the domain space of "ma".
5386 * If "aff" is represented by
5388 * (a(p) + b x + c(divs))/d
5390 * and ma is represented by
5392 * x = D(p) + F(y) + G(divs')
5394 * then the result is
5396 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
5398 * The divs in the local space of the input are similarly adjusted
5399 * through a call to isl_local_space_preimage_multi_aff.
5401 __isl_give isl_aff
*isl_aff_pullback_multi_aff(__isl_take isl_aff
*aff
,
5402 __isl_take isl_multi_aff
*ma
)
5404 isl_aff
*res
= NULL
;
5405 isl_local_space
*ls
;
5406 int n_div_aff
, n_div_ma
;
5407 isl_int f
, c1
, c2
, g
;
5409 ma
= isl_multi_aff_align_divs(ma
);
5413 n_div_aff
= isl_aff_dim(aff
, isl_dim_div
);
5414 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
5416 ls
= isl_aff_get_domain_local_space(aff
);
5417 ls
= isl_local_space_preimage_multi_aff(ls
, isl_multi_aff_copy(ma
));
5418 res
= isl_aff_alloc(ls
);
5427 isl_seq_preimage(res
->v
->el
, aff
->v
->el
, ma
, 0, 0, n_div_ma
, n_div_aff
,
5436 isl_multi_aff_free(ma
);
5437 res
= isl_aff_normalize(res
);
5441 isl_multi_aff_free(ma
);
5446 /* Compute the pullback of "aff1" by the function represented by "aff2".
5447 * In other words, plug in "aff2" in "aff1". The result is an affine expression
5448 * defined over the domain space of "aff1".
5450 * The domain of "aff1" should match the range of "aff2", which means
5451 * that it should be single-dimensional.
5453 __isl_give isl_aff
*isl_aff_pullback_aff(__isl_take isl_aff
*aff1
,
5454 __isl_take isl_aff
*aff2
)
5458 ma
= isl_multi_aff_from_aff(aff2
);
5459 return isl_aff_pullback_multi_aff(aff1
, ma
);
5462 /* Compute the pullback of "ma1" by the function represented by "ma2".
5463 * In other words, plug in "ma2" in "ma1".
5465 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
5467 static __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff_aligned(
5468 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5471 isl_space
*space
= NULL
;
5473 ma2
= isl_multi_aff_align_divs(ma2
);
5474 ma1
= isl_multi_aff_cow(ma1
);
5478 space
= isl_space_join(isl_multi_aff_get_space(ma2
),
5479 isl_multi_aff_get_space(ma1
));
5481 for (i
= 0; i
< ma1
->n
; ++i
) {
5482 ma1
->p
[i
] = isl_aff_pullback_multi_aff(ma1
->p
[i
],
5483 isl_multi_aff_copy(ma2
));
5488 ma1
= isl_multi_aff_reset_space(ma1
, space
);
5489 isl_multi_aff_free(ma2
);
5492 isl_space_free(space
);
5493 isl_multi_aff_free(ma2
);
5494 isl_multi_aff_free(ma1
);
5498 /* Compute the pullback of "ma1" by the function represented by "ma2".
5499 * In other words, plug in "ma2" in "ma1".
5501 __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff(
5502 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
5504 return isl_multi_aff_align_params_multi_multi_and(ma1
, ma2
,
5505 &isl_multi_aff_pullback_multi_aff_aligned
);
5508 /* Extend the local space of "dst" to include the divs
5509 * in the local space of "src".
5511 * If "src" does not have any divs or if the local spaces of "dst" and
5512 * "src" are the same, then no extension is required.
5514 __isl_give isl_aff
*isl_aff_align_divs(__isl_take isl_aff
*dst
,
5515 __isl_keep isl_aff
*src
)
5518 int src_n_div
, dst_n_div
;
5525 return isl_aff_free(dst
);
5527 ctx
= isl_aff_get_ctx(src
);
5528 equal
= isl_local_space_has_equal_space(src
->ls
, dst
->ls
);
5530 return isl_aff_free(dst
);
5532 isl_die(ctx
, isl_error_invalid
,
5533 "spaces don't match", goto error
);
5535 src_n_div
= isl_local_space_dim(src
->ls
, isl_dim_div
);
5538 equal
= isl_local_space_is_equal(src
->ls
, dst
->ls
);
5540 return isl_aff_free(dst
);
5544 dst_n_div
= isl_local_space_dim(dst
->ls
, isl_dim_div
);
5545 exp1
= isl_alloc_array(ctx
, int, src_n_div
);
5546 exp2
= isl_alloc_array(ctx
, int, dst_n_div
);
5547 if (!exp1
|| (dst_n_div
&& !exp2
))
5550 div
= isl_merge_divs(src
->ls
->div
, dst
->ls
->div
, exp1
, exp2
);
5551 dst
= isl_aff_expand_divs(dst
, div
, exp2
);
5559 return isl_aff_free(dst
);
5562 /* Adjust the local spaces of the affine expressions in "maff"
5563 * such that they all have the save divs.
5565 __isl_give isl_multi_aff
*isl_multi_aff_align_divs(
5566 __isl_take isl_multi_aff
*maff
)
5574 maff
= isl_multi_aff_cow(maff
);
5578 for (i
= 1; i
< maff
->n
; ++i
)
5579 maff
->p
[0] = isl_aff_align_divs(maff
->p
[0], maff
->p
[i
]);
5580 for (i
= 1; i
< maff
->n
; ++i
) {
5581 maff
->p
[i
] = isl_aff_align_divs(maff
->p
[i
], maff
->p
[0]);
5583 return isl_multi_aff_free(maff
);
5589 __isl_give isl_aff
*isl_aff_lift(__isl_take isl_aff
*aff
)
5591 aff
= isl_aff_cow(aff
);
5595 aff
->ls
= isl_local_space_lift(aff
->ls
);
5597 return isl_aff_free(aff
);
5602 /* Lift "maff" to a space with extra dimensions such that the result
5603 * has no more existentially quantified variables.
5604 * If "ls" is not NULL, then *ls is assigned the local space that lies
5605 * at the basis of the lifting applied to "maff".
5607 __isl_give isl_multi_aff
*isl_multi_aff_lift(__isl_take isl_multi_aff
*maff
,
5608 __isl_give isl_local_space
**ls
)
5622 isl_space
*space
= isl_multi_aff_get_domain_space(maff
);
5623 *ls
= isl_local_space_from_space(space
);
5625 return isl_multi_aff_free(maff
);
5630 maff
= isl_multi_aff_cow(maff
);
5631 maff
= isl_multi_aff_align_divs(maff
);
5635 n_div
= isl_aff_dim(maff
->p
[0], isl_dim_div
);
5636 space
= isl_multi_aff_get_space(maff
);
5637 space
= isl_space_lift(isl_space_domain(space
), n_div
);
5638 space
= isl_space_extend_domain_with_range(space
,
5639 isl_multi_aff_get_space(maff
));
5641 return isl_multi_aff_free(maff
);
5642 isl_space_free(maff
->space
);
5643 maff
->space
= space
;
5646 *ls
= isl_aff_get_domain_local_space(maff
->p
[0]);
5648 return isl_multi_aff_free(maff
);
5651 for (i
= 0; i
< maff
->n
; ++i
) {
5652 maff
->p
[i
] = isl_aff_lift(maff
->p
[i
]);
5660 isl_local_space_free(*ls
);
5661 return isl_multi_aff_free(maff
);
5665 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
5667 __isl_give isl_pw_aff
*isl_pw_multi_aff_get_pw_aff(
5668 __isl_keep isl_pw_multi_aff
*pma
, int pos
)
5678 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
5679 if (pos
< 0 || pos
>= n_out
)
5680 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5681 "index out of bounds", return NULL
);
5683 space
= isl_pw_multi_aff_get_space(pma
);
5684 space
= isl_space_drop_dims(space
, isl_dim_out
,
5685 pos
+ 1, n_out
- pos
- 1);
5686 space
= isl_space_drop_dims(space
, isl_dim_out
, 0, pos
);
5688 pa
= isl_pw_aff_alloc_size(space
, pma
->n
);
5689 for (i
= 0; i
< pma
->n
; ++i
) {
5691 aff
= isl_multi_aff_get_aff(pma
->p
[i
].maff
, pos
);
5692 pa
= isl_pw_aff_add_piece(pa
, isl_set_copy(pma
->p
[i
].set
), aff
);
5698 /* Return an isl_pw_multi_aff with the given "set" as domain and
5699 * an unnamed zero-dimensional range.
5701 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_domain(
5702 __isl_take isl_set
*set
)
5707 space
= isl_set_get_space(set
);
5708 space
= isl_space_from_domain(space
);
5709 ma
= isl_multi_aff_zero(space
);
5710 return isl_pw_multi_aff_alloc(set
, ma
);
5713 /* Add an isl_pw_multi_aff with the given "set" as domain and
5714 * an unnamed zero-dimensional range to *user.
5716 static isl_stat
add_pw_multi_aff_from_domain(__isl_take isl_set
*set
,
5719 isl_union_pw_multi_aff
**upma
= user
;
5720 isl_pw_multi_aff
*pma
;
5722 pma
= isl_pw_multi_aff_from_domain(set
);
5723 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5728 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
5729 * an unnamed zero-dimensional range.
5731 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_domain(
5732 __isl_take isl_union_set
*uset
)
5735 isl_union_pw_multi_aff
*upma
;
5740 space
= isl_union_set_get_space(uset
);
5741 upma
= isl_union_pw_multi_aff_empty(space
);
5743 if (isl_union_set_foreach_set(uset
,
5744 &add_pw_multi_aff_from_domain
, &upma
) < 0)
5747 isl_union_set_free(uset
);
5750 isl_union_set_free(uset
);
5751 isl_union_pw_multi_aff_free(upma
);
5755 /* Convert "pma" to an isl_map and add it to *umap.
5757 static isl_stat
map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
,
5760 isl_union_map
**umap
= user
;
5763 map
= isl_map_from_pw_multi_aff(pma
);
5764 *umap
= isl_union_map_add_map(*umap
, map
);
5769 /* Construct a union map mapping the domain of the union
5770 * piecewise multi-affine expression to its range, with each dimension
5771 * in the range equated to the corresponding affine expression on its cell.
5773 __isl_give isl_union_map
*isl_union_map_from_union_pw_multi_aff(
5774 __isl_take isl_union_pw_multi_aff
*upma
)
5777 isl_union_map
*umap
;
5782 space
= isl_union_pw_multi_aff_get_space(upma
);
5783 umap
= isl_union_map_empty(space
);
5785 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
5786 &map_from_pw_multi_aff
, &umap
) < 0)
5789 isl_union_pw_multi_aff_free(upma
);
5792 isl_union_pw_multi_aff_free(upma
);
5793 isl_union_map_free(umap
);
5797 /* Local data for bin_entry and the callback "fn".
5799 struct isl_union_pw_multi_aff_bin_data
{
5800 isl_union_pw_multi_aff
*upma2
;
5801 isl_union_pw_multi_aff
*res
;
5802 isl_pw_multi_aff
*pma
;
5803 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
);
5806 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
5807 * and call data->fn for each isl_pw_multi_aff in data->upma2.
5809 static isl_stat
bin_entry(__isl_take isl_pw_multi_aff
*pma
, void *user
)
5811 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5815 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma2
,
5817 isl_pw_multi_aff_free(pma
);
5822 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
5823 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
5824 * passed as user field) and the isl_pw_multi_aff from upma2 is available
5825 * as *entry. The callback should adjust data->res if desired.
5827 static __isl_give isl_union_pw_multi_aff
*bin_op(
5828 __isl_take isl_union_pw_multi_aff
*upma1
,
5829 __isl_take isl_union_pw_multi_aff
*upma2
,
5830 isl_stat (*fn
)(__isl_take isl_pw_multi_aff
*pma
, void *user
))
5833 struct isl_union_pw_multi_aff_bin_data data
= { NULL
, NULL
, NULL
, fn
};
5835 space
= isl_union_pw_multi_aff_get_space(upma2
);
5836 upma1
= isl_union_pw_multi_aff_align_params(upma1
, space
);
5837 space
= isl_union_pw_multi_aff_get_space(upma1
);
5838 upma2
= isl_union_pw_multi_aff_align_params(upma2
, space
);
5840 if (!upma1
|| !upma2
)
5844 data
.res
= isl_union_pw_multi_aff_alloc_same_size(upma1
);
5845 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma1
,
5846 &bin_entry
, &data
) < 0)
5849 isl_union_pw_multi_aff_free(upma1
);
5850 isl_union_pw_multi_aff_free(upma2
);
5853 isl_union_pw_multi_aff_free(upma1
);
5854 isl_union_pw_multi_aff_free(upma2
);
5855 isl_union_pw_multi_aff_free(data
.res
);
5859 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5860 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5862 static __isl_give isl_pw_multi_aff
*pw_multi_aff_range_product(
5863 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5867 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5868 isl_pw_multi_aff_get_space(pma2
));
5869 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5870 &isl_multi_aff_range_product
);
5873 /* Given two isl_pw_multi_affs A -> B and C -> D,
5874 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5876 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_product(
5877 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5879 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5880 &pw_multi_aff_range_product
);
5883 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5884 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5886 static __isl_give isl_pw_multi_aff
*pw_multi_aff_flat_range_product(
5887 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5891 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5892 isl_pw_multi_aff_get_space(pma2
));
5893 space
= isl_space_flatten_range(space
);
5894 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5895 &isl_multi_aff_flat_range_product
);
5898 /* Given two isl_pw_multi_affs A -> B and C -> D,
5899 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5901 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_flat_range_product(
5902 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5904 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5905 &pw_multi_aff_flat_range_product
);
5908 /* If data->pma and "pma2" have the same domain space, then compute
5909 * their flat range product and the result to data->res.
5911 static isl_stat
flat_range_product_entry(__isl_take isl_pw_multi_aff
*pma2
,
5914 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5916 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
5917 pma2
->dim
, isl_dim_in
)) {
5918 isl_pw_multi_aff_free(pma2
);
5922 pma2
= isl_pw_multi_aff_flat_range_product(
5923 isl_pw_multi_aff_copy(data
->pma
), pma2
);
5925 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
5930 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
5931 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
5933 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_flat_range_product(
5934 __isl_take isl_union_pw_multi_aff
*upma1
,
5935 __isl_take isl_union_pw_multi_aff
*upma2
)
5937 return bin_op(upma1
, upma2
, &flat_range_product_entry
);
5940 /* Replace the affine expressions at position "pos" in "pma" by "pa".
5941 * The parameters are assumed to have been aligned.
5943 * The implementation essentially performs an isl_pw_*_on_shared_domain,
5944 * except that it works on two different isl_pw_* types.
5946 static __isl_give isl_pw_multi_aff
*pw_multi_aff_set_pw_aff(
5947 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
5948 __isl_take isl_pw_aff
*pa
)
5951 isl_pw_multi_aff
*res
= NULL
;
5956 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_in
,
5957 pa
->dim
, isl_dim_in
))
5958 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5959 "domains don't match", goto error
);
5960 if (pos
>= isl_pw_multi_aff_dim(pma
, isl_dim_out
))
5961 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5962 "index out of bounds", goto error
);
5965 res
= isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma
), n
);
5967 for (i
= 0; i
< pma
->n
; ++i
) {
5968 for (j
= 0; j
< pa
->n
; ++j
) {
5970 isl_multi_aff
*res_ij
;
5973 common
= isl_set_intersect(isl_set_copy(pma
->p
[i
].set
),
5974 isl_set_copy(pa
->p
[j
].set
));
5975 empty
= isl_set_plain_is_empty(common
);
5976 if (empty
< 0 || empty
) {
5977 isl_set_free(common
);
5983 res_ij
= isl_multi_aff_set_aff(
5984 isl_multi_aff_copy(pma
->p
[i
].maff
), pos
,
5985 isl_aff_copy(pa
->p
[j
].aff
));
5986 res_ij
= isl_multi_aff_gist(res_ij
,
5987 isl_set_copy(common
));
5989 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5993 isl_pw_multi_aff_free(pma
);
5994 isl_pw_aff_free(pa
);
5997 isl_pw_multi_aff_free(pma
);
5998 isl_pw_aff_free(pa
);
5999 return isl_pw_multi_aff_free(res
);
6002 /* Replace the affine expressions at position "pos" in "pma" by "pa".
6004 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_set_pw_aff(
6005 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
6006 __isl_take isl_pw_aff
*pa
)
6010 if (isl_space_match(pma
->dim
, isl_dim_param
, pa
->dim
, isl_dim_param
))
6011 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6012 if (!isl_space_has_named_params(pma
->dim
) ||
6013 !isl_space_has_named_params(pa
->dim
))
6014 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6015 "unaligned unnamed parameters", goto error
);
6016 pma
= isl_pw_multi_aff_align_params(pma
, isl_pw_aff_get_space(pa
));
6017 pa
= isl_pw_aff_align_params(pa
, isl_pw_multi_aff_get_space(pma
));
6018 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
6020 isl_pw_multi_aff_free(pma
);
6021 isl_pw_aff_free(pa
);
6025 /* Do the parameters of "pa" match those of "space"?
6027 int isl_pw_aff_matching_params(__isl_keep isl_pw_aff
*pa
,
6028 __isl_keep isl_space
*space
)
6030 isl_space
*pa_space
;
6036 pa_space
= isl_pw_aff_get_space(pa
);
6038 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
6040 isl_space_free(pa_space
);
6044 /* Check that the domain space of "pa" matches "space".
6046 * Return 0 on success and -1 on error.
6048 int isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff
*pa
,
6049 __isl_keep isl_space
*space
)
6051 isl_space
*pa_space
;
6057 pa_space
= isl_pw_aff_get_space(pa
);
6059 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
6063 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6064 "parameters don't match", goto error
);
6065 match
= isl_space_tuple_is_equal(space
, isl_dim_in
,
6066 pa_space
, isl_dim_in
);
6070 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
6071 "domains don't match", goto error
);
6072 isl_space_free(pa_space
);
6075 isl_space_free(pa_space
);
6084 #include <isl_multi_templ.c>
6085 #include <isl_multi_apply_set.c>
6086 #include <isl_multi_coalesce.c>
6087 #include <isl_multi_gist.c>
6088 #include <isl_multi_hash.c>
6089 #include <isl_multi_intersect.c>
6091 /* Scale the elements of "pma" by the corresponding elements of "mv".
6093 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_scale_multi_val(
6094 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
)
6098 pma
= isl_pw_multi_aff_cow(pma
);
6101 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6102 mv
->space
, isl_dim_set
))
6103 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
6104 "spaces don't match", goto error
);
6105 if (!isl_space_match(pma
->dim
, isl_dim_param
,
6106 mv
->space
, isl_dim_param
)) {
6107 pma
= isl_pw_multi_aff_align_params(pma
,
6108 isl_multi_val_get_space(mv
));
6109 mv
= isl_multi_val_align_params(mv
,
6110 isl_pw_multi_aff_get_space(pma
));
6115 for (i
= 0; i
< pma
->n
; ++i
) {
6116 pma
->p
[i
].maff
= isl_multi_aff_scale_multi_val(pma
->p
[i
].maff
,
6117 isl_multi_val_copy(mv
));
6118 if (!pma
->p
[i
].maff
)
6122 isl_multi_val_free(mv
);
6125 isl_multi_val_free(mv
);
6126 isl_pw_multi_aff_free(pma
);
6130 /* This function is called for each entry of an isl_union_pw_multi_aff.
6131 * If the space of the entry matches that of data->mv,
6132 * then apply isl_pw_multi_aff_scale_multi_val and return the result.
6133 * Otherwise, return an empty isl_pw_multi_aff.
6135 static __isl_give isl_pw_multi_aff
*union_pw_multi_aff_scale_multi_val_entry(
6136 __isl_take isl_pw_multi_aff
*pma
, void *user
)
6138 isl_multi_val
*mv
= user
;
6142 if (!isl_space_tuple_is_equal(pma
->dim
, isl_dim_out
,
6143 mv
->space
, isl_dim_set
)) {
6144 isl_space
*space
= isl_pw_multi_aff_get_space(pma
);
6145 isl_pw_multi_aff_free(pma
);
6146 return isl_pw_multi_aff_empty(space
);
6149 return isl_pw_multi_aff_scale_multi_val(pma
, isl_multi_val_copy(mv
));
6152 /* Scale the elements of "upma" by the corresponding elements of "mv",
6153 * for those entries that match the space of "mv".
6155 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_scale_multi_val(
6156 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_multi_val
*mv
)
6158 upma
= isl_union_pw_multi_aff_align_params(upma
,
6159 isl_multi_val_get_space(mv
));
6160 mv
= isl_multi_val_align_params(mv
,
6161 isl_union_pw_multi_aff_get_space(upma
));
6165 return isl_union_pw_multi_aff_transform(upma
,
6166 &union_pw_multi_aff_scale_multi_val_entry
, mv
);
6168 isl_multi_val_free(mv
);
6171 isl_multi_val_free(mv
);
6172 isl_union_pw_multi_aff_free(upma
);
6176 /* Construct and return a piecewise multi affine expression
6177 * in the given space with value zero in each of the output dimensions and
6178 * a universe domain.
6180 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_zero(__isl_take isl_space
*space
)
6182 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space
));
6185 /* Construct and return a piecewise multi affine expression
6186 * that is equal to the given piecewise affine expression.
6188 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_pw_aff(
6189 __isl_take isl_pw_aff
*pa
)
6193 isl_pw_multi_aff
*pma
;
6198 space
= isl_pw_aff_get_space(pa
);
6199 pma
= isl_pw_multi_aff_alloc_size(space
, pa
->n
);
6201 for (i
= 0; i
< pa
->n
; ++i
) {
6205 set
= isl_set_copy(pa
->p
[i
].set
);
6206 ma
= isl_multi_aff_from_aff(isl_aff_copy(pa
->p
[i
].aff
));
6207 pma
= isl_pw_multi_aff_add_piece(pma
, set
, ma
);
6210 isl_pw_aff_free(pa
);
6214 /* Construct a set or map mapping the shared (parameter) domain
6215 * of the piecewise affine expressions to the range of "mpa"
6216 * with each dimension in the range equated to the
6217 * corresponding piecewise affine expression.
6219 static __isl_give isl_map
*map_from_multi_pw_aff(
6220 __isl_take isl_multi_pw_aff
*mpa
)
6229 if (isl_space_dim(mpa
->space
, isl_dim_out
) != mpa
->n
)
6230 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6231 "invalid space", goto error
);
6233 space
= isl_multi_pw_aff_get_domain_space(mpa
);
6234 map
= isl_map_universe(isl_space_from_domain(space
));
6236 for (i
= 0; i
< mpa
->n
; ++i
) {
6240 pa
= isl_pw_aff_copy(mpa
->p
[i
]);
6241 map_i
= map_from_pw_aff(pa
);
6243 map
= isl_map_flat_range_product(map
, map_i
);
6246 map
= isl_map_reset_space(map
, isl_multi_pw_aff_get_space(mpa
));
6248 isl_multi_pw_aff_free(mpa
);
6251 isl_multi_pw_aff_free(mpa
);
6255 /* Construct a map mapping the shared domain
6256 * of the piecewise affine expressions to the range of "mpa"
6257 * with each dimension in the range equated to the
6258 * corresponding piecewise affine expression.
6260 __isl_give isl_map
*isl_map_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6264 if (isl_space_is_set(mpa
->space
))
6265 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6266 "space of input is not a map", goto error
);
6268 return map_from_multi_pw_aff(mpa
);
6270 isl_multi_pw_aff_free(mpa
);
6274 /* Construct a set mapping the shared parameter domain
6275 * of the piecewise affine expressions to the space of "mpa"
6276 * with each dimension in the range equated to the
6277 * corresponding piecewise affine expression.
6279 __isl_give isl_set
*isl_set_from_multi_pw_aff(__isl_take isl_multi_pw_aff
*mpa
)
6283 if (!isl_space_is_set(mpa
->space
))
6284 isl_die(isl_multi_pw_aff_get_ctx(mpa
), isl_error_internal
,
6285 "space of input is not a set", goto error
);
6287 return map_from_multi_pw_aff(mpa
);
6289 isl_multi_pw_aff_free(mpa
);
6293 /* Construct and return a piecewise multi affine expression
6294 * that is equal to the given multi piecewise affine expression
6295 * on the shared domain of the piecewise affine expressions.
6297 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff(
6298 __isl_take isl_multi_pw_aff
*mpa
)
6303 isl_pw_multi_aff
*pma
;
6308 space
= isl_multi_pw_aff_get_space(mpa
);
6311 isl_multi_pw_aff_free(mpa
);
6312 return isl_pw_multi_aff_zero(space
);
6315 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, 0);
6316 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
6318 for (i
= 1; i
< mpa
->n
; ++i
) {
6319 isl_pw_multi_aff
*pma_i
;
6321 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6322 pma_i
= isl_pw_multi_aff_from_pw_aff(pa
);
6323 pma
= isl_pw_multi_aff_range_product(pma
, pma_i
);
6326 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
6328 isl_multi_pw_aff_free(mpa
);
6332 /* Construct and return a multi piecewise affine expression
6333 * that is equal to the given multi affine expression.
6335 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_multi_aff(
6336 __isl_take isl_multi_aff
*ma
)
6339 isl_multi_pw_aff
*mpa
;
6344 n
= isl_multi_aff_dim(ma
, isl_dim_out
);
6345 mpa
= isl_multi_pw_aff_alloc(isl_multi_aff_get_space(ma
));
6347 for (i
= 0; i
< n
; ++i
) {
6350 pa
= isl_pw_aff_from_aff(isl_multi_aff_get_aff(ma
, i
));
6351 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6354 isl_multi_aff_free(ma
);
6358 /* Construct and return a multi piecewise affine expression
6359 * that is equal to the given piecewise multi affine expression.
6361 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_from_pw_multi_aff(
6362 __isl_take isl_pw_multi_aff
*pma
)
6366 isl_multi_pw_aff
*mpa
;
6371 n
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
6372 space
= isl_pw_multi_aff_get_space(pma
);
6373 mpa
= isl_multi_pw_aff_alloc(space
);
6375 for (i
= 0; i
< n
; ++i
) {
6378 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
6379 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
6382 isl_pw_multi_aff_free(pma
);
6386 /* Do "pa1" and "pa2" represent the same function?
6388 * We first check if they are obviously equal.
6389 * If not, we convert them to maps and check if those are equal.
6391 * If "pa1" or "pa2" contain any NaNs, then they are considered
6392 * not to be the same. A NaN is not equal to anything, not even
6395 int isl_pw_aff_is_equal(__isl_keep isl_pw_aff
*pa1
, __isl_keep isl_pw_aff
*pa2
)
6399 isl_map
*map1
, *map2
;
6404 equal
= isl_pw_aff_plain_is_equal(pa1
, pa2
);
6405 if (equal
< 0 || equal
)
6407 has_nan
= isl_pw_aff_involves_nan(pa1
);
6408 if (has_nan
>= 0 && !has_nan
)
6409 has_nan
= isl_pw_aff_involves_nan(pa2
);
6415 map1
= map_from_pw_aff(isl_pw_aff_copy(pa1
));
6416 map2
= map_from_pw_aff(isl_pw_aff_copy(pa2
));
6417 equal
= isl_map_is_equal(map1
, map2
);
6424 /* Do "mpa1" and "mpa2" represent the same function?
6426 * Note that we cannot convert the entire isl_multi_pw_aff
6427 * to a map because the domains of the piecewise affine expressions
6428 * may not be the same.
6430 isl_bool
isl_multi_pw_aff_is_equal(__isl_keep isl_multi_pw_aff
*mpa1
,
6431 __isl_keep isl_multi_pw_aff
*mpa2
)
6437 return isl_bool_error
;
6439 if (!isl_space_match(mpa1
->space
, isl_dim_param
,
6440 mpa2
->space
, isl_dim_param
)) {
6441 if (!isl_space_has_named_params(mpa1
->space
))
6442 return isl_bool_false
;
6443 if (!isl_space_has_named_params(mpa2
->space
))
6444 return isl_bool_false
;
6445 mpa1
= isl_multi_pw_aff_copy(mpa1
);
6446 mpa2
= isl_multi_pw_aff_copy(mpa2
);
6447 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6448 isl_multi_pw_aff_get_space(mpa2
));
6449 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6450 isl_multi_pw_aff_get_space(mpa1
));
6451 equal
= isl_multi_pw_aff_is_equal(mpa1
, mpa2
);
6452 isl_multi_pw_aff_free(mpa1
);
6453 isl_multi_pw_aff_free(mpa2
);
6457 equal
= isl_space_is_equal(mpa1
->space
, mpa2
->space
);
6458 if (equal
< 0 || !equal
)
6461 for (i
= 0; i
< mpa1
->n
; ++i
) {
6462 equal
= isl_pw_aff_is_equal(mpa1
->p
[i
], mpa2
->p
[i
]);
6463 if (equal
< 0 || !equal
)
6467 return isl_bool_true
;
6470 /* Compute the pullback of "mpa" by the function represented by "ma".
6471 * In other words, plug in "ma" in "mpa".
6473 * The parameters of "mpa" and "ma" are assumed to have been aligned.
6475 static __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff_aligned(
6476 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6479 isl_space
*space
= NULL
;
6481 mpa
= isl_multi_pw_aff_cow(mpa
);
6485 space
= isl_space_join(isl_multi_aff_get_space(ma
),
6486 isl_multi_pw_aff_get_space(mpa
));
6490 for (i
= 0; i
< mpa
->n
; ++i
) {
6491 mpa
->p
[i
] = isl_pw_aff_pullback_multi_aff(mpa
->p
[i
],
6492 isl_multi_aff_copy(ma
));
6497 isl_multi_aff_free(ma
);
6498 isl_space_free(mpa
->space
);
6502 isl_space_free(space
);
6503 isl_multi_pw_aff_free(mpa
);
6504 isl_multi_aff_free(ma
);
6508 /* Compute the pullback of "mpa" by the function represented by "ma".
6509 * In other words, plug in "ma" in "mpa".
6511 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_aff(
6512 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_multi_aff
*ma
)
6516 if (isl_space_match(mpa
->space
, isl_dim_param
,
6517 ma
->space
, isl_dim_param
))
6518 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6519 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_multi_aff_get_space(ma
));
6520 ma
= isl_multi_aff_align_params(ma
, isl_multi_pw_aff_get_space(mpa
));
6521 return isl_multi_pw_aff_pullback_multi_aff_aligned(mpa
, ma
);
6523 isl_multi_pw_aff_free(mpa
);
6524 isl_multi_aff_free(ma
);
6528 /* Compute the pullback of "mpa" by the function represented by "pma".
6529 * In other words, plug in "pma" in "mpa".
6531 * The parameters of "mpa" and "mpa" are assumed to have been aligned.
6533 static __isl_give isl_multi_pw_aff
*
6534 isl_multi_pw_aff_pullback_pw_multi_aff_aligned(
6535 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6538 isl_space
*space
= NULL
;
6540 mpa
= isl_multi_pw_aff_cow(mpa
);
6544 space
= isl_space_join(isl_pw_multi_aff_get_space(pma
),
6545 isl_multi_pw_aff_get_space(mpa
));
6547 for (i
= 0; i
< mpa
->n
; ++i
) {
6548 mpa
->p
[i
] = isl_pw_aff_pullback_pw_multi_aff_aligned(mpa
->p
[i
],
6549 isl_pw_multi_aff_copy(pma
));
6554 isl_pw_multi_aff_free(pma
);
6555 isl_space_free(mpa
->space
);
6559 isl_space_free(space
);
6560 isl_multi_pw_aff_free(mpa
);
6561 isl_pw_multi_aff_free(pma
);
6565 /* Compute the pullback of "mpa" by the function represented by "pma".
6566 * In other words, plug in "pma" in "mpa".
6568 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_pw_multi_aff(
6569 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_multi_aff
*pma
)
6573 if (isl_space_match(mpa
->space
, isl_dim_param
, pma
->dim
, isl_dim_param
))
6574 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6575 mpa
= isl_multi_pw_aff_align_params(mpa
,
6576 isl_pw_multi_aff_get_space(pma
));
6577 pma
= isl_pw_multi_aff_align_params(pma
,
6578 isl_multi_pw_aff_get_space(mpa
));
6579 return isl_multi_pw_aff_pullback_pw_multi_aff_aligned(mpa
, pma
);
6581 isl_multi_pw_aff_free(mpa
);
6582 isl_pw_multi_aff_free(pma
);
6586 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6587 * with the domain of "aff". The domain of the result is the same
6589 * "mpa" and "aff" are assumed to have been aligned.
6591 * We first extract the parametric constant from "aff", defined
6592 * over the correct domain.
6593 * Then we add the appropriate combinations of the members of "mpa".
6594 * Finally, we add the integer divisions through recursive calls.
6596 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff_aligned(
6597 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6605 n_in
= isl_aff_dim(aff
, isl_dim_in
);
6606 n_div
= isl_aff_dim(aff
, isl_dim_div
);
6608 space
= isl_space_domain(isl_multi_pw_aff_get_space(mpa
));
6609 tmp
= isl_aff_copy(aff
);
6610 tmp
= isl_aff_drop_dims(tmp
, isl_dim_div
, 0, n_div
);
6611 tmp
= isl_aff_drop_dims(tmp
, isl_dim_in
, 0, n_in
);
6612 tmp
= isl_aff_add_dims(tmp
, isl_dim_in
,
6613 isl_space_dim(space
, isl_dim_set
));
6614 tmp
= isl_aff_reset_domain_space(tmp
, space
);
6615 pa
= isl_pw_aff_from_aff(tmp
);
6617 for (i
= 0; i
< n_in
; ++i
) {
6620 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
6622 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
6623 pa_i
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
6624 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6625 pa
= isl_pw_aff_add(pa
, pa_i
);
6628 for (i
= 0; i
< n_div
; ++i
) {
6632 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
6634 div
= isl_aff_get_div(aff
, i
);
6635 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6636 isl_multi_pw_aff_copy(mpa
), div
);
6637 pa_i
= isl_pw_aff_floor(pa_i
);
6638 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
6639 pa_i
= isl_pw_aff_scale_val(pa_i
, v
);
6640 pa
= isl_pw_aff_add(pa
, pa_i
);
6643 isl_multi_pw_aff_free(mpa
);
6649 /* Apply "aff" to "mpa". The range of "mpa" needs to be compatible
6650 * with the domain of "aff". The domain of the result is the same
6653 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_aff(
6654 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_aff
*aff
)
6658 if (isl_space_match(aff
->ls
->dim
, isl_dim_param
,
6659 mpa
->space
, isl_dim_param
))
6660 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6662 aff
= isl_aff_align_params(aff
, isl_multi_pw_aff_get_space(mpa
));
6663 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_aff_get_space(aff
));
6665 return isl_multi_pw_aff_apply_aff_aligned(mpa
, aff
);
6668 isl_multi_pw_aff_free(mpa
);
6672 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6673 * with the domain of "pa". The domain of the result is the same
6675 * "mpa" and "pa" are assumed to have been aligned.
6677 * We consider each piece in turn. Note that the domains of the
6678 * pieces are assumed to be disjoint and they remain disjoint
6679 * after taking the preimage (over the same function).
6681 static __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff_aligned(
6682 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6691 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa
),
6692 isl_pw_aff_get_space(pa
));
6693 res
= isl_pw_aff_empty(space
);
6695 for (i
= 0; i
< pa
->n
; ++i
) {
6699 pa_i
= isl_multi_pw_aff_apply_aff_aligned(
6700 isl_multi_pw_aff_copy(mpa
),
6701 isl_aff_copy(pa
->p
[i
].aff
));
6702 domain
= isl_set_copy(pa
->p
[i
].set
);
6703 domain
= isl_set_preimage_multi_pw_aff(domain
,
6704 isl_multi_pw_aff_copy(mpa
));
6705 pa_i
= isl_pw_aff_intersect_domain(pa_i
, domain
);
6706 res
= isl_pw_aff_add_disjoint(res
, pa_i
);
6709 isl_pw_aff_free(pa
);
6710 isl_multi_pw_aff_free(mpa
);
6713 isl_pw_aff_free(pa
);
6714 isl_multi_pw_aff_free(mpa
);
6718 /* Apply "pa" to "mpa". The range of "mpa" needs to be compatible
6719 * with the domain of "pa". The domain of the result is the same
6722 __isl_give isl_pw_aff
*isl_multi_pw_aff_apply_pw_aff(
6723 __isl_take isl_multi_pw_aff
*mpa
, __isl_take isl_pw_aff
*pa
)
6727 if (isl_space_match(pa
->dim
, isl_dim_param
, mpa
->space
, isl_dim_param
))
6728 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6730 pa
= isl_pw_aff_align_params(pa
, isl_multi_pw_aff_get_space(mpa
));
6731 mpa
= isl_multi_pw_aff_align_params(mpa
, isl_pw_aff_get_space(pa
));
6733 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6735 isl_pw_aff_free(pa
);
6736 isl_multi_pw_aff_free(mpa
);
6740 /* Compute the pullback of "pa" by the function represented by "mpa".
6741 * In other words, plug in "mpa" in "pa".
6742 * "pa" and "mpa" are assumed to have been aligned.
6744 * The pullback is computed by applying "pa" to "mpa".
6746 static __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff_aligned(
6747 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6749 return isl_multi_pw_aff_apply_pw_aff_aligned(mpa
, pa
);
6752 /* Compute the pullback of "pa" by the function represented by "mpa".
6753 * In other words, plug in "mpa" in "pa".
6755 * The pullback is computed by applying "pa" to "mpa".
6757 __isl_give isl_pw_aff
*isl_pw_aff_pullback_multi_pw_aff(
6758 __isl_take isl_pw_aff
*pa
, __isl_take isl_multi_pw_aff
*mpa
)
6760 return isl_multi_pw_aff_apply_pw_aff(mpa
, pa
);
6763 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6764 * In other words, plug in "mpa2" in "mpa1".
6766 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6768 * We pullback each member of "mpa1" in turn.
6770 static __isl_give isl_multi_pw_aff
*
6771 isl_multi_pw_aff_pullback_multi_pw_aff_aligned(
6772 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6775 isl_space
*space
= NULL
;
6777 mpa1
= isl_multi_pw_aff_cow(mpa1
);
6781 space
= isl_space_join(isl_multi_pw_aff_get_space(mpa2
),
6782 isl_multi_pw_aff_get_space(mpa1
));
6784 for (i
= 0; i
< mpa1
->n
; ++i
) {
6785 mpa1
->p
[i
] = isl_pw_aff_pullback_multi_pw_aff_aligned(
6786 mpa1
->p
[i
], isl_multi_pw_aff_copy(mpa2
));
6791 mpa1
= isl_multi_pw_aff_reset_space(mpa1
, space
);
6793 isl_multi_pw_aff_free(mpa2
);
6796 isl_space_free(space
);
6797 isl_multi_pw_aff_free(mpa1
);
6798 isl_multi_pw_aff_free(mpa2
);
6802 /* Compute the pullback of "mpa1" by the function represented by "mpa2".
6803 * In other words, plug in "mpa2" in "mpa1".
6805 __isl_give isl_multi_pw_aff
*isl_multi_pw_aff_pullback_multi_pw_aff(
6806 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6808 return isl_multi_pw_aff_align_params_multi_multi_and(mpa1
, mpa2
,
6809 &isl_multi_pw_aff_pullback_multi_pw_aff_aligned
);
6812 /* Align the parameters of "mpa1" and "mpa2", check that the ranges
6813 * of "mpa1" and "mpa2" live in the same space, construct map space
6814 * between the domain spaces of "mpa1" and "mpa2" and call "order"
6815 * with this map space as extract argument.
6817 static __isl_give isl_map
*isl_multi_pw_aff_order_map(
6818 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6819 __isl_give isl_map
*(*order
)(__isl_keep isl_multi_pw_aff
*mpa1
,
6820 __isl_keep isl_multi_pw_aff
*mpa2
, __isl_take isl_space
*space
))
6823 isl_space
*space1
, *space2
;
6826 mpa1
= isl_multi_pw_aff_align_params(mpa1
,
6827 isl_multi_pw_aff_get_space(mpa2
));
6828 mpa2
= isl_multi_pw_aff_align_params(mpa2
,
6829 isl_multi_pw_aff_get_space(mpa1
));
6832 match
= isl_space_tuple_is_equal(mpa1
->space
, isl_dim_out
,
6833 mpa2
->space
, isl_dim_out
);
6837 isl_die(isl_multi_pw_aff_get_ctx(mpa1
), isl_error_invalid
,
6838 "range spaces don't match", goto error
);
6839 space1
= isl_space_domain(isl_multi_pw_aff_get_space(mpa1
));
6840 space2
= isl_space_domain(isl_multi_pw_aff_get_space(mpa2
));
6841 space1
= isl_space_map_from_domain_and_range(space1
, space2
);
6843 res
= order(mpa1
, mpa2
, space1
);
6844 isl_multi_pw_aff_free(mpa1
);
6845 isl_multi_pw_aff_free(mpa2
);
6848 isl_multi_pw_aff_free(mpa1
);
6849 isl_multi_pw_aff_free(mpa2
);
6853 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6854 * where the function values are equal. "space" is the space of the result.
6855 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6857 * "mpa1" and "mpa2" are equal when each of the pairs of elements
6858 * in the sequences are equal.
6860 static __isl_give isl_map
*isl_multi_pw_aff_eq_map_on_space(
6861 __isl_keep isl_multi_pw_aff
*mpa1
, __isl_keep isl_multi_pw_aff
*mpa2
,
6862 __isl_take isl_space
*space
)
6867 res
= isl_map_universe(space
);
6869 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
6870 for (i
= 0; i
< n
; ++i
) {
6871 isl_pw_aff
*pa1
, *pa2
;
6874 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6875 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6876 map
= isl_pw_aff_eq_map(pa1
, pa2
);
6877 res
= isl_map_intersect(res
, map
);
6883 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6884 * where the function values are equal.
6886 __isl_give isl_map
*isl_multi_pw_aff_eq_map(__isl_take isl_multi_pw_aff
*mpa1
,
6887 __isl_take isl_multi_pw_aff
*mpa2
)
6889 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
6890 &isl_multi_pw_aff_eq_map_on_space
);
6893 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6894 * where the function values of "mpa1" is lexicographically satisfies "base"
6895 * compared to that of "mpa2". "space" is the space of the result.
6896 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6898 * "mpa1" lexicographically satisfies "base" compared to "mpa2"
6899 * if its i-th element satisfies "base" when compared to
6900 * the i-th element of "mpa2" while all previous elements are
6903 static __isl_give isl_map
*isl_multi_pw_aff_lex_map_on_space(
6904 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6905 __isl_give isl_map
*(*base
)(__isl_take isl_pw_aff
*pa1
,
6906 __isl_take isl_pw_aff
*pa2
),
6907 __isl_take isl_space
*space
)
6910 isl_map
*res
, *rest
;
6912 res
= isl_map_empty(isl_space_copy(space
));
6913 rest
= isl_map_universe(space
);
6915 n
= isl_multi_pw_aff_dim(mpa1
, isl_dim_out
);
6916 for (i
= 0; i
< n
; ++i
) {
6917 isl_pw_aff
*pa1
, *pa2
;
6920 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6921 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6922 map
= base(pa1
, pa2
);
6923 map
= isl_map_intersect(map
, isl_map_copy(rest
));
6924 res
= isl_map_union(res
, map
);
6929 pa1
= isl_multi_pw_aff_get_pw_aff(mpa1
, i
);
6930 pa2
= isl_multi_pw_aff_get_pw_aff(mpa2
, i
);
6931 map
= isl_pw_aff_eq_map(pa1
, pa2
);
6932 rest
= isl_map_intersect(rest
, map
);
6939 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6940 * where the function value of "mpa1" is lexicographically less than that
6941 * of "mpa2". "space" is the space of the result.
6942 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6944 * "mpa1" is less than "mpa2" if its i-th element is smaller
6945 * than the i-th element of "mpa2" while all previous elements are
6948 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map_on_space(
6949 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6950 __isl_take isl_space
*space
)
6952 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
6953 &isl_pw_aff_lt_map
, space
);
6956 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6957 * where the function value of "mpa1" is lexicographically less than that
6960 __isl_give isl_map
*isl_multi_pw_aff_lex_lt_map(
6961 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6963 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
6964 &isl_multi_pw_aff_lex_lt_map_on_space
);
6967 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6968 * where the function value of "mpa1" is lexicographically greater than that
6969 * of "mpa2". "space" is the space of the result.
6970 * The parameters of "mpa1" and "mpa2" are assumed to have been aligned.
6972 * "mpa1" is greater than "mpa2" if its i-th element is greater
6973 * than the i-th element of "mpa2" while all previous elements are
6976 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map_on_space(
6977 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
,
6978 __isl_take isl_space
*space
)
6980 return isl_multi_pw_aff_lex_map_on_space(mpa1
, mpa2
,
6981 &isl_pw_aff_gt_map
, space
);
6984 /* Return a map containing pairs of elements in the domains of "mpa1" and "mpa2"
6985 * where the function value of "mpa1" is lexicographically greater than that
6988 __isl_give isl_map
*isl_multi_pw_aff_lex_gt_map(
6989 __isl_take isl_multi_pw_aff
*mpa1
, __isl_take isl_multi_pw_aff
*mpa2
)
6991 return isl_multi_pw_aff_order_map(mpa1
, mpa2
,
6992 &isl_multi_pw_aff_lex_gt_map_on_space
);
6995 /* Compare two isl_affs.
6997 * Return -1 if "aff1" is "smaller" than "aff2", 1 if "aff1" is "greater"
6998 * than "aff2" and 0 if they are equal.
7000 * The order is fairly arbitrary. We do consider expressions that only involve
7001 * earlier dimensions as "smaller".
7003 int isl_aff_plain_cmp(__isl_keep isl_aff
*aff1
, __isl_keep isl_aff
*aff2
)
7016 cmp
= isl_local_space_cmp(aff1
->ls
, aff2
->ls
);
7020 last1
= isl_seq_last_non_zero(aff1
->v
->el
+ 1, aff1
->v
->size
- 1);
7021 last2
= isl_seq_last_non_zero(aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
7023 return last1
- last2
;
7025 return isl_seq_cmp(aff1
->v
->el
, aff2
->v
->el
, aff1
->v
->size
);
7028 /* Compare two isl_pw_affs.
7030 * Return -1 if "pa1" is "smaller" than "pa2", 1 if "pa1" is "greater"
7031 * than "pa2" and 0 if they are equal.
7033 * The order is fairly arbitrary. We do consider expressions that only involve
7034 * earlier dimensions as "smaller".
7036 int isl_pw_aff_plain_cmp(__isl_keep isl_pw_aff
*pa1
,
7037 __isl_keep isl_pw_aff
*pa2
)
7050 cmp
= isl_space_cmp(pa1
->dim
, pa2
->dim
);
7054 if (pa1
->n
!= pa2
->n
)
7055 return pa1
->n
- pa2
->n
;
7057 for (i
= 0; i
< pa1
->n
; ++i
) {
7058 cmp
= isl_set_plain_cmp(pa1
->p
[i
].set
, pa2
->p
[i
].set
);
7061 cmp
= isl_aff_plain_cmp(pa1
->p
[i
].aff
, pa2
->p
[i
].aff
);
7069 /* Return a piecewise affine expression that is equal to "v" on "domain".
7071 __isl_give isl_pw_aff
*isl_pw_aff_val_on_domain(__isl_take isl_set
*domain
,
7072 __isl_take isl_val
*v
)
7075 isl_local_space
*ls
;
7078 space
= isl_set_get_space(domain
);
7079 ls
= isl_local_space_from_space(space
);
7080 aff
= isl_aff_val_on_domain(ls
, v
);
7082 return isl_pw_aff_alloc(domain
, aff
);
7085 /* Return a multi affine expression that is equal to "mv" on domain
7088 __isl_give isl_multi_aff
*isl_multi_aff_multi_val_on_space(
7089 __isl_take isl_space
*space
, __isl_take isl_multi_val
*mv
)
7093 isl_local_space
*ls
;
7099 n
= isl_multi_val_dim(mv
, isl_dim_set
);
7100 space2
= isl_multi_val_get_space(mv
);
7101 space2
= isl_space_align_params(space2
, isl_space_copy(space
));
7102 space
= isl_space_align_params(space
, isl_space_copy(space2
));
7103 space
= isl_space_map_from_domain_and_range(space
, space2
);
7104 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
7105 ls
= isl_local_space_from_space(isl_space_domain(space
));
7106 for (i
= 0; i
< n
; ++i
) {
7110 v
= isl_multi_val_get_val(mv
, i
);
7111 aff
= isl_aff_val_on_domain(isl_local_space_copy(ls
), v
);
7112 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
7114 isl_local_space_free(ls
);
7116 isl_multi_val_free(mv
);
7119 isl_space_free(space
);
7120 isl_multi_val_free(mv
);
7124 /* Return a piecewise multi-affine expression
7125 * that is equal to "mv" on "domain".
7127 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_multi_val_on_domain(
7128 __isl_take isl_set
*domain
, __isl_take isl_multi_val
*mv
)
7133 space
= isl_set_get_space(domain
);
7134 ma
= isl_multi_aff_multi_val_on_space(space
, mv
);
7136 return isl_pw_multi_aff_alloc(domain
, ma
);
7139 /* Internal data structure for isl_union_pw_multi_aff_multi_val_on_domain.
7140 * mv is the value that should be attained on each domain set
7141 * res collects the results
7143 struct isl_union_pw_multi_aff_multi_val_on_domain_data
{
7145 isl_union_pw_multi_aff
*res
;
7148 /* Create an isl_pw_multi_aff equal to data->mv on "domain"
7149 * and add it to data->res.
7151 static isl_stat
pw_multi_aff_multi_val_on_domain(__isl_take isl_set
*domain
,
7154 struct isl_union_pw_multi_aff_multi_val_on_domain_data
*data
= user
;
7155 isl_pw_multi_aff
*pma
;
7158 mv
= isl_multi_val_copy(data
->mv
);
7159 pma
= isl_pw_multi_aff_multi_val_on_domain(domain
, mv
);
7160 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
7162 return data
->res
? isl_stat_ok
: isl_stat_error
;
7165 /* Return a union piecewise multi-affine expression
7166 * that is equal to "mv" on "domain".
7168 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_multi_val_on_domain(
7169 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7171 struct isl_union_pw_multi_aff_multi_val_on_domain_data data
;
7174 space
= isl_union_set_get_space(domain
);
7175 data
.res
= isl_union_pw_multi_aff_empty(space
);
7177 if (isl_union_set_foreach_set(domain
,
7178 &pw_multi_aff_multi_val_on_domain
, &data
) < 0)
7179 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
7180 isl_union_set_free(domain
);
7181 isl_multi_val_free(mv
);
7185 /* Compute the pullback of data->pma by the function represented by "pma2",
7186 * provided the spaces match, and add the results to data->res.
7188 static isl_stat
pullback_entry(__isl_take isl_pw_multi_aff
*pma2
, void *user
)
7190 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
7192 if (!isl_space_tuple_is_equal(data
->pma
->dim
, isl_dim_in
,
7193 pma2
->dim
, isl_dim_out
)) {
7194 isl_pw_multi_aff_free(pma2
);
7198 pma2
= isl_pw_multi_aff_pullback_pw_multi_aff(
7199 isl_pw_multi_aff_copy(data
->pma
), pma2
);
7201 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
7203 return isl_stat_error
;
7208 /* Compute the pullback of "upma1" by the function represented by "upma2".
7210 __isl_give isl_union_pw_multi_aff
*
7211 isl_union_pw_multi_aff_pullback_union_pw_multi_aff(
7212 __isl_take isl_union_pw_multi_aff
*upma1
,
7213 __isl_take isl_union_pw_multi_aff
*upma2
)
7215 return bin_op(upma1
, upma2
, &pullback_entry
);
7218 /* Check that the domain space of "upa" matches "space".
7220 * Return 0 on success and -1 on error.
7222 * This function is called from isl_multi_union_pw_aff_set_union_pw_aff and
7223 * can in principle never fail since the space "space" is that
7224 * of the isl_multi_union_pw_aff and is a set space such that
7225 * there is no domain space to match.
7227 * We check the parameters and double-check that "space" is
7228 * indeed that of a set.
7230 static int isl_union_pw_aff_check_match_domain_space(
7231 __isl_keep isl_union_pw_aff
*upa
, __isl_keep isl_space
*space
)
7233 isl_space
*upa_space
;
7239 match
= isl_space_is_set(space
);
7243 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7244 "expecting set space", return -1);
7246 upa_space
= isl_union_pw_aff_get_space(upa
);
7247 match
= isl_space_match(space
, isl_dim_param
, upa_space
, isl_dim_param
);
7251 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7252 "parameters don't match", goto error
);
7254 isl_space_free(upa_space
);
7257 isl_space_free(upa_space
);
7261 /* Do the parameters of "upa" match those of "space"?
7263 static int isl_union_pw_aff_matching_params(__isl_keep isl_union_pw_aff
*upa
,
7264 __isl_keep isl_space
*space
)
7266 isl_space
*upa_space
;
7272 upa_space
= isl_union_pw_aff_get_space(upa
);
7274 match
= isl_space_match(space
, isl_dim_param
, upa_space
, isl_dim_param
);
7276 isl_space_free(upa_space
);
7280 /* Internal data structure for isl_union_pw_aff_reset_domain_space.
7281 * space represents the new parameters.
7282 * res collects the results.
7284 struct isl_union_pw_aff_reset_params_data
{
7286 isl_union_pw_aff
*res
;
7289 /* Replace the parameters of "pa" by data->space and
7290 * add the result to data->res.
7292 static isl_stat
reset_params(__isl_take isl_pw_aff
*pa
, void *user
)
7294 struct isl_union_pw_aff_reset_params_data
*data
= user
;
7297 space
= isl_pw_aff_get_space(pa
);
7298 space
= isl_space_replace(space
, isl_dim_param
, data
->space
);
7299 pa
= isl_pw_aff_reset_space(pa
, space
);
7300 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7302 return data
->res
? isl_stat_ok
: isl_stat_error
;
7305 /* Replace the domain space of "upa" by "space".
7306 * Since a union expression does not have a (single) domain space,
7307 * "space" is necessarily a parameter space.
7309 * Since the order and the names of the parameters determine
7310 * the hash value, we need to create a new hash table.
7312 static __isl_give isl_union_pw_aff
*isl_union_pw_aff_reset_domain_space(
7313 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_space
*space
)
7315 struct isl_union_pw_aff_reset_params_data data
= { space
};
7318 match
= isl_union_pw_aff_matching_params(upa
, space
);
7320 upa
= isl_union_pw_aff_free(upa
);
7322 isl_space_free(space
);
7326 data
.res
= isl_union_pw_aff_empty(isl_space_copy(space
));
7327 if (isl_union_pw_aff_foreach_pw_aff(upa
, &reset_params
, &data
) < 0)
7328 data
.res
= isl_union_pw_aff_free(data
.res
);
7330 isl_union_pw_aff_free(upa
);
7331 isl_space_free(space
);
7335 /* Return the floor of "pa".
7337 static __isl_give isl_pw_aff
*floor_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7339 return isl_pw_aff_floor(pa
);
7342 /* Given f, return floor(f).
7344 __isl_give isl_union_pw_aff
*isl_union_pw_aff_floor(
7345 __isl_take isl_union_pw_aff
*upa
)
7347 return isl_union_pw_aff_transform_inplace(upa
, &floor_entry
, NULL
);
7352 * upa mod m = upa - m * floor(upa/m)
7354 * with m an integer value.
7356 __isl_give isl_union_pw_aff
*isl_union_pw_aff_mod_val(
7357 __isl_take isl_union_pw_aff
*upa
, __isl_take isl_val
*m
)
7359 isl_union_pw_aff
*res
;
7364 if (!isl_val_is_int(m
))
7365 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7366 "expecting integer modulo", goto error
);
7367 if (!isl_val_is_pos(m
))
7368 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
7369 "expecting positive modulo", goto error
);
7371 res
= isl_union_pw_aff_copy(upa
);
7372 upa
= isl_union_pw_aff_scale_down_val(upa
, isl_val_copy(m
));
7373 upa
= isl_union_pw_aff_floor(upa
);
7374 upa
= isl_union_pw_aff_scale_val(upa
, m
);
7375 res
= isl_union_pw_aff_sub(res
, upa
);
7380 isl_union_pw_aff_free(upa
);
7384 /* Internal data structure for isl_union_pw_aff_aff_on_domain.
7385 * "aff" is the symbolic value that the resulting isl_union_pw_aff
7387 * "res" collects the results.
7389 struct isl_union_pw_aff_aff_on_domain_data
{
7391 isl_union_pw_aff
*res
;
7394 /* Construct a piecewise affine expression that is equal to data->aff
7395 * on "domain" and add the result to data->res.
7397 static isl_stat
pw_aff_aff_on_domain(__isl_take isl_set
*domain
, void *user
)
7399 struct isl_union_pw_aff_aff_on_domain_data
*data
= user
;
7404 aff
= isl_aff_copy(data
->aff
);
7405 dim
= isl_set_dim(domain
, isl_dim_set
);
7406 aff
= isl_aff_add_dims(aff
, isl_dim_in
, dim
);
7407 aff
= isl_aff_reset_domain_space(aff
, isl_set_get_space(domain
));
7408 pa
= isl_pw_aff_alloc(domain
, aff
);
7409 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7411 return data
->res
? isl_stat_ok
: isl_stat_error
;
7414 /* Internal data structure for isl_union_pw_multi_aff_get_union_pw_aff.
7415 * pos is the output position that needs to be extracted.
7416 * res collects the results.
7418 struct isl_union_pw_multi_aff_get_union_pw_aff_data
{
7420 isl_union_pw_aff
*res
;
7423 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma"
7424 * (assuming it has such a dimension) and add it to data->res.
7426 static isl_stat
get_union_pw_aff(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7428 struct isl_union_pw_multi_aff_get_union_pw_aff_data
*data
= user
;
7433 return isl_stat_error
;
7435 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
7436 if (data
->pos
>= n_out
) {
7437 isl_pw_multi_aff_free(pma
);
7441 pa
= isl_pw_multi_aff_get_pw_aff(pma
, data
->pos
);
7442 isl_pw_multi_aff_free(pma
);
7444 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7446 return data
->res
? isl_stat_ok
: isl_stat_error
;
7449 /* Extract an isl_union_pw_aff corresponding to
7450 * output dimension "pos" of "upma".
7452 __isl_give isl_union_pw_aff
*isl_union_pw_multi_aff_get_union_pw_aff(
7453 __isl_keep isl_union_pw_multi_aff
*upma
, int pos
)
7455 struct isl_union_pw_multi_aff_get_union_pw_aff_data data
;
7462 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7463 "cannot extract at negative position", return NULL
);
7465 space
= isl_union_pw_multi_aff_get_space(upma
);
7466 data
.res
= isl_union_pw_aff_empty(space
);
7468 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
7469 &get_union_pw_aff
, &data
) < 0)
7470 data
.res
= isl_union_pw_aff_free(data
.res
);
7475 /* Return a union piecewise affine expression
7476 * that is equal to "aff" on "domain".
7478 * Construct an isl_pw_aff on each of the sets in "domain" and
7479 * collect the results.
7481 __isl_give isl_union_pw_aff
*isl_union_pw_aff_aff_on_domain(
7482 __isl_take isl_union_set
*domain
, __isl_take isl_aff
*aff
)
7484 struct isl_union_pw_aff_aff_on_domain_data data
;
7487 if (!domain
|| !aff
)
7489 if (!isl_local_space_is_params(aff
->ls
))
7490 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
7491 "expecting parametric expression", goto error
);
7493 space
= isl_union_set_get_space(domain
);
7494 data
.res
= isl_union_pw_aff_empty(space
);
7496 if (isl_union_set_foreach_set(domain
, &pw_aff_aff_on_domain
, &data
) < 0)
7497 data
.res
= isl_union_pw_aff_free(data
.res
);
7498 isl_union_set_free(domain
);
7502 isl_union_set_free(domain
);
7507 /* Internal data structure for isl_union_pw_aff_val_on_domain.
7508 * "v" is the value that the resulting isl_union_pw_aff needs to attain.
7509 * "res" collects the results.
7511 struct isl_union_pw_aff_val_on_domain_data
{
7513 isl_union_pw_aff
*res
;
7516 /* Construct a piecewise affine expression that is equal to data->v
7517 * on "domain" and add the result to data->res.
7519 static isl_stat
pw_aff_val_on_domain(__isl_take isl_set
*domain
, void *user
)
7521 struct isl_union_pw_aff_val_on_domain_data
*data
= user
;
7525 v
= isl_val_copy(data
->v
);
7526 pa
= isl_pw_aff_val_on_domain(domain
, v
);
7527 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7529 return data
->res
? isl_stat_ok
: isl_stat_error
;
7532 /* Return a union piecewise affine expression
7533 * that is equal to "v" on "domain".
7535 * Construct an isl_pw_aff on each of the sets in "domain" and
7536 * collect the results.
7538 __isl_give isl_union_pw_aff
*isl_union_pw_aff_val_on_domain(
7539 __isl_take isl_union_set
*domain
, __isl_take isl_val
*v
)
7541 struct isl_union_pw_aff_val_on_domain_data data
;
7544 space
= isl_union_set_get_space(domain
);
7545 data
.res
= isl_union_pw_aff_empty(space
);
7547 if (isl_union_set_foreach_set(domain
, &pw_aff_val_on_domain
, &data
) < 0)
7548 data
.res
= isl_union_pw_aff_free(data
.res
);
7549 isl_union_set_free(domain
);
7554 /* Construct a piecewise multi affine expression
7555 * that is equal to "pa" and add it to upma.
7557 static isl_stat
pw_multi_aff_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
,
7560 isl_union_pw_multi_aff
**upma
= user
;
7561 isl_pw_multi_aff
*pma
;
7563 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
7564 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
7566 return *upma
? isl_stat_ok
: isl_stat_error
;
7569 /* Construct and return a union piecewise multi affine expression
7570 * that is equal to the given union piecewise affine expression.
7572 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_pw_aff(
7573 __isl_take isl_union_pw_aff
*upa
)
7576 isl_union_pw_multi_aff
*upma
;
7581 space
= isl_union_pw_aff_get_space(upa
);
7582 upma
= isl_union_pw_multi_aff_empty(space
);
7584 if (isl_union_pw_aff_foreach_pw_aff(upa
,
7585 &pw_multi_aff_from_pw_aff_entry
, &upma
) < 0)
7586 upma
= isl_union_pw_multi_aff_free(upma
);
7588 isl_union_pw_aff_free(upa
);
7592 /* Compute the set of elements in the domain of "pa" where it is zero and
7593 * add this set to "uset".
7595 static isl_stat
zero_union_set(__isl_take isl_pw_aff
*pa
, void *user
)
7597 isl_union_set
**uset
= (isl_union_set
**)user
;
7599 *uset
= isl_union_set_add_set(*uset
, isl_pw_aff_zero_set(pa
));
7601 return *uset
? isl_stat_ok
: isl_stat_error
;
7604 /* Return a union set containing those elements in the domain
7605 * of "upa" where it is zero.
7607 __isl_give isl_union_set
*isl_union_pw_aff_zero_union_set(
7608 __isl_take isl_union_pw_aff
*upa
)
7610 isl_union_set
*zero
;
7612 zero
= isl_union_set_empty(isl_union_pw_aff_get_space(upa
));
7613 if (isl_union_pw_aff_foreach_pw_aff(upa
, &zero_union_set
, &zero
) < 0)
7614 zero
= isl_union_set_free(zero
);
7616 isl_union_pw_aff_free(upa
);
7620 /* Convert "pa" to an isl_map and add it to *umap.
7622 static isl_stat
map_from_pw_aff_entry(__isl_take isl_pw_aff
*pa
, void *user
)
7624 isl_union_map
**umap
= user
;
7627 map
= isl_map_from_pw_aff(pa
);
7628 *umap
= isl_union_map_add_map(*umap
, map
);
7630 return *umap
? isl_stat_ok
: isl_stat_error
;
7633 /* Construct a union map mapping the domain of the union
7634 * piecewise affine expression to its range, with the single output dimension
7635 * equated to the corresponding affine expressions on their cells.
7637 __isl_give isl_union_map
*isl_union_map_from_union_pw_aff(
7638 __isl_take isl_union_pw_aff
*upa
)
7641 isl_union_map
*umap
;
7646 space
= isl_union_pw_aff_get_space(upa
);
7647 umap
= isl_union_map_empty(space
);
7649 if (isl_union_pw_aff_foreach_pw_aff(upa
, &map_from_pw_aff_entry
,
7651 umap
= isl_union_map_free(umap
);
7653 isl_union_pw_aff_free(upa
);
7657 /* Internal data structure for isl_union_pw_aff_pullback_union_pw_multi_aff.
7658 * upma is the function that is plugged in.
7659 * pa is the current part of the function in which upma is plugged in.
7660 * res collects the results.
7662 struct isl_union_pw_aff_pullback_upma_data
{
7663 isl_union_pw_multi_aff
*upma
;
7665 isl_union_pw_aff
*res
;
7668 /* Check if "pma" can be plugged into data->pa.
7669 * If so, perform the pullback and add the result to data->res.
7671 static isl_stat
pa_pb_pma(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7673 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7676 if (!isl_space_tuple_is_equal(data
->pa
->dim
, isl_dim_in
,
7677 pma
->dim
, isl_dim_out
)) {
7678 isl_pw_multi_aff_free(pma
);
7682 pa
= isl_pw_aff_copy(data
->pa
);
7683 pa
= isl_pw_aff_pullback_pw_multi_aff(pa
, pma
);
7685 data
->res
= isl_union_pw_aff_add_pw_aff(data
->res
, pa
);
7687 return data
->res
? isl_stat_ok
: isl_stat_error
;
7690 /* Check if any of the elements of data->upma can be plugged into pa,
7691 * add if so add the result to data->res.
7693 static isl_stat
upa_pb_upma(__isl_take isl_pw_aff
*pa
, void *user
)
7695 struct isl_union_pw_aff_pullback_upma_data
*data
= user
;
7699 r
= isl_union_pw_multi_aff_foreach_pw_multi_aff(data
->upma
,
7701 isl_pw_aff_free(pa
);
7706 /* Compute the pullback of "upa" by the function represented by "upma".
7707 * In other words, plug in "upma" in "upa". The result contains
7708 * expressions defined over the domain space of "upma".
7710 * Run over all pairs of elements in "upa" and "upma", perform
7711 * the pullback when appropriate and collect the results.
7712 * If the hash value were based on the domain space rather than
7713 * the function space, then we could run through all elements
7714 * of "upma" and directly pick out the corresponding element of "upa".
7716 __isl_give isl_union_pw_aff
*isl_union_pw_aff_pullback_union_pw_multi_aff(
7717 __isl_take isl_union_pw_aff
*upa
,
7718 __isl_take isl_union_pw_multi_aff
*upma
)
7720 struct isl_union_pw_aff_pullback_upma_data data
= { NULL
, NULL
};
7723 space
= isl_union_pw_multi_aff_get_space(upma
);
7724 upa
= isl_union_pw_aff_align_params(upa
, space
);
7725 space
= isl_union_pw_aff_get_space(upa
);
7726 upma
= isl_union_pw_multi_aff_align_params(upma
, space
);
7732 data
.res
= isl_union_pw_aff_alloc_same_size(upa
);
7733 if (isl_union_pw_aff_foreach_pw_aff(upa
, &upa_pb_upma
, &data
) < 0)
7734 data
.res
= isl_union_pw_aff_free(data
.res
);
7736 isl_union_pw_aff_free(upa
);
7737 isl_union_pw_multi_aff_free(upma
);
7740 isl_union_pw_aff_free(upa
);
7741 isl_union_pw_multi_aff_free(upma
);
7746 #define BASE union_pw_aff
7748 #define DOMBASE union_set
7750 #define NO_MOVE_DIMS
7759 #include <isl_multi_templ.c>
7760 #include <isl_multi_apply_set.c>
7761 #include <isl_multi_apply_union_set.c>
7762 #include <isl_multi_coalesce.c>
7763 #include <isl_multi_floor.c>
7764 #include <isl_multi_gist.c>
7765 #include <isl_multi_intersect.c>
7767 /* Construct a multiple union piecewise affine expression
7768 * in the given space with value zero in each of the output dimensions.
7770 * Since there is no canonical zero value for
7771 * a union piecewise affine expression, we can only construct
7772 * zero-dimensional "zero" value.
7774 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_zero(
7775 __isl_take isl_space
*space
)
7780 if (!isl_space_is_set(space
))
7781 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7782 "expecting set space", goto error
);
7783 if (isl_space_dim(space
, isl_dim_out
) != 0)
7784 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
7785 "expecting 0D space", goto error
);
7787 return isl_multi_union_pw_aff_alloc(space
);
7789 isl_space_free(space
);
7793 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
7794 * with the actual sum on the shared domain and
7795 * the defined expression on the symmetric difference of the domains.
7797 * We simply iterate over the elements in both arguments and
7798 * call isl_union_pw_aff_union_add on each of them.
7800 static __isl_give isl_multi_union_pw_aff
*
7801 isl_multi_union_pw_aff_union_add_aligned(
7802 __isl_take isl_multi_union_pw_aff
*mupa1
,
7803 __isl_take isl_multi_union_pw_aff
*mupa2
)
7805 return isl_multi_union_pw_aff_bin_op(mupa1
, mupa2
,
7806 &isl_union_pw_aff_union_add
);
7809 /* Compute the sum of "mupa1" and "mupa2" on the union of their domains,
7810 * with the actual sum on the shared domain and
7811 * the defined expression on the symmetric difference of the domains.
7813 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_union_add(
7814 __isl_take isl_multi_union_pw_aff
*mupa1
,
7815 __isl_take isl_multi_union_pw_aff
*mupa2
)
7817 return isl_multi_union_pw_aff_align_params_multi_multi_and(mupa1
, mupa2
,
7818 &isl_multi_union_pw_aff_union_add_aligned
);
7821 /* Construct and return a multi union piecewise affine expression
7822 * that is equal to the given multi affine expression.
7824 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_aff(
7825 __isl_take isl_multi_aff
*ma
)
7827 isl_multi_pw_aff
*mpa
;
7829 mpa
= isl_multi_pw_aff_from_multi_aff(ma
);
7830 return isl_multi_union_pw_aff_from_multi_pw_aff(mpa
);
7833 /* Construct and return a multi union piecewise affine expression
7834 * that is equal to the given multi piecewise affine expression.
7836 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_multi_pw_aff(
7837 __isl_take isl_multi_pw_aff
*mpa
)
7841 isl_multi_union_pw_aff
*mupa
;
7846 space
= isl_multi_pw_aff_get_space(mpa
);
7847 space
= isl_space_range(space
);
7848 mupa
= isl_multi_union_pw_aff_alloc(space
);
7850 n
= isl_multi_pw_aff_dim(mpa
, isl_dim_out
);
7851 for (i
= 0; i
< n
; ++i
) {
7853 isl_union_pw_aff
*upa
;
7855 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
7856 upa
= isl_union_pw_aff_from_pw_aff(pa
);
7857 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7860 isl_multi_pw_aff_free(mpa
);
7865 /* Extract the range space of "pma" and assign it to *space.
7866 * If *space has already been set (through a previous call to this function),
7867 * then check that the range space is the same.
7869 static isl_stat
extract_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
7871 isl_space
**space
= user
;
7872 isl_space
*pma_space
;
7875 pma_space
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
7876 isl_pw_multi_aff_free(pma
);
7879 return isl_stat_error
;
7885 equal
= isl_space_is_equal(pma_space
, *space
);
7886 isl_space_free(pma_space
);
7889 return isl_stat_error
;
7891 isl_die(isl_space_get_ctx(*space
), isl_error_invalid
,
7892 "range spaces not the same", return isl_stat_error
);
7896 /* Construct and return a multi union piecewise affine expression
7897 * that is equal to the given union piecewise multi affine expression.
7899 * In order to be able to perform the conversion, the input
7900 * needs to be non-empty and may only involve a single range space.
7902 __isl_give isl_multi_union_pw_aff
*
7903 isl_multi_union_pw_aff_from_union_pw_multi_aff(
7904 __isl_take isl_union_pw_multi_aff
*upma
)
7906 isl_space
*space
= NULL
;
7907 isl_multi_union_pw_aff
*mupa
;
7912 if (isl_union_pw_multi_aff_n_pw_multi_aff(upma
) == 0)
7913 isl_die(isl_union_pw_multi_aff_get_ctx(upma
), isl_error_invalid
,
7914 "cannot extract range space from empty input",
7916 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
, &extract_space
,
7923 n
= isl_space_dim(space
, isl_dim_set
);
7924 mupa
= isl_multi_union_pw_aff_alloc(space
);
7926 for (i
= 0; i
< n
; ++i
) {
7927 isl_union_pw_aff
*upa
;
7929 upa
= isl_union_pw_multi_aff_get_union_pw_aff(upma
, i
);
7930 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7933 isl_union_pw_multi_aff_free(upma
);
7936 isl_space_free(space
);
7937 isl_union_pw_multi_aff_free(upma
);
7941 /* Try and create an isl_multi_union_pw_aff that is equivalent
7942 * to the given isl_union_map.
7943 * The isl_union_map is required to be single-valued in each space.
7944 * Moreover, it cannot be empty and all range spaces need to be the same.
7945 * Otherwise, an error is produced.
7947 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_from_union_map(
7948 __isl_take isl_union_map
*umap
)
7950 isl_union_pw_multi_aff
*upma
;
7952 upma
= isl_union_pw_multi_aff_from_union_map(umap
);
7953 return isl_multi_union_pw_aff_from_union_pw_multi_aff(upma
);
7956 /* Return a multiple union piecewise affine expression
7957 * that is equal to "mv" on "domain", assuming "domain" and "mv"
7958 * have been aligned.
7960 static __isl_give isl_multi_union_pw_aff
*
7961 isl_multi_union_pw_aff_multi_val_on_domain_aligned(
7962 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
7966 isl_multi_union_pw_aff
*mupa
;
7971 n
= isl_multi_val_dim(mv
, isl_dim_set
);
7972 space
= isl_multi_val_get_space(mv
);
7973 mupa
= isl_multi_union_pw_aff_alloc(space
);
7974 for (i
= 0; i
< n
; ++i
) {
7976 isl_union_pw_aff
*upa
;
7978 v
= isl_multi_val_get_val(mv
, i
);
7979 upa
= isl_union_pw_aff_val_on_domain(isl_union_set_copy(domain
),
7981 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
7984 isl_union_set_free(domain
);
7985 isl_multi_val_free(mv
);
7988 isl_union_set_free(domain
);
7989 isl_multi_val_free(mv
);
7993 /* Return a multiple union piecewise affine expression
7994 * that is equal to "mv" on "domain".
7996 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_val_on_domain(
7997 __isl_take isl_union_set
*domain
, __isl_take isl_multi_val
*mv
)
8001 if (isl_space_match(domain
->dim
, isl_dim_param
,
8002 mv
->space
, isl_dim_param
))
8003 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(
8005 domain
= isl_union_set_align_params(domain
,
8006 isl_multi_val_get_space(mv
));
8007 mv
= isl_multi_val_align_params(mv
, isl_union_set_get_space(domain
));
8008 return isl_multi_union_pw_aff_multi_val_on_domain_aligned(domain
, mv
);
8010 isl_union_set_free(domain
);
8011 isl_multi_val_free(mv
);
8015 /* Return a multiple union piecewise affine expression
8016 * that is equal to "ma" on "domain", assuming "domain" and "ma"
8017 * have been aligned.
8019 static __isl_give isl_multi_union_pw_aff
*
8020 isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
8021 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8025 isl_multi_union_pw_aff
*mupa
;
8030 n
= isl_multi_aff_dim(ma
, isl_dim_set
);
8031 space
= isl_multi_aff_get_space(ma
);
8032 mupa
= isl_multi_union_pw_aff_alloc(space
);
8033 for (i
= 0; i
< n
; ++i
) {
8035 isl_union_pw_aff
*upa
;
8037 aff
= isl_multi_aff_get_aff(ma
, i
);
8038 upa
= isl_union_pw_aff_aff_on_domain(isl_union_set_copy(domain
),
8040 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8043 isl_union_set_free(domain
);
8044 isl_multi_aff_free(ma
);
8047 isl_union_set_free(domain
);
8048 isl_multi_aff_free(ma
);
8052 /* Return a multiple union piecewise affine expression
8053 * that is equal to "ma" on "domain".
8055 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_multi_aff_on_domain(
8056 __isl_take isl_union_set
*domain
, __isl_take isl_multi_aff
*ma
)
8060 if (isl_space_match(domain
->dim
, isl_dim_param
,
8061 ma
->space
, isl_dim_param
))
8062 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(
8064 domain
= isl_union_set_align_params(domain
,
8065 isl_multi_aff_get_space(ma
));
8066 ma
= isl_multi_aff_align_params(ma
, isl_union_set_get_space(domain
));
8067 return isl_multi_union_pw_aff_multi_aff_on_domain_aligned(domain
, ma
);
8069 isl_union_set_free(domain
);
8070 isl_multi_aff_free(ma
);
8074 /* Return a union set containing those elements in the domains
8075 * of the elements of "mupa" where they are all zero.
8077 __isl_give isl_union_set
*isl_multi_union_pw_aff_zero_union_set(
8078 __isl_take isl_multi_union_pw_aff
*mupa
)
8081 isl_union_pw_aff
*upa
;
8082 isl_union_set
*zero
;
8087 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8089 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8090 "cannot determine zero set "
8091 "of zero-dimensional function", goto error
);
8093 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8094 zero
= isl_union_pw_aff_zero_union_set(upa
);
8096 for (i
= 1; i
< n
; ++i
) {
8097 isl_union_set
*zero_i
;
8099 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8100 zero_i
= isl_union_pw_aff_zero_union_set(upa
);
8102 zero
= isl_union_set_intersect(zero
, zero_i
);
8105 isl_multi_union_pw_aff_free(mupa
);
8108 isl_multi_union_pw_aff_free(mupa
);
8112 /* Construct a union map mapping the shared domain
8113 * of the union piecewise affine expressions to the range of "mupa"
8114 * with each dimension in the range equated to the
8115 * corresponding union piecewise affine expression.
8117 * The input cannot be zero-dimensional as there is
8118 * no way to extract a domain from a zero-dimensional isl_multi_union_pw_aff.
8120 __isl_give isl_union_map
*isl_union_map_from_multi_union_pw_aff(
8121 __isl_take isl_multi_union_pw_aff
*mupa
)
8125 isl_union_map
*umap
;
8126 isl_union_pw_aff
*upa
;
8131 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8133 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8134 "cannot determine domain of zero-dimensional "
8135 "isl_multi_union_pw_aff", goto error
);
8137 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8138 umap
= isl_union_map_from_union_pw_aff(upa
);
8140 for (i
= 1; i
< n
; ++i
) {
8141 isl_union_map
*umap_i
;
8143 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8144 umap_i
= isl_union_map_from_union_pw_aff(upa
);
8145 umap
= isl_union_map_flat_range_product(umap
, umap_i
);
8148 space
= isl_multi_union_pw_aff_get_space(mupa
);
8149 umap
= isl_union_map_reset_range_space(umap
, space
);
8151 isl_multi_union_pw_aff_free(mupa
);
8154 isl_multi_union_pw_aff_free(mupa
);
8158 /* Internal data structure for isl_union_pw_multi_aff_reset_range_space.
8159 * "range" is the space from which to set the range space.
8160 * "res" collects the results.
8162 struct isl_union_pw_multi_aff_reset_range_space_data
{
8164 isl_union_pw_multi_aff
*res
;
8167 /* Replace the range space of "pma" by the range space of data->range and
8168 * add the result to data->res.
8170 static isl_stat
reset_range_space(__isl_take isl_pw_multi_aff
*pma
, void *user
)
8172 struct isl_union_pw_multi_aff_reset_range_space_data
*data
= user
;
8175 space
= isl_pw_multi_aff_get_space(pma
);
8176 space
= isl_space_domain(space
);
8177 space
= isl_space_extend_domain_with_range(space
,
8178 isl_space_copy(data
->range
));
8179 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
8180 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
8182 return data
->res
? isl_stat_ok
: isl_stat_error
;
8185 /* Replace the range space of all the piecewise affine expressions in "upma" by
8186 * the range space of "space".
8188 * This assumes that all these expressions have the same output dimension.
8190 * Since the spaces of the expressions change, so do their hash values.
8191 * We therefore need to create a new isl_union_pw_multi_aff.
8192 * Note that the hash value is currently computed based on the entire
8193 * space even though there can only be a single expression with a given
8196 static __isl_give isl_union_pw_multi_aff
*
8197 isl_union_pw_multi_aff_reset_range_space(
8198 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_space
*space
)
8200 struct isl_union_pw_multi_aff_reset_range_space_data data
= { space
};
8201 isl_space
*space_upma
;
8203 space_upma
= isl_union_pw_multi_aff_get_space(upma
);
8204 data
.res
= isl_union_pw_multi_aff_empty(space_upma
);
8205 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
8206 &reset_range_space
, &data
) < 0)
8207 data
.res
= isl_union_pw_multi_aff_free(data
.res
);
8209 isl_space_free(space
);
8210 isl_union_pw_multi_aff_free(upma
);
8214 /* Construct and return a union piecewise multi affine expression
8215 * that is equal to the given multi union piecewise affine expression.
8217 * In order to be able to perform the conversion, the input
8218 * needs to have a least one output dimension.
8220 __isl_give isl_union_pw_multi_aff
*
8221 isl_union_pw_multi_aff_from_multi_union_pw_aff(
8222 __isl_take isl_multi_union_pw_aff
*mupa
)
8226 isl_union_pw_multi_aff
*upma
;
8227 isl_union_pw_aff
*upa
;
8232 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8234 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8235 "cannot determine domain of zero-dimensional "
8236 "isl_multi_union_pw_aff", goto error
);
8238 space
= isl_multi_union_pw_aff_get_space(mupa
);
8239 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8240 upma
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8242 for (i
= 1; i
< n
; ++i
) {
8243 isl_union_pw_multi_aff
*upma_i
;
8245 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8246 upma_i
= isl_union_pw_multi_aff_from_union_pw_aff(upa
);
8247 upma
= isl_union_pw_multi_aff_flat_range_product(upma
, upma_i
);
8250 upma
= isl_union_pw_multi_aff_reset_range_space(upma
, space
);
8252 isl_multi_union_pw_aff_free(mupa
);
8255 isl_multi_union_pw_aff_free(mupa
);
8259 /* Intersect the range of "mupa" with "range".
8260 * That is, keep only those domain elements that have a function value
8263 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_intersect_range(
8264 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_set
*range
)
8266 isl_union_pw_multi_aff
*upma
;
8267 isl_union_set
*domain
;
8272 if (!mupa
|| !range
)
8275 space
= isl_set_get_space(range
);
8276 match
= isl_space_tuple_is_equal(mupa
->space
, isl_dim_set
,
8277 space
, isl_dim_set
);
8278 isl_space_free(space
);
8282 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8283 "space don't match", goto error
);
8284 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8286 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8287 "cannot intersect range of zero-dimensional "
8288 "isl_multi_union_pw_aff", goto error
);
8290 upma
= isl_union_pw_multi_aff_from_multi_union_pw_aff(
8291 isl_multi_union_pw_aff_copy(mupa
));
8292 domain
= isl_union_set_from_set(range
);
8293 domain
= isl_union_set_preimage_union_pw_multi_aff(domain
, upma
);
8294 mupa
= isl_multi_union_pw_aff_intersect_domain(mupa
, domain
);
8298 isl_multi_union_pw_aff_free(mupa
);
8299 isl_set_free(range
);
8303 /* Return the shared domain of the elements of "mupa".
8305 __isl_give isl_union_set
*isl_multi_union_pw_aff_domain(
8306 __isl_take isl_multi_union_pw_aff
*mupa
)
8309 isl_union_pw_aff
*upa
;
8315 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8317 isl_die(isl_multi_union_pw_aff_get_ctx(mupa
), isl_error_invalid
,
8318 "cannot determine domain", goto error
);
8320 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, 0);
8321 dom
= isl_union_pw_aff_domain(upa
);
8322 for (i
= 1; i
< n
; ++i
) {
8323 isl_union_set
*dom_i
;
8325 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8326 dom_i
= isl_union_pw_aff_domain(upa
);
8327 dom
= isl_union_set_intersect(dom
, dom_i
);
8330 isl_multi_union_pw_aff_free(mupa
);
8333 isl_multi_union_pw_aff_free(mupa
);
8337 /* Apply "aff" to "mupa". The space of "mupa" is equal to the domain of "aff".
8338 * In particular, the spaces have been aligned.
8339 * The result is defined over the shared domain of the elements of "mupa"
8341 * We first extract the parametric constant part of "aff" and
8342 * define that over the shared domain.
8343 * Then we iterate over all input dimensions of "aff" and add the corresponding
8344 * multiples of the elements of "mupa".
8345 * Finally, we consider the integer divisions, calling the function
8346 * recursively to obtain an isl_union_pw_aff corresponding to the
8347 * integer division argument.
8349 static __isl_give isl_union_pw_aff
*multi_union_pw_aff_apply_aff(
8350 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8353 isl_union_pw_aff
*upa
;
8354 isl_union_set
*uset
;
8358 n_in
= isl_aff_dim(aff
, isl_dim_in
);
8359 n_div
= isl_aff_dim(aff
, isl_dim_div
);
8361 uset
= isl_multi_union_pw_aff_domain(isl_multi_union_pw_aff_copy(mupa
));
8362 cst
= isl_aff_copy(aff
);
8363 cst
= isl_aff_drop_dims(cst
, isl_dim_div
, 0, n_div
);
8364 cst
= isl_aff_drop_dims(cst
, isl_dim_in
, 0, n_in
);
8365 cst
= isl_aff_project_domain_on_params(cst
);
8366 upa
= isl_union_pw_aff_aff_on_domain(uset
, cst
);
8368 for (i
= 0; i
< n_in
; ++i
) {
8369 isl_union_pw_aff
*upa_i
;
8371 if (!isl_aff_involves_dims(aff
, isl_dim_in
, i
, 1))
8373 v
= isl_aff_get_coefficient_val(aff
, isl_dim_in
, i
);
8374 upa_i
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8375 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8376 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8379 for (i
= 0; i
< n_div
; ++i
) {
8381 isl_union_pw_aff
*upa_i
;
8383 if (!isl_aff_involves_dims(aff
, isl_dim_div
, i
, 1))
8385 div
= isl_aff_get_div(aff
, i
);
8386 upa_i
= multi_union_pw_aff_apply_aff(
8387 isl_multi_union_pw_aff_copy(mupa
), div
);
8388 upa_i
= isl_union_pw_aff_floor(upa_i
);
8389 v
= isl_aff_get_coefficient_val(aff
, isl_dim_div
, i
);
8390 upa_i
= isl_union_pw_aff_scale_val(upa_i
, v
);
8391 upa
= isl_union_pw_aff_add(upa
, upa_i
);
8394 isl_multi_union_pw_aff_free(mupa
);
8400 /* Apply "aff" to "mupa". The space of "mupa" needs to be compatible
8401 * with the domain of "aff".
8402 * Furthermore, the dimension of this space needs to be greater than zero.
8403 * The result is defined over the shared domain of the elements of "mupa"
8405 * We perform these checks and then hand over control to
8406 * multi_union_pw_aff_apply_aff.
8408 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_aff(
8409 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_aff
*aff
)
8411 isl_space
*space1
, *space2
;
8414 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8415 isl_aff_get_space(aff
));
8416 aff
= isl_aff_align_params(aff
, isl_multi_union_pw_aff_get_space(mupa
));
8420 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8421 space2
= isl_aff_get_domain_space(aff
);
8422 equal
= isl_space_is_equal(space1
, space2
);
8423 isl_space_free(space1
);
8424 isl_space_free(space2
);
8428 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8429 "spaces don't match", goto error
);
8430 if (isl_aff_dim(aff
, isl_dim_in
) == 0)
8431 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
8432 "cannot determine domains", goto error
);
8434 return multi_union_pw_aff_apply_aff(mupa
, aff
);
8436 isl_multi_union_pw_aff_free(mupa
);
8441 /* Apply "ma" to "mupa". The space of "mupa" needs to be compatible
8442 * with the domain of "ma".
8443 * Furthermore, the dimension of this space needs to be greater than zero,
8444 * unless the dimension of the target space of "ma" is also zero.
8445 * The result is defined over the shared domain of the elements of "mupa"
8447 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_multi_aff(
8448 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_multi_aff
*ma
)
8450 isl_space
*space1
, *space2
;
8451 isl_multi_union_pw_aff
*res
;
8455 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8456 isl_multi_aff_get_space(ma
));
8457 ma
= isl_multi_aff_align_params(ma
,
8458 isl_multi_union_pw_aff_get_space(mupa
));
8462 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8463 space2
= isl_multi_aff_get_domain_space(ma
);
8464 equal
= isl_space_is_equal(space1
, space2
);
8465 isl_space_free(space1
);
8466 isl_space_free(space2
);
8470 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8471 "spaces don't match", goto error
);
8472 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
8473 if (isl_multi_aff_dim(ma
, isl_dim_in
) == 0 && n_out
!= 0)
8474 isl_die(isl_multi_aff_get_ctx(ma
), isl_error_invalid
,
8475 "cannot determine domains", goto error
);
8477 space1
= isl_space_range(isl_multi_aff_get_space(ma
));
8478 res
= isl_multi_union_pw_aff_alloc(space1
);
8480 for (i
= 0; i
< n_out
; ++i
) {
8482 isl_union_pw_aff
*upa
;
8484 aff
= isl_multi_aff_get_aff(ma
, i
);
8485 upa
= multi_union_pw_aff_apply_aff(
8486 isl_multi_union_pw_aff_copy(mupa
), aff
);
8487 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8490 isl_multi_aff_free(ma
);
8491 isl_multi_union_pw_aff_free(mupa
);
8494 isl_multi_union_pw_aff_free(mupa
);
8495 isl_multi_aff_free(ma
);
8499 /* Apply "pa" to "mupa". The space of "mupa" needs to be compatible
8500 * with the domain of "pa".
8501 * Furthermore, the dimension of this space needs to be greater than zero.
8502 * The result is defined over the shared domain of the elements of "mupa"
8504 __isl_give isl_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_aff(
8505 __isl_take isl_multi_union_pw_aff
*mupa
, __isl_take isl_pw_aff
*pa
)
8509 isl_space
*space
, *space2
;
8510 isl_union_pw_aff
*upa
;
8512 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8513 isl_pw_aff_get_space(pa
));
8514 pa
= isl_pw_aff_align_params(pa
,
8515 isl_multi_union_pw_aff_get_space(mupa
));
8519 space
= isl_multi_union_pw_aff_get_space(mupa
);
8520 space2
= isl_pw_aff_get_domain_space(pa
);
8521 equal
= isl_space_is_equal(space
, space2
);
8522 isl_space_free(space
);
8523 isl_space_free(space2
);
8527 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8528 "spaces don't match", goto error
);
8529 if (isl_pw_aff_dim(pa
, isl_dim_in
) == 0)
8530 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
8531 "cannot determine domains", goto error
);
8533 space
= isl_space_params(isl_multi_union_pw_aff_get_space(mupa
));
8534 upa
= isl_union_pw_aff_empty(space
);
8536 for (i
= 0; i
< pa
->n
; ++i
) {
8539 isl_multi_union_pw_aff
*mupa_i
;
8540 isl_union_pw_aff
*upa_i
;
8542 mupa_i
= isl_multi_union_pw_aff_copy(mupa
);
8543 domain
= isl_set_copy(pa
->p
[i
].set
);
8544 mupa_i
= isl_multi_union_pw_aff_intersect_range(mupa_i
, domain
);
8545 aff
= isl_aff_copy(pa
->p
[i
].aff
);
8546 upa_i
= multi_union_pw_aff_apply_aff(mupa_i
, aff
);
8547 upa
= isl_union_pw_aff_union_add(upa
, upa_i
);
8550 isl_multi_union_pw_aff_free(mupa
);
8551 isl_pw_aff_free(pa
);
8554 isl_multi_union_pw_aff_free(mupa
);
8555 isl_pw_aff_free(pa
);
8559 /* Apply "pma" to "mupa". The space of "mupa" needs to be compatible
8560 * with the domain of "pma".
8561 * Furthermore, the dimension of this space needs to be greater than zero,
8562 * unless the dimension of the target space of "pma" is also zero.
8563 * The result is defined over the shared domain of the elements of "mupa"
8565 __isl_give isl_multi_union_pw_aff
*isl_multi_union_pw_aff_apply_pw_multi_aff(
8566 __isl_take isl_multi_union_pw_aff
*mupa
,
8567 __isl_take isl_pw_multi_aff
*pma
)
8569 isl_space
*space1
, *space2
;
8570 isl_multi_union_pw_aff
*res
;
8574 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8575 isl_pw_multi_aff_get_space(pma
));
8576 pma
= isl_pw_multi_aff_align_params(pma
,
8577 isl_multi_union_pw_aff_get_space(mupa
));
8581 space1
= isl_multi_union_pw_aff_get_space(mupa
);
8582 space2
= isl_pw_multi_aff_get_domain_space(pma
);
8583 equal
= isl_space_is_equal(space1
, space2
);
8584 isl_space_free(space1
);
8585 isl_space_free(space2
);
8589 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8590 "spaces don't match", goto error
);
8591 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
8592 if (isl_pw_multi_aff_dim(pma
, isl_dim_in
) == 0 && n_out
!= 0)
8593 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
8594 "cannot determine domains", goto error
);
8596 space1
= isl_space_range(isl_pw_multi_aff_get_space(pma
));
8597 res
= isl_multi_union_pw_aff_alloc(space1
);
8599 for (i
= 0; i
< n_out
; ++i
) {
8601 isl_union_pw_aff
*upa
;
8603 pa
= isl_pw_multi_aff_get_pw_aff(pma
, i
);
8604 upa
= isl_multi_union_pw_aff_apply_pw_aff(
8605 isl_multi_union_pw_aff_copy(mupa
), pa
);
8606 res
= isl_multi_union_pw_aff_set_union_pw_aff(res
, i
, upa
);
8609 isl_pw_multi_aff_free(pma
);
8610 isl_multi_union_pw_aff_free(mupa
);
8613 isl_multi_union_pw_aff_free(mupa
);
8614 isl_pw_multi_aff_free(pma
);
8618 /* Compute the pullback of "mupa" by the function represented by "upma".
8619 * In other words, plug in "upma" in "mupa". The result contains
8620 * expressions defined over the domain space of "upma".
8622 * Run over all elements of "mupa" and plug in "upma" in each of them.
8624 __isl_give isl_multi_union_pw_aff
*
8625 isl_multi_union_pw_aff_pullback_union_pw_multi_aff(
8626 __isl_take isl_multi_union_pw_aff
*mupa
,
8627 __isl_take isl_union_pw_multi_aff
*upma
)
8631 mupa
= isl_multi_union_pw_aff_align_params(mupa
,
8632 isl_union_pw_multi_aff_get_space(upma
));
8633 upma
= isl_union_pw_multi_aff_align_params(upma
,
8634 isl_multi_union_pw_aff_get_space(mupa
));
8638 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8639 for (i
= 0; i
< n
; ++i
) {
8640 isl_union_pw_aff
*upa
;
8642 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8643 upa
= isl_union_pw_aff_pullback_union_pw_multi_aff(upa
,
8644 isl_union_pw_multi_aff_copy(upma
));
8645 mupa
= isl_multi_union_pw_aff_set_union_pw_aff(mupa
, i
, upa
);
8648 isl_union_pw_multi_aff_free(upma
);
8651 isl_multi_union_pw_aff_free(mupa
);
8652 isl_union_pw_multi_aff_free(upma
);
8656 /* Extract the sequence of elements in "mupa" with domain space "space"
8657 * (ignoring parameters).
8659 * For the elements of "mupa" that are not defined on the specified space,
8660 * the corresponding element in the result is empty.
8662 __isl_give isl_multi_pw_aff
*isl_multi_union_pw_aff_extract_multi_pw_aff(
8663 __isl_keep isl_multi_union_pw_aff
*mupa
, __isl_take isl_space
*space
)
8666 isl_space
*space_mpa
= NULL
;
8667 isl_multi_pw_aff
*mpa
;
8669 if (!mupa
|| !space
)
8672 space_mpa
= isl_multi_union_pw_aff_get_space(mupa
);
8673 if (!isl_space_match(space_mpa
, isl_dim_param
, space
, isl_dim_param
)) {
8674 space
= isl_space_drop_dims(space
, isl_dim_param
,
8675 0, isl_space_dim(space
, isl_dim_param
));
8676 space
= isl_space_align_params(space
,
8677 isl_space_copy(space_mpa
));
8681 space_mpa
= isl_space_map_from_domain_and_range(isl_space_copy(space
),
8683 mpa
= isl_multi_pw_aff_alloc(space_mpa
);
8685 space
= isl_space_from_domain(space
);
8686 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
8687 n
= isl_multi_union_pw_aff_dim(mupa
, isl_dim_set
);
8688 for (i
= 0; i
< n
; ++i
) {
8689 isl_union_pw_aff
*upa
;
8692 upa
= isl_multi_union_pw_aff_get_union_pw_aff(mupa
, i
);
8693 pa
= isl_union_pw_aff_extract_pw_aff(upa
,
8694 isl_space_copy(space
));
8695 mpa
= isl_multi_pw_aff_set_pw_aff(mpa
, i
, pa
);
8696 isl_union_pw_aff_free(upa
);
8699 isl_space_free(space
);
8702 isl_space_free(space_mpa
);
8703 isl_space_free(space
);