2 * Copyright 2011 INRIA Saclay
3 * Copyright 2011 Sven Verdoolaege
4 * Copyright 2012-2013 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, INRIA Saclay - Ile-de-France,
9 * Parc Club Orsay Universite, ZAC des vignes, 4 rue Jacques Monod,
11 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
14 #include <isl_ctx_private.h>
16 #include <isl_map_private.h>
17 #include <isl_union_map_private.h>
18 #include <isl_aff_private.h>
19 #include <isl_space_private.h>
20 #include <isl_local_space_private.h>
21 #include <isl_vec_private.h>
22 #include <isl_mat_private.h>
23 #include <isl/constraint.h>
26 #include <isl_val_private.h>
27 #include <isl/deprecated/aff_int.h>
28 #include <isl_config.h>
33 #include <isl_list_templ.c>
38 #include <isl_list_templ.c>
40 __isl_give isl_aff
*isl_aff_alloc_vec(__isl_take isl_local_space
*ls
,
41 __isl_take isl_vec
*v
)
48 aff
= isl_calloc_type(v
->ctx
, struct isl_aff
);
58 isl_local_space_free(ls
);
63 __isl_give isl_aff
*isl_aff_alloc(__isl_take isl_local_space
*ls
)
72 ctx
= isl_local_space_get_ctx(ls
);
73 if (!isl_local_space_divs_known(ls
))
74 isl_die(ctx
, isl_error_invalid
, "local space has unknown divs",
76 if (!isl_local_space_is_set(ls
))
77 isl_die(ctx
, isl_error_invalid
,
78 "domain of affine expression should be a set",
81 total
= isl_local_space_dim(ls
, isl_dim_all
);
82 v
= isl_vec_alloc(ctx
, 1 + 1 + total
);
83 return isl_aff_alloc_vec(ls
, v
);
85 isl_local_space_free(ls
);
89 __isl_give isl_aff
*isl_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
93 aff
= isl_aff_alloc(ls
);
97 isl_int_set_si(aff
->v
->el
[0], 1);
98 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
103 /* Return a piecewise affine expression defined on the specified domain
104 * that is equal to zero.
106 __isl_give isl_pw_aff
*isl_pw_aff_zero_on_domain(__isl_take isl_local_space
*ls
)
108 return isl_pw_aff_from_aff(isl_aff_zero_on_domain(ls
));
111 /* Return an affine expression that is equal to "val" on
112 * domain local space "ls".
114 __isl_give isl_aff
*isl_aff_val_on_domain(__isl_take isl_local_space
*ls
,
115 __isl_take isl_val
*val
)
121 if (!isl_val_is_rat(val
))
122 isl_die(isl_val_get_ctx(val
), isl_error_invalid
,
123 "expecting rational value", goto error
);
125 aff
= isl_aff_alloc(isl_local_space_copy(ls
));
129 isl_seq_clr(aff
->v
->el
+ 2, aff
->v
->size
- 2);
130 isl_int_set(aff
->v
->el
[1], val
->n
);
131 isl_int_set(aff
->v
->el
[0], val
->d
);
133 isl_local_space_free(ls
);
137 isl_local_space_free(ls
);
142 /* Return an affine expression that is equal to the specified dimension
145 __isl_give isl_aff
*isl_aff_var_on_domain(__isl_take isl_local_space
*ls
,
146 enum isl_dim_type type
, unsigned pos
)
154 space
= isl_local_space_get_space(ls
);
157 if (isl_space_is_map(space
))
158 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
159 "expecting (parameter) set space", goto error
);
160 if (pos
>= isl_local_space_dim(ls
, type
))
161 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
162 "position out of bounds", goto error
);
164 isl_space_free(space
);
165 aff
= isl_aff_alloc(ls
);
169 pos
+= isl_local_space_offset(aff
->ls
, type
);
171 isl_int_set_si(aff
->v
->el
[0], 1);
172 isl_seq_clr(aff
->v
->el
+ 1, aff
->v
->size
- 1);
173 isl_int_set_si(aff
->v
->el
[1 + pos
], 1);
177 isl_local_space_free(ls
);
178 isl_space_free(space
);
182 /* Return a piecewise affine expression that is equal to
183 * the specified dimension in "ls".
185 __isl_give isl_pw_aff
*isl_pw_aff_var_on_domain(__isl_take isl_local_space
*ls
,
186 enum isl_dim_type type
, unsigned pos
)
188 return isl_pw_aff_from_aff(isl_aff_var_on_domain(ls
, type
, pos
));
191 __isl_give isl_aff
*isl_aff_copy(__isl_keep isl_aff
*aff
)
200 __isl_give isl_aff
*isl_aff_dup(__isl_keep isl_aff
*aff
)
205 return isl_aff_alloc_vec(isl_local_space_copy(aff
->ls
),
206 isl_vec_copy(aff
->v
));
209 __isl_give isl_aff
*isl_aff_cow(__isl_take isl_aff
*aff
)
217 return isl_aff_dup(aff
);
220 void *isl_aff_free(__isl_take isl_aff
*aff
)
228 isl_local_space_free(aff
->ls
);
229 isl_vec_free(aff
->v
);
236 isl_ctx
*isl_aff_get_ctx(__isl_keep isl_aff
*aff
)
238 return aff
? isl_local_space_get_ctx(aff
->ls
) : NULL
;
241 /* Externally, an isl_aff has a map space, but internally, the
242 * ls field corresponds to the domain of that space.
244 int isl_aff_dim(__isl_keep isl_aff
*aff
, enum isl_dim_type type
)
248 if (type
== isl_dim_out
)
250 if (type
== isl_dim_in
)
252 return isl_local_space_dim(aff
->ls
, type
);
255 __isl_give isl_space
*isl_aff_get_domain_space(__isl_keep isl_aff
*aff
)
257 return aff
? isl_local_space_get_space(aff
->ls
) : NULL
;
260 __isl_give isl_space
*isl_aff_get_space(__isl_keep isl_aff
*aff
)
265 space
= isl_local_space_get_space(aff
->ls
);
266 space
= isl_space_from_domain(space
);
267 space
= isl_space_add_dims(space
, isl_dim_out
, 1);
271 __isl_give isl_local_space
*isl_aff_get_domain_local_space(
272 __isl_keep isl_aff
*aff
)
274 return aff
? isl_local_space_copy(aff
->ls
) : NULL
;
277 __isl_give isl_local_space
*isl_aff_get_local_space(__isl_keep isl_aff
*aff
)
282 ls
= isl_local_space_copy(aff
->ls
);
283 ls
= isl_local_space_from_domain(ls
);
284 ls
= isl_local_space_add_dims(ls
, isl_dim_out
, 1);
288 /* Externally, an isl_aff has a map space, but internally, the
289 * ls field corresponds to the domain of that space.
291 const char *isl_aff_get_dim_name(__isl_keep isl_aff
*aff
,
292 enum isl_dim_type type
, unsigned pos
)
296 if (type
== isl_dim_out
)
298 if (type
== isl_dim_in
)
300 return isl_local_space_get_dim_name(aff
->ls
, type
, pos
);
303 __isl_give isl_aff
*isl_aff_reset_domain_space(__isl_take isl_aff
*aff
,
304 __isl_take isl_space
*dim
)
306 aff
= isl_aff_cow(aff
);
310 aff
->ls
= isl_local_space_reset_space(aff
->ls
, dim
);
312 return isl_aff_free(aff
);
321 /* Reset the space of "aff". This function is called from isl_pw_templ.c
322 * and doesn't know if the space of an element object is represented
323 * directly or through its domain. It therefore passes along both.
325 __isl_give isl_aff
*isl_aff_reset_space_and_domain(__isl_take isl_aff
*aff
,
326 __isl_take isl_space
*space
, __isl_take isl_space
*domain
)
328 isl_space_free(space
);
329 return isl_aff_reset_domain_space(aff
, domain
);
332 /* Reorder the coefficients of the affine expression based
333 * on the given reodering.
334 * The reordering r is assumed to have been extended with the local
337 static __isl_give isl_vec
*vec_reorder(__isl_take isl_vec
*vec
,
338 __isl_take isl_reordering
*r
, int n_div
)
346 res
= isl_vec_alloc(vec
->ctx
,
347 2 + isl_space_dim(r
->dim
, isl_dim_all
) + n_div
);
348 isl_seq_cpy(res
->el
, vec
->el
, 2);
349 isl_seq_clr(res
->el
+ 2, res
->size
- 2);
350 for (i
= 0; i
< r
->len
; ++i
)
351 isl_int_set(res
->el
[2 + r
->pos
[i
]], vec
->el
[2 + i
]);
353 isl_reordering_free(r
);
358 isl_reordering_free(r
);
362 /* Reorder the dimensions of the domain of "aff" according
363 * to the given reordering.
365 __isl_give isl_aff
*isl_aff_realign_domain(__isl_take isl_aff
*aff
,
366 __isl_take isl_reordering
*r
)
368 aff
= isl_aff_cow(aff
);
372 r
= isl_reordering_extend(r
, aff
->ls
->div
->n_row
);
373 aff
->v
= vec_reorder(aff
->v
, isl_reordering_copy(r
),
374 aff
->ls
->div
->n_row
);
375 aff
->ls
= isl_local_space_realign(aff
->ls
, r
);
377 if (!aff
->v
|| !aff
->ls
)
378 return isl_aff_free(aff
);
383 isl_reordering_free(r
);
387 __isl_give isl_aff
*isl_aff_align_params(__isl_take isl_aff
*aff
,
388 __isl_take isl_space
*model
)
393 if (!isl_space_match(aff
->ls
->dim
, isl_dim_param
,
394 model
, isl_dim_param
)) {
397 model
= isl_space_drop_dims(model
, isl_dim_in
,
398 0, isl_space_dim(model
, isl_dim_in
));
399 model
= isl_space_drop_dims(model
, isl_dim_out
,
400 0, isl_space_dim(model
, isl_dim_out
));
401 exp
= isl_parameter_alignment_reordering(aff
->ls
->dim
, model
);
402 exp
= isl_reordering_extend_space(exp
,
403 isl_aff_get_domain_space(aff
));
404 aff
= isl_aff_realign_domain(aff
, exp
);
407 isl_space_free(model
);
410 isl_space_free(model
);
415 int isl_aff_plain_is_zero(__isl_keep isl_aff
*aff
)
420 return isl_seq_first_non_zero(aff
->v
->el
+ 1, aff
->v
->size
- 1) < 0;
423 int isl_aff_plain_is_equal(__isl_keep isl_aff
*aff1
, __isl_keep isl_aff
*aff2
)
430 equal
= isl_local_space_is_equal(aff1
->ls
, aff2
->ls
);
431 if (equal
< 0 || !equal
)
434 return isl_vec_is_equal(aff1
->v
, aff2
->v
);
437 int isl_aff_get_denominator(__isl_keep isl_aff
*aff
, isl_int
*v
)
441 isl_int_set(*v
, aff
->v
->el
[0]);
445 /* Return the common denominator of "aff".
447 __isl_give isl_val
*isl_aff_get_denominator_val(__isl_keep isl_aff
*aff
)
454 ctx
= isl_aff_get_ctx(aff
);
455 return isl_val_int_from_isl_int(ctx
, aff
->v
->el
[0]);
458 int isl_aff_get_constant(__isl_keep isl_aff
*aff
, isl_int
*v
)
462 isl_int_set(*v
, aff
->v
->el
[1]);
466 /* Return the constant term of "aff".
468 __isl_give isl_val
*isl_aff_get_constant_val(__isl_keep isl_aff
*aff
)
476 ctx
= isl_aff_get_ctx(aff
);
477 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1], aff
->v
->el
[0]);
478 return isl_val_normalize(v
);
481 int isl_aff_get_coefficient(__isl_keep isl_aff
*aff
,
482 enum isl_dim_type type
, int pos
, isl_int
*v
)
487 if (type
== isl_dim_out
)
488 isl_die(aff
->v
->ctx
, isl_error_invalid
,
489 "output/set dimension does not have a coefficient",
491 if (type
== isl_dim_in
)
494 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
495 isl_die(aff
->v
->ctx
, isl_error_invalid
,
496 "position out of bounds", return -1);
498 pos
+= isl_local_space_offset(aff
->ls
, type
);
499 isl_int_set(*v
, aff
->v
->el
[1 + pos
]);
504 /* Return the coefficient of the variable of type "type" at position "pos"
507 __isl_give isl_val
*isl_aff_get_coefficient_val(__isl_keep isl_aff
*aff
,
508 enum isl_dim_type type
, int pos
)
516 ctx
= isl_aff_get_ctx(aff
);
517 if (type
== isl_dim_out
)
518 isl_die(ctx
, isl_error_invalid
,
519 "output/set dimension does not have a coefficient",
521 if (type
== isl_dim_in
)
524 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
525 isl_die(ctx
, isl_error_invalid
,
526 "position out of bounds", return NULL
);
528 pos
+= isl_local_space_offset(aff
->ls
, type
);
529 v
= isl_val_rat_from_isl_int(ctx
, aff
->v
->el
[1 + pos
], aff
->v
->el
[0]);
530 return isl_val_normalize(v
);
533 __isl_give isl_aff
*isl_aff_set_denominator(__isl_take isl_aff
*aff
, isl_int v
)
535 aff
= isl_aff_cow(aff
);
539 aff
->v
= isl_vec_cow(aff
->v
);
541 return isl_aff_free(aff
);
543 isl_int_set(aff
->v
->el
[0], v
);
548 __isl_give isl_aff
*isl_aff_set_constant(__isl_take isl_aff
*aff
, isl_int v
)
550 aff
= isl_aff_cow(aff
);
554 aff
->v
= isl_vec_cow(aff
->v
);
556 return isl_aff_free(aff
);
558 isl_int_set(aff
->v
->el
[1], v
);
563 /* Replace the constant term of "aff" by "v".
565 __isl_give isl_aff
*isl_aff_set_constant_val(__isl_take isl_aff
*aff
,
566 __isl_take isl_val
*v
)
571 if (!isl_val_is_rat(v
))
572 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
573 "expecting rational value", goto error
);
575 if (isl_int_eq(aff
->v
->el
[1], v
->n
) &&
576 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
581 aff
= isl_aff_cow(aff
);
584 aff
->v
= isl_vec_cow(aff
->v
);
588 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
589 isl_int_set(aff
->v
->el
[1], v
->n
);
590 } else if (isl_int_is_one(v
->d
)) {
591 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
593 isl_seq_scale(aff
->v
->el
+ 1,
594 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
595 isl_int_mul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
596 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
597 aff
->v
= isl_vec_normalize(aff
->v
);
610 __isl_give isl_aff
*isl_aff_add_constant(__isl_take isl_aff
*aff
, isl_int v
)
612 if (isl_int_is_zero(v
))
615 aff
= isl_aff_cow(aff
);
619 aff
->v
= isl_vec_cow(aff
->v
);
621 return isl_aff_free(aff
);
623 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
);
628 /* Add "v" to the constant term of "aff".
630 __isl_give isl_aff
*isl_aff_add_constant_val(__isl_take isl_aff
*aff
,
631 __isl_take isl_val
*v
)
636 if (isl_val_is_zero(v
)) {
641 if (!isl_val_is_rat(v
))
642 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
643 "expecting rational value", goto error
);
645 aff
= isl_aff_cow(aff
);
649 aff
->v
= isl_vec_cow(aff
->v
);
653 if (isl_int_is_one(v
->d
)) {
654 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
655 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
656 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
->n
);
657 aff
->v
= isl_vec_normalize(aff
->v
);
661 isl_seq_scale(aff
->v
->el
+ 1,
662 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
663 isl_int_addmul(aff
->v
->el
[1], aff
->v
->el
[0], v
->n
);
664 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
665 aff
->v
= isl_vec_normalize(aff
->v
);
678 __isl_give isl_aff
*isl_aff_add_constant_si(__isl_take isl_aff
*aff
, int v
)
683 isl_int_set_si(t
, v
);
684 aff
= isl_aff_add_constant(aff
, t
);
690 /* Add "v" to the numerator of the constant term of "aff".
692 __isl_give isl_aff
*isl_aff_add_constant_num(__isl_take isl_aff
*aff
, isl_int v
)
694 if (isl_int_is_zero(v
))
697 aff
= isl_aff_cow(aff
);
701 aff
->v
= isl_vec_cow(aff
->v
);
703 return isl_aff_free(aff
);
705 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], v
);
710 /* Add "v" to the numerator of the constant term of "aff".
712 __isl_give isl_aff
*isl_aff_add_constant_num_si(__isl_take isl_aff
*aff
, int v
)
720 isl_int_set_si(t
, v
);
721 aff
= isl_aff_add_constant_num(aff
, t
);
727 __isl_give isl_aff
*isl_aff_set_constant_si(__isl_take isl_aff
*aff
, int v
)
729 aff
= isl_aff_cow(aff
);
733 aff
->v
= isl_vec_cow(aff
->v
);
735 return isl_aff_free(aff
);
737 isl_int_set_si(aff
->v
->el
[1], v
);
742 __isl_give isl_aff
*isl_aff_set_coefficient(__isl_take isl_aff
*aff
,
743 enum isl_dim_type type
, int pos
, isl_int v
)
748 if (type
== isl_dim_out
)
749 isl_die(aff
->v
->ctx
, isl_error_invalid
,
750 "output/set dimension does not have a coefficient",
751 return isl_aff_free(aff
));
752 if (type
== isl_dim_in
)
755 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
756 isl_die(aff
->v
->ctx
, isl_error_invalid
,
757 "position out of bounds", return isl_aff_free(aff
));
759 aff
= isl_aff_cow(aff
);
763 aff
->v
= isl_vec_cow(aff
->v
);
765 return isl_aff_free(aff
);
767 pos
+= isl_local_space_offset(aff
->ls
, type
);
768 isl_int_set(aff
->v
->el
[1 + pos
], v
);
773 __isl_give isl_aff
*isl_aff_set_coefficient_si(__isl_take isl_aff
*aff
,
774 enum isl_dim_type type
, int pos
, int v
)
779 if (type
== isl_dim_out
)
780 isl_die(aff
->v
->ctx
, isl_error_invalid
,
781 "output/set dimension does not have a coefficient",
782 return isl_aff_free(aff
));
783 if (type
== isl_dim_in
)
786 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
787 isl_die(aff
->v
->ctx
, isl_error_invalid
,
788 "position out of bounds", return isl_aff_free(aff
));
790 aff
= isl_aff_cow(aff
);
794 aff
->v
= isl_vec_cow(aff
->v
);
796 return isl_aff_free(aff
);
798 pos
+= isl_local_space_offset(aff
->ls
, type
);
799 isl_int_set_si(aff
->v
->el
[1 + pos
], v
);
804 /* Replace the coefficient of the variable of type "type" at position "pos"
807 __isl_give isl_aff
*isl_aff_set_coefficient_val(__isl_take isl_aff
*aff
,
808 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
813 if (type
== isl_dim_out
)
814 isl_die(aff
->v
->ctx
, isl_error_invalid
,
815 "output/set dimension does not have a coefficient",
817 if (type
== isl_dim_in
)
820 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
821 isl_die(aff
->v
->ctx
, isl_error_invalid
,
822 "position out of bounds", goto error
);
824 if (!isl_val_is_rat(v
))
825 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
826 "expecting rational value", goto error
);
828 pos
+= isl_local_space_offset(aff
->ls
, type
);
829 if (isl_int_eq(aff
->v
->el
[1 + pos
], v
->n
) &&
830 isl_int_eq(aff
->v
->el
[0], v
->d
)) {
835 aff
= isl_aff_cow(aff
);
838 aff
->v
= isl_vec_cow(aff
->v
);
842 if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
843 isl_int_set(aff
->v
->el
[1 + pos
], v
->n
);
844 } else if (isl_int_is_one(v
->d
)) {
845 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
847 isl_seq_scale(aff
->v
->el
+ 1,
848 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
849 isl_int_mul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
850 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
851 aff
->v
= isl_vec_normalize(aff
->v
);
864 __isl_give isl_aff
*isl_aff_add_coefficient(__isl_take isl_aff
*aff
,
865 enum isl_dim_type type
, int pos
, isl_int v
)
870 if (type
== isl_dim_out
)
871 isl_die(aff
->v
->ctx
, isl_error_invalid
,
872 "output/set dimension does not have a coefficient",
873 return isl_aff_free(aff
));
874 if (type
== isl_dim_in
)
877 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
878 isl_die(aff
->v
->ctx
, isl_error_invalid
,
879 "position out of bounds", return isl_aff_free(aff
));
881 aff
= isl_aff_cow(aff
);
885 aff
->v
= isl_vec_cow(aff
->v
);
887 return isl_aff_free(aff
);
889 pos
+= isl_local_space_offset(aff
->ls
, type
);
890 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
);
895 /* Add "v" to the coefficient of the variable of type "type"
896 * at position "pos" of "aff".
898 __isl_give isl_aff
*isl_aff_add_coefficient_val(__isl_take isl_aff
*aff
,
899 enum isl_dim_type type
, int pos
, __isl_take isl_val
*v
)
904 if (isl_val_is_zero(v
)) {
909 if (type
== isl_dim_out
)
910 isl_die(aff
->v
->ctx
, isl_error_invalid
,
911 "output/set dimension does not have a coefficient",
913 if (type
== isl_dim_in
)
916 if (pos
>= isl_local_space_dim(aff
->ls
, type
))
917 isl_die(aff
->v
->ctx
, isl_error_invalid
,
918 "position out of bounds", goto error
);
920 if (!isl_val_is_rat(v
))
921 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
922 "expecting rational value", goto error
);
924 aff
= isl_aff_cow(aff
);
928 aff
->v
= isl_vec_cow(aff
->v
);
932 pos
+= isl_local_space_offset(aff
->ls
, type
);
933 if (isl_int_is_one(v
->d
)) {
934 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
935 } else if (isl_int_eq(aff
->v
->el
[0], v
->d
)) {
936 isl_int_add(aff
->v
->el
[1 + pos
], aff
->v
->el
[1 + pos
], v
->n
);
937 aff
->v
= isl_vec_normalize(aff
->v
);
941 isl_seq_scale(aff
->v
->el
+ 1,
942 aff
->v
->el
+ 1, v
->d
, aff
->v
->size
- 1);
943 isl_int_addmul(aff
->v
->el
[1 + pos
], aff
->v
->el
[0], v
->n
);
944 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], v
->d
);
945 aff
->v
= isl_vec_normalize(aff
->v
);
958 __isl_give isl_aff
*isl_aff_add_coefficient_si(__isl_take isl_aff
*aff
,
959 enum isl_dim_type type
, int pos
, int v
)
964 isl_int_set_si(t
, v
);
965 aff
= isl_aff_add_coefficient(aff
, type
, pos
, t
);
971 __isl_give isl_aff
*isl_aff_get_div(__isl_keep isl_aff
*aff
, int pos
)
976 return isl_local_space_get_div(aff
->ls
, pos
);
979 __isl_give isl_aff
*isl_aff_neg(__isl_take isl_aff
*aff
)
981 aff
= isl_aff_cow(aff
);
984 aff
->v
= isl_vec_cow(aff
->v
);
986 return isl_aff_free(aff
);
988 isl_seq_neg(aff
->v
->el
+ 1, aff
->v
->el
+ 1, aff
->v
->size
- 1);
993 /* Remove divs from the local space that do not appear in the affine
995 * We currently only remove divs at the end.
996 * Some intermediate divs may also not appear directly in the affine
997 * expression, but we would also need to check that no other divs are
998 * defined in terms of them.
1000 __isl_give isl_aff
*isl_aff_remove_unused_divs( __isl_take isl_aff
*aff
)
1009 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1010 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1012 pos
= isl_seq_last_non_zero(aff
->v
->el
+ 1 + off
, n
) + 1;
1016 aff
= isl_aff_cow(aff
);
1020 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, isl_dim_div
, pos
, n
- pos
);
1021 aff
->v
= isl_vec_drop_els(aff
->v
, 1 + off
+ pos
, n
- pos
);
1022 if (!aff
->ls
|| !aff
->v
)
1023 return isl_aff_free(aff
);
1028 /* Given two affine expressions "p" of length p_len (including the
1029 * denominator and the constant term) and "subs" of length subs_len,
1030 * plug in "subs" for the variable at position "pos".
1031 * The variables of "subs" and "p" are assumed to match up to subs_len,
1032 * but "p" may have additional variables.
1033 * "v" is an initialized isl_int that can be used internally.
1035 * In particular, if "p" represents the expression
1039 * with i the variable at position "pos" and "subs" represents the expression
1043 * then the result represents the expression
1048 void isl_seq_substitute(isl_int
*p
, int pos
, isl_int
*subs
,
1049 int p_len
, int subs_len
, isl_int v
)
1051 isl_int_set(v
, p
[1 + pos
]);
1052 isl_int_set_si(p
[1 + pos
], 0);
1053 isl_seq_combine(p
+ 1, subs
[0], p
+ 1, v
, subs
+ 1, subs_len
- 1);
1054 isl_seq_scale(p
+ subs_len
, p
+ subs_len
, subs
[0], p_len
- subs_len
);
1055 isl_int_mul(p
[0], p
[0], subs
[0]);
1058 /* Look for any divs in the aff->ls with a denominator equal to one
1059 * and plug them into the affine expression and any subsequent divs
1060 * that may reference the div.
1062 static __isl_give isl_aff
*plug_in_integral_divs(__isl_take isl_aff
*aff
)
1068 isl_local_space
*ls
;
1074 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1076 for (i
= 0; i
< n
; ++i
) {
1077 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][0]))
1079 ls
= isl_local_space_copy(aff
->ls
);
1080 ls
= isl_local_space_substitute_seq(ls
, isl_dim_div
, i
,
1081 aff
->ls
->div
->row
[i
], len
, i
+ 1, n
- (i
+ 1));
1082 vec
= isl_vec_copy(aff
->v
);
1083 vec
= isl_vec_cow(vec
);
1089 pos
= isl_local_space_offset(aff
->ls
, isl_dim_div
) + i
;
1090 isl_seq_substitute(vec
->el
, pos
, aff
->ls
->div
->row
[i
],
1095 isl_vec_free(aff
->v
);
1097 isl_local_space_free(aff
->ls
);
1104 isl_local_space_free(ls
);
1105 return isl_aff_free(aff
);
1108 /* Look for any divs j that appear with a unit coefficient inside
1109 * the definitions of other divs i and plug them into the definitions
1112 * In particular, an expression of the form
1114 * floor((f(..) + floor(g(..)/n))/m)
1118 * floor((n * f(..) + g(..))/(n * m))
1120 * This simplification is correct because we can move the expression
1121 * f(..) into the inner floor in the original expression to obtain
1123 * floor(floor((n * f(..) + g(..))/n)/m)
1125 * from which we can derive the simplified expression.
1127 static __isl_give isl_aff
*plug_in_unit_divs(__isl_take isl_aff
*aff
)
1135 n
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1136 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1137 for (i
= 1; i
< n
; ++i
) {
1138 for (j
= 0; j
< i
; ++j
) {
1139 if (!isl_int_is_one(aff
->ls
->div
->row
[i
][1 + off
+ j
]))
1141 aff
->ls
= isl_local_space_substitute_seq(aff
->ls
,
1142 isl_dim_div
, j
, aff
->ls
->div
->row
[j
],
1143 aff
->v
->size
, i
, 1);
1145 return isl_aff_free(aff
);
1152 /* Swap divs "a" and "b" in "aff", which is assumed to be non-NULL.
1154 * Even though this function is only called on isl_affs with a single
1155 * reference, we are careful to only change aff->v and aff->ls together.
1157 static __isl_give isl_aff
*swap_div(__isl_take isl_aff
*aff
, int a
, int b
)
1159 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1160 isl_local_space
*ls
;
1163 ls
= isl_local_space_copy(aff
->ls
);
1164 ls
= isl_local_space_swap_div(ls
, a
, b
);
1165 v
= isl_vec_copy(aff
->v
);
1170 isl_int_swap(v
->el
[1 + off
+ a
], v
->el
[1 + off
+ b
]);
1171 isl_vec_free(aff
->v
);
1173 isl_local_space_free(aff
->ls
);
1179 isl_local_space_free(ls
);
1180 return isl_aff_free(aff
);
1183 /* Merge divs "a" and "b" in "aff", which is assumed to be non-NULL.
1185 * We currently do not actually remove div "b", but simply add its
1186 * coefficient to that of "a" and then zero it out.
1188 static __isl_give isl_aff
*merge_divs(__isl_take isl_aff
*aff
, int a
, int b
)
1190 unsigned off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1192 if (isl_int_is_zero(aff
->v
->el
[1 + off
+ b
]))
1195 aff
->v
= isl_vec_cow(aff
->v
);
1197 return isl_aff_free(aff
);
1199 isl_int_add(aff
->v
->el
[1 + off
+ a
],
1200 aff
->v
->el
[1 + off
+ a
], aff
->v
->el
[1 + off
+ b
]);
1201 isl_int_set_si(aff
->v
->el
[1 + off
+ b
], 0);
1206 /* Sort the divs in the local space of "aff" according to
1207 * the comparison function "cmp_row" in isl_local_space.c,
1208 * combining the coefficients of identical divs.
1210 * Reordering divs does not change the semantics of "aff",
1211 * so there is no need to call isl_aff_cow.
1212 * Moreover, this function is currently only called on isl_affs
1213 * with a single reference.
1215 static __isl_give isl_aff
*sort_divs(__isl_take isl_aff
*aff
)
1223 off
= isl_local_space_offset(aff
->ls
, isl_dim_div
);
1224 n
= isl_aff_dim(aff
, isl_dim_div
);
1225 for (i
= 1; i
< n
; ++i
) {
1226 for (j
= i
- 1; j
>= 0; --j
) {
1227 int cmp
= isl_mat_cmp_div(aff
->ls
->div
, j
, j
+ 1);
1231 aff
= merge_divs(aff
, j
, j
+ 1);
1233 aff
= swap_div(aff
, j
, j
+ 1);
1242 /* Normalize the representation of "aff".
1244 * This function should only be called of "new" isl_affs, i.e.,
1245 * with only a single reference. We therefore do not need to
1246 * worry about affecting other instances.
1248 __isl_give isl_aff
*isl_aff_normalize(__isl_take isl_aff
*aff
)
1252 aff
->v
= isl_vec_normalize(aff
->v
);
1254 return isl_aff_free(aff
);
1255 aff
= plug_in_integral_divs(aff
);
1256 aff
= plug_in_unit_divs(aff
);
1257 aff
= sort_divs(aff
);
1258 aff
= isl_aff_remove_unused_divs(aff
);
1262 /* Given f, return floor(f).
1263 * If f is an integer expression, then just return f.
1264 * If f is a constant, then return the constant floor(f).
1265 * Otherwise, if f = g/m, write g = q m + r,
1266 * create a new div d = [r/m] and return the expression q + d.
1267 * The coefficients in r are taken to lie between -m/2 and m/2.
1269 __isl_give isl_aff
*isl_aff_floor(__isl_take isl_aff
*aff
)
1279 if (isl_int_is_one(aff
->v
->el
[0]))
1282 aff
= isl_aff_cow(aff
);
1286 aff
->v
= isl_vec_cow(aff
->v
);
1288 return isl_aff_free(aff
);
1290 if (isl_aff_is_cst(aff
)) {
1291 isl_int_fdiv_q(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1292 isl_int_set_si(aff
->v
->el
[0], 1);
1296 div
= isl_vec_copy(aff
->v
);
1297 div
= isl_vec_cow(div
);
1299 return isl_aff_free(aff
);
1301 ctx
= isl_aff_get_ctx(aff
);
1302 isl_int_fdiv_q(aff
->v
->el
[0], aff
->v
->el
[0], ctx
->two
);
1303 for (i
= 1; i
< aff
->v
->size
; ++i
) {
1304 isl_int_fdiv_r(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1305 isl_int_fdiv_q(aff
->v
->el
[i
], aff
->v
->el
[i
], div
->el
[0]);
1306 if (isl_int_gt(div
->el
[i
], aff
->v
->el
[0])) {
1307 isl_int_sub(div
->el
[i
], div
->el
[i
], div
->el
[0]);
1308 isl_int_add_ui(aff
->v
->el
[i
], aff
->v
->el
[i
], 1);
1312 aff
->ls
= isl_local_space_add_div(aff
->ls
, div
);
1314 return isl_aff_free(aff
);
1316 size
= aff
->v
->size
;
1317 aff
->v
= isl_vec_extend(aff
->v
, size
+ 1);
1319 return isl_aff_free(aff
);
1320 isl_int_set_si(aff
->v
->el
[0], 1);
1321 isl_int_set_si(aff
->v
->el
[size
], 1);
1323 aff
= isl_aff_normalize(aff
);
1330 * aff mod m = aff - m * floor(aff/m)
1332 __isl_give isl_aff
*isl_aff_mod(__isl_take isl_aff
*aff
, isl_int m
)
1336 res
= isl_aff_copy(aff
);
1337 aff
= isl_aff_scale_down(aff
, m
);
1338 aff
= isl_aff_floor(aff
);
1339 aff
= isl_aff_scale(aff
, m
);
1340 res
= isl_aff_sub(res
, aff
);
1347 * aff mod m = aff - m * floor(aff/m)
1349 * with m an integer value.
1351 __isl_give isl_aff
*isl_aff_mod_val(__isl_take isl_aff
*aff
,
1352 __isl_take isl_val
*m
)
1359 if (!isl_val_is_int(m
))
1360 isl_die(isl_val_get_ctx(m
), isl_error_invalid
,
1361 "expecting integer modulo", goto error
);
1363 res
= isl_aff_copy(aff
);
1364 aff
= isl_aff_scale_down_val(aff
, isl_val_copy(m
));
1365 aff
= isl_aff_floor(aff
);
1366 aff
= isl_aff_scale_val(aff
, m
);
1367 res
= isl_aff_sub(res
, aff
);
1378 * pwaff mod m = pwaff - m * floor(pwaff/m)
1380 __isl_give isl_pw_aff
*isl_pw_aff_mod(__isl_take isl_pw_aff
*pwaff
, isl_int m
)
1384 res
= isl_pw_aff_copy(pwaff
);
1385 pwaff
= isl_pw_aff_scale_down(pwaff
, m
);
1386 pwaff
= isl_pw_aff_floor(pwaff
);
1387 pwaff
= isl_pw_aff_scale(pwaff
, m
);
1388 res
= isl_pw_aff_sub(res
, pwaff
);
1395 * pa mod m = pa - m * floor(pa/m)
1397 * with m an integer value.
1399 __isl_give isl_pw_aff
*isl_pw_aff_mod_val(__isl_take isl_pw_aff
*pa
,
1400 __isl_take isl_val
*m
)
1404 if (!isl_val_is_int(m
))
1405 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
1406 "expecting integer modulo", goto error
);
1407 pa
= isl_pw_aff_mod(pa
, m
->n
);
1411 isl_pw_aff_free(pa
);
1416 /* Given f, return ceil(f).
1417 * If f is an integer expression, then just return f.
1418 * Otherwise, let f be the expression
1424 * floor((e + m - 1)/m)
1426 __isl_give isl_aff
*isl_aff_ceil(__isl_take isl_aff
*aff
)
1431 if (isl_int_is_one(aff
->v
->el
[0]))
1434 aff
= isl_aff_cow(aff
);
1437 aff
->v
= isl_vec_cow(aff
->v
);
1439 return isl_aff_free(aff
);
1441 isl_int_add(aff
->v
->el
[1], aff
->v
->el
[1], aff
->v
->el
[0]);
1442 isl_int_sub_ui(aff
->v
->el
[1], aff
->v
->el
[1], 1);
1443 aff
= isl_aff_floor(aff
);
1448 /* Apply the expansion computed by isl_merge_divs.
1449 * The expansion itself is given by "exp" while the resulting
1450 * list of divs is given by "div".
1452 __isl_give isl_aff
*isl_aff_expand_divs( __isl_take isl_aff
*aff
,
1453 __isl_take isl_mat
*div
, int *exp
)
1460 aff
= isl_aff_cow(aff
);
1464 old_n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1465 new_n_div
= isl_mat_rows(div
);
1466 if (new_n_div
< old_n_div
)
1467 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
1468 "not an expansion", goto error
);
1470 aff
->v
= isl_vec_extend(aff
->v
, aff
->v
->size
+ new_n_div
- old_n_div
);
1474 offset
= 1 + isl_local_space_offset(aff
->ls
, isl_dim_div
);
1476 for (i
= new_n_div
- 1; i
>= 0; --i
) {
1477 if (j
>= 0 && exp
[j
] == i
) {
1479 isl_int_swap(aff
->v
->el
[offset
+ i
],
1480 aff
->v
->el
[offset
+ j
]);
1483 isl_int_set_si(aff
->v
->el
[offset
+ i
], 0);
1486 aff
->ls
= isl_local_space_replace_divs(aff
->ls
, isl_mat_copy(div
));
1497 /* Add two affine expressions that live in the same local space.
1499 static __isl_give isl_aff
*add_expanded(__isl_take isl_aff
*aff1
,
1500 __isl_take isl_aff
*aff2
)
1504 aff1
= isl_aff_cow(aff1
);
1508 aff1
->v
= isl_vec_cow(aff1
->v
);
1514 isl_int_gcd(gcd
, aff1
->v
->el
[0], aff2
->v
->el
[0]);
1515 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1516 isl_seq_scale(aff1
->v
->el
+ 1, aff1
->v
->el
+ 1, f
, aff1
->v
->size
- 1);
1517 isl_int_divexact(f
, aff1
->v
->el
[0], gcd
);
1518 isl_seq_addmul(aff1
->v
->el
+ 1, f
, aff2
->v
->el
+ 1, aff1
->v
->size
- 1);
1519 isl_int_divexact(f
, aff2
->v
->el
[0], gcd
);
1520 isl_int_mul(aff1
->v
->el
[0], aff1
->v
->el
[0], f
);
1532 __isl_give isl_aff
*isl_aff_add(__isl_take isl_aff
*aff1
,
1533 __isl_take isl_aff
*aff2
)
1544 ctx
= isl_aff_get_ctx(aff1
);
1545 if (!isl_space_is_equal(aff1
->ls
->dim
, aff2
->ls
->dim
))
1546 isl_die(ctx
, isl_error_invalid
,
1547 "spaces don't match", goto error
);
1549 n_div1
= isl_aff_dim(aff1
, isl_dim_div
);
1550 n_div2
= isl_aff_dim(aff2
, isl_dim_div
);
1551 if (n_div1
== 0 && n_div2
== 0)
1552 return add_expanded(aff1
, aff2
);
1554 exp1
= isl_alloc_array(ctx
, int, n_div1
);
1555 exp2
= isl_alloc_array(ctx
, int, n_div2
);
1556 if ((n_div1
&& !exp1
) || (n_div2
&& !exp2
))
1559 div
= isl_merge_divs(aff1
->ls
->div
, aff2
->ls
->div
, exp1
, exp2
);
1560 aff1
= isl_aff_expand_divs(aff1
, isl_mat_copy(div
), exp1
);
1561 aff2
= isl_aff_expand_divs(aff2
, div
, exp2
);
1565 return add_expanded(aff1
, aff2
);
1574 __isl_give isl_aff
*isl_aff_sub(__isl_take isl_aff
*aff1
,
1575 __isl_take isl_aff
*aff2
)
1577 return isl_aff_add(aff1
, isl_aff_neg(aff2
));
1580 __isl_give isl_aff
*isl_aff_scale(__isl_take isl_aff
*aff
, isl_int f
)
1584 if (isl_int_is_one(f
))
1587 aff
= isl_aff_cow(aff
);
1590 aff
->v
= isl_vec_cow(aff
->v
);
1592 return isl_aff_free(aff
);
1594 if (isl_int_is_pos(f
) && isl_int_is_divisible_by(aff
->v
->el
[0], f
)) {
1595 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], f
);
1600 isl_int_gcd(gcd
, aff
->v
->el
[0], f
);
1601 isl_int_divexact(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1602 isl_int_divexact(gcd
, f
, gcd
);
1603 isl_seq_scale(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1609 /* Multiple "aff" by "v".
1611 __isl_give isl_aff
*isl_aff_scale_val(__isl_take isl_aff
*aff
,
1612 __isl_take isl_val
*v
)
1617 if (isl_val_is_one(v
)) {
1622 if (!isl_val_is_rat(v
))
1623 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1624 "expecting rational factor", goto error
);
1626 aff
= isl_aff_scale(aff
, v
->n
);
1627 aff
= isl_aff_scale_down(aff
, v
->d
);
1637 __isl_give isl_aff
*isl_aff_scale_down(__isl_take isl_aff
*aff
, isl_int f
)
1641 if (isl_int_is_one(f
))
1644 aff
= isl_aff_cow(aff
);
1648 if (isl_int_is_zero(f
))
1649 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1650 "cannot scale down by zero", return isl_aff_free(aff
));
1652 aff
->v
= isl_vec_cow(aff
->v
);
1654 return isl_aff_free(aff
);
1657 isl_seq_gcd(aff
->v
->el
+ 1, aff
->v
->size
- 1, &gcd
);
1658 isl_int_gcd(gcd
, gcd
, f
);
1659 isl_seq_scale_down(aff
->v
->el
+ 1, aff
->v
->el
+ 1, gcd
, aff
->v
->size
- 1);
1660 isl_int_divexact(gcd
, f
, gcd
);
1661 isl_int_mul(aff
->v
->el
[0], aff
->v
->el
[0], gcd
);
1667 /* Divide "aff" by "v".
1669 __isl_give isl_aff
*isl_aff_scale_down_val(__isl_take isl_aff
*aff
,
1670 __isl_take isl_val
*v
)
1675 if (isl_val_is_one(v
)) {
1680 if (!isl_val_is_rat(v
))
1681 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1682 "expecting rational factor", goto error
);
1683 if (!isl_val_is_pos(v
))
1684 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
1685 "factor needs to be positive", goto error
);
1687 aff
= isl_aff_scale(aff
, v
->d
);
1688 aff
= isl_aff_scale_down(aff
, v
->n
);
1698 __isl_give isl_aff
*isl_aff_scale_down_ui(__isl_take isl_aff
*aff
, unsigned f
)
1706 isl_int_set_ui(v
, f
);
1707 aff
= isl_aff_scale_down(aff
, v
);
1713 __isl_give isl_aff
*isl_aff_set_dim_name(__isl_take isl_aff
*aff
,
1714 enum isl_dim_type type
, unsigned pos
, const char *s
)
1716 aff
= isl_aff_cow(aff
);
1719 if (type
== isl_dim_out
)
1720 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1721 "cannot set name of output/set dimension",
1722 return isl_aff_free(aff
));
1723 if (type
== isl_dim_in
)
1725 aff
->ls
= isl_local_space_set_dim_name(aff
->ls
, type
, pos
, s
);
1727 return isl_aff_free(aff
);
1732 __isl_give isl_aff
*isl_aff_set_dim_id(__isl_take isl_aff
*aff
,
1733 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
1735 aff
= isl_aff_cow(aff
);
1737 return isl_id_free(id
);
1738 if (type
== isl_dim_out
)
1739 isl_die(aff
->v
->ctx
, isl_error_invalid
,
1740 "cannot set name of output/set dimension",
1742 if (type
== isl_dim_in
)
1744 aff
->ls
= isl_local_space_set_dim_id(aff
->ls
, type
, pos
, id
);
1746 return isl_aff_free(aff
);
1755 /* Exploit the equalities in "eq" to simplify the affine expression
1756 * and the expressions of the integer divisions in the local space.
1757 * The integer divisions in this local space are assumed to appear
1758 * as regular dimensions in "eq".
1760 static __isl_give isl_aff
*isl_aff_substitute_equalities_lifted(
1761 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
1769 if (eq
->n_eq
== 0) {
1770 isl_basic_set_free(eq
);
1774 aff
= isl_aff_cow(aff
);
1778 aff
->ls
= isl_local_space_substitute_equalities(aff
->ls
,
1779 isl_basic_set_copy(eq
));
1780 aff
->v
= isl_vec_cow(aff
->v
);
1781 if (!aff
->ls
|| !aff
->v
)
1784 total
= 1 + isl_space_dim(eq
->dim
, isl_dim_all
);
1786 for (i
= 0; i
< eq
->n_eq
; ++i
) {
1787 j
= isl_seq_last_non_zero(eq
->eq
[i
], total
+ n_div
);
1788 if (j
< 0 || j
== 0 || j
>= total
)
1791 isl_seq_elim(aff
->v
->el
+ 1, eq
->eq
[i
], j
, total
,
1795 isl_basic_set_free(eq
);
1796 aff
= isl_aff_normalize(aff
);
1799 isl_basic_set_free(eq
);
1804 /* Exploit the equalities in "eq" to simplify the affine expression
1805 * and the expressions of the integer divisions in the local space.
1807 static __isl_give isl_aff
*isl_aff_substitute_equalities(
1808 __isl_take isl_aff
*aff
, __isl_take isl_basic_set
*eq
)
1814 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1816 eq
= isl_basic_set_add_dims(eq
, isl_dim_set
, n_div
);
1817 return isl_aff_substitute_equalities_lifted(aff
, eq
);
1819 isl_basic_set_free(eq
);
1824 /* Look for equalities among the variables shared by context and aff
1825 * and the integer divisions of aff, if any.
1826 * The equalities are then used to eliminate coefficients and/or integer
1827 * divisions from aff.
1829 __isl_give isl_aff
*isl_aff_gist(__isl_take isl_aff
*aff
,
1830 __isl_take isl_set
*context
)
1832 isl_basic_set
*hull
;
1837 n_div
= isl_local_space_dim(aff
->ls
, isl_dim_div
);
1839 isl_basic_set
*bset
;
1840 isl_local_space
*ls
;
1841 context
= isl_set_add_dims(context
, isl_dim_set
, n_div
);
1842 ls
= isl_aff_get_domain_local_space(aff
);
1843 bset
= isl_basic_set_from_local_space(ls
);
1844 bset
= isl_basic_set_lift(bset
);
1845 bset
= isl_basic_set_flatten(bset
);
1846 context
= isl_set_intersect(context
,
1847 isl_set_from_basic_set(bset
));
1850 hull
= isl_set_affine_hull(context
);
1851 return isl_aff_substitute_equalities_lifted(aff
, hull
);
1854 isl_set_free(context
);
1858 __isl_give isl_aff
*isl_aff_gist_params(__isl_take isl_aff
*aff
,
1859 __isl_take isl_set
*context
)
1861 isl_set
*dom_context
= isl_set_universe(isl_aff_get_domain_space(aff
));
1862 dom_context
= isl_set_intersect_params(dom_context
, context
);
1863 return isl_aff_gist(aff
, dom_context
);
1866 /* Return a basic set containing those elements in the space
1867 * of aff where it is non-negative.
1868 * If "rational" is set, then return a rational basic set.
1870 static __isl_give isl_basic_set
*aff_nonneg_basic_set(
1871 __isl_take isl_aff
*aff
, int rational
)
1873 isl_constraint
*ineq
;
1874 isl_basic_set
*bset
;
1876 ineq
= isl_inequality_from_aff(aff
);
1878 bset
= isl_basic_set_from_constraint(ineq
);
1880 bset
= isl_basic_set_set_rational(bset
);
1881 bset
= isl_basic_set_simplify(bset
);
1885 /* Return a basic set containing those elements in the space
1886 * of aff where it is non-negative.
1888 __isl_give isl_basic_set
*isl_aff_nonneg_basic_set(__isl_take isl_aff
*aff
)
1890 return aff_nonneg_basic_set(aff
, 0);
1893 /* Return a basic set containing those elements in the domain space
1894 * of aff where it is negative.
1896 __isl_give isl_basic_set
*isl_aff_neg_basic_set(__isl_take isl_aff
*aff
)
1898 aff
= isl_aff_neg(aff
);
1899 aff
= isl_aff_add_constant_num_si(aff
, -1);
1900 return isl_aff_nonneg_basic_set(aff
);
1903 /* Return a basic set containing those elements in the space
1904 * of aff where it is zero.
1905 * If "rational" is set, then return a rational basic set.
1907 static __isl_give isl_basic_set
*aff_zero_basic_set(__isl_take isl_aff
*aff
,
1910 isl_constraint
*ineq
;
1911 isl_basic_set
*bset
;
1913 ineq
= isl_equality_from_aff(aff
);
1915 bset
= isl_basic_set_from_constraint(ineq
);
1917 bset
= isl_basic_set_set_rational(bset
);
1918 bset
= isl_basic_set_simplify(bset
);
1922 /* Return a basic set containing those elements in the space
1923 * of aff where it is zero.
1925 __isl_give isl_basic_set
*isl_aff_zero_basic_set(__isl_take isl_aff
*aff
)
1927 return aff_zero_basic_set(aff
, 0);
1930 /* Return a basic set containing those elements in the shared space
1931 * of aff1 and aff2 where aff1 is greater than or equal to aff2.
1933 __isl_give isl_basic_set
*isl_aff_ge_basic_set(__isl_take isl_aff
*aff1
,
1934 __isl_take isl_aff
*aff2
)
1936 aff1
= isl_aff_sub(aff1
, aff2
);
1938 return isl_aff_nonneg_basic_set(aff1
);
1941 /* Return a basic set containing those elements in the shared space
1942 * of aff1 and aff2 where aff1 is smaller than or equal to aff2.
1944 __isl_give isl_basic_set
*isl_aff_le_basic_set(__isl_take isl_aff
*aff1
,
1945 __isl_take isl_aff
*aff2
)
1947 return isl_aff_ge_basic_set(aff2
, aff1
);
1950 __isl_give isl_aff
*isl_aff_add_on_domain(__isl_keep isl_set
*dom
,
1951 __isl_take isl_aff
*aff1
, __isl_take isl_aff
*aff2
)
1953 aff1
= isl_aff_add(aff1
, aff2
);
1954 aff1
= isl_aff_gist(aff1
, isl_set_copy(dom
));
1958 int isl_aff_is_empty(__isl_keep isl_aff
*aff
)
1966 /* Check whether the given affine expression has non-zero coefficient
1967 * for any dimension in the given range or if any of these dimensions
1968 * appear with non-zero coefficients in any of the integer divisions
1969 * involved in the affine expression.
1971 int isl_aff_involves_dims(__isl_keep isl_aff
*aff
,
1972 enum isl_dim_type type
, unsigned first
, unsigned n
)
1984 ctx
= isl_aff_get_ctx(aff
);
1985 if (first
+ n
> isl_aff_dim(aff
, type
))
1986 isl_die(ctx
, isl_error_invalid
,
1987 "range out of bounds", return -1);
1989 active
= isl_local_space_get_active(aff
->ls
, aff
->v
->el
+ 2);
1993 first
+= isl_local_space_offset(aff
->ls
, type
) - 1;
1994 for (i
= 0; i
< n
; ++i
)
1995 if (active
[first
+ i
]) {
2008 __isl_give isl_aff
*isl_aff_drop_dims(__isl_take isl_aff
*aff
,
2009 enum isl_dim_type type
, unsigned first
, unsigned n
)
2015 if (type
== isl_dim_out
)
2016 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2017 "cannot drop output/set dimension",
2018 return isl_aff_free(aff
));
2019 if (type
== isl_dim_in
)
2021 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2024 ctx
= isl_aff_get_ctx(aff
);
2025 if (first
+ n
> isl_local_space_dim(aff
->ls
, type
))
2026 isl_die(ctx
, isl_error_invalid
, "range out of bounds",
2027 return isl_aff_free(aff
));
2029 aff
= isl_aff_cow(aff
);
2033 aff
->ls
= isl_local_space_drop_dims(aff
->ls
, type
, first
, n
);
2035 return isl_aff_free(aff
);
2037 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2038 aff
->v
= isl_vec_drop_els(aff
->v
, first
, n
);
2040 return isl_aff_free(aff
);
2045 /* Project the domain of the affine expression onto its parameter space.
2046 * The affine expression may not involve any of the domain dimensions.
2048 __isl_give isl_aff
*isl_aff_project_domain_on_params(__isl_take isl_aff
*aff
)
2054 n
= isl_aff_dim(aff
, isl_dim_in
);
2055 involves
= isl_aff_involves_dims(aff
, isl_dim_in
, 0, n
);
2057 return isl_aff_free(aff
);
2059 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2060 "affine expression involves some of the domain dimensions",
2061 return isl_aff_free(aff
));
2062 aff
= isl_aff_drop_dims(aff
, isl_dim_in
, 0, n
);
2063 space
= isl_aff_get_domain_space(aff
);
2064 space
= isl_space_params(space
);
2065 aff
= isl_aff_reset_domain_space(aff
, space
);
2069 __isl_give isl_aff
*isl_aff_insert_dims(__isl_take isl_aff
*aff
,
2070 enum isl_dim_type type
, unsigned first
, unsigned n
)
2076 if (type
== isl_dim_out
)
2077 isl_die(aff
->v
->ctx
, isl_error_invalid
,
2078 "cannot insert output/set dimensions",
2079 return isl_aff_free(aff
));
2080 if (type
== isl_dim_in
)
2082 if (n
== 0 && !isl_local_space_is_named_or_nested(aff
->ls
, type
))
2085 ctx
= isl_aff_get_ctx(aff
);
2086 if (first
> isl_local_space_dim(aff
->ls
, type
))
2087 isl_die(ctx
, isl_error_invalid
, "position out of bounds",
2088 return isl_aff_free(aff
));
2090 aff
= isl_aff_cow(aff
);
2094 aff
->ls
= isl_local_space_insert_dims(aff
->ls
, type
, first
, n
);
2096 return isl_aff_free(aff
);
2098 first
+= 1 + isl_local_space_offset(aff
->ls
, type
);
2099 aff
->v
= isl_vec_insert_zero_els(aff
->v
, first
, n
);
2101 return isl_aff_free(aff
);
2106 __isl_give isl_aff
*isl_aff_add_dims(__isl_take isl_aff
*aff
,
2107 enum isl_dim_type type
, unsigned n
)
2111 pos
= isl_aff_dim(aff
, type
);
2113 return isl_aff_insert_dims(aff
, type
, pos
, n
);
2116 __isl_give isl_pw_aff
*isl_pw_aff_add_dims(__isl_take isl_pw_aff
*pwaff
,
2117 enum isl_dim_type type
, unsigned n
)
2121 pos
= isl_pw_aff_dim(pwaff
, type
);
2123 return isl_pw_aff_insert_dims(pwaff
, type
, pos
, n
);
2126 /* Move the "n" dimensions of "src_type" starting at "src_pos" of "aff"
2127 * to dimensions of "dst_type" at "dst_pos".
2129 * We only support moving input dimensions to parameters and vice versa.
2131 __isl_give isl_aff
*isl_aff_move_dims(__isl_take isl_aff
*aff
,
2132 enum isl_dim_type dst_type
, unsigned dst_pos
,
2133 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2141 !isl_local_space_is_named_or_nested(aff
->ls
, src_type
) &&
2142 !isl_local_space_is_named_or_nested(aff
->ls
, dst_type
))
2145 if (dst_type
== isl_dim_out
|| src_type
== isl_dim_out
)
2146 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2147 "cannot move output/set dimension", isl_aff_free(aff
));
2148 if (dst_type
== isl_dim_div
|| src_type
== isl_dim_div
)
2149 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2150 "cannot move divs", isl_aff_free(aff
));
2151 if (dst_type
== isl_dim_in
)
2152 dst_type
= isl_dim_set
;
2153 if (src_type
== isl_dim_in
)
2154 src_type
= isl_dim_set
;
2156 if (src_pos
+ n
> isl_local_space_dim(aff
->ls
, src_type
))
2157 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
2158 "range out of bounds", isl_aff_free(aff
));
2159 if (dst_type
== src_type
)
2160 isl_die(isl_aff_get_ctx(aff
), isl_error_unsupported
,
2161 "moving dims within the same type not supported",
2164 aff
= isl_aff_cow(aff
);
2168 g_src_pos
= 1 + isl_local_space_offset(aff
->ls
, src_type
) + src_pos
;
2169 g_dst_pos
= 1 + isl_local_space_offset(aff
->ls
, dst_type
) + dst_pos
;
2170 if (dst_type
> src_type
)
2173 aff
->v
= isl_vec_move_els(aff
->v
, g_dst_pos
, g_src_pos
, n
);
2174 aff
->ls
= isl_local_space_move_dims(aff
->ls
, dst_type
, dst_pos
,
2175 src_type
, src_pos
, n
);
2176 if (!aff
->v
|| !aff
->ls
)
2177 return isl_aff_free(aff
);
2179 aff
= sort_divs(aff
);
2184 __isl_give isl_pw_aff
*isl_pw_aff_from_aff(__isl_take isl_aff
*aff
)
2186 isl_set
*dom
= isl_set_universe(isl_aff_get_domain_space(aff
));
2187 return isl_pw_aff_alloc(dom
, aff
);
2191 #define PW isl_pw_aff
2195 #define EL_IS_ZERO is_empty
2199 #define IS_ZERO is_empty
2202 #undef DEFAULT_IS_ZERO
2203 #define DEFAULT_IS_ZERO 0
2210 #include <isl_pw_templ.c>
2212 static __isl_give isl_set
*align_params_pw_pw_set_and(
2213 __isl_take isl_pw_aff
*pwaff1
, __isl_take isl_pw_aff
*pwaff2
,
2214 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
2215 __isl_take isl_pw_aff
*pwaff2
))
2217 if (!pwaff1
|| !pwaff2
)
2219 if (isl_space_match(pwaff1
->dim
, isl_dim_param
,
2220 pwaff2
->dim
, isl_dim_param
))
2221 return fn(pwaff1
, pwaff2
);
2222 if (!isl_space_has_named_params(pwaff1
->dim
) ||
2223 !isl_space_has_named_params(pwaff2
->dim
))
2224 isl_die(isl_pw_aff_get_ctx(pwaff1
), isl_error_invalid
,
2225 "unaligned unnamed parameters", goto error
);
2226 pwaff1
= isl_pw_aff_align_params(pwaff1
, isl_pw_aff_get_space(pwaff2
));
2227 pwaff2
= isl_pw_aff_align_params(pwaff2
, isl_pw_aff_get_space(pwaff1
));
2228 return fn(pwaff1
, pwaff2
);
2230 isl_pw_aff_free(pwaff1
);
2231 isl_pw_aff_free(pwaff2
);
2235 /* Compute a piecewise quasi-affine expression with a domain that
2236 * is the union of those of pwaff1 and pwaff2 and such that on each
2237 * cell, the quasi-affine expression is the better (according to cmp)
2238 * of those of pwaff1 and pwaff2. If only one of pwaff1 or pwaff2
2239 * is defined on a given cell, then the associated expression
2240 * is the defined one.
2242 static __isl_give isl_pw_aff
*pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
2243 __isl_take isl_pw_aff
*pwaff2
,
2244 __isl_give isl_basic_set
*(*cmp
)(__isl_take isl_aff
*aff1
,
2245 __isl_take isl_aff
*aff2
))
2252 if (!pwaff1
|| !pwaff2
)
2255 ctx
= isl_space_get_ctx(pwaff1
->dim
);
2256 if (!isl_space_is_equal(pwaff1
->dim
, pwaff2
->dim
))
2257 isl_die(ctx
, isl_error_invalid
,
2258 "arguments should live in same space", goto error
);
2260 if (isl_pw_aff_is_empty(pwaff1
)) {
2261 isl_pw_aff_free(pwaff1
);
2265 if (isl_pw_aff_is_empty(pwaff2
)) {
2266 isl_pw_aff_free(pwaff2
);
2270 n
= 2 * (pwaff1
->n
+ 1) * (pwaff2
->n
+ 1);
2271 res
= isl_pw_aff_alloc_size(isl_space_copy(pwaff1
->dim
), n
);
2273 for (i
= 0; i
< pwaff1
->n
; ++i
) {
2274 set
= isl_set_copy(pwaff1
->p
[i
].set
);
2275 for (j
= 0; j
< pwaff2
->n
; ++j
) {
2276 struct isl_set
*common
;
2279 common
= isl_set_intersect(
2280 isl_set_copy(pwaff1
->p
[i
].set
),
2281 isl_set_copy(pwaff2
->p
[j
].set
));
2282 better
= isl_set_from_basic_set(cmp(
2283 isl_aff_copy(pwaff2
->p
[j
].aff
),
2284 isl_aff_copy(pwaff1
->p
[i
].aff
)));
2285 better
= isl_set_intersect(common
, better
);
2286 if (isl_set_plain_is_empty(better
)) {
2287 isl_set_free(better
);
2290 set
= isl_set_subtract(set
, isl_set_copy(better
));
2292 res
= isl_pw_aff_add_piece(res
, better
,
2293 isl_aff_copy(pwaff2
->p
[j
].aff
));
2295 res
= isl_pw_aff_add_piece(res
, set
,
2296 isl_aff_copy(pwaff1
->p
[i
].aff
));
2299 for (j
= 0; j
< pwaff2
->n
; ++j
) {
2300 set
= isl_set_copy(pwaff2
->p
[j
].set
);
2301 for (i
= 0; i
< pwaff1
->n
; ++i
)
2302 set
= isl_set_subtract(set
,
2303 isl_set_copy(pwaff1
->p
[i
].set
));
2304 res
= isl_pw_aff_add_piece(res
, set
,
2305 isl_aff_copy(pwaff2
->p
[j
].aff
));
2308 isl_pw_aff_free(pwaff1
);
2309 isl_pw_aff_free(pwaff2
);
2313 isl_pw_aff_free(pwaff1
);
2314 isl_pw_aff_free(pwaff2
);
2318 /* Compute a piecewise quasi-affine expression with a domain that
2319 * is the union of those of pwaff1 and pwaff2 and such that on each
2320 * cell, the quasi-affine expression is the maximum of those of pwaff1
2321 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2322 * cell, then the associated expression is the defined one.
2324 static __isl_give isl_pw_aff
*pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2325 __isl_take isl_pw_aff
*pwaff2
)
2327 return pw_aff_union_opt(pwaff1
, pwaff2
, &isl_aff_ge_basic_set
);
2330 __isl_give isl_pw_aff
*isl_pw_aff_union_max(__isl_take isl_pw_aff
*pwaff1
,
2331 __isl_take isl_pw_aff
*pwaff2
)
2333 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2337 /* Compute a piecewise quasi-affine expression with a domain that
2338 * is the union of those of pwaff1 and pwaff2 and such that on each
2339 * cell, the quasi-affine expression is the minimum of those of pwaff1
2340 * and pwaff2. If only one of pwaff1 or pwaff2 is defined on a given
2341 * cell, then the associated expression is the defined one.
2343 static __isl_give isl_pw_aff
*pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2344 __isl_take isl_pw_aff
*pwaff2
)
2346 return pw_aff_union_opt(pwaff1
, pwaff2
, &isl_aff_le_basic_set
);
2349 __isl_give isl_pw_aff
*isl_pw_aff_union_min(__isl_take isl_pw_aff
*pwaff1
,
2350 __isl_take isl_pw_aff
*pwaff2
)
2352 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
,
2356 __isl_give isl_pw_aff
*isl_pw_aff_union_opt(__isl_take isl_pw_aff
*pwaff1
,
2357 __isl_take isl_pw_aff
*pwaff2
, int max
)
2360 return isl_pw_aff_union_max(pwaff1
, pwaff2
);
2362 return isl_pw_aff_union_min(pwaff1
, pwaff2
);
2365 /* Construct a map with as domain the domain of pwaff and
2366 * one-dimensional range corresponding to the affine expressions.
2368 static __isl_give isl_map
*map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2377 dim
= isl_pw_aff_get_space(pwaff
);
2378 map
= isl_map_empty(dim
);
2380 for (i
= 0; i
< pwaff
->n
; ++i
) {
2381 isl_basic_map
*bmap
;
2384 bmap
= isl_basic_map_from_aff(isl_aff_copy(pwaff
->p
[i
].aff
));
2385 map_i
= isl_map_from_basic_map(bmap
);
2386 map_i
= isl_map_intersect_domain(map_i
,
2387 isl_set_copy(pwaff
->p
[i
].set
));
2388 map
= isl_map_union_disjoint(map
, map_i
);
2391 isl_pw_aff_free(pwaff
);
2396 /* Construct a map with as domain the domain of pwaff and
2397 * one-dimensional range corresponding to the affine expressions.
2399 __isl_give isl_map
*isl_map_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2403 if (isl_space_is_set(pwaff
->dim
))
2404 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2405 "space of input is not a map",
2406 return isl_pw_aff_free(pwaff
));
2407 return map_from_pw_aff(pwaff
);
2410 /* Construct a one-dimensional set with as parameter domain
2411 * the domain of pwaff and the single set dimension
2412 * corresponding to the affine expressions.
2414 __isl_give isl_set
*isl_set_from_pw_aff(__isl_take isl_pw_aff
*pwaff
)
2418 if (!isl_space_is_set(pwaff
->dim
))
2419 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2420 "space of input is not a set",
2421 return isl_pw_aff_free(pwaff
));
2422 return map_from_pw_aff(pwaff
);
2425 /* Return a set containing those elements in the domain
2426 * of pwaff where it is non-negative.
2428 __isl_give isl_set
*isl_pw_aff_nonneg_set(__isl_take isl_pw_aff
*pwaff
)
2436 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
2438 for (i
= 0; i
< pwaff
->n
; ++i
) {
2439 isl_basic_set
*bset
;
2443 rational
= isl_set_has_rational(pwaff
->p
[i
].set
);
2444 bset
= aff_nonneg_basic_set(isl_aff_copy(pwaff
->p
[i
].aff
),
2446 set_i
= isl_set_from_basic_set(bset
);
2447 set_i
= isl_set_intersect(set_i
, isl_set_copy(pwaff
->p
[i
].set
));
2448 set
= isl_set_union_disjoint(set
, set_i
);
2451 isl_pw_aff_free(pwaff
);
2456 /* Return a set containing those elements in the domain
2457 * of pwaff where it is zero (if complement is 0) or not zero
2458 * (if complement is 1).
2460 static __isl_give isl_set
*pw_aff_zero_set(__isl_take isl_pw_aff
*pwaff
,
2469 set
= isl_set_empty(isl_pw_aff_get_domain_space(pwaff
));
2471 for (i
= 0; i
< pwaff
->n
; ++i
) {
2472 isl_basic_set
*bset
;
2473 isl_set
*set_i
, *zero
;
2476 rational
= isl_set_has_rational(pwaff
->p
[i
].set
);
2477 bset
= aff_zero_basic_set(isl_aff_copy(pwaff
->p
[i
].aff
),
2479 zero
= isl_set_from_basic_set(bset
);
2480 set_i
= isl_set_copy(pwaff
->p
[i
].set
);
2482 set_i
= isl_set_subtract(set_i
, zero
);
2484 set_i
= isl_set_intersect(set_i
, zero
);
2485 set
= isl_set_union_disjoint(set
, set_i
);
2488 isl_pw_aff_free(pwaff
);
2493 /* Return a set containing those elements in the domain
2494 * of pwaff where it is zero.
2496 __isl_give isl_set
*isl_pw_aff_zero_set(__isl_take isl_pw_aff
*pwaff
)
2498 return pw_aff_zero_set(pwaff
, 0);
2501 /* Return a set containing those elements in the domain
2502 * of pwaff where it is not zero.
2504 __isl_give isl_set
*isl_pw_aff_non_zero_set(__isl_take isl_pw_aff
*pwaff
)
2506 return pw_aff_zero_set(pwaff
, 1);
2509 /* Return a set containing those elements in the shared domain
2510 * of pwaff1 and pwaff2 where pwaff1 is greater than (or equal) to pwaff2.
2512 * We compute the difference on the shared domain and then construct
2513 * the set of values where this difference is non-negative.
2514 * If strict is set, we first subtract 1 from the difference.
2515 * If equal is set, we only return the elements where pwaff1 and pwaff2
2518 static __isl_give isl_set
*pw_aff_gte_set(__isl_take isl_pw_aff
*pwaff1
,
2519 __isl_take isl_pw_aff
*pwaff2
, int strict
, int equal
)
2521 isl_set
*set1
, *set2
;
2523 set1
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
));
2524 set2
= isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
));
2525 set1
= isl_set_intersect(set1
, set2
);
2526 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, isl_set_copy(set1
));
2527 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, isl_set_copy(set1
));
2528 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_neg(pwaff2
));
2531 isl_space
*dim
= isl_set_get_space(set1
);
2533 aff
= isl_aff_zero_on_domain(isl_local_space_from_space(dim
));
2534 aff
= isl_aff_add_constant_si(aff
, -1);
2535 pwaff1
= isl_pw_aff_add(pwaff1
, isl_pw_aff_alloc(set1
, aff
));
2540 return isl_pw_aff_zero_set(pwaff1
);
2541 return isl_pw_aff_nonneg_set(pwaff1
);
2544 /* Return a set containing those elements in the shared domain
2545 * of pwaff1 and pwaff2 where pwaff1 is equal to pwaff2.
2547 static __isl_give isl_set
*pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2548 __isl_take isl_pw_aff
*pwaff2
)
2550 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 1);
2553 __isl_give isl_set
*isl_pw_aff_eq_set(__isl_take isl_pw_aff
*pwaff1
,
2554 __isl_take isl_pw_aff
*pwaff2
)
2556 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_eq_set
);
2559 /* Return a set containing those elements in the shared domain
2560 * of pwaff1 and pwaff2 where pwaff1 is greater than or equal to pwaff2.
2562 static __isl_give isl_set
*pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2563 __isl_take isl_pw_aff
*pwaff2
)
2565 return pw_aff_gte_set(pwaff1
, pwaff2
, 0, 0);
2568 __isl_give isl_set
*isl_pw_aff_ge_set(__isl_take isl_pw_aff
*pwaff1
,
2569 __isl_take isl_pw_aff
*pwaff2
)
2571 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ge_set
);
2574 /* Return a set containing those elements in the shared domain
2575 * of pwaff1 and pwaff2 where pwaff1 is strictly greater than pwaff2.
2577 static __isl_give isl_set
*pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2578 __isl_take isl_pw_aff
*pwaff2
)
2580 return pw_aff_gte_set(pwaff1
, pwaff2
, 1, 0);
2583 __isl_give isl_set
*isl_pw_aff_gt_set(__isl_take isl_pw_aff
*pwaff1
,
2584 __isl_take isl_pw_aff
*pwaff2
)
2586 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_gt_set
);
2589 __isl_give isl_set
*isl_pw_aff_le_set(__isl_take isl_pw_aff
*pwaff1
,
2590 __isl_take isl_pw_aff
*pwaff2
)
2592 return isl_pw_aff_ge_set(pwaff2
, pwaff1
);
2595 __isl_give isl_set
*isl_pw_aff_lt_set(__isl_take isl_pw_aff
*pwaff1
,
2596 __isl_take isl_pw_aff
*pwaff2
)
2598 return isl_pw_aff_gt_set(pwaff2
, pwaff1
);
2601 /* Return a set containing those elements in the shared domain
2602 * of the elements of list1 and list2 where each element in list1
2603 * has the relation specified by "fn" with each element in list2.
2605 static __isl_give isl_set
*pw_aff_list_set(__isl_take isl_pw_aff_list
*list1
,
2606 __isl_take isl_pw_aff_list
*list2
,
2607 __isl_give isl_set
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
2608 __isl_take isl_pw_aff
*pwaff2
))
2614 if (!list1
|| !list2
)
2617 ctx
= isl_pw_aff_list_get_ctx(list1
);
2618 if (list1
->n
< 1 || list2
->n
< 1)
2619 isl_die(ctx
, isl_error_invalid
,
2620 "list should contain at least one element", goto error
);
2622 set
= isl_set_universe(isl_pw_aff_get_domain_space(list1
->p
[0]));
2623 for (i
= 0; i
< list1
->n
; ++i
)
2624 for (j
= 0; j
< list2
->n
; ++j
) {
2627 set_ij
= fn(isl_pw_aff_copy(list1
->p
[i
]),
2628 isl_pw_aff_copy(list2
->p
[j
]));
2629 set
= isl_set_intersect(set
, set_ij
);
2632 isl_pw_aff_list_free(list1
);
2633 isl_pw_aff_list_free(list2
);
2636 isl_pw_aff_list_free(list1
);
2637 isl_pw_aff_list_free(list2
);
2641 /* Return a set containing those elements in the shared domain
2642 * of the elements of list1 and list2 where each element in list1
2643 * is equal to each element in list2.
2645 __isl_give isl_set
*isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list
*list1
,
2646 __isl_take isl_pw_aff_list
*list2
)
2648 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_eq_set
);
2651 __isl_give isl_set
*isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list
*list1
,
2652 __isl_take isl_pw_aff_list
*list2
)
2654 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ne_set
);
2657 /* Return a set containing those elements in the shared domain
2658 * of the elements of list1 and list2 where each element in list1
2659 * is less than or equal to each element in list2.
2661 __isl_give isl_set
*isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list
*list1
,
2662 __isl_take isl_pw_aff_list
*list2
)
2664 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_le_set
);
2667 __isl_give isl_set
*isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list
*list1
,
2668 __isl_take isl_pw_aff_list
*list2
)
2670 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_lt_set
);
2673 __isl_give isl_set
*isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list
*list1
,
2674 __isl_take isl_pw_aff_list
*list2
)
2676 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_ge_set
);
2679 __isl_give isl_set
*isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list
*list1
,
2680 __isl_take isl_pw_aff_list
*list2
)
2682 return pw_aff_list_set(list1
, list2
, &isl_pw_aff_gt_set
);
2686 /* Return a set containing those elements in the shared domain
2687 * of pwaff1 and pwaff2 where pwaff1 is not equal to pwaff2.
2689 static __isl_give isl_set
*pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
2690 __isl_take isl_pw_aff
*pwaff2
)
2692 isl_set
*set_lt
, *set_gt
;
2694 set_lt
= isl_pw_aff_lt_set(isl_pw_aff_copy(pwaff1
),
2695 isl_pw_aff_copy(pwaff2
));
2696 set_gt
= isl_pw_aff_gt_set(pwaff1
, pwaff2
);
2697 return isl_set_union_disjoint(set_lt
, set_gt
);
2700 __isl_give isl_set
*isl_pw_aff_ne_set(__isl_take isl_pw_aff
*pwaff1
,
2701 __isl_take isl_pw_aff
*pwaff2
)
2703 return align_params_pw_pw_set_and(pwaff1
, pwaff2
, &pw_aff_ne_set
);
2706 __isl_give isl_pw_aff
*isl_pw_aff_scale_down(__isl_take isl_pw_aff
*pwaff
,
2711 if (isl_int_is_one(v
))
2713 if (!isl_int_is_pos(v
))
2714 isl_die(isl_pw_aff_get_ctx(pwaff
), isl_error_invalid
,
2715 "factor needs to be positive",
2716 return isl_pw_aff_free(pwaff
));
2717 pwaff
= isl_pw_aff_cow(pwaff
);
2723 for (i
= 0; i
< pwaff
->n
; ++i
) {
2724 pwaff
->p
[i
].aff
= isl_aff_scale_down(pwaff
->p
[i
].aff
, v
);
2725 if (!pwaff
->p
[i
].aff
)
2726 return isl_pw_aff_free(pwaff
);
2732 /* Divide "pa" by "f".
2734 __isl_give isl_pw_aff
*isl_pw_aff_scale_down_val(__isl_take isl_pw_aff
*pa
,
2735 __isl_take isl_val
*f
)
2742 if (isl_val_is_one(f
)) {
2747 if (!isl_val_is_rat(f
))
2748 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
2749 "expecting rational factor", goto error
);
2750 if (!isl_val_is_pos(f
))
2751 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
2752 "factor needs to be positive", goto error
);
2754 pa
= isl_pw_aff_cow(pa
);
2760 for (i
= 0; i
< pa
->n
; ++i
) {
2761 pa
->p
[i
].aff
= isl_aff_scale_down_val(pa
->p
[i
].aff
,
2770 isl_pw_aff_free(pa
);
2775 __isl_give isl_pw_aff
*isl_pw_aff_floor(__isl_take isl_pw_aff
*pwaff
)
2779 pwaff
= isl_pw_aff_cow(pwaff
);
2785 for (i
= 0; i
< pwaff
->n
; ++i
) {
2786 pwaff
->p
[i
].aff
= isl_aff_floor(pwaff
->p
[i
].aff
);
2787 if (!pwaff
->p
[i
].aff
)
2788 return isl_pw_aff_free(pwaff
);
2794 __isl_give isl_pw_aff
*isl_pw_aff_ceil(__isl_take isl_pw_aff
*pwaff
)
2798 pwaff
= isl_pw_aff_cow(pwaff
);
2804 for (i
= 0; i
< pwaff
->n
; ++i
) {
2805 pwaff
->p
[i
].aff
= isl_aff_ceil(pwaff
->p
[i
].aff
);
2806 if (!pwaff
->p
[i
].aff
)
2807 return isl_pw_aff_free(pwaff
);
2813 /* Assuming that "cond1" and "cond2" are disjoint,
2814 * return an affine expression that is equal to pwaff1 on cond1
2815 * and to pwaff2 on cond2.
2817 static __isl_give isl_pw_aff
*isl_pw_aff_select(
2818 __isl_take isl_set
*cond1
, __isl_take isl_pw_aff
*pwaff1
,
2819 __isl_take isl_set
*cond2
, __isl_take isl_pw_aff
*pwaff2
)
2821 pwaff1
= isl_pw_aff_intersect_domain(pwaff1
, cond1
);
2822 pwaff2
= isl_pw_aff_intersect_domain(pwaff2
, cond2
);
2824 return isl_pw_aff_add_disjoint(pwaff1
, pwaff2
);
2827 /* Return an affine expression that is equal to pwaff_true for elements
2828 * where "cond" is non-zero and to pwaff_false for elements where "cond"
2830 * That is, return cond ? pwaff_true : pwaff_false;
2832 __isl_give isl_pw_aff
*isl_pw_aff_cond(__isl_take isl_pw_aff
*cond
,
2833 __isl_take isl_pw_aff
*pwaff_true
, __isl_take isl_pw_aff
*pwaff_false
)
2835 isl_set
*cond_true
, *cond_false
;
2837 cond_true
= isl_pw_aff_non_zero_set(isl_pw_aff_copy(cond
));
2838 cond_false
= isl_pw_aff_zero_set(cond
);
2839 return isl_pw_aff_select(cond_true
, pwaff_true
,
2840 cond_false
, pwaff_false
);
2843 int isl_aff_is_cst(__isl_keep isl_aff
*aff
)
2848 return isl_seq_first_non_zero(aff
->v
->el
+ 2, aff
->v
->size
- 2) == -1;
2851 /* Check whether pwaff is a piecewise constant.
2853 int isl_pw_aff_is_cst(__isl_keep isl_pw_aff
*pwaff
)
2860 for (i
= 0; i
< pwaff
->n
; ++i
) {
2861 int is_cst
= isl_aff_is_cst(pwaff
->p
[i
].aff
);
2862 if (is_cst
< 0 || !is_cst
)
2869 __isl_give isl_aff
*isl_aff_mul(__isl_take isl_aff
*aff1
,
2870 __isl_take isl_aff
*aff2
)
2872 if (!isl_aff_is_cst(aff2
) && isl_aff_is_cst(aff1
))
2873 return isl_aff_mul(aff2
, aff1
);
2875 if (!isl_aff_is_cst(aff2
))
2876 isl_die(isl_aff_get_ctx(aff1
), isl_error_invalid
,
2877 "at least one affine expression should be constant",
2880 aff1
= isl_aff_cow(aff1
);
2884 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[1]);
2885 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[0]);
2895 /* Divide "aff1" by "aff2", assuming "aff2" is a piecewise constant.
2897 __isl_give isl_aff
*isl_aff_div(__isl_take isl_aff
*aff1
,
2898 __isl_take isl_aff
*aff2
)
2903 is_cst
= isl_aff_is_cst(aff2
);
2907 isl_die(isl_aff_get_ctx(aff2
), isl_error_invalid
,
2908 "second argument should be a constant", goto error
);
2913 neg
= isl_int_is_neg(aff2
->v
->el
[1]);
2915 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
2916 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
2919 aff1
= isl_aff_scale(aff1
, aff2
->v
->el
[0]);
2920 aff1
= isl_aff_scale_down(aff1
, aff2
->v
->el
[1]);
2923 isl_int_neg(aff2
->v
->el
[0], aff2
->v
->el
[0]);
2924 isl_int_neg(aff2
->v
->el
[1], aff2
->v
->el
[1]);
2935 static __isl_give isl_pw_aff
*pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
2936 __isl_take isl_pw_aff
*pwaff2
)
2938 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_add
);
2941 __isl_give isl_pw_aff
*isl_pw_aff_add(__isl_take isl_pw_aff
*pwaff1
,
2942 __isl_take isl_pw_aff
*pwaff2
)
2944 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_add
);
2947 __isl_give isl_pw_aff
*isl_pw_aff_union_add(__isl_take isl_pw_aff
*pwaff1
,
2948 __isl_take isl_pw_aff
*pwaff2
)
2950 return isl_pw_aff_union_add_(pwaff1
, pwaff2
);
2953 static __isl_give isl_pw_aff
*pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
2954 __isl_take isl_pw_aff
*pwaff2
)
2956 return isl_pw_aff_on_shared_domain(pwaff1
, pwaff2
, &isl_aff_mul
);
2959 __isl_give isl_pw_aff
*isl_pw_aff_mul(__isl_take isl_pw_aff
*pwaff1
,
2960 __isl_take isl_pw_aff
*pwaff2
)
2962 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_mul
);
2965 static __isl_give isl_pw_aff
*pw_aff_div(__isl_take isl_pw_aff
*pa1
,
2966 __isl_take isl_pw_aff
*pa2
)
2968 return isl_pw_aff_on_shared_domain(pa1
, pa2
, &isl_aff_div
);
2971 /* Divide "pa1" by "pa2", assuming "pa2" is a piecewise constant.
2973 __isl_give isl_pw_aff
*isl_pw_aff_div(__isl_take isl_pw_aff
*pa1
,
2974 __isl_take isl_pw_aff
*pa2
)
2978 is_cst
= isl_pw_aff_is_cst(pa2
);
2982 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
2983 "second argument should be a piecewise constant",
2985 return isl_pw_aff_align_params_pw_pw_and(pa1
, pa2
, &pw_aff_div
);
2987 isl_pw_aff_free(pa1
);
2988 isl_pw_aff_free(pa2
);
2992 /* Compute the quotient of the integer division of "pa1" by "pa2"
2993 * with rounding towards zero.
2994 * "pa2" is assumed to be a piecewise constant.
2996 * In particular, return
2998 * pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2)
3001 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_q(__isl_take isl_pw_aff
*pa1
,
3002 __isl_take isl_pw_aff
*pa2
)
3008 is_cst
= isl_pw_aff_is_cst(pa2
);
3012 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3013 "second argument should be a piecewise constant",
3016 pa1
= isl_pw_aff_div(pa1
, pa2
);
3018 cond
= isl_pw_aff_nonneg_set(isl_pw_aff_copy(pa1
));
3019 f
= isl_pw_aff_floor(isl_pw_aff_copy(pa1
));
3020 c
= isl_pw_aff_ceil(pa1
);
3021 return isl_pw_aff_cond(isl_set_indicator_function(cond
), f
, c
);
3023 isl_pw_aff_free(pa1
);
3024 isl_pw_aff_free(pa2
);
3028 /* Compute the remainder of the integer division of "pa1" by "pa2"
3029 * with rounding towards zero.
3030 * "pa2" is assumed to be a piecewise constant.
3032 * In particular, return
3034 * pa1 - pa2 * (pa1 >= 0 ? floor(pa1/pa2) : ceil(pa1/pa2))
3037 __isl_give isl_pw_aff
*isl_pw_aff_tdiv_r(__isl_take isl_pw_aff
*pa1
,
3038 __isl_take isl_pw_aff
*pa2
)
3043 is_cst
= isl_pw_aff_is_cst(pa2
);
3047 isl_die(isl_pw_aff_get_ctx(pa2
), isl_error_invalid
,
3048 "second argument should be a piecewise constant",
3050 res
= isl_pw_aff_tdiv_q(isl_pw_aff_copy(pa1
), isl_pw_aff_copy(pa2
));
3051 res
= isl_pw_aff_mul(pa2
, res
);
3052 res
= isl_pw_aff_sub(pa1
, res
);
3055 isl_pw_aff_free(pa1
);
3056 isl_pw_aff_free(pa2
);
3060 static __isl_give isl_pw_aff
*pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3061 __isl_take isl_pw_aff
*pwaff2
)
3066 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3067 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3068 le
= isl_pw_aff_le_set(isl_pw_aff_copy(pwaff1
),
3069 isl_pw_aff_copy(pwaff2
));
3070 dom
= isl_set_subtract(dom
, isl_set_copy(le
));
3071 return isl_pw_aff_select(le
, pwaff1
, dom
, pwaff2
);
3074 __isl_give isl_pw_aff
*isl_pw_aff_min(__isl_take isl_pw_aff
*pwaff1
,
3075 __isl_take isl_pw_aff
*pwaff2
)
3077 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_min
);
3080 static __isl_give isl_pw_aff
*pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3081 __isl_take isl_pw_aff
*pwaff2
)
3086 dom
= isl_set_intersect(isl_pw_aff_domain(isl_pw_aff_copy(pwaff1
)),
3087 isl_pw_aff_domain(isl_pw_aff_copy(pwaff2
)));
3088 ge
= isl_pw_aff_ge_set(isl_pw_aff_copy(pwaff1
),
3089 isl_pw_aff_copy(pwaff2
));
3090 dom
= isl_set_subtract(dom
, isl_set_copy(ge
));
3091 return isl_pw_aff_select(ge
, pwaff1
, dom
, pwaff2
);
3094 __isl_give isl_pw_aff
*isl_pw_aff_max(__isl_take isl_pw_aff
*pwaff1
,
3095 __isl_take isl_pw_aff
*pwaff2
)
3097 return isl_pw_aff_align_params_pw_pw_and(pwaff1
, pwaff2
, &pw_aff_max
);
3100 static __isl_give isl_pw_aff
*pw_aff_list_reduce(
3101 __isl_take isl_pw_aff_list
*list
,
3102 __isl_give isl_pw_aff
*(*fn
)(__isl_take isl_pw_aff
*pwaff1
,
3103 __isl_take isl_pw_aff
*pwaff2
))
3112 ctx
= isl_pw_aff_list_get_ctx(list
);
3114 isl_die(ctx
, isl_error_invalid
,
3115 "list should contain at least one element",
3116 return isl_pw_aff_list_free(list
));
3118 res
= isl_pw_aff_copy(list
->p
[0]);
3119 for (i
= 1; i
< list
->n
; ++i
)
3120 res
= fn(res
, isl_pw_aff_copy(list
->p
[i
]));
3122 isl_pw_aff_list_free(list
);
3126 /* Return an isl_pw_aff that maps each element in the intersection of the
3127 * domains of the elements of list to the minimal corresponding affine
3130 __isl_give isl_pw_aff
*isl_pw_aff_list_min(__isl_take isl_pw_aff_list
*list
)
3132 return pw_aff_list_reduce(list
, &isl_pw_aff_min
);
3135 /* Return an isl_pw_aff that maps each element in the intersection of the
3136 * domains of the elements of list to the maximal corresponding affine
3139 __isl_give isl_pw_aff
*isl_pw_aff_list_max(__isl_take isl_pw_aff_list
*list
)
3141 return pw_aff_list_reduce(list
, &isl_pw_aff_max
);
3144 /* Mark the domains of "pwaff" as rational.
3146 __isl_give isl_pw_aff
*isl_pw_aff_set_rational(__isl_take isl_pw_aff
*pwaff
)
3150 pwaff
= isl_pw_aff_cow(pwaff
);
3156 for (i
= 0; i
< pwaff
->n
; ++i
) {
3157 pwaff
->p
[i
].set
= isl_set_set_rational(pwaff
->p
[i
].set
);
3158 if (!pwaff
->p
[i
].set
)
3159 return isl_pw_aff_free(pwaff
);
3165 /* Mark the domains of the elements of "list" as rational.
3167 __isl_give isl_pw_aff_list
*isl_pw_aff_list_set_rational(
3168 __isl_take isl_pw_aff_list
*list
)
3178 for (i
= 0; i
< n
; ++i
) {
3181 pa
= isl_pw_aff_list_get_pw_aff(list
, i
);
3182 pa
= isl_pw_aff_set_rational(pa
);
3183 list
= isl_pw_aff_list_set_pw_aff(list
, i
, pa
);
3189 /* Do the parameters of "aff" match those of "space"?
3191 int isl_aff_matching_params(__isl_keep isl_aff
*aff
,
3192 __isl_keep isl_space
*space
)
3194 isl_space
*aff_space
;
3200 aff_space
= isl_aff_get_domain_space(aff
);
3202 match
= isl_space_match(space
, isl_dim_param
, aff_space
, isl_dim_param
);
3204 isl_space_free(aff_space
);
3208 /* Check that the domain space of "aff" matches "space".
3210 * Return 0 on success and -1 on error.
3212 int isl_aff_check_match_domain_space(__isl_keep isl_aff
*aff
,
3213 __isl_keep isl_space
*space
)
3215 isl_space
*aff_space
;
3221 aff_space
= isl_aff_get_domain_space(aff
);
3223 match
= isl_space_match(space
, isl_dim_param
, aff_space
, isl_dim_param
);
3227 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3228 "parameters don't match", goto error
);
3229 match
= isl_space_tuple_match(space
, isl_dim_in
,
3230 aff_space
, isl_dim_set
);
3234 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
3235 "domains don't match", goto error
);
3236 isl_space_free(aff_space
);
3239 isl_space_free(aff_space
);
3246 #include <isl_multi_templ.c>
3248 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3249 * of the space to its domain.
3251 __isl_give isl_multi_aff
*isl_multi_aff_domain_map(__isl_take isl_space
*space
)
3254 isl_local_space
*ls
;
3259 if (!isl_space_is_map(space
))
3260 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3261 "not a map space", goto error
);
3263 n_in
= isl_space_dim(space
, isl_dim_in
);
3264 space
= isl_space_domain_map(space
);
3266 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3268 isl_space_free(space
);
3272 space
= isl_space_domain(space
);
3273 ls
= isl_local_space_from_space(space
);
3274 for (i
= 0; i
< n_in
; ++i
) {
3277 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3279 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3281 isl_local_space_free(ls
);
3284 isl_space_free(space
);
3288 /* Given a map space, return an isl_multi_aff that maps a wrapped copy
3289 * of the space to its range.
3291 __isl_give isl_multi_aff
*isl_multi_aff_range_map(__isl_take isl_space
*space
)
3294 isl_local_space
*ls
;
3299 if (!isl_space_is_map(space
))
3300 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3301 "not a map space", goto error
);
3303 n_in
= isl_space_dim(space
, isl_dim_in
);
3304 n_out
= isl_space_dim(space
, isl_dim_out
);
3305 space
= isl_space_range_map(space
);
3307 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3309 isl_space_free(space
);
3313 space
= isl_space_domain(space
);
3314 ls
= isl_local_space_from_space(space
);
3315 for (i
= 0; i
< n_out
; ++i
) {
3318 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3319 isl_dim_set
, n_in
+ i
);
3320 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3322 isl_local_space_free(ls
);
3325 isl_space_free(space
);
3329 /* Given the space of a set and a range of set dimensions,
3330 * construct an isl_multi_aff that projects out those dimensions.
3332 __isl_give isl_multi_aff
*isl_multi_aff_project_out_map(
3333 __isl_take isl_space
*space
, enum isl_dim_type type
,
3334 unsigned first
, unsigned n
)
3337 isl_local_space
*ls
;
3342 if (!isl_space_is_set(space
))
3343 isl_die(isl_space_get_ctx(space
), isl_error_unsupported
,
3344 "expecting set space", goto error
);
3345 if (type
!= isl_dim_set
)
3346 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3347 "only set dimensions can be projected out", goto error
);
3349 dim
= isl_space_dim(space
, isl_dim_set
);
3350 if (first
+ n
> dim
)
3351 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3352 "range out of bounds", goto error
);
3354 space
= isl_space_from_domain(space
);
3355 space
= isl_space_add_dims(space
, isl_dim_out
, dim
- n
);
3358 return isl_multi_aff_alloc(space
);
3360 ma
= isl_multi_aff_alloc(isl_space_copy(space
));
3361 space
= isl_space_domain(space
);
3362 ls
= isl_local_space_from_space(space
);
3364 for (i
= 0; i
< first
; ++i
) {
3367 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3369 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
3372 for (i
= 0; i
< dim
- (first
+ n
); ++i
) {
3375 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
3376 isl_dim_set
, first
+ n
+ i
);
3377 ma
= isl_multi_aff_set_aff(ma
, first
+ i
, aff
);
3380 isl_local_space_free(ls
);
3383 isl_space_free(space
);
3387 /* Given the space of a set and a range of set dimensions,
3388 * construct an isl_pw_multi_aff that projects out those dimensions.
3390 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_project_out_map(
3391 __isl_take isl_space
*space
, enum isl_dim_type type
,
3392 unsigned first
, unsigned n
)
3396 ma
= isl_multi_aff_project_out_map(space
, type
, first
, n
);
3397 return isl_pw_multi_aff_from_multi_aff(ma
);
3400 /* Create an isl_pw_multi_aff with the given isl_multi_aff on a universe
3403 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_aff(
3404 __isl_take isl_multi_aff
*ma
)
3406 isl_set
*dom
= isl_set_universe(isl_multi_aff_get_domain_space(ma
));
3407 return isl_pw_multi_aff_alloc(dom
, ma
);
3410 /* Create a piecewise multi-affine expression in the given space that maps each
3411 * input dimension to the corresponding output dimension.
3413 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_identity(
3414 __isl_take isl_space
*space
)
3416 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_identity(space
));
3419 /* Add "ma2" to "ma1" and return the result.
3421 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
3423 static __isl_give isl_multi_aff
*isl_multi_aff_add_aligned(
3424 __isl_take isl_multi_aff
*maff1
, __isl_take isl_multi_aff
*maff2
)
3426 return isl_multi_aff_bin_op(maff1
, maff2
, &isl_aff_add
);
3429 /* Add "ma2" to "ma1" and return the result.
3431 __isl_give isl_multi_aff
*isl_multi_aff_add(__isl_take isl_multi_aff
*ma1
,
3432 __isl_take isl_multi_aff
*ma2
)
3434 return isl_multi_aff_align_params_multi_multi_and(ma1
, ma2
,
3435 &isl_multi_aff_add_aligned
);
3438 /* Subtract "ma2" from "ma1" and return the result.
3440 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
3442 static __isl_give isl_multi_aff
*isl_multi_aff_sub_aligned(
3443 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
3445 return isl_multi_aff_bin_op(ma1
, ma2
, &isl_aff_sub
);
3448 /* Subtract "ma2" from "ma1" and return the result.
3450 __isl_give isl_multi_aff
*isl_multi_aff_sub(__isl_take isl_multi_aff
*ma1
,
3451 __isl_take isl_multi_aff
*ma2
)
3453 return isl_multi_aff_align_params_multi_multi_and(ma1
, ma2
,
3454 &isl_multi_aff_sub_aligned
);
3457 /* Given two multi-affine expressions A -> B and C -> D,
3458 * construct a multi-affine expression [A -> C] -> [B -> D].
3460 __isl_give isl_multi_aff
*isl_multi_aff_product(
3461 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
3467 int in1
, in2
, out1
, out2
;
3469 in1
= isl_multi_aff_dim(ma1
, isl_dim_in
);
3470 in2
= isl_multi_aff_dim(ma2
, isl_dim_in
);
3471 out1
= isl_multi_aff_dim(ma1
, isl_dim_out
);
3472 out2
= isl_multi_aff_dim(ma2
, isl_dim_out
);
3473 space
= isl_space_product(isl_multi_aff_get_space(ma1
),
3474 isl_multi_aff_get_space(ma2
));
3475 res
= isl_multi_aff_alloc(isl_space_copy(space
));
3476 space
= isl_space_domain(space
);
3478 for (i
= 0; i
< out1
; ++i
) {
3479 aff
= isl_multi_aff_get_aff(ma1
, i
);
3480 aff
= isl_aff_insert_dims(aff
, isl_dim_in
, in1
, in2
);
3481 aff
= isl_aff_reset_domain_space(aff
, isl_space_copy(space
));
3482 res
= isl_multi_aff_set_aff(res
, i
, aff
);
3485 for (i
= 0; i
< out2
; ++i
) {
3486 aff
= isl_multi_aff_get_aff(ma2
, i
);
3487 aff
= isl_aff_insert_dims(aff
, isl_dim_in
, 0, in1
);
3488 aff
= isl_aff_reset_domain_space(aff
, isl_space_copy(space
));
3489 res
= isl_multi_aff_set_aff(res
, out1
+ i
, aff
);
3492 isl_space_free(space
);
3493 isl_multi_aff_free(ma1
);
3494 isl_multi_aff_free(ma2
);
3498 /* Exploit the equalities in "eq" to simplify the affine expressions.
3500 static __isl_give isl_multi_aff
*isl_multi_aff_substitute_equalities(
3501 __isl_take isl_multi_aff
*maff
, __isl_take isl_basic_set
*eq
)
3505 maff
= isl_multi_aff_cow(maff
);
3509 for (i
= 0; i
< maff
->n
; ++i
) {
3510 maff
->p
[i
] = isl_aff_substitute_equalities(maff
->p
[i
],
3511 isl_basic_set_copy(eq
));
3516 isl_basic_set_free(eq
);
3519 isl_basic_set_free(eq
);
3520 isl_multi_aff_free(maff
);
3524 __isl_give isl_multi_aff
*isl_multi_aff_scale(__isl_take isl_multi_aff
*maff
,
3529 maff
= isl_multi_aff_cow(maff
);
3533 for (i
= 0; i
< maff
->n
; ++i
) {
3534 maff
->p
[i
] = isl_aff_scale(maff
->p
[i
], f
);
3536 return isl_multi_aff_free(maff
);
3542 __isl_give isl_multi_aff
*isl_multi_aff_add_on_domain(__isl_keep isl_set
*dom
,
3543 __isl_take isl_multi_aff
*maff1
, __isl_take isl_multi_aff
*maff2
)
3545 maff1
= isl_multi_aff_add(maff1
, maff2
);
3546 maff1
= isl_multi_aff_gist(maff1
, isl_set_copy(dom
));
3550 int isl_multi_aff_is_empty(__isl_keep isl_multi_aff
*maff
)
3558 int isl_multi_aff_plain_is_equal(__isl_keep isl_multi_aff
*maff1
,
3559 __isl_keep isl_multi_aff
*maff2
)
3564 if (!maff1
|| !maff2
)
3566 if (maff1
->n
!= maff2
->n
)
3568 equal
= isl_space_is_equal(maff1
->space
, maff2
->space
);
3569 if (equal
< 0 || !equal
)
3572 for (i
= 0; i
< maff1
->n
; ++i
) {
3573 equal
= isl_aff_plain_is_equal(maff1
->p
[i
], maff2
->p
[i
]);
3574 if (equal
< 0 || !equal
)
3581 /* Return the set of domain elements where "ma1" is lexicographically
3582 * smaller than or equal to "ma2".
3584 __isl_give isl_set
*isl_multi_aff_lex_le_set(__isl_take isl_multi_aff
*ma1
,
3585 __isl_take isl_multi_aff
*ma2
)
3587 return isl_multi_aff_lex_ge_set(ma2
, ma1
);
3590 /* Return the set of domain elements where "ma1" is lexicographically
3591 * greater than or equal to "ma2".
3593 __isl_give isl_set
*isl_multi_aff_lex_ge_set(__isl_take isl_multi_aff
*ma1
,
3594 __isl_take isl_multi_aff
*ma2
)
3597 isl_map
*map1
, *map2
;
3600 map1
= isl_map_from_multi_aff(ma1
);
3601 map2
= isl_map_from_multi_aff(ma2
);
3602 map
= isl_map_range_product(map1
, map2
);
3603 space
= isl_space_range(isl_map_get_space(map
));
3604 space
= isl_space_domain(isl_space_unwrap(space
));
3605 ge
= isl_map_lex_ge(space
);
3606 map
= isl_map_intersect_range(map
, isl_map_wrap(ge
));
3608 return isl_map_domain(map
);
3612 #define PW isl_pw_multi_aff
3614 #define EL isl_multi_aff
3616 #define EL_IS_ZERO is_empty
3620 #define IS_ZERO is_empty
3623 #undef DEFAULT_IS_ZERO
3624 #define DEFAULT_IS_ZERO 0
3629 #define NO_INVOLVES_DIMS
3630 #define NO_INSERT_DIMS
3634 #include <isl_pw_templ.c>
3637 #define UNION isl_union_pw_multi_aff
3639 #define PART isl_pw_multi_aff
3641 #define PARTS pw_multi_aff
3642 #define ALIGN_DOMAIN
3646 #include <isl_union_templ.c>
3648 /* Given a function "cmp" that returns the set of elements where
3649 * "ma1" is "better" than "ma2", return the intersection of this
3650 * set with "dom1" and "dom2".
3652 static __isl_give isl_set
*shared_and_better(__isl_keep isl_set
*dom1
,
3653 __isl_keep isl_set
*dom2
, __isl_keep isl_multi_aff
*ma1
,
3654 __isl_keep isl_multi_aff
*ma2
,
3655 __isl_give isl_set
*(*cmp
)(__isl_take isl_multi_aff
*ma1
,
3656 __isl_take isl_multi_aff
*ma2
))
3662 common
= isl_set_intersect(isl_set_copy(dom1
), isl_set_copy(dom2
));
3663 is_empty
= isl_set_plain_is_empty(common
);
3664 if (is_empty
>= 0 && is_empty
)
3667 return isl_set_free(common
);
3668 better
= cmp(isl_multi_aff_copy(ma1
), isl_multi_aff_copy(ma2
));
3669 better
= isl_set_intersect(common
, better
);
3674 /* Given a function "cmp" that returns the set of elements where
3675 * "ma1" is "better" than "ma2", return a piecewise multi affine
3676 * expression defined on the union of the definition domains
3677 * of "pma1" and "pma2" that maps to the "best" of "pma1" and
3678 * "pma2" on each cell. If only one of the two input functions
3679 * is defined on a given cell, then it is considered the best.
3681 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_opt(
3682 __isl_take isl_pw_multi_aff
*pma1
,
3683 __isl_take isl_pw_multi_aff
*pma2
,
3684 __isl_give isl_set
*(*cmp
)(__isl_take isl_multi_aff
*ma1
,
3685 __isl_take isl_multi_aff
*ma2
))
3688 isl_pw_multi_aff
*res
= NULL
;
3690 isl_set
*set
= NULL
;
3695 ctx
= isl_space_get_ctx(pma1
->dim
);
3696 if (!isl_space_is_equal(pma1
->dim
, pma2
->dim
))
3697 isl_die(ctx
, isl_error_invalid
,
3698 "arguments should live in the same space", goto error
);
3700 if (isl_pw_multi_aff_is_empty(pma1
)) {
3701 isl_pw_multi_aff_free(pma1
);
3705 if (isl_pw_multi_aff_is_empty(pma2
)) {
3706 isl_pw_multi_aff_free(pma2
);
3710 n
= 2 * (pma1
->n
+ 1) * (pma2
->n
+ 1);
3711 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma1
->dim
), n
);
3713 for (i
= 0; i
< pma1
->n
; ++i
) {
3714 set
= isl_set_copy(pma1
->p
[i
].set
);
3715 for (j
= 0; j
< pma2
->n
; ++j
) {
3719 better
= shared_and_better(pma2
->p
[j
].set
,
3720 pma1
->p
[i
].set
, pma2
->p
[j
].maff
,
3721 pma1
->p
[i
].maff
, cmp
);
3722 is_empty
= isl_set_plain_is_empty(better
);
3723 if (is_empty
< 0 || is_empty
) {
3724 isl_set_free(better
);
3729 set
= isl_set_subtract(set
, isl_set_copy(better
));
3731 res
= isl_pw_multi_aff_add_piece(res
, better
,
3732 isl_multi_aff_copy(pma2
->p
[j
].maff
));
3734 res
= isl_pw_multi_aff_add_piece(res
, set
,
3735 isl_multi_aff_copy(pma1
->p
[i
].maff
));
3738 for (j
= 0; j
< pma2
->n
; ++j
) {
3739 set
= isl_set_copy(pma2
->p
[j
].set
);
3740 for (i
= 0; i
< pma1
->n
; ++i
)
3741 set
= isl_set_subtract(set
,
3742 isl_set_copy(pma1
->p
[i
].set
));
3743 res
= isl_pw_multi_aff_add_piece(res
, set
,
3744 isl_multi_aff_copy(pma2
->p
[j
].maff
));
3747 isl_pw_multi_aff_free(pma1
);
3748 isl_pw_multi_aff_free(pma2
);
3752 isl_pw_multi_aff_free(pma1
);
3753 isl_pw_multi_aff_free(pma2
);
3755 return isl_pw_multi_aff_free(res
);
3758 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmax(
3759 __isl_take isl_pw_multi_aff
*pma1
,
3760 __isl_take isl_pw_multi_aff
*pma2
)
3762 return pw_multi_aff_union_opt(pma1
, pma2
, &isl_multi_aff_lex_ge_set
);
3765 /* Given two piecewise multi affine expressions, return a piecewise
3766 * multi-affine expression defined on the union of the definition domains
3767 * of the inputs that is equal to the lexicographic maximum of the two
3768 * inputs on each cell. If only one of the two inputs is defined on
3769 * a given cell, then it is considered to be the maximum.
3771 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmax(
3772 __isl_take isl_pw_multi_aff
*pma1
,
3773 __isl_take isl_pw_multi_aff
*pma2
)
3775 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
3776 &pw_multi_aff_union_lexmax
);
3779 static __isl_give isl_pw_multi_aff
*pw_multi_aff_union_lexmin(
3780 __isl_take isl_pw_multi_aff
*pma1
,
3781 __isl_take isl_pw_multi_aff
*pma2
)
3783 return pw_multi_aff_union_opt(pma1
, pma2
, &isl_multi_aff_lex_le_set
);
3786 /* Given two piecewise multi affine expressions, return a piecewise
3787 * multi-affine expression defined on the union of the definition domains
3788 * of the inputs that is equal to the lexicographic minimum of the two
3789 * inputs on each cell. If only one of the two inputs is defined on
3790 * a given cell, then it is considered to be the minimum.
3792 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_lexmin(
3793 __isl_take isl_pw_multi_aff
*pma1
,
3794 __isl_take isl_pw_multi_aff
*pma2
)
3796 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
3797 &pw_multi_aff_union_lexmin
);
3800 static __isl_give isl_pw_multi_aff
*pw_multi_aff_add(
3801 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
3803 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
3804 &isl_multi_aff_add
);
3807 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_add(
3808 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
3810 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
3814 static __isl_give isl_pw_multi_aff
*pw_multi_aff_sub(
3815 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
3817 return isl_pw_multi_aff_on_shared_domain(pma1
, pma2
,
3818 &isl_multi_aff_sub
);
3821 /* Subtract "pma2" from "pma1" and return the result.
3823 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_sub(
3824 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
3826 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
3830 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_union_add(
3831 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
3833 return isl_pw_multi_aff_union_add_(pma1
, pma2
);
3836 /* Given two piecewise multi-affine expressions A -> B and C -> D,
3837 * construct a piecewise multi-affine expression [A -> C] -> [B -> D].
3839 static __isl_give isl_pw_multi_aff
*pw_multi_aff_product(
3840 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
3844 isl_pw_multi_aff
*res
;
3849 n
= pma1
->n
* pma2
->n
;
3850 space
= isl_space_product(isl_space_copy(pma1
->dim
),
3851 isl_space_copy(pma2
->dim
));
3852 res
= isl_pw_multi_aff_alloc_size(space
, n
);
3854 for (i
= 0; i
< pma1
->n
; ++i
) {
3855 for (j
= 0; j
< pma2
->n
; ++j
) {
3859 domain
= isl_set_product(isl_set_copy(pma1
->p
[i
].set
),
3860 isl_set_copy(pma2
->p
[j
].set
));
3861 ma
= isl_multi_aff_product(
3862 isl_multi_aff_copy(pma1
->p
[i
].maff
),
3863 isl_multi_aff_copy(pma2
->p
[j
].maff
));
3864 res
= isl_pw_multi_aff_add_piece(res
, domain
, ma
);
3868 isl_pw_multi_aff_free(pma1
);
3869 isl_pw_multi_aff_free(pma2
);
3872 isl_pw_multi_aff_free(pma1
);
3873 isl_pw_multi_aff_free(pma2
);
3877 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_product(
3878 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
3880 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
3881 &pw_multi_aff_product
);
3884 /* Construct a map mapping the domain of the piecewise multi-affine expression
3885 * to its range, with each dimension in the range equated to the
3886 * corresponding affine expression on its cell.
3888 __isl_give isl_map
*isl_map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
3896 map
= isl_map_empty(isl_pw_multi_aff_get_space(pma
));
3898 for (i
= 0; i
< pma
->n
; ++i
) {
3899 isl_multi_aff
*maff
;
3900 isl_basic_map
*bmap
;
3903 maff
= isl_multi_aff_copy(pma
->p
[i
].maff
);
3904 bmap
= isl_basic_map_from_multi_aff(maff
);
3905 map_i
= isl_map_from_basic_map(bmap
);
3906 map_i
= isl_map_intersect_domain(map_i
,
3907 isl_set_copy(pma
->p
[i
].set
));
3908 map
= isl_map_union_disjoint(map
, map_i
);
3911 isl_pw_multi_aff_free(pma
);
3915 __isl_give isl_set
*isl_set_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
)
3920 if (!isl_space_is_set(pma
->dim
))
3921 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
3922 "isl_pw_multi_aff cannot be converted into an isl_set",
3923 return isl_pw_multi_aff_free(pma
));
3925 return isl_map_from_pw_multi_aff(pma
);
3928 /* Given a basic map with a single output dimension that is defined
3929 * in terms of the parameters and input dimensions using an equality,
3930 * extract an isl_aff that expresses the output dimension in terms
3931 * of the parameters and input dimensions.
3933 * Since some applications expect the result of isl_pw_multi_aff_from_map
3934 * to only contain integer affine expressions, we compute the floor
3935 * of the expression before returning.
3937 * This function shares some similarities with
3938 * isl_basic_map_has_defining_equality and isl_constraint_get_bound.
3940 static __isl_give isl_aff
*extract_isl_aff_from_basic_map(
3941 __isl_take isl_basic_map
*bmap
)
3946 isl_local_space
*ls
;
3951 if (isl_basic_map_dim(bmap
, isl_dim_out
) != 1)
3952 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
3953 "basic map should have a single output dimension",
3955 offset
= isl_basic_map_offset(bmap
, isl_dim_out
);
3956 total
= isl_basic_map_total_dim(bmap
);
3957 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3958 if (isl_int_is_zero(bmap
->eq
[i
][offset
]))
3960 if (isl_seq_first_non_zero(bmap
->eq
[i
] + offset
+ 1,
3961 1 + total
- (offset
+ 1)) != -1)
3965 if (i
>= bmap
->n_eq
)
3966 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
3967 "unable to find suitable equality", goto error
);
3968 ls
= isl_basic_map_get_local_space(bmap
);
3969 aff
= isl_aff_alloc(isl_local_space_domain(ls
));
3972 if (isl_int_is_neg(bmap
->eq
[i
][offset
]))
3973 isl_seq_cpy(aff
->v
->el
+ 1, bmap
->eq
[i
], offset
);
3975 isl_seq_neg(aff
->v
->el
+ 1, bmap
->eq
[i
], offset
);
3976 isl_seq_clr(aff
->v
->el
+ 1 + offset
, aff
->v
->size
- (1 + offset
));
3977 isl_int_abs(aff
->v
->el
[0], bmap
->eq
[i
][offset
]);
3978 isl_basic_map_free(bmap
);
3980 aff
= isl_aff_remove_unused_divs(aff
);
3981 aff
= isl_aff_floor(aff
);
3984 isl_basic_map_free(bmap
);
3988 /* Given a basic map where each output dimension is defined
3989 * in terms of the parameters and input dimensions using an equality,
3990 * extract an isl_multi_aff that expresses the output dimensions in terms
3991 * of the parameters and input dimensions.
3993 static __isl_give isl_multi_aff
*extract_isl_multi_aff_from_basic_map(
3994 __isl_take isl_basic_map
*bmap
)
4003 ma
= isl_multi_aff_alloc(isl_basic_map_get_space(bmap
));
4004 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4006 for (i
= 0; i
< n_out
; ++i
) {
4007 isl_basic_map
*bmap_i
;
4010 bmap_i
= isl_basic_map_copy(bmap
);
4011 bmap_i
= isl_basic_map_project_out(bmap_i
, isl_dim_out
,
4012 i
+ 1, n_out
- (1 + i
));
4013 bmap_i
= isl_basic_map_project_out(bmap_i
, isl_dim_out
, 0, i
);
4014 aff
= extract_isl_aff_from_basic_map(bmap_i
);
4015 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4018 isl_basic_map_free(bmap
);
4023 /* Create an isl_pw_multi_aff that is equivalent to
4024 * isl_map_intersect_domain(isl_map_from_basic_map(bmap), domain).
4025 * The given basic map is such that each output dimension is defined
4026 * in terms of the parameters and input dimensions using an equality.
4028 static __isl_give isl_pw_multi_aff
*plain_pw_multi_aff_from_map(
4029 __isl_take isl_set
*domain
, __isl_take isl_basic_map
*bmap
)
4033 ma
= extract_isl_multi_aff_from_basic_map(bmap
);
4034 return isl_pw_multi_aff_alloc(domain
, ma
);
4037 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4038 * This obviously only works if the input "map" is single-valued.
4039 * If so, we compute the lexicographic minimum of the image in the form
4040 * of an isl_pw_multi_aff. Since the image is unique, it is equal
4041 * to its lexicographic minimum.
4042 * If the input is not single-valued, we produce an error.
4044 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_base(
4045 __isl_take isl_map
*map
)
4049 isl_pw_multi_aff
*pma
;
4051 sv
= isl_map_is_single_valued(map
);
4055 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
4056 "map is not single-valued", goto error
);
4057 map
= isl_map_make_disjoint(map
);
4061 pma
= isl_pw_multi_aff_empty(isl_map_get_space(map
));
4063 for (i
= 0; i
< map
->n
; ++i
) {
4064 isl_pw_multi_aff
*pma_i
;
4065 isl_basic_map
*bmap
;
4066 bmap
= isl_basic_map_copy(map
->p
[i
]);
4067 pma_i
= isl_basic_map_lexmin_pw_multi_aff(bmap
);
4068 pma
= isl_pw_multi_aff_add_disjoint(pma
, pma_i
);
4078 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4079 * taking into account that the output dimension at position "d"
4080 * can be represented as
4082 * x = floor((e(...) + c1) / m)
4084 * given that constraint "i" is of the form
4086 * e(...) + c1 - m x >= 0
4089 * Let "map" be of the form
4093 * We construct a mapping
4095 * A -> [A -> x = floor(...)]
4097 * apply that to the map, obtaining
4099 * [A -> x = floor(...)] -> B
4101 * and equate dimension "d" to x.
4102 * We then compute a isl_pw_multi_aff representation of the resulting map
4103 * and plug in the mapping above.
4105 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_div(
4106 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
)
4110 isl_local_space
*ls
;
4118 isl_pw_multi_aff
*pma
;
4121 is_set
= isl_map_is_set(map
);
4123 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4124 ctx
= isl_map_get_ctx(map
);
4125 space
= isl_space_domain(isl_map_get_space(map
));
4126 n_in
= isl_space_dim(space
, isl_dim_set
);
4127 n
= isl_space_dim(space
, isl_dim_all
);
4129 v
= isl_vec_alloc(ctx
, 1 + 1 + n
);
4131 isl_int_neg(v
->el
[0], hull
->ineq
[i
][offset
+ d
]);
4132 isl_seq_cpy(v
->el
+ 1, hull
->ineq
[i
], 1 + n
);
4134 isl_basic_map_free(hull
);
4136 ls
= isl_local_space_from_space(isl_space_copy(space
));
4137 aff
= isl_aff_alloc_vec(ls
, v
);
4138 aff
= isl_aff_floor(aff
);
4140 isl_space_free(space
);
4141 ma
= isl_multi_aff_from_aff(aff
);
4143 ma
= isl_multi_aff_identity(isl_space_map_from_set(space
));
4144 ma
= isl_multi_aff_range_product(ma
,
4145 isl_multi_aff_from_aff(aff
));
4148 insert
= isl_map_from_multi_aff(isl_multi_aff_copy(ma
));
4149 map
= isl_map_apply_domain(map
, insert
);
4150 map
= isl_map_equate(map
, isl_dim_in
, n_in
, isl_dim_out
, d
);
4151 pma
= isl_pw_multi_aff_from_map(map
);
4152 pma
= isl_pw_multi_aff_pullback_multi_aff(pma
, ma
);
4157 /* Is constraint "c" of the form
4159 * e(...) + c1 - m x >= 0
4163 * -e(...) + c2 + m x >= 0
4165 * where m > 1 and e only depends on parameters and input dimemnsions?
4167 * "offset" is the offset of the output dimensions
4168 * "pos" is the position of output dimension x.
4170 static int is_potential_div_constraint(isl_int
*c
, int offset
, int d
, int total
)
4172 if (isl_int_is_zero(c
[offset
+ d
]))
4174 if (isl_int_is_one(c
[offset
+ d
]))
4176 if (isl_int_is_negone(c
[offset
+ d
]))
4178 if (isl_seq_first_non_zero(c
+ offset
, d
) != -1)
4180 if (isl_seq_first_non_zero(c
+ offset
+ d
+ 1,
4181 total
- (offset
+ d
+ 1)) != -1)
4186 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4188 * As a special case, we first check if there is any pair of constraints,
4189 * shared by all the basic maps in "map" that force a given dimension
4190 * to be equal to the floor of some affine combination of the input dimensions.
4192 * In particular, if we can find two constraints
4194 * e(...) + c1 - m x >= 0 i.e., m x <= e(...) + c1
4198 * -e(...) + c2 + m x >= 0 i.e., m x >= e(...) - c2
4200 * where m > 1 and e only depends on parameters and input dimemnsions,
4203 * c1 + c2 < m i.e., -c2 >= c1 - (m - 1)
4205 * then we know that we can take
4207 * x = floor((e(...) + c1) / m)
4209 * without having to perform any computation.
4211 * Note that we know that
4215 * If c1 + c2 were 0, then we would have detected an equality during
4216 * simplification. If c1 + c2 were negative, then we would have detected
4219 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_check_div(
4220 __isl_take isl_map
*map
)
4226 isl_basic_map
*hull
;
4228 hull
= isl_map_unshifted_simple_hull(isl_map_copy(map
));
4233 dim
= isl_map_dim(map
, isl_dim_out
);
4234 offset
= isl_basic_map_offset(hull
, isl_dim_out
);
4235 total
= 1 + isl_basic_map_total_dim(hull
);
4237 for (d
= 0; d
< dim
; ++d
) {
4238 for (i
= 0; i
< n
; ++i
) {
4239 if (!is_potential_div_constraint(hull
->ineq
[i
],
4242 for (j
= i
+ 1; j
< n
; ++j
) {
4243 if (!isl_seq_is_neg(hull
->ineq
[i
] + 1,
4244 hull
->ineq
[j
] + 1, total
- 1))
4246 isl_int_add(sum
, hull
->ineq
[i
][0],
4248 if (isl_int_abs_lt(sum
,
4249 hull
->ineq
[i
][offset
+ d
]))
4256 if (isl_int_is_pos(hull
->ineq
[j
][offset
+ d
]))
4258 return pw_multi_aff_from_map_div(map
, hull
, d
, j
);
4262 isl_basic_map_free(hull
);
4263 return pw_multi_aff_from_map_base(map
);
4266 isl_basic_map_free(hull
);
4270 /* Given an affine expression
4272 * [A -> B] -> f(A,B)
4274 * construct an isl_multi_aff
4278 * such that dimension "d" in B' is set to "aff" and the remaining
4279 * dimensions are set equal to the corresponding dimensions in B.
4280 * "n_in" is the dimension of the space A.
4281 * "n_out" is the dimension of the space B.
4283 * If "is_set" is set, then the affine expression is of the form
4287 * and we construct an isl_multi_aff
4291 static __isl_give isl_multi_aff
*range_map(__isl_take isl_aff
*aff
, int d
,
4292 unsigned n_in
, unsigned n_out
, int is_set
)
4296 isl_space
*space
, *space2
;
4297 isl_local_space
*ls
;
4299 space
= isl_aff_get_domain_space(aff
);
4300 ls
= isl_local_space_from_space(isl_space_copy(space
));
4301 space2
= isl_space_copy(space
);
4303 space2
= isl_space_range(isl_space_unwrap(space2
));
4304 space
= isl_space_map_from_domain_and_range(space
, space2
);
4305 ma
= isl_multi_aff_alloc(space
);
4306 ma
= isl_multi_aff_set_aff(ma
, d
, aff
);
4308 for (i
= 0; i
< n_out
; ++i
) {
4311 aff
= isl_aff_var_on_domain(isl_local_space_copy(ls
),
4312 isl_dim_set
, n_in
+ i
);
4313 ma
= isl_multi_aff_set_aff(ma
, i
, aff
);
4316 isl_local_space_free(ls
);
4321 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map,
4322 * taking into account that the dimension at position "d" can be written as
4324 * x = m a + f(..) (1)
4326 * where m is equal to "gcd".
4327 * "i" is the index of the equality in "hull" that defines f(..).
4328 * In particular, the equality is of the form
4330 * f(..) - x + m g(existentials) = 0
4334 * -f(..) + x + m g(existentials) = 0
4336 * We basically plug (1) into "map", resulting in a map with "a"
4337 * in the range instead of "x". The corresponding isl_pw_multi_aff
4338 * defining "a" is then plugged back into (1) to obtain a definition fro "x".
4340 * Specifically, given the input map
4344 * We first wrap it into a set
4348 * and define (1) on top of the corresponding space, resulting in "aff".
4349 * We use this to create an isl_multi_aff that maps the output position "d"
4350 * from "a" to "x", leaving all other (intput and output) dimensions unchanged.
4351 * We plug this into the wrapped map, unwrap the result and compute the
4352 * corresponding isl_pw_multi_aff.
4353 * The result is an expression
4361 * so that we can plug that into "aff", after extending the latter to
4367 * If "map" is actually a set, then there is no "A" space, meaning
4368 * that we do not need to perform any wrapping, and that the result
4369 * of the recursive call is of the form
4373 * which is plugged into a mapping of the form
4377 static __isl_give isl_pw_multi_aff
*pw_multi_aff_from_map_stride(
4378 __isl_take isl_map
*map
, __isl_take isl_basic_map
*hull
, int d
, int i
,
4383 isl_local_space
*ls
;
4386 isl_pw_multi_aff
*pma
, *id
;
4392 is_set
= isl_map_is_set(map
);
4394 n_in
= isl_basic_map_dim(hull
, isl_dim_in
);
4395 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
4396 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
4401 set
= isl_map_wrap(map
);
4402 space
= isl_space_map_from_set(isl_set_get_space(set
));
4403 ma
= isl_multi_aff_identity(space
);
4404 ls
= isl_local_space_from_space(isl_set_get_space(set
));
4405 aff
= isl_aff_alloc(ls
);
4407 isl_int_set_si(aff
->v
->el
[0], 1);
4408 if (isl_int_is_one(hull
->eq
[i
][o_out
+ d
]))
4409 isl_seq_neg(aff
->v
->el
+ 1, hull
->eq
[i
],
4412 isl_seq_cpy(aff
->v
->el
+ 1, hull
->eq
[i
],
4414 isl_int_set(aff
->v
->el
[1 + o_out
+ d
], gcd
);
4416 ma
= isl_multi_aff_set_aff(ma
, n_in
+ d
, isl_aff_copy(aff
));
4417 set
= isl_set_preimage_multi_aff(set
, ma
);
4419 ma
= range_map(aff
, d
, n_in
, n_out
, is_set
);
4424 map
= isl_set_unwrap(set
);
4425 pma
= isl_pw_multi_aff_from_map(set
);
4428 space
= isl_pw_multi_aff_get_domain_space(pma
);
4429 space
= isl_space_map_from_set(space
);
4430 id
= isl_pw_multi_aff_identity(space
);
4431 pma
= isl_pw_multi_aff_range_product(id
, pma
);
4433 id
= isl_pw_multi_aff_from_multi_aff(ma
);
4434 pma
= isl_pw_multi_aff_pullback_pw_multi_aff(id
, pma
);
4436 isl_basic_map_free(hull
);
4440 /* Try and create an isl_pw_multi_aff that is equivalent to the given isl_map.
4442 * As a special case, we first check if all output dimensions are uniquely
4443 * defined in terms of the parameters and input dimensions over the entire
4444 * domain. If so, we extract the desired isl_pw_multi_aff directly
4445 * from the affine hull of "map" and its domain.
4447 * Otherwise, we check if any of the output dimensions is "strided".
4448 * That is, we check if can be written as
4452 * with m greater than 1, a some combination of existentiall quantified
4453 * variables and f and expression in the parameters and input dimensions.
4454 * If so, we remove the stride in pw_multi_aff_from_map_stride.
4456 * Otherwise, we continue with pw_multi_aff_from_map_check_div for a further
4459 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_map(__isl_take isl_map
*map
)
4463 isl_basic_map
*hull
;
4473 hull
= isl_map_affine_hull(isl_map_copy(map
));
4474 sv
= isl_basic_map_plain_is_single_valued(hull
);
4476 return plain_pw_multi_aff_from_map(isl_map_domain(map
), hull
);
4478 hull
= isl_basic_map_free(hull
);
4482 n_div
= isl_basic_map_dim(hull
, isl_dim_div
);
4483 o_div
= isl_basic_map_offset(hull
, isl_dim_div
);
4486 isl_basic_map_free(hull
);
4487 return pw_multi_aff_from_map_check_div(map
);
4492 n_out
= isl_basic_map_dim(hull
, isl_dim_out
);
4493 o_out
= isl_basic_map_offset(hull
, isl_dim_out
);
4495 for (i
= 0; i
< n_out
; ++i
) {
4496 for (j
= 0; j
< hull
->n_eq
; ++j
) {
4497 isl_int
*eq
= hull
->eq
[j
];
4498 isl_pw_multi_aff
*res
;
4500 if (!isl_int_is_one(eq
[o_out
+ i
]) &&
4501 !isl_int_is_negone(eq
[o_out
+ i
]))
4503 if (isl_seq_first_non_zero(eq
+ o_out
, i
) != -1)
4505 if (isl_seq_first_non_zero(eq
+ o_out
+ i
+ 1,
4506 n_out
- (i
+ 1)) != -1)
4508 isl_seq_gcd(eq
+ o_div
, n_div
, &gcd
);
4509 if (isl_int_is_zero(gcd
))
4511 if (isl_int_is_one(gcd
))
4514 res
= pw_multi_aff_from_map_stride(map
, hull
,
4522 isl_basic_map_free(hull
);
4523 return pw_multi_aff_from_map_check_div(map
);
4529 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_set(__isl_take isl_set
*set
)
4531 return isl_pw_multi_aff_from_map(set
);
4534 /* Convert "map" into an isl_pw_multi_aff (if possible) and
4537 static int pw_multi_aff_from_map(__isl_take isl_map
*map
, void *user
)
4539 isl_union_pw_multi_aff
**upma
= user
;
4540 isl_pw_multi_aff
*pma
;
4542 pma
= isl_pw_multi_aff_from_map(map
);
4543 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
4545 return *upma
? 0 : -1;
4548 /* Try and create an isl_union_pw_multi_aff that is equivalent
4549 * to the given isl_union_map.
4550 * The isl_union_map is required to be single-valued in each space.
4551 * Otherwise, an error is produced.
4553 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_map(
4554 __isl_take isl_union_map
*umap
)
4557 isl_union_pw_multi_aff
*upma
;
4559 space
= isl_union_map_get_space(umap
);
4560 upma
= isl_union_pw_multi_aff_empty(space
);
4561 if (isl_union_map_foreach_map(umap
, &pw_multi_aff_from_map
, &upma
) < 0)
4562 upma
= isl_union_pw_multi_aff_free(upma
);
4563 isl_union_map_free(umap
);
4568 /* Try and create an isl_union_pw_multi_aff that is equivalent
4569 * to the given isl_union_set.
4570 * The isl_union_set is required to be a singleton in each space.
4571 * Otherwise, an error is produced.
4573 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_union_set(
4574 __isl_take isl_union_set
*uset
)
4576 return isl_union_pw_multi_aff_from_union_map(uset
);
4579 /* Return the piecewise affine expression "set ? 1 : 0".
4581 __isl_give isl_pw_aff
*isl_set_indicator_function(__isl_take isl_set
*set
)
4584 isl_space
*space
= isl_set_get_space(set
);
4585 isl_local_space
*ls
= isl_local_space_from_space(space
);
4586 isl_aff
*zero
= isl_aff_zero_on_domain(isl_local_space_copy(ls
));
4587 isl_aff
*one
= isl_aff_zero_on_domain(ls
);
4589 one
= isl_aff_add_constant_si(one
, 1);
4590 pa
= isl_pw_aff_alloc(isl_set_copy(set
), one
);
4591 set
= isl_set_complement(set
);
4592 pa
= isl_pw_aff_add_disjoint(pa
, isl_pw_aff_alloc(set
, zero
));
4597 /* Plug in "subs" for dimension "type", "pos" of "aff".
4599 * Let i be the dimension to replace and let "subs" be of the form
4603 * and "aff" of the form
4609 * (a f + d g')/(m d)
4611 * where g' is the result of plugging in "subs" in each of the integer
4614 __isl_give isl_aff
*isl_aff_substitute(__isl_take isl_aff
*aff
,
4615 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
4620 aff
= isl_aff_cow(aff
);
4622 return isl_aff_free(aff
);
4624 ctx
= isl_aff_get_ctx(aff
);
4625 if (!isl_space_is_equal(aff
->ls
->dim
, subs
->ls
->dim
))
4626 isl_die(ctx
, isl_error_invalid
,
4627 "spaces don't match", return isl_aff_free(aff
));
4628 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
4629 isl_die(ctx
, isl_error_unsupported
,
4630 "cannot handle divs yet", return isl_aff_free(aff
));
4632 aff
->ls
= isl_local_space_substitute(aff
->ls
, type
, pos
, subs
);
4634 return isl_aff_free(aff
);
4636 aff
->v
= isl_vec_cow(aff
->v
);
4638 return isl_aff_free(aff
);
4640 pos
+= isl_local_space_offset(aff
->ls
, type
);
4643 isl_seq_substitute(aff
->v
->el
, pos
, subs
->v
->el
,
4644 aff
->v
->size
, subs
->v
->size
, v
);
4650 /* Plug in "subs" for dimension "type", "pos" in each of the affine
4651 * expressions in "maff".
4653 __isl_give isl_multi_aff
*isl_multi_aff_substitute(
4654 __isl_take isl_multi_aff
*maff
, enum isl_dim_type type
, unsigned pos
,
4655 __isl_keep isl_aff
*subs
)
4659 maff
= isl_multi_aff_cow(maff
);
4661 return isl_multi_aff_free(maff
);
4663 if (type
== isl_dim_in
)
4666 for (i
= 0; i
< maff
->n
; ++i
) {
4667 maff
->p
[i
] = isl_aff_substitute(maff
->p
[i
], type
, pos
, subs
);
4669 return isl_multi_aff_free(maff
);
4675 /* Plug in "subs" for dimension "type", "pos" of "pma".
4677 * pma is of the form
4681 * while subs is of the form
4683 * v' = B_j(v) -> S_j
4685 * Each pair i,j such that C_ij = A_i \cap B_i is non-empty
4686 * has a contribution in the result, in particular
4688 * C_ij(S_j) -> M_i(S_j)
4690 * Note that plugging in S_j in C_ij may also result in an empty set
4691 * and this contribution should simply be discarded.
4693 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_substitute(
4694 __isl_take isl_pw_multi_aff
*pma
, enum isl_dim_type type
, unsigned pos
,
4695 __isl_keep isl_pw_aff
*subs
)
4698 isl_pw_multi_aff
*res
;
4701 return isl_pw_multi_aff_free(pma
);
4703 n
= pma
->n
* subs
->n
;
4704 res
= isl_pw_multi_aff_alloc_size(isl_space_copy(pma
->dim
), n
);
4706 for (i
= 0; i
< pma
->n
; ++i
) {
4707 for (j
= 0; j
< subs
->n
; ++j
) {
4709 isl_multi_aff
*res_ij
;
4712 common
= isl_set_intersect(
4713 isl_set_copy(pma
->p
[i
].set
),
4714 isl_set_copy(subs
->p
[j
].set
));
4715 common
= isl_set_substitute(common
,
4716 type
, pos
, subs
->p
[j
].aff
);
4717 empty
= isl_set_plain_is_empty(common
);
4718 if (empty
< 0 || empty
) {
4719 isl_set_free(common
);
4725 res_ij
= isl_multi_aff_substitute(
4726 isl_multi_aff_copy(pma
->p
[i
].maff
),
4727 type
, pos
, subs
->p
[j
].aff
);
4729 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
4733 isl_pw_multi_aff_free(pma
);
4736 isl_pw_multi_aff_free(pma
);
4737 isl_pw_multi_aff_free(res
);
4741 /* Compute the preimage of a range of dimensions in the affine expression "src"
4742 * under "ma" and put the result in "dst". The number of dimensions in "src"
4743 * that precede the range is given by "n_before". The number of dimensions
4744 * in the range is given by the number of output dimensions of "ma".
4745 * The number of dimensions that follow the range is given by "n_after".
4746 * If "has_denom" is set (to one),
4747 * then "src" and "dst" have an extra initial denominator.
4748 * "n_div_ma" is the number of existentials in "ma"
4749 * "n_div_bset" is the number of existentials in "src"
4750 * The resulting "dst" (which is assumed to have been allocated by
4751 * the caller) contains coefficients for both sets of existentials,
4752 * first those in "ma" and then those in "src".
4753 * f, c1, c2 and g are temporary objects that have been initialized
4756 * Let src represent the expression
4758 * (a(p) + f_u u + b v + f_w w + c(divs))/d
4760 * and let ma represent the expressions
4762 * v_i = (r_i(p) + s_i(y) + t_i(divs'))/m_i
4764 * We start out with the following expression for dst:
4766 * (a(p) + f_u u + 0 y + f_w w + 0 divs' + c(divs) + f \sum_i b_i v_i)/d
4768 * with the multiplication factor f initially equal to 1
4769 * and f \sum_i b_i v_i kept separately.
4770 * For each x_i that we substitute, we multiply the numerator
4771 * (and denominator) of dst by c_1 = m_i and add the numerator
4772 * of the x_i expression multiplied by c_2 = f b_i,
4773 * after removing the common factors of c_1 and c_2.
4774 * The multiplication factor f also needs to be multiplied by c_1
4775 * for the next x_j, j > i.
4777 void isl_seq_preimage(isl_int
*dst
, isl_int
*src
,
4778 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
,
4779 int n_div_ma
, int n_div_bmap
,
4780 isl_int f
, isl_int c1
, isl_int c2
, isl_int g
, int has_denom
)
4783 int n_param
, n_in
, n_out
;
4786 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
4787 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
4788 n_out
= isl_multi_aff_dim(ma
, isl_dim_out
);
4790 isl_seq_cpy(dst
, src
, has_denom
+ 1 + n_param
+ n_before
);
4791 o_dst
= o_src
= has_denom
+ 1 + n_param
+ n_before
;
4792 isl_seq_clr(dst
+ o_dst
, n_in
);
4795 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_after
);
4798 isl_seq_clr(dst
+ o_dst
, n_div_ma
);
4800 isl_seq_cpy(dst
+ o_dst
, src
+ o_src
, n_div_bmap
);
4802 isl_int_set_si(f
, 1);
4804 for (i
= 0; i
< n_out
; ++i
) {
4805 int offset
= has_denom
+ 1 + n_param
+ n_before
+ i
;
4807 if (isl_int_is_zero(src
[offset
]))
4809 isl_int_set(c1
, ma
->p
[i
]->v
->el
[0]);
4810 isl_int_mul(c2
, f
, src
[offset
]);
4811 isl_int_gcd(g
, c1
, c2
);
4812 isl_int_divexact(c1
, c1
, g
);
4813 isl_int_divexact(c2
, c2
, g
);
4815 isl_int_mul(f
, f
, c1
);
4818 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
4819 c2
, ma
->p
[i
]->v
->el
+ o_src
, 1 + n_param
);
4820 o_dst
+= 1 + n_param
;
4821 o_src
+= 1 + n_param
;
4822 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_before
);
4824 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
4825 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_in
);
4828 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_after
);
4830 isl_seq_combine(dst
+ o_dst
, c1
, dst
+ o_dst
,
4831 c2
, ma
->p
[i
]->v
->el
+ o_src
, n_div_ma
);
4834 isl_seq_scale(dst
+ o_dst
, dst
+ o_dst
, c1
, n_div_bmap
);
4836 isl_int_mul(dst
[0], dst
[0], c1
);
4840 /* Compute the pullback of "aff" by the function represented by "ma".
4841 * In other words, plug in "ma" in "aff". The result is an affine expression
4842 * defined over the domain space of "ma".
4844 * If "aff" is represented by
4846 * (a(p) + b x + c(divs))/d
4848 * and ma is represented by
4850 * x = D(p) + F(y) + G(divs')
4852 * then the result is
4854 * (a(p) + b D(p) + b F(y) + b G(divs') + c(divs))/d
4856 * The divs in the local space of the input are similarly adjusted
4857 * through a call to isl_local_space_preimage_multi_aff.
4859 __isl_give isl_aff
*isl_aff_pullback_multi_aff(__isl_take isl_aff
*aff
,
4860 __isl_take isl_multi_aff
*ma
)
4862 isl_aff
*res
= NULL
;
4863 isl_local_space
*ls
;
4864 int n_div_aff
, n_div_ma
;
4865 isl_int f
, c1
, c2
, g
;
4867 ma
= isl_multi_aff_align_divs(ma
);
4871 n_div_aff
= isl_aff_dim(aff
, isl_dim_div
);
4872 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
4874 ls
= isl_aff_get_domain_local_space(aff
);
4875 ls
= isl_local_space_preimage_multi_aff(ls
, isl_multi_aff_copy(ma
));
4876 res
= isl_aff_alloc(ls
);
4885 isl_seq_preimage(res
->v
->el
, aff
->v
->el
, ma
, 0, 0, n_div_ma
, n_div_aff
,
4894 isl_multi_aff_free(ma
);
4895 res
= isl_aff_normalize(res
);
4899 isl_multi_aff_free(ma
);
4904 /* Compute the pullback of "ma1" by the function represented by "ma2".
4905 * In other words, plug in "ma2" in "ma1".
4907 * The parameters of "ma1" and "ma2" are assumed to have been aligned.
4909 static __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff_aligned(
4910 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
4913 isl_space
*space
= NULL
;
4915 ma2
= isl_multi_aff_align_divs(ma2
);
4916 ma1
= isl_multi_aff_cow(ma1
);
4920 space
= isl_space_join(isl_multi_aff_get_space(ma2
),
4921 isl_multi_aff_get_space(ma1
));
4923 for (i
= 0; i
< ma1
->n
; ++i
) {
4924 ma1
->p
[i
] = isl_aff_pullback_multi_aff(ma1
->p
[i
],
4925 isl_multi_aff_copy(ma2
));
4930 ma1
= isl_multi_aff_reset_space(ma1
, space
);
4931 isl_multi_aff_free(ma2
);
4934 isl_space_free(space
);
4935 isl_multi_aff_free(ma2
);
4936 isl_multi_aff_free(ma1
);
4940 /* Compute the pullback of "ma1" by the function represented by "ma2".
4941 * In other words, plug in "ma2" in "ma1".
4943 __isl_give isl_multi_aff
*isl_multi_aff_pullback_multi_aff(
4944 __isl_take isl_multi_aff
*ma1
, __isl_take isl_multi_aff
*ma2
)
4946 return isl_multi_aff_align_params_multi_multi_and(ma1
, ma2
,
4947 &isl_multi_aff_pullback_multi_aff_aligned
);
4950 /* Extend the local space of "dst" to include the divs
4951 * in the local space of "src".
4953 __isl_give isl_aff
*isl_aff_align_divs(__isl_take isl_aff
*dst
,
4954 __isl_keep isl_aff
*src
)
4962 return isl_aff_free(dst
);
4964 ctx
= isl_aff_get_ctx(src
);
4965 if (!isl_space_is_equal(src
->ls
->dim
, dst
->ls
->dim
))
4966 isl_die(ctx
, isl_error_invalid
,
4967 "spaces don't match", goto error
);
4969 if (src
->ls
->div
->n_row
== 0)
4972 exp1
= isl_alloc_array(ctx
, int, src
->ls
->div
->n_row
);
4973 exp2
= isl_alloc_array(ctx
, int, dst
->ls
->div
->n_row
);
4974 if (!exp1
|| (dst
->ls
->div
->n_row
&& !exp2
))
4977 div
= isl_merge_divs(src
->ls
->div
, dst
->ls
->div
, exp1
, exp2
);
4978 dst
= isl_aff_expand_divs(dst
, div
, exp2
);
4986 return isl_aff_free(dst
);
4989 /* Adjust the local spaces of the affine expressions in "maff"
4990 * such that they all have the save divs.
4992 __isl_give isl_multi_aff
*isl_multi_aff_align_divs(
4993 __isl_take isl_multi_aff
*maff
)
5001 maff
= isl_multi_aff_cow(maff
);
5005 for (i
= 1; i
< maff
->n
; ++i
)
5006 maff
->p
[0] = isl_aff_align_divs(maff
->p
[0], maff
->p
[i
]);
5007 for (i
= 1; i
< maff
->n
; ++i
) {
5008 maff
->p
[i
] = isl_aff_align_divs(maff
->p
[i
], maff
->p
[0]);
5010 return isl_multi_aff_free(maff
);
5016 __isl_give isl_aff
*isl_aff_lift(__isl_take isl_aff
*aff
)
5018 aff
= isl_aff_cow(aff
);
5022 aff
->ls
= isl_local_space_lift(aff
->ls
);
5024 return isl_aff_free(aff
);
5029 /* Lift "maff" to a space with extra dimensions such that the result
5030 * has no more existentially quantified variables.
5031 * If "ls" is not NULL, then *ls is assigned the local space that lies
5032 * at the basis of the lifting applied to "maff".
5034 __isl_give isl_multi_aff
*isl_multi_aff_lift(__isl_take isl_multi_aff
*maff
,
5035 __isl_give isl_local_space
**ls
)
5049 isl_space
*space
= isl_multi_aff_get_domain_space(maff
);
5050 *ls
= isl_local_space_from_space(space
);
5052 return isl_multi_aff_free(maff
);
5057 maff
= isl_multi_aff_cow(maff
);
5058 maff
= isl_multi_aff_align_divs(maff
);
5062 n_div
= isl_aff_dim(maff
->p
[0], isl_dim_div
);
5063 space
= isl_multi_aff_get_space(maff
);
5064 space
= isl_space_lift(isl_space_domain(space
), n_div
);
5065 space
= isl_space_extend_domain_with_range(space
,
5066 isl_multi_aff_get_space(maff
));
5068 return isl_multi_aff_free(maff
);
5069 isl_space_free(maff
->space
);
5070 maff
->space
= space
;
5073 *ls
= isl_aff_get_domain_local_space(maff
->p
[0]);
5075 return isl_multi_aff_free(maff
);
5078 for (i
= 0; i
< maff
->n
; ++i
) {
5079 maff
->p
[i
] = isl_aff_lift(maff
->p
[i
]);
5087 isl_local_space_free(*ls
);
5088 return isl_multi_aff_free(maff
);
5092 /* Extract an isl_pw_aff corresponding to output dimension "pos" of "pma".
5094 __isl_give isl_pw_aff
*isl_pw_multi_aff_get_pw_aff(
5095 __isl_keep isl_pw_multi_aff
*pma
, int pos
)
5105 n_out
= isl_pw_multi_aff_dim(pma
, isl_dim_out
);
5106 if (pos
< 0 || pos
>= n_out
)
5107 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5108 "index out of bounds", return NULL
);
5110 space
= isl_pw_multi_aff_get_space(pma
);
5111 space
= isl_space_drop_dims(space
, isl_dim_out
,
5112 pos
+ 1, n_out
- pos
- 1);
5113 space
= isl_space_drop_dims(space
, isl_dim_out
, 0, pos
);
5115 pa
= isl_pw_aff_alloc_size(space
, pma
->n
);
5116 for (i
= 0; i
< pma
->n
; ++i
) {
5118 aff
= isl_multi_aff_get_aff(pma
->p
[i
].maff
, pos
);
5119 pa
= isl_pw_aff_add_piece(pa
, isl_set_copy(pma
->p
[i
].set
), aff
);
5125 /* Return an isl_pw_multi_aff with the given "set" as domain and
5126 * an unnamed zero-dimensional range.
5128 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_domain(
5129 __isl_take isl_set
*set
)
5134 space
= isl_set_get_space(set
);
5135 space
= isl_space_from_domain(space
);
5136 ma
= isl_multi_aff_zero(space
);
5137 return isl_pw_multi_aff_alloc(set
, ma
);
5140 /* Add an isl_pw_multi_aff with the given "set" as domain and
5141 * an unnamed zero-dimensional range to *user.
5143 static int add_pw_multi_aff_from_domain(__isl_take isl_set
*set
, void *user
)
5145 isl_union_pw_multi_aff
**upma
= user
;
5146 isl_pw_multi_aff
*pma
;
5148 pma
= isl_pw_multi_aff_from_domain(set
);
5149 *upma
= isl_union_pw_multi_aff_add_pw_multi_aff(*upma
, pma
);
5154 /* Return an isl_union_pw_multi_aff with the given "uset" as domain and
5155 * an unnamed zero-dimensional range.
5157 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_from_domain(
5158 __isl_take isl_union_set
*uset
)
5161 isl_union_pw_multi_aff
*upma
;
5166 space
= isl_union_set_get_space(uset
);
5167 upma
= isl_union_pw_multi_aff_empty(space
);
5169 if (isl_union_set_foreach_set(uset
,
5170 &add_pw_multi_aff_from_domain
, &upma
) < 0)
5173 isl_union_set_free(uset
);
5176 isl_union_set_free(uset
);
5177 isl_union_pw_multi_aff_free(upma
);
5181 /* Convert "pma" to an isl_map and add it to *umap.
5183 static int map_from_pw_multi_aff(__isl_take isl_pw_multi_aff
*pma
, void *user
)
5185 isl_union_map
**umap
= user
;
5188 map
= isl_map_from_pw_multi_aff(pma
);
5189 *umap
= isl_union_map_add_map(*umap
, map
);
5194 /* Construct a union map mapping the domain of the union
5195 * piecewise multi-affine expression to its range, with each dimension
5196 * in the range equated to the corresponding affine expression on its cell.
5198 __isl_give isl_union_map
*isl_union_map_from_union_pw_multi_aff(
5199 __isl_take isl_union_pw_multi_aff
*upma
)
5202 isl_union_map
*umap
;
5207 space
= isl_union_pw_multi_aff_get_space(upma
);
5208 umap
= isl_union_map_empty(space
);
5210 if (isl_union_pw_multi_aff_foreach_pw_multi_aff(upma
,
5211 &map_from_pw_multi_aff
, &umap
) < 0)
5214 isl_union_pw_multi_aff_free(upma
);
5217 isl_union_pw_multi_aff_free(upma
);
5218 isl_union_map_free(umap
);
5222 /* Local data for bin_entry and the callback "fn".
5224 struct isl_union_pw_multi_aff_bin_data
{
5225 isl_union_pw_multi_aff
*upma2
;
5226 isl_union_pw_multi_aff
*res
;
5227 isl_pw_multi_aff
*pma
;
5228 int (*fn
)(void **entry
, void *user
);
5231 /* Given an isl_pw_multi_aff from upma1, store it in data->pma
5232 * and call data->fn for each isl_pw_multi_aff in data->upma2.
5234 static int bin_entry(void **entry
, void *user
)
5236 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5237 isl_pw_multi_aff
*pma
= *entry
;
5240 if (isl_hash_table_foreach(data
->upma2
->dim
->ctx
, &data
->upma2
->table
,
5241 data
->fn
, data
) < 0)
5247 /* Call "fn" on each pair of isl_pw_multi_affs in "upma1" and "upma2".
5248 * The isl_pw_multi_aff from upma1 is stored in data->pma (where data is
5249 * passed as user field) and the isl_pw_multi_aff from upma2 is available
5250 * as *entry. The callback should adjust data->res if desired.
5252 static __isl_give isl_union_pw_multi_aff
*bin_op(
5253 __isl_take isl_union_pw_multi_aff
*upma1
,
5254 __isl_take isl_union_pw_multi_aff
*upma2
,
5255 int (*fn
)(void **entry
, void *user
))
5258 struct isl_union_pw_multi_aff_bin_data data
= { NULL
, NULL
, NULL
, fn
};
5260 space
= isl_union_pw_multi_aff_get_space(upma2
);
5261 upma1
= isl_union_pw_multi_aff_align_params(upma1
, space
);
5262 space
= isl_union_pw_multi_aff_get_space(upma1
);
5263 upma2
= isl_union_pw_multi_aff_align_params(upma2
, space
);
5265 if (!upma1
|| !upma2
)
5269 data
.res
= isl_union_pw_multi_aff_alloc(isl_space_copy(upma1
->dim
),
5271 if (isl_hash_table_foreach(upma1
->dim
->ctx
, &upma1
->table
,
5272 &bin_entry
, &data
) < 0)
5275 isl_union_pw_multi_aff_free(upma1
);
5276 isl_union_pw_multi_aff_free(upma2
);
5279 isl_union_pw_multi_aff_free(upma1
);
5280 isl_union_pw_multi_aff_free(upma2
);
5281 isl_union_pw_multi_aff_free(data
.res
);
5285 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5286 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5288 static __isl_give isl_pw_multi_aff
*pw_multi_aff_range_product(
5289 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5293 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5294 isl_pw_multi_aff_get_space(pma2
));
5295 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5296 &isl_multi_aff_range_product
);
5299 /* Given two isl_pw_multi_affs A -> B and C -> D,
5300 * construct an isl_pw_multi_aff (A * C) -> [B -> D].
5302 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_range_product(
5303 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5305 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5306 &pw_multi_aff_range_product
);
5309 /* Given two aligned isl_pw_multi_affs A -> B and C -> D,
5310 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5312 static __isl_give isl_pw_multi_aff
*pw_multi_aff_flat_range_product(
5313 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5317 space
= isl_space_range_product(isl_pw_multi_aff_get_space(pma1
),
5318 isl_pw_multi_aff_get_space(pma2
));
5319 space
= isl_space_flatten_range(space
);
5320 return isl_pw_multi_aff_on_shared_domain_in(pma1
, pma2
, space
,
5321 &isl_multi_aff_flat_range_product
);
5324 /* Given two isl_pw_multi_affs A -> B and C -> D,
5325 * construct an isl_pw_multi_aff (A * C) -> (B, D).
5327 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_flat_range_product(
5328 __isl_take isl_pw_multi_aff
*pma1
, __isl_take isl_pw_multi_aff
*pma2
)
5330 return isl_pw_multi_aff_align_params_pw_pw_and(pma1
, pma2
,
5331 &pw_multi_aff_flat_range_product
);
5334 /* If data->pma and *entry have the same domain space, then compute
5335 * their flat range product and the result to data->res.
5337 static int flat_range_product_entry(void **entry
, void *user
)
5339 struct isl_union_pw_multi_aff_bin_data
*data
= user
;
5340 isl_pw_multi_aff
*pma2
= *entry
;
5342 if (!isl_space_tuple_match(data
->pma
->dim
, isl_dim_in
,
5343 pma2
->dim
, isl_dim_in
))
5346 pma2
= isl_pw_multi_aff_flat_range_product(
5347 isl_pw_multi_aff_copy(data
->pma
),
5348 isl_pw_multi_aff_copy(pma2
));
5350 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma2
);
5355 /* Given two isl_union_pw_multi_affs A -> B and C -> D,
5356 * construct an isl_union_pw_multi_aff (A * C) -> (B, D).
5358 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_flat_range_product(
5359 __isl_take isl_union_pw_multi_aff
*upma1
,
5360 __isl_take isl_union_pw_multi_aff
*upma2
)
5362 return bin_op(upma1
, upma2
, &flat_range_product_entry
);
5365 /* Replace the affine expressions at position "pos" in "pma" by "pa".
5366 * The parameters are assumed to have been aligned.
5368 * The implementation essentially performs an isl_pw_*_on_shared_domain,
5369 * except that it works on two different isl_pw_* types.
5371 static __isl_give isl_pw_multi_aff
*pw_multi_aff_set_pw_aff(
5372 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
5373 __isl_take isl_pw_aff
*pa
)
5376 isl_pw_multi_aff
*res
= NULL
;
5381 if (!isl_space_tuple_match(pma
->dim
, isl_dim_in
, pa
->dim
, isl_dim_in
))
5382 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5383 "domains don't match", goto error
);
5384 if (pos
>= isl_pw_multi_aff_dim(pma
, isl_dim_out
))
5385 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5386 "index out of bounds", goto error
);
5389 res
= isl_pw_multi_aff_alloc_size(isl_pw_multi_aff_get_space(pma
), n
);
5391 for (i
= 0; i
< pma
->n
; ++i
) {
5392 for (j
= 0; j
< pa
->n
; ++j
) {
5394 isl_multi_aff
*res_ij
;
5397 common
= isl_set_intersect(isl_set_copy(pma
->p
[i
].set
),
5398 isl_set_copy(pa
->p
[j
].set
));
5399 empty
= isl_set_plain_is_empty(common
);
5400 if (empty
< 0 || empty
) {
5401 isl_set_free(common
);
5407 res_ij
= isl_multi_aff_set_aff(
5408 isl_multi_aff_copy(pma
->p
[i
].maff
), pos
,
5409 isl_aff_copy(pa
->p
[j
].aff
));
5410 res_ij
= isl_multi_aff_gist(res_ij
,
5411 isl_set_copy(common
));
5413 res
= isl_pw_multi_aff_add_piece(res
, common
, res_ij
);
5417 isl_pw_multi_aff_free(pma
);
5418 isl_pw_aff_free(pa
);
5421 isl_pw_multi_aff_free(pma
);
5422 isl_pw_aff_free(pa
);
5423 return isl_pw_multi_aff_free(res
);
5426 /* Replace the affine expressions at position "pos" in "pma" by "pa".
5428 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_set_pw_aff(
5429 __isl_take isl_pw_multi_aff
*pma
, unsigned pos
,
5430 __isl_take isl_pw_aff
*pa
)
5434 if (isl_space_match(pma
->dim
, isl_dim_param
, pa
->dim
, isl_dim_param
))
5435 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
5436 if (!isl_space_has_named_params(pma
->dim
) ||
5437 !isl_space_has_named_params(pa
->dim
))
5438 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5439 "unaligned unnamed parameters", goto error
);
5440 pma
= isl_pw_multi_aff_align_params(pma
, isl_pw_aff_get_space(pa
));
5441 pa
= isl_pw_aff_align_params(pa
, isl_pw_multi_aff_get_space(pma
));
5442 return pw_multi_aff_set_pw_aff(pma
, pos
, pa
);
5444 isl_pw_multi_aff_free(pma
);
5445 isl_pw_aff_free(pa
);
5449 /* Do the parameters of "pa" match those of "space"?
5451 int isl_pw_aff_matching_params(__isl_keep isl_pw_aff
*pa
,
5452 __isl_keep isl_space
*space
)
5454 isl_space
*pa_space
;
5460 pa_space
= isl_pw_aff_get_space(pa
);
5462 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
5464 isl_space_free(pa_space
);
5468 /* Check that the domain space of "pa" matches "space".
5470 * Return 0 on success and -1 on error.
5472 int isl_pw_aff_check_match_domain_space(__isl_keep isl_pw_aff
*pa
,
5473 __isl_keep isl_space
*space
)
5475 isl_space
*pa_space
;
5481 pa_space
= isl_pw_aff_get_space(pa
);
5483 match
= isl_space_match(space
, isl_dim_param
, pa_space
, isl_dim_param
);
5487 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
5488 "parameters don't match", goto error
);
5489 match
= isl_space_tuple_match(space
, isl_dim_in
, pa_space
, isl_dim_in
);
5493 isl_die(isl_pw_aff_get_ctx(pa
), isl_error_invalid
,
5494 "domains don't match", goto error
);
5495 isl_space_free(pa_space
);
5498 isl_space_free(pa_space
);
5505 #include <isl_multi_templ.c>
5507 /* Scale the elements of "pma" by the corresponding elements of "mv".
5509 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_scale_multi_val(
5510 __isl_take isl_pw_multi_aff
*pma
, __isl_take isl_multi_val
*mv
)
5514 pma
= isl_pw_multi_aff_cow(pma
);
5517 if (!isl_space_tuple_match(pma
->dim
, isl_dim_out
,
5518 mv
->space
, isl_dim_set
))
5519 isl_die(isl_pw_multi_aff_get_ctx(pma
), isl_error_invalid
,
5520 "spaces don't match", goto error
);
5521 if (!isl_space_match(pma
->dim
, isl_dim_param
,
5522 mv
->space
, isl_dim_param
)) {
5523 pma
= isl_pw_multi_aff_align_params(pma
,
5524 isl_multi_val_get_space(mv
));
5525 mv
= isl_multi_val_align_params(mv
,
5526 isl_pw_multi_aff_get_space(pma
));
5531 for (i
= 0; i
< pma
->n
; ++i
) {
5532 pma
->p
[i
].maff
= isl_multi_aff_scale_multi_val(pma
->p
[i
].maff
,
5533 isl_multi_val_copy(mv
));
5534 if (!pma
->p
[i
].maff
)
5538 isl_multi_val_free(mv
);
5541 isl_multi_val_free(mv
);
5542 isl_pw_multi_aff_free(pma
);
5546 /* Internal data structure for isl_union_pw_multi_aff_scale_multi_val.
5547 * mv contains the mv argument.
5548 * res collects the results.
5550 struct isl_union_pw_multi_aff_scale_multi_val_data
{
5552 isl_union_pw_multi_aff
*res
;
5555 /* This function is called for each entry of an isl_union_pw_multi_aff.
5556 * If the space of the entry matches that of data->mv,
5557 * then apply isl_pw_multi_aff_scale_multi_val and add the result
5560 static int union_pw_multi_aff_scale_multi_val_entry(void **entry
, void *user
)
5562 struct isl_union_pw_multi_aff_scale_multi_val_data
*data
= user
;
5563 isl_pw_multi_aff
*pma
= *entry
;
5567 if (!isl_space_tuple_match(pma
->dim
, isl_dim_out
,
5568 data
->mv
->space
, isl_dim_set
))
5571 pma
= isl_pw_multi_aff_copy(pma
);
5572 pma
= isl_pw_multi_aff_scale_multi_val(pma
,
5573 isl_multi_val_copy(data
->mv
));
5574 data
->res
= isl_union_pw_multi_aff_add_pw_multi_aff(data
->res
, pma
);
5581 /* Scale the elements of "upma" by the corresponding elements of "mv",
5582 * for those entries that match the space of "mv".
5584 __isl_give isl_union_pw_multi_aff
*isl_union_pw_multi_aff_scale_multi_val(
5585 __isl_take isl_union_pw_multi_aff
*upma
, __isl_take isl_multi_val
*mv
)
5587 struct isl_union_pw_multi_aff_scale_multi_val_data data
;
5589 upma
= isl_union_pw_multi_aff_align_params(upma
,
5590 isl_multi_val_get_space(mv
));
5591 mv
= isl_multi_val_align_params(mv
,
5592 isl_union_pw_multi_aff_get_space(upma
));
5597 data
.res
= isl_union_pw_multi_aff_alloc(isl_space_copy(upma
->dim
),
5599 if (isl_hash_table_foreach(upma
->dim
->ctx
, &upma
->table
,
5600 &union_pw_multi_aff_scale_multi_val_entry
, &data
) < 0)
5603 isl_multi_val_free(mv
);
5604 isl_union_pw_multi_aff_free(upma
);
5607 isl_multi_val_free(mv
);
5608 isl_union_pw_multi_aff_free(upma
);
5612 /* Construct and return a piecewise multi affine expression
5613 * in the given space with value zero in each of the output dimensions and
5614 * a universe domain.
5616 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_zero(__isl_take isl_space
*space
)
5618 return isl_pw_multi_aff_from_multi_aff(isl_multi_aff_zero(space
));
5621 /* Construct and return a piecewise multi affine expression
5622 * that is equal to the given piecewise affine expression.
5624 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_pw_aff(
5625 __isl_take isl_pw_aff
*pa
)
5629 isl_pw_multi_aff
*pma
;
5634 space
= isl_pw_aff_get_space(pa
);
5635 pma
= isl_pw_multi_aff_alloc_size(space
, pa
->n
);
5637 for (i
= 0; i
< pa
->n
; ++i
) {
5641 set
= isl_set_copy(pa
->p
[i
].set
);
5642 ma
= isl_multi_aff_from_aff(isl_aff_copy(pa
->p
[i
].aff
));
5643 pma
= isl_pw_multi_aff_add_piece(pma
, set
, ma
);
5646 isl_pw_aff_free(pa
);
5650 /* Construct and return a piecewise multi affine expression
5651 * that is equal to the given multi piecewise affine expression
5652 * on the shared domain of the piecewise affine expressions.
5654 __isl_give isl_pw_multi_aff
*isl_pw_multi_aff_from_multi_pw_aff(
5655 __isl_take isl_multi_pw_aff
*mpa
)
5660 isl_pw_multi_aff
*pma
;
5665 space
= isl_multi_pw_aff_get_space(mpa
);
5668 isl_multi_pw_aff_free(mpa
);
5669 return isl_pw_multi_aff_zero(space
);
5672 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, 0);
5673 pma
= isl_pw_multi_aff_from_pw_aff(pa
);
5675 for (i
= 1; i
< mpa
->n
; ++i
) {
5676 isl_pw_multi_aff
*pma_i
;
5678 pa
= isl_multi_pw_aff_get_pw_aff(mpa
, i
);
5679 pma_i
= isl_pw_multi_aff_from_pw_aff(pa
);
5680 pma
= isl_pw_multi_aff_range_product(pma
, pma_i
);
5683 pma
= isl_pw_multi_aff_reset_space(pma
, space
);
5685 isl_multi_pw_aff_free(mpa
);